{"meta":{"query_hash":"3a7cc1195425","filters":{"venue":"Quantum Information and Computation"},"cohort_total":143,"direct_labels_cover":0,"predictions_cover":143,"exported":143,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3a7cc1195425","api":"https://metacan.xera.ac/api/v1/cohort?venue=Quantum+Information+and+Computation"},"results":[{"id":"W1479892629","doi":"10.26421/qic14.9-10-1","title":"Fault-tolerant renormalization group decoder for abelian topological codes","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Abelian group; Generalization; Decoding methods; Logarithm; Mathematics; Code (set theory); Discrete mathematics; Fault tolerance; Computer science; Matching (statistics); Algorithm; Combinatorics; Topology (electrical circuits); Set (abstract data type)","score_opus":0.010078647771845322,"score_gpt":0.24871246661697136,"score_spread":0.23863381884512602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479892629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07348453,0.000030324116,0.9244767,0.00093823177,0.0003371108,0.00024397501,0.0000042696583,0.00026060248,0.00022425699],"genre_scores_gemma":[0.90284854,0.000010364482,0.09571953,0.0011991503,0.000076262135,0.000021092299,0.000113314396,0.000005229775,0.00000651454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.00007451185,0.000414605,0.00019502974,0.00019930274,0.00022553753],"domain_scores_gemma":[0.9992324,0.00017709193,0.00020393722,0.00014618231,0.00015360324,0.00008675207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047375634,0.00015043622,0.00016624977,0.0001601958,0.00036610084,0.00037573956,0.0002149099,0.00008444213,0.0000022246538],"category_scores_gemma":[0.00007176915,0.00012740938,0.000049844817,0.00022077783,0.00004089839,0.00097243325,0.00007584316,0.00008951204,0.000014305904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001700207,0.000029679364,0.000094791,0.00006520053,0.0000090558915,2.006473e-7,0.001533748,0.05840595,0.000030616953,0.4659457,0.00044232665,0.47342575],"study_design_scores_gemma":[0.00060164445,0.000254061,0.0022178213,0.000020547059,0.0000044350754,0.000018188637,0.00005399354,0.9517728,0.00004026475,0.034218423,0.010618271,0.0001795536],"about_ca_topic_score_codex":0.000016101301,"about_ca_topic_score_gemma":0.0000033211645,"teacher_disagreement_score":0.8933669,"about_ca_system_score_codex":0.000016816122,"about_ca_system_score_gemma":0.000018791863,"threshold_uncertainty_score":0.5195604},"labels":[],"label_agreement":null},{"id":"W1480910789","doi":"10.26421/qic14.15-16-2","title":"Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Unitary state; Electronic circuit; State (computer science); Scaling; Mathematics; Quantum circuit; Computer science; Algorithm; Topology (electrical circuits); Discrete mathematics; Quantum; Combinatorics; Physics; Quantum mechanics; Quantum error correction","score_opus":0.007566230245772135,"score_gpt":0.24024921081578604,"score_spread":0.2326829805700139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480910789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.344826,0.000011119199,0.6540509,0.0001905925,0.00021096942,0.000094516676,0.0000021296273,0.00009606361,0.00051767885],"genre_scores_gemma":[0.96580327,0.0000041413123,0.033821736,0.0002735281,0.000040969862,0.0000043306736,0.000044138942,0.0000049845758,0.0000029051691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879736,0.00007313646,0.00052977074,0.00016632471,0.00025894,0.00017448845],"domain_scores_gemma":[0.9989927,0.00017542916,0.00037276628,0.00020746188,0.00017773977,0.00007392992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003207777,0.00015122982,0.00020044923,0.00025028424,0.00021496884,0.00027903606,0.00024702697,0.00006320892,0.0000019899417],"category_scores_gemma":[0.000058830297,0.00014186617,0.000046924204,0.00031238678,0.00007138827,0.0011267287,0.00011502904,0.00010188088,0.000015534797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003280463,0.000093627656,0.00038165363,0.00029781734,0.000024181216,0.0000015023401,0.005046959,0.04680573,0.00075950177,0.16345164,0.00018162993,0.782923],"study_design_scores_gemma":[0.0004056988,0.00034850262,0.005995454,0.00007284549,0.000007478703,0.000032069725,0.00005445552,0.97735316,0.0005694895,0.014268163,0.00072508975,0.00016757098],"about_ca_topic_score_codex":0.000023563101,"about_ca_topic_score_gemma":0.0000015670133,"teacher_disagreement_score":0.9305475,"about_ca_system_score_codex":0.00001749848,"about_ca_system_score_gemma":0.000030626667,"threshold_uncertainty_score":0.57851344},"labels":[],"label_agreement":null},{"id":"W1491569431","doi":"10.26421/qic5.1-6","title":"Notes on super-operator norms induced by Schatten norms","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Infimum and supremum; Operator (biology); Combinatorics; Mathematics; Norm (philosophy); Operator norm; Hermitian matrix; Hilbert space; Discrete mathematics; Pure mathematics; Philosophy","score_opus":0.012615594636457195,"score_gpt":0.24258919583192476,"score_spread":0.22997360119546756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491569431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4962093,0.000032955206,0.4966257,0.004402032,0.00025894772,0.00027139165,0.000011155396,0.0003637724,0.0018247457],"genre_scores_gemma":[0.98974365,0.000034454028,0.0032043862,0.0067943824,0.000047011003,0.000025474124,0.00013553533,0.0000068739446,0.000008243103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840814,0.000038639675,0.0006214853,0.000188782,0.00046421684,0.00027876286],"domain_scores_gemma":[0.9990787,0.0000821836,0.00022582318,0.00024502323,0.00019951363,0.0001687905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029784042,0.00023502737,0.00018522293,0.00040883495,0.00033339352,0.0007121047,0.0003195353,0.00011563282,0.000026232818],"category_scores_gemma":[0.000040755513,0.00019292756,0.000066349654,0.0005359084,0.000038271522,0.006326227,0.00007389538,0.00019515434,0.0007646611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004142499,0.00013166899,0.00031247406,0.00005738775,0.000032229567,4.15276e-7,0.007505438,0.0030927244,0.0005778542,0.35371563,0.0072680027,0.62726474],"study_design_scores_gemma":[0.0012701326,0.00036401814,0.003893028,0.000029646684,0.0000052338564,0.000014387027,0.0004182451,0.956534,0.002640946,0.0017615831,0.032606807,0.0004619251],"about_ca_topic_score_codex":0.00002420131,"about_ca_topic_score_gemma":0.0000039589336,"teacher_disagreement_score":0.9534413,"about_ca_system_score_codex":0.000046543195,"about_ca_system_score_gemma":0.00005227133,"threshold_uncertainty_score":0.9828427},"labels":[],"label_agreement":null},{"id":"W1500361768","doi":"10.26421/qic8.5-5","title":"An extremal result for geometries in the one-way measurement model","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Embedding; Mathematics; Unitary state; Combinatorics; Flow (mathematics); Discrete mathematics; Graph; Computer science; Mathematical analysis; Geometry","score_opus":0.057444445662429504,"score_gpt":0.2683101966550184,"score_spread":0.21086575099258886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500361768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23253268,0.0000386955,0.7661385,0.0008035774,0.00007217738,0.00025016462,0.0000031693467,0.00007132393,0.00008970922],"genre_scores_gemma":[0.9568425,0.000013466559,0.04239373,0.0006650854,0.00003246372,0.000024639447,0.000023445089,0.0000031637228,0.0000014983467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987827,0.000055864206,0.00036872647,0.00015073414,0.0004552251,0.00018673131],"domain_scores_gemma":[0.99933004,0.000092512986,0.00014013464,0.00018664393,0.0002051466,0.0000455204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093130034,0.00011241,0.00011515782,0.00024546168,0.0003658956,0.00022959102,0.00031741583,0.000044272263,2.7462806e-7],"category_scores_gemma":[0.00006110795,0.0000858642,0.00003300753,0.0003882965,0.0000377848,0.0012545406,0.00003556164,0.00010909501,0.0000033487238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004276504,0.00012444583,0.00010137608,0.000055456956,0.000008687326,0.0000012386563,0.026800552,0.6494771,0.000070246875,0.08394612,0.00046647715,0.23890549],"study_design_scores_gemma":[0.00056878995,0.00017653544,0.0063195745,0.00001525318,0.000002120283,0.000022374876,0.00019813175,0.97975,0.000042467393,0.012432002,0.000350829,0.00012195214],"about_ca_topic_score_codex":0.000021254547,"about_ca_topic_score_gemma":0.0000062068766,"teacher_disagreement_score":0.72430986,"about_ca_system_score_codex":0.00002746243,"about_ca_system_score_gemma":0.00007159312,"threshold_uncertainty_score":0.35014406},"labels":[],"label_agreement":null},{"id":"W1514575725","doi":"10.26421/qic10.5-6-12","title":"Exact quantum lower bound for Grover's problem","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Oracle; Mathematics; Intuition; Simple (philosophy); Quantum algorithm; Set (abstract data type); Combinatorics; Quantum; Discrete mathematics; Computer science; Quantum mechanics; Physics","score_opus":0.009243585197173913,"score_gpt":0.24577145728734529,"score_spread":0.23652787209017137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514575725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076153874,0.0000632129,0.9195265,0.002594397,0.00042957958,0.0004130293,0.0000056387426,0.00031992412,0.00049382553],"genre_scores_gemma":[0.9485247,0.000013608328,0.0494985,0.001783139,0.00009268936,0.000013709501,0.000053350315,0.000006011467,0.0000143091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870265,0.000035475914,0.0004632803,0.0002311491,0.00026571084,0.00030175768],"domain_scores_gemma":[0.9991598,0.000111140864,0.0002495129,0.00019000238,0.0001796262,0.00010990374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034970086,0.00019559926,0.00018496499,0.0002025888,0.00036424896,0.0006524022,0.00026973494,0.00007945304,0.000002031254],"category_scores_gemma":[0.000032077,0.00017665827,0.00007662091,0.00029668357,0.000029526971,0.0017573802,0.000054438555,0.00013162136,0.000023088858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034641147,0.00006565051,0.000013848053,0.000059344802,0.000012555782,0.0000012563752,0.001836649,0.015689012,0.000058391754,0.38380548,0.0026053225,0.59581786],"study_design_scores_gemma":[0.000625729,0.0005382286,0.0017621676,0.000030935178,0.0000047851954,0.000028167893,0.000040262876,0.87870425,0.000039364826,0.10814322,0.009859701,0.00022317254],"about_ca_topic_score_codex":0.000010200751,"about_ca_topic_score_gemma":6.310743e-7,"teacher_disagreement_score":0.87237084,"about_ca_system_score_codex":0.000030571224,"about_ca_system_score_gemma":0.00006586821,"threshold_uncertainty_score":0.7203915},"labels":[],"label_agreement":null},{"id":"W1522393113","doi":"10.5555/2685155.2685156","title":"The computational power of matchgates and the XY interaction on arbitrary graphs","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Universal set; Quantum computer; Mathematics; Quantum; Computation; Path (computing); Discrete mathematics; Graph; Set (abstract data type); Combinatorics; Topology (electrical circuits); Computer science; Quantum mechanics; Algorithm; Physics","score_opus":0.004914132702145928,"score_gpt":0.22189516212647112,"score_spread":0.21698102942432518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522393113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33464995,0.000063638916,0.66016954,0.0037951567,0.0003679314,0.00018891823,0.000001603807,0.00007145897,0.0006917959],"genre_scores_gemma":[0.99514276,0.000022553173,0.0039501,0.00084564625,0.000017784962,0.0000060291045,0.0000095986,0.000003090406,0.00000246333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989999,0.00014809893,0.00036884687,0.00011318753,0.00025372772,0.00011622934],"domain_scores_gemma":[0.9984407,0.0009874516,0.00028399887,0.00013762944,0.00011301077,0.00003722276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618447,0.00011176979,0.00012221509,0.00010697342,0.0004385825,0.00031902234,0.0001922839,0.00003300902,7.363314e-7],"category_scores_gemma":[0.000062612744,0.00006348261,0.000042174743,0.00019376821,0.00017214198,0.00051875354,0.00008167089,0.00015263032,0.0000069026187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004545431,0.00001013219,0.000025271778,0.000014466909,0.0000122687115,6.5981105e-8,0.0026548917,0.052459292,0.0000014333442,0.80065644,0.00014678683,0.14397347],"study_design_scores_gemma":[0.0005592205,0.00010830074,0.0033565972,0.00002297479,0.0000028140416,0.00001734622,0.00018237894,0.79422015,0.000015777727,0.2005832,0.0008666275,0.00006461955],"about_ca_topic_score_codex":0.00001780799,"about_ca_topic_score_gemma":8.0773094e-7,"teacher_disagreement_score":0.74176085,"about_ca_system_score_codex":0.0000066256916,"about_ca_system_score_gemma":0.00001777979,"threshold_uncertainty_score":0.33732662},"labels":[],"label_agreement":null},{"id":"W1532241042","doi":"10.26421/qic11.1-2-8","title":"A family of norms with applications in quantum information theory","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Transpose; Semidefinite programming; Constructive; Mathematics; Duality (order theory); Positive-definite matrix; Measure (data warehouse); Operator (biology); Semidefinite embedding; Quantum information; Quantum; Pure mathematics; Discrete mathematics; Algebra over a field; Applied mathematics; Computer science; Eigenvalues and eigenvectors; Mathematical optimization; Quantum mechanics; Physics","score_opus":0.013162264770525609,"score_gpt":0.21797159815324538,"score_spread":0.20480933338271978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532241042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1476461,0.00002957045,0.8449668,0.00004324866,0.00006567321,0.00044947868,0.0000075437065,0.00013721336,0.00665433],"genre_scores_gemma":[0.9867367,0.00003943499,0.012578103,0.00045631427,0.0000047974713,0.00008204604,0.00009695193,0.0000040988843,0.0000015139655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983857,0.00005809148,0.00087707205,0.000115220515,0.00035418218,0.00020971446],"domain_scores_gemma":[0.99870217,0.00007171768,0.0005617365,0.00026009622,0.00031562915,0.00008864889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052107486,0.00018336112,0.00020708794,0.00086284534,0.00012369717,0.00014537998,0.00031895068,0.00008655191,0.000008729268],"category_scores_gemma":[0.000018799523,0.00015004988,0.00004792215,0.0011170417,0.00010040851,0.008379963,0.00006775833,0.0001362776,0.000054259544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056686094,0.000048924037,0.0015203157,0.000094090516,0.000011787054,1.6641599e-7,0.012613149,0.0004975105,0.000008280618,0.93242896,0.00004346873,0.052676693],"study_design_scores_gemma":[0.0020581475,0.0005175564,0.16373296,0.0000896221,0.00001644003,0.000024087809,0.009111489,0.71817625,0.00037490216,0.10223998,0.003132454,0.00052611495],"about_ca_topic_score_codex":0.0000850371,"about_ca_topic_score_gemma":0.0000053191543,"teacher_disagreement_score":0.83909065,"about_ca_system_score_codex":0.000025468416,"about_ca_system_score_gemma":0.00009239028,"threshold_uncertainty_score":0.61188567},"labels":[],"label_agreement":null},{"id":"W1535391183","doi":"10.26421/qic13.11-12-4","title":"Subsystem surface codes with three-qubit check operators","year":2013,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Ferroelectric and Negative Capacitance Devices","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Intelligence Advanced Research Projects Activity; Defense Advanced Research Projects Agency","keywords":"Qubit; Error detection and correction; Hamiltonian (control theory); Toric code; Unitary transformation; Low-density parity-check code; Mathematics; Lattice (music); Decoding methods; Algorithm; Quantum mechanics; Physics; Topology (electrical circuits); Quantum computer; Combinatorics; Quantum","score_opus":0.01264190490511375,"score_gpt":0.21192658703639236,"score_spread":0.19928468213127862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535391183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7820177,0.0005037683,0.21484275,0.00004192223,0.00027468763,0.0004914472,0.000023636829,0.00032916327,0.0014748992],"genre_scores_gemma":[0.9978612,0.00016618492,0.0014999014,0.000066912,0.000032968688,0.00004866453,0.00029593444,0.000018608513,0.0000096305885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904203,0.000023048238,0.00040549392,0.00012829005,0.00022235847,0.00017877056],"domain_scores_gemma":[0.99937016,0.000041642863,0.00016040604,0.00011654349,0.00023788055,0.00007335966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012309726,0.00026623564,0.00028178547,0.000117479256,0.00008655645,0.00031414744,0.0000966446,0.00017124909,0.000015332806],"category_scores_gemma":[0.0000072702283,0.00022565907,0.00003119378,0.00017105807,0.0000380408,0.00088741706,0.00003112073,0.00030175314,0.00009675335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041772106,0.000014903487,0.0018605788,0.002685147,0.00021709233,0.0000014319836,0.005153755,0.9593824,0.0000782978,0.009997456,0.0027508044,0.017816372],"study_design_scores_gemma":[0.00029551925,0.00005391679,0.0033963085,0.00021337009,0.000020495392,0.000006749805,0.00063186785,0.9935313,0.00029826595,0.0007449287,0.00048891053,0.0003183656],"about_ca_topic_score_codex":0.000055445573,"about_ca_topic_score_gemma":0.000022781598,"teacher_disagreement_score":0.21584347,"about_ca_system_score_codex":0.00008089894,"about_ca_system_score_gemma":0.000045013432,"threshold_uncertainty_score":0.92021096},"labels":[],"label_agreement":null},{"id":"W1540106918","doi":"10.26421/qic12.11-12-10","title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Qubit; Fault tolerance; Computer science; Quantum computer; Algorithm; Overhead (engineering); Noise (video); Error detection and correction; Hamming bound; Code (set theory); Mathematics; Quantum; Set (abstract data type); Block code; Hamming code; Decoding methods; Physics; Quantum mechanics","score_opus":0.01386412253971376,"score_gpt":0.26585872440441627,"score_spread":0.2519946018647025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540106918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25160047,0.00041787743,0.74570185,0.0009992154,0.00059496996,0.00042223802,0.000008542662,0.0001226829,0.00013214104],"genre_scores_gemma":[0.9893727,0.000037665544,0.009463848,0.00087627064,0.00014645013,0.000039231516,0.00003812445,0.0000066014495,0.000019141853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889725,0.000034347097,0.00037392977,0.00016015691,0.0002498184,0.0002845177],"domain_scores_gemma":[0.99912566,0.00021915212,0.00021028308,0.00019396924,0.00014565123,0.00010526777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059335824,0.00016728077,0.00014192562,0.00009870311,0.0005662915,0.00055392453,0.00018630642,0.00006903508,0.0000012760049],"category_scores_gemma":[0.000034862027,0.00012026013,0.000047558795,0.00019365722,0.00005873707,0.0017568147,0.000101765836,0.0001185642,0.000013675428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020903794,0.00015808971,0.0011200488,0.00026360486,0.000086911,7.5819463e-7,0.03534445,0.15594836,0.00019107811,0.23848209,0.0063884333,0.56180716],"study_design_scores_gemma":[0.0005209384,0.00014791562,0.0054266257,0.000020056355,0.000011304878,0.00003516417,0.00012151435,0.9722487,0.00005085275,0.0025460718,0.01869671,0.00017419786],"about_ca_topic_score_codex":0.000009521966,"about_ca_topic_score_gemma":0.0000030824242,"teacher_disagreement_score":0.8163003,"about_ca_system_score_codex":0.000023375662,"about_ca_system_score_gemma":0.00003927585,"threshold_uncertainty_score":0.5341507},"labels":[],"label_agreement":null},{"id":"W1543584257","doi":"10.26421/qic8.1-2-6","title":"On the role of shared entanglement","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Binary logarithm; Communication complexity; Randomness; Logarithm; Upper and lower bounds; Context (archaeology); Mathematics; Log-log plot; Bounded function; Combinatorics; Discrete mathematics; Quantum; Physics; Quantum mechanics; Statistics","score_opus":0.010152187340386913,"score_gpt":0.21738577799073508,"score_spread":0.20723359065034816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543584257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56369996,0.000045305023,0.43395832,0.0008194749,0.00010901164,0.00014704329,0.0000034316627,0.000076059645,0.00114137],"genre_scores_gemma":[0.9946638,0.000009658798,0.004820646,0.0004745326,0.000012114538,0.0000047266776,0.000009996293,0.0000017539708,0.0000028075574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999324,0.000035960667,0.0002409074,0.00007652087,0.00022808663,0.00009450068],"domain_scores_gemma":[0.999502,0.0001199036,0.00015107718,0.00012686777,0.00006987801,0.000030296933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014799679,0.00007429435,0.0000747134,0.00008811139,0.00020527547,0.000057398047,0.00018455746,0.000020850883,0.0000057636366],"category_scores_gemma":[0.000021509477,0.000050601637,0.000028652597,0.0001832856,0.000034287306,0.00036896975,0.00006724941,0.00007142014,0.000020212605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001062976,0.00004011526,0.00017395963,0.000013654215,0.000012477717,7.78557e-7,0.008797662,0.017803403,0.00006513453,0.7406858,0.0007658727,0.23163047],"study_design_scores_gemma":[0.00016590582,0.00011586222,0.0035228457,0.000014158364,0.000001053236,0.000018567254,0.00014091899,0.96791834,0.0003215108,0.026152616,0.0015645559,0.000063662315],"about_ca_topic_score_codex":0.000012396723,"about_ca_topic_score_gemma":2.1854606e-7,"teacher_disagreement_score":0.95011497,"about_ca_system_score_codex":0.000009349606,"about_ca_system_score_gemma":0.00002533524,"threshold_uncertainty_score":0.20634748},"labels":[],"label_agreement":null},{"id":"W1544479598","doi":"10.26421/qic14.11-12-4","title":"Decomposition and gluing for adiabatic quantum optimization","year":2014,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adiabatic process; Overhead (engineering); Factorization; Decomposition; Computer science; Quantum; Exploit; Quantum computer; Integer (computer science); Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Quantum mechanics; Physics","score_opus":0.009687598522840056,"score_gpt":0.2610205254780608,"score_spread":0.25133292695522075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544479598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05976251,0.00018630284,0.9370021,0.0010125807,0.00092476915,0.0007090789,0.000018187973,0.0003318726,0.000052578824],"genre_scores_gemma":[0.75205797,0.000081961014,0.24651824,0.0005865157,0.00013916752,0.00006932063,0.0005276685,0.000016633649,0.000002518699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982082,0.00010861729,0.0007069139,0.000416783,0.00027725595,0.00028220454],"domain_scores_gemma":[0.9983751,0.00031103412,0.00063029147,0.0002649701,0.00028108124,0.0001375188],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057434075,0.00033731657,0.00036186533,0.00041000673,0.00041493392,0.0011321771,0.00029118257,0.00024041724,0.0000011033916],"category_scores_gemma":[0.000088104905,0.0003411667,0.00008449462,0.0001696997,0.000052293537,0.0009425182,0.0004313507,0.00030498698,0.000004760115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012072115,0.000014932275,0.000013030077,0.00049185986,0.000021332582,2.6087304e-7,0.0015474106,0.82352895,0.0000051025777,0.033270966,0.00019097184,0.14090313],"study_design_scores_gemma":[0.0006036818,0.00017547279,0.00043100453,0.00024923868,0.000025530617,0.000027966638,0.000048443133,0.9594432,0.000015577345,0.038160495,0.00043190672,0.0003874792],"about_ca_topic_score_codex":0.000021591855,"about_ca_topic_score_gemma":9.178606e-7,"teacher_disagreement_score":0.69229543,"about_ca_system_score_codex":0.00004693518,"about_ca_system_score_gemma":0.00008683297,"threshold_uncertainty_score":0.99990475},"labels":[],"label_agreement":null},{"id":"W1547371858","doi":"10.26421/qic9.7-8-7","title":"Entanglement-resistant two-Prover interactive proof systems and non-adaptive PIRs","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Soundness; Gas meter prover; Completeness (order theory); Quantum entanglement; Constant (computer programming); Mathematics; Property (philosophy); Discrete mathematics; Scheme (mathematics); Combinatorics; Theoretical computer science; Computer science; Mathematical proof; Quantum; Physics; Programming language; Quantum mechanics","score_opus":0.010346494460206294,"score_gpt":0.25322522719894325,"score_spread":0.24287873273873695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547371858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115060866,0.00008783363,0.8831799,0.00018858699,0.00019036408,0.0003623648,0.000016097909,0.000068433365,0.000845568],"genre_scores_gemma":[0.9949425,0.000014619318,0.004607986,0.00034864622,0.00001896024,0.000010935815,0.000054103326,0.0000015706212,7.122149e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917215,0.000037160273,0.00030755217,0.00014842056,0.00020140968,0.00013330144],"domain_scores_gemma":[0.99944943,0.000044401928,0.00020054921,0.00011703382,0.00011729882,0.000071260336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019261907,0.000116102165,0.00011639031,0.00017351544,0.00015466564,0.00045701422,0.00011434886,0.00003176612,0.0000012568158],"category_scores_gemma":[0.000009974627,0.0001060345,0.00002293623,0.00022193228,0.000027101005,0.003518048,0.000058066133,0.00008427701,0.0000071876525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013826876,0.00007968467,0.00014458294,0.000060458762,0.000027725493,0.000002385811,0.010809829,0.0007033224,0.00013019145,0.80416614,0.0006817077,0.1830557],"study_design_scores_gemma":[0.00091548846,0.00044828138,0.010902107,0.000048276015,0.000007289435,0.000013285524,0.0012095483,0.9687996,0.0001426285,0.016379328,0.0009556821,0.00017848288],"about_ca_topic_score_codex":0.000056501092,"about_ca_topic_score_gemma":0.000004836559,"teacher_disagreement_score":0.96809626,"about_ca_system_score_codex":0.000026663944,"about_ca_system_score_gemma":0.000022267697,"threshold_uncertainty_score":0.44069988},"labels":[],"label_agreement":null},{"id":"W1547393723","doi":"10.26421/qic5.7-2","title":"Recasting Mermin's multi-player game into the framework of pseudo-telepathy","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Quantum entanglement; Computer science; Imperfect; Quantum; Perfect information; Theoretical computer science; Upper and lower bounds; Process (computing); Telepathy; Variety (cybernetics); Mathematics; Artificial intelligence; Mathematical economics; Physics; Quantum mechanics","score_opus":0.015320915876784991,"score_gpt":0.2666908944151126,"score_spread":0.25136997853832765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547393723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16840641,0.00007699494,0.8293192,0.0011108363,0.00019248927,0.00018521208,0.0000015085537,0.00012776519,0.0005795907],"genre_scores_gemma":[0.90244704,0.000055095974,0.09606746,0.0013576262,0.000035160676,0.000014063634,0.000015025936,0.0000040377613,0.000004468932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998548,0.00006521975,0.0007223021,0.00012110993,0.00035689556,0.00018649959],"domain_scores_gemma":[0.9987605,0.00017625935,0.0004901639,0.00024783044,0.00024962265,0.000075588345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005242365,0.0001524456,0.0001564388,0.00027179194,0.00023872642,0.00026542763,0.00035506653,0.00009053754,0.000011785138],"category_scores_gemma":[0.0000967768,0.000116811105,0.00007184973,0.0006218211,0.0000820277,0.0032731597,0.000104902865,0.00018568384,0.00008885742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001166248,0.00003197141,0.0001759706,0.000048760547,0.000014706281,1.790791e-7,0.031671375,0.006008045,0.000040285202,0.34284064,0.00026337957,0.618893],"study_design_scores_gemma":[0.00038573475,0.000065451386,0.0028456913,0.000038441784,0.0000058494707,0.000015673266,0.0013661239,0.98087335,0.0003420452,0.007035773,0.006870333,0.00015552178],"about_ca_topic_score_codex":0.00002508234,"about_ca_topic_score_gemma":0.0000050350786,"teacher_disagreement_score":0.9748653,"about_ca_system_score_codex":0.00002204491,"about_ca_system_score_gemma":0.000046490608,"threshold_uncertainty_score":0.47634187},"labels":[],"label_agreement":null},{"id":"W1554799384","doi":"10.26421/qic5.6-6","title":"Optimized quantum implementation of elliptic curve arithmetic over binary fields","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Quantum computer; Elliptic curve; Discrete logarithm; Cryptosystem; Mathematics; Realization (probability); Elliptic curve point multiplication; Quantum algorithm; Schoof's algorithm; Elliptic curve cryptography; Finite field; Discrete mathematics; Field (mathematics); Algorithm; Quantum; Arithmetic; Cryptography; Computer science; Public-key cryptography; Pure mathematics; Encryption; Quantum mechanics; Physics","score_opus":0.010816864080518932,"score_gpt":0.27422330407311585,"score_spread":0.26340643999259694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554799384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31046018,0.00010890056,0.68831295,0.0005879084,0.00013958251,0.00017932754,0.0000032623873,0.00006951923,0.00013836965],"genre_scores_gemma":[0.96618587,0.00010718941,0.033310793,0.00031465213,0.000023742576,0.000011624634,0.00003940222,0.0000035535825,0.000003147104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998819,0.00006201694,0.00054854655,0.00013427826,0.00027102893,0.0001651322],"domain_scores_gemma":[0.99926627,0.00009378349,0.00028868936,0.00015675917,0.00013153041,0.00006295854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028384704,0.00012561491,0.00015999506,0.00035680487,0.00012474635,0.00014277578,0.00017373283,0.00006771128,0.00002585158],"category_scores_gemma":[0.000011561532,0.00011733343,0.000066869434,0.00043199706,0.000045488643,0.0019975181,0.000069152906,0.00009480219,0.000020917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005783994,0.00014898184,0.0011352737,0.0002119005,0.000072738214,0.0000016456208,0.00982245,0.0913156,0.00017304791,0.43380472,0.0011305969,0.4621252],"study_design_scores_gemma":[0.001148445,0.0001857211,0.024707245,0.000019997511,0.000013281384,0.00001053647,0.00044985718,0.96699774,0.00042271143,0.0052081347,0.00068068894,0.00015560954],"about_ca_topic_score_codex":0.00007665422,"about_ca_topic_score_gemma":0.0000054006364,"teacher_disagreement_score":0.8756822,"about_ca_system_score_codex":0.000019352608,"about_ca_system_score_gemma":0.000049159335,"threshold_uncertainty_score":0.47847185},"labels":[],"label_agreement":null},{"id":"W1558301011","doi":"10.26421/qic8.8-9-10","title":"Distinguishing quantum operations having few Kraus operators","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimension (graph theory); Unitary state; Quantum entanglement; Quantum; Quantum information; Quantum system; Computer science; Mathematics; Space (punctuation); Quantum state; Theoretical computer science; Pure mathematics; Quantum mechanics; Physics","score_opus":0.015056086278999112,"score_gpt":0.24566876863793188,"score_spread":0.23061268235893279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558301011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39357382,0.00006337868,0.6046488,0.0005587168,0.0003991674,0.00013799292,0.0000030433298,0.0003036875,0.00031137883],"genre_scores_gemma":[0.95750505,0.0000309736,0.04160548,0.0006964905,0.00007651795,0.00001127299,0.000051563744,0.000008584457,0.0000140589855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.00008163817,0.0005537363,0.0002560068,0.00035212983,0.00029370855],"domain_scores_gemma":[0.99915177,0.000099364835,0.00014701429,0.00022847584,0.00022723567,0.00014615785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031583442,0.00021263555,0.00020007388,0.00025133477,0.0011744144,0.0006556524,0.0003346108,0.00007486839,0.000004131486],"category_scores_gemma":[0.00012499005,0.00019782597,0.00005613498,0.00049965386,0.000070991,0.002311041,0.00019012553,0.00023732828,0.000055778673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012677256,0.00010403867,0.0014026951,0.00010349135,0.000040853436,0.000029535202,0.027404664,0.42792702,0.00013900863,0.31494543,0.0015670616,0.22632353],"study_design_scores_gemma":[0.00036785635,0.00008709658,0.006856973,0.000039762454,0.0000040029518,0.00021013891,0.00018641508,0.9886009,0.000049400896,0.0015568968,0.0017728755,0.000267648],"about_ca_topic_score_codex":0.00012594386,"about_ca_topic_score_gemma":0.000005081149,"teacher_disagreement_score":0.5639312,"about_ca_system_score_codex":0.000039640425,"about_ca_system_score_gemma":0.00011906617,"threshold_uncertainty_score":0.9032765},"labels":[],"label_agreement":null},{"id":"W1565448920","doi":"10.26421/qic13.3-4-9","title":"Efficient quantum communication under collective noise","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Universität Innsbruck; Austrian Science Fund; European Commission","keywords":"Decoding methods; Overhead (engineering); Quantum decoherence; Transmission (telecommunications); Topology (electrical circuits); Mathematics; Noise (video); Computer science; Quantum; Encoding (memory); Constant (computer programming); Discrete mathematics; Algorithm; Combinatorics; Quantum mechanics; Telecommunications; Physics","score_opus":0.011781328499480482,"score_gpt":0.23589031088653087,"score_spread":0.22410898238705038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565448920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1988793,0.00006810962,0.79344386,0.001665808,0.0001885258,0.0005007913,0.0000026541545,0.00032259765,0.0049283514],"genre_scores_gemma":[0.9903005,0.000032234035,0.007568607,0.001911347,0.00001034468,0.00009113705,0.00006223491,0.000005783226,0.000017847835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845374,0.00010567433,0.00063506403,0.000161575,0.00039113473,0.00025280338],"domain_scores_gemma":[0.9985281,0.00012756097,0.00036032626,0.00034341365,0.00049419404,0.00014636284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033573544,0.00019206136,0.00016943611,0.00046959743,0.00048170792,0.0008476866,0.00036581166,0.00009310439,0.000043441883],"category_scores_gemma":[0.000033435364,0.0001803114,0.00006621978,0.00084151654,0.00008823944,0.0029088303,0.00014620945,0.00016417877,0.0007009528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009977737,0.00006291687,0.00010658466,0.000036764926,0.000021440868,1.1472432e-7,0.0062895804,0.025081191,0.000050957373,0.92496896,0.0037542298,0.039617307],"study_design_scores_gemma":[0.0006072521,0.000076569944,0.018074835,0.000020231953,0.000004573922,0.000013598652,0.001346041,0.92802095,0.000055087996,0.05062351,0.0009323578,0.00022497146],"about_ca_topic_score_codex":0.00008143764,"about_ca_topic_score_gemma":0.000001574735,"teacher_disagreement_score":0.9029398,"about_ca_system_score_codex":0.00007978608,"about_ca_system_score_gemma":0.00010408041,"threshold_uncertainty_score":0.90095633},"labels":[],"label_agreement":null},{"id":"W1565897310","doi":"10.5555/2230936.2230942","title":"Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Mathematics; Unitary matrix; Unitary state; Equivalence (formal languages); Circular ensemble; Combinatorics; Matrix (chemical analysis); Discrete mathematics; Pure mathematics","score_opus":0.028246135048057633,"score_gpt":0.2734307705553494,"score_spread":0.2451846355072918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565897310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58296996,0.00013080784,0.4164341,0.000110029345,0.00009907338,0.00010229801,0.00000968621,0.00008558226,0.000058447884],"genre_scores_gemma":[0.9711816,0.00007410429,0.02858289,0.00010018324,0.000021528165,0.0000030481003,0.00002925715,0.00000557582,0.0000018157654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.00008378852,0.00058686367,0.00018225233,0.00023203429,0.00022724054],"domain_scores_gemma":[0.99903435,0.00019521528,0.000359897,0.00016473368,0.00013066127,0.00011513303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004800648,0.0001661009,0.00023232622,0.00029892364,0.00019018137,0.00013378396,0.00023622015,0.000064331754,0.000003099657],"category_scores_gemma":[0.0000357633,0.00015183042,0.000034860826,0.00033194892,0.00008728076,0.0013929689,0.00020521478,0.00011937607,0.000009441424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065801396,0.00007913985,0.017156508,0.00057546934,0.00009783138,0.000006164915,0.04524933,0.00977319,0.00030917657,0.15859655,0.00033021864,0.76776063],"study_design_scores_gemma":[0.00034896945,0.00021712002,0.040381324,0.0000766345,0.000011114602,0.000022092569,0.00029642027,0.9327211,0.0005537426,0.025034659,0.00014256977,0.00019430443],"about_ca_topic_score_codex":0.00012641086,"about_ca_topic_score_gemma":0.0000011376077,"teacher_disagreement_score":0.9229479,"about_ca_system_score_codex":0.000011992455,"about_ca_system_score_gemma":0.000043748438,"threshold_uncertainty_score":0.61914647},"labels":[],"label_agreement":null},{"id":"W1585033983","doi":"10.26421/qic4.5-1","title":"Security of quantum key distribution with imperfect devices","year":2004,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":685,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Perimeter Institute","funders":"","keywords":"BB84; Quantum key distribution; Eavesdropping; Imperfect; Detector; Basis (linear algebra); Quantum cryptography; Key (lock); Key generation; Protocol (science); Computer science; Upper and lower bounds; Quantum; Mathematics; Theoretical computer science; Topology (electrical circuits); Cryptography; Algorithm; Computer network; Quantum information; Physics; Quantum mechanics; Computer security; Telecommunications; Combinatorics; Mathematical analysis","score_opus":0.006256060056635696,"score_gpt":0.22362234285787735,"score_spread":0.21736628280124165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585033983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3445256,0.000032410102,0.65431327,0.00031985014,0.00008397392,0.00015816568,0.000012220424,0.00012908514,0.00042540114],"genre_scores_gemma":[0.99680364,0.000034341454,0.0026381742,0.00030454414,0.000010285709,0.000011911742,0.00019329382,0.0000034281813,3.731412e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998703,0.00003596587,0.0005499347,0.00013250174,0.00038793244,0.00019063677],"domain_scores_gemma":[0.99892694,0.00004143846,0.00043074664,0.00018534357,0.00031943276,0.00009612649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030152063,0.00016352304,0.00018057007,0.00022270497,0.0001856258,0.00023422862,0.00021501428,0.000070520255,0.0000037972277],"category_scores_gemma":[0.000020366284,0.000135955,0.000053893673,0.0006913552,0.00008475366,0.004260817,0.000055645563,0.00011085322,0.000031424443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003561207,0.000044224256,0.00046459248,0.00012248628,0.000018182416,4.8363376e-7,0.0038894662,0.005801742,0.000017689803,0.978368,0.000101002144,0.0111365495],"study_design_scores_gemma":[0.002304858,0.0007492337,0.024068916,0.00011874879,0.000018524694,0.00007327507,0.0013306285,0.90985996,0.0013378689,0.056792267,0.0029340906,0.00041162837],"about_ca_topic_score_codex":0.00006668459,"about_ca_topic_score_gemma":0.000006765994,"teacher_disagreement_score":0.9215757,"about_ca_system_score_codex":0.000037913345,"about_ca_system_score_gemma":0.00010382232,"threshold_uncertainty_score":0.5544084},"labels":[],"label_agreement":null},{"id":"W1588058692","doi":"10.26421/qic5.45-10","title":"Getting something out of nothing","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum key distribution; Key (lock); Alice and Bob; Alice (programming language); Argument (complex analysis); State (computer science); Computer science; Nothing; Key generation; Quantum; Theoretical physics; Discrete mathematics; Mathematics; Quantum mechanics; Theoretical computer science; Physics; Philosophy; Algorithm; Computer security; Epistemology; Cryptography","score_opus":0.015221141713435363,"score_gpt":0.26093983798729853,"score_spread":0.24571869627386317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588058692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06774891,0.000042909032,0.92712736,0.001261371,0.00021090162,0.000107297186,0.0000013214753,0.00017143032,0.0033284887],"genre_scores_gemma":[0.9368707,0.000017579741,0.061426032,0.0016333406,0.000027825272,0.0000043520763,0.000013849739,0.0000027032222,0.000003595144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998816,0.000029770472,0.0006181547,0.00008869195,0.000298041,0.00014934655],"domain_scores_gemma":[0.9991518,0.00007772214,0.00039608972,0.00013439963,0.00017793893,0.000061997605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048264253,0.000104221006,0.00012878771,0.00037921214,0.00016073587,0.00024171358,0.00020048601,0.000055252083,0.0000063554794],"category_scores_gemma":[0.000045225064,0.00010180915,0.00005087873,0.0003045068,0.000033244407,0.0059446883,0.00007473931,0.000108062064,0.00006738078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004733874,0.000015643911,0.000075039454,0.000066178625,0.0000099500585,9.056531e-8,0.029947486,0.005077189,0.00019102325,0.41147748,0.00021884292,0.55291635],"study_design_scores_gemma":[0.00037810768,0.00004130629,0.0012850113,0.000028072076,0.0000031864108,0.0000059500067,0.00070295203,0.9799179,0.0008037311,0.0043125846,0.012380892,0.0001403465],"about_ca_topic_score_codex":0.000006684205,"about_ca_topic_score_gemma":8.704036e-7,"teacher_disagreement_score":0.9748407,"about_ca_system_score_codex":0.000018097204,"about_ca_system_score_gemma":0.00003438425,"threshold_uncertainty_score":0.43097556},"labels":[],"label_agreement":null},{"id":"W1588169958","doi":"10.26421/qic12.9-10-8","title":"Quantum algorithms for invariants of triangulated manifolds","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Invariant (physics); Tensor (intrinsic definition); Euler characteristic; Pure mathematics; Mathematical physics","score_opus":0.021683940076733847,"score_gpt":0.269551820940237,"score_spread":0.24786788086350314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588169958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12960368,0.000117802265,0.8688074,0.00028352157,0.0006079474,0.00031625087,0.00001159834,0.00013307054,0.00011875124],"genre_scores_gemma":[0.9406845,0.0000106524185,0.058907006,0.00022891739,0.0000832313,0.000013852207,0.00005927068,0.0000067224555,0.000005838604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871117,0.000055604443,0.0005628821,0.00013243212,0.0002402646,0.00029763387],"domain_scores_gemma":[0.9989904,0.00016581311,0.00036364142,0.0001703505,0.00019102907,0.00011872123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006192194,0.00015675207,0.00021657931,0.00025226147,0.00017067413,0.00012845344,0.00022807936,0.00008721492,0.0000029032046],"category_scores_gemma":[0.000062492036,0.00014163615,0.000069050206,0.00035863617,0.00003342621,0.001667164,0.00009249082,0.000087591696,0.000012518714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047207155,0.000121575715,0.00033700513,0.00020911709,0.00004963821,3.9602295e-7,0.0071224347,0.007086466,0.00016931847,0.46737206,0.00083614676,0.51664865],"study_design_scores_gemma":[0.0009124096,0.00017436515,0.006776162,0.000028723765,0.000009425644,0.000027204065,0.000131043,0.97955704,0.00027698677,0.010138152,0.0017892914,0.00017922332],"about_ca_topic_score_codex":0.000023537166,"about_ca_topic_score_gemma":3.1503484e-7,"teacher_disagreement_score":0.9724705,"about_ca_system_score_codex":0.00001815735,"about_ca_system_score_gemma":0.000046396704,"threshold_uncertainty_score":0.5775755},"labels":[],"label_agreement":null},{"id":"W1597300680","doi":"10.26421/qic12.11-12-3","title":"Limitation for linear maps in a class for detection and quantification of bipartite nonclassical correlation","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Bipartite graph; Nonlinear system; Matrix (chemical analysis); Class (philosophy); Transposition (logic); Transpose; Quantum; Random matrix; Pure mathematics; Applied mathematics; Combinatorics; Discrete mathematics; Quantum mechanics; Computer science; Physics; Geometry","score_opus":0.02626985667123165,"score_gpt":0.27338869384909315,"score_spread":0.24711883717786148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597300680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12631337,0.0000480519,0.87224185,0.00030379987,0.00024231362,0.0007078908,0.000013388334,0.00006128209,0.000068028305],"genre_scores_gemma":[0.97844017,0.000030317553,0.020980978,0.00014935787,0.000031361596,0.00014600965,0.00021402708,0.0000051622537,0.0000026103721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987696,0.0000454189,0.00069052866,0.00012129283,0.00017665376,0.00019653764],"domain_scores_gemma":[0.9988231,0.00027640292,0.00044096052,0.00010763109,0.00027578534,0.00007613893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075237866,0.00012319325,0.00016120935,0.00051776017,0.00013706059,0.00010004885,0.000078931655,0.00011081515,4.7285147e-7],"category_scores_gemma":[0.00013593229,0.00012588619,0.000051660332,0.00042879788,0.00004518155,0.004081139,0.000023433891,0.00006941325,0.0000060915063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015683279,0.00009983147,0.0024460827,0.0004001476,0.000015153521,1.4842203e-8,0.0067738676,0.0051375045,0.0011295632,0.74221206,0.00019349204,0.24143548],"study_design_scores_gemma":[0.0011570777,0.00018438522,0.022764303,0.000026863698,0.000009918732,0.0000041822577,0.00046935992,0.9627544,0.0012399654,0.007495628,0.0037509217,0.00014296414],"about_ca_topic_score_codex":0.000007102149,"about_ca_topic_score_gemma":0.0000052287637,"teacher_disagreement_score":0.9576169,"about_ca_system_score_codex":0.00003086425,"about_ca_system_score_gemma":0.000028440942,"threshold_uncertainty_score":0.513349},"labels":[],"label_agreement":null},{"id":"W1598767403","doi":"10.26421/qic7.8-1","title":"Multi-partite quantum cryptographic protocols with noisy GHZ states","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bipartite graph; Cryptography; Quantum cryptography; Fidelity; Theoretical computer science; Cryptographic primitive; State (computer science); Cryptographic protocol; Quantum; Graph; Quantum mechanics; Algorithm; Quantum information; Physics","score_opus":0.016245542922099877,"score_gpt":0.2767990757494363,"score_spread":0.2605535328273364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598767403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08903428,0.00002263143,0.9068952,0.00033298126,0.0001272601,0.002518942,0.0000053124722,0.000487961,0.0005753896],"genre_scores_gemma":[0.9333048,0.000026272752,0.06444957,0.001579082,0.000026636628,0.00048719742,0.00010786934,0.000012404361,0.0000061908104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978,0.000051749994,0.0008844212,0.00023608444,0.0005764716,0.00045128533],"domain_scores_gemma":[0.9984131,0.0000976517,0.0005163903,0.00031220051,0.0004234135,0.0002372448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089861243,0.00028285617,0.00023235548,0.00080249575,0.00038899842,0.00076819374,0.0003541108,0.00010672004,0.000010753847],"category_scores_gemma":[0.000023871977,0.0002355347,0.00007500139,0.001279616,0.00012753862,0.0054577873,0.000083016275,0.0002085488,0.00012489289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035943676,0.00033733356,0.006744486,0.0004694128,0.000106230254,0.000010293041,0.017141905,0.008065433,0.000269451,0.7870291,0.0014956155,0.17797129],"study_design_scores_gemma":[0.001907829,0.00046531504,0.0344744,0.00008147627,0.0000079888,0.000050162373,0.0011269331,0.9412912,0.00032817415,0.005662947,0.014157109,0.00044646912],"about_ca_topic_score_codex":0.000031457454,"about_ca_topic_score_gemma":0.000018019535,"teacher_disagreement_score":0.93322575,"about_ca_system_score_codex":0.000029545936,"about_ca_system_score_gemma":0.00007383661,"threshold_uncertainty_score":0.9604826},"labels":[],"label_agreement":null},{"id":"W1598829068","doi":"10.26421/qic13.5-6-1","title":"The robustness of magic state distillation against errors in Clifford gates","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum computer; Quantum error correction; Computer science; Qubit; MAGIC (telescope); Algorithm; Quantum gate; Mathematics; Quantum algorithm; Topology (electrical circuits); Quantum mechanics; Quantum; Physics","score_opus":0.007043994590803551,"score_gpt":0.22239548095482298,"score_spread":0.21535148636401943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598829068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58407754,0.000036359448,0.41469255,0.00066351116,0.00016573956,0.00017964643,9.93604e-7,0.000044066208,0.00013960162],"genre_scores_gemma":[0.99423224,0.00004104172,0.0055816537,0.00009590674,0.000012960762,0.000008323376,0.000017372737,0.0000032071332,0.000007307601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989511,0.00006342073,0.00049957907,0.00010698428,0.0002053365,0.00017360962],"domain_scores_gemma":[0.9992274,0.00015923183,0.00028350006,0.00013494864,0.00015155807,0.000043360058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003055479,0.00010717778,0.00011648167,0.00015331528,0.00015837938,0.00027705161,0.00020571185,0.000032661766,8.492424e-7],"category_scores_gemma":[0.000035940222,0.00007658908,0.000027546279,0.00037168947,0.00005877906,0.0011162688,0.0000821645,0.0001059329,0.000013306493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047461435,0.0000112399575,0.000539341,0.000031696825,0.000003927629,1.5994807e-7,0.0013113519,0.4753134,0.000013175203,0.01106816,0.00011370095,0.5115891],"study_design_scores_gemma":[0.0002563797,0.000042496467,0.04148923,0.000028862356,8.517191e-7,0.000003451145,0.0001868718,0.9513406,0.000029899515,0.0062317178,0.0002951914,0.00009441814],"about_ca_topic_score_codex":0.00005737199,"about_ca_topic_score_gemma":0.0000066421603,"teacher_disagreement_score":0.5114947,"about_ca_system_score_codex":0.000018196337,"about_ca_system_score_gemma":0.000031629697,"threshold_uncertainty_score":0.31232122},"labels":[],"label_agreement":null},{"id":"W1601336611","doi":"10.26421/qic14.3-4-2","title":"Security of high speed quantum key distribution with finite detector dead time","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"BB84; Quantum key distribution; Key (lock); Detector; Dead time; Basis (linear algebra); Transmission (telecommunications); Computer science; Key size; Quantum cryptography; Topology (electrical circuits); Physics; Mathematics; Public-key cryptography; Quantum; Computer network; Encryption; Quantum mechanics; Computer security; Telecommunications; Quantum information; Combinatorics","score_opus":0.005367503188660144,"score_gpt":0.2020328382567197,"score_spread":0.19666533506805955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601336611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32852423,0.000008063427,0.6703807,0.00020110283,0.00009845897,0.00016488707,0.000020380556,0.0001588472,0.0004433045],"genre_scores_gemma":[0.9965775,0.000010915837,0.0027118372,0.0003049587,0.000019294943,0.0000067389933,0.00036099064,0.0000050598564,0.000002692199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843836,0.000090722264,0.0006466765,0.00015831094,0.00044482463,0.00022112663],"domain_scores_gemma":[0.99855113,0.00015412751,0.0005418058,0.00024935,0.00038571615,0.000117855154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045775584,0.00019338785,0.00024252653,0.00026232738,0.00018552833,0.000249863,0.00025162622,0.000090311936,0.0000144920405],"category_scores_gemma":[0.000071022376,0.00016665984,0.00005793621,0.00065754604,0.00009085105,0.0029769556,0.00006774462,0.00012564324,0.00012695583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108630426,0.00006584459,0.00034031537,0.00017760853,0.0000332311,3.7391072e-7,0.0028856103,0.008467106,0.000076876204,0.9405672,0.0006373974,0.04663983],"study_design_scores_gemma":[0.0009900691,0.00041032437,0.007276442,0.000041205836,0.000010742774,0.000013385354,0.00010989562,0.96715534,0.0006420526,0.020667661,0.0024505195,0.00023237108],"about_ca_topic_score_codex":0.00004727979,"about_ca_topic_score_gemma":0.00000268832,"teacher_disagreement_score":0.9586882,"about_ca_system_score_codex":0.000025801302,"about_ca_system_score_gemma":0.000051135357,"threshold_uncertainty_score":0.67961913},"labels":[],"label_agreement":null},{"id":"W1601508882","doi":"10.26421/qic12.11-12-2","title":"Classical simulation of dissipative fermionic linear optics","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency","keywords":"Dissipative system; Master equation; Lindblad equation; Computation; Quantum computer; State (computer science); Physics; Mathematics; Quantum optics; Quantum; Set (abstract data type); Quantum mechanics; Statistical physics; Computer science; Algorithm","score_opus":0.02351719177986818,"score_gpt":0.29457011208448625,"score_spread":0.2710529203046181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601508882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13657992,0.00003358286,0.86146075,0.00019883855,0.00029637318,0.00014795978,0.0000028708314,0.000106739215,0.0011729664],"genre_scores_gemma":[0.99072975,0.000018520015,0.008890505,0.00026249117,0.000034564917,0.000007128131,0.00005021477,0.0000031545605,0.0000036599856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881214,0.00005193582,0.000564493,0.00007272743,0.0003095726,0.00018914315],"domain_scores_gemma":[0.9990194,0.0001264097,0.00036086063,0.0001417522,0.00023131113,0.00012029628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032307615,0.000119254015,0.00014315051,0.00027180446,0.00012706355,0.00008855568,0.00014180082,0.00007352849,0.0000072832404],"category_scores_gemma":[0.000056077042,0.000108372056,0.00005563156,0.0004545317,0.000057058332,0.0051119737,0.00006616803,0.000095790034,0.000056430308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017190345,0.000065752545,0.000739521,0.00006489461,0.000014565085,5.657622e-8,0.006004552,0.04149206,0.000016073933,0.88777936,0.0001022972,0.063703656],"study_design_scores_gemma":[0.00036220302,0.00008488939,0.011683469,0.000015039762,0.0000061680853,0.0000041628377,0.00034022107,0.98068476,0.00017502026,0.005152427,0.0013600786,0.00013158836],"about_ca_topic_score_codex":0.000002523769,"about_ca_topic_score_gemma":1.701909e-7,"teacher_disagreement_score":0.93919265,"about_ca_system_score_codex":0.000019415342,"about_ca_system_score_gemma":0.000034319175,"threshold_uncertainty_score":0.44192842},"labels":[],"label_agreement":null},{"id":"W1603553069","doi":"10.26421/qic15.7-8-10","title":"Is absolute separability determined by the partial transpose?","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unitary state; Transpose; Quantum entanglement; Mathematics; Separable state; Entanglement witness; Eigenvalues and eigenvectors; Separable space; Combinatorics; Quantum state; Pure mathematics; Quantum; State (computer science); Discrete mathematics; Quantum discord; Quantum mechanics; Physics; Mathematical analysis; Algorithm; Law","score_opus":0.025944562225102368,"score_gpt":0.26820621117332977,"score_spread":0.2422616489482274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603553069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13859117,0.00006623275,0.85587156,0.0030870708,0.00029551386,0.00025076882,0.0000120287295,0.00020026577,0.0016254009],"genre_scores_gemma":[0.9949322,0.000015676987,0.0014745963,0.00346839,0.000018021941,0.00002297978,0.00005427926,0.0000029599519,0.0000109111525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869704,0.00007271092,0.00051218376,0.0001282166,0.00039428993,0.00019554069],"domain_scores_gemma":[0.99913704,0.000057601486,0.00020844293,0.00023860525,0.00020571535,0.0001525983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869711,0.00013993811,0.00011951855,0.00010415122,0.00022466276,0.00046429716,0.0003121666,0.0000631015,0.000008013069],"category_scores_gemma":[0.00002536571,0.000104208106,0.00006121764,0.00039443746,0.00007706439,0.0034196393,0.000046793917,0.00010841716,0.00013386153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013441863,0.00011850668,0.00086963206,0.00010615561,0.0000579138,9.0666583e-7,0.05984974,0.002186137,0.000047213616,0.2751433,0.11202071,0.54946536],"study_design_scores_gemma":[0.0007898685,0.00011483326,0.002067724,0.0000055006344,0.000006189422,0.000018336887,0.00045535224,0.9279393,0.00028622244,0.009880713,0.058266044,0.00016990524],"about_ca_topic_score_codex":0.00003143893,"about_ca_topic_score_gemma":0.0000017965971,"teacher_disagreement_score":0.9257532,"about_ca_system_score_codex":0.000024558827,"about_ca_system_score_gemma":0.00007034076,"threshold_uncertainty_score":0.44772282},"labels":[],"label_agreement":null},{"id":"W1605022101","doi":"10.26421/qic14.1-2-4","title":"Quantum algorithms for one-dimensional infrastructures","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quartic function; Quantum computer; Quantum algorithm; Quadratic equation; Discrete logarithm; Logarithm; Speedup; Finite field; Time complexity; Algorithm; Polynomial; Rank (graph theory); Mathematics; Computer science; Field (mathematics); Function (biology); Discrete mathematics; Quantum; Pure mathematics; Combinatorics; Quantum mechanics","score_opus":0.050038952588058724,"score_gpt":0.3432538883961553,"score_spread":0.29321493580809654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605022101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1672425,0.0000066158377,0.83101684,0.00031738688,0.00012366395,0.00033253417,0.000013905606,0.00009133364,0.00085521216],"genre_scores_gemma":[0.96714866,0.000002341996,0.03220931,0.00033159938,0.00008220504,0.000028031494,0.00014149606,0.000011630107,0.00004474487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989209,0.000065409185,0.00040355718,0.00010540595,0.0003184134,0.0001863253],"domain_scores_gemma":[0.9987511,0.0006148509,0.00018308616,0.000106733045,0.0002618064,0.00008242273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007177499,0.00011657949,0.00017220237,0.00015469451,0.00019412697,0.000108667635,0.00008132322,0.000072170726,0.00004122084],"category_scores_gemma":[0.00042559337,0.000106017884,0.000046547655,0.00011266981,0.000060345425,0.00054377306,0.000038827882,0.00009665823,0.000041818377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063523235,0.000023863606,0.00005885057,0.00016351888,0.000027240774,6.270996e-8,0.0007044006,0.0006401756,0.00002949998,0.9481202,0.003988223,0.046180476],"study_design_scores_gemma":[0.00046301752,0.00007502623,0.00054992124,0.000013937368,0.000010290889,0.000004783048,0.00013026052,0.51769525,0.000048772905,0.47971544,0.0012142793,0.00007902106],"about_ca_topic_score_codex":0.000012002426,"about_ca_topic_score_gemma":0.000001825132,"teacher_disagreement_score":0.79990613,"about_ca_system_score_codex":0.000028211827,"about_ca_system_score_gemma":0.00003742042,"threshold_uncertainty_score":0.43232837},"labels":[],"label_agreement":null},{"id":"W1619297896","doi":"10.26421/qic12.9-10-9","title":"Quantum phase estimation with arbitrary constant-precision phase shift operators","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantitative precipitation estimation; Quantum Fourier transform; Operator (biology); Algorithm; Quantum; Quantum algorithm; Computer science; Phase (matter); Constant (computer programming); Mathematics; Quantum error correction; Quantum mechanics; Physics; Chemistry","score_opus":0.012269652418089817,"score_gpt":0.27970929421332713,"score_spread":0.2674396417952373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619297896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3775332,0.00010194718,0.6210065,0.00032138947,0.00031153928,0.00023986219,0.000008750667,0.00024549986,0.00023135454],"genre_scores_gemma":[0.9360351,0.00001251181,0.06316864,0.00055623846,0.00006983426,0.000014188208,0.00013073662,0.000010719006,0.000002041839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981736,0.00011994514,0.0005909707,0.00023353216,0.00047258093,0.0004093789],"domain_scores_gemma":[0.99884135,0.00017189927,0.0003293382,0.0002594593,0.00013639423,0.00026156055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057953986,0.00027866065,0.00024654716,0.00033412277,0.00042576971,0.00053296494,0.00026218008,0.00009316553,0.000008907409],"category_scores_gemma":[0.0000397172,0.00022411405,0.00004864102,0.0005584238,0.00009351322,0.004560258,0.000109946486,0.00024155996,0.00006853112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001329472,0.00040853515,0.00013870635,0.00007606742,0.000031405598,0.0000041317917,0.0082835285,0.016358372,0.00005799408,0.1882573,0.00039519023,0.7858558],"study_design_scores_gemma":[0.003111849,0.0006303705,0.0005834555,0.00007183717,0.000013219482,0.000109066525,0.00019497491,0.98804384,0.00022176692,0.0052166777,0.0014665178,0.00033644337],"about_ca_topic_score_codex":0.000018175993,"about_ca_topic_score_gemma":5.976882e-7,"teacher_disagreement_score":0.97168547,"about_ca_system_score_codex":0.000046438487,"about_ca_system_score_gemma":0.00011791854,"threshold_uncertainty_score":0.9139105},"labels":[],"label_agreement":null},{"id":"W1623145946","doi":"10.26421/qic3.4-5","title":"Universal compression of ergodic quantum sources","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum chaos and dynamical systems","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ergodic theory; Tensor product; Mathematics; Ergodicity; Von Neumann entropy; Qubit; Quantum; Entropy (arrow of time); Discrete mathematics; Combinatorics; Quantum entanglement; Quantum mechanics; Pure mathematics; Physics","score_opus":0.007523957580906564,"score_gpt":0.2250867071429047,"score_spread":0.21756274956199814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1623145946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74477243,0.000030207717,0.25077105,0.000025819636,0.00013167394,0.00010875663,0.0000115547555,0.00002398273,0.0041245446],"genre_scores_gemma":[0.99966,0.0000031457312,0.00019064714,0.000021581258,0.000018709728,0.0000031329462,0.000083530664,0.0000039278175,0.000015334388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992499,0.000058936766,0.00035151275,0.00007393867,0.00015327464,0.0001124876],"domain_scores_gemma":[0.9994951,0.000052063533,0.00024462174,0.00006391953,0.00008367806,0.00006065003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013387976,0.00009662125,0.00014876333,0.00008683807,0.00010647572,0.000046759258,0.00004453975,0.000034487573,0.0000651704],"category_scores_gemma":[0.0000057051275,0.000084232735,0.000043608256,0.00012349551,0.000044545974,0.00049114675,0.000014690398,0.00006472023,0.000023796734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020263804,0.000045027333,0.009583512,0.00005513843,0.000018618957,9.9100056e-8,0.0010649287,0.004005541,0.00015861983,0.97558707,0.0002240764,0.009237099],"study_design_scores_gemma":[0.0012239009,0.00012962644,0.0068902825,0.00007280074,0.000018199791,0.0000026921794,0.0045278147,0.94481415,0.000479802,0.034838032,0.00677872,0.00022399006],"about_ca_topic_score_codex":0.00015487985,"about_ca_topic_score_gemma":5.6830186e-7,"teacher_disagreement_score":0.9408086,"about_ca_system_score_codex":0.000009178342,"about_ca_system_score_gemma":0.000028555873,"threshold_uncertainty_score":0.34349114},"labels":[],"label_agreement":null},{"id":"W1624887593","doi":"10.26421/qic3.2-8","title":"Circuit for Shor's algorithm using 2n+3 qubits","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum computer; Qubit; Quantum circuit; Integer factorization; Integer (computer science); Mathematics; Discrete mathematics; Quantum algorithm; Factorization; Algorithm; Quantum gate; Quantum; Polynomial; Property (philosophy); Combinatorics; Computer science; Quantum error correction; Quantum mechanics; Physics","score_opus":0.02214648016103968,"score_gpt":0.26119808501020597,"score_spread":0.2390516048491663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624887593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032505292,0.0000746024,0.9659952,0.00013813928,0.0005233035,0.0002917667,0.000006379774,0.00017838662,0.0002869138],"genre_scores_gemma":[0.61368746,0.000008193881,0.3855487,0.0006229133,0.000064197324,0.000014828217,0.000034162953,0.0000095342575,0.000009996927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885255,0.000057173587,0.00042385166,0.00019343529,0.0002169489,0.00025605533],"domain_scores_gemma":[0.9992576,0.00010980691,0.00020806647,0.00015079259,0.00017991265,0.00009377861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043095235,0.0001581415,0.00015597104,0.00020093116,0.00035681482,0.0003878823,0.0001755929,0.00006926182,0.0000021010017],"category_scores_gemma":[0.00005787737,0.0001529748,0.00005740016,0.0003149917,0.000027903929,0.0011445727,0.00004414583,0.00010103744,0.000010769958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028624247,0.000024506908,0.00002779606,0.000051608593,0.000015002361,7.2914287e-7,0.0018497814,0.03933302,0.00004917752,0.2310787,0.00019203022,0.7273748],"study_design_scores_gemma":[0.00050392986,0.00009097454,0.0001812889,0.00002017852,0.0000056001118,0.000067484536,0.00009985373,0.9586331,0.00015028207,0.033403896,0.006642078,0.00020128409],"about_ca_topic_score_codex":0.000010497824,"about_ca_topic_score_gemma":3.9368135e-7,"teacher_disagreement_score":0.91930014,"about_ca_system_score_codex":0.000031832213,"about_ca_system_score_gemma":0.000087125736,"threshold_uncertainty_score":0.62381315},"labels":[],"label_agreement":null},{"id":"W1627401754","doi":"10.26421/qic9.9-10-2","title":"Properties of local quantum operations with shared entanglement","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Randomness; Mathematics; Separable state; Hermitian matrix; Quantum; Separable space; LOCC; Topology (electrical circuits); Computer science; Discrete mathematics; Pure mathematics; Combinatorics; Quantum mechanics; Physics; Quantum discord; Mathematical analysis","score_opus":0.013938878783861191,"score_gpt":0.2256529538283967,"score_spread":0.21171407504453552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627401754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1413958,0.000056261568,0.8565654,0.00093502266,0.00006640814,0.00025432292,0.000004061357,0.00013529499,0.00058740407],"genre_scores_gemma":[0.99148345,0.000022916745,0.0074186856,0.000995618,0.000007833019,0.0000145189915,0.00005174051,0.000002503505,0.0000027083397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987512,0.000033587126,0.0005642693,0.00011524478,0.00037191669,0.00016375599],"domain_scores_gemma":[0.9992379,0.000011506217,0.00018708911,0.00017422705,0.00030796992,0.000081290906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018954175,0.00014352622,0.00015529567,0.00030686503,0.0001839548,0.000290628,0.00020402198,0.000044926535,0.000008412043],"category_scores_gemma":[0.0000075790836,0.000111653855,0.000038953884,0.00047425803,0.00006793644,0.004012326,0.00003339256,0.000077628916,0.0000243269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050507908,0.00008237223,0.000055218836,0.000066837914,0.00001935005,4.612669e-7,0.0065936786,0.015265278,0.0002862555,0.8657844,0.0003416646,0.11145394],"study_design_scores_gemma":[0.0007947976,0.00052182615,0.0037434262,0.00006628513,0.0000071884506,0.00002074958,0.0017353179,0.9876898,0.0019314836,0.002436413,0.00086187234,0.00019085182],"about_ca_topic_score_codex":0.000022214272,"about_ca_topic_score_gemma":0.0000042387724,"teacher_disagreement_score":0.9724245,"about_ca_system_score_codex":0.000023585444,"about_ca_system_score_gemma":0.000077286066,"threshold_uncertainty_score":0.4553112},"labels":[],"label_agreement":null},{"id":"W1630586687","doi":"10.26421/qic13.3-4-4","title":"Reduction from non-injective hidden shift problem to injective hidden shift problem","year":2013,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Injective function; Reduction (mathematics); Bent molecular geometry; Simple (philosophy); Mathematics; Discrete mathematics; Computer science; Combinatorics; Geometry","score_opus":0.012470724546861066,"score_gpt":0.2453528538428424,"score_spread":0.23288212929598132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630586687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26608214,0.00004463361,0.72739923,0.0010477394,0.00096536794,0.0018225091,0.00004464305,0.000474286,0.0021194713],"genre_scores_gemma":[0.9349191,0.000021704109,0.063610956,0.00038497616,0.00019824234,0.0004189516,0.00041211504,0.000020962596,0.0000129838145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704075,0.0002444213,0.00097857,0.00073460065,0.00058992056,0.00041176777],"domain_scores_gemma":[0.99776316,0.00014501163,0.00084527495,0.0005534644,0.00044731807,0.000245789],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006117982,0.00052895804,0.0004878528,0.0008832681,0.00041250818,0.0015709815,0.0007789379,0.00039101206,0.000022417073],"category_scores_gemma":[0.000032443106,0.0005392195,0.00017024265,0.0007578891,0.00008120993,0.0034519949,0.0010203816,0.00069542933,0.00032362153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020609083,0.00016856355,0.00023516273,0.00041662555,0.00027233807,0.0000021992278,0.14254148,0.013710035,0.0000672402,0.35712668,0.0031497425,0.48210382],"study_design_scores_gemma":[0.0006279704,0.0004166951,0.012471599,0.00038227564,0.00004656936,0.000009861791,0.0012845072,0.18700871,0.00017600218,0.79624665,0.00053340965,0.00079577387],"about_ca_topic_score_codex":0.0009954717,"about_ca_topic_score_gemma":0.00001934178,"teacher_disagreement_score":0.66883695,"about_ca_system_score_codex":0.0001963236,"about_ca_system_score_gemma":0.0002470111,"threshold_uncertainty_score":0.9997059},"labels":[],"label_agreement":null},{"id":"W1636459881","doi":"10.26421/qic9.11-12-6","title":"On global effects caused by locally noneffective unitary operations","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Unitary state; Bipartite graph; Locality; Qubit; Equivalence (formal languages); Mathematics; Measure (data warehouse); Invariant (physics); State (computer science); Quantum state; Quantum; Pure mathematics; Quantum mechanics; Discrete mathematics; Physics; Computer science; Mathematical physics; Algorithm","score_opus":0.004546334619402807,"score_gpt":0.23520156998293126,"score_spread":0.23065523536352844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636459881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10892947,0.000041279138,0.88634115,0.0010536024,0.0002239449,0.0003817484,0.000013449978,0.00030778226,0.0027075799],"genre_scores_gemma":[0.9901059,0.000015672698,0.0023331158,0.0073222294,0.000012363276,0.000018228864,0.00018594983,0.0000024891276,0.000004030308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878126,0.00008461464,0.0004084351,0.0001599914,0.0003527889,0.0002129252],"domain_scores_gemma":[0.9992694,0.000094916875,0.00011904113,0.00018548005,0.00019082811,0.0001403061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020487726,0.00019354996,0.0001542811,0.00020623092,0.00032625275,0.00048342792,0.00021771884,0.00008692296,0.000003851533],"category_scores_gemma":[0.000047497797,0.00018079962,0.000052972788,0.00069025106,0.000035677123,0.0034310508,0.000031096595,0.0001271047,0.00016532584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022919148,0.00008025794,0.000026924343,0.000026309082,0.000015400268,0.0000010778314,0.0015387795,0.008759236,0.000037185942,0.8055738,0.0051996247,0.17871845],"study_design_scores_gemma":[0.001215454,0.0008574295,0.009785341,0.000036967605,0.0000070763645,0.000011486821,0.00011165941,0.95481336,0.00022671526,0.031699587,0.0009615359,0.00027340488],"about_ca_topic_score_codex":0.000017416874,"about_ca_topic_score_gemma":0.0000024558697,"teacher_disagreement_score":0.9460541,"about_ca_system_score_codex":0.00008527308,"about_ca_system_score_gemma":0.00008191774,"threshold_uncertainty_score":0.7372795},"labels":[],"label_agreement":null},{"id":"W1638930871","doi":"10.26421/qic2.2-5","title":"NMR quantum information processing and entanglement","year":2002,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum entanglement; Quantum information processing; Quantum; Quantum information; Physics; Quantum sensor; Quantum mechanics; Quantum network","score_opus":0.01162527823708187,"score_gpt":0.2282391988132924,"score_spread":0.21661392057621054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1638930871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1342142,0.0002401133,0.8624311,0.0016844854,0.00020565787,0.00024278434,0.0000041413855,0.00029943802,0.0006780545],"genre_scores_gemma":[0.9839555,0.00007535395,0.014758672,0.0011139752,0.000038197515,0.000011244833,0.000036300175,0.0000043780524,0.0000063590196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987027,0.000044112156,0.0005206995,0.00015422469,0.0003373972,0.00024085579],"domain_scores_gemma":[0.9992633,0.00004770845,0.00029535074,0.00013545055,0.00014391677,0.000114300055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000268225,0.00018074774,0.0001502063,0.00028658775,0.00039961428,0.00088497245,0.00017583767,0.00006459315,0.000008097664],"category_scores_gemma":[0.000027908098,0.00016550465,0.000029201321,0.00034225287,0.00004616396,0.004505073,0.00014254368,0.00014802541,0.000061435116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003997294,0.000019811981,0.00009708094,0.000100074416,0.0000066094462,6.9563055e-7,0.008013499,0.004399413,0.0000063180046,0.03691688,0.0006493537,0.94978625],"study_design_scores_gemma":[0.0005383493,0.0001276157,0.0023912012,0.000045800232,0.00000489375,0.00006268113,0.00033046227,0.9821113,0.000018126027,0.0042550634,0.00990172,0.0002128035],"about_ca_topic_score_codex":0.000017000119,"about_ca_topic_score_gemma":6.957487e-7,"teacher_disagreement_score":0.97771186,"about_ca_system_score_codex":0.000029735218,"about_ca_system_score_gemma":0.000020827036,"threshold_uncertainty_score":0.853381},"labels":[],"label_agreement":null},{"id":"W1642510076","doi":"10.26421/qic5.45-6","title":"Stabilizing qubit coherence via tracking-control","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamical decoupling; Qubit; Quantum decoherence; Coherence (philosophical gambling strategy); Coherence time; Control theory (sociology); Quantum; Hamiltonian (control theory); Markov process; Decoupling (probability); Computer science; Control (management); Mathematics; Quantum mechanics; Physics; Mathematical optimization; Artificial intelligence; Control engineering; Engineering; Statistics","score_opus":0.008980207097274944,"score_gpt":0.23467951403764,"score_spread":0.22569930694036505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1642510076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123674676,0.00007453218,0.87357754,0.0016970977,0.0002138721,0.00017714548,0.000002004185,0.00029152117,0.0002916049],"genre_scores_gemma":[0.9644793,0.0000043099685,0.034312498,0.0010787884,0.00009734894,0.000007986873,0.0000104103865,0.000004574071,0.000004769019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988328,0.00005761853,0.00042176544,0.00018104022,0.00027330077,0.00023347171],"domain_scores_gemma":[0.9992785,0.00011045286,0.00020719887,0.00016498387,0.00014240589,0.00009645378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033626877,0.00015190865,0.00015329878,0.00016298599,0.00026093706,0.000435553,0.0002484233,0.000056907887,0.000005907375],"category_scores_gemma":[0.000026259668,0.00014008724,0.00004289967,0.00027020235,0.00003477681,0.0021846103,0.00006469209,0.00016011618,0.00008145929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064490764,0.000019739273,0.00012302781,0.000020198739,0.0000070749848,5.379479e-7,0.0021606092,0.075547,0.00007549904,0.0148594,0.00012091616,0.90705955],"study_design_scores_gemma":[0.000624174,0.000086984604,0.0039803595,0.000019753394,0.000003625168,0.000040489937,0.00006938222,0.9874254,0.000121382625,0.004145415,0.0032993678,0.00018368106],"about_ca_topic_score_codex":0.00001697723,"about_ca_topic_score_gemma":0.000004106113,"teacher_disagreement_score":0.9118784,"about_ca_system_score_codex":0.000032386182,"about_ca_system_score_gemma":0.00004211675,"threshold_uncertainty_score":0.5712592},"labels":[],"label_agreement":null},{"id":"W1643360887","doi":"10.26421/qic8.3-4-7","title":"Universal fault tolerant quantum computation on bilinear nearest neighbor arrays","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Qubit; Quantum circuit; Word error rate; Upper and lower bounds; Quantum; Computation; Quantum error correction; Fault tolerance; Computer science; Algorithm; Mathematics; Topology (electrical circuits); Physics; Quantum mechanics; Combinatorics; Mathematical analysis","score_opus":0.014404918950552008,"score_gpt":0.234745910412612,"score_spread":0.22034099146206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1643360887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34783,0.00002415012,0.64951676,0.0012244252,0.00046615966,0.00021714387,0.0000071920226,0.00035649064,0.0003576865],"genre_scores_gemma":[0.9802517,0.000030906813,0.0185079,0.0009628851,0.0001053623,0.0000062230565,0.00011139791,0.000012391381,0.000011201184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998048,0.00011683991,0.0005941178,0.00034621533,0.00054629875,0.0003485438],"domain_scores_gemma":[0.9987912,0.00020396976,0.000332681,0.00024188902,0.0002518958,0.00017832771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025712658,0.0002933214,0.00026833505,0.00040459042,0.0007049906,0.0003163281,0.00032238287,0.00011458421,0.0000047237054],"category_scores_gemma":[0.000046274505,0.00026894364,0.00008666405,0.0006091085,0.000106974716,0.0015216589,0.000119077136,0.00030396634,0.0001459986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007421629,0.00013216436,0.00014957089,0.000062673964,0.00002923569,0.000026920501,0.007527675,0.74616134,0.000055152414,0.09851101,0.0017646332,0.14550544],"study_design_scores_gemma":[0.0010009935,0.0004428229,0.0052732234,0.000047288908,0.0000052746245,0.00013772101,0.00019065698,0.9867711,0.0000689691,0.0027992174,0.0029267122,0.00033602837],"about_ca_topic_score_codex":0.00006889177,"about_ca_topic_score_gemma":0.0000017849089,"teacher_disagreement_score":0.63242173,"about_ca_system_score_codex":0.00006185126,"about_ca_system_score_gemma":0.00013573696,"threshold_uncertainty_score":0.9999763},"labels":[],"label_agreement":null},{"id":"W1644115585","doi":"10.26421/qic10.3-4-11","title":"Strong NP-hardness of the quantum separability problem","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":243,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Separable state; Combinatorics; Mathematics; Quantum entanglement; Separable space; Bipartite graph; Dimension (graph theory); Inverse; Simple (philosophy); Quantum; Quantum state; State (computer science); Upper and lower bounds; Discrete mathematics; TRACE (psycholinguistics); Density matrix; Quantum discord; Quantum mechanics; Physics; Algorithm; Mathematical analysis; Geometry","score_opus":0.007837065178921783,"score_gpt":0.24050588659340416,"score_spread":0.2326688214144824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644115585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5644844,0.000008926865,0.43329597,0.00087820063,0.0006899945,0.00020660162,0.0000043083423,0.000094910225,0.00033671444],"genre_scores_gemma":[0.9873128,0.0000017759113,0.012445048,0.00018439228,0.000031980402,0.000006839088,0.0000079052625,0.0000037004668,0.0000055368337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987927,0.00007396225,0.00046978428,0.0001619128,0.000320377,0.00018124843],"domain_scores_gemma":[0.9989934,0.000084782696,0.00034026598,0.00031858712,0.00019946363,0.000063516265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957249,0.00013558922,0.00015132957,0.000095777985,0.0002564403,0.00018493799,0.00044401063,0.000071517694,0.000003433682],"category_scores_gemma":[0.000051232022,0.00009584714,0.00006741806,0.0003766364,0.00010749756,0.0009035163,0.00021028402,0.00029333073,0.000008400087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015298718,0.00009037531,0.002734302,0.00020160667,0.000021140708,3.610016e-7,0.005879596,0.026587581,0.0006669177,0.68383104,0.0005744329,0.27939737],"study_design_scores_gemma":[0.00027345942,0.00005453172,0.02281252,0.000017662456,0.000003896006,0.00002563426,0.0000623784,0.95152783,0.00027885626,0.023049204,0.0017721342,0.00012189374],"about_ca_topic_score_codex":0.000043463264,"about_ca_topic_score_gemma":0.0000068198074,"teacher_disagreement_score":0.9249402,"about_ca_system_score_codex":0.000010392518,"about_ca_system_score_gemma":0.00008820606,"threshold_uncertainty_score":0.3908533},"labels":[],"label_agreement":null},{"id":"W1650080385","doi":"10.26421/qic13.7-8-4","title":"Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Hadamard transform; Conjecture; Qubit; Equivalence (formal languages); Mathematics; Discrete mathematics; Ring (chemistry); Combinatorics; Quantum; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.007051825671954051,"score_gpt":0.2003256337283936,"score_spread":0.19327380805643954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650080385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678661,0.00012362123,0.32053703,0.00038062275,0.000054874497,0.00012670763,0.0000048930574,0.00005957544,0.00005165765],"genre_scores_gemma":[0.9889169,0.000028055989,0.010868026,0.00014388375,0.000009863603,0.0000076628885,0.000018837754,0.0000038777416,0.0000028973193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991526,0.000050505598,0.00034639874,0.00014156193,0.00016134574,0.00014757729],"domain_scores_gemma":[0.9993155,0.0001805414,0.00019984896,0.0000924498,0.00013148125,0.000080195125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015809818,0.00013356368,0.00016277622,0.00014771885,0.00018876232,0.0003826179,0.00009614045,0.000050456318,0.0000024810622],"category_scores_gemma":[0.00004278724,0.00011280784,0.000016435724,0.00020749075,0.000097830074,0.0006424271,0.00010074548,0.000069230686,0.000004517015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009914656,0.000056320256,0.00045363628,0.00015082887,0.00002439022,3.6035064e-7,0.0041741906,0.03388863,0.0014996725,0.016291892,0.00040949328,0.94304067],"study_design_scores_gemma":[0.00022339524,0.00012372105,0.003972321,0.000039504645,0.000005364307,0.0000180907,0.00023879737,0.9922647,0.0013023403,0.0014730417,0.00020203419,0.00013669707],"about_ca_topic_score_codex":0.00007893689,"about_ca_topic_score_gemma":7.964529e-7,"teacher_disagreement_score":0.95837605,"about_ca_system_score_codex":0.00000900351,"about_ca_system_score_gemma":0.000015663285,"threshold_uncertainty_score":0.460017},"labels":[],"label_agreement":null},{"id":"W1655223664","doi":"10.26421/qic5.1-4","title":"Some attacks on quantum-based cryptographic protocols","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Encryption; Cryptography; Key (lock); Quantum cryptography; Theoretical computer science; Brute-force attack; Secure communication; BB84; Watermarking attack; Cryptographic primitive; Computer security; Key generation; Cryptographic protocol; Quantum; Public-key cryptography; Deterministic encryption; Quantum information; Physics; Quantum mechanics","score_opus":0.01956889494904168,"score_gpt":0.2843809318125789,"score_spread":0.2648120368635372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655223664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04056194,0.000039163362,0.94961375,0.0035642136,0.00024797526,0.003286838,0.000008537527,0.000792528,0.0018850487],"genre_scores_gemma":[0.9783886,0.000020420179,0.011753854,0.00871515,0.00009977916,0.0009323996,0.00007510954,0.000010115448,0.0000045496713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793035,0.000080888836,0.0008037082,0.00023330048,0.000612706,0.0003390733],"domain_scores_gemma":[0.99868673,0.00010289918,0.0004258123,0.00036414867,0.00023140079,0.00018903035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004693852,0.0002734642,0.00021924717,0.00088774547,0.000371327,0.0007468914,0.0004120693,0.00012530191,0.000018877477],"category_scores_gemma":[0.00003446382,0.00025322125,0.00012175601,0.0007916206,0.00007963758,0.005938365,0.000059217084,0.00022157599,0.0005027318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004144088,0.0000881767,0.000110259105,0.00006599688,0.000010845617,4.2273672e-7,0.00081403874,0.010660969,0.00001849879,0.87049145,0.0020133879,0.115684524],"study_design_scores_gemma":[0.001390361,0.00037225822,0.0036089811,0.000063489504,0.0000040375753,0.000008096062,0.00009659536,0.9317386,0.00029198712,0.016251717,0.045835536,0.00033834256],"about_ca_topic_score_codex":0.000005911712,"about_ca_topic_score_gemma":0.0000012248939,"teacher_disagreement_score":0.9378599,"about_ca_system_score_codex":0.000043412812,"about_ca_system_score_gemma":0.00009764966,"threshold_uncertainty_score":0.999992},"labels":[],"label_agreement":null},{"id":"W1656042709","doi":"10.26421/qic11.7-8-2","title":"Geometric entanglement of one-dimensional systems: bounds and scalings in the thermodynamic limit","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Quantum entanglement; Thermodynamic limit; Scaling; Scaling limit; Mathematics; Dimension (graph theory); Invariant (physics); Quantum; Matrix product state; Upper and lower bounds; Limit (mathematics); Quantum system; Translational symmetry; Statistical physics; Quantum mechanics; Physics; Pure mathematics; Mathematical physics; Mathematical analysis; Geometry","score_opus":0.025488210774101485,"score_gpt":0.22646949030209412,"score_spread":0.20098127952799263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1656042709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65586627,0.00012744986,0.34178948,0.00012386644,0.00011917174,0.0002690622,0.0000032727537,0.000039812923,0.0016616166],"genre_scores_gemma":[0.99761415,0.000044542958,0.0018893174,0.00040746064,0.000004756136,0.00001700879,0.000019850037,0.0000019880856,9.229094e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882627,0.00006653816,0.00054522464,0.00008950219,0.00034353093,0.00012893598],"domain_scores_gemma":[0.999346,0.00007724994,0.00028722244,0.00013266,0.00011822059,0.000038629143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066379656,0.00009899025,0.00012397663,0.0005955587,0.000103346036,0.00016530964,0.0002008624,0.000045165074,0.000004556737],"category_scores_gemma":[0.000015579753,0.00007612677,0.000028314002,0.0007425654,0.000057099045,0.0016509801,0.000060503506,0.00008121796,0.000009028697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028531485,0.0001226204,0.0023427752,0.00018440663,0.000024531399,5.3485854e-7,0.026433026,0.00077131024,0.000025803287,0.91364825,0.000113100985,0.056305107],"study_design_scores_gemma":[0.00056757726,0.00016870828,0.085469484,0.000040521416,0.000005286888,0.000017895767,0.002117564,0.90461123,0.00003021425,0.0065860273,0.00026527772,0.000120223325],"about_ca_topic_score_codex":0.00010497335,"about_ca_topic_score_gemma":0.0000031833995,"teacher_disagreement_score":0.90706223,"about_ca_system_score_codex":0.000016258087,"about_ca_system_score_gemma":0.000026709866,"threshold_uncertainty_score":0.31043595},"labels":[],"label_agreement":null},{"id":"W1656253992","doi":"10.26421/qic7.3-5","title":"Optimal fingerprinting strategies with one-sided error","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fingerprint (computing); Computer science; Set (abstract data type); Message passing; Probability of error; Quantum; Algorithm; Theoretical computer science; Mathematics; Distributed computing; Computer security","score_opus":0.017422861342929044,"score_gpt":0.26120874756328366,"score_spread":0.24378588622035463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1656253992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4587525,0.000021054651,0.53786695,0.00003327903,0.000017748414,0.00008004249,6.7522313e-7,0.00043396486,0.0027937319],"genre_scores_gemma":[0.9657029,0.000021635455,0.03415286,0.000049448325,0.000010280948,0.0000072266434,0.000046929723,0.000007666101,0.0000010445515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994068,0.0000093631825,0.0002890031,0.000044739478,0.00013112451,0.00011894672],"domain_scores_gemma":[0.9996423,0.00006509692,0.000074237534,0.00009320577,0.0000889303,0.00003622051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002458358,0.0000869689,0.00008394667,0.00014943967,0.0000829785,0.00015977703,0.00006710468,0.000048573907,0.0000050382223],"category_scores_gemma":[0.0000106816415,0.00008916952,0.000011723561,0.00014525403,0.000029142575,0.0013370203,0.0000196421,0.00011748264,0.0000123843865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101284095,0.00005411972,0.0006226504,0.00047209702,0.00008232106,0.0000019928605,0.023399627,0.48959842,0.0021578749,0.179431,0.00035099767,0.3037276],"study_design_scores_gemma":[0.00030387685,0.00005904335,0.011206398,0.000079949976,0.0000064769133,0.000011682986,0.0037670007,0.9789284,0.003291966,0.0010557139,0.0010824954,0.00020701544],"about_ca_topic_score_codex":0.000014368293,"about_ca_topic_score_gemma":0.000011862199,"teacher_disagreement_score":0.5069504,"about_ca_system_score_codex":0.000027549955,"about_ca_system_score_gemma":0.00001450849,"threshold_uncertainty_score":0.36362275},"labels":[],"label_agreement":null},{"id":"W1656852723","doi":"10.26421/qic10.7-8-1","title":"Universal quantum computation in a hidden basis","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Mitacs; Government of Canada; Canadian Institute for Advanced Research","keywords":"Invariant (physics); Mathematics; Bounded function; Quantum computer; Qubit; Quantum state; Discrete mathematics; Quantum algorithm; Quantum; Basis (linear algebra); Quantum cryptography; Quantum information; Quantum mechanics; Physics; Mathematical physics","score_opus":0.00912050367646916,"score_gpt":0.2356457788599702,"score_spread":0.22652527518350105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1656852723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3879827,0.0000087149965,0.60773903,0.0008213917,0.00050740485,0.00022432953,0.000002751785,0.00024025163,0.0024734149],"genre_scores_gemma":[0.9817943,0.000020217467,0.01731273,0.00073628576,0.000024007713,0.000014965826,0.00008761871,0.0000058592937,0.0000040066475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841225,0.0000639108,0.00067056296,0.00019665291,0.00038365088,0.0002730002],"domain_scores_gemma":[0.99903864,0.00010482875,0.00031045396,0.0001944693,0.00021393936,0.00013765151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907205,0.00019682736,0.00018872798,0.0008914131,0.00020090742,0.000505818,0.00030454303,0.00013519455,0.000023853356],"category_scores_gemma":[0.00004812879,0.0002023784,0.00006226136,0.0009925229,0.00007344784,0.0056138556,0.000099657045,0.00032201238,0.00020502976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022801594,0.0000510002,0.0011876792,0.000047189715,0.00000949786,0.0000021286485,0.00485393,0.0015019589,0.00012979217,0.7200892,0.0006146587,0.2714902],"study_design_scores_gemma":[0.0010331401,0.00008293933,0.027593618,0.00001698263,0.000003693821,0.000030482082,0.00077095116,0.9449656,0.00007613587,0.022278924,0.0028889119,0.00025860374],"about_ca_topic_score_codex":0.00008758757,"about_ca_topic_score_gemma":0.000033872162,"teacher_disagreement_score":0.9434637,"about_ca_system_score_codex":0.0000338427,"about_ca_system_score_gemma":0.00009620481,"threshold_uncertainty_score":0.8252751},"labels":[],"label_agreement":null},{"id":"W1670210972","doi":"10.5555/2011827.2011829","title":"Connections between relative entropy of entanglement and geometric measure of entanglement","year":2004,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Multipartite entanglement; Squashed entanglement; Kullback–Leibler divergence; W state; Bipartite graph; Multipartite; Upper and lower bounds; Mathematics; Entanglement distillation; Entropy (arrow of time); Entanglement witness; Quantum discord; Measure (data warehouse); Quantum mechanics; Statistical physics; Physics; Combinatorics; Quantum; Statistics; Mathematical analysis; Computer science","score_opus":0.013079892170841798,"score_gpt":0.24334480686108073,"score_spread":0.23026491469023894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670210972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37738684,0.00009043474,0.62176263,0.00041125133,0.000079456615,0.00015555734,0.000010710808,0.00003284548,0.00007026449],"genre_scores_gemma":[0.9767718,0.00002785298,0.023092916,0.000054261636,0.000017223674,0.0000042331503,0.000027905273,0.0000028421928,0.0000010144017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884194,0.000044520657,0.00053053943,0.00012989361,0.00032219972,0.0001309116],"domain_scores_gemma":[0.9991131,0.00011092291,0.00041446372,0.00011076933,0.00018521893,0.00006551799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003051086,0.00011575264,0.00019077041,0.00040569378,0.00012738192,0.000056137877,0.00011856717,0.00004341748,0.000001981155],"category_scores_gemma":[0.000040532108,0.00010575626,0.000040702012,0.00057908276,0.00005649339,0.00069743337,0.000099407975,0.00009389524,0.0000023096686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017544004,0.00010580673,0.0037442304,0.00017813579,0.00011405248,7.9013336e-7,0.010796907,0.031364486,0.00019665151,0.63206464,0.00004008241,0.32137665],"study_design_scores_gemma":[0.004766344,0.0017704967,0.10173537,0.00030494021,0.00007885246,0.000043789445,0.0014225655,0.7949619,0.0060109263,0.08728035,0.0011105947,0.0005138491],"about_ca_topic_score_codex":0.00006197182,"about_ca_topic_score_gemma":0.0000016050216,"teacher_disagreement_score":0.7635974,"about_ca_system_score_codex":0.0000404475,"about_ca_system_score_gemma":0.000052115513,"threshold_uncertainty_score":0.43126154},"labels":[],"label_agreement":null},{"id":"W1677920491","doi":"10.26421/qic8.3-4-1","title":"Accuracy threshold for postselected quantum computation","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Postselection; Mathematical proof; Quantum computer; Quantum error correction; Algorithm; Noise (video); Discrete mathematics; Computation; Mathematics; Code (set theory); Computer science; Quantum; Quantum mechanics; Quantum entanglement; Physics","score_opus":0.018135723265800315,"score_gpt":0.26221481266514446,"score_spread":0.24407908939934414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1677920491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27075076,0.00007630288,0.72710115,0.0007666433,0.00036009573,0.00041270768,0.0000069204157,0.0004000584,0.00012537059],"genre_scores_gemma":[0.95724857,0.00003398719,0.04162061,0.00079221575,0.00007945917,0.000025669868,0.00018087911,0.000011291702,0.0000073049864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836487,0.00005129359,0.0006025363,0.00028437126,0.0003568096,0.00034010623],"domain_scores_gemma":[0.9986113,0.00029051065,0.00037474034,0.00019050286,0.00040410444,0.00012886385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915878,0.0002387716,0.00023881649,0.00031999644,0.00071183156,0.0003108804,0.00029818658,0.00010130119,0.0000018492053],"category_scores_gemma":[0.000091343034,0.00022709856,0.000084321044,0.00052998454,0.00006528666,0.001937723,0.00010553379,0.00017482077,0.000032596356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014816485,0.00016222103,0.0006196237,0.00020987583,0.000073053656,0.0000058866076,0.009025979,0.13766629,0.00020323362,0.24448939,0.0071749846,0.6002213],"study_design_scores_gemma":[0.0011337936,0.00033811008,0.009398575,0.000024353203,0.000006226505,0.00011756109,0.000057341178,0.97174466,0.00009561635,0.015081523,0.0017089499,0.00029327974],"about_ca_topic_score_codex":0.00001908708,"about_ca_topic_score_gemma":7.3723766e-7,"teacher_disagreement_score":0.8340784,"about_ca_system_score_codex":0.000043008054,"about_ca_system_score_gemma":0.00013031586,"threshold_uncertainty_score":0.926081},"labels":[],"label_agreement":null},{"id":"W1678454200","doi":"10.26421/qic6.2-3","title":"The computational power of the W and GHZ states","year":2006,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multipartite; Impossibility; State (computer science); Mathematical proof; Quantum entanglement; Context (archaeology); Quantum state; LOCC; Quantum computer; Cluster state; Mathematics; Power (physics); Symmetry (geometry); Quantum; Discrete mathematics; Computer science; Quantum mechanics; Physics; Algorithm; Law","score_opus":0.0038002727032816737,"score_gpt":0.2064399048298038,"score_spread":0.2026396321265221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678454200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46442515,0.00013491485,0.5326807,0.0021975015,0.00019110882,0.00012080015,0.0000035799046,0.00004714578,0.00019909747],"genre_scores_gemma":[0.9937093,0.0000097931215,0.006001382,0.00024310971,0.000013753189,0.0000024965002,0.000009459208,0.0000022589777,0.000008420762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918294,0.000053953256,0.00031923412,0.000087518114,0.00024011568,0.0001162174],"domain_scores_gemma":[0.9992936,0.00022544488,0.0002195204,0.000114904,0.00012256413,0.000023963856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025123404,0.000086317435,0.00007711608,0.00005217751,0.00044305538,0.00026250267,0.00019478054,0.000026534772,5.034191e-7],"category_scores_gemma":[0.000016385919,0.000050215876,0.000028277589,0.00021418177,0.00011657818,0.00041619953,0.0001320047,0.00008504403,0.000002362028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008792096,0.000021963711,0.00087725313,0.000030955387,0.000012500901,2.315224e-7,0.0027626024,0.38519773,0.000011849977,0.46443617,0.0012913706,0.14534856],"study_design_scores_gemma":[0.00019104416,0.00003411878,0.051028207,0.000011557391,0.0000017846719,0.000016491496,0.00010498901,0.86190194,0.000022995264,0.08480712,0.0018190275,0.00006074023],"about_ca_topic_score_codex":0.000042824428,"about_ca_topic_score_gemma":0.000003105699,"teacher_disagreement_score":0.5292842,"about_ca_system_score_codex":0.000007957202,"about_ca_system_score_gemma":0.000033826058,"threshold_uncertainty_score":0.34076688},"labels":[],"label_agreement":null},{"id":"W1694870297","doi":"10.26421/qic15.7-8-9","title":"Solution to time-energy costs of quantum channels","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Hong Kong Polytechnic University; National Science Foundation","keywords":"Semidefinite programming; Channel (broadcasting); Energy (signal processing); Quantum; Quantum capacity; Mathematics; Energy cost; Upper and lower bounds; Amplitude damping channel; Class (philosophy); Quantum mechanics; Quantum operation; Physics; Computer science; Mathematical optimization; Mathematical analysis; Telecommunications; Open quantum system","score_opus":0.013891984745470591,"score_gpt":0.2420369850322335,"score_spread":0.2281450002867629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1694870297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0674832,0.000045819797,0.9301953,0.0010898743,0.00048741105,0.0001265453,0.0000036851252,0.00016376049,0.00040445232],"genre_scores_gemma":[0.9824988,0.000004507848,0.016762834,0.00061421527,0.0000548676,0.000007151624,0.000036936093,0.0000053487283,0.000015328642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874854,0.000073253395,0.00044266606,0.000164484,0.00036394925,0.00020709285],"domain_scores_gemma":[0.99900335,0.000061031576,0.00023075042,0.0001753891,0.00032892637,0.00020052404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000417323,0.00014286218,0.00018331526,0.00032142104,0.00010875058,0.0001787953,0.0002513764,0.000062385414,0.0000014510836],"category_scores_gemma":[0.0000614372,0.00013450847,0.00003758988,0.00051479664,0.00002989959,0.0010018781,0.00017198209,0.000074323834,0.00006808619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037791415,0.000053980555,0.000023127996,0.00003167864,0.000016723103,0.0000012745247,0.005523537,0.18398376,0.000157071,0.30706435,0.0054041,0.49770263],"study_design_scores_gemma":[0.00040875163,0.00031945886,0.00020569151,0.000040834224,0.0000029813762,0.000022577819,0.00008906466,0.98504895,0.0002370152,0.010622628,0.0028380745,0.00016397166],"about_ca_topic_score_codex":0.00011675268,"about_ca_topic_score_gemma":0.0000010642066,"teacher_disagreement_score":0.91501564,"about_ca_system_score_codex":0.000048978436,"about_ca_system_score_gemma":0.00008842732,"threshold_uncertainty_score":0.54850966},"labels":[],"label_agreement":null},{"id":"W1797017151","doi":"10.5555/2011814.2011818","title":"An O(m 2 )-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2 m ) a","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Elliptic curve point multiplication; Elliptic curve; Discrete logarithm; Logarithm; Quantum algorithm; Homogeneous coordinates; Algorithm; Quantum; Polynomial; Discrete mathematics; Quantum computer; Post-quantum cryptography; Tripling-oriented Doche–Icart–Kohel curve; Schoof's algorithm; Mathematical analysis; Pure mathematics; Computer science; Public-key cryptography; Physics; Quantum mechanics; Quarter period","score_opus":0.011349961371549014,"score_gpt":0.26865371187899145,"score_spread":0.2573037505074424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797017151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048327805,0.00014637235,0.992499,0.0012076545,0.00030386078,0.00065397116,0.000009787507,0.00019065652,0.00015593563],"genre_scores_gemma":[0.9100833,0.00008790881,0.08830441,0.0012907953,0.00007770766,0.000048170437,0.00009179841,0.00000661652,0.000009290922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987559,0.00006243934,0.00041871192,0.00020947777,0.00028997974,0.0002635435],"domain_scores_gemma":[0.9990867,0.0001619315,0.0002181983,0.00026912303,0.00016484883,0.00009924711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046102714,0.00017477824,0.00014869128,0.00019964654,0.0004695929,0.0006768528,0.00035494717,0.000076175995,0.0000023735013],"category_scores_gemma":[0.000013344918,0.00012378872,0.00008357874,0.00043413573,0.000060736398,0.0025528565,0.00003651254,0.00013000677,0.000012329875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012419937,0.00004794676,0.00003208712,0.00002115643,0.000016729775,5.5447697e-7,0.0021433437,0.0047970507,0.0000118804355,0.2505537,0.0004053879,0.7419578],"study_design_scores_gemma":[0.0006388427,0.0004608145,0.011843079,0.000016726623,0.00001556041,0.000018758787,0.00023140931,0.93040556,0.000027193775,0.05325678,0.002895661,0.00018964075],"about_ca_topic_score_codex":0.00003383893,"about_ca_topic_score_gemma":0.000005143271,"teacher_disagreement_score":0.92560846,"about_ca_system_score_codex":0.000018926587,"about_ca_system_score_gemma":0.00004718143,"threshold_uncertainty_score":0.6526907},"labels":[],"label_agreement":null},{"id":"W1814335797","doi":"10.26421/qic9.5-6-11","title":"On parallel composition of zero-knowledge proofs with black-box quantum","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Soundness; Black box; Quantum algorithm; Computer science; Quantum information; Quantum error correction; Mathematical proof; Quantum computer; Quantum; Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Quantum mechanics; Physics; Programming language; Geometry","score_opus":0.008054922050868881,"score_gpt":0.2395742102757454,"score_spread":0.23151928822487652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814335797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2759803,0.000029050972,0.72222507,0.00060726557,0.00009089849,0.00022569105,0.0000025360443,0.00015393349,0.0006852262],"genre_scores_gemma":[0.9792202,0.000008838536,0.020225085,0.0004642693,0.000022833525,0.000004277433,0.000044415785,0.0000049809487,0.000005107805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987151,0.00007084296,0.00046731695,0.00020805636,0.0003221896,0.00021649635],"domain_scores_gemma":[0.9990384,0.00010301295,0.00033773683,0.00021381775,0.00021520357,0.000091852875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002316972,0.00020360359,0.00022681495,0.0002885112,0.0001848055,0.00018239551,0.00023978586,0.00006947642,0.000001384697],"category_scores_gemma":[0.0000122463425,0.0001633647,0.000047268306,0.00042884288,0.000069385474,0.00090251834,0.00004283557,0.00016990727,0.00002877549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008931385,0.00020819469,0.00004280513,0.000089846624,0.000019022304,0.0000021866856,0.005385803,0.24636017,0.00010549071,0.5445863,0.00055462995,0.20255622],"study_design_scores_gemma":[0.00089725445,0.0012722476,0.0057867398,0.00012489413,0.000006464447,0.000028878752,0.000050231323,0.94932806,0.00020252538,0.041924633,0.00016580944,0.00021226112],"about_ca_topic_score_codex":0.0000058112787,"about_ca_topic_score_gemma":4.1120987e-7,"teacher_disagreement_score":0.7032399,"about_ca_system_score_codex":0.000025649364,"about_ca_system_score_gemma":0.00006230772,"threshold_uncertainty_score":0.6661819},"labels":[],"label_agreement":null},{"id":"W1835176839","doi":"10.5555/2011804.2011812","title":"Complete characterization of mixing time for the continuous quantum walk on the hypercube with markovian decoherence model","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Mixing (physics); Quantum walk; Quantum decoherence; Qubit; Hypercube; Statistical physics; Random walk; Mathematics; Markov process; Quantum; Degrees of freedom (physics and chemistry); Characterization (materials science); Quantum computer; Quantum mechanics; Physics; Discrete mathematics","score_opus":0.012013577616448296,"score_gpt":0.21855207732308773,"score_spread":0.20653849970663943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835176839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26628488,0.000011116127,0.7303936,0.002637731,0.000059640857,0.00043897238,0.000014847004,0.000066525936,0.000092723625],"genre_scores_gemma":[0.98937446,0.000008038878,0.008976133,0.0015184502,0.000027393611,0.000011572276,0.000071861,0.000004550206,0.000007513645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989504,0.00005526891,0.0003768093,0.0001579434,0.00027066894,0.00018890735],"domain_scores_gemma":[0.9988147,0.00035222896,0.00035345435,0.00023377882,0.00020480856,0.00004101349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003931579,0.0001621638,0.0001726953,0.000096748045,0.00038788488,0.00021233704,0.00035092252,0.000042684635,0.0000017086003],"category_scores_gemma":[0.000031754284,0.000091862275,0.00004721982,0.00025294907,0.000056627436,0.0005626411,0.000030666717,0.00012324018,0.000006681172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011781003,0.000049156573,0.000032736487,0.000043645625,0.000029878398,4.3040444e-7,0.0036491929,0.20744392,0.0015553549,0.19062337,0.000108899745,0.5963456],"study_design_scores_gemma":[0.00036302992,0.00039562432,0.007440489,0.000059075017,0.000009108496,0.000014139808,0.00006135128,0.98326373,0.00009215727,0.00798333,0.00018243055,0.00013553689],"about_ca_topic_score_codex":0.0000072013286,"about_ca_topic_score_gemma":6.035152e-7,"teacher_disagreement_score":0.7758198,"about_ca_system_score_codex":0.00001187539,"about_ca_system_score_gemma":0.000045180223,"threshold_uncertainty_score":0.37460348},"labels":[],"label_agreement":null},{"id":"W1837551539","doi":"10.26421/qic12.3-4-2","title":"Improved Data Post-Processing in Quantum Key Distribution and Application to Loss Thresholds in device independent QKD","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum key distribution; Computer science; Key (lock); Binary number; Scheme (mathematics); Transmittance; Algorithm; Mathematical proof; Quantum; Mathematics; Optics; Arithmetic; Computer security; Physics; Quantum mechanics","score_opus":0.01705356756772208,"score_gpt":0.27814270475661806,"score_spread":0.261089137188896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837551539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.390726,0.00009194087,0.60779965,0.0007513527,0.000101218546,0.00035423937,0.000021701817,0.00007593673,0.000077942736],"genre_scores_gemma":[0.99525124,0.00004032188,0.0026541105,0.0011676267,0.000022713135,0.000045361197,0.00081272604,0.0000053506815,5.656442e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982442,0.000061060135,0.00075121014,0.00024299602,0.00032041303,0.00038008115],"domain_scores_gemma":[0.9989763,0.000043284956,0.00028146143,0.0003338688,0.00017605576,0.00018902155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127739,0.00018901177,0.0001845418,0.0005000545,0.00015802095,0.00042235875,0.00039102905,0.00011526133,0.0000016691108],"category_scores_gemma":[0.00006612829,0.00019139696,0.00001830451,0.0009911393,0.00003832215,0.009523412,0.00032086857,0.00018766307,0.000030938583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012860296,0.00022729674,0.03375958,0.0003642259,0.000009613906,9.652839e-7,0.022787277,0.0033597737,0.00029642228,0.28356427,0.00024742517,0.65525454],"study_design_scores_gemma":[0.000633289,0.000054283842,0.16017959,0.000037324,0.0000031948373,0.000020203297,0.0010282218,0.8349933,0.000032360207,0.001158555,0.0016438665,0.00021583204],"about_ca_topic_score_codex":0.00018748024,"about_ca_topic_score_gemma":0.00008572382,"teacher_disagreement_score":0.8316335,"about_ca_system_score_codex":0.00008497494,"about_ca_system_score_gemma":0.00007059581,"threshold_uncertainty_score":0.78049415},"labels":[],"label_agreement":null},{"id":"W1845175544","doi":"10.26421/qic11.11-12-11","title":"Local extrema of entropy functions under tensor products","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Von Neumann entropy; Quantum relative entropy; Maxima and minima; Generalized relative entropy; Joint quantum entropy; Linear subspace; Tensor product; Pure mathematics; Entropy (arrow of time); Conditional entropy; Quantum; Mathematical analysis; Quantum entanglement; Physics; Quantum discord; Principle of maximum entropy; Quantum mechanics","score_opus":0.07027921761781727,"score_gpt":0.28906234364912203,"score_spread":0.21878312603130476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845175544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26903564,0.000006581499,0.7262562,0.00006898241,0.000086367356,0.00020520907,0.000004004909,0.00007968652,0.004257346],"genre_scores_gemma":[0.9871181,0.0000029620046,0.012736114,0.00006605679,0.000017987213,0.000009215853,0.000016012318,0.0000074636587,0.000026065714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991489,0.0000380218,0.00043748503,0.000077266246,0.0001855467,0.00011278976],"domain_scores_gemma":[0.99924624,0.00013602713,0.0002401449,0.00012670044,0.00020853154,0.00004233126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019625199,0.00010315396,0.0001565426,0.00009002954,0.000064071995,0.00001905979,0.00005713105,0.000045628913,0.00008013368],"category_scores_gemma":[0.00012233615,0.00008823734,0.000034553006,0.00018142098,0.00010647081,0.00056666066,0.000021431135,0.00007426354,0.000084100764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033319495,0.00009161489,0.000018185528,0.00017867389,0.000018793993,1.2285442e-7,0.002193867,0.00014114812,0.00010704794,0.9924144,0.00027959427,0.0045232465],"study_design_scores_gemma":[0.00030148734,0.000106869025,0.0010783547,0.00002996704,0.000030227598,0.000008852483,0.0018732899,0.061848037,0.0018653821,0.9326934,0.00005850538,0.00010561498],"about_ca_topic_score_codex":0.0000071551426,"about_ca_topic_score_gemma":5.4707374e-7,"teacher_disagreement_score":0.7180825,"about_ca_system_score_codex":0.000022605276,"about_ca_system_score_gemma":0.000023544613,"threshold_uncertainty_score":0.35982144},"labels":[],"label_agreement":null},{"id":"W1850344377","doi":"10.26421/qic8.10-8","title":"On the iterative decoding of sparse quantum codes","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Belief propagation; Decoding methods; Algorithm; List decoding; Theoretical computer science; Sequential decoding; Quantum computer; Quantum error correction; Quantum; Concatenated error correction code; Block code; Quantum mechanics; Physics","score_opus":0.020854610964425476,"score_gpt":0.2456400102863635,"score_spread":0.22478539932193803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850344377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48342764,0.000020729229,0.5152891,0.00070023804,0.00012733,0.00010017859,0.0000025915292,0.000060679355,0.000271492],"genre_scores_gemma":[0.9928283,0.000027826818,0.006292456,0.0008048524,0.0000202641,0.0000053116496,0.000013328131,0.0000032890757,0.000004377067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989874,0.000088461085,0.00037398946,0.00012523144,0.0002775626,0.0001473635],"domain_scores_gemma":[0.9989748,0.00040666203,0.00026394363,0.00016812386,0.00013957985,0.000046918434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029385637,0.00012820662,0.00014600669,0.00015579938,0.00039472786,0.00011259632,0.00023919586,0.00003875963,0.0000035730952],"category_scores_gemma":[0.00007721315,0.00008772572,0.000045772587,0.0003102569,0.00008902773,0.00062096055,0.000080846534,0.00013947365,0.000022468068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019700981,0.00004121869,0.00010863816,0.000030155827,0.000018922363,0.0000026635114,0.01448653,0.064177655,0.000042109306,0.86791414,0.0012698339,0.051888417],"study_design_scores_gemma":[0.00023392748,0.0001679804,0.0023573604,0.000040368697,0.0000020371142,0.000045434284,0.00017503799,0.97522503,0.00027338925,0.021026859,0.00034398775,0.00010861312],"about_ca_topic_score_codex":0.000018608698,"about_ca_topic_score_gemma":6.007098e-7,"teacher_disagreement_score":0.91104734,"about_ca_system_score_codex":0.000013477763,"about_ca_system_score_gemma":0.000042219304,"threshold_uncertainty_score":0.3577351},"labels":[],"label_agreement":null},{"id":"W1874981471","doi":"10.26421/qic6.2-1","title":"Quantum accuracy threshold for concatenated distance-3 code","year":2006,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":403,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Concatenation (mathematics); Upper and lower bounds; Discrete mathematics; Code (set theory); Quantum; Noise (video); Mathematics; Algorithm; Hilbert space; Computer science; Combinatorics; Quantum mechanics; Physics; Pure mathematics; Mathematical analysis","score_opus":0.012567929584098667,"score_gpt":0.25517935192091673,"score_spread":0.24261142233681807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874981471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10114409,0.00010378481,0.89597017,0.0012313846,0.00041318755,0.00037723235,0.000024153536,0.00037641014,0.00035957107],"genre_scores_gemma":[0.98181814,0.000011058536,0.017287994,0.0005233953,0.00008830881,0.000030543106,0.00021344666,0.00000874257,0.000018362161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986357,0.00002955979,0.00054888363,0.00023408385,0.00025176787,0.00029998232],"domain_scores_gemma":[0.9989822,0.00022099898,0.0003196664,0.00019059861,0.00021284481,0.00007367159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028876192,0.0001965341,0.00019333561,0.0001754373,0.00038126152,0.00054529234,0.00029270395,0.0000783571,0.0000017787937],"category_scores_gemma":[0.000042839474,0.0001753513,0.00006704604,0.00033330417,0.00005290024,0.0014496406,0.000083986866,0.0001241022,0.000020306605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003041796,0.000047122274,0.00017823407,0.000095101546,0.000013325468,0.0000013821718,0.0008040556,0.05961084,0.00008519138,0.83558303,0.0040215277,0.09952975],"study_design_scores_gemma":[0.00083495636,0.000108735374,0.0024861144,0.000026085028,0.000005346509,0.000018894996,0.00005546558,0.91272616,0.0001354653,0.06937156,0.014001146,0.00023006542],"about_ca_topic_score_codex":0.00004465567,"about_ca_topic_score_gemma":0.000005832255,"teacher_disagreement_score":0.88067406,"about_ca_system_score_codex":0.000036471556,"about_ca_system_score_gemma":0.000055033823,"threshold_uncertainty_score":0.7150619},"labels":[],"label_agreement":null},{"id":"W1875311097","doi":"10.26421/qic14.11-12-2","title":"Channel covariance, twirling, contraction and some upper bounds on the quantum capacity","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pauli exclusion principle; Amplitude damping channel; Qubit; Quantum capacity; Classical capacity; Quantum channel; Mathematics; Pauli matrices; Quantum; Coherent information; Quantum information; Quantum mechanics; Topology (electrical circuits); Physics; Combinatorics; Mathematical physics; Quantum network","score_opus":0.01605739838643297,"score_gpt":0.2266483287338907,"score_spread":0.21059093034745774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875311097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17220056,0.000027401478,0.82147866,0.0032674102,0.0005577244,0.00028044934,0.000004270656,0.00021635149,0.0019671705],"genre_scores_gemma":[0.9926878,0.00006865955,0.0008938609,0.00621905,0.00006168954,0.000029599852,0.000027680631,0.0000053622857,0.0000062812032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858004,0.00012066193,0.00050454185,0.00017885528,0.00037445966,0.00024142445],"domain_scores_gemma":[0.99886066,0.00024549742,0.00035866516,0.00024363358,0.00018049176,0.00011108426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008645266,0.00019923571,0.00017238411,0.00029957082,0.000643272,0.00083823944,0.00021813952,0.0000991234,0.000006528367],"category_scores_gemma":[0.000099896126,0.00015092225,0.00005515135,0.0003355861,0.00011858946,0.0040359404,0.000058401598,0.00022329032,0.00010378815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015289841,0.000018097335,0.000034956505,0.000026300728,0.0000104380715,7.130588e-8,0.0018826219,0.00105216,0.000010427449,0.97822654,0.0008098837,0.017913235],"study_design_scores_gemma":[0.00055940234,0.00017022123,0.0052932394,0.000027158218,0.0000055657515,0.000018891717,0.00032667446,0.8747593,0.00006571295,0.10560373,0.012977791,0.00019227627],"about_ca_topic_score_codex":0.000030981184,"about_ca_topic_score_gemma":0.0000016826681,"teacher_disagreement_score":0.8737072,"about_ca_system_score_codex":0.000025263826,"about_ca_system_score_gemma":0.000029572431,"threshold_uncertainty_score":0.80831623},"labels":[],"label_agreement":null},{"id":"W1885607515","doi":"10.26421/qic12.7-8-6","title":"On the existence of loss-tolerant quantum oblivious transfer protocols","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oblivious transfer; Computer science; Protocol (science); Imperfect; Cryptographic protocol; Cryptography; Quantum; Theoretical computer science; Transfer (computing); Cryptographic primitive; Quantum cryptography; Alice (programming language); Distributed computing; Computer security; Quantum information; Physics; Parallel computing; Quantum mechanics; Philosophy","score_opus":0.026662484394489292,"score_gpt":0.2712085111103151,"score_spread":0.2445460267158258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885607515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22721569,0.000024802339,0.7672764,0.0007452398,0.00019907014,0.0022296354,0.000006188225,0.00013058262,0.0021723693],"genre_scores_gemma":[0.99708307,0.000012003189,0.0009686826,0.0014253323,0.00001894049,0.00046961376,0.000015141078,0.0000045524207,0.000002664161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983392,0.00009636561,0.0006828127,0.00010300668,0.00050351064,0.00027512788],"domain_scores_gemma":[0.9989634,0.00019905798,0.00023690242,0.00028670082,0.00020328761,0.00011065651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072881446,0.00017450737,0.0001770245,0.00026624018,0.00023626398,0.00022047473,0.00036145266,0.00007072875,0.000021226306],"category_scores_gemma":[0.00004371126,0.00012191117,0.000086384855,0.0005678346,0.00010883676,0.0033968322,0.000046351088,0.00015282937,0.00010649699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024213436,0.000058735703,0.00021180177,0.00006545168,0.00000923225,1.11338665e-7,0.0056045605,0.00034306364,0.000018877936,0.97759855,0.00035086888,0.015714545],"study_design_scores_gemma":[0.0010847361,0.00046098614,0.015000958,0.00014374417,0.000009710861,0.000041851315,0.0010387081,0.9295416,0.001057213,0.044514555,0.0067236815,0.00038227733],"about_ca_topic_score_codex":0.000010104114,"about_ca_topic_score_gemma":4.3148427e-7,"teacher_disagreement_score":0.933084,"about_ca_system_score_codex":0.000017868502,"about_ca_system_score_gemma":0.00004612574,"threshold_uncertainty_score":0.49713933},"labels":[],"label_agreement":null},{"id":"W1892605035","doi":"10.26421/qic11.5-6-8","title":"Depolarizing behavior of quantum channels in higher dimensions","year":2011,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Fidelity; Uniqueness; Quantum; Channel (broadcasting); Constant (computer programming); Quantum gate; Physics; Statistical physics; Mathematics; Computer science; Topology (electrical circuits); Quantum mechanics; Quantum algorithm; Mathematical analysis; Telecommunications; Combinatorics","score_opus":0.044911077829322764,"score_gpt":0.2698487394892635,"score_spread":0.22493766165994075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892605035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3078495,0.00024037842,0.68640697,0.00024746492,0.0022037397,0.00079338707,0.00002018382,0.00026238256,0.0019759843],"genre_scores_gemma":[0.99260473,0.00012908844,0.0066396743,0.00032960344,0.00002270661,0.00009071423,0.00016938166,0.000009886538,0.000004235822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975472,0.00009900865,0.0013518401,0.000269451,0.0004385955,0.00029389528],"domain_scores_gemma":[0.9981224,0.00006435935,0.0009740574,0.0004190185,0.00029479116,0.00012536878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047819008,0.00032275158,0.00042956576,0.0012074895,0.000120239994,0.00030161033,0.00050367217,0.00032728363,0.000019953333],"category_scores_gemma":[0.000024805951,0.0003272954,0.00013790367,0.000595105,0.00008097399,0.00255535,0.0005843479,0.0004781922,0.000039045484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024927807,0.00015550492,0.0012718715,0.0004403367,0.000031192263,0.000003017795,0.010129901,0.0046038185,0.00005231968,0.9531596,0.0002157277,0.029911807],"study_design_scores_gemma":[0.000779728,0.0001317561,0.023944998,0.0002674584,0.000026857773,0.000013927944,0.00039372774,0.9131113,0.00030415299,0.059941914,0.00056492497,0.00051925],"about_ca_topic_score_codex":0.00020978595,"about_ca_topic_score_gemma":0.000003953864,"teacher_disagreement_score":0.90850747,"about_ca_system_score_codex":0.0000434465,"about_ca_system_score_gemma":0.00013678306,"threshold_uncertainty_score":0.9999179},"labels":[],"label_agreement":null},{"id":"W1915559210","doi":"10.26421/qic11.9-10-4","title":"Private quantum channels, conditional expectations, and trace vectors","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"TRACE (psycholinguistics); Quantum; Quantum operation; Qubit; Conditional expectation; Mathematics; Quantum mechanics; Physics; Open quantum system; Statistics","score_opus":0.020294855639711628,"score_gpt":0.2345938230225276,"score_spread":0.21429896738281598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1915559210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22780971,0.00011973546,0.7696951,0.00030919025,0.0003352515,0.00023638229,0.000008341293,0.0002839014,0.0012024076],"genre_scores_gemma":[0.98991126,0.000049571026,0.009326564,0.0005355757,0.000021934948,0.00003630912,0.00010880293,0.000005680052,0.0000043180617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986609,0.000055839573,0.00056745915,0.00018065269,0.00031157356,0.00022352663],"domain_scores_gemma":[0.999141,0.00005944058,0.00030900558,0.00015876234,0.00017703956,0.00015477846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023661068,0.0001910621,0.00015949442,0.0004669615,0.00034330884,0.00037053504,0.00019832076,0.00008400938,0.000025517993],"category_scores_gemma":[0.000030535342,0.00018706908,0.000048398637,0.00044896954,0.00009805455,0.0051162257,0.00007606516,0.00012505292,0.00010969043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014718874,0.00003111188,0.00023829592,0.000039520346,0.00001593745,7.347132e-7,0.014047036,0.000075107135,0.000010321747,0.9646096,0.0004889252,0.020428654],"study_design_scores_gemma":[0.00092098385,0.0002179337,0.028902596,0.000025135969,0.000010250946,0.00007438368,0.0030629486,0.8682406,0.00026331656,0.094345585,0.0035505919,0.00038567747],"about_ca_topic_score_codex":0.000017934211,"about_ca_topic_score_gemma":9.687703e-7,"teacher_disagreement_score":0.87026405,"about_ca_system_score_codex":0.000018902423,"about_ca_system_score_gemma":0.00004126819,"threshold_uncertainty_score":0.7628455},"labels":[],"label_agreement":null},{"id":"W1957989937","doi":"10.26421/qic13.7-8-8","title":"Galois automorphisms of a symmetric measurement","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Institut Périmètre de physique théorique; Industry Canada; Government of Canada; John Templeton Foundation","keywords":"Mathematics; Galois group; Dimension (graph theory); Group (periodic table); Automorphism; Pure mathematics; Unitary state; Galois extension; Fundamental theorem of Galois theory; Embedding problem; Galois module; Discrete mathematics; Algebra over a field; Combinatorics","score_opus":0.03935692373493484,"score_gpt":0.2772729987160745,"score_spread":0.2379160749811397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957989937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6728541,0.000053498345,0.32528594,0.00018205002,0.00008875053,0.0002940728,0.0000024166484,0.00007422309,0.0011649372],"genre_scores_gemma":[0.992794,0.0000098741375,0.0070599616,0.00009047623,0.000009611578,0.000015671556,0.000010955028,0.000003677528,0.0000058201267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991541,0.000018557397,0.00037896875,0.000051167153,0.00030693124,0.00009030107],"domain_scores_gemma":[0.9992669,0.00007541501,0.00024261471,0.000068559515,0.00030448905,0.000042012372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021258007,0.00007516272,0.00012373328,0.00017712492,0.00004953251,0.000034572666,0.000039945342,0.000036270165,0.000044830802],"category_scores_gemma":[0.00015562458,0.00006583509,0.000026683749,0.0003272062,0.000029747487,0.00077379955,0.000017659597,0.00004676556,0.000063200016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009526688,0.000081552316,0.00048776623,0.00035877814,0.00003081716,1.3273959e-7,0.001172343,0.00031974085,0.00017814367,0.64121276,0.0022198432,0.3539286],"study_design_scores_gemma":[0.0007823098,0.00014382457,0.021086745,0.000057056066,0.000019587555,0.000007935482,0.0006334755,0.19857395,0.00063037814,0.7774517,0.00045651707,0.00015654578],"about_ca_topic_score_codex":0.000014381284,"about_ca_topic_score_gemma":7.575879e-7,"teacher_disagreement_score":0.35377204,"about_ca_system_score_codex":0.000031667318,"about_ca_system_score_gemma":0.000015386391,"threshold_uncertainty_score":0.2684677},"labels":[],"label_agreement":null},{"id":"W1959392488","doi":"10.26421/qic14.15-16-5","title":"Fault-Tolerant quantum computation with constant overhead","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; Canadian Institute for Advanced Research","funders":"Division of Mathematical Sciences; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Qubit; Quantum computer; Fault tolerance; Computer science; Quantum error correction; Overhead (engineering); Constant (computer programming); Quantum; Quantum convolutional code; Mathematics; Topology (electrical circuits); Discrete mathematics; Quantum mechanics; Physics; Distributed computing; Combinatorics","score_opus":0.007549946387218678,"score_gpt":0.22724153338666003,"score_spread":0.21969158699944136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959392488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18380171,0.000036086512,0.8134151,0.0009453865,0.00029375666,0.00023447628,0.0000039670103,0.00038638123,0.0008831384],"genre_scores_gemma":[0.961852,0.000009371479,0.03700885,0.0009796746,0.00005668288,0.000010269426,0.00006685994,0.0000107566275,0.000005515944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812734,0.00013539554,0.0005773442,0.00031368033,0.0005053341,0.00034089477],"domain_scores_gemma":[0.9987474,0.00021634968,0.00038161356,0.00022783788,0.00026521887,0.00016159663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048322236,0.00027625353,0.00028065345,0.00029007246,0.000421424,0.00062178366,0.0002670421,0.00008712028,0.000002681766],"category_scores_gemma":[0.000036952133,0.00022483585,0.00005082754,0.00048132308,0.000099839766,0.0015510855,0.00010869145,0.00022692248,0.00005579958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004671067,0.00005648967,0.00018652235,0.00010982759,0.000028110348,0.0000032855878,0.003293371,0.21199866,0.00003653461,0.33543092,0.0004785151,0.4483311],"study_design_scores_gemma":[0.0011337146,0.0004392556,0.003056978,0.000088409266,0.000008647642,0.00012159226,0.00016705664,0.97653466,0.000037510898,0.015381193,0.002689659,0.00034134637],"about_ca_topic_score_codex":0.00004478499,"about_ca_topic_score_gemma":0.0000039594033,"teacher_disagreement_score":0.7780503,"about_ca_system_score_codex":0.000036201134,"about_ca_system_score_gemma":0.000084420644,"threshold_uncertainty_score":0.91685396},"labels":[],"label_agreement":null},{"id":"W2001857026","doi":"10.26421/qic8.8-9-5","title":"Measuring 4-local qubit observables could probabilistically solve PSPACE","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Observable; Qubit; PSPACE; Operator (biology); Quantum; State (computer science); Probabilistic logic; Mathematics; Class (philosophy); Conjecture; Algorithm; Computer science; Discrete mathematics; Computational complexity theory; Quantum mechanics; Physics; Statistics","score_opus":0.031782315608792744,"score_gpt":0.23126836339907839,"score_spread":0.19948604779028564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001857026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13938898,0.000044586483,0.8586448,0.0007679965,0.00019448335,0.00018467182,0.0000021679725,0.00032087095,0.00045145038],"genre_scores_gemma":[0.9216784,0.000023874336,0.077611685,0.0005933937,0.000046710345,0.000010655348,0.000018163459,0.0000063614884,0.000010746491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861175,0.000049228383,0.0004293681,0.0002176602,0.00041764803,0.00027435116],"domain_scores_gemma":[0.9991792,0.00012292694,0.00017797964,0.0001593574,0.00022545322,0.00013510756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028767347,0.000181251,0.0001828519,0.00014794232,0.00048002513,0.00024329944,0.0002720438,0.000081009486,0.0000036392348],"category_scores_gemma":[0.000065042106,0.00016425468,0.00005121142,0.00033032845,0.00011290357,0.0013023597,0.00014746045,0.00019959708,0.00007199708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038012637,0.00010747477,0.00047100324,0.0001968566,0.00003583729,0.000018534209,0.011083726,0.29633588,0.00009557608,0.2840223,0.0017688154,0.405826],"study_design_scores_gemma":[0.00041063468,0.00011907196,0.007234639,0.00003565804,0.000003639818,0.00016299877,0.00010513154,0.9802457,0.00006876815,0.008803062,0.0025923504,0.00021834011],"about_ca_topic_score_codex":0.000044064007,"about_ca_topic_score_gemma":0.0000033068568,"teacher_disagreement_score":0.78228945,"about_ca_system_score_codex":0.000040555915,"about_ca_system_score_gemma":0.00011751069,"threshold_uncertainty_score":0.6698112},"labels":[],"label_agreement":null},{"id":"W2020893760","doi":"10.5555/2011383.2011386","title":"Characterization of universal two-qubit hamiltonian","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Hamiltonian (control theory); Unitary state; Mathematics; Universality (dynamical systems); Quantum mechanics; Mathematical physics; Physics; Quantum; Law","score_opus":0.011893865927385162,"score_gpt":0.21491937716466242,"score_spread":0.20302551123727725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020893760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4273746,0.0000038135163,0.57163405,0.00006441458,0.0001368782,0.000073389674,0.0000024686385,0.00008148065,0.00062892115],"genre_scores_gemma":[0.9791183,0.0000072004505,0.020660928,0.00015343925,0.000015939098,0.0000018034717,0.0000341345,0.0000030978917,0.0000051980883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.000038658054,0.00031110173,0.00010758608,0.00016036635,0.00011975811],"domain_scores_gemma":[0.99942064,0.000020242147,0.00025136833,0.00012505903,0.00012831432,0.000054374865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015422312,0.00009724232,0.00011243114,0.00020303462,0.00010133235,0.00006352077,0.00018143351,0.000036575024,0.0000054659495],"category_scores_gemma":[0.000008357361,0.000092562324,0.000029333542,0.00028115007,0.000038328144,0.0012817237,0.00008150727,0.00007230955,0.000015192315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032257638,0.00007078182,0.00068420806,0.000084407366,0.000025154146,0.000002333941,0.023486154,0.0022786104,0.0030659183,0.40203822,0.00002899412,0.568203],"study_design_scores_gemma":[0.0004098734,0.00011600478,0.030538177,0.00002159744,0.0000036603326,0.000015686963,0.00007950218,0.96279895,0.001357513,0.0041868784,0.00035488547,0.00011727207],"about_ca_topic_score_codex":0.000045129356,"about_ca_topic_score_gemma":0.0000011435054,"teacher_disagreement_score":0.9605203,"about_ca_system_score_codex":0.000011639736,"about_ca_system_score_gemma":0.000037767666,"threshold_uncertainty_score":0.37745818},"labels":[],"label_agreement":null},{"id":"W203131757","doi":"10.26421/qic4.3-8","title":"Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups","year":2004,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Centralizer and normalizer; Abelian group; Combinatorics; Mathematics; Torsion subgroup; Hamiltonian (control theory); Discrete mathematics; Elementary abelian group","score_opus":0.010272693092498425,"score_gpt":0.2373356775268577,"score_spread":0.22706298443435927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203131757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112077706,0.00008453132,0.8752583,0.010996809,0.00047902737,0.00074283325,0.000009826127,0.00027166243,0.00007929673],"genre_scores_gemma":[0.87730944,0.0000070143797,0.120621525,0.0018139827,0.00011016204,0.0000672622,0.000055013094,0.0000098438795,0.000005743695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846125,0.000051784104,0.0005005132,0.00026527786,0.0003431716,0.0003780185],"domain_scores_gemma":[0.9990736,0.000102763785,0.00022878313,0.00026346775,0.00019217152,0.00013919118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057354965,0.00021131261,0.0001733918,0.00017316251,0.00088068465,0.000829428,0.00044571192,0.00007963006,0.0000011082528],"category_scores_gemma":[0.00004301521,0.0001625657,0.00007879769,0.00052381825,0.00005255643,0.0011678142,0.0001714134,0.00016613469,0.00007012631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035382298,0.000050925144,0.00002764985,0.000083697996,0.00002110673,8.6031724e-7,0.013478267,0.06967326,0.000059169095,0.4199247,0.0010552703,0.4955897],"study_design_scores_gemma":[0.0007656727,0.00036022902,0.0034699757,0.000046971796,0.000007039717,0.00004187281,0.00020061493,0.9337915,0.00005290125,0.054453954,0.006568177,0.00024104788],"about_ca_topic_score_codex":0.0001307936,"about_ca_topic_score_gemma":0.000022553639,"teacher_disagreement_score":0.8641183,"about_ca_system_score_codex":0.000074698815,"about_ca_system_score_gemma":0.00012187102,"threshold_uncertainty_score":0.79981935},"labels":[],"label_agreement":null},{"id":"W206344181","doi":"10.26421/qic13.5-6-10","title":"Perfect state transfer on signed graphs","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Perfect graph theorem; Trivially perfect graph; Perfect graph; Mathematics; Combinatorics; Transfer (computing); Discrete mathematics; Induced subgraph; Distance-hereditary graph; State (computer science); Graph; Perfect power; Induced subgraph isomorphism problem; Line graph; Computer science; Algorithm; Pathwidth; Graph power; Vertex (graph theory); Voltage graph","score_opus":0.006731649378793569,"score_gpt":0.2116086545933717,"score_spread":0.20487700521457813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206344181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4177762,0.000011546127,0.58071226,0.00060089235,0.00015637164,0.0001872722,0.0000013946988,0.00018890837,0.0003651393],"genre_scores_gemma":[0.9938131,0.00000793812,0.0049138456,0.0011984035,0.000015818974,0.000016976679,0.000017407745,0.0000050509816,0.000011459577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898416,0.0000630708,0.00031621446,0.00016733838,0.00025717003,0.00021207643],"domain_scores_gemma":[0.99947417,0.000097158154,0.000066117675,0.00014929046,0.00011353825,0.000099716366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001737478,0.00015552729,0.0001272645,0.00023766355,0.00022213094,0.0005010898,0.00019360958,0.000042718446,0.0000113198475],"category_scores_gemma":[0.00001219653,0.00012935426,0.000048803762,0.00030282853,0.00003089447,0.0013901333,0.0000397352,0.00013906365,0.00022914323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009348316,0.000035464655,0.000039234797,0.00003708374,0.000013597825,9.325558e-7,0.0041884994,0.026425017,0.00011393556,0.087881185,0.0007137584,0.8805419],"study_design_scores_gemma":[0.00041573818,0.00028324267,0.0050881244,0.00002004113,0.0000018333584,0.000012546791,0.000051699142,0.9628431,0.00015266315,0.030472796,0.0004809815,0.00017723985],"about_ca_topic_score_codex":0.000042326647,"about_ca_topic_score_gemma":6.7229166e-7,"teacher_disagreement_score":0.93641806,"about_ca_system_score_codex":0.000013995952,"about_ca_system_score_gemma":0.000026400601,"threshold_uncertainty_score":0.5274914},"labels":[],"label_agreement":null},{"id":"W2104798297","doi":"10.26421/qic7.5-6-2","title":"Security of quantum key distribution using weak coherent states with nonrandom phases","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"BB84; Quantum key distribution; Coherent states; Key generation; Key (lock); Mathematics; Phase (matter); Pulse (music); Topology (electrical circuits); Computer science; Quantum cryptography; Theoretical computer science; Quantum; Quantum mechanics; Physics; Algorithm; Cryptography; Quantum information; Telecommunications; Computer security","score_opus":0.011075571631958273,"score_gpt":0.25552892717787584,"score_spread":0.24445335554591757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104798297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36586064,0.00004132028,0.63332516,0.00006183121,0.00010919229,0.0002045636,0.0000200815,0.00009350302,0.0002837053],"genre_scores_gemma":[0.9956594,0.00004524352,0.0037921388,0.0001465393,0.000014461644,0.0000050271897,0.00033216816,0.0000041843055,8.3068596e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830604,0.000044011413,0.00078778964,0.00013838244,0.0004692781,0.0002545068],"domain_scores_gemma":[0.99854046,0.00012056869,0.0005988522,0.00017400467,0.00044439966,0.00012172113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006668294,0.00018551305,0.00022285001,0.00029104511,0.00021424986,0.00022514278,0.00018202797,0.000070663074,0.00000816881],"category_scores_gemma":[0.000023734936,0.00015651793,0.0000593589,0.0006858335,0.00010657629,0.003246737,0.00005283025,0.000114040675,0.000008310088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006360239,0.00027740965,0.0021021483,0.0003679834,0.00009464145,0.000002429415,0.011182513,0.0185028,0.00024776172,0.9043152,0.00093335833,0.061337743],"study_design_scores_gemma":[0.001811856,0.0003099775,0.0036739917,0.00006363105,0.00001475814,0.00003490527,0.0014685891,0.9813737,0.0011930274,0.007305845,0.0025196776,0.00023001795],"about_ca_topic_score_codex":0.000079826306,"about_ca_topic_score_gemma":0.000007870933,"teacher_disagreement_score":0.9628709,"about_ca_system_score_codex":0.000042851934,"about_ca_system_score_gemma":0.00007184343,"threshold_uncertainty_score":0.6382616},"labels":[],"label_agreement":null},{"id":"W2110607426","doi":"10.26421/qic11.5-6-10","title":"Assisted entanglement distillation","year":2011,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; McGill University","funders":"Office of Naval Research; Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Quantum entanglement; Entanglement distillation; Computer science; Distillation; Alice and Bob; Quantum; Theoretical computer science; Squashed entanglement; Alice (programming language); Quantum mechanics; Physics; Chemistry","score_opus":0.028783672951852912,"score_gpt":0.26091870137093987,"score_spread":0.23213502841908695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110607426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018480327,0.00009950003,0.9692819,0.00040669364,0.0011618156,0.0005249773,0.000021981594,0.00053092267,0.009491877],"genre_scores_gemma":[0.9789579,0.00012315995,0.01921204,0.000837145,0.00004047281,0.00006627261,0.0007457779,0.000008332924,0.000008919454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979283,0.0000816558,0.0009920102,0.00027044228,0.0004834614,0.00024411555],"domain_scores_gemma":[0.9982057,0.000039709288,0.00087562046,0.00040165352,0.00032962533,0.0001476486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039991352,0.00031521905,0.0002798451,0.00060576625,0.0002277388,0.00086175103,0.00043776096,0.00023283642,0.000030310113],"category_scores_gemma":[0.000025704781,0.00031236137,0.0001249609,0.0003482873,0.00005295042,0.0026938235,0.000549713,0.00031759107,0.0001585298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017828443,0.00005054636,0.00017816667,0.00028245506,0.000052225772,9.0888733e-7,0.0059141405,0.0012756193,0.000006497958,0.7073708,0.0022264959,0.2826243],"study_design_scores_gemma":[0.00058044895,0.00010146328,0.019403448,0.000096459844,0.000023664123,0.000020384645,0.0002856474,0.8782697,0.000066023,0.092403084,0.008234194,0.0005155229],"about_ca_topic_score_codex":0.0000498582,"about_ca_topic_score_gemma":0.0000032141377,"teacher_disagreement_score":0.96047753,"about_ca_system_score_codex":0.0000721667,"about_ca_system_score_gemma":0.00011779154,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W2111867612","doi":"10.26421/qic11.3-4-10","title":"Global geometric entanglement in transverse-field XY spin chains: finite and infinite systems","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum entanglement; Quantum mechanics; Physics; Degenerate energy levels; Squashed entanglement; Ground state; Thermodynamic limit; Quantum phase transition; Quantum","score_opus":0.016886115270656542,"score_gpt":0.23924187443633485,"score_spread":0.22235575916567832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111867612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2746261,0.00016874693,0.72389215,0.00016067082,0.000286181,0.00020496975,0.0000050750104,0.000091997485,0.00056410104],"genre_scores_gemma":[0.9931545,0.00006484155,0.0063575706,0.00037473266,0.000019600418,0.00001025343,0.000013294486,0.0000028389195,0.0000023569876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988586,0.00005797307,0.00046109487,0.00017840129,0.00022628426,0.0002176579],"domain_scores_gemma":[0.9994685,0.00008588976,0.0001672102,0.00012207027,0.00006787399,0.00008843998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033456972,0.00014963717,0.00016047858,0.00042983273,0.00011229931,0.0002288671,0.00016697777,0.00006887741,0.000002904249],"category_scores_gemma":[0.000036077534,0.00014112699,0.000026597878,0.00083741633,0.000023662575,0.0009216426,0.00008587959,0.0001072262,0.000010031589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004070259,0.0000888478,0.0065895203,0.00021696262,0.000025282441,0.000012502455,0.014080282,0.037699986,0.000003235645,0.17370455,0.00014116331,0.767397],"study_design_scores_gemma":[0.00067943794,0.00025749573,0.027533874,0.000056436962,0.0000034844495,0.000028893059,0.0003981036,0.96821415,0.000010733431,0.0021161842,0.0005316522,0.00016952587],"about_ca_topic_score_codex":0.00030090896,"about_ca_topic_score_gemma":0.0000124646,"teacher_disagreement_score":0.9305142,"about_ca_system_score_codex":0.000034995304,"about_ca_system_score_gemma":0.00003245568,"threshold_uncertainty_score":0.5754992},"labels":[],"label_agreement":null},{"id":"W2115297457","doi":"10.26421/qic9.5-6-4","title":"Mixing doubly stochastic quantum channels with the completely depolarizing channel","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum; Channel (broadcasting); Mixing (physics); Mathematics; Quantum channel; Unitary state; Classical capacity; Physics; Quantum mechanics; Quantum information; Computer science; Telecommunications","score_opus":0.017549739438260256,"score_gpt":0.23609069377815936,"score_spread":0.21854095433989912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115297457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045207463,0.00007418217,0.94766045,0.0054408517,0.00026274615,0.00039007797,0.0000027219585,0.0003416209,0.00061986415],"genre_scores_gemma":[0.9932555,0.00000966852,0.0024551344,0.004160835,0.00004456946,0.000018798006,0.00004624589,0.0000057503958,0.0000035205276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834424,0.00006447922,0.0005302978,0.00019068261,0.0005136637,0.00035662513],"domain_scores_gemma":[0.9988021,0.000105346866,0.0004099846,0.0002665202,0.0002827563,0.00013324307],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045071408,0.0002498174,0.00020334807,0.00037907314,0.0007215582,0.0010943131,0.0004298629,0.00007324751,0.000002969324],"category_scores_gemma":[0.000022438931,0.00017596975,0.00006442515,0.00081496296,0.00007851142,0.004353178,0.00006368528,0.00022816565,0.00006204246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067246,0.000046418463,0.000009643609,0.000044793076,0.000031473395,0.0000017354207,0.012879734,0.05311816,0.000061028695,0.8665218,0.0010102119,0.06620778],"study_design_scores_gemma":[0.0007955247,0.00029722232,0.0021661916,0.000044380704,0.000010091652,0.000085124004,0.0010318379,0.97843003,0.000049884336,0.015583049,0.0012172337,0.00028941542],"about_ca_topic_score_codex":0.00001860175,"about_ca_topic_score_gemma":0.0000027449976,"teacher_disagreement_score":0.948048,"about_ca_system_score_codex":0.000030429082,"about_ca_system_score_gemma":0.000065378874,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W2135205181","doi":"10.26421/qic3.4-3","title":"Shor's discrete logarithm quantum algorithm for elliptic curves","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Post-quantum cryptography; Quantum algorithm; Quantum computer; Integer factorization; Qubit; Mathematics; Elliptic curve; Quantum Fourier transform; Schoof's algorithm; Elliptic curve cryptography; Discrete mathematics; Counting points on elliptic curves; Logarithm; Modulo; Algorithm; Cryptography; Quantum phase estimation algorithm; Quantum; Quantum error correction; Public-key cryptography; Computer science; Quantum mechanics; Pure mathematics; Encryption; Mathematical analysis; Physics","score_opus":0.012431951624506965,"score_gpt":0.2534901271177673,"score_spread":0.24105817549326033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135205181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017030095,0.00062767614,0.995652,0.0005734826,0.000423187,0.00042156305,0.000010105275,0.00015427604,0.00043470983],"genre_scores_gemma":[0.68479025,0.0008652827,0.3118315,0.0021076777,0.00005366497,0.00012014424,0.00018666986,0.000015186097,0.000029581382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882853,0.00006719334,0.00044454026,0.00018236475,0.00023803177,0.0002393332],"domain_scores_gemma":[0.99922925,0.0001449656,0.0001857742,0.0001681739,0.00017563534,0.000096201096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044580386,0.00015554848,0.00016251697,0.00022319974,0.00027595807,0.00028585613,0.00018064698,0.00006692736,0.0000045155084],"category_scores_gemma":[0.00005468096,0.0001394497,0.00008046361,0.00039135595,0.00005635751,0.0017415237,0.000035537112,0.00009263041,0.000022991982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050280723,0.00003987625,0.000044083445,0.000200665,0.00002761104,9.00162e-7,0.00085967925,0.0011969288,0.000008870349,0.7240327,0.0015254949,0.2720582],"study_design_scores_gemma":[0.0005606254,0.00015592908,0.0005655373,0.00006024872,0.000013369014,0.00003128211,0.00016262797,0.94771594,0.000102960206,0.038995575,0.011424915,0.00021098774],"about_ca_topic_score_codex":0.0000103110815,"about_ca_topic_score_gemma":0.0000010663651,"teacher_disagreement_score":0.946519,"about_ca_system_score_codex":0.000015969295,"about_ca_system_score_gemma":0.00005379566,"threshold_uncertainty_score":0.5686593},"labels":[],"label_agreement":null},{"id":"W2144456193","doi":"10.26421/qic9.9-10-7","title":"Eigenpath traversal by phase randomization","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Mathematics; Quantum walk; Quantum algorithm; Unitary matrix; Hamiltonian (control theory); Quantum computer; Qubit; Quantum decoherence; Eigenvalues and eigenvectors; Markov chain; Applied mathematics; Discrete mathematics; Quantum; Mathematical optimization; Quantum mechanics; Unitary state; Physics","score_opus":0.0054725096693274645,"score_gpt":0.2429029828329795,"score_spread":0.23743047316365204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144456193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103610374,0.00006718706,0.89413327,0.0012772242,0.00017094248,0.0001704239,0.000004550852,0.00023958356,0.0003264663],"genre_scores_gemma":[0.98626167,0.00002448821,0.012314952,0.0012396268,0.000034175162,0.000002869523,0.00011157276,0.000002758461,0.000007906979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904555,0.000053061038,0.00034945732,0.00014812849,0.00023092034,0.00017287895],"domain_scores_gemma":[0.99948996,0.000046239897,0.00017335649,0.00011583381,0.00008599464,0.0000885842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247191,0.00013316663,0.00013880664,0.00014743257,0.00021901377,0.00035593886,0.00016920328,0.00005410541,0.0000030481344],"category_scores_gemma":[0.000023023907,0.000121518024,0.000038065184,0.0002855685,0.000019130126,0.0013940145,0.000025923253,0.000101838516,0.000022273218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043242842,0.00006366074,0.000003880114,0.000009178306,0.000005246661,7.944965e-7,0.002118717,0.009532016,0.00017803472,0.03783245,0.0021537752,0.948059],"study_design_scores_gemma":[0.0033730685,0.00028589086,0.00027160763,0.000010634867,0.0000037892032,0.000020493646,0.000038571307,0.98340595,0.00021956558,0.0097936895,0.0024196163,0.00015715102],"about_ca_topic_score_codex":0.000005117106,"about_ca_topic_score_gemma":1.1772864e-7,"teacher_disagreement_score":0.9738739,"about_ca_system_score_codex":0.000017543513,"about_ca_system_score_gemma":0.000031114312,"threshold_uncertainty_score":0.49553612},"labels":[],"label_agreement":null},{"id":"W2147548586","doi":"10.26421/qic9.3-4-3","title":"Efficient quantum algorithm for identifying hidden polynomials","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Mathematics; Coset; Combinatorics; Degree (music); Constant (computer programming); Polynomial; Generalization; Finite field; Discrete mathematics; Quantum algorithm; Random variate; Quantum; Random variable; Computer science","score_opus":0.016411135504754152,"score_gpt":0.27458653261753213,"score_spread":0.258175397112778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147548586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06817984,0.000111796915,0.9290255,0.0012127977,0.0005764131,0.00039524498,0.000009005507,0.00037499468,0.00011446531],"genre_scores_gemma":[0.7851275,0.000008311485,0.21355954,0.0010981392,0.00012624341,0.000014030227,0.000050399012,0.0000065612558,0.0000092335895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985014,0.000048174188,0.00055910065,0.00025529243,0.0003085319,0.0003274811],"domain_scores_gemma":[0.99906975,0.0001336648,0.00029680497,0.00019537233,0.00018308651,0.000121330355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049852935,0.00020245192,0.00021818365,0.000303467,0.00043258214,0.0006431393,0.0003082331,0.00008083702,0.0000015364849],"category_scores_gemma":[0.000038956197,0.00018965114,0.00008833584,0.00034296094,0.0000284538,0.0006625458,0.00007570106,0.00012562997,0.000026897982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006013526,0.000029091632,0.000002102597,0.00002082286,0.0000075975736,7.297478e-7,0.0015469267,0.016626071,0.000058876958,0.05654964,0.00040494718,0.92474717],"study_design_scores_gemma":[0.00070637546,0.00022929128,0.0015456179,0.000036810467,0.000006830845,0.000035102803,0.00012281057,0.9732528,0.00012236889,0.02265263,0.0010442697,0.0002451042],"about_ca_topic_score_codex":0.000012447325,"about_ca_topic_score_gemma":2.4284583e-7,"teacher_disagreement_score":0.9566267,"about_ca_system_score_codex":0.00004246254,"about_ca_system_score_gemma":0.0000611726,"threshold_uncertainty_score":0.7733749},"labels":[],"label_agreement":null},{"id":"W2151905466","doi":"10.26421/qic7.7-6","title":"Zero-error attacks and detection statistics in the coherent one-way protocol for quantum cryptography","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Quantum cryptography; Protocol (science); Computer science; Simple (philosophy); Quantum; Transmission (telecommunications); Zero (linguistics); State (computer science); Mathematics; Theoretical computer science; Algorithm; Quantum information; Quantum mechanics; Telecommunications; Physics","score_opus":0.03069184851153925,"score_gpt":0.3161141286558338,"score_spread":0.2854222801442946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151905466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013910485,0.000006806842,0.9633375,0.00026728655,0.0001375499,0.021859135,0.000011773778,0.00011641664,0.00035305743],"genre_scores_gemma":[0.95457363,0.000007536825,0.029012462,0.001376577,0.000031682168,0.014917289,0.00007070559,0.000008809345,0.0000012919401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981736,0.000076484816,0.00083882746,0.00018171221,0.0004170522,0.00031232229],"domain_scores_gemma":[0.9987459,0.00029616622,0.0004143033,0.00019266145,0.00025600148,0.000094951734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014040071,0.00020148887,0.00017426947,0.00059393555,0.000355085,0.0005629577,0.00024374042,0.00010504493,0.0000030857204],"category_scores_gemma":[0.000052719657,0.00016427884,0.000054113283,0.00071877235,0.00008651811,0.0022377498,0.000049347535,0.0001788866,0.000011114292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014893456,0.000097393386,0.0005164151,0.0002899569,0.000015131132,5.567635e-7,0.0067039933,0.00030123568,0.000043223743,0.7087313,0.00086787,0.282284],"study_design_scores_gemma":[0.0025753109,0.0005785,0.042145364,0.00005094706,0.000009103754,0.000024082135,0.0015212542,0.8592462,0.00017756996,0.07733419,0.016013298,0.0003241886],"about_ca_topic_score_codex":0.000027067765,"about_ca_topic_score_gemma":0.000038687547,"teacher_disagreement_score":0.94066316,"about_ca_system_score_codex":0.000028272489,"about_ca_system_score_gemma":0.00003410398,"threshold_uncertainty_score":0.6699097},"labels":[],"label_agreement":null},{"id":"W2165985653","doi":"10.26421/qic15.1-2-10","title":"Efficient Clifford+T approximation of single-qubit operators","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity","keywords":"Mathematics; Combinatorics; Sequence (biology); Binary logarithm; Operator (biology); Constant (computer programming); Product (mathematics); Log-log plot; Polynomial; Upper and lower bounds; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.018330658686241803,"score_gpt":0.24170004629605893,"score_spread":0.22336938760981712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165985653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3891773,0.000030946834,0.60971415,0.00021677055,0.00022115775,0.00012078936,0.0000016075654,0.000097252596,0.000420042],"genre_scores_gemma":[0.9603011,0.0000014439989,0.03947201,0.00016726955,0.000025241321,0.0000044167987,0.000022262382,0.0000036609333,0.000002597855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988554,0.000056229128,0.00046328217,0.00013248483,0.00034407832,0.00014848894],"domain_scores_gemma":[0.9991409,0.000048363847,0.0002684244,0.00014910281,0.00028345108,0.00010971043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042437357,0.000120080695,0.00015111972,0.00022326001,0.00009572604,0.00018181477,0.00018829512,0.000052644653,7.796885e-7],"category_scores_gemma":[0.000060280745,0.000106094965,0.0000338366,0.0004068672,0.000041637235,0.00052992854,0.00010338518,0.0000798063,0.000018006629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017153036,0.0000871109,0.00009908888,0.000071296454,0.0000108682325,5.9457744e-7,0.008878926,0.56110466,0.00014786587,0.10064713,0.0002598991,0.32867542],"study_design_scores_gemma":[0.00053569145,0.00020614323,0.0005115544,0.00002643092,0.0000031506033,0.000019152307,0.0002979499,0.993515,0.00039056104,0.0038687154,0.00049822166,0.0001274429],"about_ca_topic_score_codex":0.000015379248,"about_ca_topic_score_gemma":3.7435046e-7,"teacher_disagreement_score":0.5711238,"about_ca_system_score_codex":0.000031307543,"about_ca_system_score_gemma":0.00007033011,"threshold_uncertainty_score":0.4326427},"labels":[],"label_agreement":null},{"id":"W2201382365","doi":"","title":"Editorial: quantum information and quantum control","year":2005,"lang":"en","type":"editorial","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum; Quantum information; Quantum network; Quantum control; Computer science; Physics; Quantum mechanics","score_opus":0.004837063825796201,"score_gpt":0.2435139246762318,"score_spread":0.2386768608504356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201382365","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013839761,0.00012584317,0.27166817,0.0004150376,0.7233576,0.0010222541,0.00122917,0.00020871838,0.00058923697],"genre_scores_gemma":[0.19321373,0.00023405497,0.00019132873,0.00018336464,0.7972101,0.00024347263,0.008660287,0.000042209074,0.000021453327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967949,0.00008888592,0.0014184492,0.00031835688,0.0009352671,0.00044416514],"domain_scores_gemma":[0.99686915,0.00042710657,0.0012827109,0.00029703698,0.0008777201,0.00024626893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068306294,0.0005722144,0.00060545566,0.0004134084,0.00053841766,0.0009861302,0.0002393683,0.000591016,0.00004911457],"category_scores_gemma":[0.0000975666,0.0005796236,0.00013505865,0.00028001028,0.00008847834,0.0033413062,0.00010323568,0.00081887475,0.0002878732],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050696468,0.000038700022,0.000011629749,0.00011164582,0.000064247266,5.572997e-8,0.0004653199,0.00017270484,0.0000034497716,0.16995479,0.8020408,0.027085943],"study_design_scores_gemma":[0.0015830488,0.00011397919,0.000033255987,0.00006675683,0.0000885967,8.840966e-7,0.00045785046,0.25018796,0.0000030264946,0.036264114,0.710726,0.00047446496],"about_ca_topic_score_codex":0.00035653732,"about_ca_topic_score_gemma":0.000004352808,"teacher_disagreement_score":0.27147684,"about_ca_system_score_codex":0.000083019644,"about_ca_system_score_gemma":0.00036934175,"threshold_uncertainty_score":0.9996655},"labels":[],"label_agreement":null},{"id":"W2248297545","doi":"10.26421/qic18.3-4-2","title":"Adversary lower bounds for the collision and the set equality problems","year":2018,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Army Research Office; National Research Foundation Singapore; National Research Foundation","keywords":"Adversary; Alphabet; Omega; Set (abstract data type); Collision; Upper and lower bounds; Combinatorics; Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Computer security; Programming language; Philosophy; Linguistics","score_opus":0.020944528188935847,"score_gpt":0.27566354963437767,"score_spread":0.25471902144544184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248297545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03795454,0.00043836777,0.95323193,0.005328575,0.0014333681,0.0012997523,0.0000350169,0.0001466171,0.00013180521],"genre_scores_gemma":[0.98315173,0.00022430293,0.014142992,0.0018651463,0.0002705423,0.00014585696,0.00016002073,0.000011868595,0.000027560445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998373,0.00016828404,0.00058098714,0.00029601838,0.0003550265,0.00022668445],"domain_scores_gemma":[0.9978641,0.00080908946,0.0005526071,0.00040650414,0.00030590247,0.00006179807],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00182555,0.00025482575,0.00025960978,0.00010796761,0.00090085267,0.0013051511,0.0005542709,0.00015864415,0.0000012781483],"category_scores_gemma":[0.00009448698,0.00014457451,0.00010773428,0.00018379925,0.00029902847,0.00055683823,0.0009136441,0.00035983312,0.000008759678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003949037,0.00005900398,0.000044848748,0.0011816394,0.0002065978,6.555887e-7,0.03463787,0.34367278,0.0000018079252,0.22525617,0.012464722,0.382079],"study_design_scores_gemma":[0.00096904876,0.00012736092,0.0005894269,0.00009924023,0.000023454799,0.000014972519,0.00014779648,0.910661,0.000003241553,0.07607584,0.011097759,0.0001908614],"about_ca_topic_score_codex":0.000089133675,"about_ca_topic_score_gemma":0.0000039414194,"teacher_disagreement_score":0.94519717,"about_ca_system_score_codex":0.000028910677,"about_ca_system_score_gemma":0.00012355525,"threshold_uncertainty_score":0.9997316},"labels":[],"label_agreement":null},{"id":"W2255290305","doi":"10.26421/qic14.13-14-3","title":"Small sets of locally indistinguishable orthogonal maximally entangled states","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"LOCC; Constructive; Characterization (materials science); Mathematics; Conjecture; Class (philosophy); Transpose; Quantum state; Combinatorics; Quantum; Discrete mathematics; Pure mathematics; Quantum mechanics; Computer science; Physics; Eigenvalues and eigenvectors","score_opus":0.01216896844723628,"score_gpt":0.22251473531454835,"score_spread":0.21034576686731207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255290305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21658257,0.000013190118,0.77905124,0.00016585244,0.00015008257,0.0001394186,0.0000060291604,0.00013663588,0.00375497],"genre_scores_gemma":[0.97537524,0.000020721844,0.023530446,0.00089618296,0.000011586441,0.0000090659105,0.00014976707,0.0000040254963,0.0000029797784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986247,0.00006126282,0.0006818309,0.0001232306,0.00031579283,0.0001931744],"domain_scores_gemma":[0.9988161,0.00010244763,0.00046486556,0.00016832633,0.00034743876,0.00010087638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051305495,0.0001455446,0.00017868096,0.00037552815,0.00014170137,0.00024879465,0.000261219,0.00006423768,0.000012123681],"category_scores_gemma":[0.00005914128,0.00013846291,0.000056919438,0.00047640185,0.000060117698,0.001689024,0.00008966404,0.00009395155,0.000049366445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003175277,0.000047765734,0.0015587268,0.00018522223,0.000021673146,3.3495164e-7,0.0048497617,0.004739366,0.000025485262,0.6956936,0.00046460723,0.29238167],"study_design_scores_gemma":[0.00072349515,0.00020485849,0.010471878,0.000033903907,0.0000051799634,0.0000148248755,0.00032444313,0.96000785,0.00018072067,0.023230158,0.0046211947,0.00018151068],"about_ca_topic_score_codex":0.000027982249,"about_ca_topic_score_gemma":0.0000065490863,"teacher_disagreement_score":0.95526844,"about_ca_system_score_codex":0.000014189477,"about_ca_system_score_gemma":0.000057967467,"threshold_uncertainty_score":0.5646354},"labels":[],"label_agreement":null},{"id":"W2258023100","doi":"10.26421/qic14.9-10-4","title":"Quantum circuits for simple periodic functions","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Toffoli gate; Simple (philosophy); Period (music); Electronic circuit; Conjecture; Function (biology); Periodic function; Quantum; Mathematics; Computer science; Quantum computer; Quantum gate; Discrete mathematics; Topology (electrical circuits); Algorithm; Arithmetic; Combinatorics; Quantum mechanics; Mathematical analysis; Physics","score_opus":0.012034239459380553,"score_gpt":0.24111109293560545,"score_spread":0.2290768534762249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258023100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08818256,0.000027067128,0.90956604,0.000834944,0.0004928184,0.00025220952,0.000008390399,0.00031550648,0.00032043803],"genre_scores_gemma":[0.9892113,0.000004189595,0.009643716,0.00086890114,0.00010679181,0.000030230658,0.0001140781,0.000007187472,0.000013586044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886906,0.00005515464,0.00039685244,0.00021028201,0.00021307773,0.000255592],"domain_scores_gemma":[0.9991053,0.00020142876,0.0001996328,0.00019794563,0.00018704547,0.00010870191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040879787,0.00016018521,0.00016515274,0.00021505155,0.0005469249,0.00048719658,0.00022439109,0.000067174944,0.0000032547389],"category_scores_gemma":[0.0000928661,0.0001500925,0.0000676991,0.00028971917,0.00003910884,0.001077795,0.00007648781,0.000111768524,0.000051156374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005757071,0.000024129375,0.00007881445,0.0000746531,0.000011548925,1.423045e-7,0.0017501406,0.025412956,0.000037156624,0.22951235,0.0019761196,0.7411162],"study_design_scores_gemma":[0.000550482,0.0002275983,0.0024079268,0.000013208558,0.0000056867193,0.000020769723,0.000103393126,0.9313843,0.000018912882,0.029807068,0.03527001,0.00019059183],"about_ca_topic_score_codex":0.000015017726,"about_ca_topic_score_gemma":0.0000015841218,"teacher_disagreement_score":0.9059714,"about_ca_system_score_codex":0.000020407868,"about_ca_system_score_gemma":0.00005002254,"threshold_uncertainty_score":0.6120594},"labels":[],"label_agreement":null},{"id":"W2259367099","doi":"10.26421/qic16.11-12-6","title":"Solving constrained quadratic binary problems via quantum adiabatic evolution","year":2016,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Adiabatic process; Quadratic unconstrained binary optimization; Mathematical optimization; Quadratic programming; Mathematics; Quantum; Quadratic equation; Binary number; A priori and a posteriori; Applied mathematics; Computer science; Quantum computer; Quantum mechanics; Physics","score_opus":0.010566661977210564,"score_gpt":0.23181869628770999,"score_spread":0.22125203431049942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259367099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068649545,0.00038641857,0.92582047,0.0016684093,0.0016294243,0.0008027771,0.000023237715,0.00071280816,0.00030692256],"genre_scores_gemma":[0.9832743,0.000043143496,0.015937882,0.00030697085,0.00016427792,0.00006474045,0.00017557705,0.000021652342,0.00001148781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681616,0.00023755676,0.0012164249,0.00057928846,0.0006183897,0.0005322004],"domain_scores_gemma":[0.9976068,0.00026591078,0.0010165717,0.0005287414,0.00036137935,0.00022059538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007441215,0.00054425205,0.00052160287,0.0006960503,0.00049750274,0.000900455,0.0006591757,0.0003520968,0.000007189014],"category_scores_gemma":[0.000094763534,0.0004655349,0.00016127026,0.00039576963,0.00015237875,0.0016993441,0.0008262686,0.0006258785,0.00008606111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030447507,0.00014555088,0.00017809455,0.002291454,0.00016218165,0.000012356643,0.010009942,0.32004756,0.00032047572,0.23279084,0.00097434025,0.43303674],"study_design_scores_gemma":[0.0005494933,0.00018469131,0.0011503942,0.000663216,0.000020180794,0.00006423869,0.000075720636,0.83208096,0.000013336585,0.1644606,0.0002095296,0.0005276319],"about_ca_topic_score_codex":0.00007144937,"about_ca_topic_score_gemma":0.0000031192112,"teacher_disagreement_score":0.91462475,"about_ca_system_score_codex":0.00019014829,"about_ca_system_score_gemma":0.00040499246,"threshold_uncertainty_score":0.99977964},"labels":[],"label_agreement":null},{"id":"W2261386100","doi":"10.26421/qic15.15-16-1","title":"Galois unitaries, mutually unbiased bases, and mub-balanced states","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity","keywords":"Mutually unbiased bases; Mathematics; Prime (order theory); Field (mathematics); Conjecture; Pure mathematics; Discrete mathematics; Dimension (graph theory); Hilbert space; Combinatorics","score_opus":0.040703767964848675,"score_gpt":0.28613049774013405,"score_spread":0.24542672977528537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261386100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94180596,0.00007080236,0.05668789,0.0003016819,0.00029330872,0.00021755642,0.000010687046,0.00011959106,0.0004925171],"genre_scores_gemma":[0.9978668,0.000023220564,0.0015303971,0.0003759188,0.000032786946,0.000008136933,0.00014273015,0.0000069541757,0.000013031175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992015,0.00004126389,0.0003228893,0.00008696113,0.00022109813,0.00012630697],"domain_scores_gemma":[0.9992743,0.00014718874,0.00016731127,0.000082344624,0.00021162744,0.00011719893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021102294,0.00012292858,0.00015207077,0.000083346655,0.00010666795,0.00014899333,0.00004764856,0.00006262874,0.000007789359],"category_scores_gemma":[0.00016461316,0.00010948186,0.000016073383,0.00011767142,0.00004648258,0.0006923857,0.00003477093,0.00007716328,0.000006683551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009046147,0.000017683777,0.00027503527,0.00008778861,0.00002026882,7.199004e-7,0.0063178143,0.0007986907,0.000002345989,0.9740744,0.0031783092,0.015136442],"study_design_scores_gemma":[0.001259696,0.00013397614,0.0007330168,0.00001937478,0.000015186708,0.000009693197,0.0018976546,0.23183377,0.000019417275,0.76177424,0.002156943,0.00014703916],"about_ca_topic_score_codex":0.000108770204,"about_ca_topic_score_gemma":0.00000858652,"teacher_disagreement_score":0.23103507,"about_ca_system_score_codex":0.000033543212,"about_ca_system_score_gemma":0.00007017286,"threshold_uncertainty_score":0.44645405},"labels":[],"label_agreement":null},{"id":"W2262701818","doi":"10.26421/qic14.9-10-6","title":"Polynomial time quantum algorithms for certain bivariate hidden polynomial problems","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bivariate analysis; Mathematics; Diagonal; Polynomial; Oracle; Time complexity; Quantum algorithm; Quantum computer; Quantum; Quadratic equation; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.014882703486504776,"score_gpt":0.24132494968426194,"score_spread":0.22644224619775716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262701818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039115045,0.000019018355,0.95796984,0.0009319375,0.0005367387,0.00042640974,0.000010695042,0.00029988767,0.00069043617],"genre_scores_gemma":[0.9795131,0.0000057286798,0.019434553,0.0006623511,0.00017337938,0.000053309315,0.00011668904,0.000009867545,0.000031030493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872905,0.00010160247,0.00047606629,0.00021458122,0.00020435514,0.0002743257],"domain_scores_gemma":[0.9990773,0.00021414358,0.00027106106,0.00019318768,0.00013514738,0.00010916828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007646381,0.00018106554,0.00019437111,0.00030425313,0.0003439179,0.00050323573,0.00030728008,0.0000942704,0.0000067210053],"category_scores_gemma":[0.000054465687,0.00017487686,0.0000893681,0.0003090511,0.000047305573,0.0018224417,0.00009054082,0.00009432618,0.00008926183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015861928,0.00006467151,0.000050042432,0.000114969676,0.00004166871,2.3176595e-7,0.004174295,0.002065145,0.00032501755,0.30696145,0.011068096,0.67497575],"study_design_scores_gemma":[0.0010857161,0.00044009168,0.0005853327,0.000020768022,0.00000987008,0.000009624433,0.000056125205,0.9509624,0.00008116968,0.024815034,0.021690972,0.00024286205],"about_ca_topic_score_codex":0.0000269261,"about_ca_topic_score_gemma":0.0000012440995,"teacher_disagreement_score":0.9488973,"about_ca_system_score_codex":0.000024821995,"about_ca_system_score_gemma":0.000048547743,"threshold_uncertainty_score":0.7131271},"labels":[],"label_agreement":null},{"id":"W2264023163","doi":"10.26421/qic19.13-14-4","title":"Cohomological framework for contextual quantum computations","year":2019,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kochen–Specker theorem; Computation; Algebra over a field; Quantum; Probabilistic logic; Pure mathematics; Cohomology; Quantum computer; Algebraic number; Mathematics; Algebraic structure; Symmetry (geometry); Theoretical computer science; Computer science; Topology (electrical circuits); Theoretical physics; Algorithm; Physics; Quantum mechanics; Geometry; Combinatorics; Artificial intelligence; Mathematical analysis","score_opus":0.02884860842986961,"score_gpt":0.3059237336111627,"score_spread":0.27707512518129307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264023163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074802235,0.000054661956,0.9208022,0.000694033,0.00078796037,0.0015803227,0.0006601553,0.00012363671,0.0004947984],"genre_scores_gemma":[0.9845207,0.000014127995,0.009555487,0.00037380515,0.00021933934,0.00043994852,0.004840416,0.000021874206,0.000014354941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831456,0.000053612654,0.0007850778,0.00033140622,0.00023367436,0.000281662],"domain_scores_gemma":[0.9981153,0.00044057675,0.0006844109,0.00025321462,0.00038971638,0.00011678934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002819924,0.00033471666,0.00042849866,0.00017156106,0.00031854564,0.00040523752,0.0002064521,0.0002667562,0.00006815187],"category_scores_gemma":[0.00003228275,0.00033432955,0.00018459311,0.00013421013,0.00006112844,0.00034189713,0.0002045614,0.00048912474,0.00014640357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022728927,0.00006301521,0.0001542066,0.00012488614,0.000060769282,5.1776052e-8,0.0005085484,0.009106796,0.0000024872718,0.973811,0.0013200982,0.014825434],"study_design_scores_gemma":[0.00034845268,0.000061540064,0.0003917551,0.0000593516,0.000034963334,8.022733e-7,0.0005468201,0.4913458,0.000006539647,0.50446165,0.0025202802,0.00022201969],"about_ca_topic_score_codex":0.00006134844,"about_ca_topic_score_gemma":5.6972544e-7,"teacher_disagreement_score":0.9112467,"about_ca_system_score_codex":0.00003704444,"about_ca_system_score_gemma":0.00017412077,"threshold_uncertainty_score":0.9999109},"labels":[],"label_agreement":null},{"id":"W2408326808","doi":"10.26421/qic15.7-8-8","title":"W-like states are not necessary for totally correct quantum anonymous leader election","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); Protocol (science); Quantum state; Quantum; Computation; Cluster state; Quantum computer; Resource (disambiguation); Computer science; Mathematics; Quantum mechanics; Physics; Computer network; Algorithm","score_opus":0.020839611810204647,"score_gpt":0.2564108620898384,"score_spread":0.23557125027963371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408326808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13717993,0.0000831894,0.85907006,0.0016318106,0.0011434262,0.00036722075,0.000012417692,0.00038610707,0.00012583249],"genre_scores_gemma":[0.9802201,0.000017254493,0.017425383,0.0019513621,0.00012775934,0.000035124853,0.00017142597,0.000013795067,0.000037829534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840254,0.00007900521,0.0005186732,0.00027876612,0.0003844749,0.00033652512],"domain_scores_gemma":[0.99859774,0.000173034,0.00040273837,0.0001896491,0.000460042,0.00017679167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005230227,0.0002351477,0.00024008723,0.00027589794,0.000319619,0.00057021197,0.0002611958,0.00010168358,0.0000012211148],"category_scores_gemma":[0.000081636936,0.00021729854,0.00006880968,0.00040913647,0.00004537392,0.0017734505,0.00009963614,0.00017791786,0.00003228127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029281928,0.00017848883,0.0003015076,0.00030223973,0.00007103756,0.0000058918467,0.016311752,0.35621572,0.00011123547,0.045097314,0.026799135,0.5543129],"study_design_scores_gemma":[0.0010104049,0.00045008922,0.0013740504,0.00003585576,0.000008541024,0.000071623064,0.0008516388,0.9793891,0.00015941188,0.010517053,0.0058345087,0.0002977508],"about_ca_topic_score_codex":0.000057655783,"about_ca_topic_score_gemma":0.000006862955,"teacher_disagreement_score":0.84304017,"about_ca_system_score_codex":0.000060730057,"about_ca_system_score_gemma":0.00013586503,"threshold_uncertainty_score":0.88611776},"labels":[],"label_agreement":null},{"id":"W2408440127","doi":"10.26421/4.2-7","title":"On the structure of nonstabilizer Cliford codes","year":2004,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Code (set theory); Stabilizer (aeronautics); Generalization; Linear code; Computer science; Mathematics; Class (philosophy); Concatenated error correction code; Discrete mathematics; Block code; Algorithm; Decoding methods; Programming language","score_opus":0.007973156719074767,"score_gpt":0.2296746625818598,"score_spread":0.22170150586278503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408440127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50178206,0.000009821052,0.49672544,0.0010956475,0.00011162728,0.00009705856,0.0000049118376,0.000048195492,0.00012521657],"genre_scores_gemma":[0.98921883,0.0000041118583,0.009996821,0.0007515583,0.000014073708,0.0000010554821,0.0000103666225,0.000002428885,7.619367e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924207,0.000035633366,0.00028294077,0.00009721072,0.0002277391,0.000114428396],"domain_scores_gemma":[0.99937177,0.00015532563,0.00018132989,0.00016176031,0.00009464495,0.00003518207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014807726,0.00010047545,0.000103514736,0.00010276202,0.00017537086,0.00012437202,0.00021486027,0.000039686453,0.0000035348844],"category_scores_gemma":[0.00004513965,0.00006440891,0.000033556516,0.00025652625,0.00005957694,0.00042163307,0.00006231311,0.0001220375,0.000009053929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007512428,0.000014922917,0.000019680354,0.000020335703,0.0000066329862,2.1265784e-7,0.0023126884,0.14417943,0.000118587566,0.79913646,0.00006912908,0.054114416],"study_design_scores_gemma":[0.0003712065,0.00015910907,0.0014827838,0.0000373135,0.0000023705131,0.000014969929,0.00012751395,0.8068968,0.0011045559,0.18949418,0.00021300229,0.00009618463],"about_ca_topic_score_codex":0.000016815176,"about_ca_topic_score_gemma":0.0000018999721,"teacher_disagreement_score":0.66271734,"about_ca_system_score_codex":0.000014794072,"about_ca_system_score_gemma":0.000047610924,"threshold_uncertainty_score":0.26265192},"labels":[],"label_agreement":null},{"id":"W2412871963","doi":"10.26421/qic17.5-6-8","title":"Perfect state transfer is poly-time","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"State (computer science); Transfer (computing); Time transfer; Computer science; Algorithm; Telecommunications; Parallel computing","score_opus":0.011685173644154091,"score_gpt":0.24955847263904418,"score_spread":0.2378732989948901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412871963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11604993,0.00029246332,0.87932235,0.0020011675,0.00082922686,0.0003594907,0.00005240269,0.0003973432,0.0006956342],"genre_scores_gemma":[0.97943646,0.00014535303,0.018592598,0.0013190234,0.00013651825,0.000023176335,0.0002136598,0.000020546757,0.00011268844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805474,0.000091842754,0.00066298625,0.00040910137,0.00045480012,0.0003265424],"domain_scores_gemma":[0.9985903,0.00007422545,0.00038298493,0.00059450325,0.00020904894,0.00014893532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004794181,0.00037468623,0.00037752412,0.00032545347,0.00054534787,0.0019483931,0.0007983728,0.00020545484,0.000011232561],"category_scores_gemma":[0.00002734656,0.0003534401,0.00014610885,0.00011068508,0.00007483064,0.0012355526,0.0006246775,0.00057514716,0.00017778702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015826607,0.000030291229,0.000029892828,0.000281695,0.00005907058,0.000004440951,0.01141777,0.021676932,0.000015847289,0.004355924,0.0014647157,0.9606476],"study_design_scores_gemma":[0.0004036141,0.000099325305,0.0015595927,0.00014300333,0.000012420137,0.000029809975,0.000015923526,0.96849614,0.0001018249,0.025090778,0.0036248926,0.00042264248],"about_ca_topic_score_codex":0.00009337465,"about_ca_topic_score_gemma":0.000001173306,"teacher_disagreement_score":0.9602249,"about_ca_system_score_codex":0.000040415158,"about_ca_system_score_gemma":0.00020199738,"threshold_uncertainty_score":0.99989176},"labels":[],"label_agreement":null},{"id":"W2559657995","doi":"10.26421/qic17.9-10-5","title":"Pretty good state transfer between internal nodes of paths","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Path graph; Path (computing); Wheel graph; Hamiltonian (control theory); Combinatorics; Mathematics; Quantum walk; Graph; Transfer (computing); Quantum; Hamiltonian path; State (computer science); Integer (computer science); Discrete mathematics; Physics; Quantum mechanics; Computer science; Quantum algorithm; Graph power; Algorithm; Mathematical optimization","score_opus":0.01618188543001926,"score_gpt":0.26343674458941146,"score_spread":0.24725485915939222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559657995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35385662,0.00006862598,0.6447868,0.00023513591,0.00041893846,0.00020159922,0.000057691857,0.00010908928,0.00026553153],"genre_scores_gemma":[0.98749,0.000052155472,0.012149787,0.0000744191,0.00007392554,0.000008860288,0.00013312393,0.000008958637,0.000008787314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816656,0.00009441704,0.0007950816,0.00028968285,0.00042722953,0.00022703069],"domain_scores_gemma":[0.99850065,0.00011101185,0.0005911646,0.00044338085,0.00025086242,0.000102956175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004741615,0.0002869398,0.0004160742,0.00028350652,0.00021648238,0.00067279575,0.00080434914,0.00017076601,0.0000012731047],"category_scores_gemma":[0.00003273842,0.00026376563,0.0001275005,0.00008735453,0.00008950171,0.00093871704,0.00061347557,0.0005031028,0.000008540499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017180588,0.00003347693,0.0017124146,0.00067864486,0.00009420072,0.0000022136408,0.0095230285,0.04469913,0.000016640563,0.010939738,0.0000763802,0.9322069],"study_design_scores_gemma":[0.00042030244,0.00011353374,0.032834645,0.00031778743,0.000017082455,0.000009097802,0.00002859049,0.93533164,0.0002181275,0.030069126,0.00035313255,0.00028694814],"about_ca_topic_score_codex":0.00012614793,"about_ca_topic_score_gemma":0.0000021737596,"teacher_disagreement_score":0.93192,"about_ca_system_score_codex":0.000026835298,"about_ca_system_score_gemma":0.00015180338,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W2571689264","doi":"10.26421/qic17.13-14-5","title":"Topological proofs of contextuality in quantum mechanics","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kochen–Specker theorem; Mathematical proof; Theoretical physics; Parity (physics); Quantum; Mathematics; Topology (electrical circuits); Quantum mechanics; Pure mathematics; Physics; Geometry; Combinatorics","score_opus":0.034983490033419884,"score_gpt":0.3145491234532562,"score_spread":0.2795656334198363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571689264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37665045,0.000052491618,0.61985576,0.00035875244,0.00032790954,0.0007076212,0.00018269129,0.000028571314,0.0018357545],"genre_scores_gemma":[0.9989099,0.000023577204,0.0002545761,0.000043773438,0.000044867105,0.000099876816,0.0006084482,0.0000072338134,0.000007728814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985976,0.0000592388,0.0007801279,0.00020054274,0.00019474459,0.0001677078],"domain_scores_gemma":[0.9984623,0.00005515615,0.0009376738,0.00028988693,0.00019379254,0.000061142484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004120512,0.00020723818,0.000378775,0.0001456274,0.0001366387,0.00014771106,0.0002225461,0.00016334126,0.0000696782],"category_scores_gemma":[0.00002106982,0.00020088041,0.000090440306,0.000068238325,0.0000481941,0.0003384778,0.00025660257,0.00035013072,0.00003634409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017758037,0.0000769925,0.00025687995,0.000117430776,0.000018577704,9.498817e-8,0.00055327034,0.0012147498,0.000013198032,0.9805131,0.00012566677,0.017092312],"study_design_scores_gemma":[0.00032362674,0.000033513432,0.0010239866,0.00006894279,0.00001029619,3.6352688e-7,0.0004157439,0.46874014,0.000050607792,0.5287729,0.00041913576,0.00014076992],"about_ca_topic_score_codex":0.00042849654,"about_ca_topic_score_gemma":0.000008155061,"teacher_disagreement_score":0.6222595,"about_ca_system_score_codex":0.000025584646,"about_ca_system_score_gemma":0.00012636198,"threshold_uncertainty_score":0.8191666},"labels":[],"label_agreement":null},{"id":"W2600825956","doi":"10.26421/qic12.11-12-1","title":"Hamiltonian simulation using linear combinations of unitary operations","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":394,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unitary state; Hamiltonian (control theory); Unitary transformation; Computer science; Mathematics; Unitary matrix; Algorithm; Applied mathematics; Mathematical optimization; Quantum; Quantum mechanics; Physics","score_opus":0.16179751443489404,"score_gpt":0.4465181793535156,"score_spread":0.2847206649186216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600825956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43207234,0.000026520094,0.5668984,0.00017249116,0.00008327299,0.00021425945,0.000019186915,0.000049040234,0.00046448453],"genre_scores_gemma":[0.98551357,0.0000070531332,0.014084555,0.00022082581,0.000034558216,0.000010887863,0.00010098959,0.000005368266,0.000022207092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825114,0.00009452475,0.00089218136,0.00009902372,0.0005250222,0.00013810594],"domain_scores_gemma":[0.99821854,0.00041686418,0.00029156703,0.00019241088,0.0007862281,0.00009437539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097148353,0.000101968806,0.00015445935,0.00047226535,0.00032362848,0.000109701505,0.00012344835,0.00007430768,0.000051186064],"category_scores_gemma":[0.00038413255,0.000092120674,0.000048969767,0.0008195889,0.000068369,0.0027708048,0.000047839905,0.000075781056,0.00005577869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007945841,0.000120434175,0.0039892774,0.000008338783,0.000007636048,1.8781547e-8,0.002111736,0.83090866,0.00012074652,0.125309,0.00015683111,0.037259396],"study_design_scores_gemma":[0.00033231205,0.00002916129,0.02008668,0.000007943874,0.0000110274705,0.0000027483197,0.000825885,0.96704,0.00013943604,0.0073755668,0.0040482543,0.00010096303],"about_ca_topic_score_codex":0.000059713922,"about_ca_topic_score_gemma":0.0000030729398,"teacher_disagreement_score":0.5534412,"about_ca_system_score_codex":0.000032412725,"about_ca_system_score_gemma":0.000048099097,"threshold_uncertainty_score":0.3756572},"labels":[],"label_agreement":null},{"id":"W2786939119","doi":"10.26421/qic19.7-8-1","title":"Switching and partially switching the hypercube while maintaining perfect state transfer","year":2019,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Qubit; Graph; Quantum; Vertex (graph theory); Mathematics; Combinatorics; Topology (electrical circuits); Discrete mathematics; Computer science; Physics; Quantum mechanics","score_opus":0.013188841467654203,"score_gpt":0.23567057269106834,"score_spread":0.22248173122341414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786939119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42522302,0.00016572785,0.5726458,0.0008870473,0.0004925839,0.00032692982,0.0000045616225,0.00016637264,0.00008798237],"genre_scores_gemma":[0.99244344,0.00012247878,0.0063248985,0.0009448213,0.00008675302,0.000017284972,0.000041599367,0.000015300548,0.0000034501577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979584,0.00020214872,0.0006621563,0.00040780715,0.00041753214,0.00035191368],"domain_scores_gemma":[0.99884665,0.00029421094,0.00026020024,0.00036300306,0.00013033478,0.000105616295],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010622338,0.00036292901,0.00034114494,0.00022993145,0.00053428,0.001524255,0.00047383134,0.00014662513,0.0000016802072],"category_scores_gemma":[0.00003201443,0.00027410645,0.00009225608,0.00018835955,0.000035486206,0.0010280639,0.00066640746,0.0009036117,0.000017498573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013429315,0.0000106451225,0.00011247719,0.00018519069,0.00003739835,0.0000019115375,0.021789333,0.44093016,0.00004960066,0.010240375,0.000033658067,0.52659583],"study_design_scores_gemma":[0.0003828129,0.000101099315,0.0050844457,0.0002021062,0.000017530843,0.00006345337,0.00035542357,0.9793333,0.000024620267,0.013569021,0.0005081681,0.0003580321],"about_ca_topic_score_codex":0.0001058721,"about_ca_topic_score_gemma":0.000007734248,"teacher_disagreement_score":0.5672204,"about_ca_system_score_codex":0.000038804214,"about_ca_system_score_gemma":0.00016268111,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W2807888239","doi":"10.26421/qic18.15-16-2","title":"The cohomological and the resource-theoretic perspective on quantum contextuality: common ground through the contextual fraction","year":2018,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Stewart Blusson Quantum Matter Institute, University of British Columbia; Natural Sciences and Engineering Research Council of Canada","keywords":"Kochen–Specker theorem; Mathematics; Fraction (chemistry); Unification; Quantum; Perspective (graphical); Mathematical proof; Theoretical physics; Pure mathematics; Algebra over a field; Computer science; Quantum mechanics; Physics; Geometry","score_opus":0.02197236713350951,"score_gpt":0.30202501251688785,"score_spread":0.2800526453833783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807888239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49815288,0.0005801433,0.45261458,0.03027509,0.0007048073,0.0035974598,0.0002324702,0.00015723068,0.013685318],"genre_scores_gemma":[0.99771416,0.00009837272,0.000021556463,0.0012500676,0.00027093917,0.000278403,0.00033022344,0.000013966761,0.000022291048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979159,0.0005206274,0.0006693124,0.00028976364,0.0003612187,0.00024317275],"domain_scores_gemma":[0.99695224,0.0014690133,0.0007951309,0.0004100262,0.00031803374,0.00005558304],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00119909,0.000321118,0.00034127556,0.000042576332,0.0019088048,0.00092692714,0.000317923,0.00015026894,0.000023617993],"category_scores_gemma":[0.000066812696,0.000164564,0.00013287715,0.0001239808,0.001041113,0.00027210487,0.00029455402,0.0008042646,0.000050396902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002356935,0.000033210847,0.000013785109,0.0000126490495,0.00008396236,7.734311e-8,0.004871649,0.00016679606,6.088847e-7,0.98740613,0.0010931515,0.006082297],"study_design_scores_gemma":[0.00084217364,0.00011695697,0.00071305595,0.000035781897,0.0000681849,0.0000042278543,0.024545839,0.20993027,0.0000037956268,0.74872804,0.014833734,0.00017791156],"about_ca_topic_score_codex":0.00081538665,"about_ca_topic_score_gemma":0.000012453444,"teacher_disagreement_score":0.49956128,"about_ca_system_score_codex":0.00007615942,"about_ca_system_score_gemma":0.00006694699,"threshold_uncertainty_score":0.9993906},"labels":[],"label_agreement":null},{"id":"W2899409620","doi":"10.26421/qic19.7-8","title":"A Complete Characterization of Pretty Good State Transfer on Paths","year":2019,"lang":"en","type":"paratext","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Oracle; Quantum; Markov chain; Logarithm; Quantum algorithm; Dimension (graph theory); Computer science; Mathematics; Theoretical computer science; Graph; Quantum computer; Algorithm; Combinatorics","score_opus":0.010680300764462325,"score_gpt":0.2285339317723246,"score_spread":0.21785363100786226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899409620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052002836,0.00004708744,0.9413886,0.0002656308,0.0020301025,0.0006804745,0.00040248674,0.00010805393,0.0030747287],"genre_scores_gemma":[0.98394126,0.00036538494,0.00507332,0.0016879624,0.00020579534,0.000042314634,0.007073309,0.00005384901,0.0015568066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.00014068368,0.0008812166,0.00033621333,0.0005264814,0.000274311],"domain_scores_gemma":[0.99865294,0.00012352098,0.00053683226,0.0003403806,0.00025886451,0.000087451735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026509844,0.00036948101,0.0004935374,0.00047642516,0.00014321895,0.00031514312,0.0004057157,0.0001958877,0.000019378305],"category_scores_gemma":[0.000009677909,0.00033799178,0.000114019334,0.0003878171,0.00004748032,0.0009061548,0.00010439671,0.00037117943,0.00072315626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013746617,0.00019248915,0.000014255738,0.002145316,0.00015716597,0.0000020822615,0.011275493,0.11660178,0.0020790002,0.040327184,0.0036174795,0.82345027],"study_design_scores_gemma":[0.00067643746,0.00051732676,0.0010631802,0.00033075616,0.000009443655,0.000010936741,0.000014766188,0.96323085,0.0002021198,0.0008136987,0.032738004,0.00039249432],"about_ca_topic_score_codex":0.00001830932,"about_ca_topic_score_gemma":4.237423e-7,"teacher_disagreement_score":0.9363153,"about_ca_system_score_codex":0.00003804887,"about_ca_system_score_gemma":0.00013747271,"threshold_uncertainty_score":0.9999072},"labels":[],"label_agreement":null},{"id":"W2911524162","doi":"10.26421/qic3.6-2","title":"Uncloneable encryption","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Encryption; Computer science; 40-bit encryption; Probabilistic encryption; Quantum key distribution; Quantum cryptography; Theoretical computer science; Multiple encryption; Cryptography; Computer security; Computer network; Quantum; Quantum information; Physics; Quantum mechanics","score_opus":0.010786032058140998,"score_gpt":0.2289266390103164,"score_spread":0.2181406069521754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911524162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032214854,0.000048725342,0.94854677,0.00027291584,0.00030490107,0.00015173465,0.000001132052,0.00026843252,0.018190514],"genre_scores_gemma":[0.9787081,0.000048134414,0.020073257,0.0011028986,0.000008200078,0.000015312527,0.00002863865,0.0000029194814,0.000012549939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989799,0.00005897488,0.00040468478,0.00011165804,0.00026451715,0.00018025939],"domain_scores_gemma":[0.9993615,0.00003890235,0.00018612009,0.00015999847,0.0001573967,0.00009609207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038686147,0.00012066633,0.000101791455,0.00030023197,0.00023565767,0.00042477582,0.00014155223,0.00006065142,0.00002328702],"category_scores_gemma":[0.000044466327,0.000116000396,0.000041483232,0.0005210709,0.00003072897,0.0048201787,0.000029168543,0.00008613882,0.00027886347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023718183,0.000011496487,0.00010648164,0.000017824588,0.0000043605846,1.6664899e-7,0.0009503873,0.0005841326,0.000019896639,0.9589361,0.0007515857,0.038615193],"study_design_scores_gemma":[0.0008314909,0.000113880174,0.0029918423,0.0000141639275,0.00000473581,0.000054689004,0.00060333166,0.8190029,0.0004714616,0.098061174,0.07755136,0.0002989728],"about_ca_topic_score_codex":0.0000070092447,"about_ca_topic_score_gemma":5.3805417e-7,"teacher_disagreement_score":0.9464932,"about_ca_system_score_codex":0.000021329193,"about_ca_system_score_gemma":0.000050247603,"threshold_uncertainty_score":0.47303587},"labels":[],"label_agreement":null},{"id":"W2911898123","doi":"10.26421/qic15.7-8-5","title":"Momentum switches","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Construct (python library); Momentum (technical analysis); Scattering; Computation; Quantum; Physics; Computer science; Mathematics; Quantum mechanics; Algorithm","score_opus":0.01828933217209201,"score_gpt":0.24691155549415106,"score_spread":0.22862222332205906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911898123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12866664,0.00006178697,0.86789656,0.0013882257,0.00038151877,0.00009364585,9.4774884e-7,0.00026721077,0.0012434656],"genre_scores_gemma":[0.9763532,0.000006025275,0.022950731,0.00060313585,0.000044085427,0.0000051179945,0.000017755463,0.0000032353898,0.000016688953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918,0.0000282849,0.00026005082,0.000119418066,0.00025667585,0.00015553797],"domain_scores_gemma":[0.9994466,0.000032034455,0.00012288988,0.00012716981,0.00013254672,0.00013881562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002967137,0.00010538741,0.000098277145,0.0001527569,0.00011529486,0.00034167743,0.00018720207,0.000038680024,9.447146e-7],"category_scores_gemma":[0.000032911954,0.00009291023,0.000023007226,0.00026227915,0.000022795919,0.0013719244,0.000117543605,0.00008956996,0.00007500695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012008642,0.00003746593,0.000264194,0.000036217585,0.000015135505,0.0000020434745,0.009413514,0.04348197,0.000025568763,0.23304759,0.004260667,0.70940363],"study_design_scores_gemma":[0.0003981607,0.00010079561,0.0009793132,0.000009532593,0.0000016846561,0.000032428583,0.00021609741,0.96024233,0.000054576052,0.028361712,0.009477157,0.00012618706],"about_ca_topic_score_codex":0.00001794774,"about_ca_topic_score_gemma":4.1654553e-7,"teacher_disagreement_score":0.9167604,"about_ca_system_score_codex":0.000023179015,"about_ca_system_score_gemma":0.00006356534,"threshold_uncertainty_score":0.37887692},"labels":[],"label_agreement":null},{"id":"W2949093047","doi":"10.26421/qic15.9-10-3","title":"Tensor networks and graphical calculus for open quantum systems","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Foundational Questions Institute; Canadian Institute for Advanced Research","keywords":"Multipartite; Quantum entanglement; Tensor (intrinsic definition); Quantum information; Bipartite graph; Mathematics; Fidelity; Quantum; Algebra over a field; Computer science; Calculus (dental); Theoretical computer science; Pure mathematics; Discrete mathematics; Quantum mechanics; Graph; Physics","score_opus":0.02436090355698631,"score_gpt":0.27455046523211335,"score_spread":0.250189561675127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949093047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044342548,0.00029902274,0.9528762,0.0009684776,0.0006570386,0.00060454634,0.0000056010294,0.00015554848,0.00009100279],"genre_scores_gemma":[0.98291034,0.000019986783,0.016325455,0.00054264214,0.00008985924,0.000044361568,0.00005033916,0.0000076285396,0.000009408934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988033,0.00007652769,0.00043008348,0.00022725934,0.00021598168,0.00024681672],"domain_scores_gemma":[0.9989977,0.00014711428,0.00021476814,0.00016242663,0.00026074774,0.00021728255],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071721413,0.00016491752,0.00022310895,0.0001587115,0.0002773601,0.0012836076,0.0003551685,0.000093118266,2.0631182e-7],"category_scores_gemma":[0.00006503204,0.00014026172,0.000032032764,0.00028359247,0.000052739775,0.0014170744,0.00029122352,0.0001304932,0.000004461743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005499428,0.00003425545,0.00018346733,0.000086528016,0.000024784114,0.0000018058897,0.002113303,0.22508836,0.0000020044965,0.6345992,0.0030483117,0.13476296],"study_design_scores_gemma":[0.001080718,0.00028967691,0.0011344863,0.00003505885,0.000006623912,0.000077730845,0.00026752183,0.98149437,0.0000015774978,0.010538999,0.0048696357,0.00020360514],"about_ca_topic_score_codex":0.00009564926,"about_ca_topic_score_gemma":0.0000018147838,"teacher_disagreement_score":0.93856776,"about_ca_system_score_codex":0.00002051035,"about_ca_system_score_gemma":0.00006697392,"threshold_uncertainty_score":0.9997532},"labels":[],"label_agreement":null},{"id":"W2949227982","doi":"10.26421/qic12.5-6-3","title":"The monomial representations of the Clifford group","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Monomial; Mathematics; Dimension (graph theory); Permutation matrix; Combinatorics; Permutation (music); Group (periodic table); Heisenberg group; Clifford algebra; Pure mathematics; Discrete mathematics; Algebra over a field; Quantum mechanics; Physics; Circulant matrix","score_opus":0.05928251006063,"score_gpt":0.3496356073316195,"score_spread":0.2903530972709895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949227982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94988304,0.000044417495,0.044404354,0.00056405953,0.00035543845,0.00043495692,0.00000750446,0.000037265218,0.0042689405],"genre_scores_gemma":[0.9991008,0.000014840181,0.000713348,0.000055463304,0.000041439253,0.000020290094,0.000011577988,0.0000042911183,0.000037924216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991052,0.00012598473,0.00036323653,0.00003631544,0.00022615312,0.00014306726],"domain_scores_gemma":[0.99876595,0.0007155246,0.00022767736,0.00015917118,0.00009519929,0.000036492667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000854532,0.0000597214,0.00007064085,0.000049443814,0.0003375722,0.0000666219,0.00012012774,0.000034896766,0.000007702099],"category_scores_gemma":[0.00036095,0.000035130757,0.00004067829,0.00017338173,0.000110415225,0.0007144849,0.00007015452,0.00009582584,0.000018839663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003620464,0.000026069802,0.0023480095,0.0000394934,0.000012842543,9.417173e-9,0.0034379195,0.000060702776,0.000029051937,0.96882105,0.0015496992,0.02363897],"study_design_scores_gemma":[0.0012739107,0.000121737605,0.1269185,0.00004421399,0.000043522923,0.000020226418,0.009111744,0.1919629,0.00053971517,0.6571103,0.012621396,0.00023185759],"about_ca_topic_score_codex":0.000013567138,"about_ca_topic_score_gemma":0.000004495464,"teacher_disagreement_score":0.31171075,"about_ca_system_score_codex":0.000019950929,"about_ca_system_score_gemma":0.000017710705,"threshold_uncertainty_score":0.25963667},"labels":[],"label_agreement":null},{"id":"W2949641106","doi":"10.26421/qic6.6-1","title":"Near-perfect simultaneous measurement of a qubit register","year":2006,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"CCD and CMOS Imaging Sensors","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Qubit; Hyperfine structure; Physics; Quantum computer; Context (archaeology); Scalability; Fidelity; Photon; High fidelity; Quantum; Computer science; Quantum mechanics; Telecommunications","score_opus":0.00841151625109927,"score_gpt":0.19929755102098648,"score_spread":0.19088603476988722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949641106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8824425,0.00012544992,0.11247963,0.000057987952,0.00013795512,0.00012450553,0.00000360201,0.0001800916,0.0044482974],"genre_scores_gemma":[0.9994306,0.0000062627737,0.00047980325,0.00003245957,0.000015082718,0.0000022406425,0.000021973014,0.000004625834,0.000006970129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994746,0.000008132313,0.00024327495,0.00003469974,0.00016584045,0.00007346572],"domain_scores_gemma":[0.99977183,0.000021043777,0.000050368937,0.000046838577,0.000093212606,0.000016704555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009207943,0.00006601208,0.00007798839,0.000052263964,0.000037535876,0.00005474748,0.00002224418,0.00002394289,0.0000041881067],"category_scores_gemma":[0.000013340027,0.00006506989,0.000019034398,0.00007866277,0.000020487503,0.0002594555,0.0000043409996,0.00003838816,0.00001865337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013877825,0.000012272029,0.00025066445,0.00019553213,0.000011604084,6.620744e-7,0.0009087354,0.93633616,0.00074437214,0.0018185179,0.001453297,0.05825433],"study_design_scores_gemma":[0.0002721836,0.00002418559,0.0018119371,0.000023947434,0.0000061892806,0.0000069494727,0.000087634595,0.9919845,0.0005942729,0.0003439451,0.004764981,0.000079295416],"about_ca_topic_score_codex":0.000054279746,"about_ca_topic_score_gemma":0.0000056951967,"teacher_disagreement_score":0.1169881,"about_ca_system_score_codex":0.000027064449,"about_ca_system_score_gemma":0.000008723745,"threshold_uncertainty_score":0.26534733},"labels":[],"label_agreement":null},{"id":"W2949704604","doi":"10.26421/qic7.1-2-3","title":"Time-shift attack in practical quantum cryptosystems","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum key distribution; Computer science; Exploit; Cryptosystem; Key (lock); Synchronization (alternating current); Timing attack; Qubit; SIGNAL (programming language); BB84; Cryptography; Computer network; Computer security; Quantum; Quantum computer; Quantum network; Physics; Side channel attack; Quantum mechanics; Channel (broadcasting)","score_opus":0.020449459217059294,"score_gpt":0.29561054235665524,"score_spread":0.2751610831395959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949704604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18574218,0.000027773256,0.80779296,0.0009922966,0.00031644065,0.00029407072,0.000002080714,0.00025443503,0.0045777787],"genre_scores_gemma":[0.9913233,0.000015944956,0.0074643777,0.0010877383,0.000031797408,0.000011351425,0.00005360994,0.0000059660993,0.0000059387603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978409,0.00007918763,0.0010184136,0.00018857485,0.00049362687,0.0003793362],"domain_scores_gemma":[0.99882925,0.00022339562,0.00038510055,0.00022872172,0.00016072481,0.00017279749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015063194,0.0001998924,0.00021758646,0.0007783576,0.00017308845,0.0004495927,0.00023535016,0.00013654922,0.000017670372],"category_scores_gemma":[0.000085398184,0.00019461228,0.000062217245,0.00096947467,0.00006954668,0.0059309737,0.0000918499,0.00022851946,0.00063215126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006367338,0.000091739756,0.00073182397,0.0001064361,0.000014820983,0.000007723181,0.0077985385,0.0015114079,0.000030822393,0.93504834,0.0024960558,0.052098587],"study_design_scores_gemma":[0.00089935865,0.00013023657,0.0180322,0.00003783778,0.000003318233,0.00005608356,0.0008672441,0.9593146,0.00005691362,0.0074217897,0.012894312,0.00028612],"about_ca_topic_score_codex":0.000027106142,"about_ca_topic_score_gemma":0.0000099796935,"teacher_disagreement_score":0.9578032,"about_ca_system_score_codex":0.000057337376,"about_ca_system_score_gemma":0.00008804993,"threshold_uncertainty_score":0.8125236},"labels":[],"label_agreement":null},{"id":"W2949706770","doi":"10.26421/qic14.3-4-9","title":"Systems of Imprimitivity for the Clifford group","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Linear subspace; Mathematics; Dimension (graph theory); Monomial; Group (periodic table); Square (algebra); Representation (politics); Group representation; Clifford algebra; Combinatorics; Pure mathematics; Algebra over a field; Geometry; Quantum mechanics","score_opus":0.031217020979510315,"score_gpt":0.28956150448315066,"score_spread":0.25834448350364037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949706770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09785243,0.000038791455,0.9013188,0.00008728399,0.000091171474,0.00022300829,0.000005425403,0.00002396845,0.00035911688],"genre_scores_gemma":[0.9982988,0.000015098179,0.0015218183,0.00006789337,0.000029208131,0.000020512165,0.000028211021,0.0000028597483,0.000015585329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.000031877895,0.000345665,0.00004438186,0.000143209,0.00007326309],"domain_scores_gemma":[0.99841285,0.0010361776,0.00030761817,0.00007942041,0.00014292308,0.000021005457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073608966,0.000060098122,0.00013707434,0.000102425074,0.00012079189,0.000043370255,0.00005094817,0.000037688736,0.0000026273171],"category_scores_gemma":[0.00030367015,0.00004007557,0.00004994942,0.00019340456,0.00003273854,0.0002843404,0.000014241163,0.00003364451,0.0000035792602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016483646,0.000015976138,0.00025929726,0.00021623974,0.00003888099,5.253042e-9,0.0005672795,0.0007088429,0.0000026521868,0.90318346,0.0009296794,0.09406121],"study_design_scores_gemma":[0.00037121394,0.00008909884,0.00272546,0.000011517854,0.000060347695,0.0000016412595,0.0009590441,0.92946464,0.000007613461,0.06351915,0.002729611,0.000060666684],"about_ca_topic_score_codex":0.00003406611,"about_ca_topic_score_gemma":0.000002213685,"teacher_disagreement_score":0.92875576,"about_ca_system_score_codex":0.000009431554,"about_ca_system_score_gemma":0.000007892706,"threshold_uncertainty_score":0.16342343},"labels":[],"label_agreement":null},{"id":"W2950141386","doi":"10.26421/qic9.1-2-8","title":"Security proof of quantum key distribution with detection efficiency mismatch","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Quantum key distribution; Key (lock); Computer science; Detector; Set (abstract data type); Spectral efficiency; Quantum; Key generation; Theoretical computer science; Algorithm; Physics; Quantum mechanics; Cryptography; Computer network; Computer security; Telecommunications; Channel (broadcasting)","score_opus":0.005558103140995537,"score_gpt":0.21698832307025823,"score_spread":0.2114302199292627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950141386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23561564,0.000026886957,0.7628942,0.00035869877,0.00010018703,0.00026872248,0.000007679644,0.00015814668,0.0005698398],"genre_scores_gemma":[0.9983697,0.000014562598,0.0012138225,0.0002624477,0.000011790195,0.0000099662475,0.00011396343,0.0000027486258,0.0000010023035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846697,0.00005355918,0.0006431099,0.0001582482,0.00046229668,0.00021581312],"domain_scores_gemma":[0.9987546,0.00003814316,0.0005032975,0.00020778683,0.00039824483,0.000097918804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036889373,0.00017847522,0.00019204013,0.00027339027,0.00022349932,0.00022694956,0.00021316468,0.00008755593,0.0000030653623],"category_scores_gemma":[0.00002816256,0.00015270711,0.00005681022,0.00091695314,0.000065036686,0.0034601805,0.000029452234,0.0001342321,0.00001266025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012929106,0.00018537961,0.00014001704,0.0001650641,0.000018887578,7.7431747e-7,0.007292244,0.006912856,0.00018780722,0.7583867,0.00026425454,0.22631678],"study_design_scores_gemma":[0.00077611365,0.00077479135,0.005928103,0.00004011925,0.000008720802,0.000035938418,0.00042922658,0.9644316,0.004108537,0.02236863,0.0008802406,0.00021797244],"about_ca_topic_score_codex":0.000016039588,"about_ca_topic_score_gemma":0.0000018754179,"teacher_disagreement_score":0.95751876,"about_ca_system_score_codex":0.00003311265,"about_ca_system_score_gemma":0.00006004931,"threshold_uncertainty_score":0.62272155},"labels":[],"label_agreement":null},{"id":"W2950522577","doi":"10.26421/qic15.5-6-1","title":"The Trotter step size required for accurate quantum simulation of quantum chemistry","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Scaling; Statistical physics; Computer science; Quantum; Algorithm; Quantum mechanics; Mathematics; Physics","score_opus":0.022749020320635117,"score_gpt":0.2797801669984358,"score_spread":0.25703114667780064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950522577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11309861,0.00008634086,0.88458556,0.0011560381,0.00044008484,0.0003914687,0.000009930968,0.00014005529,0.00009190323],"genre_scores_gemma":[0.9908814,0.000008789895,0.008705818,0.00022859541,0.000083968735,0.000026330556,0.000038521866,0.0000093044955,0.000017309347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982525,0.000081347855,0.0007704948,0.0002084745,0.00040387778,0.0002833041],"domain_scores_gemma":[0.99753803,0.00088646397,0.0006063421,0.00028892694,0.00055517285,0.00012509138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088948396,0.0002000999,0.00022261214,0.00007029978,0.00035180207,0.00040000302,0.0003916725,0.000096356525,9.901755e-7],"category_scores_gemma":[0.00041667168,0.00015184346,0.00008400823,0.000322348,0.00008624218,0.0011971114,0.00012674053,0.00013199281,0.000008444678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019873718,0.00005440381,0.000046913567,0.00020770372,0.000045308247,6.9235625e-7,0.004531728,0.7290746,0.00022532124,0.06721813,0.0015999167,0.19679658],"study_design_scores_gemma":[0.0010873077,0.000187218,0.00044784846,0.0000338318,0.00000877063,0.000009635716,0.00037393344,0.9696318,0.000220942,0.022261478,0.0055456185,0.0001916512],"about_ca_topic_score_codex":0.000016209258,"about_ca_topic_score_gemma":5.8636374e-7,"teacher_disagreement_score":0.87778276,"about_ca_system_score_codex":0.000038566395,"about_ca_system_score_gemma":0.00014067545,"threshold_uncertainty_score":0.61919963},"labels":[],"label_agreement":null},{"id":"W2950705130","doi":"10.26421/qic11.9-10-6","title":"Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Mathematics; Bipartite graph; Unitary matrix; Unitary state; Combinatorics; Equivalence (formal languages); Circular ensemble; Matrix (chemical analysis); Discrete mathematics; Complete bipartite graph; Pure mathematics; Graph","score_opus":0.03611720263423395,"score_gpt":0.2821634803894887,"score_spread":0.24604627775525473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950705130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52727675,0.000098263714,0.4721767,0.00006300911,0.00008155456,0.00009591185,0.000010441255,0.00005834388,0.00013903646],"genre_scores_gemma":[0.9867163,0.00009122409,0.013070038,0.00007051395,0.000013748954,0.0000034349678,0.000027775377,0.0000033102338,0.000003684305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899215,0.000080547856,0.00048145917,0.00012136505,0.00016723732,0.0001572729],"domain_scores_gemma":[0.999234,0.00016230016,0.0002889834,0.00012502124,0.000103929495,0.00008572343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495762,0.000115959265,0.00017127788,0.0002185844,0.00013353044,0.00010781514,0.00017792376,0.00004899105,0.0000071706518],"category_scores_gemma":[0.000029483634,0.00010831292,0.000024012603,0.00024426338,0.00006809425,0.0024908497,0.00012452589,0.00006775267,0.000015502877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006230687,0.000045886183,0.007543615,0.00041187115,0.00005112526,0.0000026721993,0.024585178,0.00074902805,0.00019340559,0.67561585,0.00019738331,0.29054165],"study_design_scores_gemma":[0.00051514455,0.0002465546,0.024736967,0.00007379466,0.000016507149,0.000018435578,0.0007446035,0.8570989,0.0019520572,0.11411346,0.00024415494,0.00023945114],"about_ca_topic_score_codex":0.0000636041,"about_ca_topic_score_gemma":5.845432e-7,"teacher_disagreement_score":0.8563498,"about_ca_system_score_codex":0.000009398024,"about_ca_system_score_gemma":0.000029951976,"threshold_uncertainty_score":0.44168726},"labels":[],"label_agreement":null},{"id":"W2950872758","doi":"10.26421/qic8.10-1","title":"The geometry of quantum computation","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum; Oracle; Complexity class; Quantum complexity theory; Mathematics; Class (philosophy); Quantum algorithm; Quantum computer; Discrete mathematics; Combinatorics; Computer science; Quantum mechanics; Time complexity; Physics","score_opus":0.011819555094252514,"score_gpt":0.2373156616422663,"score_spread":0.2254961065480138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950872758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30754253,0.00013251166,0.6910211,0.0005685468,0.00031282142,0.00012319289,0.0000019471388,0.000114945644,0.00018243407],"genre_scores_gemma":[0.98901373,0.00010155051,0.010618212,0.00019691448,0.00003296408,0.0000049708483,0.000019815878,0.0000047219796,0.0000071412114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859303,0.000081622115,0.00057427085,0.00014735265,0.00039347104,0.00021022576],"domain_scores_gemma":[0.99878526,0.00031900356,0.00039310235,0.00018067383,0.00025052152,0.00007145823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041009032,0.0001431645,0.00016348295,0.0002087874,0.0006872677,0.00015861014,0.00030516044,0.00005709408,8.2113615e-7],"category_scores_gemma":[0.00006531605,0.000106545274,0.000058768695,0.00056986365,0.00014019216,0.000941992,0.00013027647,0.00015008955,0.000020535992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028161765,0.000054801916,0.0005380567,0.0000790592,0.000035497902,0.0000031719849,0.005827296,0.09914043,0.000053577995,0.30093953,0.0017107886,0.5915896],"study_design_scores_gemma":[0.00035608682,0.00013200704,0.0143661415,0.00001744134,0.000002913732,0.00009524296,0.00013809801,0.97118354,0.000082889914,0.011874374,0.0016201814,0.000131077],"about_ca_topic_score_codex":0.000030524072,"about_ca_topic_score_gemma":6.543341e-7,"teacher_disagreement_score":0.87204313,"about_ca_system_score_codex":0.000017850887,"about_ca_system_score_gemma":0.00007826877,"threshold_uncertainty_score":0.52859765},"labels":[],"label_agreement":null},{"id":"W2951088235","doi":"10.26421/qic5.45-2","title":"Minimum entangled state dimension required for pseudo-telepathy","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Telepathy; Quantum entanglement; Quantum pseudo-telepathy; Dimension (graph theory); Alice and Bob; Quantum; Computer science; Mathematics; Mathematical economics; Discrete mathematics; Combinatorics; Physics; Quantum information science; Quantum mechanics","score_opus":0.012284398589569385,"score_gpt":0.25914444745201326,"score_spread":0.24686004886244386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951088235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4595401,0.000010275444,0.5391016,0.00043336512,0.000078180965,0.00036439774,0.00005891654,0.000045057695,0.00036810664],"genre_scores_gemma":[0.9957647,0.000005845128,0.0031362874,0.0002365352,0.000090108435,0.00009438138,0.0006328582,0.000007872539,0.000031435276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992546,0.000013163683,0.0003599133,0.00010840348,0.00011130667,0.00015262276],"domain_scores_gemma":[0.99948144,0.000047161808,0.00019290093,0.00008515548,0.00012721927,0.00006610507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014312522,0.000111317386,0.00011228476,0.000079389254,0.00020560923,0.00010322098,0.000050983544,0.000026036198,0.00002783883],"category_scores_gemma":[0.0000038726357,0.00010896832,0.000048725014,0.00010188225,0.000014526605,0.00068697194,0.000020802707,0.00004754688,0.00008103672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000548814,0.00008766502,0.00013342782,0.00002791522,0.000026684338,3.845766e-8,0.0016530516,0.001103743,0.001257921,0.6602274,0.002656116,0.33277112],"study_design_scores_gemma":[0.0009360821,0.00007555478,0.00021860434,0.00001116007,0.000013902923,9.682054e-7,0.00045370875,0.8759217,0.00081021414,0.09990757,0.02149157,0.00015892951],"about_ca_topic_score_codex":0.00001448511,"about_ca_topic_score_gemma":0.000001174853,"teacher_disagreement_score":0.87481797,"about_ca_system_score_codex":0.000018185943,"about_ca_system_score_gemma":0.000027619717,"threshold_uncertainty_score":0.44435993},"labels":[],"label_agreement":null},{"id":"W2951202993","doi":"10.26421/qic7.1-2-4","title":"Hidden symmetry detection on a quantum computer","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Canadian Institute for Advanced Research","funders":"","keywords":"Homogeneous space; Quantum algorithm; Symmetry (geometry); Quantum; Simple (philosophy); Class (philosophy); Quantum computer; Discrete symmetry; Similarity (geometry); Discrete mathematics; Mathematics; Point (geometry); Combinatorics; Algorithm; Pure mathematics; Computer science; Physics; Quantum mechanics; Artificial intelligence; Geometry","score_opus":0.00853869995008665,"score_gpt":0.23936084432878962,"score_spread":0.23082214437870296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951202993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25572842,0.000017263495,0.74210346,0.00043434318,0.00078682497,0.00016473164,0.0000014930419,0.00036144705,0.0004020316],"genre_scores_gemma":[0.9751805,0.0000071166646,0.023214813,0.0013784773,0.00018080066,0.000003955516,0.000019778714,0.000008594458,0.000005976956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998341,0.00006138512,0.0005489445,0.0002715743,0.0004279249,0.0003491485],"domain_scores_gemma":[0.9989661,0.00022551682,0.00026983352,0.00023454054,0.00015071104,0.00015329171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000744018,0.00022477585,0.00018495783,0.0005292719,0.0003666677,0.00041851445,0.0002751961,0.00011262155,0.000002234469],"category_scores_gemma":[0.000030405943,0.00020528665,0.00006766364,0.0005914322,0.000042819433,0.0011242838,0.00012851549,0.00027268822,0.00012124975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024215873,0.000032321346,0.00003984013,0.000027207954,0.000010893991,0.0000037290515,0.0010765143,0.0032464997,0.00003874475,0.09742125,0.00020459747,0.8978742],"study_design_scores_gemma":[0.00054072554,0.00042656486,0.013936382,0.000037747956,0.000004064843,0.000077855446,0.000086586886,0.9715283,0.00045884072,0.009906579,0.002735617,0.00026075993],"about_ca_topic_score_codex":0.000025728064,"about_ca_topic_score_gemma":0.0000031766667,"teacher_disagreement_score":0.9682818,"about_ca_system_score_codex":0.00005566667,"about_ca_system_score_gemma":0.000032333006,"threshold_uncertainty_score":0.83713466},"labels":[],"label_agreement":null},{"id":"W2951237228","doi":"10.26421/qic8.8-9-1","title":"Estimating Jones polynomials is a complete problem for one clean qubit","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Institut Périmètre de physique théorique; W. M. Keck Foundation; U.S. Department of Energy; National Science Foundation","keywords":"Braid; Qubit; Quantum computer; Mathematics; TRACE (psycholinguistics); Polynomial; Discrete mathematics; Combinatorics; Closure (psychology); Quantum; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.02902893302079605,"score_gpt":0.25695676594392985,"score_spread":0.22792783292313382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951237228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10376505,0.000029815197,0.89355177,0.0015255278,0.00023946336,0.0004316972,0.000014213086,0.00026318265,0.00017930829],"genre_scores_gemma":[0.56895643,0.000006180164,0.42977396,0.0010814483,0.00009574474,0.000024031897,0.000044834327,0.000007146874,0.0000102017375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986548,0.000039983475,0.0005543489,0.00021964284,0.0002626663,0.00026860088],"domain_scores_gemma":[0.99905133,0.00015711688,0.00033368857,0.00016699173,0.00019288115,0.00009801019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030501327,0.00017504014,0.00022639,0.00020137554,0.0006561028,0.0002738985,0.0002495319,0.000061599785,0.0000027437645],"category_scores_gemma":[0.000035185756,0.0001704819,0.00006703602,0.00026762323,0.00005607014,0.0011764436,0.00011022744,0.000112139154,0.000029642222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049069917,0.00009996301,0.00017476644,0.0003655476,0.000057359222,0.000002080032,0.022993429,0.08773281,0.00016499472,0.0593848,0.006158516,0.82281667],"study_design_scores_gemma":[0.0007191444,0.00019423434,0.0015672632,0.000051650306,0.000005233439,0.000074931006,0.000070067676,0.9817765,0.00010119357,0.013281421,0.0019354082,0.00022297715],"about_ca_topic_score_codex":0.00004278329,"about_ca_topic_score_gemma":0.0000011993156,"teacher_disagreement_score":0.8940437,"about_ca_system_score_codex":0.00002303395,"about_ca_system_score_gemma":0.000070251335,"threshold_uncertainty_score":0.69520503},"labels":[],"label_agreement":null},{"id":"W2951475827","doi":"10.26421/qic.10-8","title":"On the iterative decoding of sparse quantum codes","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Decoding methods; Belief propagation; Algorithm; List decoding; Theoretical computer science; Sequential decoding; Quantum computer; Quantum; Concatenated error correction code; Block code; Quantum mechanics; Physics","score_opus":0.020854610964425476,"score_gpt":0.2456400102863635,"score_spread":0.22478539932193803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951475827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48342764,0.000020729229,0.5152891,0.00070023804,0.00012733,0.00010017859,0.0000025915292,0.000060679355,0.000271492],"genre_scores_gemma":[0.9928283,0.000027826818,0.006292456,0.0008048524,0.0000202641,0.0000053116496,0.000013328131,0.0000032890757,0.000004377067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989874,0.000088461085,0.00037398946,0.00012523144,0.0002775626,0.0001473635],"domain_scores_gemma":[0.9989748,0.00040666203,0.00026394363,0.00016812386,0.00013957985,0.000046918434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029385637,0.00012820662,0.00014600669,0.00015579938,0.00039472786,0.00011259632,0.00023919586,0.00003875963,0.0000035730952],"category_scores_gemma":[0.00007721315,0.00008772572,0.000045772587,0.0003102569,0.00008902773,0.00062096055,0.000080846534,0.00013947365,0.000022468068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019700981,0.00004121869,0.00010863816,0.000030155827,0.000018922363,0.0000026635114,0.01448653,0.064177655,0.000042109306,0.86791414,0.0012698339,0.051888417],"study_design_scores_gemma":[0.00023392748,0.0001679804,0.0023573604,0.000040368697,0.0000020371142,0.000045434284,0.00017503799,0.97522503,0.00027338925,0.021026859,0.00034398775,0.00010861312],"about_ca_topic_score_codex":0.000018608698,"about_ca_topic_score_gemma":6.007098e-7,"teacher_disagreement_score":0.91104734,"about_ca_system_score_codex":0.000013477763,"about_ca_system_score_gemma":0.000042219304,"threshold_uncertainty_score":0.3577351},"labels":[],"label_agreement":null},{"id":"W2951781965","doi":"10.26421/qic2.1-4","title":"Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol","year":2002,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Alice and Bob; BB84; State (computer science); Protocol (science); Computer science; Cheating; Mathematics; Commitment scheme; Quantum state; Upper and lower bounds; Discrete mathematics; Alice (programming language); Quantum; Quantum cryptography; Theoretical computer science; Quantum information; Algorithm; Quantum mechanics; Cryptography; Physics","score_opus":0.023020037148536,"score_gpt":0.2616641739560873,"score_spread":0.2386441368075513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951781965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01706258,0.000014460283,0.9717094,0.0005628495,0.00023182141,0.009023512,0.0000086883065,0.00006371675,0.0013229828],"genre_scores_gemma":[0.9917041,0.000022366285,0.0059458693,0.00033040144,0.0000073029682,0.0019493555,0.000026844322,0.0000048217307,0.000008909489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983394,0.000104423845,0.00096756447,0.00010537982,0.00034082745,0.0001424143],"domain_scores_gemma":[0.9986824,0.000052226318,0.00069287594,0.00026127577,0.00026530298,0.00004595736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026497038,0.00013484144,0.00017945888,0.00037911572,0.00012122995,0.000092041926,0.0003120917,0.00006851947,0.000037439786],"category_scores_gemma":[0.00003618629,0.00010644962,0.00006936156,0.0010574453,0.00008031007,0.0016544027,0.000097869095,0.00009135696,0.000008300795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013947961,0.00019030001,0.0028624565,0.0002587295,0.000015402476,1.0122495e-7,0.005280342,0.5417758,0.000032360906,0.43224025,0.0013820129,0.015948258],"study_design_scores_gemma":[0.0009722437,0.000098302036,0.0051844693,0.00006190683,0.0000041002,0.0000028941497,0.00019425455,0.98939526,0.00028630582,0.0020586038,0.0016256194,0.000116063915],"about_ca_topic_score_codex":0.000031823412,"about_ca_topic_score_gemma":0.0000050911694,"teacher_disagreement_score":0.97464156,"about_ca_system_score_codex":0.000030851545,"about_ca_system_score_gemma":0.000033524128,"threshold_uncertainty_score":0.43408895},"labels":[],"label_agreement":null},{"id":"W2951841454","doi":"10.26421/qic9.5-6-12","title":"Exact quantum lower bound for Grover's problem","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Upper and lower bounds; Oracle; Intuition; Simple (philosophy); Mathematics; Quantum algorithm; Set (abstract data type); Quantum; Combinatorics; Discrete mathematics; Computer science; Algorithm; Quantum mechanics; Physics","score_opus":0.009243585197173913,"score_gpt":0.24577145728734529,"score_spread":0.23652787209017137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951841454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076153874,0.0000632129,0.9195265,0.002594397,0.00042957958,0.0004130293,0.0000056387426,0.00031992412,0.00049382553],"genre_scores_gemma":[0.9485247,0.000013608328,0.0494985,0.001783139,0.00009268936,0.000013709501,0.000053350315,0.000006011467,0.0000143091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870265,0.000035475914,0.0004632803,0.0002311491,0.00026571084,0.00030175768],"domain_scores_gemma":[0.9991598,0.000111140864,0.0002495129,0.00019000238,0.0001796262,0.00010990374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034970086,0.00019559926,0.00018496499,0.0002025888,0.00036424896,0.0006524022,0.00026973494,0.00007945304,0.000002031254],"category_scores_gemma":[0.000032077,0.00017665827,0.00007662091,0.00029668357,0.000029526971,0.0017573802,0.000054438555,0.00013162136,0.000023088858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034641147,0.00006565051,0.000013848053,0.000059344802,0.000012555782,0.0000012563752,0.001836649,0.015689012,0.000058391754,0.38380548,0.0026053225,0.59581786],"study_design_scores_gemma":[0.000625729,0.0005382286,0.0017621676,0.000030935178,0.0000047851954,0.000028167893,0.000040262876,0.87870425,0.000039364826,0.10814322,0.009859701,0.00022317254],"about_ca_topic_score_codex":0.000010200751,"about_ca_topic_score_gemma":6.310743e-7,"teacher_disagreement_score":0.87237084,"about_ca_system_score_codex":0.000030571224,"about_ca_system_score_gemma":0.00006586821,"threshold_uncertainty_score":0.7203915},"labels":[],"label_agreement":null},{"id":"W2951945888","doi":"10.26421/qic9.9-10-8","title":"Complete characterization of mixing time for the continuous quantum walk on the hypercube with Markovian decoherence model","year":2009,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Quantum decoherence; Mixing (physics); Quantum walk; Qubit; Hypercube; Statistical physics; Markov process; Quantum; Random walk; Physics; Quantum computer; Quantum mechanics; Mathematics; Discrete mathematics","score_opus":0.01567765873367429,"score_gpt":0.2281364805216202,"score_spread":0.2124588217879459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951945888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17663793,0.000033319564,0.8193545,0.0024511511,0.00018334301,0.0010576342,0.00007363682,0.000113260525,0.000095267096],"genre_scores_gemma":[0.9782976,0.000035405556,0.019825626,0.0012833613,0.00006735849,0.00005061938,0.00041715437,0.00001307139,0.000009786091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981992,0.0001198908,0.00066375604,0.00031458665,0.00043803375,0.00026453688],"domain_scores_gemma":[0.99764,0.000536483,0.00090724294,0.00047928636,0.00037846834,0.00005848783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067163084,0.00033545127,0.00036382963,0.00017484326,0.0004448646,0.0004536772,0.0007363239,0.00013590253,0.000002013415],"category_scores_gemma":[0.000046750407,0.00019868914,0.00010477586,0.00023258895,0.00009642176,0.00043628854,0.00019266295,0.00039607505,0.00000717862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000982019,0.0000425933,0.000015968395,0.00018571703,0.00006292441,5.210693e-7,0.0030289236,0.6045572,0.00022491992,0.06659766,0.000109174995,0.3250762],"study_design_scores_gemma":[0.00035798093,0.00028330908,0.0032856308,0.0002644991,0.000026322716,0.000013939558,0.00005401517,0.9762427,0.00004330238,0.018991815,0.00017195973,0.00026451075],"about_ca_topic_score_codex":0.000022961754,"about_ca_topic_score_gemma":0.0000015973771,"teacher_disagreement_score":0.8016597,"about_ca_system_score_codex":0.00002748887,"about_ca_system_score_gemma":0.00013929038,"threshold_uncertainty_score":0.8102308},"labels":[],"label_agreement":null},{"id":"W2951987143","doi":"10.26421/qic6.4-5-6","title":"Operator quantum error correction","year":2006,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agricultural Research Development Agency","keywords":"Quantum error correction; Decoherence-free subspaces; Linear subspace; Quantum; Operator (biology); Quantum decoherence; Error detection and correction; Formalism (music); Computer science; Algorithm; Quantum operation; Mathematics; Quantum algorithm; Quantum mechanics; Open quantum system; Pure mathematics; Physics","score_opus":0.009021169394826136,"score_gpt":0.23466204438199048,"score_spread":0.22564087498716434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951987143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122418664,0.000049904687,0.8707612,0.0005839836,0.0012053375,0.00022224343,0.0000034838295,0.00049374875,0.0042614173],"genre_scores_gemma":[0.9947313,0.000019369325,0.003991036,0.001012832,0.00005595792,0.000025147056,0.00012442467,0.0000056066365,0.00003433716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985463,0.000054830576,0.00063949946,0.00016458397,0.00035691197,0.00023785917],"domain_scores_gemma":[0.99912673,0.000050784958,0.00028329363,0.00019402943,0.00025484635,0.00009034146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002995032,0.00018334088,0.00015371562,0.00043456137,0.0003528532,0.00070244697,0.0002245726,0.000091079935,0.000016651004],"category_scores_gemma":[0.000022270127,0.00017539752,0.000065037704,0.00067203806,0.000049867907,0.0054068347,0.00006623959,0.00013244091,0.00028510336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001633388,0.000048440732,0.0005033523,0.00004403999,0.000009281415,7.6183113e-7,0.0010292367,0.005212147,0.00006622445,0.88984525,0.017900523,0.08532438],"study_design_scores_gemma":[0.0005570197,0.000096400916,0.012471295,0.000014547267,0.0000044355966,0.00003846859,0.0003824201,0.95311356,0.00021956603,0.013838861,0.019020196,0.00024324877],"about_ca_topic_score_codex":0.0001028141,"about_ca_topic_score_gemma":0.000009779541,"teacher_disagreement_score":0.94790137,"about_ca_system_score_codex":0.000036897483,"about_ca_system_score_gemma":0.0000624196,"threshold_uncertainty_score":0.7152504},"labels":[],"label_agreement":null},{"id":"W2952109748","doi":"10.26421/qic7.7-7","title":"Sequential attacks against differential-phase-shift quantum key distribution with weak coherent states","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Quantum key distribution; Differential phase; Coherent states; Key (lock); Differential (mechanical device); Quantum; Phase (matter); Distribution (mathematics); Computer science; SIGNAL (programming language); Mathematics; Algorithm; Statistical physics; Quantum mechanics; Physics; Computer security; Mathematical analysis","score_opus":0.012479239448249723,"score_gpt":0.26556795497901053,"score_spread":0.2530887155307608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952109748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35045275,0.00002180378,0.6476811,0.00031005396,0.0003061033,0.00030277699,0.00003191092,0.00030042516,0.0005930709],"genre_scores_gemma":[0.99557376,0.000055680597,0.0017382919,0.00051105185,0.000044961216,0.000020278723,0.0020414237,0.000009703497,0.000004866764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975616,0.00006776431,0.0009575666,0.00025468096,0.00068751606,0.00047091162],"domain_scores_gemma":[0.99846816,0.000092965915,0.0005784494,0.00027648185,0.00033126192,0.00025266354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005573908,0.00032067395,0.00026116136,0.00038415033,0.0004599163,0.00084917573,0.00031555074,0.0001271253,0.000019411023],"category_scores_gemma":[0.00001764668,0.0002738717,0.00008932854,0.00071982417,0.00012344612,0.004165187,0.000102911355,0.00022962873,0.00010108822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036914597,0.00028712637,0.0006402823,0.0001839863,0.00009499825,0.0000052769497,0.0072196177,0.003415656,0.00012835514,0.7964093,0.0025459107,0.18870036],"study_design_scores_gemma":[0.0032916204,0.0005835101,0.011826058,0.000065080705,0.000020829057,0.000026930938,0.0012136677,0.9612154,0.0005415863,0.005226774,0.015466804,0.0005217418],"about_ca_topic_score_codex":0.000030934396,"about_ca_topic_score_gemma":0.000014135222,"teacher_disagreement_score":0.95779973,"about_ca_system_score_codex":0.000084721796,"about_ca_system_score_gemma":0.00008402445,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W2952708901","doi":"10.26421/qic1.3-2","title":"Decomposing finite Abelian groups","year":2001,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Mathematics; Factoring; Elementary abelian group; Cyclic group; Decomposition; Rank of an abelian group; Riemann hypothesis; Order (exchange); Class (philosophy); Product (mathematics); Group (periodic table); Solvable group; Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field; Computer science; Physics","score_opus":0.009734508865858991,"score_gpt":0.2402801878867882,"score_spread":0.2305456790209292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952708901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20693724,0.000053477015,0.7906588,0.0009803367,0.00029677403,0.00009137912,9.484094e-7,0.00026727002,0.00071378745],"genre_scores_gemma":[0.9651789,0.000037570993,0.033682138,0.0010059088,0.00005491279,0.000003861264,0.000025383604,0.0000045223737,0.000006808635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.000043934113,0.0003472049,0.00015725917,0.00021930161,0.00021556499],"domain_scores_gemma":[0.9993886,0.00010989937,0.0001598509,0.0001519965,0.0000932517,0.00009644508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023025548,0.0001364798,0.00012034286,0.0002331437,0.00031245593,0.0004925749,0.00021980255,0.000051250077,0.0000045220822],"category_scores_gemma":[0.000025265406,0.00012689337,0.00003772448,0.0004306109,0.000028274402,0.0015331183,0.000108780776,0.00012899967,0.000074957454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009478655,0.00002616421,0.00046050226,0.000026349537,0.000010233474,0.0000052976907,0.0028681783,0.066763334,0.000028804947,0.068306044,0.0003149212,0.86118066],"study_design_scores_gemma":[0.0003488188,0.000078984776,0.005000681,0.000025511892,0.0000024361684,0.000092605216,0.000082404105,0.9752924,0.000020572943,0.012550657,0.006336007,0.00016892763],"about_ca_topic_score_codex":0.000019011575,"about_ca_topic_score_gemma":0.0000012852471,"teacher_disagreement_score":0.90852904,"about_ca_system_score_codex":0.000019073885,"about_ca_system_score_gemma":0.000028391285,"threshold_uncertainty_score":0.5174561},"labels":[],"label_agreement":null},{"id":"W2953206701","doi":"10.26421/qic9.11-12-7","title":"Quantum universality by state distillation","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Upper and lower bounds; Universality (dynamical systems); Mathematics; Quantum; Quantum computer; Distillation; Statistical physics; Quantum mechanics; Topology (electrical circuits); Discrete mathematics; Physics; Combinatorics; Chemistry; Mathematical analysis","score_opus":0.006348388901392206,"score_gpt":0.22762004628158983,"score_spread":0.22127165738019763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953206701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20504133,0.000049656028,0.7923304,0.0016525332,0.00016982264,0.0001246984,0.000008151826,0.00028686618,0.00033657087],"genre_scores_gemma":[0.9929198,0.000023712384,0.0061063245,0.0008248723,0.000020670886,0.0000012024074,0.00008766828,0.00000304312,0.00001268331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998884,0.00006677703,0.00036940505,0.00018902493,0.00027802048,0.00021276479],"domain_scores_gemma":[0.999326,0.0000589221,0.0002251084,0.00016386028,0.00011937692,0.00010676733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026300855,0.0001559791,0.00013936612,0.00014794222,0.00025935055,0.00038424737,0.00020522623,0.000050897463,0.0000020061227],"category_scores_gemma":[0.000022803195,0.00014693689,0.00003750174,0.0003502517,0.00003116878,0.0017123346,0.00005140019,0.00013164131,0.00002785468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001698533,0.00004006055,0.00008541158,0.000020719968,0.000008567986,0.0000013788602,0.002716006,0.022789184,0.00010075044,0.12983626,0.0025277338,0.84185696],"study_design_scores_gemma":[0.00037006236,0.0001602648,0.009389558,0.0000137184325,0.0000025968254,0.0000133012745,0.00005254472,0.9469295,0.000057541256,0.038260754,0.004563643,0.00018652402],"about_ca_topic_score_codex":0.000028416262,"about_ca_topic_score_gemma":5.6723997e-7,"teacher_disagreement_score":0.92414033,"about_ca_system_score_codex":0.000035409907,"about_ca_system_score_gemma":0.000038231043,"threshold_uncertainty_score":0.59919125},"labels":[],"label_agreement":null},{"id":"W2962771026","doi":"10.26421/qic16.1-2-1","title":"Complexity of the XY antiferromagnet at fixed magnetization","year":2016,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Physics of Superconductivity and Magnetism","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Institute for Quantum Information and Matter, California Institute of Technology; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Antiferromagnetism; Magnetization; Simple (philosophy); Classical XY model; Physics; Mathematics; Completeness (order theory); Bose–Hubbard model; Ground state; Hubbard model; Discrete mathematics; Quantum mechanics; Superconductivity; Magnetic field; Mathematical analysis","score_opus":0.021184182715411108,"score_gpt":0.23100857426339055,"score_spread":0.20982439154797944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962771026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92508006,0.000007974687,0.06954322,0.0008237239,0.00013901624,0.00015344229,0.0000544197,0.00001824597,0.0041798996],"genre_scores_gemma":[0.9995753,0.0000032394933,0.00017277287,0.00008281033,0.00002648808,0.0000051354305,0.000054133758,0.0000027827646,0.00007730136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994821,0.000033523604,0.00021264523,0.000063056206,0.0001261008,0.00008257327],"domain_scores_gemma":[0.99961776,0.000034800047,0.00014871388,0.00008963847,0.00008264241,0.000026426595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007035813,0.00007329943,0.000085930405,0.000034586214,0.00013345481,0.000022733595,0.00006439662,0.000020602758,0.00012588232],"category_scores_gemma":[0.0000048149527,0.000046712554,0.00003633017,0.0000937156,0.00014339478,0.0016212903,0.000061211365,0.000030907577,0.000029574634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030484503,0.00006550782,0.0072936853,0.000047211583,0.000019192223,2.7698512e-8,0.0010380633,0.00018632499,0.017205464,0.78238255,0.0013660144,0.19036546],"study_design_scores_gemma":[0.0036798024,0.00029684874,0.332713,0.0001492334,0.00005797739,0.000004318535,0.0009997102,0.06202875,0.026618583,0.5642706,0.008617933,0.00056323735],"about_ca_topic_score_codex":0.00006150353,"about_ca_topic_score_gemma":0.0000027047656,"teacher_disagreement_score":0.32541934,"about_ca_system_score_codex":0.000010762306,"about_ca_system_score_gemma":0.000019413597,"threshold_uncertainty_score":0.19048828},"labels":[],"label_agreement":null},{"id":"W2962792428","doi":"10.26421/qic7.1-2-6","title":"Invertible quantum operations and perfect encryption of quantum states","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Mitacs; Government of Canada","keywords":"Invertible matrix; Encryption; Mathematics; Quantum; Unitary transformation; Unitary state; Quantum state; Discrete mathematics; Quantum operation; Quantum algorithm; Pure mathematics; Computer science; Quantum mechanics; Physics; Open quantum system","score_opus":0.008959282702468613,"score_gpt":0.24589734855391038,"score_spread":0.23693806585144175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962792428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4554933,0.000094101946,0.5436699,0.00028365612,0.00016297905,0.00013262923,0.0000035505977,0.00009717981,0.00006269915],"genre_scores_gemma":[0.98359597,0.000096322314,0.015887119,0.0003115797,0.000034599685,0.000004303721,0.000059306898,0.0000067476644,0.0000040709697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845314,0.0000695413,0.0006689175,0.00021959218,0.00032065687,0.00026815603],"domain_scores_gemma":[0.9990476,0.00018351534,0.00021873973,0.00018119463,0.00024033774,0.00012866023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084512914,0.00019004876,0.00021785784,0.00040965813,0.00032593752,0.00027126583,0.00018619513,0.000085636646,0.0000032478904],"category_scores_gemma":[0.000058550206,0.00017338322,0.00004455384,0.000475429,0.000096940355,0.0016161294,0.00013155017,0.00016773056,0.000012194524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051368203,0.00009765177,0.0010629366,0.00025626886,0.000038415412,0.0000030362187,0.015061043,0.08932195,0.0011448476,0.57181764,0.00028054617,0.3208643],"study_design_scores_gemma":[0.00049107784,0.00029476342,0.012445742,0.000048869577,0.000007486338,0.000043784752,0.0005135298,0.97189647,0.0005349587,0.0130728325,0.00044610482,0.00020440032],"about_ca_topic_score_codex":0.00016658683,"about_ca_topic_score_gemma":0.000011626995,"teacher_disagreement_score":0.8825745,"about_ca_system_score_codex":0.000025084124,"about_ca_system_score_gemma":0.00006268688,"threshold_uncertainty_score":0.7070362},"labels":[],"label_agreement":null},{"id":"W2962915432","doi":"10.26421/qic16.9-10-1","title":"Near-linear constructions of exact unitary 2-designs","year":2016,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Canadian Institute for Advanced Research","funders":"","keywords":"Unitary state; Mathematics; Logarithm; Hash function; Qubit; Quadratic equation; Quantum; Quantum Fourier transform; Quantum circuit; Quantum gate; Discrete mathematics; Unitary matrix; Function (biology); Quantum mechanics; Quantum error correction; Computer science; Mathematical analysis; Physics","score_opus":0.015285160950586699,"score_gpt":0.24671118233561862,"score_spread":0.23142602138503193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962915432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27520853,0.000016267071,0.72350454,0.00069933356,0.00017580371,0.0000776905,0.000005997842,0.00010816622,0.00020368084],"genre_scores_gemma":[0.94198996,0.000014464538,0.057810247,0.00014309505,0.000022189019,0.0000025163886,0.000008166431,0.00000312101,0.0000062604026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991437,0.00005301469,0.00036622767,0.00011347722,0.0001873625,0.00013619965],"domain_scores_gemma":[0.99926454,0.00015642837,0.00020549909,0.00015103299,0.00015639504,0.000066099696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001953173,0.00010230136,0.00012346328,0.00014771376,0.00017623628,0.00007752745,0.0001694195,0.00004515863,0.0000064560622],"category_scores_gemma":[0.000037869722,0.00007264849,0.000036648747,0.0002793979,0.00010689155,0.0010747398,0.00007583437,0.00006349339,0.000025485379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011651987,0.000026003458,0.00040678887,0.000041052375,0.000019224237,9.0720874e-7,0.0017722675,0.012006711,0.00034614664,0.14998569,0.00028168588,0.83510184],"study_design_scores_gemma":[0.00047555604,0.00012913295,0.0040674377,0.00004706542,0.0000037058276,0.000048233225,0.000080631005,0.98150504,0.00032919477,0.011799247,0.0013922976,0.00012244111],"about_ca_topic_score_codex":0.00001881255,"about_ca_topic_score_gemma":5.5170415e-7,"teacher_disagreement_score":0.96949834,"about_ca_system_score_codex":0.000013440277,"about_ca_system_score_gemma":0.00007721358,"threshold_uncertainty_score":0.29625192},"labels":[],"label_agreement":null},{"id":"W2963218519","doi":"10.26421/qic10.3-4-1","title":"The quantum query complexity of certification","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quantum; Upper and lower bounds; Discrete mathematics; Certificate; Quantum algorithm; Tilde; Combinatorics; Physics; Algorithm; Quantum mechanics; Mathematical analysis","score_opus":0.019912356393657835,"score_gpt":0.255435706030646,"score_spread":0.23552334963698818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963218519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3592591,0.000030682644,0.6371926,0.0023305144,0.00064912264,0.00014757318,0.000002966375,0.00012314794,0.00026431732],"genre_scores_gemma":[0.9870293,0.000016036369,0.0127314385,0.00015102033,0.000038343864,0.0000063506604,0.000019783833,0.0000035004546,0.000004189458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887186,0.000060166614,0.0004908716,0.00013232487,0.00027429676,0.00017047954],"domain_scores_gemma":[0.99885947,0.00020412453,0.0003567438,0.00028414075,0.00023125252,0.000064298656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055331906,0.000115861825,0.00012004567,0.00011318163,0.00046432842,0.00030100832,0.00036942033,0.00006006962,0.0000016402903],"category_scores_gemma":[0.00008304284,0.000084136045,0.000045109045,0.0003012183,0.00021199624,0.0008071092,0.00010993332,0.00023132554,0.000018515933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000737332,0.000016775039,0.000082070634,0.000021904647,0.000006294151,1.235667e-7,0.0011461056,0.0012872319,0.00046348796,0.7388147,0.00021170093,0.25794223],"study_design_scores_gemma":[0.00017735339,0.000052710133,0.01423098,0.000008611536,0.0000024236892,0.00001841943,0.00009962513,0.91326636,0.00035959846,0.06814098,0.003542002,0.0001009194],"about_ca_topic_score_codex":0.00005055006,"about_ca_topic_score_gemma":0.00001128359,"teacher_disagreement_score":0.91197914,"about_ca_system_score_codex":0.000007913121,"about_ca_system_score_gemma":0.00005887908,"threshold_uncertainty_score":0.3571286},"labels":[],"label_agreement":null},{"id":"W2963313484","doi":"10.26421/qic10.7-8","title":"Limitations on the simulation of non-sparse Hamiltonians","year":2010,"lang":"en","type":"paratext","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Hamiltonian (control theory); Quantum; Running time; Arboricity; Mathematics; Combinatorics; Measure (data warehouse); Computer science; Discrete mathematics; Statistical physics; Applied mathematics; Physics; Algorithm; Quantum mechanics; Graph; Mathematical optimization","score_opus":0.028581936668601333,"score_gpt":0.26751429989691944,"score_spread":0.2389323632283181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963313484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015577763,0.000050322273,0.9715134,0.0015433856,0.0017820904,0.00051492313,0.0000406152,0.0000783125,0.008899176],"genre_scores_gemma":[0.9885313,0.00010195136,0.009186851,0.0012022988,0.00017756004,0.000029963083,0.0003214652,0.000018415061,0.0004302085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828494,0.0001006071,0.00069711154,0.00023997355,0.00045858548,0.00021877351],"domain_scores_gemma":[0.99746025,0.0009177582,0.00078597525,0.00041941795,0.00034492684,0.000071671835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003875109,0.0002908783,0.00029090844,0.0003964239,0.00038611077,0.00036586355,0.0005097204,0.00026190872,0.00002099756],"category_scores_gemma":[0.00010356634,0.00021453992,0.000104915474,0.0004697163,0.00009914787,0.00061536406,0.00013802883,0.0006461192,0.00057443435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008637964,0.000033316777,9.368453e-7,0.00007880116,0.000022976255,2.6638563e-7,0.0028463074,0.79823524,0.000019677896,0.01414288,0.010716187,0.1738948],"study_design_scores_gemma":[0.00023985765,0.00018178883,0.0003705275,0.000117536074,0.000009894403,0.0000051223806,0.00007492666,0.95998335,0.00006341765,0.0017438848,0.03698108,0.0002286191],"about_ca_topic_score_codex":0.00002391571,"about_ca_topic_score_gemma":0.0000033597616,"teacher_disagreement_score":0.9729535,"about_ca_system_score_codex":0.000022928534,"about_ca_system_score_gemma":0.00015370712,"threshold_uncertainty_score":0.8748684},"labels":[],"label_agreement":null},{"id":"W2963453098","doi":"10.26421/qic16.9-10-7","title":"Optimal bounds on functions of quantum states under quantum channels","year":2016,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Unitary state; Quantum channel; Quantum capacity; Quantum; Quantum relative entropy; Quantum operation; Amplitude damping channel; Quantum state; Quantum discord; Quantum information; Quantum mechanics; Physics; Quantum network; Quantum entanglement; Quantum dynamics","score_opus":0.02441186057763021,"score_gpt":0.2592676610873413,"score_spread":0.23485580050971108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963453098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15075044,0.00002877404,0.8465825,0.0013802638,0.00071516907,0.00014377864,0.000020952652,0.00015515312,0.00022299371],"genre_scores_gemma":[0.99638367,0.000052961197,0.0031143036,0.0003100124,0.000034650595,0.000014444766,0.000043112053,0.000005962942,0.00004089886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985982,0.00006387912,0.00053283054,0.00019785723,0.00036993352,0.00023727491],"domain_scores_gemma":[0.9988876,0.0002461778,0.00029673186,0.00023674667,0.0002370079,0.00009573683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003128705,0.00017423472,0.000188881,0.0003803611,0.00026000116,0.00021650651,0.00025457796,0.0000702005,0.000022970826],"category_scores_gemma":[0.000032748212,0.00013230814,0.00007203436,0.00041783415,0.00012813942,0.0020877416,0.00010252538,0.00009316325,0.00012364844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000415396,0.00008794906,0.000047590358,0.00005421605,0.00002725863,5.227718e-7,0.0012758448,0.020049475,0.000070017006,0.91891146,0.0012454994,0.05818865],"study_design_scores_gemma":[0.00069860055,0.00051801983,0.0020326125,0.00009510595,0.0000059274485,0.000012445154,0.00043535032,0.90520626,0.00023780322,0.08823558,0.0023188961,0.00020337121],"about_ca_topic_score_codex":0.000030534582,"about_ca_topic_score_gemma":0.0000010741971,"teacher_disagreement_score":0.8851568,"about_ca_system_score_codex":0.00003864515,"about_ca_system_score_gemma":0.00006314036,"threshold_uncertainty_score":0.5395369},"labels":[],"label_agreement":null},{"id":"W2963521327","doi":"10.5555/2230936.2230940","title":"Private quantum channels, conditional expectations, and trace vectors","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"TRACE (psycholinguistics); Quantum; Quantum operation; Qubit; Mathematics; Quantum mechanics; Physics; Open quantum system","score_opus":0.020294855639711628,"score_gpt":0.2345938230225276,"score_spread":0.21429896738281598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963521327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22780971,0.00011973546,0.7696951,0.00030919025,0.0003352515,0.00023638229,0.000008341293,0.0002839014,0.0012024076],"genre_scores_gemma":[0.98991126,0.000049571026,0.009326564,0.0005355757,0.000021934948,0.00003630912,0.00010880293,0.000005680052,0.0000043180617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986609,0.000055839573,0.00056745915,0.00018065269,0.00031157356,0.00022352663],"domain_scores_gemma":[0.999141,0.00005944058,0.00030900558,0.00015876234,0.00017703956,0.00015477846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023661068,0.0001910621,0.00015949442,0.0004669615,0.00034330884,0.00037053504,0.00019832076,0.00008400938,0.000025517993],"category_scores_gemma":[0.000030535342,0.00018706908,0.000048398637,0.00044896954,0.00009805455,0.0051162257,0.00007606516,0.00012505292,0.00010969043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014718874,0.00003111188,0.00023829592,0.000039520346,0.00001593745,7.347132e-7,0.014047036,0.000075107135,0.000010321747,0.9646096,0.0004889252,0.020428654],"study_design_scores_gemma":[0.00092098385,0.0002179337,0.028902596,0.000025135969,0.000010250946,0.00007438368,0.0030629486,0.8682406,0.00026331656,0.094345585,0.0035505919,0.00038567747],"about_ca_topic_score_codex":0.000017934211,"about_ca_topic_score_gemma":9.687703e-7,"teacher_disagreement_score":0.87026405,"about_ca_system_score_codex":0.000018902423,"about_ca_system_score_gemma":0.00004126819,"threshold_uncertainty_score":0.7628455},"labels":[],"label_agreement":null},{"id":"W2963652075","doi":"10.26421/qic12.11-12","title":"Hamiltonian Simulation Using Linear Combinations of Unitary Operations","year":2012,"lang":"en","type":"paratext","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unitary state; Hamiltonian (control theory); Unitary transformation; Computer science; Mathematics; Algorithm; Applied mathematics; Mathematical optimization; Quantum; Physics; Quantum mechanics","score_opus":0.024435515609420467,"score_gpt":0.2976477463470241,"score_spread":0.27321223073760365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963652075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025062816,0.00042212234,0.97117186,0.00021527182,0.001547016,0.0003930434,0.00007616771,0.00009795486,0.0010137813],"genre_scores_gemma":[0.9295903,0.00009092665,0.068547964,0.00032580472,0.00020170222,0.000010117946,0.0009968834,0.000021460286,0.00021488013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806523,0.00014598772,0.0008862954,0.00021775906,0.00041373508,0.00027101007],"domain_scores_gemma":[0.9983523,0.00017493154,0.00050535996,0.00030144668,0.0005445465,0.000121422105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033224418,0.00030357088,0.000363839,0.0006624944,0.0004282344,0.00023148833,0.00033854242,0.00024849497,0.000026088279],"category_scores_gemma":[0.00004112927,0.00030388782,0.00009195743,0.00062665174,0.00007624357,0.0019334356,0.00020422497,0.00034176954,0.0002018141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000310994,0.00006931357,0.000004690567,0.00013189377,0.000026795535,1.6982938e-7,0.0017985816,0.95894545,0.000010598308,0.008623841,0.00073376234,0.029651782],"study_design_scores_gemma":[0.0005211669,0.000090732734,0.00024339606,0.00013340627,0.000025440024,0.000015308866,0.00007088647,0.9877225,0.000025788226,0.0004712381,0.010364811,0.00031530808],"about_ca_topic_score_codex":0.00013473467,"about_ca_topic_score_gemma":0.00000306723,"teacher_disagreement_score":0.9045274,"about_ca_system_score_codex":0.00006180562,"about_ca_system_score_gemma":0.0002338665,"threshold_uncertainty_score":0.99994135},"labels":[],"label_agreement":null},{"id":"W2963865242","doi":"10.26421/qic16.11-12-7","title":"An adaptive attack on Wiesner's quantum money","year":2016,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Regional Development Fund; Army Research Office; Simons Institute for the Theory of Computing, University of California Berkeley; Agentúra na Podporu Výskumu a Vývoja; European Commission; Slovenská Akadémia Vied; National Science Foundation","keywords":"Scheme (mathematics); Computer science; Property (philosophy); Quantum; Qubit; Mathematics; Quantum mechanics; Physics; Philosophy; Epistemology","score_opus":0.024273245511227202,"score_gpt":0.2826784486564207,"score_spread":0.2584052031451935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963865242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40803623,0.0000040189843,0.5896678,0.00046164435,0.000099101075,0.00019077273,0.00005939894,0.00006827705,0.0014127756],"genre_scores_gemma":[0.99921125,0.000005930423,0.00026983072,0.00022505807,0.00008350629,0.000047566133,0.00013148424,0.000009052502,0.000016336113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991773,0.000033687178,0.00030733546,0.00014725204,0.00016973341,0.00016470236],"domain_scores_gemma":[0.99937016,0.000060637474,0.00018741205,0.00015384702,0.0001192686,0.00010866694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013248141,0.00014246878,0.000119692195,0.00010257259,0.0002054027,0.00010208719,0.000087784116,0.00003845621,0.00007918753],"category_scores_gemma":[0.000003835428,0.00010486623,0.000038361155,0.00012285891,0.000032438133,0.0010377399,0.00001817471,0.00006684133,0.00033354768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003047703,0.0000509593,0.00011384218,0.0000031000498,0.000011485623,5.4930293e-8,0.00024182275,0.00026014374,0.00016260357,0.9023986,0.0007031404,0.096023805],"study_design_scores_gemma":[0.0009846438,0.0005108334,0.0026707232,0.000045930778,0.000014432492,0.0000012474287,0.0011035191,0.6977299,0.00048540422,0.28830427,0.007837025,0.00031208753],"about_ca_topic_score_codex":0.000036367728,"about_ca_topic_score_gemma":8.615801e-7,"teacher_disagreement_score":0.6974697,"about_ca_system_score_codex":0.000020268542,"about_ca_system_score_gemma":0.000032406653,"threshold_uncertainty_score":0.4287192},"labels":[],"label_agreement":null},{"id":"W2963977150","doi":"10.5555/2685188.2685193","title":"Group theoretic, lie algebraic and Jordan algebraic formulations of the sic existence problem","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Mathematics; Equivalence (formal languages); Algebraic number; Dimension (graph theory); Connection (principal bundle); Pure mathematics; Lie algebra; Lie group; Operator (biology); Algebra over a field; Mathematical analysis","score_opus":0.015031548840787686,"score_gpt":0.24303782865481507,"score_spread":0.22800627981402738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963977150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7604625,0.00002884777,0.23650242,0.00039870042,0.00006206065,0.00036092635,0.000019954452,0.000022459184,0.002142124],"genre_scores_gemma":[0.9985085,0.0000048345064,0.0012316115,0.00009316131,0.000024345909,0.00003694897,0.0000871565,0.0000052568034,0.000008193734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992776,0.00003072276,0.00033602,0.00008790772,0.00016081883,0.00010695313],"domain_scores_gemma":[0.9993768,0.00004641345,0.00025423625,0.00011760886,0.00013528083,0.000069711015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020875758,0.00009874549,0.00010540351,0.000057065445,0.00017639842,0.00008154789,0.000084946216,0.000027660508,0.0000099646295],"category_scores_gemma":[0.000008224307,0.00007523738,0.00003400211,0.00019739933,0.00007027904,0.00051337894,0.000059023892,0.00007558982,0.000010072042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042649517,0.000020196365,0.00048072706,0.000018119097,0.000007629117,7.136492e-9,0.0011139269,0.000049555474,0.000029266663,0.98343664,0.0000911842,0.014748488],"study_design_scores_gemma":[0.00039593683,0.00005020249,0.002576289,0.000021199983,0.000016271992,0.0000017155223,0.0010327935,0.12447782,0.000119364246,0.87038976,0.0008287753,0.00008985071],"about_ca_topic_score_codex":0.000038360682,"about_ca_topic_score_gemma":0.000002289403,"teacher_disagreement_score":0.23804599,"about_ca_system_score_codex":0.000010020268,"about_ca_system_score_gemma":0.000044761007,"threshold_uncertainty_score":0.30680913},"labels":[],"label_agreement":null},{"id":"W2964107397","doi":"10.26421/qic19.1-2-5","title":"Quantum complementarity and operator structures","year":2019,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complementarity (molecular biology); Operator (biology); Mathematics; Multiplicative function; Quantum; Operator algebra; Pure mathematics; Dimension (graph theory); Ladder operator; Discrete mathematics; Compact operator; Computer science; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.010761143314956317,"score_gpt":0.24689007219100967,"score_spread":0.23612892887605336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964107397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6019793,0.000054889457,0.39529088,0.000567614,0.00034773137,0.00030940393,0.000008008448,0.00017638631,0.0012658086],"genre_scores_gemma":[0.99211013,0.000037883845,0.0057278783,0.0020185395,0.000012509934,0.000008170968,0.00007712794,0.000003571977,0.0000041754865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884564,0.0000444417,0.00046010004,0.0001600481,0.00029772823,0.00019207165],"domain_scores_gemma":[0.9993217,0.00004951523,0.00019603067,0.00018180648,0.00013835188,0.00011258458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002639173,0.00015934875,0.00016225144,0.0002675259,0.0002135334,0.00064525765,0.00019490841,0.000060742044,0.000043690805],"category_scores_gemma":[0.000011175662,0.00014510572,0.0000341797,0.0002965036,0.000045536697,0.0040830174,0.00013176518,0.00012140976,0.00012488382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009853533,0.000009388137,0.0020583936,0.00006436072,0.000011424674,1.7030776e-7,0.0021038079,0.00023910671,0.00003835913,0.9595868,0.000656592,0.03522177],"study_design_scores_gemma":[0.0009702951,0.00015744234,0.0441362,0.0000138340765,0.000004403103,0.000027428325,0.0009241059,0.9070262,0.00009144085,0.033456232,0.012939459,0.0002530095],"about_ca_topic_score_codex":0.000041530533,"about_ca_topic_score_gemma":0.0000026018133,"teacher_disagreement_score":0.92613053,"about_ca_system_score_codex":0.00001822086,"about_ca_system_score_gemma":0.0000389357,"threshold_uncertainty_score":0.62222344},"labels":[],"label_agreement":null},{"id":"W2964113733","doi":"10.26421/qic18.1-2-6","title":"Magic state distillation at intermediate size","year":2018,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut quantique; Université de Sherbrooke","funders":"","keywords":"MAGIC (telescope); Qubit; BCH code; Computer science; Error detection and correction; State (computer science); Algorithm; Mathematics; Discrete mathematics; Quantum; Quantum mechanics; Physics","score_opus":0.00670973982452309,"score_gpt":0.23382863752900815,"score_spread":0.22711889770448507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964113733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48577213,0.00001340878,0.5127176,0.00036297122,0.00039431767,0.000092892995,0.0000033593774,0.00017784399,0.00046548134],"genre_scores_gemma":[0.989143,0.000010625181,0.010023823,0.0006614318,0.000086734275,0.0000027573537,0.000025873831,0.0000048125585,0.000040909996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897003,0.00004964636,0.00036293303,0.00017548722,0.00023765372,0.00020427669],"domain_scores_gemma":[0.9992385,0.00011818106,0.00022156909,0.00015854574,0.00017065823,0.00009254979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022685243,0.0001388025,0.00011662023,0.00012846928,0.0002869004,0.00030994302,0.00018791854,0.000040178187,0.000015263613],"category_scores_gemma":[0.000052697404,0.00012345664,0.000031887514,0.00027921546,0.00008545871,0.0011078926,0.00020741345,0.00008705699,0.0002706372],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035907364,0.000020441646,0.00058781606,0.00004959173,0.000015360432,0.0000019637428,0.009927111,0.0048008435,0.00008591724,0.017974956,0.0013638876,0.96513623],"study_design_scores_gemma":[0.00035528844,0.00016326176,0.032829206,0.000018124076,0.0000023126945,0.0000288065,0.00003028968,0.9490429,0.0001238411,0.013111889,0.004135928,0.00015814154],"about_ca_topic_score_codex":0.000014032083,"about_ca_topic_score_gemma":0.0000049587766,"teacher_disagreement_score":0.96497804,"about_ca_system_score_codex":0.000043109183,"about_ca_system_score_gemma":0.000029136243,"threshold_uncertainty_score":0.5034416},"labels":[],"label_agreement":null},{"id":"W2979026126","doi":"10.26421/qic20.5-6-1","title":"Two-outcome synchronous correlation sets and Connes' embedding problem","year":2020,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Outcome (game theory); Embedding; Correlation; Class (philosophy); Mathematics; Pure mathematics; Computer science; Artificial intelligence; Mathematical economics","score_opus":0.019330229227055525,"score_gpt":0.2955595119108234,"score_spread":0.2762292826837679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979026126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18099838,0.000049266506,0.8157324,0.000564577,0.00023270115,0.0007461238,0.000121874036,0.00011383124,0.0014408035],"genre_scores_gemma":[0.9941251,0.00001434163,0.0035492983,0.00019672711,0.000099577286,0.00010751494,0.0018870301,0.000015976982,0.0000043943596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986467,0.000041872267,0.0006937438,0.00026026223,0.0001857445,0.00017170944],"domain_scores_gemma":[0.9989358,0.000067257046,0.000599031,0.00013160512,0.0001376302,0.00012867466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019374843,0.00026297272,0.00029349563,0.00012519071,0.00025937738,0.00039175345,0.000091280825,0.00010317587,0.000033052205],"category_scores_gemma":[0.0000073886686,0.0002770567,0.000060825325,0.000116177674,0.000033058124,0.00050203264,0.00021856448,0.00038014314,0.00006202198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147137425,0.000030652343,0.0015022648,0.0002999868,0.00005658268,2.5913175e-7,0.0024972917,0.014167637,0.000020257328,0.8969927,0.0002687214,0.08414892],"study_design_scores_gemma":[0.0004349594,0.000029103638,0.00062237907,0.00005385448,0.00003999694,0.0000022768543,0.0007483592,0.72728866,0.0000076005695,0.27011007,0.0004347373,0.00022802083],"about_ca_topic_score_codex":0.00012075179,"about_ca_topic_score_gemma":0.0000016279295,"teacher_disagreement_score":0.81312674,"about_ca_system_score_codex":0.00003205675,"about_ca_system_score_gemma":0.00007982945,"threshold_uncertainty_score":0.9999682},"labels":[],"label_agreement":null},{"id":"W2980995059","doi":"10.26421/qic21.5-6-1","title":"Pretty good state transfer of multiple qubit states on paths","year":2021,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); Qubit; Transfer (computing); Eigenvalues and eigenvectors; Physics; Topology (electrical circuits); Computer science; Mathematics; Quantum mechanics; Algorithm; Quantum; Combinatorics","score_opus":0.010342917048554728,"score_gpt":0.23149070409132935,"score_spread":0.22114778704277463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980995059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4254103,0.00008407915,0.57334524,0.00023887894,0.00040771172,0.00025743953,0.000044552413,0.00012735187,0.00008446082],"genre_scores_gemma":[0.9836817,0.00011458675,0.015381274,0.0003407089,0.00002934817,0.000018496827,0.00041704933,0.000011178085,0.0000056974427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979344,0.00015532163,0.00081322016,0.00035516874,0.00049449503,0.00024740378],"domain_scores_gemma":[0.9986363,0.00022502591,0.0003433923,0.00036969018,0.0003226406,0.00010295693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037649876,0.0003151246,0.0003943094,0.00029255587,0.00013837888,0.00049615133,0.0003823225,0.00015701888,0.0000026150512],"category_scores_gemma":[0.00003646454,0.00029407273,0.00012988223,0.00025998792,0.000051272404,0.000632053,0.0003426439,0.00048563883,0.000007152901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032017117,0.00009900909,0.0001235711,0.0005990812,0.000058443024,0.0000039019333,0.015840255,0.6317551,0.000038288814,0.0068061478,0.00008155378,0.34456262],"study_design_scores_gemma":[0.0005893542,0.00021667301,0.003886872,0.00030013206,0.000009748626,0.000009305589,0.00019827885,0.9864187,0.00063068065,0.0070901155,0.00033714308,0.0003129869],"about_ca_topic_score_codex":0.000099193785,"about_ca_topic_score_gemma":0.0000070988954,"teacher_disagreement_score":0.55827135,"about_ca_system_score_codex":0.000034416928,"about_ca_system_score_gemma":0.00017323374,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W3022853917","doi":"10.26421/qic20.3-4-3","title":"A local model of quantum Turing machines","year":2020,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Turing machine; Universal Turing machine; Super-recursive algorithm; Turing machine examples; Computer science; NSPACE; Quantum Turing machine; Time hierarchy theorem; Theoretical computer science; Description number; Tensor product; Non-deterministic Turing machine; Quantum computer; Locality; Turing; Computation; Quantum; Algorithm; Mathematics; Quantum network; Pure mathematics; Physics; Quantum mechanics","score_opus":0.015649194445625188,"score_gpt":0.23368452211394825,"score_spread":0.21803532766832306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022853917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15210952,0.00003965219,0.8459414,0.0014495829,0.000086108244,0.00009259021,0.0000041651074,0.00016020513,0.00011676423],"genre_scores_gemma":[0.96003914,0.000008601946,0.03901104,0.0008964292,0.000024245413,0.0000024013639,0.000012913742,0.000004271123,9.657648e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899524,0.000032260734,0.0004287014,0.00015063505,0.00024543755,0.00014770338],"domain_scores_gemma":[0.99941206,0.00004953147,0.00022119905,0.000107303,0.00010313459,0.00010674362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014407422,0.00013014354,0.00017121743,0.00012088352,0.000112448084,0.00011755424,0.00023839348,0.000046330286,0.000001244114],"category_scores_gemma":[0.000028161912,0.00011658839,0.000048045902,0.00030471454,0.00004530419,0.00090321223,0.00015133042,0.00012842129,0.000011776976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009220618,0.000011189163,0.000032201202,0.000096354685,0.0000073081223,4.6681993e-7,0.0059609604,0.6938405,0.00010283168,0.077562295,0.00011400776,0.22226268],"study_design_scores_gemma":[0.0003375452,0.00010309303,0.00044294537,0.000021888476,0.0000027779254,0.00000852487,0.00012568846,0.9879433,0.00018350544,0.010544169,0.0001516708,0.0001349156],"about_ca_topic_score_codex":0.000015920754,"about_ca_topic_score_gemma":2.3032109e-7,"teacher_disagreement_score":0.80792964,"about_ca_system_score_codex":0.000008939536,"about_ca_system_score_gemma":0.0000497009,"threshold_uncertainty_score":0.47543365},"labels":[],"label_agreement":null},{"id":"W3033588625","doi":"10.26421/qic22.5-6-1","title":"Can't touch this: unconditional tamper evidence from short keys","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Key (lock); Mathematical proof; Scheme (mathematics); Tamper resistance; Computer security; Theoretical computer science; Relation (database); Data mining; Mathematics","score_opus":0.0229207311963068,"score_gpt":0.2573023808995022,"score_spread":0.2343816497031954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033588625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15176612,0.000073349416,0.8438102,0.0028518997,0.0005393787,0.0002476443,0.00007204893,0.00023511556,0.00040424796],"genre_scores_gemma":[0.9893173,0.000012860785,0.007961728,0.0018490421,0.000048447484,0.000069347734,0.00071356934,0.0000048181405,0.000022896951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844927,0.000114343,0.00040465794,0.0002106369,0.0006560142,0.00016510366],"domain_scores_gemma":[0.99922425,0.0001871919,0.00016376523,0.00017771212,0.00016481981,0.00008227097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032466886,0.00013325855,0.00011809031,0.00021182092,0.0004589076,0.0003096783,0.00030333787,0.000034396326,0.00023826235],"category_scores_gemma":[0.000050347513,0.00014462863,0.00004386712,0.00039883552,0.000033628487,0.0033594857,0.00022084927,0.0001960455,0.00009003753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001973263,0.00023970788,0.002835192,0.00011466561,0.000101685364,0.000024502,0.0289147,0.25176835,0.0032921506,0.25595185,0.055650514,0.40090936],"study_design_scores_gemma":[0.00032803108,0.0001427591,0.009438306,0.000023643104,0.0000075354797,0.000026554728,0.00035771285,0.9704951,0.00028172953,0.01604932,0.0026342182,0.0002151013],"about_ca_topic_score_codex":0.00033271962,"about_ca_topic_score_gemma":0.000008652665,"teacher_disagreement_score":0.8375512,"about_ca_system_score_codex":0.00018782103,"about_ca_system_score_gemma":0.00017563348,"threshold_uncertainty_score":0.5897785},"labels":[],"label_agreement":null},{"id":"W3108643865","doi":"10.26421/qic20.13-14-4","title":"Analysis of lackadaisical quantum walks","year":2020,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum walk; Mathematics; Vertex (graph theory); Random walk; Torus; Discrete mathematics; Quantum; Regular graph; Combinatorics; Quantum algorithm; Quadratic growth; Graph; Line graph; Quantum mechanics; Voltage graph; Physics; Mathematical analysis; Statistics","score_opus":0.013670073262340852,"score_gpt":0.24632133007508691,"score_spread":0.23265125681274607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108643865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27404252,0.000029261506,0.7236672,0.0018372085,0.00007869892,0.00007169282,0.0000058341816,0.0001247378,0.00014280256],"genre_scores_gemma":[0.9898315,0.000009262933,0.008945186,0.001137741,0.000025313244,0.0000019311547,0.00004524625,0.0000029821779,8.160145e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884135,0.000054543118,0.0004829171,0.00017070418,0.00030176883,0.00014872706],"domain_scores_gemma":[0.999246,0.00010510052,0.00025935448,0.00013621633,0.0001270495,0.00012627384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018165093,0.00012289073,0.0002630182,0.00029492722,0.00010014301,0.00014828904,0.00025362012,0.00005280233,0.0000055951987],"category_scores_gemma":[0.000053070788,0.00011057682,0.00009988243,0.0013653392,0.000041126626,0.00074846495,0.00012977395,0.00012150862,0.000017323635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034915618,0.00005410082,0.0011835084,0.000121956655,0.0003217325,0.000002726068,0.016838387,0.2846505,0.00012892784,0.30582672,0.00052078255,0.39031574],"study_design_scores_gemma":[0.00025420426,0.00014224519,0.01149173,0.000007438004,0.000050136874,0.0000029306973,0.00012797072,0.9851554,0.000047354784,0.001733127,0.0008592817,0.00012816691],"about_ca_topic_score_codex":0.000018295594,"about_ca_topic_score_gemma":7.036067e-7,"teacher_disagreement_score":0.715789,"about_ca_system_score_codex":0.000008551925,"about_ca_system_score_gemma":0.000038183272,"threshold_uncertainty_score":0.45091918},"labels":[],"label_agreement":null},{"id":"W3159233598","doi":"10.26421/qic22.9-10-3","title":"Deterministic algorithms for the hidden subgroup problem","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Mathematics; Combinatorics; Abelian group; Deterministic algorithm; Time complexity; Algorithm; Discrete mathematics","score_opus":0.03099737201496289,"score_gpt":0.27165005824911126,"score_spread":0.24065268623414837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159233598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002348935,0.000076909004,0.99502546,0.0012776108,0.00046734692,0.0004619009,0.000016965772,0.00012547015,0.00019941127],"genre_scores_gemma":[0.9262315,0.000014474518,0.07217107,0.0010637362,0.000046184912,0.00035425182,0.000081786995,0.000005373509,0.00003162861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914443,0.00004575841,0.00028283725,0.000118898475,0.00025700912,0.0001510539],"domain_scores_gemma":[0.9993052,0.00027465937,0.00015737585,0.00014661819,0.00007955627,0.00003658213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044123855,0.00008864324,0.00008183912,0.00011340756,0.0010519347,0.00031865746,0.00037189745,0.00001705498,0.000008312212],"category_scores_gemma":[0.000016266538,0.000073736286,0.00004596428,0.00030208167,0.000038398393,0.00084748096,0.00022433432,0.0001069811,0.0000071147183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009327497,0.000017810218,0.000013996571,0.00003524363,0.000009559095,3.6032034e-7,0.0022965053,0.0031879626,0.0000019975087,0.35902864,0.00080217357,0.6345964],"study_design_scores_gemma":[0.0003500506,0.00016883151,0.00073535135,0.0000036975903,0.000005488883,0.000035902984,0.0004533858,0.903275,0.0000044180124,0.07663542,0.018230414,0.00010203956],"about_ca_topic_score_codex":0.000019046074,"about_ca_topic_score_gemma":0.0000010889992,"teacher_disagreement_score":0.92388254,"about_ca_system_score_codex":0.000029235225,"about_ca_system_score_gemma":0.000045588764,"threshold_uncertainty_score":0.80907375},"labels":[],"label_agreement":null},{"id":"W3200681169","doi":"10.26421/qic22.11-12-2","title":"Synchronous games with *-isomorphic game algebras","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isomorphism (crystallography); Mathematics; Combinatorial game theory; Bondareva–Shapley theorem; Zero (linguistics); Symmetric game; Quantum; Sequential game; Algebra over a field; Discrete mathematics; Game theory; Normal-form game; Pure mathematics; Mathematical economics; Physics","score_opus":0.007203744023193656,"score_gpt":0.2202583679708267,"score_spread":0.21305462394763305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200681169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5933709,0.000020919126,0.40464872,0.00047225293,0.000065745306,0.00024785602,0.00008079051,0.000060199956,0.0010325788],"genre_scores_gemma":[0.9987317,0.0000020503296,0.00021235239,0.00021996882,0.000024818604,0.00014671586,0.00064512785,0.000005336815,0.000011965762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993609,0.000025523184,0.00021444788,0.00009711423,0.00017893399,0.00012305618],"domain_scores_gemma":[0.9996203,0.000024304705,0.00016287771,0.00008655474,0.000055763263,0.000050157603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106397696,0.00009542487,0.00009359859,0.000085221756,0.00034089465,0.000094273615,0.00006783519,0.000010749586,0.000295933],"category_scores_gemma":[9.408274e-7,0.00009034131,0.000023647917,0.0001946394,0.000021624288,0.00036715594,0.00004713908,0.000114876784,0.000054438002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022429538,0.00006705883,0.00080601714,0.000013194078,0.000027055305,2.74778e-7,0.0011390147,0.0032198331,0.000023478146,0.9378922,0.0014385219,0.055350926],"study_design_scores_gemma":[0.0012178025,0.0003515627,0.002816981,0.000009557785,0.00003188742,0.000021389487,0.0050302595,0.77303845,0.00007775176,0.16619974,0.050848737,0.00035586787],"about_ca_topic_score_codex":0.000049325852,"about_ca_topic_score_gemma":5.329124e-7,"teacher_disagreement_score":0.77169245,"about_ca_system_score_codex":0.000020399095,"about_ca_system_score_gemma":0.00005266176,"threshold_uncertainty_score":0.36840117},"labels":[],"label_agreement":null},{"id":"W370617426","doi":"10.26421/qic16.5-6-3","title":"Multiparty quantum signature schemes","year":2016,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Theoretical computer science; Construct (python library); Commitment scheme; Computer security; Digital signature; Quantum key distribution; Quantum cryptography; Cryptography; Cryptographic protocol; Quantum; Quantum information; Computer network; Hash function; Quantum mechanics; Physics","score_opus":0.013822551793538695,"score_gpt":0.26834525977506274,"score_spread":0.25452270798152404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W370617426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14191255,0.000099421355,0.85364103,0.00088124356,0.00056126475,0.000613127,0.0003713204,0.00015639559,0.0017636315],"genre_scores_gemma":[0.99739414,0.000023828194,0.0005866506,0.0001703029,0.00022606061,0.00014522769,0.0014032923,0.000018057215,0.00003243132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986321,0.00003955497,0.00058186776,0.0002616283,0.0002503189,0.00023456858],"domain_scores_gemma":[0.9987777,0.00006701327,0.0005388567,0.00025165282,0.0002475531,0.00011726071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018694546,0.0003030149,0.0002752321,0.00016377412,0.00023499435,0.00028357073,0.00018213686,0.00019061887,0.00011206795],"category_scores_gemma":[0.000008998939,0.00025436725,0.00009636497,0.00010827199,0.00004305704,0.0005462165,0.000246233,0.00039512204,0.0001762556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010829571,0.000039390052,0.00013862191,0.00007581564,0.00004609014,9.701761e-8,0.00028263158,0.00020119526,0.00010114608,0.95317787,0.0024555419,0.04347078],"study_design_scores_gemma":[0.00045000468,0.000029216772,0.0003900539,0.00010699572,0.000028504694,7.51269e-7,0.00024282618,0.4079701,0.00018547765,0.57149774,0.018757753,0.0003405872],"about_ca_topic_score_codex":0.000036987036,"about_ca_topic_score_gemma":4.658018e-7,"teacher_disagreement_score":0.8554816,"about_ca_system_score_codex":0.000028738255,"about_ca_system_score_gemma":0.000116895404,"threshold_uncertainty_score":0.9999909},"labels":[],"label_agreement":null},{"id":"W4213010388","doi":"10.26421/qic15.9-10-7","title":"Tensor network non-zero testing","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum many-body systems","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Government of Canada; John Templeton Foundation","keywords":"Injective function; Tensor (intrinsic definition); Zero (linguistics); Mathematics; Hierarchy; Polynomial; Logarithm; Combinatorics; Simple (philosophy); Polynomial hierarchy; Discrete mathematics; Time complexity; Pure mathematics; Mathematical analysis","score_opus":0.02915506067226588,"score_gpt":0.2572588402671209,"score_spread":0.22810377959485506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213010388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50642437,0.000014069173,0.476644,0.00008519883,0.00040342126,0.00023584785,0.000005452174,0.000084871295,0.016102757],"genre_scores_gemma":[0.99750495,1.9097388e-7,0.0019738693,0.000117057716,0.0002345987,0.00001593373,0.000113925875,0.0000066767234,0.000032790726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917907,0.000029881618,0.00036107842,0.00008275669,0.0001743433,0.00017287393],"domain_scores_gemma":[0.9992987,0.000059396356,0.00023227699,0.00007830483,0.00022627505,0.000105083025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002992391,0.000110614696,0.00012857666,0.00006422989,0.0001304614,0.00017603682,0.000055399094,0.000029001998,0.000007844441],"category_scores_gemma":[0.000019429437,0.00010470357,0.000022814824,0.0002211853,0.0000218568,0.0008809364,0.000030311896,0.00007801701,0.00023905601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065655804,0.00007555309,0.15653726,0.00012991573,0.00008456049,0.0000011709745,0.008018419,0.19314733,0.000034508666,0.34464455,0.043070413,0.25419068],"study_design_scores_gemma":[0.0005777578,0.00006929137,0.009037027,0.000031415544,0.000008234361,0.000003265483,0.0009306097,0.96712214,0.000008175966,0.01786093,0.004206206,0.00014493932],"about_ca_topic_score_codex":0.00015838316,"about_ca_topic_score_gemma":4.517147e-7,"teacher_disagreement_score":0.77397484,"about_ca_system_score_codex":0.00001822947,"about_ca_system_score_gemma":0.000058294692,"threshold_uncertainty_score":0.42696875},"labels":[],"label_agreement":null},{"id":"W4235140742","doi":"10.26421/qic14.5-6-8","title":"Hardness of approximation for quantum problems","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Wolfson Family Charitable Trust; University of Waterloo; Agence Nationale de la Recherche","keywords":"Hierarchy; Mathematics; Hardness of approximation; Polynomial hierarchy; Quantum; Hamiltonian (control theory); Generalization; Quantum complexity theory; Set cover problem; Quantum algorithm; Polynomial; Discrete mathematics; Approximation algorithm; Combinatorics; Time complexity; Set (abstract data type); Quantum mechanics; Computer science; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.011720818417310859,"score_gpt":0.23610893182818946,"score_spread":0.2243881134108786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235140742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05754204,0.000019147414,0.9409035,0.0004085313,0.00035082558,0.00034219486,0.0000042338916,0.00014410283,0.0002854515],"genre_scores_gemma":[0.93605655,0.000004526088,0.06365862,0.00015362796,0.000037964208,0.000025597985,0.000053574102,0.0000050806957,0.00000443444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989279,0.000052412473,0.0004847162,0.00015304594,0.00021655892,0.00016537645],"domain_scores_gemma":[0.9990364,0.00013443644,0.00036537362,0.0001595928,0.00024792965,0.000056324887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055218115,0.00012613421,0.00018511519,0.00019743817,0.00016360344,0.00016689372,0.00021210476,0.000058965816,5.8552513e-7],"category_scores_gemma":[0.000077242985,0.0001135923,0.000051961593,0.00025005112,0.00003658257,0.0010063101,0.00006392682,0.00006983817,0.0000059870204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011177952,0.000032472115,0.000048979484,0.00035313165,0.0000105377685,1.7104309e-8,0.0026901604,0.051799282,0.00011882908,0.55900496,0.00026728198,0.38566318],"study_design_scores_gemma":[0.0005592615,0.00021269632,0.0011970429,0.00004351869,0.0000044300846,0.0000071795653,0.00005338909,0.9361616,0.00021414003,0.05844665,0.002965046,0.00013507003],"about_ca_topic_score_codex":0.000012274304,"about_ca_topic_score_gemma":7.386576e-7,"teacher_disagreement_score":0.8843623,"about_ca_system_score_codex":0.000011322981,"about_ca_system_score_gemma":0.000031521624,"threshold_uncertainty_score":0.46321595},"labels":[],"label_agreement":null},{"id":"W4236541507","doi":"10.26421/qic14.5-6-2","title":"Two-message quantum interactive proofs and the quantum separability problem","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dello Sviluppo Economico; Fonds Québécois de la Recherche sur la Nature et les Technologies; Office of Naval Research; Industry Canada; Canada Research Chairs; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research","keywords":"Quantum computer; Quantum algorithm; Quantum complexity theory; Quantum information; Quantum circuit; Computer science; Quantum state; Discrete mathematics; Mathematics; Quantum network; Quantum; Quantum mechanics; Physics","score_opus":0.006194614309295666,"score_gpt":0.24351159771244923,"score_spread":0.23731698340315358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236541507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20115261,0.000080200036,0.7933575,0.0031483693,0.00032470239,0.0005618407,0.000003228849,0.00026431642,0.0011072685],"genre_scores_gemma":[0.9888385,0.0000151278045,0.010094871,0.00091006263,0.00006705224,0.00003763616,0.000020883923,0.00000829641,0.0000075551843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793965,0.00040514185,0.0006377674,0.0003389129,0.00036792934,0.00031062792],"domain_scores_gemma":[0.99828386,0.00063161657,0.0004272909,0.00032410398,0.0002124975,0.0001206409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015322273,0.00026590648,0.00031022675,0.00017053731,0.00055327144,0.0007849419,0.00037171523,0.00007168389,0.0000023389719],"category_scores_gemma":[0.0001433258,0.00018219589,0.000072342795,0.00036202167,0.00024588982,0.0017245985,0.00030552215,0.00034669403,0.000025908195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007837852,0.000036195943,0.00010791606,0.000094388044,0.00002300513,5.2853954e-7,0.008272541,0.0102038635,0.000010428079,0.7377074,0.00016487764,0.24330051],"study_design_scores_gemma":[0.0016535498,0.00015208068,0.002594048,0.00004603252,0.0000093225735,0.000053172633,0.00024372106,0.8337543,0.000020702078,0.15974969,0.0015123975,0.00021099606],"about_ca_topic_score_codex":0.000103869526,"about_ca_topic_score_gemma":0.000005610537,"teacher_disagreement_score":0.8235504,"about_ca_system_score_codex":0.000030622527,"about_ca_system_score_gemma":0.0000555266,"threshold_uncertainty_score":0.7569213},"labels":[],"label_agreement":null},{"id":"W4243386666","doi":"10.26421/qic14.11-12-1","title":"The computational power of matchgates and the XY interaction on arbitrary graphs","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Qubit; Universal set; Quantum computer; Mathematics; Computation; Path (computing); Quantum; Discrete mathematics; Graph; Set (abstract data type); Combinatorics; Topology (electrical circuits); Computer science; Quantum mechanics; Algorithm; Physics","score_opus":0.004914132702145928,"score_gpt":0.22189516212647112,"score_spread":0.21698102942432518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243386666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33464995,0.000063638916,0.66016954,0.0037951567,0.0003679314,0.00018891823,0.000001603807,0.00007145897,0.0006917959],"genre_scores_gemma":[0.99514276,0.000022553173,0.0039501,0.00084564625,0.000017784962,0.0000060291045,0.0000095986,0.000003090406,0.00000246333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989999,0.00014809893,0.00036884687,0.00011318753,0.00025372772,0.00011622934],"domain_scores_gemma":[0.9984407,0.0009874516,0.00028399887,0.00013762944,0.00011301077,0.00003722276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618447,0.00011176979,0.00012221509,0.00010697342,0.0004385825,0.00031902234,0.0001922839,0.00003300902,7.363314e-7],"category_scores_gemma":[0.000062612744,0.00006348261,0.000042174743,0.00019376821,0.00017214198,0.00051875354,0.00008167089,0.00015263032,0.0000069026187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004545431,0.00001013219,0.000025271778,0.000014466909,0.0000122687115,6.5981105e-8,0.0026548917,0.052459292,0.0000014333442,0.80065644,0.00014678683,0.14397347],"study_design_scores_gemma":[0.0005592205,0.00010830074,0.0033565972,0.00002297479,0.0000028140416,0.00001734622,0.00018237894,0.79422015,0.000015777727,0.2005832,0.0008666275,0.00006461955],"about_ca_topic_score_codex":0.00001780799,"about_ca_topic_score_gemma":8.0773094e-7,"teacher_disagreement_score":0.74176085,"about_ca_system_score_codex":0.0000066256916,"about_ca_system_score_gemma":0.00001777979,"threshold_uncertainty_score":0.33732662},"labels":[],"label_agreement":null},{"id":"W4252581935","doi":"10.26421/qic11.1-2-3","title":"Characterization of universal two-qubit Hamiltonians","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Qubit; Hamiltonian (control theory); Unitary state; Mathematics; Quantum mechanics; Universality (dynamical systems); Unitary matrix; Eigenvalues and eigenvectors; Mathematical physics; Physics; Quantum; Law","score_opus":0.015123606845800252,"score_gpt":0.21683550593123993,"score_spread":0.20171189908543968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252581935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27333423,0.000003921223,0.7212647,0.000065375534,0.00015389721,0.00012528985,0.0000049412984,0.00012156665,0.0049260645],"genre_scores_gemma":[0.99157596,0.0000241933,0.00796025,0.00034701833,0.0000076191327,0.000005352259,0.00007160723,0.0000029500604,0.0000050673934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990708,0.000034750443,0.00046352023,0.00009096181,0.00021164095,0.00012828517],"domain_scores_gemma":[0.99919105,0.00001613957,0.00035888844,0.00015024403,0.00021579493,0.00006787909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018575981,0.00010836725,0.00012143656,0.00037555778,0.00010406261,0.000083557956,0.00020119872,0.000047423953,0.000021167663],"category_scores_gemma":[0.000008492533,0.000107593405,0.000043498945,0.00046696377,0.000053671854,0.004276033,0.000057170408,0.000063932814,0.000051415438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022620829,0.00003529125,0.0005199436,0.0000461098,0.000013938567,3.8574126e-7,0.012806393,0.00007574179,0.0009772587,0.91545457,0.00004269188,0.07000504],"study_design_scores_gemma":[0.0011637285,0.00021961499,0.049989298,0.000030563446,0.000010193544,0.000020911404,0.00068897125,0.92957395,0.004868996,0.010983211,0.0021797437,0.000270821],"about_ca_topic_score_codex":0.000033334174,"about_ca_topic_score_gemma":0.0000013703267,"teacher_disagreement_score":0.9294982,"about_ca_system_score_codex":0.00001376151,"about_ca_system_score_gemma":0.000043389296,"threshold_uncertainty_score":0.4387532},"labels":[],"label_agreement":null},{"id":"W4254506466","doi":"10.26421/qic12.1-2-4","title":"Black-box Hamiltonian simulation and unitary implementation","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unitary matrix; Unitary state; Hamiltonian (control theory); Black box; Scaling; Bounded function; Mathematics; Matrix (chemical analysis); Quantum; Discrete mathematics; Combinatorics; Algorithm; Computer science; Physics; Quantum mechanics; Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.014309334949249205,"score_gpt":0.28782148575831357,"score_spread":0.2735121508090644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254506466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4257982,0.000063131374,0.5732594,0.0003578197,0.00016147444,0.00012858245,0.000002355859,0.000118074364,0.00011093471],"genre_scores_gemma":[0.98268604,0.000015503581,0.016586848,0.0005687055,0.00006812784,0.0000041184835,0.00006299013,0.000004690788,0.000002976688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990466,0.000063832464,0.00032884203,0.00012042972,0.00020778467,0.00023250422],"domain_scores_gemma":[0.9994106,0.00009927074,0.00016783703,0.00011157938,0.000087058,0.00012364503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033814795,0.00013437287,0.00010589283,0.00020292556,0.00025434417,0.00025576566,0.00009608134,0.00005019079,0.0000039747906],"category_scores_gemma":[0.000015237783,0.00012759812,0.00002148603,0.00024956372,0.000040515566,0.002777072,0.000102466016,0.00009955458,0.000023831773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007509792,0.000026063286,0.0024890099,0.00005957601,0.000014988756,3.5728206e-7,0.015001685,0.08816031,0.000026568738,0.06801148,0.00018195952,0.8260205],"study_design_scores_gemma":[0.00037785355,0.00006751414,0.055507295,0.000010634657,0.00000535353,0.000015747843,0.00051182596,0.9381572,0.000032751803,0.00300089,0.0021568395,0.00015610881],"about_ca_topic_score_codex":0.000032530977,"about_ca_topic_score_gemma":0.0000018977182,"teacher_disagreement_score":0.84999686,"about_ca_system_score_codex":0.000022108114,"about_ca_system_score_gemma":0.000023131914,"threshold_uncertainty_score":0.52033},"labels":[],"label_agreement":null},{"id":"W4255257784","doi":"10.26421/qic10.7-8-7","title":"Limitations on the simulation of non-sparse Hamiltonians","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Hamiltonian (control theory); Norm (philosophy); Quantum; Mathematics; Running time; Discrete mathematics; Combinatorics; Computer science; Applied mathematics; Statistical physics; Physics; Quantum mechanics; Algorithm; Mathematical optimization","score_opus":0.024162931550990904,"score_gpt":0.2546455599317617,"score_spread":0.23048262838077077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255257784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37795496,0.0000025115028,0.6197376,0.0012188345,0.00025060165,0.0001366488,0.0000021435699,0.000059156962,0.0006375388],"genre_scores_gemma":[0.98824704,0.0000038030691,0.011120164,0.00057134527,0.0000311769,0.00000656918,0.000011936298,0.0000034166737,0.0000045632883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917614,0.000037323083,0.00032503912,0.00010792338,0.00023435704,0.000119235614],"domain_scores_gemma":[0.9988247,0.00052238815,0.0002280878,0.0002136064,0.00016716449,0.00004402311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031106148,0.000103833605,0.000095183284,0.0001598144,0.000252667,0.00016398067,0.0002276631,0.000052241627,0.0000026005537],"category_scores_gemma":[0.000109836816,0.000074507065,0.00003896161,0.0003200062,0.000057829275,0.0005960241,0.000055576817,0.0002088962,0.000028480777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005837034,0.00002860945,0.00003950903,0.000013628838,0.0000072026783,1.9785956e-7,0.0037460576,0.55668634,0.0002290591,0.16388662,0.00014409833,0.27521282],"study_design_scores_gemma":[0.00018962554,0.000103667946,0.009158424,0.000014511583,0.000002747711,0.000004373441,0.000094089766,0.98147076,0.00018237518,0.0073551135,0.0013353282,0.000088988934],"about_ca_topic_score_codex":0.0000100308725,"about_ca_topic_score_gemma":0.0000035012097,"teacher_disagreement_score":0.6102921,"about_ca_system_score_codex":0.0000057895018,"about_ca_system_score_gemma":0.000039836254,"threshold_uncertainty_score":0.30383098},"labels":[],"label_agreement":null},{"id":"W4297108347","doi":"10.26421/qic22.11-12-3","title":"Automated discovery of logical gates for quantum error correction (with Supplementary (153 pages))","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Engineering and Physical Sciences Research Council; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; University College London; Government of Canada; Ministero dello Sviluppo Economico","keywords":"Computer science; Quantum error correction; Quantum computer; Algorithm; Qubit; Quantum decoherence; Error detection and correction; Theoretical computer science; Computer engineering; Arithmetic; Quantum; Mathematics; Quantum mechanics; Physics","score_opus":0.013544250009940872,"score_gpt":0.25321063392571447,"score_spread":0.2396663839157736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297108347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564511,0.000024772988,0.74133104,0.0010099426,0.00047468048,0.00037286154,0.000048353515,0.00025279543,0.0000344378],"genre_scores_gemma":[0.98808855,0.0000049008377,0.0109622395,0.00040329955,0.000025215524,0.00006098364,0.00043957212,0.000006842633,0.00000837603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987359,0.000094049,0.0004600443,0.00019899436,0.0003029396,0.00020805918],"domain_scores_gemma":[0.9991273,0.00019373173,0.00036223925,0.000140215,0.00012842199,0.000048077825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035706977,0.00015468655,0.0001929874,0.00022798264,0.0004585986,0.00019295933,0.00022802546,0.000031715805,0.00000645772],"category_scores_gemma":[0.000018957635,0.00012949042,0.000055954482,0.00040255568,0.000046034624,0.0009356228,0.00017410684,0.00014452051,0.0000013108792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003910805,0.00029456554,0.0007611158,0.00035499092,0.000092622504,0.000004609593,0.0060930024,0.7264045,0.0002710053,0.12309505,0.012929304,0.12930816],"study_design_scores_gemma":[0.0008456041,0.0010934254,0.0022856607,0.000018615336,0.000010444991,0.0000670932,0.00089497375,0.98719376,0.00018913618,0.0046598064,0.0025582137,0.00018326721],"about_ca_topic_score_codex":0.000048840102,"about_ca_topic_score_gemma":0.000004032571,"teacher_disagreement_score":0.7316375,"about_ca_system_score_codex":0.000042792555,"about_ca_system_score_gemma":0.00006477172,"threshold_uncertainty_score":0.5280466},"labels":[],"label_agreement":null},{"id":"W4297109183","doi":"10.26421/qic22.13-14-2","title":"Of shadows and gaps in spatial search","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Mathematics; Adjacency matrix; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Hamming graph; Discrete mathematics; Graph; Algorithm; Decoding methods; Hamming code","score_opus":0.009212039835549723,"score_gpt":0.24137800458913003,"score_spread":0.2321659647535803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297109183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62799245,0.000049546892,0.37111473,0.0005001983,0.000094512536,0.00010299874,0.000003473343,0.00003198241,0.00011011979],"genre_scores_gemma":[0.9948067,0.0000074768477,0.004993988,0.00015977511,0.00000782134,0.000005977868,0.000014380676,0.0000019182373,0.0000019436286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919814,0.000078696416,0.00027701733,0.000102981176,0.00023226283,0.00011091444],"domain_scores_gemma":[0.99968904,0.00006195386,0.00009878419,0.00007767022,0.000038148046,0.0000343816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003771029,0.000065687236,0.00009871249,0.00026030926,0.00014502254,0.00006946449,0.00013347967,0.000017303262,0.0000036315218],"category_scores_gemma":[0.000010069183,0.00006657569,0.000014288379,0.0003022869,0.000026479674,0.00040744056,0.00025936216,0.0001406507,0.0000011520252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020018882,0.00003938573,0.0012985988,0.000085605505,0.000003854824,0.0000021072367,0.011966365,0.13554108,0.000060084185,0.06471102,0.00005555629,0.7862163],"study_design_scores_gemma":[0.00039541317,0.00015070553,0.02298699,0.0000070688216,7.7919475e-7,0.000027107955,0.00033629738,0.9715985,0.0000367873,0.0040070303,0.00037932963,0.00007400507],"about_ca_topic_score_codex":0.00015679402,"about_ca_topic_score_gemma":0.000004005678,"teacher_disagreement_score":0.8360574,"about_ca_system_score_codex":0.00001631459,"about_ca_system_score_gemma":0.000039895982,"threshold_uncertainty_score":0.2714878},"labels":[],"label_agreement":null},{"id":"W7118257769","doi":"10.2478/qic-2025-0026","title":"New Approaches to Complexity via Quantum Graphs","year":2025,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum; Quantum algorithm; Generalization; Probabilistic logic; Quantum complexity theory; Operator (biology); Quantization (signal processing); Quantum computer; Quantum state","score_opus":0.04265908074349494,"score_gpt":0.25436117213635967,"score_spread":0.21170209139286472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118257769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03400207,0.00005843429,0.95721775,0.0064914636,0.0005355175,0.00029622845,0.0000023145858,0.0003462691,0.0010499469],"genre_scores_gemma":[0.86351347,0.0000046226205,0.13440149,0.0019674927,0.000032680535,0.000009830263,0.00003151013,0.0000046930595,0.00003422993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.00006350065,0.00045953962,0.0002585147,0.00025654212,0.00026355666],"domain_scores_gemma":[0.99928653,0.00008466135,0.00014101686,0.00025303746,0.00006548049,0.0001692997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898096,0.00019644089,0.0002033721,0.0004954751,0.0003304843,0.0004843429,0.00039369948,0.00006995181,0.0000033122885],"category_scores_gemma":[0.000024604922,0.00018445776,0.000059947157,0.0009747206,0.000038072365,0.0009215163,0.00024966436,0.00016555528,0.0000585061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000806118,0.0000129319915,0.000050697487,0.000030200725,0.000010413323,3.272296e-7,0.0012139339,0.011462068,0.000005840485,0.61627924,0.0013883018,0.36953798],"study_design_scores_gemma":[0.00030987337,0.000074893986,0.005706057,0.000030566724,0.000004055909,0.000009979074,0.00005596619,0.75732183,0.000044709042,0.23268658,0.0035941273,0.00016138486],"about_ca_topic_score_codex":0.00011498549,"about_ca_topic_score_gemma":0.000006049219,"teacher_disagreement_score":0.8295114,"about_ca_system_score_codex":0.000030029822,"about_ca_system_score_gemma":0.00010773108,"threshold_uncertainty_score":0.75219697},"labels":[],"label_agreement":null},{"id":"W9166514","doi":"10.26421/qic14.15-16-1","title":"An algorithm for the T-countAn algorithm for the T-count","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Toffoli gate; Gate count; Algorithm; Quantum computer; Context (archaeology); Mathematics; Quantum circuit; Quantum gate; Computer science; Electronic circuit; Computation; Discrete mathematics; Topology (electrical circuits); Combinatorics; Quantum; Quantum error correction; Quantum mechanics; Physics","score_opus":0.009848571169841867,"score_gpt":0.25555385964539634,"score_spread":0.24570528847555448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9166514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095718296,0.00010801016,0.99480027,0.0020950255,0.0009450986,0.00084806205,0.000026068274,0.00019006619,0.000030217367],"genre_scores_gemma":[0.2690272,0.00005721703,0.7246392,0.004821472,0.0008845154,0.00035105832,0.00017028692,0.00002667396,0.000022405522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987185,0.000058996808,0.00040898053,0.0002219047,0.00029947673,0.00029211713],"domain_scores_gemma":[0.997958,0.0010635073,0.00025476457,0.00035232035,0.00029622373,0.00007520512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413783,0.0001927532,0.00015442543,0.00009519266,0.0011732365,0.00089898735,0.0006181324,0.00006800226,0.0000011062826],"category_scores_gemma":[0.0000420737,0.00011526243,0.00008763219,0.00023340166,0.000073186864,0.0010485308,0.000070916685,0.0001365402,0.000007670225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003496123,0.000015393483,0.0000014978515,0.000012408665,0.00001511668,3.6470702e-8,0.0012069057,0.018123504,0.0000024745036,0.028511293,0.0005451874,0.9515627],"study_design_scores_gemma":[0.0006563768,0.0003532078,0.00045834365,0.000010896943,0.000017658742,0.000019837202,0.000262645,0.9419078,0.000025674317,0.013654061,0.042453665,0.00017980505],"about_ca_topic_score_codex":0.000041863634,"about_ca_topic_score_gemma":0.0000035084877,"teacher_disagreement_score":0.9513829,"about_ca_system_score_codex":0.000024427476,"about_ca_system_score_gemma":0.00005390127,"threshold_uncertainty_score":0.9023705},"labels":[],"label_agreement":null},{"id":"W94754060","doi":"10.26421/qic15.1-2-5","title":"Group theoretic, Lie algebraic and Jordan algebraic formulations of the SIC existence problem","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Intelligence Advanced Research Projects Activity; Institut Périmètre de physique théorique; Office of Naval Research; Industry Canada; Government of Canada; John Templeton Foundation","keywords":"Mathematics; Equivalence (formal languages); Algebraic number; Dimension (graph theory); Connection (principal bundle); Pure mathematics; Lie group; Lie algebra; Group (periodic table); Operator (biology); Algebra over a field; Mathematical analysis","score_opus":0.04720131900658231,"score_gpt":0.32052760312755396,"score_spread":0.27332628412097165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94754060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87554365,0.0000633215,0.12197534,0.0004363526,0.00006337571,0.0005908054,0.000007685376,0.00005198346,0.0012674702],"genre_scores_gemma":[0.9884126,0.000017020022,0.011370612,0.000109279914,0.000014302607,0.000027980619,0.000020533047,0.00000975508,0.000017907621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877524,0.00009246731,0.00047477137,0.000104087456,0.00039131814,0.00016211711],"domain_scores_gemma":[0.99898237,0.00019977422,0.00025970233,0.00016590129,0.00029510452,0.000097156844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005091014,0.00012455399,0.00015710271,0.000115357616,0.00017406596,0.0000939679,0.00012226797,0.000058690617,0.0000066067105],"category_scores_gemma":[0.0003178936,0.00009034117,0.000031556825,0.00029955772,0.00017749732,0.0011131297,0.0001119153,0.0001327626,0.000009806613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019853309,0.00002193533,0.00021883295,0.0001385334,0.000008695301,9.68822e-8,0.0036829903,0.000080859405,0.00003762908,0.9844823,0.00010407624,0.011204217],"study_design_scores_gemma":[0.0006777025,0.00012721133,0.0018070142,0.000053152206,0.000013917768,0.000015641253,0.0013342038,0.085506715,0.00018773125,0.9099642,0.0002003605,0.0001121271],"about_ca_topic_score_codex":0.000009438341,"about_ca_topic_score_gemma":0.0000092101145,"teacher_disagreement_score":0.11286894,"about_ca_system_score_codex":0.000038889175,"about_ca_system_score_gemma":0.00007121952,"threshold_uncertainty_score":0.3684006},"labels":[],"label_agreement":null}]}