{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.272926,0.0001904337,0.7107247,0.00081718015,0.00016829181,0.00010283783,0.00016159001,0.0014655074,0.013443403],"genre_scores_gemma":[0.7645842,0.00007690302,0.23133628,0.00022005377,0.000033863107,0.00009160582,0.000117392,0.00012863404,0.0034110285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.000120351564,0.00003243506,0.000060227827,0.00020391821,0.0000686696],"domain_scores_gemma":[0.99902,0.00034367567,0.00009284772,0.00034258893,0.00015376357,0.00004713413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047649705,0.00026576314,0.00040647737,0.00046364454,0.0005029138,0.0007000957,0.0008538333,0.0009943988,0.0015243378],"category_scores_gemma":[0.002703267,0.0001333723,0.00036368525,0.00036870298,0.00096153753,0.0009594452,0.0010932075,0.0007916341,0.0005064474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003691164,0.000102529535,0.0012657238,0.000117377174,0.000044946737,0.00033412097,0.00031530703,0.15148456,0.069560185,0.6958376,0.0029260116,0.077642426],"study_design_scores_gemma":[0.000047835943,0.00007756813,0.00025961452,0.000011876733,0.0000074787977,0.00014891825,0.000022149925,0.8175596,0.040122245,0.13881691,0.00288501,0.00004073482],"about_ca_topic_score_codex":0.0007017874,"about_ca_topic_score_gemma":0.0008165167,"teacher_disagreement_score":0.0015243378,"about_ca_system_score_codex":0.00088238734,"about_ca_system_score_gemma":0.0008820993,"threshold_uncertainty_score":0.0064021945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05038356,0.00011775089,0.9423991,0.0001668163,0.000039446237,0.00009355664,0.00006354359,0.0013037149,0.005432438],"genre_scores_gemma":[0.59424686,0.00010392084,0.39915952,0.00020977636,0.000028820425,0.0002394868,0.00023840656,0.000351884,0.005421352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893814,0.00030440168,0.000051023675,0.00018515211,0.00033590867,0.0001854108],"domain_scores_gemma":[0.99824846,0.00061826134,0.00020105275,0.00063067046,0.00018583331,0.000115624025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009400491,0.0007994484,0.00075213483,0.00047245433,0.0006447417,0.0009649865,0.0015561864,0.0009385527,0.0052373386],"category_scores_gemma":[0.0045020776,0.00041630378,0.0007756371,0.00041891605,0.0014732463,0.0020828717,0.0020277675,0.0017943879,0.0014046604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008869232,0.0002281407,0.0011573143,0.00024742523,0.00007491123,0.00015475355,0.00029383943,0.2584308,0.047359534,0.452634,0.005588563,0.23294385],"study_design_scores_gemma":[0.000059233742,0.00018130502,0.000117687065,0.000022415861,0.000014603621,0.00006356514,0.000032614946,0.8807667,0.029159771,0.086929925,0.0026253501,0.000026829628],"about_ca_topic_score_codex":0.0009465854,"about_ca_topic_score_gemma":0.0014895585,"teacher_disagreement_score":0.0052373386,"about_ca_system_score_codex":0.0010338662,"about_ca_system_score_gemma":0.0012210865,"threshold_uncertainty_score":0.017520666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34227008,0.0034445594,0.426669,0.0056493734,0.0009804592,0.000066492794,0.00036520883,0.00028406343,0.22027072],"genre_scores_gemma":[0.9226058,0.0013363352,0.056452762,0.0012549129,0.0011161166,0.00015009668,0.00021276415,0.00023416628,0.016637068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976452,0.0007806726,0.0001017673,0.00036077615,0.0009055037,0.00020599557],"domain_scores_gemma":[0.99361116,0.0035615542,0.0005693714,0.0005634786,0.0009886972,0.0007057576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003826946,0.00059777446,0.0005589331,0.0016312227,0.0010894769,0.0021697287,0.0012422861,0.00094473833,0.003972881],"category_scores_gemma":[0.007503018,0.0003757297,0.00088992994,0.0008673237,0.0053810216,0.005431686,0.0021163437,0.0037647858,0.00047105242],"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.000008644677,0.0000054688876,0.000052272775,0.000013496789,0.000001710136,0.000026380358,0.00007832927,0.0003922923,0.0006347061,0.99759465,0.00025987756,0.0009320821],"study_design_scores_gemma":[0.000006929182,0.00003711268,0.0002170853,0.00001404614,0.0000032489804,0.00009477191,0.00006098527,0.012719048,0.0008710068,0.9836233,0.0023356436,0.000016840007],"about_ca_topic_score_codex":0.0006434844,"about_ca_topic_score_gemma":0.0006325054,"teacher_disagreement_score":0.003972881,"about_ca_system_score_codex":0.0013639553,"about_ca_system_score_gemma":0.00083647,"threshold_uncertainty_score":0.020239055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43713245,0.0012748747,0.46841228,0.002768766,0.00023647134,0.00014238642,0.0006715978,0.00070485176,0.08865637],"genre_scores_gemma":[0.94672537,0.00045629084,0.046707563,0.00046821596,0.00016447202,0.00013860715,0.00041428185,0.00015095694,0.004774316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987435,0.0003479868,0.000043648757,0.0003029842,0.00023047865,0.00033142618],"domain_scores_gemma":[0.99684167,0.0015466941,0.00039691245,0.00063320604,0.00017487138,0.0004065773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011619373,0.0007643736,0.0009095122,0.001182963,0.0018726821,0.0018846501,0.001512208,0.0015591973,0.0067161275],"category_scores_gemma":[0.004689241,0.00053788716,0.0015032056,0.00074622413,0.0033504537,0.0063815624,0.0026898882,0.003312007,0.00062164787],"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.000057340858,0.00002277949,0.00023202726,0.00004956847,0.000010693263,0.00008442454,0.00009697726,0.005050157,0.0015250053,0.9880392,0.0015007018,0.0033310833],"study_design_scores_gemma":[0.000017891778,0.00003792985,0.00032222853,0.000022674214,0.000019738907,0.00011796981,0.000050496343,0.033490743,0.0014309302,0.96227443,0.0021911308,0.000023852417],"about_ca_topic_score_codex":0.0005578726,"about_ca_topic_score_gemma":0.00044161396,"teacher_disagreement_score":0.0067161275,"about_ca_system_score_codex":0.0012802619,"about_ca_system_score_gemma":0.00049681176,"threshold_uncertainty_score":0.022467673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07061536,0.011496041,0.64365673,0.018224027,0.00160271,0.00019595188,0.0013282669,0.0011682207,0.25171268],"genre_scores_gemma":[0.8388373,0.0067385403,0.11412984,0.0044556875,0.0023247297,0.0006446175,0.0015252514,0.00095140445,0.03039263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99180824,0.0012048348,0.00027647213,0.001311244,0.0037916964,0.0016075597],"domain_scores_gemma":[0.98369265,0.011632683,0.00039820533,0.0020607265,0.0016385122,0.0005771659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043509253,0.0016479046,0.0024998032,0.0030761622,0.0029764674,0.0065748175,0.0039243554,0.003819794,0.019531265],"category_scores_gemma":[0.021551253,0.0008963469,0.0017593037,0.003796484,0.0058832243,0.017107956,0.006583887,0.010066999,0.0032768692],"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.0001371146,0.000084003965,0.00029962495,0.00018564436,0.000029562643,0.000066087494,0.00015775293,0.014588469,0.0013924204,0.9611386,0.0070370347,0.014883749],"study_design_scores_gemma":[0.000023283183,0.000023152345,0.00013800363,0.000047138892,0.000017266082,0.000047875015,0.000031708398,0.047804758,0.00091839716,0.9469479,0.003976878,0.000023678433],"about_ca_topic_score_codex":0.0021024903,"about_ca_topic_score_gemma":0.0020003486,"teacher_disagreement_score":0.019531265,"about_ca_system_score_codex":0.0050586085,"about_ca_system_score_gemma":0.0026812956,"threshold_uncertainty_score":0.06533861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7372006,0.00048680668,0.21824487,0.0012705175,0.000059537306,0.000061345025,0.0002266326,0.00025062653,0.04219904],"genre_scores_gemma":[0.9922701,0.00014729695,0.0055390364,0.00010089182,0.000026306981,0.000032809327,0.000034101606,0.000024612455,0.0018248697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935895,0.00019712417,0.00003312696,0.00015539648,0.00012326213,0.00013207283],"domain_scores_gemma":[0.99723333,0.0018924043,0.00017255392,0.00041442827,0.00009604539,0.00019117616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084263674,0.0002856715,0.0004897304,0.0005957391,0.0008769233,0.001558985,0.0006419399,0.0006966501,0.002753284],"category_scores_gemma":[0.0039269733,0.00025067097,0.0005201503,0.00048345997,0.0036779267,0.003973121,0.0017967393,0.0011092488,0.0001516041],"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.00009923859,0.00002219274,0.0003938367,0.00004121589,0.000013518623,0.00007326996,0.00017850276,0.014367935,0.0037866165,0.9751026,0.00029774115,0.0056232596],"study_design_scores_gemma":[0.000023400797,0.00004751071,0.00029101787,0.000017920158,0.000017303788,0.000084890926,0.000078981524,0.066688344,0.0033098261,0.9282634,0.0011651149,0.000012262409],"about_ca_topic_score_codex":0.00061503175,"about_ca_topic_score_gemma":0.0005037764,"teacher_disagreement_score":0.002753284,"about_ca_system_score_codex":0.0005552417,"about_ca_system_score_gemma":0.0005221223,"threshold_uncertainty_score":0.009210646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012357917,0.0005314755,0.9758822,0.0007404208,0.000110238856,0.000043715623,0.00007345313,0.00013693383,0.010123683],"genre_scores_gemma":[0.36811966,0.002050662,0.6169098,0.0007887239,0.00056014705,0.00037261672,0.0003151553,0.00033441544,0.010548883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975025,0.0012022546,0.00010148818,0.00036543046,0.000686233,0.00014214705],"domain_scores_gemma":[0.99368554,0.003972604,0.00040848006,0.00047550787,0.0010974351,0.00036046247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037810705,0.001205666,0.0009298987,0.0011277959,0.00094428076,0.0023982455,0.0013764749,0.0013287922,0.0026233043],"category_scores_gemma":[0.012328898,0.00043122232,0.0011154653,0.001285944,0.004114706,0.004478031,0.002096254,0.00381047,0.00059118547],"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.000031897067,0.00003807954,0.00015485322,0.00007577486,0.000010812534,0.000046319314,0.0000904826,0.03755101,0.0013736864,0.94152653,0.001231899,0.01786859],"study_design_scores_gemma":[0.0000103470675,0.00007149356,0.00004739151,0.00003225222,0.0000041088883,0.00006665699,0.000033759865,0.24953873,0.0016087455,0.74511975,0.0034432318,0.000023549175],"about_ca_topic_score_codex":0.00070714176,"about_ca_topic_score_gemma":0.00051679765,"teacher_disagreement_score":0.0037810705,"about_ca_system_score_codex":0.0012043769,"about_ca_system_score_gemma":0.0010824673,"threshold_uncertainty_score":0.019996405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58527076,0.00015342567,0.4029924,0.0004085168,0.00007723642,0.000068601876,0.00015726924,0.00076510827,0.010106636],"genre_scores_gemma":[0.95639986,0.00006830389,0.04097083,0.000056997746,0.000019481426,0.000060510425,0.00009346225,0.000060277045,0.0022703034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996511,0.00008319198,0.000016249202,0.000045864526,0.00013672575,0.00006703029],"domain_scores_gemma":[0.9990639,0.00027250242,0.000100814854,0.00036493677,0.00014917356,0.00004871918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034982758,0.00030299998,0.00035910186,0.0003454417,0.0003107127,0.0005187275,0.00066781073,0.0006817936,0.0018566542],"category_scores_gemma":[0.0014781964,0.00012423993,0.00037115908,0.00037368626,0.0011001026,0.0009999555,0.00077143614,0.000606009,0.00025203408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019559961,0.000053324544,0.00107189,0.00007452086,0.000020723894,0.00024275812,0.00016413919,0.20024145,0.03504907,0.74364835,0.0011219949,0.018116163],"study_design_scores_gemma":[0.000042179443,0.00007667765,0.00027903664,0.00000850275,0.000010714464,0.00009066529,0.000023992086,0.8546461,0.017236846,0.12539026,0.0021698084,0.000025130163],"about_ca_topic_score_codex":0.0012258296,"about_ca_topic_score_gemma":0.0013403223,"teacher_disagreement_score":0.0018566542,"about_ca_system_score_codex":0.000528286,"about_ca_system_score_gemma":0.0007099336,"threshold_uncertainty_score":0.006211102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28200322,0.004297695,0.62553173,0.00418569,0.00033512976,0.00020269254,0.00070608134,0.0024708575,0.08026685],"genre_scores_gemma":[0.94183356,0.0009963888,0.05078013,0.0004723407,0.00014319942,0.00021456879,0.00029798396,0.0003029058,0.004959073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978751,0.00032419912,0.000088515306,0.00030471088,0.00085578253,0.0005517707],"domain_scores_gemma":[0.98702335,0.00966842,0.00076705957,0.0011966826,0.0008752062,0.000469258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017140247,0.0012184852,0.0012598179,0.0013448315,0.0014147708,0.0026468453,0.0018642765,0.0016364541,0.005785667],"category_scores_gemma":[0.013884734,0.0004957856,0.00083810795,0.0010478377,0.0035688097,0.0035678397,0.0025405467,0.0034938296,0.0010084892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068164617,0.00022017775,0.0014611805,0.00039743388,0.00006923788,0.00028780376,0.0003390373,0.26836807,0.03039703,0.66245055,0.00479019,0.030537704],"study_design_scores_gemma":[0.000057877212,0.00014648166,0.00038881556,0.000109587556,0.000047613717,0.00021030707,0.000055298555,0.66646844,0.024995584,0.30491662,0.0025215093,0.000081817816],"about_ca_topic_score_codex":0.0014370552,"about_ca_topic_score_gemma":0.0013057254,"teacher_disagreement_score":0.005785667,"about_ca_system_score_codex":0.003501871,"about_ca_system_score_gemma":0.002170869,"threshold_uncertainty_score":0.02540803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16200773,0.0066466527,0.6289946,0.023298603,0.00081755215,0.00019790368,0.00043138053,0.0008521685,0.17675342],"genre_scores_gemma":[0.9284356,0.00264607,0.049854852,0.0022841024,0.0009578007,0.00033964432,0.00020850627,0.0005365571,0.014736822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908454,0.0039736596,0.00030563842,0.0015452006,0.0019775643,0.0013525443],"domain_scores_gemma":[0.951437,0.034049608,0.0015737675,0.009606203,0.0017031803,0.0016300833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008135302,0.0011056551,0.0017950116,0.0014037879,0.0035063382,0.005796648,0.0031448128,0.0029059253,0.0131676],"category_scores_gemma":[0.03389879,0.0008549083,0.0015293479,0.0013969484,0.013801426,0.026183734,0.009880913,0.009027315,0.0016847966],"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.000044272547,0.000025866788,0.00014769807,0.00006390983,0.000012073927,0.000048501144,0.00013367149,0.0044887066,0.00053073023,0.9882505,0.0011252367,0.0051288265],"study_design_scores_gemma":[0.000013757588,0.000026225545,0.00010648437,0.000032275882,0.000009771568,0.000049001283,0.000060791695,0.01812533,0.00058317295,0.97885877,0.0021199747,0.0000144311025],"about_ca_topic_score_codex":0.0009153294,"about_ca_topic_score_gemma":0.00068061403,"teacher_disagreement_score":0.0131676,"about_ca_system_score_codex":0.0027373533,"about_ca_system_score_gemma":0.0018155704,"threshold_uncertainty_score":0.04404998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038085528,0.0011261775,0.9337859,0.0009246837,0.00015142246,0.00005743644,0.00006316406,0.00030419073,0.025501516],"genre_scores_gemma":[0.6113962,0.0012091146,0.374386,0.00040375144,0.00014083952,0.00020737931,0.00016016478,0.00030580186,0.0117907375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996357,0.00016018507,0.000014987705,0.00004668587,0.000082805695,0.00005961894],"domain_scores_gemma":[0.99952924,0.00024752386,0.000024351873,0.00012919838,0.00003733571,0.000032508375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008759458,0.0006388543,0.00072656607,0.0004643675,0.00064945983,0.00091672456,0.00058886944,0.0006532702,0.006287575],"category_scores_gemma":[0.0023023733,0.00034699333,0.0007264927,0.000607165,0.0018962494,0.002138537,0.001611823,0.0021000388,0.0007832906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007234251,0.00003441029,0.00010383737,0.00006200507,0.0000140411385,0.000027392995,0.00008155,0.092646204,0.0022826842,0.8756118,0.0022637532,0.026799906],"study_design_scores_gemma":[0.000015944755,0.000023364766,0.000046026536,0.000012762728,0.000005859648,0.000013539393,0.000018554825,0.3291391,0.0012386298,0.66598135,0.0034954657,0.000009353312],"about_ca_topic_score_codex":0.0009604581,"about_ca_topic_score_gemma":0.00094181433,"teacher_disagreement_score":0.006287575,"about_ca_system_score_codex":0.0009509451,"about_ca_system_score_gemma":0.00071579055,"threshold_uncertainty_score":0.021034062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0461903,0.00016429544,0.93826175,0.0013091431,0.000047261343,0.00016897924,0.00011901709,0.0015119397,0.012227328],"genre_scores_gemma":[0.82496303,0.00020538876,0.16744235,0.00038868774,0.00012462783,0.00040697068,0.00015570561,0.00027370744,0.0060396027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99056375,0.0034093256,0.000542567,0.0017179385,0.002651433,0.0011149059],"domain_scores_gemma":[0.9570555,0.026202654,0.0034549348,0.010491137,0.0019597868,0.00083585584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008381813,0.0007490983,0.0011787799,0.001009185,0.0020701804,0.0031114893,0.0044387057,0.0022194013,0.007381318],"category_scores_gemma":[0.034303628,0.00083576096,0.0016076831,0.00095483765,0.007107232,0.008966333,0.008183578,0.0049444656,0.0013806124],"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.00021517489,0.0000597364,0.00038855677,0.00015556143,0.00005432048,0.00022791591,0.0007970728,0.02524774,0.005738853,0.95552343,0.0010012314,0.010590522],"study_design_scores_gemma":[0.00017472876,0.000097464006,0.00019154581,0.000033759196,0.000059089714,0.00028298624,0.00006958447,0.26134002,0.012388919,0.7196066,0.0056814128,0.00007398121],"about_ca_topic_score_codex":0.0005331765,"about_ca_topic_score_gemma":0.0003401038,"teacher_disagreement_score":0.008381813,"about_ca_system_score_codex":0.0017526402,"about_ca_system_score_gemma":0.0018119282,"threshold_uncertainty_score":0.044327796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057426978,0.00046025185,0.8297941,0.008861803,0.00023367866,0.0003821233,0.00025455168,0.00023988567,0.10234666],"genre_scores_gemma":[0.82835823,0.0006784077,0.143679,0.0019139979,0.00019012766,0.0007710491,0.00014371352,0.00014731464,0.024118237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635625,0.0018087046,0.00013565013,0.0006232463,0.00058097736,0.00049522787],"domain_scores_gemma":[0.99532336,0.0033505214,0.00032196534,0.00042659318,0.0002265102,0.00035101996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003266825,0.0014069342,0.0011611892,0.00074397546,0.0016147408,0.003173953,0.0025362836,0.0032425357,0.007973762],"category_scores_gemma":[0.0101721445,0.0005249763,0.001235512,0.0006596674,0.0058578723,0.008423127,0.0035485667,0.00410751,0.0008782265],"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.00009149026,0.00003389462,0.00012979202,0.000052310603,0.000016384258,0.00007283979,0.00021460133,0.010143704,0.0008415631,0.9833332,0.0013827514,0.0036875885],"study_design_scores_gemma":[0.000040741244,0.000066792156,0.00009568302,0.00002287828,0.000009254968,0.00006405318,0.00005539594,0.09385207,0.00073231716,0.90094095,0.0040981174,0.000021811855],"about_ca_topic_score_codex":0.0015607078,"about_ca_topic_score_gemma":0.0018190086,"teacher_disagreement_score":0.007973762,"about_ca_system_score_codex":0.003541307,"about_ca_system_score_gemma":0.0025441125,"threshold_uncertainty_score":0.026674867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3774797,0.0008267448,0.53001165,0.0018597404,0.00044893275,0.00029964064,0.00062798156,0.007897541,0.08054815],"genre_scores_gemma":[0.8137223,0.00022865101,0.17456329,0.00024376687,0.000044577493,0.0001621125,0.0004113768,0.00025272218,0.010371149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896336,0.00015844867,0.000057915382,0.00011744133,0.00046982357,0.00023307868],"domain_scores_gemma":[0.99945456,0.00012962623,0.000052681607,0.00017640702,0.00015320048,0.000033529097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004290927,0.00046949513,0.0005711755,0.0004150342,0.00057368935,0.0012013608,0.0014051414,0.0006926239,0.008573164],"category_scores_gemma":[0.0015338091,0.00030538999,0.0003745286,0.00074763066,0.00059864594,0.0014731082,0.00083468726,0.001060799,0.0015698202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016065339,0.00076681504,0.0025468364,0.00048060593,0.0001330092,0.00048413198,0.00040190536,0.28853843,0.121820435,0.27886498,0.023300815,0.28105557],"study_design_scores_gemma":[0.00037789965,0.0003419148,0.00092266296,0.000044019427,0.000048371618,0.000109668516,0.000089781985,0.857399,0.076184295,0.046282366,0.018131902,0.000068167436],"about_ca_topic_score_codex":0.002605846,"about_ca_topic_score_gemma":0.004379805,"teacher_disagreement_score":0.008573164,"about_ca_system_score_codex":0.0012484625,"about_ca_system_score_gemma":0.0018587568,"threshold_uncertainty_score":0.028680146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32941622,0.0005186114,0.64230126,0.0012273927,0.00020429523,0.00017197231,0.00023976986,0.0005544898,0.025366096],"genre_scores_gemma":[0.8638182,0.00026107195,0.13191456,0.00039762125,0.0002166155,0.000160512,0.00021871894,0.00011452103,0.002898145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954667,0.0010944562,0.00050305994,0.0012129324,0.001159808,0.00056309847],"domain_scores_gemma":[0.98154217,0.011014545,0.0011753588,0.0046485006,0.000849327,0.00076999696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039544962,0.0008505568,0.0014172554,0.00086424494,0.0019758136,0.0033118955,0.0015859675,0.0020757972,0.004576388],"category_scores_gemma":[0.014788645,0.00060299604,0.0011578255,0.0009519428,0.0071267514,0.013454066,0.0051319683,0.0045114243,0.00088901847],"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.0003522161,0.0000978708,0.0005647296,0.000117417294,0.000025114668,0.00009433484,0.00029648538,0.0055935704,0.01712363,0.95591694,0.00057674065,0.019240923],"study_design_scores_gemma":[0.000047593363,0.00012190001,0.00028406628,0.000019195817,0.000019585137,0.00019879593,0.00009693983,0.02803026,0.013525608,0.9555934,0.0020227707,0.00003982829],"about_ca_topic_score_codex":0.0002442207,"about_ca_topic_score_gemma":0.00031009773,"teacher_disagreement_score":0.004576388,"about_ca_system_score_codex":0.00083479827,"about_ca_system_score_gemma":0.0011744334,"threshold_uncertainty_score":0.02091366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27650803,0.00045174485,0.6983447,0.0017967663,0.0003627612,0.00012464258,0.00012802282,0.0005234611,0.021759782],"genre_scores_gemma":[0.9497988,0.00025266924,0.04551999,0.00014204014,0.0001182243,0.00019781216,0.000058040925,0.00005237798,0.003860026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987207,0.0003457757,0.000052682404,0.00015646555,0.00054157095,0.00018277558],"domain_scores_gemma":[0.9982768,0.0006761735,0.00021117963,0.0005554673,0.00018580457,0.00009455604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011563826,0.00032293427,0.000650601,0.00043857645,0.0007558463,0.0010946941,0.00090722594,0.0010093921,0.0014654121],"category_scores_gemma":[0.0037886794,0.00021788527,0.00036328085,0.00045840882,0.0020814221,0.0027093184,0.002134824,0.0012135215,0.00030173102],"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.00017070236,0.00007178991,0.00045336504,0.00012448282,0.000030487177,0.00032820192,0.00035851065,0.08617867,0.057434037,0.83672386,0.0017667215,0.016359199],"study_design_scores_gemma":[0.00007819379,0.00018970159,0.000260295,0.000024343151,0.000021210231,0.00015615516,0.0000695884,0.7214056,0.022542471,0.24924037,0.0059605194,0.00005145931],"about_ca_topic_score_codex":0.00027080323,"about_ca_topic_score_gemma":0.00023697574,"teacher_disagreement_score":0.0014654121,"about_ca_system_score_codex":0.0006476763,"about_ca_system_score_gemma":0.00069895876,"threshold_uncertainty_score":0.006115675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61089146,0.00028076462,0.37406757,0.00296603,0.00012841941,0.00032210382,0.0008752772,0.0010214287,0.009447037],"genre_scores_gemma":[0.9515046,0.000083630315,0.04629981,0.00024015245,0.000091091526,0.00010969947,0.0007239479,0.000078074336,0.00086900295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9855332,0.0060318643,0.0010269068,0.0028512543,0.0029944002,0.0015623419],"domain_scores_gemma":[0.9433356,0.047180068,0.0024666083,0.0044509936,0.0015950667,0.0009716622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006242185,0.00042734842,0.0013876898,0.0011075685,0.0018121869,0.004333993,0.0025389292,0.0026001763,0.0051597334],"category_scores_gemma":[0.044011638,0.0006884486,0.0012709111,0.001275291,0.0042244387,0.010548503,0.004757414,0.0035948425,0.00048519814],"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.00302567,0.00094917737,0.007367965,0.00051256234,0.00026923436,0.00088696607,0.001597384,0.091794945,0.017317196,0.759622,0.005542348,0.11111453],"study_design_scores_gemma":[0.000253848,0.0002105793,0.00091888173,0.000035066034,0.00005464989,0.00024880448,0.00042198438,0.20796697,0.015108477,0.7733199,0.0014037301,0.000057107005],"about_ca_topic_score_codex":0.0012000902,"about_ca_topic_score_gemma":0.0010872855,"teacher_disagreement_score":0.006242185,"about_ca_system_score_codex":0.0019002199,"about_ca_system_score_gemma":0.0016935421,"threshold_uncertainty_score":0.03301221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13579835,0.001307742,0.8306485,0.003283519,0.00017040415,0.00016462138,0.00029094846,0.0004850869,0.0278508],"genre_scores_gemma":[0.969619,0.00060195726,0.026896894,0.00018114535,0.00009956474,0.00017127598,0.00009998523,0.000043649743,0.0022867012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899422,0.0032577429,0.00059398584,0.0014027234,0.003386173,0.0014172416],"domain_scores_gemma":[0.9677637,0.019956304,0.002267894,0.007647453,0.0017707545,0.000593856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081695365,0.0013043756,0.002639036,0.001373187,0.002289284,0.006960898,0.0031600192,0.0039746948,0.0028746827],"category_scores_gemma":[0.034225468,0.0012047752,0.001132802,0.0017149118,0.009369821,0.010253789,0.009919625,0.00504624,0.001176087],"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.00039490836,0.000053611602,0.00066482637,0.00019973856,0.00007124866,0.00021170705,0.00029175976,0.0547055,0.006547401,0.92447853,0.00082530454,0.011555473],"study_design_scores_gemma":[0.0001485652,0.0001236789,0.00025043628,0.00009511583,0.000054017655,0.0003364728,0.00006401115,0.3366767,0.01285908,0.6462812,0.003017563,0.00009323832],"about_ca_topic_score_codex":0.00076962146,"about_ca_topic_score_gemma":0.0002354178,"teacher_disagreement_score":0.0081695365,"about_ca_system_score_codex":0.003251366,"about_ca_system_score_gemma":0.0027664828,"threshold_uncertainty_score":0.043205142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3310579,0.0019355926,0.5267602,0.028445685,0.0011405706,0.00012017617,0.00021803574,0.0005387037,0.10978316],"genre_scores_gemma":[0.97132844,0.00063652836,0.014797321,0.0014445398,0.0003234326,0.000050492,0.00004612421,0.00013289986,0.0112403715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988154,0.00046777065,0.000033158805,0.0001960502,0.0002906567,0.0001969852],"domain_scores_gemma":[0.99677986,0.0015772277,0.0002773333,0.0008631235,0.00026289662,0.0002395809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020209085,0.00039465216,0.0006184802,0.000542117,0.0021690694,0.0029329555,0.0010933642,0.0020081718,0.0075842654],"category_scores_gemma":[0.009567358,0.0003684616,0.0006537218,0.00052756665,0.0055627534,0.008952175,0.0034546284,0.0029500325,0.0011575933],"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.00008688644,0.000029403578,0.00017827582,0.00005428189,0.000018834502,0.00008179299,0.00019993649,0.0016130689,0.0014774934,0.9887378,0.0017037801,0.005818467],"study_design_scores_gemma":[0.000016236747,0.000033273343,0.00007311593,0.00001728391,0.00000996629,0.000071225484,0.000081481114,0.016175611,0.0012318778,0.9800309,0.002245239,0.000013754306],"about_ca_topic_score_codex":0.00040331617,"about_ca_topic_score_gemma":0.00019463936,"teacher_disagreement_score":0.0075842654,"about_ca_system_score_codex":0.00069390854,"about_ca_system_score_gemma":0.0005839215,"threshold_uncertainty_score":0.02537191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11068631,0.00033950084,0.8785336,0.00032368806,0.0000650422,0.000057126275,0.00006356969,0.00052716833,0.009404054],"genre_scores_gemma":[0.7136054,0.00033555637,0.2811758,0.000070780545,0.00006108023,0.000093773015,0.00019288596,0.00019653559,0.0042682127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947125,0.00013285768,0.000031718126,0.000083298386,0.00019262682,0.000088267385],"domain_scores_gemma":[0.99918526,0.00032189526,0.00008651564,0.00023028019,0.00011685223,0.000059255788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075126666,0.0003712989,0.0006123722,0.0010415998,0.00077254995,0.0013834264,0.0012322494,0.0006231584,0.0034081677],"category_scores_gemma":[0.0033765803,0.00024372338,0.0005894133,0.00095342495,0.0016292793,0.0032512874,0.0023557832,0.0011502551,0.0003786031],"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.000044955737,0.000021420414,0.00035473306,0.000053768963,0.00001316212,0.00003654217,0.00019445518,0.075379945,0.0020431571,0.8819091,0.0008471143,0.039101597],"study_design_scores_gemma":[0.000010930154,0.000019229834,0.00008458627,0.000009862337,0.0000038847834,0.000018698585,0.000060343886,0.4765142,0.0015250284,0.51967925,0.0020644586,0.000009569502],"about_ca_topic_score_codex":0.0018673581,"about_ca_topic_score_gemma":0.0021900702,"teacher_disagreement_score":0.0034081677,"about_ca_system_score_codex":0.0016643134,"about_ca_system_score_gemma":0.0007305747,"threshold_uncertainty_score":0.012075484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20983078,0.0010096078,0.7248603,0.0017310075,0.00023960079,0.00022889153,0.00028086882,0.0008346738,0.060984295],"genre_scores_gemma":[0.93635315,0.000607541,0.054339033,0.00038056597,0.00032422433,0.00025400965,0.00015630586,0.00011005559,0.0074750483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730825,0.0006420507,0.00016297515,0.0006127758,0.0009837626,0.00029017494],"domain_scores_gemma":[0.98928726,0.006200192,0.00088347885,0.0020660784,0.0011894194,0.00037358527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027863453,0.0005322123,0.0006609468,0.0011848678,0.0016804009,0.0024173348,0.00089254545,0.0012391614,0.0032734787],"category_scores_gemma":[0.008812505,0.00035425054,0.00071638223,0.00074290566,0.0049667796,0.005499063,0.002925541,0.0024635107,0.00079805515],"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.0000581632,0.000044430053,0.0004357442,0.00009975354,0.000011353562,0.0001385502,0.0002248107,0.0016299102,0.0059486963,0.97829187,0.0006029435,0.012513771],"study_design_scores_gemma":[0.000018926014,0.00017228183,0.00048484802,0.000035256828,0.000024134291,0.00079763454,0.00012275261,0.051537238,0.021883272,0.9164309,0.008439734,0.00005306803],"about_ca_topic_score_codex":0.00022699422,"about_ca_topic_score_gemma":0.0001135238,"teacher_disagreement_score":0.0032734787,"about_ca_system_score_codex":0.0008561914,"about_ca_system_score_gemma":0.0009965156,"threshold_uncertainty_score":0.014735758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13396342,0.00039490007,0.8446237,0.00094329356,0.00011184578,0.00023122907,0.00014359338,0.0004568509,0.019131202],"genre_scores_gemma":[0.88225734,0.0002673838,0.11089399,0.00021922018,0.00005425671,0.00037430512,0.00008534453,0.00007125628,0.0057769003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998243,0.0006289864,0.00009884701,0.00025392007,0.00054684404,0.00022847083],"domain_scores_gemma":[0.99595153,0.0017823598,0.00044908107,0.0014593098,0.00021260054,0.00014518118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020618367,0.0004944826,0.0006186288,0.00062992424,0.0011348287,0.0017144253,0.0018400153,0.0011296459,0.00317758],"category_scores_gemma":[0.005269443,0.0004933997,0.00064128864,0.00079226313,0.0028308926,0.0037801242,0.0037092823,0.0017559071,0.0007213957],"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.00019587856,0.0000748122,0.00032466147,0.00010492846,0.000036949245,0.000116700256,0.00030182285,0.038113654,0.018476464,0.92902637,0.0008817238,0.012345986],"study_design_scores_gemma":[0.00013784338,0.00018216038,0.00034530967,0.00005703103,0.000059809114,0.00023928893,0.00016374535,0.50710624,0.0746851,0.40503898,0.011890659,0.0000938142],"about_ca_topic_score_codex":0.00023345818,"about_ca_topic_score_gemma":0.0003489805,"teacher_disagreement_score":0.00317758,"about_ca_system_score_codex":0.00085906347,"about_ca_system_score_gemma":0.00068931683,"threshold_uncertainty_score":0.010904193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9164422,0.00035630178,0.07675962,0.00040081295,0.000055698045,0.000032259974,0.00008948618,0.00043820852,0.005425389],"genre_scores_gemma":[0.9962054,0.00006862946,0.0031406654,0.000022136888,0.000006735299,0.000010014953,0.000026186342,0.000029812512,0.0004902962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917054,0.00024664015,0.00004279926,0.000116094285,0.00026376476,0.00016031772],"domain_scores_gemma":[0.99630296,0.0024258695,0.00045825334,0.00052423595,0.00017961914,0.00010913887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010601924,0.00044938698,0.0005092703,0.00054796925,0.00050235493,0.000978715,0.0008146693,0.0009085944,0.00087399076],"category_scores_gemma":[0.008168115,0.0001864683,0.00027422633,0.00040295455,0.002056344,0.0010852158,0.0013035323,0.0008934542,0.00016363937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001668394,0.00021541331,0.004854377,0.00025380464,0.00012240758,0.00056995894,0.00043772158,0.54924905,0.18042983,0.2237169,0.00079053576,0.03769156],"study_design_scores_gemma":[0.00003872791,0.00021759939,0.0007847336,0.000019464444,0.00001956371,0.00009533986,0.000038042646,0.8658348,0.10069458,0.031800494,0.00040594998,0.000050687908],"about_ca_topic_score_codex":0.0011617446,"about_ca_topic_score_gemma":0.0004887168,"teacher_disagreement_score":0.0011617446,"about_ca_system_score_codex":0.0007418356,"about_ca_system_score_gemma":0.00041898515,"threshold_uncertainty_score":0.0056068897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7431543,0.00047940176,0.24789293,0.00047407465,0.000049896866,0.00005720796,0.00009214236,0.0003215359,0.0074785757],"genre_scores_gemma":[0.9941427,0.000060676666,0.00529507,0.000021315647,0.0000057852017,0.000017086297,0.000013780567,0.000012453433,0.00043114985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980696,0.0006126231,0.00007144113,0.00017243382,0.00065102655,0.00042293879],"domain_scores_gemma":[0.9957787,0.0023488645,0.00063497433,0.0008699,0.00027225132,0.000095341624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030998338,0.00040301046,0.00071526825,0.0006283482,0.0009903833,0.0016855306,0.0010356659,0.0012836654,0.0018882692],"category_scores_gemma":[0.0067202006,0.0003363374,0.0006155578,0.00071153,0.0032365154,0.0032723648,0.0018900944,0.0010508177,0.00025463445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011704995,0.000093141054,0.002698908,0.00012956488,0.00008656866,0.00024735535,0.00025049422,0.46831316,0.034611344,0.48116598,0.0005489401,0.010684131],"study_design_scores_gemma":[0.00007557419,0.00013342724,0.00040156854,0.000012763683,0.000015260694,0.00009012912,0.000037700258,0.94511473,0.012362607,0.041226998,0.00049128244,0.000037903443],"about_ca_topic_score_codex":0.0007257029,"about_ca_topic_score_gemma":0.00023553408,"teacher_disagreement_score":0.0030998338,"about_ca_system_score_codex":0.0015956667,"about_ca_system_score_gemma":0.001064311,"threshold_uncertainty_score":0.016393661},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6099493,0.00013128459,0.3728313,0.0005058231,0.000057793783,0.00005539981,0.00008782573,0.0005775392,0.015803736],"genre_scores_gemma":[0.97358996,0.0000511459,0.024098223,0.000048474518,0.0000068676973,0.000042570566,0.000035100908,0.000023065535,0.0021045457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997284,0.00008171895,0.000012465505,0.00003813386,0.00007686227,0.000062391104],"domain_scores_gemma":[0.9992099,0.00049384387,0.00005662352,0.00013204874,0.000058947804,0.000048658272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044966122,0.00021779783,0.00037157684,0.0001788328,0.00044662307,0.0007195426,0.00087476434,0.0005690625,0.0028087117],"category_scores_gemma":[0.0017707943,0.00021053087,0.00028322532,0.00022930569,0.0013383924,0.0013671833,0.0010126864,0.00068838167,0.00018799826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026623142,0.00009167149,0.00075138395,0.000045572593,0.000023985016,0.00013118442,0.00018272638,0.71013916,0.0096936375,0.26999885,0.00045153842,0.008224087],"study_design_scores_gemma":[0.000012884052,0.000010731049,0.000035712288,0.0000017076629,0.0000018570178,0.00000566045,0.0000066896805,0.98128444,0.0020214405,0.016396036,0.00021895234,0.000003934506],"about_ca_topic_score_codex":0.0020081487,"about_ca_topic_score_gemma":0.0017220639,"teacher_disagreement_score":0.0028087117,"about_ca_system_score_codex":0.0008007998,"about_ca_system_score_gemma":0.0008443487,"threshold_uncertainty_score":0.009396076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5731982,0.00048189858,0.37163517,0.0025946917,0.00012958219,0.000063199645,0.00044182065,0.00035990984,0.051095508],"genre_scores_gemma":[0.98194814,0.00017182685,0.013304718,0.00017207561,0.0001183148,0.00006304336,0.0001929099,0.00007047604,0.0039583542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804974,0.0004426194,0.00013815904,0.0005484046,0.00052464596,0.00029640945],"domain_scores_gemma":[0.98987496,0.0059356275,0.0013507596,0.0014864117,0.0007644992,0.0005877661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018994929,0.00041107245,0.00068720017,0.0011717561,0.0012465549,0.0022123798,0.0009169626,0.0012581528,0.0068397634],"category_scores_gemma":[0.0122548025,0.00040498094,0.00065823743,0.0008402098,0.006181403,0.009148319,0.002620218,0.0022742483,0.00085824373],"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.00018417269,0.00003667537,0.0014760706,0.00008104027,0.000016369017,0.00013305803,0.00035922194,0.002884448,0.006578605,0.9768951,0.0006198629,0.010735366],"study_design_scores_gemma":[0.000020436448,0.000071322465,0.0007835064,0.000018582788,0.00000919279,0.0002325421,0.00024302362,0.019486358,0.0068229428,0.97060746,0.0016739423,0.000030776155],"about_ca_topic_score_codex":0.00026811013,"about_ca_topic_score_gemma":0.00020715813,"teacher_disagreement_score":0.0068397634,"about_ca_system_score_codex":0.0006405572,"about_ca_system_score_gemma":0.00068000524,"threshold_uncertainty_score":0.02288127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17063995,0.00049584283,0.8048102,0.0017606125,0.000081550774,0.00017505325,0.00023333078,0.0015207985,0.020282652],"genre_scores_gemma":[0.7480895,0.00038905098,0.24359947,0.0001786791,0.00007498951,0.00016352416,0.00033804818,0.00016437315,0.007002354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988269,0.00028522225,0.0000861394,0.00024588214,0.00030822915,0.00024766673],"domain_scores_gemma":[0.99676174,0.00166685,0.00032800957,0.000835596,0.0002753037,0.0001325578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010225709,0.0004157624,0.0006786266,0.00068454474,0.0009834208,0.0020135571,0.001277222,0.0009100184,0.005487819],"category_scores_gemma":[0.006265566,0.00030746506,0.0007890114,0.0011357854,0.0017856227,0.005472946,0.0031198126,0.0017034188,0.00071980973],"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.00018641524,0.00007491311,0.0006174811,0.0001668668,0.00003270343,0.000069331545,0.0003400335,0.08621811,0.0044100927,0.8513106,0.0035813267,0.05299207],"study_design_scores_gemma":[0.000062129024,0.00004941251,0.00021863035,0.000017610173,0.000015932545,0.000058866066,0.00012295342,0.38804084,0.0043692016,0.60222465,0.004799888,0.0000199097],"about_ca_topic_score_codex":0.0019327704,"about_ca_topic_score_gemma":0.0019793117,"teacher_disagreement_score":0.005487819,"about_ca_system_score_codex":0.0027681105,"about_ca_system_score_gemma":0.0019697337,"threshold_uncertainty_score":0.020084143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017126337,0.000176292,0.978294,0.00017875561,0.000050326515,0.000022317756,0.00001784513,0.00025646057,0.0038775958],"genre_scores_gemma":[0.51337093,0.00037453978,0.48331353,0.00016600823,0.00006781033,0.000075673655,0.000048235877,0.00009241327,0.0024909338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991511,0.00021468019,0.000047624995,0.00015450406,0.00037524107,0.000056920944],"domain_scores_gemma":[0.99914336,0.00034680465,0.00010313589,0.0002650314,0.00011778354,0.000023888224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093486323,0.00039815917,0.0004109496,0.00043227864,0.00035598612,0.0010666182,0.0009327808,0.00077070144,0.001591613],"category_scores_gemma":[0.0037016934,0.00024596724,0.00025564738,0.00063443073,0.0013032791,0.0024051436,0.0014113118,0.0011554692,0.00044127816],"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.0002698146,0.000063834086,0.0006145451,0.00016902329,0.00003478917,0.00007532534,0.00019225571,0.07566949,0.061845765,0.6894415,0.001455474,0.17016806],"study_design_scores_gemma":[0.00006476535,0.00011725868,0.0002482648,0.000040168758,0.000023824727,0.00013900519,0.000032386582,0.77925426,0.057413857,0.15389611,0.008713535,0.000056562167],"about_ca_topic_score_codex":0.00045648924,"about_ca_topic_score_gemma":0.00044744805,"teacher_disagreement_score":0.001591613,"about_ca_system_score_codex":0.0005007615,"about_ca_system_score_gemma":0.0006962698,"threshold_uncertainty_score":0.005324483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57697916,0.00086926745,0.4023789,0.00052417885,0.00005885733,0.000076037424,0.0003779148,0.00044623195,0.01828945],"genre_scores_gemma":[0.9821848,0.00027813506,0.014558554,0.00005922577,0.00005198014,0.000055062577,0.00018447955,0.000049142564,0.002578618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928397,0.0001541193,0.000048514295,0.00012421778,0.00024367606,0.00014548785],"domain_scores_gemma":[0.99671173,0.0014945263,0.0005635447,0.00060294097,0.00034730972,0.00027993802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095976837,0.00046077673,0.0005948464,0.0011298583,0.0006729772,0.0011167405,0.000647124,0.0005533182,0.0018970121],"category_scores_gemma":[0.0066772723,0.0003367086,0.00041858415,0.000709599,0.0018436558,0.002029278,0.0023419345,0.0008023699,0.00032515393],"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.00024593237,0.000044219658,0.0010142581,0.00009368821,0.000039475126,0.00021863413,0.00027707405,0.06550051,0.024239656,0.8898523,0.00067583006,0.017798519],"study_design_scores_gemma":[0.00005563397,0.00010383083,0.00086232444,0.000040660118,0.00002908942,0.00034670735,0.00007402559,0.5806226,0.040051714,0.37527803,0.002480293,0.00005500139],"about_ca_topic_score_codex":0.00060096756,"about_ca_topic_score_gemma":0.00036652925,"teacher_disagreement_score":0.0018970121,"about_ca_system_score_codex":0.0009270943,"about_ca_system_score_gemma":0.00067313085,"threshold_uncertainty_score":0.006726563},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08186919,0.00039900304,0.88497174,0.0017297977,0.0002747066,0.00045146528,0.0005181592,0.0025012228,0.027284708],"genre_scores_gemma":[0.57024664,0.00033439483,0.41929424,0.00038945462,0.00007882494,0.00039635005,0.0004143936,0.00017920951,0.008666461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945754,0.00008559441,0.000027352062,0.00009453526,0.00021111427,0.00012379739],"domain_scores_gemma":[0.99973875,0.00010039127,0.000020857484,0.000075792246,0.000042944655,0.000021279735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047617377,0.00047047224,0.00072503963,0.00028866038,0.0009007633,0.0009747796,0.000979808,0.0009518438,0.014651507],"category_scores_gemma":[0.0012886506,0.0002792828,0.000627081,0.0004569658,0.0010460394,0.0021732883,0.001161832,0.0010229747,0.0014825149],"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.0007561664,0.00027960702,0.0007528813,0.00053646014,0.000069757014,0.0003314708,0.0004312564,0.056204457,0.044765204,0.76810193,0.01191109,0.11585974],"study_design_scores_gemma":[0.0005221844,0.0006685956,0.00083590636,0.00014468208,0.00010294466,0.00062591804,0.0001569961,0.40687063,0.07003033,0.47556192,0.04434286,0.00013707097],"about_ca_topic_score_codex":0.0009559878,"about_ca_topic_score_gemma":0.0015366458,"teacher_disagreement_score":0.014651507,"about_ca_system_score_codex":0.0009690491,"about_ca_system_score_gemma":0.001388877,"threshold_uncertainty_score":0.04901415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4974768,0.00041887144,0.45516694,0.00092240574,0.000079868136,0.00020963034,0.0003088187,0.00025286546,0.045163825],"genre_scores_gemma":[0.9816296,0.00014102044,0.012676834,0.000095845295,0.00007109289,0.00017759846,0.00012192888,0.00005039664,0.0050355834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995861,0.0012412536,0.00023213334,0.000655251,0.0013418093,0.00066858326],"domain_scores_gemma":[0.98863846,0.0055064126,0.0017485053,0.0019571446,0.0012275258,0.00092196005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003208352,0.0005902633,0.0010597672,0.0011760702,0.0016036158,0.002798774,0.0015613694,0.0010658756,0.006466586],"category_scores_gemma":[0.009935668,0.00044212598,0.0010166973,0.0011203511,0.0057291356,0.007700798,0.0041434783,0.0023514903,0.0006603134],"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.00007582174,0.000037287133,0.00040647807,0.000044871984,0.0000135561695,0.00013883052,0.00024715773,0.006258352,0.002769786,0.98626596,0.0002833661,0.00345853],"study_design_scores_gemma":[0.000037468817,0.0001459189,0.00063547515,0.000032521388,0.000022571312,0.00027996275,0.0002692134,0.10562591,0.0044825193,0.88619757,0.0022276016,0.0000432603],"about_ca_topic_score_codex":0.0004305682,"about_ca_topic_score_gemma":0.00021317354,"teacher_disagreement_score":0.006466586,"about_ca_system_score_codex":0.0010778235,"about_ca_system_score_gemma":0.0009020426,"threshold_uncertainty_score":0.02163291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22654283,0.00056029443,0.64999115,0.004670461,0.00036475988,0.00031386298,0.0005397438,0.00057846337,0.11643838],"genre_scores_gemma":[0.9224671,0.00056077586,0.05540054,0.0007529667,0.00035016405,0.00027014682,0.0007466398,0.00031388112,0.019137762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971506,0.00059544586,0.00018426747,0.00052289065,0.0010136828,0.0005331646],"domain_scores_gemma":[0.9961175,0.002008303,0.00018837622,0.0009880794,0.00041630593,0.00028152097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017457197,0.00071067305,0.00094431406,0.00075828336,0.0015835365,0.0034106567,0.0024897878,0.0020263137,0.009565595],"category_scores_gemma":[0.0065368,0.00043398197,0.00231348,0.0009509719,0.0036496697,0.008138278,0.00622756,0.006114331,0.0013233274],"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.000041864925,0.00005050924,0.00023346039,0.00008390383,0.000019652409,0.00014897116,0.0002860291,0.0035821884,0.0015238934,0.9841738,0.0018191106,0.008036664],"study_design_scores_gemma":[0.000019763049,0.00001577867,0.00011576617,0.000009890949,0.000015187113,0.00012839712,0.00013236163,0.01576636,0.0023203762,0.9792125,0.0022484155,0.000015246191],"about_ca_topic_score_codex":0.00082220417,"about_ca_topic_score_gemma":0.000595665,"teacher_disagreement_score":0.009565595,"about_ca_system_score_codex":0.0013133292,"about_ca_system_score_gemma":0.001332298,"threshold_uncertainty_score":0.032000065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89220405,0.00047906468,0.08739312,0.00030829594,0.000020689327,0.000042273216,0.00009569431,0.00019702893,0.019259717],"genre_scores_gemma":[0.99421364,0.00012133798,0.0046881386,0.000032745116,0.000012527235,0.000025026067,0.000030319165,0.0000368289,0.0008393254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00029825,0.000025702311,0.00013726455,0.0001890973,0.00020076371],"domain_scores_gemma":[0.9938147,0.004465089,0.0005974853,0.0007113749,0.00019517713,0.00021620339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013716376,0.00046886833,0.0006556551,0.00079399656,0.0006870535,0.0012695332,0.000710278,0.00067417766,0.0032855524],"category_scores_gemma":[0.0051900675,0.0002749966,0.00041676994,0.00047034599,0.004433111,0.0027955887,0.0026764646,0.0013946831,0.00020394394],"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.0008093218,0.00013847872,0.0052239373,0.00034514503,0.00008833315,0.00078317407,0.0009935433,0.11090633,0.06332323,0.7898111,0.0007114935,0.026865872],"study_design_scores_gemma":[0.00010375517,0.0007835889,0.005361504,0.000086267355,0.00012470275,0.00043773468,0.00055940583,0.4094933,0.07811859,0.50271493,0.002086448,0.00012984606],"about_ca_topic_score_codex":0.00034614635,"about_ca_topic_score_gemma":0.00041269796,"teacher_disagreement_score":0.0032855524,"about_ca_system_score_codex":0.0006705218,"about_ca_system_score_gemma":0.00027095847,"threshold_uncertainty_score":0.010991275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044834197,0.10009901,0.33473802,0.17504524,0.011373133,0.00008160149,0.00021148827,0.00037597324,0.3332414],"genre_scores_gemma":[0.79623735,0.053223886,0.07048402,0.019484842,0.015859958,0.0001452002,0.000097521675,0.0001738583,0.04429345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.00024655293,0.00002982416,0.000110188244,0.0002541454,0.00006758618],"domain_scores_gemma":[0.9987676,0.0007910993,0.00008354339,0.00017930864,0.00013669301,0.000041707386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012459862,0.00025533853,0.00039920188,0.0004281244,0.0011400556,0.0017143274,0.0006727525,0.002192829,0.0036563708],"category_scores_gemma":[0.0032853398,0.00020830077,0.00026815105,0.0003552577,0.006277287,0.005837024,0.001477108,0.002268643,0.0005266713],"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.000008781409,0.000005169926,0.00003322753,0.000046397516,0.0000032230685,0.000045428995,0.00013273444,0.0004805015,0.0009863938,0.9890882,0.0024857894,0.006684308],"study_design_scores_gemma":[0.000007037729,0.000019770052,0.00010637945,0.000049918614,0.0000045281663,0.00011148853,0.00008636225,0.00247321,0.0014408363,0.9439415,0.05174418,0.000014681097],"about_ca_topic_score_codex":0.0003056157,"about_ca_topic_score_gemma":0.00028134923,"teacher_disagreement_score":0.0036563708,"about_ca_system_score_codex":0.00083664537,"about_ca_system_score_gemma":0.00042050745,"threshold_uncertainty_score":0.012231708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37876436,0.00037640822,0.6133163,0.0004832269,0.00005660364,0.00005940967,0.0000396639,0.0002238916,0.0066800904],"genre_scores_gemma":[0.98964685,0.00008448323,0.009188537,0.00003853377,0.0000106881935,0.000023779554,0.000011607756,0.000008684635,0.0009867803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998379,0.000042097687,0.0000062367385,0.000040285522,0.000035005345,0.000038503455],"domain_scores_gemma":[0.999263,0.00043047083,0.00012699822,0.0000657427,0.00006447647,0.00004938051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056395936,0.00027735106,0.00026627394,0.00016278902,0.00034662517,0.00041034693,0.0005137018,0.00046350603,0.0009542961],"category_scores_gemma":[0.0017826699,0.00010208351,0.00014817351,0.00019458462,0.001073719,0.0006256838,0.0009935744,0.00043313744,0.0000960131],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003962344,0.0001678535,0.001296557,0.00015702679,0.000049053186,0.00030189008,0.00037813172,0.65493363,0.102121495,0.1929292,0.0007683604,0.04650054],"study_design_scores_gemma":[0.00004706872,0.00019150585,0.00022934221,0.0000058920987,0.000009899484,0.000028697088,0.00002264753,0.9593809,0.0118883075,0.027615257,0.0005683706,0.000012020811],"about_ca_topic_score_codex":0.0013224743,"about_ca_topic_score_gemma":0.0010895624,"teacher_disagreement_score":0.0013224743,"about_ca_system_score_codex":0.00045860655,"about_ca_system_score_gemma":0.00049780816,"threshold_uncertainty_score":0.003327489},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49788946,0.00017182082,0.4860601,0.0004328872,0.00007843506,0.000057064353,0.00008066111,0.0006270327,0.014602548],"genre_scores_gemma":[0.9766583,0.000045738474,0.021488886,0.000048321486,0.000013986759,0.000030489668,0.000025965239,0.000019951478,0.0016683731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992499,0.00019648201,0.000040381765,0.00009783312,0.00024851086,0.00016692778],"domain_scores_gemma":[0.9980102,0.00097121816,0.00027324448,0.00042094715,0.00020155187,0.00012286274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553314,0.00019819516,0.0005665295,0.00032342045,0.0005741133,0.0007635684,0.0007841603,0.00059843174,0.0024358786],"category_scores_gemma":[0.0034007777,0.00017444666,0.0002649851,0.00037857075,0.0014228616,0.001758124,0.001683546,0.00079716236,0.00032379653],"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.00035187317,0.00010110586,0.00082834845,0.00008321533,0.000020061685,0.00026904375,0.00022250589,0.4012004,0.023120796,0.5500052,0.0010195256,0.022777958],"study_design_scores_gemma":[0.000017669287,0.000058550177,0.00012400937,0.0000062763224,0.0000034809318,0.000046921017,0.000021361393,0.886502,0.008907256,0.103744425,0.000553676,0.000014359344],"about_ca_topic_score_codex":0.00051890657,"about_ca_topic_score_gemma":0.0004944722,"teacher_disagreement_score":0.0024358786,"about_ca_system_score_codex":0.00061079866,"about_ca_system_score_gemma":0.00036806625,"threshold_uncertainty_score":0.008148849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53410065,0.0018469468,0.3382704,0.025071708,0.0004018072,0.00024924593,0.0035969934,0.0012951813,0.095167086],"genre_scores_gemma":[0.95487756,0.00065163913,0.033402212,0.0011566149,0.00034888764,0.00024362611,0.0019190677,0.00017391425,0.0072263833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669623,0.0008941635,0.00017104318,0.00091512006,0.0008791028,0.00044424456],"domain_scores_gemma":[0.98166156,0.015091302,0.00072872924,0.0012474247,0.0006441482,0.000626948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935036,0.00087617204,0.0016546951,0.0006500844,0.0022332093,0.004345224,0.0031985692,0.0022430548,0.006066242],"category_scores_gemma":[0.012506689,0.0008728535,0.0017366938,0.0012145235,0.004892207,0.008284708,0.0046740985,0.009299481,0.0007330201],"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.001425787,0.0006580746,0.002909024,0.0009966743,0.00025830633,0.0008026532,0.0012000566,0.13590305,0.0126991905,0.7714189,0.024186162,0.0475421],"study_design_scores_gemma":[0.00015569736,0.00005679413,0.0006408768,0.000034813278,0.00003979754,0.00020953327,0.00020203034,0.131861,0.0041372715,0.8580798,0.004551183,0.000031250438],"about_ca_topic_score_codex":0.0020348693,"about_ca_topic_score_gemma":0.0015929851,"teacher_disagreement_score":0.006066242,"about_ca_system_score_codex":0.002311767,"about_ca_system_score_gemma":0.0019120743,"threshold_uncertainty_score":0.020293593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28346997,0.0006594006,0.69184,0.00037017377,0.00017308843,0.00014560239,0.00021791237,0.0009639672,0.02215988],"genre_scores_gemma":[0.89970094,0.00015600951,0.09734953,0.00010269184,0.00002506952,0.00010266501,0.00011501533,0.00009031652,0.00235783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933785,0.00013536288,0.000052961666,0.00016412386,0.00017850833,0.00013116906],"domain_scores_gemma":[0.99935347,0.00029642123,0.000068876674,0.00018907976,0.000055262943,0.000036935475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000527991,0.00035624005,0.0005944485,0.00033775877,0.0005079369,0.0011633442,0.0010109325,0.0006110129,0.0033020568],"category_scores_gemma":[0.001998633,0.00022364441,0.0005962626,0.0004304785,0.0009294934,0.0016882834,0.0010392849,0.00078677735,0.00046782033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005978922,0.0001578309,0.00077744306,0.0004452203,0.000084393665,0.00027405418,0.00030407964,0.09183409,0.06574679,0.72020847,0.0021091134,0.117460646],"study_design_scores_gemma":[0.00013199485,0.00029997126,0.0002835115,0.00005532762,0.000044874265,0.00015619295,0.00007849697,0.55323625,0.14501671,0.29512703,0.0055247243,0.00004484757],"about_ca_topic_score_codex":0.00041205937,"about_ca_topic_score_gemma":0.0005464892,"teacher_disagreement_score":0.0033020568,"about_ca_system_score_codex":0.0006424056,"about_ca_system_score_gemma":0.00067151006,"threshold_uncertainty_score":0.011046529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12982929,0.004125833,0.70371264,0.016425926,0.00084670447,0.0009006355,0.00064155535,0.0014549036,0.14206243],"genre_scores_gemma":[0.91510504,0.0030921511,0.06396123,0.0018230171,0.00063051947,0.0008547316,0.00024577472,0.00016289038,0.0141245825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99462765,0.0017432084,0.0003041961,0.0004919945,0.002208723,0.0006242008],"domain_scores_gemma":[0.9963924,0.001598065,0.0003133113,0.0013046361,0.0002827445,0.00010887578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025117933,0.0010602959,0.0006973263,0.0015861916,0.002787404,0.0029084797,0.0013810049,0.0035710689,0.0035032788],"category_scores_gemma":[0.009290247,0.0008026907,0.0019116519,0.0017503051,0.00490242,0.0063867224,0.0051693516,0.005223395,0.0009305988],"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.00011341208,0.000043229196,0.0003335036,0.00012305859,0.00003678322,0.0002939459,0.0005464471,0.010751936,0.005294366,0.96112734,0.0035997527,0.017736185],"study_design_scores_gemma":[0.00011777494,0.00011282965,0.00031056683,0.00011062265,0.000052885072,0.00066638895,0.00013993966,0.1804362,0.018761702,0.75309724,0.046126284,0.00006754769],"about_ca_topic_score_codex":0.000623405,"about_ca_topic_score_gemma":0.00019945108,"teacher_disagreement_score":0.0035710689,"about_ca_system_score_codex":0.0017572306,"about_ca_system_score_gemma":0.00081846566,"threshold_uncertainty_score":0.013283849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76427937,0.0046295174,0.16748321,0.0014384615,0.00012545197,0.000039996645,0.00011177911,0.00033558687,0.06155658],"genre_scores_gemma":[0.99308103,0.00057877495,0.0052721305,0.000056851244,0.000075275304,0.00003560083,0.00004244667,0.00004572772,0.00081215345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942315,0.00013411997,0.000023360719,0.00009832989,0.0002300108,0.00009098765],"domain_scores_gemma":[0.9978429,0.0011265972,0.00030681305,0.00036585823,0.0001666781,0.00019116793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010101777,0.00051155547,0.00067992194,0.0018001195,0.0010528318,0.0016358137,0.001043308,0.0008800049,0.002412042],"category_scores_gemma":[0.005712382,0.00036347276,0.0004144769,0.00066757755,0.0050117513,0.0048038787,0.0019453871,0.0013733519,0.0002404374],"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.000014085637,0.000024978548,0.0005159349,0.000052142546,0.000008853236,0.000103505554,0.00010583115,0.012051573,0.0021892034,0.9824912,0.00020496681,0.0022377605],"study_design_scores_gemma":[0.0000061718065,0.000026101754,0.0009346315,0.000040500625,0.000006527262,0.00016658708,0.000063476975,0.13851121,0.0018498964,0.8575914,0.00077398337,0.000029630268],"about_ca_topic_score_codex":0.0004581321,"about_ca_topic_score_gemma":0.00034574975,"teacher_disagreement_score":0.002412042,"about_ca_system_score_codex":0.0008326303,"about_ca_system_score_gemma":0.00029386076,"threshold_uncertainty_score":0.008069098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11390717,0.00032008713,0.8802558,0.0002622815,0.000035260342,0.00009357422,0.00005996654,0.00023788218,0.0048279776],"genre_scores_gemma":[0.8236032,0.00024152618,0.1736936,0.000105327665,0.000029012108,0.00014433745,0.0000640947,0.000047987407,0.0020709082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597895,0.001382386,0.00028543995,0.00063424837,0.0011408085,0.0005781534],"domain_scores_gemma":[0.9896208,0.006041065,0.0011649559,0.002158816,0.00068769587,0.0003266114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003617326,0.00088346034,0.0012409266,0.0011396115,0.0009936814,0.0017273839,0.0017066792,0.001832588,0.0015515863],"category_scores_gemma":[0.014163362,0.0005947024,0.0007539737,0.0011130478,0.0029502134,0.0038523523,0.0035760878,0.0014026926,0.00034906968],"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.0004990195,0.000116466574,0.0010406577,0.00014633642,0.00008896862,0.00018032435,0.00041054178,0.14357163,0.015881196,0.7612512,0.00097551424,0.075838156],"study_design_scores_gemma":[0.00007506926,0.00025891155,0.00036937985,0.000051624123,0.0000666006,0.00022736494,0.00016892934,0.6395287,0.031884618,0.3252239,0.0020458982,0.00009906534],"about_ca_topic_score_codex":0.0005707371,"about_ca_topic_score_gemma":0.00045599544,"teacher_disagreement_score":0.003617326,"about_ca_system_score_codex":0.0013814784,"about_ca_system_score_gemma":0.0013933211,"threshold_uncertainty_score":0.019130528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30287975,0.0007699682,0.6519946,0.0028214457,0.00024466787,0.00009824695,0.00032649317,0.00068653526,0.04017837],"genre_scores_gemma":[0.92784494,0.00022910589,0.066692956,0.00023719342,0.00005973125,0.00009955528,0.00012662834,0.00006927117,0.0046406467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983303,0.0005520924,0.000076532946,0.0002948986,0.00038691374,0.00035929447],"domain_scores_gemma":[0.9980732,0.0007924681,0.0001114168,0.0007746282,0.00013477168,0.00011343393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017583768,0.00036034998,0.0007663158,0.00047674534,0.0010423914,0.0018419718,0.001396963,0.0009460647,0.0025656107],"category_scores_gemma":[0.0037174802,0.00042900923,0.00088542857,0.00064626796,0.005138882,0.004621551,0.0036246344,0.002864875,0.00040572713],"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.000062432664,0.000020000536,0.000115470044,0.000023078002,0.000007830449,0.000044665532,0.00012107922,0.0075149443,0.001488299,0.9870003,0.00034747124,0.0032543882],"study_design_scores_gemma":[0.00003827584,0.000038873553,0.00007221781,0.000020726968,0.000011682148,0.000031714815,0.000040085506,0.1148484,0.002704286,0.8803651,0.0018091568,0.000019537327],"about_ca_topic_score_codex":0.0012361842,"about_ca_topic_score_gemma":0.0009645343,"teacher_disagreement_score":0.0025656107,"about_ca_system_score_codex":0.0012271467,"about_ca_system_score_gemma":0.0014800535,"threshold_uncertainty_score":0.009299338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2566922,0.0068543046,0.63988024,0.0028881568,0.00031731467,0.00010266647,0.00034457125,0.00024397297,0.09267654],"genre_scores_gemma":[0.9681845,0.0020055831,0.025979953,0.00019937805,0.00037468437,0.00009835417,0.00014473114,0.00007467441,0.0029381295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740463,0.0008119562,0.00010552267,0.00049498316,0.0008287132,0.0003541759],"domain_scores_gemma":[0.98581785,0.010715911,0.0012377589,0.0011309938,0.00070268515,0.0003948648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024744386,0.00065362954,0.00067682454,0.004047105,0.0009838729,0.0022703866,0.0011039849,0.0009794029,0.0043609035],"category_scores_gemma":[0.01599161,0.00038250623,0.0005712626,0.0018810781,0.0060360283,0.0071735596,0.0029745332,0.0020541414,0.00035351393],"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.000017130313,0.00001518145,0.00055426074,0.000046226443,0.000014186124,0.000039891056,0.00010302899,0.01147896,0.0009374886,0.98171747,0.0002645775,0.0048115947],"study_design_scores_gemma":[0.000004308594,0.00002318818,0.000886266,0.00001990014,0.000006662547,0.00008647203,0.000051407464,0.031159004,0.0007665514,0.96565306,0.0013184279,0.000024817618],"about_ca_topic_score_codex":0.00031445056,"about_ca_topic_score_gemma":0.00025597544,"teacher_disagreement_score":0.0043609035,"about_ca_system_score_codex":0.0015879415,"about_ca_system_score_gemma":0.0005366159,"threshold_uncertainty_score":0.014588714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13054816,0.00096104987,0.8356882,0.0023313025,0.0003359883,0.0000842444,0.00019335428,0.0009493421,0.028908268],"genre_scores_gemma":[0.9635432,0.00031804363,0.03270935,0.00032162975,0.00010447476,0.000078018486,0.000069431386,0.000113554765,0.0027422672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947201,0.0006678887,0.00023171776,0.00067463116,0.0028793884,0.00082626834],"domain_scores_gemma":[0.98346496,0.009784551,0.0012734198,0.0030269383,0.0019044809,0.0005456073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035214468,0.00055991637,0.0010105285,0.0009990019,0.0010582916,0.0023508575,0.002222393,0.0015868383,0.0042757676],"category_scores_gemma":[0.026477044,0.000406746,0.0006829134,0.00068626396,0.0043861354,0.0043709585,0.003660375,0.0040997774,0.0008389134],"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.00024056912,0.000055707835,0.0007747677,0.00012546341,0.000026353995,0.00011579547,0.00017081731,0.07064587,0.011425667,0.8984049,0.001570985,0.016443124],"study_design_scores_gemma":[0.000039795872,0.00013691376,0.00039499835,0.00005037055,0.000022218499,0.0001651946,0.000034972145,0.4545034,0.02427276,0.5175938,0.0027380472,0.0000475199],"about_ca_topic_score_codex":0.0007640451,"about_ca_topic_score_gemma":0.00037178255,"teacher_disagreement_score":0.0042757676,"about_ca_system_score_codex":0.002440578,"about_ca_system_score_gemma":0.0014710104,"threshold_uncertainty_score":0.018623412},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45301387,0.0020980763,0.38584957,0.006618552,0.00042475126,0.00013060869,0.0003137881,0.0004199223,0.15113081],"genre_scores_gemma":[0.9726113,0.0005815533,0.022710884,0.00035996482,0.00016771653,0.00013335183,0.000060823833,0.00004507018,0.0033293415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984182,0.0005801962,0.00007538978,0.00026892632,0.00032053626,0.0003367974],"domain_scores_gemma":[0.9960146,0.0025122499,0.00024922797,0.000913423,0.00013727407,0.0001732712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002164735,0.00030965902,0.00064916373,0.00088570954,0.001766268,0.0035755238,0.0010607556,0.001338005,0.0050951415],"category_scores_gemma":[0.006594412,0.00044763854,0.0008412099,0.00079189474,0.0065301424,0.0075281602,0.003070358,0.0026364555,0.0005692968],"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.000034973586,0.000009722572,0.000078790596,0.000019051984,0.0000036109288,0.000023143346,0.0000656515,0.0019726797,0.00074100355,0.99289495,0.0002876548,0.0038687505],"study_design_scores_gemma":[0.000015996126,0.000020957243,0.00008682909,0.000013463474,0.000004499938,0.00004319992,0.00003996513,0.018753199,0.0012550325,0.97843426,0.0013181433,0.000014485417],"about_ca_topic_score_codex":0.00045036987,"about_ca_topic_score_gemma":0.00025196947,"teacher_disagreement_score":0.0050951415,"about_ca_system_score_codex":0.00064486824,"about_ca_system_score_gemma":0.0008033939,"threshold_uncertainty_score":0.017044961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07431091,0.0005733674,0.8598586,0.0026973225,0.0002447797,0.00013957944,0.0005472454,0.00019756978,0.061430726],"genre_scores_gemma":[0.7874156,0.00076804694,0.17336111,0.00044119023,0.00023401946,0.0006139458,0.00040876315,0.0004012521,0.036355987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893373,0.00028005982,0.000040942385,0.00016399304,0.0003346862,0.0002464644],"domain_scores_gemma":[0.99640346,0.002462829,0.00019853505,0.00031802998,0.00042746626,0.00018973259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013210577,0.0008992511,0.0008981525,0.00078383496,0.00084386446,0.0020438002,0.0017056795,0.0019115017,0.020178592],"category_scores_gemma":[0.008372128,0.00051771343,0.0006267949,0.0009820684,0.0016800177,0.0034325554,0.0021996475,0.0027722346,0.0008214379],"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.00007417616,0.00004101095,0.00011462691,0.00008177356,0.000012665923,0.000052891675,0.00006140201,0.1304659,0.00097467256,0.8567698,0.0024877104,0.008863351],"study_design_scores_gemma":[0.000024806015,0.000018791217,0.00009768611,0.000020978638,0.0000068046443,0.000039973365,0.00005057677,0.43024817,0.0007597978,0.5669162,0.0017997453,0.000016459822],"about_ca_topic_score_codex":0.0012781954,"about_ca_topic_score_gemma":0.0014420996,"teacher_disagreement_score":0.020178592,"about_ca_system_score_codex":0.002463771,"about_ca_system_score_gemma":0.0019104241,"threshold_uncertainty_score":0.06750411},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09133702,0.0004637609,0.8883896,0.0011751421,0.00010816778,0.00022872118,0.0001273562,0.0021317923,0.016038418],"genre_scores_gemma":[0.36566448,0.00037856138,0.626445,0.0002207672,0.0000684669,0.00022529949,0.00021339045,0.00012565471,0.0066584144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999495,0.000101725236,0.000028472046,0.00012173058,0.00016248394,0.00009052903],"domain_scores_gemma":[0.99967194,0.00014349588,0.00003154646,0.00009024738,0.000035970304,0.000026806118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004527923,0.0005881826,0.0005850443,0.00037912137,0.00086417835,0.0013221627,0.0013553611,0.0010312707,0.008579785],"category_scores_gemma":[0.0014620356,0.00040807461,0.0005763697,0.0005111719,0.0007268626,0.0032945997,0.0013766827,0.0009719581,0.0013417144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008801888,0.0007268347,0.0016148287,0.00078841613,0.00014758257,0.00040184517,0.00049989717,0.101609945,0.08029488,0.37116763,0.017715756,0.42415214],"study_design_scores_gemma":[0.00055006763,0.00038333653,0.00046814754,0.00007844591,0.00007546839,0.00030566292,0.00016477778,0.7847406,0.029773124,0.16858517,0.014794479,0.00008074455],"about_ca_topic_score_codex":0.001542731,"about_ca_topic_score_gemma":0.0032778115,"teacher_disagreement_score":0.008579785,"about_ca_system_score_codex":0.0011290567,"about_ca_system_score_gemma":0.001837235,"threshold_uncertainty_score":0.028702259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04902072,0.00022415063,0.9325758,0.00093274814,0.00013585895,0.0005947903,0.000090155365,0.0033112818,0.013114434],"genre_scores_gemma":[0.39453653,0.00027057546,0.5933278,0.0005266399,0.00013025758,0.0008267395,0.00020800001,0.0010193285,0.009154148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98737526,0.004262132,0.00071375165,0.0020662337,0.0042254184,0.0013571794],"domain_scores_gemma":[0.9683737,0.02146794,0.0012438628,0.0064255362,0.0017700719,0.00071893405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010579844,0.0012562326,0.0022231531,0.001325232,0.002898864,0.003068366,0.003713339,0.0019525999,0.008911068],"category_scores_gemma":[0.033552222,0.002187832,0.0026795838,0.0014416244,0.006889556,0.013631872,0.010287234,0.0043907226,0.0023889407],"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.001739555,0.0004509656,0.0012628287,0.0005315057,0.00014839305,0.00069480913,0.0017723211,0.08787153,0.014883724,0.82861274,0.002561397,0.05947024],"study_design_scores_gemma":[0.00032069598,0.0001360458,0.00013328981,0.00007020912,0.00009969702,0.00016746101,0.00011073776,0.27546784,0.023779694,0.6936696,0.005978579,0.000066185356],"about_ca_topic_score_codex":0.0022632945,"about_ca_topic_score_gemma":0.0021051082,"teacher_disagreement_score":0.010579844,"about_ca_system_score_codex":0.0028101811,"about_ca_system_score_gemma":0.004565932,"threshold_uncertainty_score":0.05595219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43695167,0.00044361426,0.54937345,0.0006810849,0.000037867285,0.00011901859,0.0002995439,0.0002952764,0.011798473],"genre_scores_gemma":[0.9619918,0.00028849856,0.032308765,0.0001126666,0.0000540015,0.00024166759,0.00029465227,0.00009850826,0.0046093874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890745,0.00030491705,0.00005147694,0.0001767421,0.00029426624,0.0002652515],"domain_scores_gemma":[0.99557734,0.0021934994,0.0007350919,0.0005145323,0.00040815448,0.0005714055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017928103,0.0007034352,0.0008525107,0.0009172422,0.00095402787,0.0016229871,0.0012322242,0.0011939212,0.0046147713],"category_scores_gemma":[0.007234031,0.00043585635,0.0007489542,0.00067355024,0.0019250355,0.0041323584,0.0019287888,0.0020690775,0.00036812434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022866995,0.0000745365,0.00094636093,0.000073407726,0.00002439267,0.00016317682,0.00019842043,0.086178765,0.010120094,0.89670664,0.0005544687,0.0047311396],"study_design_scores_gemma":[0.00003070982,0.000053373788,0.00033199423,0.000014735041,0.000007359288,0.00006949971,0.00004483252,0.7795857,0.0031703666,0.21603319,0.0006282408,0.0000299608],"about_ca_topic_score_codex":0.0012950654,"about_ca_topic_score_gemma":0.00097218546,"teacher_disagreement_score":0.0046147713,"about_ca_system_score_codex":0.0013891133,"about_ca_system_score_gemma":0.0013696653,"threshold_uncertainty_score":0.015437961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08517315,0.00052919413,0.90784585,0.0003487687,0.00009054696,0.00009196111,0.00007537632,0.0005706329,0.005274546],"genre_scores_gemma":[0.84830964,0.0005243499,0.14826822,0.00014011437,0.000041949254,0.00012773141,0.00008006213,0.00020117252,0.0023067999],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977181,0.00047417413,0.00012674723,0.0003252803,0.0010825442,0.00027307365],"domain_scores_gemma":[0.9971523,0.0011265016,0.00035253735,0.0010458992,0.00025853998,0.00006417598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021673609,0.00086007913,0.00073911925,0.0008820351,0.00069017604,0.0018205921,0.001686025,0.0009205539,0.0020618613],"category_scores_gemma":[0.0057170396,0.0005858626,0.0008532542,0.00078582094,0.0024844182,0.0032908455,0.0026632978,0.002828019,0.0006938593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010754882,0.000255509,0.0020646323,0.0004973088,0.000059123795,0.00039988433,0.00051711785,0.14100155,0.41830724,0.3396157,0.0012032848,0.09500311],"study_design_scores_gemma":[0.00008854145,0.000393167,0.00095605926,0.00006294061,0.00004350644,0.00029103254,0.000059527763,0.46616176,0.45939744,0.067651816,0.0047901357,0.00010409248],"about_ca_topic_score_codex":0.00023302785,"about_ca_topic_score_gemma":0.0001688621,"teacher_disagreement_score":0.0021673609,"about_ca_system_score_codex":0.0012905827,"about_ca_system_score_gemma":0.00072507485,"threshold_uncertainty_score":0.011462212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.836292,0.00027180018,0.14594196,0.00034690517,0.00005283277,0.000025411113,0.00008361945,0.00028910115,0.016696282],"genre_scores_gemma":[0.9934168,0.00007098544,0.004854004,0.000028906597,0.00003889103,0.00003409578,0.000024932546,0.000048303093,0.0014830901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907315,0.00021920688,0.00004951532,0.00021341929,0.00021429872,0.00023040568],"domain_scores_gemma":[0.9979188,0.0007760229,0.00046651714,0.00027133792,0.00022781017,0.00033944362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014120458,0.000704315,0.0009952656,0.0013327135,0.0011211482,0.002377098,0.00073452527,0.0008811838,0.00425153],"category_scores_gemma":[0.0037923744,0.00041010723,0.0007894081,0.0005102421,0.0034450807,0.0044031553,0.0020726428,0.0011847753,0.00038075304],"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.000161129,0.00007018157,0.0010354167,0.00007537948,0.00003112483,0.00045420162,0.00043073646,0.011644846,0.01730082,0.96411836,0.00044957537,0.0042282003],"study_design_scores_gemma":[0.00002586199,0.000113987175,0.00132413,0.000021216965,0.000023489652,0.00036955168,0.00017709163,0.09199319,0.009435497,0.8959552,0.00051148195,0.00004927459],"about_ca_topic_score_codex":0.00021098825,"about_ca_topic_score_gemma":0.00019817645,"teacher_disagreement_score":0.00425153,"about_ca_system_score_codex":0.00075564825,"about_ca_system_score_gemma":0.00039899678,"threshold_uncertainty_score":0.014222801},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02407892,0.00038583516,0.9666873,0.0004384779,0.000078762634,0.000034173256,0.000049453374,0.00013307208,0.00811411],"genre_scores_gemma":[0.5394453,0.0018590884,0.4479568,0.00043364885,0.00031114416,0.00018377256,0.00025783823,0.00019770839,0.009354727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987469,0.0004885526,0.000046923928,0.00012917841,0.0004502535,0.0001382214],"domain_scores_gemma":[0.99566346,0.0030252896,0.00025163064,0.00041318304,0.0005647227,0.0000817487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013481112,0.0007787087,0.0008186842,0.00077091844,0.00052062643,0.0009943018,0.0010431618,0.0013319376,0.0018654714],"category_scores_gemma":[0.0118595725,0.00032452992,0.0005153592,0.0014838496,0.0021518604,0.001704936,0.0018120713,0.0014828263,0.0007845691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012432087,0.000043366537,0.00050131086,0.00013114781,0.0000385156,0.00013972785,0.0002641147,0.5621963,0.005210654,0.36358726,0.0020912162,0.06567203],"study_design_scores_gemma":[0.000012298626,0.000026925198,0.00005968053,0.000016511098,0.000006147035,0.00004305705,0.0000144034875,0.82939583,0.002584076,0.16685951,0.00096830714,0.000013269065],"about_ca_topic_score_codex":0.0017892921,"about_ca_topic_score_gemma":0.0014812251,"teacher_disagreement_score":0.0018654714,"about_ca_system_score_codex":0.0006762629,"about_ca_system_score_gemma":0.0011659702,"threshold_uncertainty_score":0.00712955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2386182,0.00062241935,0.7337699,0.0010713674,0.00015388551,0.000060872102,0.00027676605,0.00077786495,0.024648715],"genre_scores_gemma":[0.96602803,0.0001754172,0.030586619,0.00019762677,0.000046079425,0.00005969351,0.0000938629,0.0000921096,0.0027205797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970618,0.00036608469,0.00019343627,0.00035950384,0.0015494291,0.0004697479],"domain_scores_gemma":[0.98868793,0.0067869234,0.0011826415,0.0016440238,0.001286369,0.00041211984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019357337,0.0004472775,0.0007982928,0.00077022344,0.00086322037,0.0018204473,0.0011186347,0.0014306048,0.0035681028],"category_scores_gemma":[0.015884254,0.00031826372,0.00054719753,0.000650402,0.002456954,0.0028243337,0.002916299,0.0021658847,0.0007283297],"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.00021890158,0.000045976467,0.0015966039,0.00010394597,0.000029970286,0.00017495833,0.00025216473,0.23134324,0.016933536,0.7306884,0.0013443843,0.01726793],"study_design_scores_gemma":[0.000019091189,0.000099312536,0.00057226804,0.00003650474,0.000019764853,0.00020313116,0.000033849254,0.6791142,0.022408912,0.29544222,0.001998064,0.000052589392],"about_ca_topic_score_codex":0.0011696139,"about_ca_topic_score_gemma":0.00071739743,"teacher_disagreement_score":0.0035681028,"about_ca_system_score_codex":0.0022597052,"about_ca_system_score_gemma":0.0013179377,"threshold_uncertainty_score":0.01639533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20637387,0.00304757,0.71643156,0.0037697284,0.00018968568,0.00012224483,0.00090100087,0.00052544597,0.06863888],"genre_scores_gemma":[0.9409691,0.0022416422,0.04770309,0.00048259273,0.00037078766,0.00030636822,0.0004198374,0.00028036098,0.007226104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959561,0.00097212184,0.00017386104,0.0006927177,0.0013179665,0.0008871848],"domain_scores_gemma":[0.97318685,0.019494947,0.0012042111,0.002809176,0.0021691767,0.0011355433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042981533,0.0012727773,0.0013735226,0.002027774,0.0017016568,0.0028421879,0.0022198712,0.0013516633,0.005582087],"category_scores_gemma":[0.020830553,0.0006475602,0.0012202965,0.0020179101,0.00717959,0.010969081,0.005239393,0.0054597277,0.00068098644],"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.000073358075,0.00004484952,0.0003744969,0.00008957446,0.000018360555,0.00008796046,0.0001895324,0.02924134,0.0036768578,0.95769835,0.0013818064,0.007123609],"study_design_scores_gemma":[0.0000144809965,0.000050220715,0.00045261794,0.00004880964,0.000019461388,0.00010235307,0.00006545451,0.19687538,0.005018306,0.79555166,0.0017366254,0.00006466851],"about_ca_topic_score_codex":0.0018214413,"about_ca_topic_score_gemma":0.0013717584,"teacher_disagreement_score":0.005582087,"about_ca_system_score_codex":0.002906405,"about_ca_system_score_gemma":0.0019242155,"threshold_uncertainty_score":0.022731066},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102150865,0.0031649836,0.81732684,0.006542162,0.0003212019,0.00027881656,0.0002313912,0.00064874726,0.06933493],"genre_scores_gemma":[0.88145804,0.0036772732,0.09961532,0.0011466169,0.00048100686,0.00070705486,0.00032835448,0.00030957267,0.012276639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99471277,0.001624482,0.00027934622,0.0008092912,0.0018963233,0.0006777618],"domain_scores_gemma":[0.9718393,0.021465145,0.0016031209,0.0030556547,0.0012464811,0.00079029135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054417085,0.00103123,0.0018324492,0.0023401768,0.0035757686,0.0048959157,0.0031899423,0.0034619987,0.0037975553],"category_scores_gemma":[0.02345047,0.00135435,0.0011318248,0.0021187924,0.011290091,0.018002454,0.00879236,0.007883395,0.0007362366],"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.00012387722,0.000034060165,0.000086297594,0.00006371894,0.000014169131,0.00010240043,0.00030231703,0.0067410553,0.00078248256,0.98727965,0.00066839665,0.0038016362],"study_design_scores_gemma":[0.000066889465,0.00005148646,0.00005477758,0.00008181903,0.000021056034,0.00011055735,0.00007500673,0.04380807,0.0015784288,0.95041555,0.0037104525,0.000025918662],"about_ca_topic_score_codex":0.00042086258,"about_ca_topic_score_gemma":0.00028515313,"teacher_disagreement_score":0.0054417085,"about_ca_system_score_codex":0.0021398051,"about_ca_system_score_gemma":0.0017726278,"threshold_uncertainty_score":0.028778851},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7439867,0.0008830153,0.2259365,0.0014345668,0.00008282043,0.00006312687,0.00015207926,0.000343475,0.027117603],"genre_scores_gemma":[0.9911109,0.00027995353,0.0069507537,0.000089569105,0.000040131275,0.000026392378,0.00003674325,0.000033407094,0.0014320442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992269,0.00033331104,0.000029415507,0.0000997045,0.00016901677,0.00014157589],"domain_scores_gemma":[0.99359906,0.0041242978,0.0008565623,0.00045101647,0.0004645343,0.0005044574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010809633,0.00056248123,0.0005830003,0.0010757021,0.0011043156,0.0017942231,0.00054172723,0.0008184883,0.002252086],"category_scores_gemma":[0.006846423,0.00037540728,0.00039462847,0.00043468623,0.0036102233,0.0027139387,0.0020592373,0.0017467464,0.00022183584],"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.00009006223,0.00003464194,0.0008322431,0.000054235825,0.000022093021,0.00019890207,0.00028342404,0.08411433,0.0074469615,0.9042121,0.0005202973,0.0021907769],"study_design_scores_gemma":[0.000024024124,0.000067995265,0.0006470845,0.00003231483,0.000011475305,0.00024139056,0.00013907286,0.4646662,0.002839984,0.53042465,0.0008476342,0.000058088477],"about_ca_topic_score_codex":0.0009102373,"about_ca_topic_score_gemma":0.0005241073,"teacher_disagreement_score":0.002252086,"about_ca_system_score_codex":0.0010454939,"about_ca_system_score_gemma":0.0005111838,"threshold_uncertainty_score":0.0075856447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084491655,0.00083005434,0.84667003,0.0027822529,0.00032819124,0.00011163995,0.0006513208,0.00041495726,0.063719936],"genre_scores_gemma":[0.8857225,0.0011493339,0.09648052,0.0007618885,0.00048452025,0.0002205813,0.00038927936,0.00030070407,0.014490687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730897,0.00084233005,0.00013932704,0.0004951389,0.0007055377,0.00050874025],"domain_scores_gemma":[0.9960808,0.0016414272,0.00062115025,0.00090123265,0.00045982833,0.00029562865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022448706,0.0008189298,0.0007455148,0.0015717212,0.0018920457,0.0046551344,0.0014216988,0.002268194,0.0072812634],"category_scores_gemma":[0.007172147,0.00049117726,0.0011196279,0.0017474488,0.00918357,0.012599356,0.0032378817,0.0043869973,0.0010196291],"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.000008535219,0.000004534958,0.000030097743,0.000006914154,0.0000013724504,0.000014267573,0.000031004824,0.0005783395,0.00014332849,0.9978956,0.0002044758,0.0010814324],"study_design_scores_gemma":[0.0000047303774,0.000010611101,0.000038203405,0.0000072257358,0.0000024146284,0.000058338406,0.000030471805,0.006467636,0.00044440795,0.9916046,0.0013198723,0.00001136331],"about_ca_topic_score_codex":0.0007505024,"about_ca_topic_score_gemma":0.00045394796,"teacher_disagreement_score":0.0072812634,"about_ca_system_score_codex":0.0013323716,"about_ca_system_score_gemma":0.0011425654,"threshold_uncertainty_score":0.024358273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80271244,0.00022482414,0.10937491,0.0007623014,0.0002105459,0.000084351435,0.0001469476,0.00027851734,0.08620524],"genre_scores_gemma":[0.98550665,0.00007720155,0.007885962,0.00012268078,0.000074820455,0.000032009357,0.000051804127,0.000030625506,0.006218126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991418,0.00018023989,0.000046992427,0.00017349295,0.00023458846,0.00022269925],"domain_scores_gemma":[0.9991416,0.00023214122,0.00013363999,0.00024247656,0.000100900405,0.00014928562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000766387,0.00027503722,0.00029532067,0.00090502255,0.0010550442,0.0017336245,0.00039537688,0.0006093848,0.0044355],"category_scores_gemma":[0.0017810693,0.00019063368,0.00068756804,0.00037214265,0.0036891915,0.0019383543,0.001586113,0.0009909505,0.00045337126],"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.000013929128,0.000008247165,0.00024639608,0.000008553666,0.0000036734064,0.000056906745,0.00018306186,0.00044282703,0.0015831523,0.9943112,0.00019081442,0.0029511766],"study_design_scores_gemma":[0.000016407033,0.00006112578,0.00080481276,0.000012892726,0.0000058679384,0.00018653649,0.00017355719,0.006689137,0.0038874857,0.98227847,0.005865452,0.000018218698],"about_ca_topic_score_codex":0.00041880226,"about_ca_topic_score_gemma":0.0001926183,"teacher_disagreement_score":0.0044355,"about_ca_system_score_codex":0.0007851102,"about_ca_system_score_gemma":0.00047432727,"threshold_uncertainty_score":0.014838278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29598412,0.0013510156,0.6678208,0.004220618,0.0004727627,0.000085719534,0.000107443295,0.0017205182,0.028236942],"genre_scores_gemma":[0.93445677,0.00039867387,0.062095277,0.0002626428,0.00015453232,0.000079533515,0.00004603732,0.00012593088,0.0023806712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986369,0.00030560174,0.00005344267,0.00019332086,0.0006141158,0.00019654432],"domain_scores_gemma":[0.99337363,0.003940642,0.0003498996,0.0016203931,0.00045477285,0.00026065196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011875564,0.00041238437,0.0008706229,0.0005464241,0.0007172932,0.0013622339,0.001363097,0.0011109075,0.002421036],"category_scores_gemma":[0.013833537,0.00026472402,0.00040525108,0.0006715402,0.0018228117,0.0042566033,0.0016377143,0.0019332819,0.00043703435],"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.00042759278,0.000104883686,0.00046450624,0.00021429069,0.000033064014,0.00017461479,0.00015019297,0.09670055,0.024165457,0.8439297,0.0026061123,0.031028891],"study_design_scores_gemma":[0.000053457243,0.000088984205,0.00022750733,0.000028112663,0.000020016567,0.0001712958,0.00003360505,0.44111487,0.011460803,0.54385734,0.0029222427,0.000021769116],"about_ca_topic_score_codex":0.00023464045,"about_ca_topic_score_gemma":0.00018367123,"teacher_disagreement_score":0.002421036,"about_ca_system_score_codex":0.001283209,"about_ca_system_score_gemma":0.0007472193,"threshold_uncertainty_score":0.009310424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31285667,0.00011587694,0.6793268,0.0011183004,0.000035380264,0.00011320734,0.00012243142,0.00040846996,0.0059028775],"genre_scores_gemma":[0.8954818,0.00008107768,0.102465175,0.00010754043,0.00002227207,0.00017940687,0.00010676655,0.0000435627,0.0015122261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982527,0.00066981197,0.00010930127,0.00038050095,0.00029208136,0.00029575243],"domain_scores_gemma":[0.9924865,0.005472081,0.00054629246,0.0010506049,0.0002492927,0.00019527685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030255544,0.000666926,0.00095098413,0.00029617615,0.0010527842,0.0013088331,0.0019836759,0.0015871502,0.0024859183],"category_scores_gemma":[0.010471023,0.00041243882,0.001073674,0.0006305757,0.003166095,0.0035527048,0.0020610716,0.0021905527,0.0002852687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005328924,0.00017018738,0.0017255755,0.00022592506,0.00012373381,0.00015132464,0.00021112876,0.57568586,0.009204545,0.39417493,0.00076528545,0.017028652],"study_design_scores_gemma":[0.000077248544,0.000089609195,0.0003098186,0.000012957099,0.000025013029,0.000036020545,0.000055444107,0.744006,0.011750308,0.24285449,0.000756281,0.000026847247],"about_ca_topic_score_codex":0.0009833777,"about_ca_topic_score_gemma":0.0010932423,"teacher_disagreement_score":0.0030255544,"about_ca_system_score_codex":0.0011845608,"about_ca_system_score_gemma":0.0013833138,"threshold_uncertainty_score":0.016000867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7791502,0.0009936162,0.17630832,0.0006565436,0.00008350877,0.00009427743,0.0004387903,0.0003117935,0.041963007],"genre_scores_gemma":[0.9885815,0.00016367329,0.008757556,0.00011701366,0.00003344836,0.000040143277,0.0001614217,0.000030799973,0.0021144117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994081,0.00010307982,0.000043884316,0.00013893374,0.00013999976,0.00016599022],"domain_scores_gemma":[0.99885964,0.0003332651,0.00014820557,0.00027315438,0.00017951251,0.00020616021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005486591,0.00029310473,0.0004378623,0.00061480235,0.00090162543,0.0006692548,0.000742058,0.00063120824,0.004514492],"category_scores_gemma":[0.0019086946,0.00023090157,0.00039580034,0.00034011502,0.0019698106,0.0019776027,0.0019238804,0.00076677307,0.0002851988],"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.000060920185,0.0000363303,0.0011270284,0.00012880628,0.000013071165,0.0002608557,0.00044550252,0.007171006,0.01133056,0.9722773,0.00089183607,0.0062567834],"study_design_scores_gemma":[0.00002488282,0.00006930489,0.0010262819,0.000036345504,0.000008448145,0.0004525741,0.00019132554,0.06323164,0.007165614,0.92321575,0.0045410637,0.00003668993],"about_ca_topic_score_codex":0.00039262298,"about_ca_topic_score_gemma":0.00031803592,"teacher_disagreement_score":0.004514492,"about_ca_system_score_codex":0.0005432788,"about_ca_system_score_gemma":0.00046470467,"threshold_uncertainty_score":0.015102446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55311817,0.0005483125,0.4061279,0.004617677,0.00023535894,0.00018174306,0.00042321117,0.0008605645,0.03388712],"genre_scores_gemma":[0.9050004,0.00020106648,0.08295983,0.00044088022,0.00015974164,0.0001509955,0.0004898688,0.0001784392,0.0104187345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.000205428,0.00003589272,0.00018135823,0.00017203204,0.00018908408],"domain_scores_gemma":[0.9980447,0.0010420975,0.00014867829,0.0004801893,0.00011559844,0.00016861616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068774656,0.00039191137,0.00091542274,0.00036866646,0.001251678,0.0012786649,0.0014260086,0.0011417555,0.0075690206],"category_scores_gemma":[0.0038781695,0.00023029538,0.00091694423,0.00054788124,0.001909276,0.002668331,0.0024120088,0.002070412,0.0006243527],"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.0004297554,0.0001928194,0.0008754239,0.00015622439,0.000047242378,0.0002580078,0.0005422141,0.05449275,0.0055214716,0.9010209,0.007704829,0.028758416],"study_design_scores_gemma":[0.00007106579,0.000033517026,0.00014968164,0.000010280754,0.000007593157,0.00003651378,0.0000853289,0.19378808,0.0014946467,0.80256855,0.001741098,0.0000136165645],"about_ca_topic_score_codex":0.0012385042,"about_ca_topic_score_gemma":0.0018252659,"teacher_disagreement_score":0.0075690206,"about_ca_system_score_codex":0.0011437922,"about_ca_system_score_gemma":0.0011354316,"threshold_uncertainty_score":0.025320888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6969795,0.00018482994,0.27327856,0.00042928374,0.00009046012,0.00008552349,0.000119452125,0.00030062094,0.0285317],"genre_scores_gemma":[0.976695,0.00015745574,0.0170108,0.00009034682,0.0000360981,0.000055874967,0.00012257088,0.000065706896,0.005765977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995049,0.0001505428,0.000024296722,0.00008595554,0.00011939517,0.00011492068],"domain_scores_gemma":[0.9984737,0.0006783154,0.00022545474,0.00034066488,0.000131134,0.00015074946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804465,0.0003431863,0.0003606846,0.0005847525,0.00079420843,0.00090484845,0.00054884504,0.00073166896,0.0045076353],"category_scores_gemma":[0.003408531,0.00018971796,0.00060591573,0.0005300668,0.001540226,0.003275183,0.0010467671,0.0009891763,0.00039251428],"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.0001299109,0.00008346806,0.00061904546,0.00007553825,0.000013618616,0.00034415364,0.0002769612,0.031286545,0.012580846,0.93499255,0.00081528426,0.018782059],"study_design_scores_gemma":[0.000025421765,0.00012311953,0.00037194378,0.000015234241,0.000009860986,0.00015133018,0.000106677864,0.1652208,0.008662772,0.8228834,0.0024075492,0.000021860411],"about_ca_topic_score_codex":0.0004111185,"about_ca_topic_score_gemma":0.00027806885,"teacher_disagreement_score":0.0045076353,"about_ca_system_score_codex":0.0005973419,"about_ca_system_score_gemma":0.00038872758,"threshold_uncertainty_score":0.015079558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17885485,0.0007615223,0.7925205,0.0036735644,0.00016742796,0.0001829829,0.0001769429,0.0003062146,0.023355965],"genre_scores_gemma":[0.96865875,0.00047434677,0.028424958,0.00028245046,0.000119491364,0.00021710302,0.000067010114,0.000037533275,0.001718398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938261,0.002360564,0.0002881515,0.00055884826,0.0020726637,0.0008936401],"domain_scores_gemma":[0.9815223,0.012579146,0.0015065672,0.0028985697,0.0010538981,0.0004395086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069299135,0.0011793071,0.0011481692,0.0013443494,0.001918946,0.0038025156,0.0018232196,0.0024792242,0.0027302864],"category_scores_gemma":[0.022704042,0.0007980707,0.000884732,0.001401756,0.007821386,0.006110224,0.0076628756,0.003682163,0.0009440769],"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.00030761515,0.00007261945,0.00043535614,0.00016410727,0.000051059087,0.00014560105,0.00024400289,0.02347064,0.00796879,0.9562978,0.00071903435,0.010123401],"study_design_scores_gemma":[0.00020213303,0.00021814497,0.00022052093,0.00007695612,0.00005035271,0.0001962875,0.000072509356,0.2129122,0.025089545,0.757999,0.0028840858,0.000078329416],"about_ca_topic_score_codex":0.00045225356,"about_ca_topic_score_gemma":0.0002034101,"teacher_disagreement_score":0.0069299135,"about_ca_system_score_codex":0.0017832646,"about_ca_system_score_gemma":0.0022375775,"threshold_uncertainty_score":0.036649346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17192416,0.0003836434,0.81274855,0.00033332885,0.0000405101,0.00014201982,0.000114878305,0.00042567108,0.013887253],"genre_scores_gemma":[0.899682,0.00014266666,0.09524045,0.000084827196,0.000018750521,0.00011637241,0.00006103211,0.000030439369,0.004623438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887496,0.00045949552,0.00004050811,0.00020244709,0.00026656277,0.00015594758],"domain_scores_gemma":[0.9969214,0.0014941716,0.00043448448,0.0009097784,0.0001560516,0.00008407689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011789904,0.00054504565,0.00052764156,0.000390497,0.000440304,0.00065923756,0.001530058,0.00087000924,0.0028158699],"category_scores_gemma":[0.0033006242,0.00029193843,0.0003408985,0.00062006054,0.0016677737,0.0020993212,0.0023103498,0.001052369,0.00058551173],"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.00046025467,0.00018333193,0.0011269248,0.0003146408,0.00009765271,0.00033987808,0.00040866932,0.19647518,0.10098894,0.6380995,0.001358568,0.060146462],"study_design_scores_gemma":[0.00008236128,0.000442047,0.00044516532,0.00002640438,0.000044248372,0.00031828703,0.00010528915,0.7391252,0.120742254,0.13067347,0.007921665,0.00007373305],"about_ca_topic_score_codex":0.00024802145,"about_ca_topic_score_gemma":0.00027246773,"teacher_disagreement_score":0.0028158699,"about_ca_system_score_codex":0.0005398855,"about_ca_system_score_gemma":0.0005250113,"threshold_uncertainty_score":0.009420037},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94778776,0.0004713503,0.04162196,0.00016158458,0.000015014063,0.00000976846,0.00003412878,0.00004726298,0.009851108],"genre_scores_gemma":[0.9961655,0.00014739031,0.002895793,0.00000902776,0.0000140107395,0.000011728201,0.000021213953,0.000010528443,0.0007246915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999788,0.000056922963,0.000010131017,0.000028238363,0.0000716206,0.000045119094],"domain_scores_gemma":[0.9994311,0.00024174848,0.000117077536,0.00007996568,0.000054568944,0.00007554475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056893344,0.00040914115,0.0004253677,0.001328367,0.0007235925,0.001506566,0.00052048627,0.00051018037,0.0015533424],"category_scores_gemma":[0.0015062935,0.00021310263,0.00029145952,0.000755967,0.003308972,0.0025877308,0.0013051616,0.0006093259,0.00008641869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044813518,0.000045393204,0.0013119499,0.000044147957,0.000017889106,0.00024021092,0.00023003621,0.08537836,0.009147225,0.90016335,0.00011468277,0.0032618763],"study_design_scores_gemma":[0.000015131352,0.000078353034,0.0017467412,0.000025239335,0.000009687205,0.00009313052,0.00014725604,0.50203997,0.003890052,0.49134156,0.0005810497,0.000031836575],"about_ca_topic_score_codex":0.0006838366,"about_ca_topic_score_gemma":0.00074653677,"teacher_disagreement_score":0.0015533424,"about_ca_system_score_codex":0.0007175502,"about_ca_system_score_gemma":0.0003392879,"threshold_uncertainty_score":0.0052062273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14893542,0.00023314492,0.8373775,0.0004944302,0.00010256395,0.000048726448,0.00013728999,0.00020231232,0.012468709],"genre_scores_gemma":[0.9452311,0.00029539497,0.050265163,0.00019766566,0.00015734698,0.0000938172,0.00013568698,0.00006105675,0.0035628288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978573,0.0007605133,0.00010685615,0.00030813116,0.0006706688,0.0002965524],"domain_scores_gemma":[0.9974734,0.0010499074,0.00046117592,0.00038542246,0.00035451358,0.0002756871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012338056,0.00060583575,0.0008352832,0.00070286065,0.0007996579,0.0016910204,0.00062564685,0.00081709033,0.0023035926],"category_scores_gemma":[0.004142402,0.00040042514,0.0007285207,0.000633442,0.0027248634,0.00229158,0.0026778576,0.0013810956,0.00042903706],"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.0002522103,0.000029301065,0.00044110013,0.000036626334,0.000040944466,0.0001676755,0.00013995497,0.07652995,0.009317239,0.90255547,0.0006728238,0.0098167015],"study_design_scores_gemma":[0.000025906435,0.000104485305,0.0003393788,0.000018969518,0.000027034348,0.00020451633,0.00006706973,0.53518426,0.0072493195,0.45419717,0.0025077285,0.00007413451],"about_ca_topic_score_codex":0.00059997,"about_ca_topic_score_gemma":0.0003606196,"teacher_disagreement_score":0.0023035926,"about_ca_system_score_codex":0.0006558313,"about_ca_system_score_gemma":0.0007810758,"threshold_uncertainty_score":0.0077062845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021400427,0.0006199974,0.9443083,0.0015335667,0.00040183397,0.00024015894,0.00016061659,0.0013338873,0.03000113],"genre_scores_gemma":[0.33443618,0.0011084327,0.6472998,0.00040659646,0.00022247246,0.000363233,0.00036666705,0.0003727319,0.015423807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783677,0.00046798825,0.00014503408,0.00023134996,0.0009881522,0.00033077277],"domain_scores_gemma":[0.9991366,0.00026720867,0.000044561413,0.00033594196,0.00016752552,0.000048147653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017563334,0.00066729385,0.0010518493,0.00093535596,0.0016296626,0.0021682088,0.0014481904,0.0011997255,0.0077856253],"category_scores_gemma":[0.0037178015,0.00045769336,0.00096702884,0.0013124994,0.0021020093,0.0046248226,0.0026572328,0.0018686702,0.0026600345],"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.00012859175,0.000058853333,0.00018620914,0.00012787733,0.000020240019,0.00011088315,0.00021576324,0.023228457,0.0032859843,0.89720774,0.0059607443,0.069468595],"study_design_scores_gemma":[0.00011946204,0.00010103121,0.00009563938,0.00005570329,0.000018866647,0.00013947694,0.00007637022,0.12530614,0.011370479,0.8323405,0.030319775,0.000056539495],"about_ca_topic_score_codex":0.0008055853,"about_ca_topic_score_gemma":0.00077528757,"teacher_disagreement_score":0.0077856253,"about_ca_system_score_codex":0.0010099015,"about_ca_system_score_gemma":0.0020051026,"threshold_uncertainty_score":0.026045501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080277696,0.00031394899,0.90695834,0.0003271342,0.000070511276,0.00013356426,0.00019751646,0.0020767825,0.009644581],"genre_scores_gemma":[0.5806431,0.0003025414,0.4087202,0.00016351437,0.000027325366,0.00031488625,0.00038534522,0.00035877968,0.009084349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995382,0.00015196939,0.000020031102,0.00011570388,0.00010860918,0.00006546946],"domain_scores_gemma":[0.99907744,0.0004181696,0.000087793705,0.00028594237,0.00008129384,0.000049321927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005329707,0.0003432105,0.0004264946,0.00046625079,0.0007224817,0.00071924436,0.0009656317,0.0006385135,0.0059015253],"category_scores_gemma":[0.002057632,0.00036877452,0.0004220331,0.00066327525,0.0008796481,0.0016174829,0.0013046153,0.00075008377,0.00094517716],"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.00056619284,0.00020882522,0.0014093459,0.00017279066,0.000049051752,0.00015637824,0.0002404506,0.27041006,0.02835365,0.48622626,0.006745659,0.20546123],"study_design_scores_gemma":[0.00005474992,0.00007601027,0.00018848585,0.000012431289,0.000010446773,0.000081434264,0.000024941102,0.86907524,0.008841293,0.11410308,0.0075115124,0.00002041497],"about_ca_topic_score_codex":0.0014980236,"about_ca_topic_score_gemma":0.002076534,"teacher_disagreement_score":0.0059015253,"about_ca_system_score_codex":0.00079444156,"about_ca_system_score_gemma":0.0012736123,"threshold_uncertainty_score":0.019742548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13110922,0.00020318331,0.8589437,0.0010533902,0.00007035931,0.00018191882,0.00019363755,0.0019754514,0.006269186],"genre_scores_gemma":[0.58250815,0.000106211715,0.41217878,0.00019819642,0.000043184038,0.00018466117,0.00037026446,0.00013427724,0.0042762337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842143,0.0003655453,0.0000798708,0.00039112667,0.00042569128,0.00031629068],"domain_scores_gemma":[0.9970567,0.0014771566,0.00023478619,0.00085350213,0.0002614156,0.00011655971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011335625,0.0005456208,0.0011191522,0.00078871264,0.0013078768,0.001435485,0.0022058412,0.0018099345,0.004247922],"category_scores_gemma":[0.0043896246,0.00041586487,0.00078261987,0.0011978277,0.0012741206,0.003266173,0.0029413917,0.001546485,0.0009355289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012374066,0.0006924471,0.0033162264,0.00038119277,0.00020012262,0.0004116664,0.00083270157,0.14967711,0.04602628,0.42868248,0.01343804,0.3551043],"study_design_scores_gemma":[0.0001887782,0.00008035301,0.00029875076,0.000011887286,0.00003398651,0.00010961996,0.00010097026,0.78680897,0.012381924,0.19723473,0.002715965,0.000034002103],"about_ca_topic_score_codex":0.0017615854,"about_ca_topic_score_gemma":0.002086813,"teacher_disagreement_score":0.004247922,"about_ca_system_score_codex":0.0012345503,"about_ca_system_score_gemma":0.002586498,"threshold_uncertainty_score":0.014210761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38560948,0.0013497599,0.6006785,0.0016001089,0.00008783535,0.00012429016,0.00011696631,0.00024214842,0.010190928],"genre_scores_gemma":[0.963681,0.0009336454,0.03347669,0.0001772744,0.00015601024,0.00010055713,0.00006131524,0.00011627081,0.0012971997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907109,0.005380797,0.00025977264,0.00061533257,0.0024727564,0.00056046655],"domain_scores_gemma":[0.9306887,0.0601092,0.0037972291,0.0032272318,0.0015304394,0.00064724195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011483625,0.0010972536,0.0014147863,0.0021303997,0.0009377871,0.0032613052,0.0014843507,0.001601722,0.0008991405],"category_scores_gemma":[0.048333548,0.0009540607,0.0007584206,0.0018992734,0.009882473,0.00769984,0.002274494,0.003532741,0.00018856359],"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.0002264607,0.0000909379,0.0022165114,0.00008837284,0.00006197967,0.00023772448,0.00031203122,0.08622272,0.0054612015,0.89546674,0.0004148261,0.009200494],"study_design_scores_gemma":[0.00003668785,0.00014466289,0.00077304227,0.000045703633,0.000025849384,0.00020320855,0.00005724336,0.5894883,0.004988462,0.4036786,0.00047579678,0.000082395854],"about_ca_topic_score_codex":0.0003648839,"about_ca_topic_score_gemma":0.00019596447,"teacher_disagreement_score":0.011483625,"about_ca_system_score_codex":0.001538725,"about_ca_system_score_gemma":0.0016485841,"threshold_uncertainty_score":0.060731947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13905697,0.00018973039,0.84780866,0.00034422913,0.000079314515,0.00012288058,0.00014316344,0.0025218904,0.0097331265],"genre_scores_gemma":[0.68786675,0.00011069713,0.30529583,0.00018494029,0.000032562937,0.00016763058,0.000341664,0.00025520314,0.005744664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990897,0.0001856295,0.00004483122,0.0001286679,0.00034164084,0.00020950973],"domain_scores_gemma":[0.9991073,0.0002628486,0.00008197702,0.0003809104,0.00011259529,0.000054468976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192608,0.0007193588,0.0008128115,0.00035903018,0.0005810529,0.0008412584,0.0015478411,0.00082883186,0.0042456673],"category_scores_gemma":[0.0026523569,0.00030348162,0.0007029588,0.0005623231,0.0008754268,0.0013440882,0.0014428749,0.0011369701,0.00125411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013305377,0.00031693964,0.0024861842,0.00033926347,0.00009683501,0.0003744076,0.0003476568,0.38149482,0.043550912,0.31488755,0.010674799,0.24410015],"study_design_scores_gemma":[0.00007315732,0.000081107144,0.000122034304,0.000010682955,0.000009790505,0.00006503068,0.00002574181,0.93363833,0.013677914,0.050881654,0.0013999345,0.000014738219],"about_ca_topic_score_codex":0.0030419596,"about_ca_topic_score_gemma":0.0046393527,"teacher_disagreement_score":0.0042456673,"about_ca_system_score_codex":0.0012471469,"about_ca_system_score_gemma":0.0019114754,"threshold_uncertainty_score":0.014203191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002307304,0.0065949494,0.000143201,0.015126066,0.9761505,0.000014455053,0.000030551513,0.000045564535,0.0018716473],"genre_scores_gemma":[0.0005173157,0.003323939,0.00009158755,0.008841198,0.9741509,0.000016578188,0.000024327604,0.000033890337,0.013000257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948133,0.0008130613,0.0005424287,0.0005610917,0.0028994107,0.00037067974],"domain_scores_gemma":[0.98223096,0.005843071,0.0014074268,0.00058939133,0.0075365105,0.0023925502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058614803,0.0045612487,0.006074962,0.007162514,0.0048798425,0.00848873,0.0045532384,0.018307531,0.023889702],"category_scores_gemma":[0.020795822,0.001707054,0.0029506218,0.0026030492,0.0030574854,0.005045675,0.0020012504,0.017870117,0.01212937],"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.00003145474,0.000011149936,0.000009922009,0.00013869339,0.000018856965,0.00008363177,0.000005529945,0.00003191594,0.000049304974,0.00031763103,0.9953367,0.003965047],"study_design_scores_gemma":[0.00009225254,0.000032156353,0.0002673324,0.0003216956,0.00009933081,0.00023241575,0.000024143996,0.00033657,0.00017712514,0.00203759,0.9963548,0.000024665387],"about_ca_topic_score_codex":0.0018468872,"about_ca_topic_score_gemma":0.0065052374,"teacher_disagreement_score":0.023889702,"about_ca_system_score_codex":0.0037731992,"about_ca_system_score_gemma":0.0026845566,"threshold_uncertainty_score":0.07991898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04893306,0.005561918,0.82844573,0.01728608,0.0012592851,0.0004699636,0.0018424789,0.0017466793,0.09445486],"genre_scores_gemma":[0.76643306,0.005685294,0.16921417,0.0061588404,0.0031745336,0.0022063376,0.0026453035,0.0020479907,0.04243446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9824912,0.0041892002,0.0006241152,0.0026742672,0.006029983,0.0039912257],"domain_scores_gemma":[0.9128261,0.068858296,0.002689676,0.009830449,0.0029262668,0.002869257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011608601,0.0042418893,0.004315862,0.004103944,0.0047815284,0.009377438,0.011211988,0.0053411457,0.024726218],"category_scores_gemma":[0.04986089,0.0020959815,0.005745892,0.00508436,0.0084889475,0.026531117,0.017270733,0.024871068,0.005668247],"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.0010606969,0.00048451824,0.0012216858,0.00061914674,0.00023712794,0.00020474874,0.0005638141,0.08511704,0.005546189,0.8555932,0.018535042,0.030816844],"study_design_scores_gemma":[0.00008494694,0.000091390386,0.00034758597,0.00009424748,0.000098486154,0.0001225881,0.00007263126,0.23569219,0.0032356505,0.7545345,0.005559734,0.00006603144],"about_ca_topic_score_codex":0.0022905052,"about_ca_topic_score_gemma":0.0026124476,"teacher_disagreement_score":0.024726218,"about_ca_system_score_codex":0.0091412375,"about_ca_system_score_gemma":0.0054355594,"threshold_uncertainty_score":0.08271742},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74138606,0.00037411376,0.23323123,0.0015802529,0.00006716868,0.00011500015,0.0003961707,0.00027846167,0.022571553],"genre_scores_gemma":[0.98150015,0.00007763134,0.016025038,0.00018265187,0.00004261988,0.00013494852,0.0001985197,0.000030825653,0.0018076891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966851,0.0011779831,0.00016844299,0.0006399759,0.0009596344,0.0003688239],"domain_scores_gemma":[0.98427,0.011597411,0.0013367843,0.0016245029,0.00047137972,0.00070005795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024850222,0.00055809284,0.0011428866,0.0009695524,0.0013972258,0.0029684727,0.0024191663,0.0017525626,0.0035243493],"category_scores_gemma":[0.013538612,0.00073889736,0.0008600516,0.000741626,0.006050469,0.005975949,0.0054545463,0.003155656,0.00028473747],"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.00040547593,0.00013988753,0.0013547929,0.00013669004,0.00008192737,0.00039052614,0.00049200276,0.02678449,0.010026342,0.95364374,0.0007897867,0.0057542683],"study_design_scores_gemma":[0.00013899259,0.00013964002,0.0008611168,0.00003861669,0.0000380077,0.00020694731,0.00022573957,0.20875703,0.008804878,0.779197,0.0015474271,0.00004467524],"about_ca_topic_score_codex":0.00030612253,"about_ca_topic_score_gemma":0.00023598186,"teacher_disagreement_score":0.0035243493,"about_ca_system_score_codex":0.0013779295,"about_ca_system_score_gemma":0.000569168,"threshold_uncertainty_score":0.013142228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17839071,0.0022697947,0.71679693,0.002116636,0.0006296924,0.00021933939,0.00026530502,0.00077882875,0.09853274],"genre_scores_gemma":[0.8289814,0.0014168962,0.15277298,0.0005376606,0.00022906202,0.00026820519,0.00014469579,0.00011400177,0.01553505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971014,0.000064539905,0.000013990238,0.000050800914,0.00011858949,0.000042012343],"domain_scores_gemma":[0.9994093,0.00034360113,0.00005054886,0.000101075406,0.00006370345,0.000031748845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003776125,0.0002821718,0.00029931942,0.00042465015,0.00056566537,0.0009480322,0.000473074,0.0006716426,0.007236428],"category_scores_gemma":[0.0023410644,0.00018801136,0.00036839803,0.00033295865,0.001141638,0.0018814695,0.00071366475,0.0008711237,0.0007556101],"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.000046677316,0.000022949986,0.00008690591,0.000118678036,0.0000067151864,0.000054575627,0.000072892835,0.0054712114,0.011456607,0.9479986,0.0015328098,0.033131376],"study_design_scores_gemma":[0.000051769555,0.00010885419,0.0002316233,0.000048353806,0.000015890395,0.00019183119,0.000033743458,0.06505455,0.018982401,0.89053744,0.024716355,0.000027234812],"about_ca_topic_score_codex":0.00016724049,"about_ca_topic_score_gemma":0.00024641273,"teacher_disagreement_score":0.007236428,"about_ca_system_score_codex":0.0004958707,"about_ca_system_score_gemma":0.00032760898,"threshold_uncertainty_score":0.024208248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009167295,0.00022830465,0.9820696,0.00053301465,0.000040638908,0.000034967245,0.000039424736,0.00007980186,0.0078068804],"genre_scores_gemma":[0.39586988,0.0005639887,0.59214157,0.00043405304,0.00016414197,0.00030849493,0.00021727275,0.00021184339,0.010088764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990434,0.00045159747,0.000030300333,0.00011289333,0.00026338207,0.00009839748],"domain_scores_gemma":[0.9985933,0.0010719411,0.00008248743,0.00008510968,0.00010588505,0.00006134507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018516558,0.00070582615,0.0010257389,0.00044218896,0.0006436758,0.0012429216,0.0011590553,0.0013761132,0.004340556],"category_scores_gemma":[0.00495704,0.00046046323,0.0005914673,0.0007856727,0.0015212499,0.0015532922,0.002479731,0.002886597,0.00048820907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008321591,0.0000677566,0.0002259791,0.00020890913,0.00003871941,0.000086984095,0.00011739803,0.5042856,0.0025231654,0.44018725,0.002996083,0.04917908],"study_design_scores_gemma":[0.00001800833,0.000018590697,0.000042206942,0.00001104338,0.0000037469154,0.000013465599,0.000011248622,0.909304,0.00037020055,0.08919069,0.00101135,0.0000053967674],"about_ca_topic_score_codex":0.0020297088,"about_ca_topic_score_gemma":0.0019837664,"teacher_disagreement_score":0.004340556,"about_ca_system_score_codex":0.0008596646,"about_ca_system_score_gemma":0.0012299008,"threshold_uncertainty_score":0.014520645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7876699,0.00089952047,0.10866038,0.0012052105,0.00013380211,0.00006444408,0.00020973201,0.00018264874,0.100974314],"genre_scores_gemma":[0.98398596,0.00022947733,0.010303432,0.00015609554,0.0000518352,0.00004203848,0.000077178265,0.000026282481,0.0051277005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995247,0.000114411174,0.000026229507,0.000086224645,0.000103954124,0.00014450533],"domain_scores_gemma":[0.99947995,0.00013383155,0.00009690533,0.000121639045,0.000058865302,0.00010884009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005165339,0.00031972898,0.00026759686,0.001025971,0.0011133251,0.001798924,0.00033086547,0.00074519124,0.003746376],"category_scores_gemma":[0.0015505701,0.00027701148,0.00029288183,0.00082956627,0.0027213905,0.0025616675,0.0015482274,0.000888971,0.0004954639],"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.0000112329435,0.000005159351,0.00009686186,0.0000055546043,8.424707e-7,0.000018399014,0.000078277255,0.0002569137,0.0005877909,0.9967439,0.00019719254,0.0019978934],"study_design_scores_gemma":[0.000007963255,0.000014690634,0.00016091671,0.0000073635356,0.000001788539,0.000041482446,0.000075281816,0.0034321535,0.001093076,0.99313474,0.0020230403,0.0000075483435],"about_ca_topic_score_codex":0.0004958478,"about_ca_topic_score_gemma":0.0004600732,"teacher_disagreement_score":0.003746376,"about_ca_system_score_codex":0.0005121124,"about_ca_system_score_gemma":0.0003316879,"threshold_uncertainty_score":0.012532949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038854454,0.00027536222,0.9507304,0.001009676,0.00007095484,0.000101367565,0.00010421633,0.00059339183,0.008260178],"genre_scores_gemma":[0.476541,0.00052818155,0.5153707,0.00029296865,0.00018235884,0.0002470449,0.00037465701,0.00027420637,0.006188917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987919,0.00034606096,0.000061477695,0.00022375637,0.00033705027,0.00023985624],"domain_scores_gemma":[0.9970797,0.0018989812,0.00019574646,0.00052699295,0.00017584994,0.00012276878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011881822,0.00062397437,0.00094030885,0.00069899735,0.00093899865,0.0017665372,0.0016645287,0.0012510117,0.006472756],"category_scores_gemma":[0.005426025,0.00042424112,0.00096612715,0.0012444953,0.0017297422,0.0041611395,0.0032378312,0.0032338675,0.0008209892],"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.00021182676,0.00015057124,0.0004268568,0.00021281753,0.000053422245,0.000093415605,0.00025703714,0.09100637,0.0052013653,0.80509263,0.0057441476,0.091549456],"study_design_scores_gemma":[0.00011697407,0.000034288234,0.00012557447,0.000013375117,0.00001927542,0.000068015266,0.000054607306,0.4425467,0.0035661506,0.55067796,0.0027575123,0.000019665755],"about_ca_topic_score_codex":0.0008912376,"about_ca_topic_score_gemma":0.0016194624,"teacher_disagreement_score":0.006472756,"about_ca_system_score_codex":0.0014020717,"about_ca_system_score_gemma":0.0014784188,"threshold_uncertainty_score":0.021653533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12750433,0.001756069,0.7420966,0.0041718134,0.00047792707,0.00015134523,0.00059230323,0.00037343203,0.122876294],"genre_scores_gemma":[0.94105834,0.0006021718,0.05017649,0.00042917524,0.00060728984,0.00014482117,0.00022214522,0.000081455,0.006678281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984919,0.0004544838,0.00005924172,0.00023758873,0.0004785612,0.0002781288],"domain_scores_gemma":[0.99878174,0.00041726296,0.000112257265,0.0002681656,0.00025161335,0.00016898612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018253982,0.0005377116,0.00061848556,0.0019469536,0.002198033,0.0028127586,0.0015433215,0.0011665334,0.007151072],"category_scores_gemma":[0.0024979417,0.00027971077,0.0010671619,0.0013282412,0.0052892286,0.0048272563,0.0035504857,0.0028199004,0.00075721496],"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.000002002871,0.000004049369,0.000027634334,0.000007759895,0.0000015919152,0.000016182545,0.000042344265,0.00035966496,0.00016354832,0.9988133,0.0000863487,0.00047556416],"study_design_scores_gemma":[0.000004491518,0.000008472582,0.00007293817,0.000006237586,0.0000030923409,0.000024489776,0.00003304142,0.005513302,0.00012802097,0.9919185,0.0022805582,0.0000068295],"about_ca_topic_score_codex":0.0010636355,"about_ca_topic_score_gemma":0.00071524567,"teacher_disagreement_score":0.007151072,"about_ca_system_score_codex":0.0019378591,"about_ca_system_score_gemma":0.001120737,"threshold_uncertainty_score":0.023922682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3570612,0.00012844255,0.601273,0.0022019797,0.00024048072,0.0001766855,0.00021214527,0.0007167391,0.037989277],"genre_scores_gemma":[0.9644787,0.000070911796,0.032587968,0.00042623733,0.000040982202,0.00015699046,0.00009096392,0.00006608773,0.0020812866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691015,0.0010077214,0.00027527902,0.00047910196,0.0006088127,0.0007189741],"domain_scores_gemma":[0.99088424,0.004109688,0.001099029,0.0025799256,0.0008688167,0.0004583296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023195026,0.0003188693,0.00069895806,0.0005130402,0.0018754321,0.0020769343,0.0010005897,0.0015569178,0.0045688],"category_scores_gemma":[0.010653978,0.0005518263,0.0010856712,0.00056470616,0.0041162306,0.006507401,0.0035156256,0.002754037,0.00080508756],"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.00022869773,0.000068785484,0.0006412937,0.0000899855,0.000033356326,0.00020813159,0.0003099546,0.006785631,0.009914618,0.9702679,0.0013730011,0.010078668],"study_design_scores_gemma":[0.000094977964,0.00020458404,0.0004394441,0.000033084412,0.000043243643,0.00021232596,0.00030933795,0.10531595,0.024097066,0.8653239,0.0038544352,0.000071721035],"about_ca_topic_score_codex":0.00044908124,"about_ca_topic_score_gemma":0.0005435453,"teacher_disagreement_score":0.0045688,"about_ca_system_score_codex":0.00065438595,"about_ca_system_score_gemma":0.0018032788,"threshold_uncertainty_score":0.015284121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7747382,0.0016707097,0.12798555,0.0014505,0.00023496016,0.000110432484,0.0005856533,0.00044131646,0.09278272],"genre_scores_gemma":[0.97640187,0.00055221835,0.01217132,0.0002468974,0.00014066354,0.00005081259,0.00037229198,0.00008328858,0.0099806385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947387,0.0000595936,0.000029283508,0.00008867657,0.00018819203,0.0001603719],"domain_scores_gemma":[0.9981002,0.0007530639,0.00023896684,0.00031543022,0.00045371428,0.00013874067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005464491,0.00032566366,0.00039609344,0.0018266062,0.00157887,0.0016603621,0.0006932103,0.000845979,0.0042866566],"category_scores_gemma":[0.0029785128,0.00026477448,0.00034168945,0.0011766814,0.0022983153,0.0027189548,0.0010742096,0.0013104322,0.0007439116],"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.000059906448,0.000014887341,0.00048458678,0.000049059938,0.0000032169921,0.00017924924,0.00027169194,0.0027898704,0.0022316175,0.9839188,0.0011375822,0.008859537],"study_design_scores_gemma":[0.000013257282,0.000037732785,0.00033352923,0.000025330564,0.0000048875527,0.00012657903,0.00009351601,0.01231328,0.003369914,0.979478,0.004182891,0.000021095362],"about_ca_topic_score_codex":0.0016530952,"about_ca_topic_score_gemma":0.0014776989,"teacher_disagreement_score":0.0042866566,"about_ca_system_score_codex":0.001026416,"about_ca_system_score_gemma":0.00094070495,"threshold_uncertainty_score":0.0143402815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2671423,0.001060575,0.64733154,0.012716188,0.00075022003,0.00081679993,0.0032586455,0.013401048,0.053522676],"genre_scores_gemma":[0.8926932,0.00041891806,0.09183779,0.0013170671,0.00037781973,0.000527893,0.0020503,0.0008353222,0.00994172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911159,0.0019147557,0.0004445642,0.002567697,0.0018885637,0.002068526],"domain_scores_gemma":[0.94206727,0.042569164,0.0024285715,0.010237771,0.0012938781,0.0014034274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035344115,0.0015664689,0.002531387,0.0008433922,0.003210402,0.00720829,0.004430239,0.003300745,0.023906548],"category_scores_gemma":[0.023672538,0.0011116036,0.0038179252,0.001997879,0.0050465204,0.016049428,0.0055210376,0.0067563243,0.0031500524],"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.0057370253,0.0018272019,0.006126591,0.0020577253,0.00069666875,0.0014117489,0.0010881003,0.16886938,0.033646658,0.61451066,0.037664942,0.12636326],"study_design_scores_gemma":[0.00034492163,0.00019706126,0.00064930733,0.000054209577,0.00016989298,0.00028322396,0.00017234735,0.18206662,0.011595423,0.80052274,0.0038883109,0.000055961962],"about_ca_topic_score_codex":0.0022779796,"about_ca_topic_score_gemma":0.0034816882,"teacher_disagreement_score":0.023906548,"about_ca_system_score_codex":0.0038017049,"about_ca_system_score_gemma":0.0046036537,"threshold_uncertainty_score":0.079975426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7386573,0.00025958946,0.22106901,0.0004842114,0.00018981838,0.000119608776,0.00012841991,0.00077136606,0.03832075],"genre_scores_gemma":[0.9766176,0.00010578378,0.017723477,0.00010212661,0.000028815364,0.000060330945,0.00007228261,0.00013750333,0.005151973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935395,0.00014423764,0.000024359148,0.00015202949,0.00013433777,0.0001910596],"domain_scores_gemma":[0.9986621,0.00052748213,0.00010531347,0.00046601213,0.00008889825,0.00015006153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615047,0.00038754166,0.00046774608,0.00051971764,0.0014870755,0.0014417616,0.00073142146,0.0011848193,0.010269495],"category_scores_gemma":[0.002992466,0.00036714703,0.0006893602,0.00045304833,0.0023693736,0.0036860453,0.002234204,0.001846314,0.0009121139],"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.00023848588,0.00008020658,0.00058577256,0.00010377385,0.0000227099,0.00035223766,0.00045422962,0.0106742,0.018354839,0.9517995,0.0009589484,0.016375083],"study_design_scores_gemma":[0.00003456635,0.00017443331,0.00035276846,0.000025262478,0.000018596123,0.0003022284,0.00017646591,0.03757734,0.021595158,0.9365907,0.0031205113,0.000032061707],"about_ca_topic_score_codex":0.00017212785,"about_ca_topic_score_gemma":0.00016326952,"teacher_disagreement_score":0.010269495,"about_ca_system_score_codex":0.00048333715,"about_ca_system_score_gemma":0.00042521037,"threshold_uncertainty_score":0.034354866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13588347,0.0021811286,0.78107667,0.0062301457,0.0009260439,0.000094747615,0.00049478625,0.00076976285,0.07234322],"genre_scores_gemma":[0.94350016,0.0007234345,0.049768962,0.00065668434,0.0007302893,0.00011516604,0.00022802508,0.00018011798,0.0040971795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967589,0.0013877458,0.00017555278,0.00041684063,0.00086311274,0.00039795207],"domain_scores_gemma":[0.9920358,0.004253121,0.00076134724,0.0014865061,0.0010408687,0.00042226556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034993922,0.00061618735,0.00069149403,0.0022847892,0.0022149696,0.0036157419,0.0017262965,0.0016447486,0.007484401],"category_scores_gemma":[0.013150262,0.00045262728,0.0011821886,0.0013588234,0.006982259,0.010310543,0.0056276415,0.0036701683,0.0008318694],"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.000005929919,0.000004905945,0.000044929653,0.000027144864,0.0000038404955,0.00003236769,0.00008495258,0.00035128888,0.00024554363,0.9975508,0.00026657069,0.0013817376],"study_design_scores_gemma":[0.000006830286,0.0000130678745,0.000075185075,0.00001265121,0.0000053689964,0.000047374655,0.000047356993,0.001928122,0.00038947517,0.9951083,0.0023556862,0.00001063473],"about_ca_topic_score_codex":0.00036761144,"about_ca_topic_score_gemma":0.0002788021,"teacher_disagreement_score":0.007484401,"about_ca_system_score_codex":0.0011916868,"about_ca_system_score_gemma":0.0009359033,"threshold_uncertainty_score":0.025037825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052278798,0.00007670946,0.9423072,0.000098602446,0.000043997723,0.00006725898,0.000028314753,0.00042817596,0.004670919],"genre_scores_gemma":[0.6843029,0.00015987799,0.31267792,0.00007252535,0.000028275988,0.00021213891,0.0000637208,0.0001239695,0.0023587022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939525,0.00024133096,0.000028892087,0.00007704181,0.00020087048,0.0000566012],"domain_scores_gemma":[0.99902666,0.0005329114,0.000070743554,0.00022430641,0.00009025865,0.000055099023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074255455,0.00043245728,0.00057852716,0.0003179965,0.00042799907,0.00058894715,0.0011555596,0.0006131519,0.0030821606],"category_scores_gemma":[0.0023920233,0.00034837984,0.000479025,0.0004761463,0.0009600437,0.001560739,0.0011623324,0.000971683,0.000391384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025625434,0.00016305271,0.00063161564,0.00010358076,0.00006666256,0.00013802387,0.00012754899,0.6839354,0.015026622,0.24707127,0.000915347,0.05156469],"study_design_scores_gemma":[0.000015527674,0.00004440845,0.000026308828,0.0000024975288,0.0000052435967,0.0000162967,0.000005236551,0.9780634,0.0030785727,0.018306574,0.00042859095,0.0000073246806],"about_ca_topic_score_codex":0.00074809603,"about_ca_topic_score_gemma":0.00092829065,"teacher_disagreement_score":0.0030821606,"about_ca_system_score_codex":0.00034933034,"about_ca_system_score_gemma":0.00062711065,"threshold_uncertainty_score":0.010310829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9207962,0.00008420627,0.07070857,0.00024583194,0.00007125471,0.00005222466,0.000133598,0.00043926126,0.00746888],"genre_scores_gemma":[0.97799987,0.000053181335,0.02020016,0.00006133218,0.000010766726,0.000052836665,0.00011425614,0.00005886379,0.0014487881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995858,0.0001509345,0.000021960976,0.000076115706,0.00009471281,0.00007054929],"domain_scores_gemma":[0.99808276,0.00063289073,0.00025274267,0.0007343145,0.0001586235,0.00013871257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052345,0.00030118064,0.00030731034,0.0002727864,0.00041659636,0.0006877371,0.00067173,0.00037936214,0.0023029416],"category_scores_gemma":[0.0025496315,0.00019680428,0.0002256049,0.000394557,0.00095075084,0.00136197,0.0008664412,0.0005455753,0.00019563141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010484686,0.00037195146,0.002901461,0.00019584861,0.00007585541,0.0006487505,0.0005887872,0.4893971,0.1985,0.25002465,0.001994936,0.054252174],"study_design_scores_gemma":[0.00009106211,0.00068101985,0.0015465994,0.000021102433,0.000029582745,0.00025005103,0.000403714,0.6820557,0.11611815,0.19456187,0.004197533,0.000043601463],"about_ca_topic_score_codex":0.0005630227,"about_ca_topic_score_gemma":0.0009225589,"teacher_disagreement_score":0.0023029416,"about_ca_system_score_codex":0.0003567536,"about_ca_system_score_gemma":0.00046375682,"threshold_uncertainty_score":0.0077041388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087463625,0.0014438002,0.8111354,0.005210858,0.0004045648,0.00011421759,0.00041966865,0.00041275588,0.09339512],"genre_scores_gemma":[0.9240435,0.000765422,0.06681268,0.0006538572,0.000612262,0.0002026211,0.00021525934,0.0002793567,0.0064151166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967366,0.00089556817,0.00017062503,0.00066992396,0.0008585295,0.0006687749],"domain_scores_gemma":[0.98801816,0.006427875,0.0008527175,0.0032776624,0.000878059,0.00054547953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036037776,0.0008911047,0.0013721576,0.0022904256,0.0024971291,0.0054619107,0.0027250436,0.0020040073,0.013283609],"category_scores_gemma":[0.01451966,0.0006245813,0.0017003347,0.0018329403,0.011408881,0.01569976,0.007876814,0.0052751973,0.0009906216],"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.000009801703,0.0000069437956,0.00006410699,0.000019229017,0.0000035696858,0.000021404067,0.000049833863,0.00069874636,0.00020115,0.99751854,0.00016196139,0.0012448163],"study_design_scores_gemma":[0.0000053437425,0.000010291829,0.00010055467,0.000015965537,0.000008686797,0.00003135296,0.000034816676,0.005092725,0.0004980683,0.99249744,0.0016925547,0.000012223529],"about_ca_topic_score_codex":0.0012545085,"about_ca_topic_score_gemma":0.0010493551,"teacher_disagreement_score":0.013283609,"about_ca_system_score_codex":0.0028486957,"about_ca_system_score_gemma":0.001709928,"threshold_uncertainty_score":0.044438124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3520705,0.0005167935,0.5743641,0.0028367157,0.000118854696,0.00015980809,0.00064666325,0.00082385103,0.06846267],"genre_scores_gemma":[0.9618494,0.00024218248,0.024001969,0.0003371815,0.00010916936,0.00015295338,0.0002623574,0.00024120635,0.012803649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982326,0.00038100148,0.00007824195,0.00038546172,0.0005493377,0.00037330133],"domain_scores_gemma":[0.99261016,0.0045479876,0.00051709876,0.0014249152,0.0005128932,0.0003869631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016194769,0.000619368,0.00076381146,0.0014026953,0.0013628042,0.0033077663,0.0013699256,0.0021572823,0.019984297],"category_scores_gemma":[0.010551375,0.00043215955,0.00075700146,0.0012474409,0.0055649118,0.007837513,0.0027408886,0.0034682737,0.0017078951],"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.00006328312,0.00002552893,0.00018628525,0.000032720047,0.000006352381,0.000037697268,0.00011166668,0.0077652214,0.0017032278,0.98390675,0.000866985,0.005294318],"study_design_scores_gemma":[0.000009601119,0.000028650637,0.00015866317,0.000013119844,0.0000037091227,0.00005378905,0.0000312432,0.044410955,0.0017623646,0.9522957,0.0012172469,0.0000150272635],"about_ca_topic_score_codex":0.0003550754,"about_ca_topic_score_gemma":0.0002522524,"teacher_disagreement_score":0.019984297,"about_ca_system_score_codex":0.0017602678,"about_ca_system_score_gemma":0.000870579,"threshold_uncertainty_score":0.06685418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015713442,0.0023708749,0.82531905,0.0053811343,0.0009956819,0.00030899927,0.0008098094,0.0010954526,0.14800556],"genre_scores_gemma":[0.5783422,0.004533523,0.3063179,0.00468414,0.0008254003,0.0011422837,0.0014390047,0.0007114441,0.10200417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959902,0.0008670903,0.0003202133,0.0007468522,0.00148114,0.0005944734],"domain_scores_gemma":[0.99360025,0.0014119636,0.00047007247,0.0036740897,0.0006937773,0.00014981822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019419554,0.00068235205,0.0009506964,0.00073655625,0.001544002,0.0031282355,0.0018680532,0.0017128909,0.011204663],"category_scores_gemma":[0.007680994,0.00054472836,0.0011382992,0.0012224086,0.004275203,0.008780803,0.0057145627,0.0040228562,0.005393723],"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.000038196962,0.000014470278,0.000099238314,0.000078397425,0.000008403412,0.00007865993,0.00017477949,0.00085811765,0.0017145233,0.9751371,0.0047023008,0.017095802],"study_design_scores_gemma":[0.00005206475,0.00006007964,0.00017308258,0.00014197332,0.000019134657,0.00070722593,0.00006312392,0.015121691,0.011848714,0.84505105,0.12671979,0.000042155523],"about_ca_topic_score_codex":0.00051388866,"about_ca_topic_score_gemma":0.00046162697,"teacher_disagreement_score":0.011204663,"about_ca_system_score_codex":0.001670628,"about_ca_system_score_gemma":0.0015308193,"threshold_uncertainty_score":0.037483335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50887245,0.00045226995,0.39017755,0.0010294451,0.0006036762,0.0001453983,0.00034985377,0.0015531968,0.09681624],"genre_scores_gemma":[0.94384325,0.0003305016,0.04171067,0.0002809107,0.00006422892,0.000107675594,0.0002154647,0.00021956647,0.01322779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997595,0.000049273815,0.000008235187,0.00006437361,0.00006616885,0.00005247056],"domain_scores_gemma":[0.99929905,0.0002856844,0.0000660192,0.00017851502,0.0000757532,0.000095026226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002591538,0.0003673314,0.00022178424,0.0004235079,0.0010014285,0.0012325688,0.0006081139,0.00087036326,0.00774058],"category_scores_gemma":[0.0015228608,0.0002517747,0.00042202545,0.00036047542,0.0013200175,0.0018577131,0.00081212475,0.0010611229,0.00075777085],"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.000121055666,0.00005700074,0.0003829227,0.00004341353,0.000012948389,0.00013187734,0.00008868437,0.024550622,0.011634081,0.945924,0.0018904057,0.01516301],"study_design_scores_gemma":[0.0000616172,0.00014036687,0.0005704425,0.000027210657,0.00002479064,0.0002800282,0.00017962101,0.15503389,0.018651651,0.8098827,0.015110044,0.000037663714],"about_ca_topic_score_codex":0.0005707893,"about_ca_topic_score_gemma":0.0006581044,"teacher_disagreement_score":0.00774058,"about_ca_system_score_codex":0.00053803716,"about_ca_system_score_gemma":0.00046459973,"threshold_uncertainty_score":0.02589482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01128071,0.001666058,0.94534695,0.002008833,0.0003617524,0.000090962894,0.00037496386,0.00032651995,0.03854332],"genre_scores_gemma":[0.5495505,0.0039388137,0.41910797,0.001540903,0.0010174253,0.00070952316,0.0005458458,0.00038178163,0.023207303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976285,0.000984252,0.00014037373,0.00034436054,0.00065324217,0.00024935917],"domain_scores_gemma":[0.9975604,0.001258806,0.00023886128,0.0003227644,0.0004232119,0.00019585184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029544074,0.00097013585,0.00066618563,0.0024873922,0.0021348707,0.0038895905,0.0013647823,0.0012648628,0.007501189],"category_scores_gemma":[0.0059052883,0.0004467855,0.0015208747,0.0022599709,0.0057465103,0.0076201824,0.002525122,0.0030709258,0.0011104611],"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.0000012895553,0.000001712964,0.000008333044,0.000009243573,0.0000013132886,0.000011091442,0.000042197953,0.00075009564,0.00007811104,0.99793017,0.0002517899,0.00091475394],"study_design_scores_gemma":[0.0000025872805,0.000004096779,0.000017546456,0.0000114562645,0.0000029880691,0.00002408571,0.000021885955,0.008171249,0.0001138707,0.9854248,0.0061984044,0.000006937875],"about_ca_topic_score_codex":0.0027848247,"about_ca_topic_score_gemma":0.0019029187,"teacher_disagreement_score":0.007501189,"about_ca_system_score_codex":0.0024964334,"about_ca_system_score_gemma":0.0013918158,"threshold_uncertainty_score":0.025093973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45812327,0.0011577458,0.29015478,0.0013629161,0.0006626739,0.00012308957,0.00029173074,0.00029038452,0.24783348],"genre_scores_gemma":[0.95613194,0.0006852296,0.017252902,0.00020309488,0.000261603,0.000048671514,0.0001344325,0.00005480401,0.025227346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997528,0.00004553811,0.000011815986,0.000028423849,0.00007435761,0.000087075656],"domain_scores_gemma":[0.9998029,0.000034349017,0.000040540945,0.00004821892,0.00003794895,0.000036179074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029609964,0.00041457592,0.00025855654,0.0007192776,0.0007918959,0.0012226613,0.00043879557,0.00042550173,0.005253254],"category_scores_gemma":[0.0007951004,0.0001291781,0.00036310186,0.0005119601,0.0016289869,0.0013927626,0.00088603917,0.0007949171,0.001138923],"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.00000963655,0.0000057978464,0.000060096594,0.000012544409,0.0000014435408,0.000040985404,0.00008988591,0.0010580254,0.00092516356,0.993006,0.00051518186,0.00427525],"study_design_scores_gemma":[0.000008343912,0.000026542019,0.00011037281,0.000015340715,0.0000037803277,0.00013432479,0.00007339265,0.015691373,0.0023150044,0.9742663,0.0073382817,0.0000168524],"about_ca_topic_score_codex":0.00088596443,"about_ca_topic_score_gemma":0.0007981113,"teacher_disagreement_score":0.005253254,"about_ca_system_score_codex":0.0003926374,"about_ca_system_score_gemma":0.00060298917,"threshold_uncertainty_score":0.017573893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72073984,0.0006079575,0.24701104,0.00072834,0.00017691644,0.00007017198,0.0003404598,0.0017568026,0.028568583],"genre_scores_gemma":[0.9511423,0.000088757035,0.046869565,0.00006205133,0.000024801187,0.00002462678,0.00006722005,0.000026254123,0.0016944376],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985771,0.00017399869,0.0000534143,0.00042504122,0.00060525036,0.00016522325],"domain_scores_gemma":[0.9987325,0.0003126474,0.00017968268,0.0005008573,0.0001616764,0.00011268398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065625366,0.00031322503,0.0005816796,0.00035338316,0.0005103187,0.0013477068,0.0008037362,0.00062448904,0.0024302308],"category_scores_gemma":[0.0024933217,0.00046402213,0.0001314909,0.00037392037,0.0013876793,0.0018556011,0.002029056,0.00065617956,0.0004900498],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008426485,0.00013461024,0.0036250523,0.00021718952,0.000092716225,0.00044441273,0.00028399262,0.015106286,0.7081174,0.14542358,0.0027241423,0.12298809],"study_design_scores_gemma":[0.00015692887,0.000548019,0.0026233026,0.000034700253,0.000064694956,0.00096182537,0.00011315426,0.17904097,0.759411,0.043390322,0.013552437,0.00010266502],"about_ca_topic_score_codex":0.00035844144,"about_ca_topic_score_gemma":0.00085819094,"teacher_disagreement_score":0.0024302308,"about_ca_system_score_codex":0.00042421967,"about_ca_system_score_gemma":0.0006764624,"threshold_uncertainty_score":0.008129954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2023169,0.00294941,0.7536473,0.0057471697,0.00035114778,0.00024497052,0.00010731844,0.000529262,0.034106374],"genre_scores_gemma":[0.95338863,0.0011229757,0.04112959,0.00027730595,0.00022654734,0.00012310049,0.00003384589,0.000038358787,0.0036597569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946185,0.0020888695,0.00026502772,0.00061218336,0.0019580454,0.00045753093],"domain_scores_gemma":[0.9901924,0.0066041877,0.0009157471,0.0016476171,0.00043566088,0.00020432769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004252347,0.00072454294,0.00086911186,0.000875741,0.0016522738,0.0024788184,0.0010597823,0.0034594694,0.0031254874],"category_scores_gemma":[0.010904256,0.0006418922,0.00076187775,0.00114521,0.005907133,0.007733807,0.0030037586,0.0030757762,0.00062763656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039887763,0.000058187125,0.00069648144,0.00018293185,0.000053799668,0.0004647201,0.00041278914,0.03462759,0.011509992,0.9213907,0.0018338698,0.028370004],"study_design_scores_gemma":[0.00016719155,0.00020207158,0.00033740368,0.00008214155,0.00004252597,0.0007154221,0.00015143066,0.30682725,0.019957202,0.65947676,0.011965188,0.000075444994],"about_ca_topic_score_codex":0.0003774297,"about_ca_topic_score_gemma":0.00017433909,"teacher_disagreement_score":0.004252347,"about_ca_system_score_codex":0.0017242776,"about_ca_system_score_gemma":0.00089435617,"threshold_uncertainty_score":0.022488832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7961997,0.000503896,0.11884364,0.00093298766,0.00020770806,0.00007315764,0.00012550942,0.00027078282,0.08284272],"genre_scores_gemma":[0.98521465,0.000114772374,0.011111361,0.00010402882,0.000076215736,0.000048305374,0.000059381226,0.000030485526,0.0032408545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884784,0.000261667,0.000061317296,0.00015459997,0.00042035192,0.00025422222],"domain_scores_gemma":[0.99924254,0.00018118168,0.000117089614,0.0002482506,0.00010028375,0.000110646135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010982325,0.00041275582,0.0005482851,0.0013105351,0.0017604588,0.0021077984,0.00066251936,0.0007972798,0.0039498094],"category_scores_gemma":[0.002696915,0.00036562802,0.0007835433,0.00049283064,0.0049230317,0.0026445403,0.0029052082,0.0016965728,0.0005063714],"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.000019223431,0.0000096217245,0.00017444282,0.000017822564,0.000004589767,0.00007624376,0.00020145875,0.0011990794,0.0009782413,0.99487865,0.00032281963,0.0021177086],"study_design_scores_gemma":[0.000010225807,0.000027016338,0.00031357573,0.000011046574,0.0000046842038,0.00009982838,0.00009536507,0.011035441,0.0013000992,0.98556083,0.0015232726,0.000018570376],"about_ca_topic_score_codex":0.00055524096,"about_ca_topic_score_gemma":0.00038397493,"teacher_disagreement_score":0.0039498094,"about_ca_system_score_codex":0.0009944357,"about_ca_system_score_gemma":0.0006125082,"threshold_uncertainty_score":0.013213456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092942916,0.0013926732,0.8583643,0.005769614,0.0004833714,0.00027641928,0.00067332503,0.00064158294,0.03945588],"genre_scores_gemma":[0.93936414,0.0006519427,0.05589473,0.0010219192,0.00021306903,0.00026768868,0.00016894608,0.0000835835,0.0023338897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959603,0.00084887823,0.00024864843,0.0009167942,0.0014764388,0.0005488683],"domain_scores_gemma":[0.99110526,0.005658274,0.00084602006,0.001294931,0.000862455,0.00023293225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038867155,0.0008959566,0.0011620921,0.0009884236,0.0013349768,0.0020733895,0.0013417259,0.0022422322,0.0054236474],"category_scores_gemma":[0.013607657,0.000872139,0.001083616,0.0009813065,0.0052438164,0.004856445,0.0058214115,0.0040553757,0.0010028749],"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.0002247394,0.0000619423,0.00045494523,0.00021631805,0.000048357844,0.0003403592,0.0001645515,0.008892792,0.015998967,0.96350735,0.0018185967,0.008271116],"study_design_scores_gemma":[0.0003225222,0.00015367038,0.0004453231,0.000079526166,0.000058243982,0.0008860078,0.000052368447,0.0784548,0.04380202,0.8689593,0.0066845017,0.000101776735],"about_ca_topic_score_codex":0.0002483662,"about_ca_topic_score_gemma":0.000068939815,"teacher_disagreement_score":0.0054236474,"about_ca_system_score_codex":0.0016329802,"about_ca_system_score_gemma":0.0019803934,"threshold_uncertainty_score":0.020555139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11095811,0.0013364718,0.8645341,0.0017586374,0.00047512242,0.0002185514,0.0003076828,0.0013545788,0.019056823],"genre_scores_gemma":[0.6721096,0.0012314208,0.32173914,0.0003560131,0.00018589439,0.0006057783,0.00022359978,0.00043653284,0.0031120293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.00022080023,0.00003975471,0.00008289395,0.0003940648,0.00006727262],"domain_scores_gemma":[0.99361223,0.004543438,0.00028917208,0.001026516,0.0003912162,0.00013750818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012874993,0.00047967202,0.0008992399,0.00047489023,0.0009142451,0.0007844932,0.0017170649,0.0016350346,0.0054455833],"category_scores_gemma":[0.01083527,0.00046454303,0.00056818477,0.00060811074,0.0012057124,0.00219497,0.00080625794,0.0038353847,0.001142178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003027953,0.00031127085,0.0022269266,0.0005618354,0.000111683774,0.00029358183,0.0003545521,0.5375456,0.049883194,0.35365063,0.003770484,0.050987404],"study_design_scores_gemma":[0.000024743078,0.00007683122,0.00030612116,0.000025259236,0.000013450154,0.000060288545,0.000017304237,0.9532811,0.008770593,0.03478289,0.0026231671,0.000018305804],"about_ca_topic_score_codex":0.0019984143,"about_ca_topic_score_gemma":0.002483369,"teacher_disagreement_score":0.0054455833,"about_ca_system_score_codex":0.0009645954,"about_ca_system_score_gemma":0.0015361337,"threshold_uncertainty_score":0.018217266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5889287,0.00032965795,0.39233616,0.0036647583,0.00016097717,0.0003442338,0.0010110793,0.001049679,0.0121747535],"genre_scores_gemma":[0.9484971,0.00010331679,0.048709717,0.0003036832,0.00011053998,0.00013252482,0.00088315085,0.00008912649,0.0011707561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98667824,0.005459875,0.0008934076,0.0027274808,0.0027427792,0.0014981194],"domain_scores_gemma":[0.9479779,0.04326391,0.0021756545,0.004223372,0.0014276131,0.00093160704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005468432,0.0004873663,0.0013328615,0.0011150568,0.0019990108,0.0043019913,0.0026816027,0.00263536,0.0062167128],"category_scores_gemma":[0.04150958,0.00071010675,0.0013511408,0.0013118009,0.0042324094,0.010851544,0.005071729,0.0038687552,0.0005596501],"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.00232135,0.00085952855,0.0055781915,0.0004858407,0.00023713327,0.00083710067,0.0015522855,0.0751431,0.0135293165,0.7980533,0.006019103,0.0953837],"study_design_scores_gemma":[0.00021302076,0.00017499163,0.0007693767,0.000031608884,0.000052759882,0.00022527603,0.0004022559,0.17498037,0.01239332,0.80923927,0.0014647971,0.000052989366],"about_ca_topic_score_codex":0.0012710036,"about_ca_topic_score_gemma":0.001121043,"teacher_disagreement_score":0.0062167128,"about_ca_system_score_codex":0.002012085,"about_ca_system_score_gemma":0.0016172719,"threshold_uncertainty_score":0.028920174},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19001599,0.01357777,0.11913616,0.029640215,0.0011515856,0.000097898854,0.00081740593,0.00040107686,0.6451619],"genre_scores_gemma":[0.9734491,0.0019272885,0.009844184,0.00073926506,0.0007213477,0.000064159794,0.00013761099,0.00006211907,0.013054996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872273,0.0004797568,0.00004168495,0.00025441888,0.0003477948,0.00015359107],"domain_scores_gemma":[0.99884546,0.0005770969,0.000081862585,0.000233438,0.00014004082,0.00012197595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011901021,0.00032912195,0.00046910418,0.0010265538,0.0025214928,0.0047136536,0.00064934697,0.0009072549,0.0052343383],"category_scores_gemma":[0.0030581364,0.00027894272,0.0005681869,0.0006796719,0.009843334,0.007189345,0.0024191272,0.0024393385,0.00062938925],"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.0000019307397,7.118154e-7,0.000015406044,0.0000036551087,8.6847e-7,0.0000034957611,0.000054802196,0.00015210439,0.00004525899,0.99889416,0.00029691609,0.00053075247],"study_design_scores_gemma":[0.0000023051507,0.0000030759602,0.000061393206,0.0000038009132,0.0000010325377,0.0000076128936,0.00003975325,0.0007079481,0.00005335511,0.99457437,0.004542645,0.0000027657954],"about_ca_topic_score_codex":0.0032133148,"about_ca_topic_score_gemma":0.0012479413,"teacher_disagreement_score":0.0052343383,"about_ca_system_score_codex":0.0028704049,"about_ca_system_score_gemma":0.001077596,"threshold_uncertainty_score":0.0208264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6396169,0.00024810855,0.28614077,0.0033648445,0.00012272627,0.000519737,0.0017987688,0.0008106859,0.067377426],"genre_scores_gemma":[0.93792593,0.00014687073,0.0562187,0.0003030302,0.00006482086,0.000568171,0.00056255184,0.00016666269,0.0040432815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934988,0.0018059891,0.0005061296,0.0012833828,0.0012478621,0.0016578267],"domain_scores_gemma":[0.9604366,0.022254068,0.0035210378,0.0075163986,0.0017949603,0.004476974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003697103,0.0009676878,0.0021038244,0.00081544835,0.0018234781,0.004430834,0.0022389637,0.002575879,0.012127239],"category_scores_gemma":[0.023063239,0.0012756481,0.0014565429,0.00086283014,0.0054902304,0.0090268245,0.005960337,0.004266931,0.0014333589],"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.0009488481,0.00027391582,0.0013088136,0.0002557085,0.00006649854,0.00035662134,0.00039063915,0.02763359,0.014416384,0.9456445,0.0020888369,0.0066155777],"study_design_scores_gemma":[0.00024990595,0.00035219302,0.0013232518,0.00005925781,0.000037946484,0.00044142976,0.00019684866,0.102836385,0.008713919,0.8826333,0.0030676886,0.00008794814],"about_ca_topic_score_codex":0.0005575792,"about_ca_topic_score_gemma":0.00068907026,"teacher_disagreement_score":0.012127239,"about_ca_system_score_codex":0.0016585452,"about_ca_system_score_gemma":0.0027501462,"threshold_uncertainty_score":0.040569723},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5138521,0.0005037449,0.4256895,0.0029136308,0.00043296642,0.00018165798,0.0002225511,0.0016985798,0.054505203],"genre_scores_gemma":[0.9288497,0.00017438548,0.06523366,0.00019680685,0.000067468085,0.00006810933,0.00006053484,0.000071371294,0.005277977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991936,0.00025360932,0.000027344367,0.00013005159,0.0002720922,0.00012331203],"domain_scores_gemma":[0.99858713,0.000688104,0.000066183085,0.00044772643,0.0001335648,0.000077314646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008447442,0.0002337281,0.0005479577,0.00047434506,0.0006793967,0.0013507535,0.0010182166,0.001132474,0.005782428],"category_scores_gemma":[0.0030203564,0.00023616261,0.00047641163,0.00050808967,0.0019540258,0.0030504658,0.0015081277,0.0011842044,0.00076735124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027264847,0.000111193476,0.00064990006,0.000081357015,0.000031365027,0.00016023348,0.00024064242,0.022360064,0.023374736,0.91942614,0.0027368076,0.030554831],"study_design_scores_gemma":[0.000100144236,0.00012290424,0.00035662387,0.000019222227,0.000017608685,0.00009500012,0.00006347636,0.38576367,0.017220257,0.590956,0.005248864,0.000036158388],"about_ca_topic_score_codex":0.00069336424,"about_ca_topic_score_gemma":0.00044154702,"teacher_disagreement_score":0.005782428,"about_ca_system_score_codex":0.00059878407,"about_ca_system_score_gemma":0.000616558,"threshold_uncertainty_score":0.019344151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23745821,0.0003782161,0.7544198,0.0015465735,0.00004678365,0.000107364314,0.00062856765,0.0007856624,0.004628795],"genre_scores_gemma":[0.79511803,0.00038904345,0.19813463,0.00019799157,0.00014385975,0.00011835319,0.0012773682,0.00024503667,0.004375706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701947,0.00072865305,0.00013493042,0.0009004789,0.00080971146,0.00040667542],"domain_scores_gemma":[0.97948396,0.014630701,0.0013248991,0.0031149506,0.0010564532,0.00038902846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024816806,0.00076803856,0.0017203499,0.0009033108,0.0012048732,0.0030611472,0.0020735562,0.0014934884,0.004821478],"category_scores_gemma":[0.019342242,0.00063446094,0.0012492012,0.001281048,0.0022337257,0.0069533605,0.0019676117,0.0031234839,0.00064293825],"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.0006720202,0.00031881648,0.0070109167,0.0004304905,0.00017023916,0.0002418524,0.00054547074,0.43278095,0.006126238,0.43385395,0.006287117,0.111561924],"study_design_scores_gemma":[0.00003420224,0.00006999296,0.001013134,0.000017158583,0.000021481637,0.0000805081,0.00010716131,0.61926246,0.0035281512,0.3740738,0.0017549305,0.0000370175],"about_ca_topic_score_codex":0.004741494,"about_ca_topic_score_gemma":0.003297523,"teacher_disagreement_score":0.004821478,"about_ca_system_score_codex":0.0019375962,"about_ca_system_score_gemma":0.002582052,"threshold_uncertainty_score":0.016129434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02407892,0.00038583516,0.9666873,0.0004384779,0.000078762634,0.000034173256,0.000049453374,0.00013307208,0.00811411],"genre_scores_gemma":[0.5394453,0.0018590884,0.4479568,0.00043364885,0.00031114416,0.00018377256,0.00025783823,0.00019770839,0.009354727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987469,0.0004885526,0.000046923928,0.00012917841,0.0004502535,0.0001382214],"domain_scores_gemma":[0.99566346,0.0030252896,0.00025163064,0.00041318304,0.0005647227,0.0000817487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013481112,0.0007787087,0.0008186842,0.00077091844,0.00052062643,0.0009943018,0.0010431618,0.0013319376,0.0018654714],"category_scores_gemma":[0.0118595725,0.00032452992,0.0005153592,0.0014838496,0.0021518604,0.001704936,0.0018120713,0.0014828263,0.0007845691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012432087,0.000043366537,0.00050131086,0.00013114781,0.0000385156,0.00013972785,0.0002641147,0.5621963,0.005210654,0.36358726,0.0020912162,0.06567203],"study_design_scores_gemma":[0.000012298626,0.000026925198,0.00005968053,0.000016511098,0.000006147035,0.00004305705,0.0000144034875,0.82939583,0.002584076,0.16685951,0.00096830714,0.000013269065],"about_ca_topic_score_codex":0.0017892921,"about_ca_topic_score_gemma":0.0014812251,"teacher_disagreement_score":0.0018654714,"about_ca_system_score_codex":0.0006762629,"about_ca_system_score_gemma":0.0011659702,"threshold_uncertainty_score":0.00712955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28749624,0.0008295024,0.69354045,0.0015887647,0.00006272448,0.00033701205,0.00016764089,0.00032754263,0.015650148],"genre_scores_gemma":[0.90412587,0.00055073865,0.09135567,0.00022578397,0.000066628294,0.00039240447,0.00014829548,0.000086440275,0.0030482032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99141955,0.0041095996,0.000446053,0.0012713922,0.0019438624,0.0008096546],"domain_scores_gemma":[0.9877103,0.00750359,0.0018786411,0.0018046594,0.00064836023,0.00045434057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00669068,0.0010504904,0.001505016,0.0009308503,0.0008443809,0.001824507,0.0020169665,0.0017465542,0.0013641593],"category_scores_gemma":[0.022629919,0.00079733826,0.000893389,0.0012374163,0.003763191,0.004828299,0.004553223,0.0030537217,0.00023951508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003862531,0.00015344478,0.0007993213,0.00012521626,0.000106060674,0.00019113056,0.0002947816,0.5753336,0.00711298,0.39615908,0.0010907676,0.01824734],"study_design_scores_gemma":[0.00003820815,0.00007585645,0.00024818274,0.00001693177,0.000019600047,0.000034290675,0.000033820856,0.844319,0.0013522172,0.15335229,0.00048761404,0.00002199351],"about_ca_topic_score_codex":0.0013314133,"about_ca_topic_score_gemma":0.0012665741,"teacher_disagreement_score":0.00669068,"about_ca_system_score_codex":0.003032276,"about_ca_system_score_gemma":0.0020537141,"threshold_uncertainty_score":0.03538412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07061537,0.011496047,0.6436567,0.018224064,0.0016027121,0.00019595261,0.00132827,0.0011682223,0.25171277],"genre_scores_gemma":[0.83883697,0.00673854,0.114130095,0.0044556917,0.002324733,0.00064461905,0.0015252553,0.0009514068,0.030392686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99180824,0.0012048365,0.00027647265,0.0013112465,0.0037917036,0.0016075629],"domain_scores_gemma":[0.98369265,0.011632688,0.0003982059,0.0020607286,0.0016385138,0.00057716697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004350932,0.0016479054,0.0024998055,0.0030761652,0.00297647,0.0065748175,0.003924363,0.0038197993,0.019531287],"category_scores_gemma":[0.021551285,0.00089634856,0.0017593062,0.003796484,0.00588323,0.017107956,0.0065838965,0.010067008,0.0032768738],"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.00013711497,0.00008400419,0.00029962577,0.0001856445,0.000029562696,0.00006608775,0.00015775321,0.014588487,0.0013924214,0.9611385,0.007037054,0.014883775],"study_design_scores_gemma":[0.000023283294,0.000023152386,0.00013800389,0.000047138936,0.00001726613,0.000047875194,0.00003170846,0.047804832,0.00091839844,0.9469478,0.0039768857,0.000023678498],"about_ca_topic_score_codex":0.0021024924,"about_ca_topic_score_gemma":0.0020003524,"teacher_disagreement_score":0.019531287,"about_ca_system_score_codex":0.005058613,"about_ca_system_score_gemma":0.0026813005,"threshold_uncertainty_score":0.06533861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3913102,0.000462123,0.5918058,0.00071454636,0.000041768904,0.00012433257,0.00034783714,0.00030534095,0.014888181],"genre_scores_gemma":[0.9559577,0.00032785244,0.037872504,0.00013689006,0.00006420651,0.00028990104,0.00036330748,0.00011876044,0.0048689963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877065,0.00035355228,0.00006069889,0.00022763832,0.00032976986,0.00025762597],"domain_scores_gemma":[0.99500716,0.0025917941,0.0008153468,0.00051886356,0.0004603793,0.0006064996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702447,0.00072638405,0.00090016826,0.0010871476,0.0009483122,0.0018391737,0.0012883947,0.0012599779,0.0042224634],"category_scores_gemma":[0.008396795,0.00044430178,0.0008409214,0.0007658143,0.002085878,0.0043000863,0.0020508177,0.0022732322,0.00040762246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015857823,0.000055270193,0.0007410662,0.000065208165,0.000023117253,0.0001368668,0.00017376227,0.059148237,0.0072524613,0.92794216,0.0004895519,0.0038138109],"study_design_scores_gemma":[0.000026048383,0.000049831426,0.00033624299,0.00001821848,0.000007953131,0.00008117363,0.0000448421,0.6789185,0.0028820613,0.316866,0.00073835574,0.000030831314],"about_ca_topic_score_codex":0.0011128305,"about_ca_topic_score_gemma":0.0007706966,"teacher_disagreement_score":0.0042224634,"about_ca_system_score_codex":0.001417584,"about_ca_system_score_gemma":0.0012618545,"threshold_uncertainty_score":0.014125526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0085257925,0.00093629386,0.9225138,0.0013350053,0.0020882108,0.000118649696,0.00022714953,0.00079533795,0.063459784],"genre_scores_gemma":[0.48088005,0.0025808192,0.42372274,0.0020107904,0.001363528,0.00030601578,0.00040601246,0.0008140933,0.087915964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979285,0.0005105781,0.000093118324,0.00025783695,0.0010316774,0.0001783251],"domain_scores_gemma":[0.9979317,0.0005478724,0.00014250336,0.0007985245,0.0005042087,0.0000752111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001734251,0.0005634132,0.0008343133,0.000990589,0.001258031,0.0015807283,0.0018409316,0.001177117,0.012273639],"category_scores_gemma":[0.005520069,0.00021331852,0.00077258644,0.0012038007,0.0024606674,0.003245664,0.0022296559,0.0020125313,0.0022184427],"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.000020452424,0.000008413349,0.000053020718,0.000047083366,0.000006296844,0.000037988008,0.000060681974,0.0023674984,0.0012395473,0.9788269,0.0024679697,0.014864188],"study_design_scores_gemma":[0.000026525482,0.000074081116,0.00013058979,0.00006316728,0.000020404177,0.00035280702,0.000045052442,0.07150278,0.0074213073,0.8468129,0.073488764,0.00006158502],"about_ca_topic_score_codex":0.0007699045,"about_ca_topic_score_gemma":0.0005724421,"teacher_disagreement_score":0.012273639,"about_ca_system_score_codex":0.0008445112,"about_ca_system_score_gemma":0.0013044955,"threshold_uncertainty_score":0.041059434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60010356,0.00036256228,0.3929759,0.0005076551,0.000059043698,0.00014122708,0.00009249655,0.00031659397,0.005441026],"genre_scores_gemma":[0.9848417,0.000113385264,0.01450921,0.000050195737,0.00002705908,0.000055865967,0.000027582353,0.000013558803,0.0003615241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952987,0.0013397702,0.00026081683,0.0004360017,0.0019226192,0.00074222],"domain_scores_gemma":[0.9732021,0.018615652,0.00305031,0.0035553921,0.0010999657,0.0004766755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039151157,0.0011432953,0.0009851065,0.001171516,0.00076629786,0.0014889487,0.0012214791,0.0013400402,0.0016114287],"category_scores_gemma":[0.018648716,0.0004644388,0.0005659404,0.0008646647,0.0025808269,0.0036175705,0.004079118,0.0018147886,0.00038892034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042867246,0.0005736871,0.008883913,0.0004025767,0.00037748387,0.001012265,0.0005486484,0.28358805,0.2551888,0.35239992,0.0011391854,0.091598846],"study_design_scores_gemma":[0.00017170263,0.0010711538,0.0008076784,0.000037279486,0.000065224565,0.00047836662,0.000077465396,0.7540597,0.13287884,0.109024145,0.001270384,0.000057960056],"about_ca_topic_score_codex":0.00014300164,"about_ca_topic_score_gemma":0.00012931084,"teacher_disagreement_score":0.0039151157,"about_ca_system_score_codex":0.00090580113,"about_ca_system_score_gemma":0.00061893754,"threshold_uncertainty_score":0.020705342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0861471,0.00043175253,0.8889553,0.0004503678,0.00018798606,0.00017411936,0.000096080475,0.0010858336,0.022471441],"genre_scores_gemma":[0.40439835,0.00039128365,0.58119047,0.00025995725,0.0001604493,0.00012187402,0.0003441507,0.00038587788,0.012747647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992593,0.00013071643,0.000035001307,0.00014835878,0.0003039564,0.00012261477],"domain_scores_gemma":[0.99931,0.00021576756,0.00004322559,0.0002335439,0.00014061542,0.00005691583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005604498,0.0005564256,0.00048764373,0.00082837197,0.0006592749,0.0011298298,0.000651883,0.0004907783,0.008103149],"category_scores_gemma":[0.0018836216,0.0002242476,0.0005640553,0.00056490296,0.0012883855,0.0028236946,0.0018723105,0.0011563792,0.0017788945],"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.00013480491,0.00010156511,0.00051867875,0.000126301,0.000029378705,0.00021413749,0.0007616137,0.012659072,0.028686851,0.6835369,0.003563085,0.26966769],"study_design_scores_gemma":[0.000035822675,0.00013947504,0.00020557515,0.00003503148,0.000018970564,0.0002543094,0.00027861175,0.07109831,0.027645085,0.85859287,0.041669343,0.000026581427],"about_ca_topic_score_codex":0.0006101049,"about_ca_topic_score_gemma":0.00069877255,"teacher_disagreement_score":0.008103149,"about_ca_system_score_codex":0.00041635337,"about_ca_system_score_gemma":0.00068523077,"threshold_uncertainty_score":0.027107775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29429555,0.0012902584,0.66579646,0.001858112,0.00014458843,0.00012430697,0.00016477454,0.0022128066,0.034113083],"genre_scores_gemma":[0.9545313,0.00026459584,0.0428934,0.0001581759,0.00004682864,0.00010061878,0.00006403934,0.0001288974,0.0018121921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863726,0.00030014117,0.000085727326,0.00032962803,0.00041313085,0.00023414464],"domain_scores_gemma":[0.99581724,0.002285862,0.00032025023,0.0011678827,0.000266246,0.00014242264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014085062,0.0004999254,0.0006417083,0.00094462035,0.0007808104,0.0016148138,0.0010716374,0.00079948985,0.0029400242],"category_scores_gemma":[0.0070105805,0.0005609639,0.0005653185,0.00062245206,0.0041943337,0.004118053,0.0036251713,0.0021732727,0.0004008802],"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.00015884686,0.000050542338,0.00046586056,0.00013340778,0.000022671546,0.000078419434,0.00020294223,0.019246163,0.023403686,0.9265006,0.00073528674,0.029001525],"study_design_scores_gemma":[0.000039716688,0.00010135022,0.0002679076,0.000031453445,0.000023625711,0.00010449215,0.00003446877,0.17972438,0.053302422,0.76258785,0.003736561,0.00004592214],"about_ca_topic_score_codex":0.000348578,"about_ca_topic_score_gemma":0.00036175712,"teacher_disagreement_score":0.0029400242,"about_ca_system_score_codex":0.00091433316,"about_ca_system_score_gemma":0.00052823685,"threshold_uncertainty_score":0.009835362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88745576,0.00021006203,0.10200952,0.0017672245,0.000019454732,0.000059571517,0.0015693553,0.00039745698,0.00651155],"genre_scores_gemma":[0.9769654,0.00009728399,0.019774372,0.00014620794,0.000026791398,0.00007539379,0.0010192627,0.00009210532,0.0018031679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867296,0.00040564762,0.00007743641,0.00030779923,0.00031740387,0.00021889602],"domain_scores_gemma":[0.9917046,0.005876195,0.000722021,0.00088956824,0.00043126632,0.00037637408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013719975,0.0004844721,0.0010398647,0.0007823015,0.0009792136,0.0029844914,0.0021429127,0.0013763071,0.00478559],"category_scores_gemma":[0.009674729,0.00047091913,0.0012433614,0.00092284946,0.0016465967,0.0057073007,0.0016512359,0.0019396187,0.00024796778],"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.0008601958,0.00022931412,0.010476677,0.00041702462,0.0001687232,0.0004921426,0.0007971779,0.4236504,0.009253957,0.53295255,0.003985627,0.01671621],"study_design_scores_gemma":[0.00005403926,0.000044942706,0.0011458783,0.00001706656,0.000034546523,0.0001234282,0.00009970738,0.54831094,0.0023912867,0.44709322,0.00066745334,0.00001750569],"about_ca_topic_score_codex":0.0046106246,"about_ca_topic_score_gemma":0.0049148225,"teacher_disagreement_score":0.00478559,"about_ca_system_score_codex":0.0029198576,"about_ca_system_score_gemma":0.001324758,"threshold_uncertainty_score":0.0211851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24914165,0.0008426237,0.67083734,0.0022022657,0.00012778067,0.00011742443,0.00017610574,0.00034372206,0.07621114],"genre_scores_gemma":[0.9620589,0.00036178343,0.031608112,0.00018715793,0.000089045316,0.00006310225,0.00006646748,0.000049048384,0.0055164965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981964,0.00043943175,0.00009747597,0.00027616016,0.000671647,0.00031889803],"domain_scores_gemma":[0.9954602,0.0028016493,0.00038528224,0.0008767683,0.00031439433,0.00016169995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013686912,0.00040398032,0.00042039526,0.0006665048,0.0006545169,0.0018261106,0.00073248526,0.00087389007,0.004868681],"category_scores_gemma":[0.0061448882,0.0002813425,0.00046542197,0.00050193205,0.0046398216,0.0046831113,0.0025308693,0.0018597302,0.0005248437],"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.000034337725,0.000019782312,0.000093180766,0.000031592874,0.0000032586277,0.000071924085,0.00011006321,0.005373817,0.00231647,0.9864292,0.0003028764,0.0052134516],"study_design_scores_gemma":[0.00002089783,0.000052453335,0.000103252016,0.00001456821,0.000004566023,0.00013161576,0.00004546051,0.04497974,0.0062543186,0.9459402,0.0024389587,0.000014005861],"about_ca_topic_score_codex":0.00046051087,"about_ca_topic_score_gemma":0.00032916997,"teacher_disagreement_score":0.004868681,"about_ca_system_score_codex":0.0009573924,"about_ca_system_score_gemma":0.0008163545,"threshold_uncertainty_score":0.016287386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08873318,0.0006659902,0.887571,0.0006186845,0.00019421802,0.00016833803,0.0003328738,0.0016597265,0.02005608],"genre_scores_gemma":[0.6551095,0.00045555813,0.33279717,0.00059055036,0.00013072725,0.00046778546,0.00036543806,0.00035302015,0.009730227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688405,0.0007968658,0.0002173913,0.0005254003,0.0010967506,0.00047956363],"domain_scores_gemma":[0.9949987,0.0025210413,0.0002723052,0.0016435656,0.0003954763,0.00016892873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016268945,0.00065072475,0.0006868195,0.00070459093,0.00082957617,0.0022088333,0.0017051267,0.0014495986,0.010543025],"category_scores_gemma":[0.009537213,0.0009619889,0.0009968085,0.00090355956,0.0022857492,0.0056271427,0.0042446977,0.0024657228,0.0022187151],"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.0003720259,0.00010308525,0.000573905,0.0003098286,0.000039365616,0.00012578905,0.00033969557,0.02801154,0.012867238,0.8836005,0.0028646854,0.070792325],"study_design_scores_gemma":[0.00009746714,0.00015642772,0.00019965552,0.00006773582,0.000037036363,0.00019503647,0.00006569014,0.10457205,0.018147873,0.86830163,0.008107856,0.000051632916],"about_ca_topic_score_codex":0.0003344399,"about_ca_topic_score_gemma":0.0005014837,"teacher_disagreement_score":0.010543025,"about_ca_system_score_codex":0.0011781063,"about_ca_system_score_gemma":0.0009545407,"threshold_uncertainty_score":0.035269916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5627203,0.0019002415,0.37475693,0.012243167,0.00031688757,0.00036045478,0.0011948347,0.00094228017,0.04556492],"genre_scores_gemma":[0.96845084,0.00056984666,0.02504025,0.00041525366,0.0001726957,0.00015656951,0.00039554652,0.0001664004,0.004632629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926002,0.0017952824,0.00034737564,0.0011213535,0.002499357,0.0016365309],"domain_scores_gemma":[0.9641003,0.028265571,0.0010631811,0.0044753463,0.001466587,0.0006289678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045491536,0.0005372792,0.0014926426,0.0010824864,0.001987233,0.004549464,0.0028276113,0.0019863492,0.011262653],"category_scores_gemma":[0.031391867,0.00056405424,0.001316993,0.0018170478,0.004230123,0.0134155005,0.0042856433,0.0035725115,0.00077885046],"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.0013446343,0.00025508783,0.00300592,0.0004517977,0.00014700078,0.0002982485,0.0004894823,0.1765944,0.00887009,0.7567762,0.0074996464,0.044267375],"study_design_scores_gemma":[0.00014263656,0.000088621404,0.0008605516,0.000036953614,0.00006896645,0.00015646585,0.00017259982,0.5735083,0.0047657653,0.41803014,0.0021194261,0.000049530958],"about_ca_topic_score_codex":0.0049708225,"about_ca_topic_score_gemma":0.0035465844,"teacher_disagreement_score":0.011262653,"about_ca_system_score_codex":0.0059439084,"about_ca_system_score_gemma":0.004325368,"threshold_uncertainty_score":0.043126285},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53095627,0.002283024,0.4098731,0.012584823,0.00053731614,0.00033990867,0.0009383211,0.0027751075,0.039712112],"genre_scores_gemma":[0.9356082,0.0010670391,0.059238546,0.00060322735,0.00011820958,0.00034636288,0.0004873881,0.00026863467,0.0022623155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725455,0.0013490793,0.0001692268,0.00035141452,0.0006080536,0.00026774433],"domain_scores_gemma":[0.9636333,0.027542084,0.0009418206,0.0063052126,0.0009592179,0.0006183951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004049114,0.0006350738,0.0011186682,0.00050932396,0.0010839228,0.0010906724,0.0024329848,0.0019312643,0.004838797],"category_scores_gemma":[0.027503947,0.00066578895,0.0010493691,0.00059236714,0.0022636005,0.006851499,0.002147741,0.0034805553,0.0005963416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000668335,0.00026810722,0.0033446914,0.0005125947,0.00011528223,0.00017209911,0.00027771507,0.77317244,0.010728458,0.1714625,0.0059286156,0.033349086],"study_design_scores_gemma":[0.000046748428,0.00005789619,0.00015096823,0.000020104791,0.0000132806135,0.000034183162,0.000020404204,0.922906,0.0030234205,0.07195915,0.0017567278,0.000011145536],"about_ca_topic_score_codex":0.0020882217,"about_ca_topic_score_gemma":0.0022472676,"teacher_disagreement_score":0.004838797,"about_ca_system_score_codex":0.001315183,"about_ca_system_score_gemma":0.0014966996,"threshold_uncertainty_score":0.021413982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24539144,0.0038934662,0.6964968,0.00514769,0.00023252939,0.00018837505,0.0007779677,0.00097575417,0.046896014],"genre_scores_gemma":[0.9113518,0.0014585763,0.08028357,0.0005540151,0.00027023218,0.0003586717,0.0004828235,0.0005345349,0.004705671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934123,0.00274508,0.00019400306,0.0009274268,0.0012091531,0.0015121248],"domain_scores_gemma":[0.9444432,0.04516651,0.0017566229,0.0044936705,0.0019158635,0.0022241652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009443678,0.0026662508,0.0024874548,0.0031973107,0.001847629,0.0056097195,0.0033697449,0.003453548,0.0058758073],"category_scores_gemma":[0.0554755,0.0011554115,0.0010585836,0.0022649772,0.006170676,0.012775908,0.0066130213,0.004452022,0.0007196125],"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.0006248229,0.00015079227,0.00073898927,0.00022791525,0.0000658426,0.000058433423,0.00029317345,0.23637344,0.002185383,0.7383523,0.0032608134,0.0176681],"study_design_scores_gemma":[0.00004369526,0.00007476977,0.00030783194,0.00008122331,0.000028014772,0.0000381459,0.00009502743,0.42064872,0.0020297745,0.5754633,0.0011501189,0.00003935329],"about_ca_topic_score_codex":0.001964914,"about_ca_topic_score_gemma":0.0019144535,"teacher_disagreement_score":0.009443678,"about_ca_system_score_codex":0.007695694,"about_ca_system_score_gemma":0.003566233,"threshold_uncertainty_score":0.05583638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084491655,0.00083005434,0.84667003,0.0027822529,0.00032819124,0.00011163995,0.0006513208,0.00041495726,0.063719936],"genre_scores_gemma":[0.8857225,0.0011493339,0.09648052,0.0007618885,0.00048452025,0.0002205813,0.00038927936,0.00030070407,0.014490687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730897,0.00084233005,0.00013932704,0.0004951389,0.0007055377,0.00050874025],"domain_scores_gemma":[0.9960808,0.0016414272,0.00062115025,0.00090123265,0.00045982833,0.00029562865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022448706,0.0008189298,0.0007455148,0.0015717212,0.0018920457,0.0046551344,0.0014216988,0.002268194,0.0072812634],"category_scores_gemma":[0.007172147,0.00049117726,0.0011196279,0.0017474488,0.00918357,0.012599356,0.0032378817,0.0043869973,0.0010196291],"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.000008535219,0.000004534958,0.000030097743,0.000006914154,0.0000013724504,0.000014267573,0.000031004824,0.0005783395,0.00014332849,0.9978956,0.0002044758,0.0010814324],"study_design_scores_gemma":[0.0000047303774,0.000010611101,0.000038203405,0.0000072257358,0.0000024146284,0.000058338406,0.000030471805,0.006467636,0.00044440795,0.9916046,0.0013198723,0.00001136331],"about_ca_topic_score_codex":0.0007505024,"about_ca_topic_score_gemma":0.00045394796,"teacher_disagreement_score":0.0072812634,"about_ca_system_score_codex":0.0013323716,"about_ca_system_score_gemma":0.0011425654,"threshold_uncertainty_score":0.024358273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068495065,0.00009193485,0.9214879,0.00014773395,0.00007275441,0.00008180599,0.00004003281,0.0008292239,0.008753528],"genre_scores_gemma":[0.7051917,0.00015209826,0.29042545,0.000078714445,0.000031417316,0.00019752515,0.000079527934,0.00019987638,0.0036437379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940825,0.00023669809,0.000028407496,0.000074933625,0.00019589473,0.000055952747],"domain_scores_gemma":[0.9991906,0.00042551677,0.000047442285,0.00021043787,0.000081765706,0.000044332675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006031374,0.00042217955,0.0005114524,0.0002943453,0.00050040195,0.00071343593,0.0010749752,0.000627151,0.004281513],"category_scores_gemma":[0.0021592479,0.0003464864,0.00042506025,0.00046975457,0.00089956337,0.0017744226,0.0012269509,0.0010164954,0.00058990926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000338115,0.00020267515,0.00067477056,0.00011939852,0.00006936661,0.00020140769,0.0002131631,0.5575769,0.022731816,0.34375253,0.0019284745,0.07219135],"study_design_scores_gemma":[0.000020112706,0.00004378869,0.000029916162,0.0000028549453,0.0000059133113,0.000022486294,0.000008335177,0.9678909,0.005400462,0.025713565,0.0008525028,0.00000914435],"about_ca_topic_score_codex":0.00070279866,"about_ca_topic_score_gemma":0.0009840112,"teacher_disagreement_score":0.004281513,"about_ca_system_score_codex":0.00036156696,"about_ca_system_score_gemma":0.00057654607,"threshold_uncertainty_score":0.014323115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46819922,0.00062419334,0.4858927,0.0043331576,0.00037771533,0.00035533326,0.0003384017,0.0019442871,0.037935086],"genre_scores_gemma":[0.96543837,0.000139423,0.030918047,0.00030444944,0.00005836984,0.0000704031,0.00005100297,0.00004521264,0.0029748483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974074,0.0007912211,0.00011336172,0.00033583483,0.0008803821,0.00047187362],"domain_scores_gemma":[0.99656135,0.0017050664,0.00039523616,0.0010262561,0.00016888465,0.00014312101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014245652,0.00064008206,0.0007438177,0.00086191396,0.0012924057,0.0013015491,0.0014565227,0.0028308749,0.003112865],"category_scores_gemma":[0.005746766,0.0004093288,0.0009419,0.001031114,0.003561766,0.0037718085,0.0035262587,0.0030727014,0.0007120465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008527233,0.00016287662,0.0024483518,0.00012114402,0.000121429715,0.0008649921,0.00083644275,0.040273078,0.04109102,0.8545247,0.0070052496,0.051698085],"study_design_scores_gemma":[0.0001940861,0.000373844,0.0010368446,0.000081027465,0.00008335976,0.0012735247,0.00014749395,0.48039025,0.061498888,0.44151708,0.013267098,0.00013659862],"about_ca_topic_score_codex":0.00056493987,"about_ca_topic_score_gemma":0.00029444773,"teacher_disagreement_score":0.003112865,"about_ca_system_score_codex":0.0013545157,"about_ca_system_score_gemma":0.00071851956,"threshold_uncertainty_score":0.0104135275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17810117,0.0018048144,0.59341997,0.012125924,0.00036302212,0.00013269689,0.00028770373,0.00016512237,0.21359965],"genre_scores_gemma":[0.8943958,0.00087173615,0.090669654,0.0008773178,0.0004603278,0.00017814564,0.0002121318,0.0000447775,0.012290192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755365,0.0009345449,0.00018190593,0.00033883192,0.0006914508,0.00029954343],"domain_scores_gemma":[0.9961979,0.0016936661,0.0004945376,0.0006282751,0.00069293246,0.0002926751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033974003,0.00040200684,0.0006297289,0.0018469398,0.0022765843,0.0031282564,0.0013516317,0.0026026962,0.0052146167],"category_scores_gemma":[0.0070656384,0.00036870298,0.00085193693,0.0011753774,0.010224653,0.008615402,0.004182125,0.0033297183,0.00047637644],"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.0000023425246,0.000003723444,0.00004417613,0.000013066199,0.0000010152203,0.000013830196,0.00005981814,0.0003860268,0.00004599899,0.99847025,0.00015492254,0.0008048869],"study_design_scores_gemma":[0.0000036871886,0.000008457785,0.00007675185,0.000010693202,0.0000022817158,0.00005830854,0.00011175735,0.0045223087,0.00014343346,0.99366933,0.0013864473,0.000006651507],"about_ca_topic_score_codex":0.00055531185,"about_ca_topic_score_gemma":0.0004916279,"teacher_disagreement_score":0.0052146167,"about_ca_system_score_codex":0.0013783205,"about_ca_system_score_gemma":0.0013160632,"threshold_uncertainty_score":0.017967403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10233586,0.0014737854,0.66357833,0.0047844364,0.0004091373,0.000113187176,0.00037851703,0.00018361793,0.22674319],"genre_scores_gemma":[0.9280986,0.00077552,0.056201328,0.0008640856,0.0005323604,0.000191259,0.00016972507,0.00007278638,0.013094361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977639,0.0005042316,0.000091963106,0.00029724804,0.0009570099,0.0003856535],"domain_scores_gemma":[0.99539465,0.002470833,0.0004811428,0.0006413075,0.0007218554,0.00029025992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018029286,0.00042803664,0.00056569447,0.0020468223,0.0020404896,0.0030232954,0.0010689232,0.0017002749,0.008141796],"category_scores_gemma":[0.00670954,0.00032676768,0.0008777722,0.0012523415,0.0051644547,0.006067403,0.0034301241,0.0030988853,0.00090820447],"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.000001560535,0.0000027863196,0.000018284487,0.0000042659826,8.3274665e-7,0.000007412103,0.000026008547,0.00029015503,0.000103426304,0.9989189,0.000115132505,0.0005114247],"study_design_scores_gemma":[0.0000017288339,0.0000038939666,0.000034037213,0.0000051585694,0.0000011518922,0.000025111183,0.000016332633,0.004673215,0.00015287522,0.99418926,0.00089270883,0.00000441272],"about_ca_topic_score_codex":0.0013117597,"about_ca_topic_score_gemma":0.0010696047,"teacher_disagreement_score":0.008141796,"about_ca_system_score_codex":0.0021416254,"about_ca_system_score_gemma":0.0013651515,"threshold_uncertainty_score":0.027236998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4277978,0.0011750854,0.5393936,0.001534544,0.00012842259,0.00012783289,0.00020088957,0.0009139277,0.028728016],"genre_scores_gemma":[0.9416426,0.0002361444,0.055524413,0.00010315834,0.0000421239,0.00009955121,0.00008261794,0.00005433948,0.002215044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885416,0.0002671721,0.000041763382,0.00015899746,0.00051822956,0.00015967913],"domain_scores_gemma":[0.994789,0.0035064905,0.0003643957,0.00081977935,0.0003505325,0.00016978245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015324156,0.00043051786,0.0008103279,0.0006938927,0.0008641684,0.0008569007,0.0015946598,0.00089381565,0.0025446764],"category_scores_gemma":[0.0077390526,0.0002665981,0.00030003223,0.00068332715,0.003312747,0.0027056257,0.002050767,0.0025029322,0.00029689964],"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.00051468087,0.00015110066,0.0009936228,0.00017863911,0.000041257914,0.00018720611,0.0002511649,0.11823383,0.033051353,0.82367134,0.0018932789,0.020832533],"study_design_scores_gemma":[0.00006986393,0.00016571942,0.0003143267,0.00002729005,0.00002047985,0.000112615766,0.000023694593,0.6829125,0.04303699,0.27073708,0.0025357392,0.00004373916],"about_ca_topic_score_codex":0.00044209647,"about_ca_topic_score_gemma":0.00040733465,"teacher_disagreement_score":0.0025446764,"about_ca_system_score_codex":0.0013268681,"about_ca_system_score_gemma":0.00083153887,"threshold_uncertainty_score":0.009627163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48740417,0.0004169984,0.37774536,0.0065242373,0.0002708543,0.0001880703,0.00062722695,0.00037247865,0.12645048],"genre_scores_gemma":[0.97672826,0.0001380732,0.01729959,0.00031715145,0.000055533368,0.00014396747,0.0001566741,0.00003299679,0.0051276577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596316,0.0014784227,0.0002613788,0.00082754786,0.0008117181,0.00065779214],"domain_scores_gemma":[0.99043006,0.0057513663,0.0009790735,0.0013281144,0.00087064947,0.00064082455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045606075,0.0005605427,0.0010028535,0.0010049313,0.0024020418,0.0029988475,0.0014994551,0.0025541477,0.010795073],"category_scores_gemma":[0.013847933,0.00047296195,0.0010462233,0.0011895649,0.006221549,0.010653361,0.0048808525,0.0032932502,0.0006574697],"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.000026084721,0.0000128529055,0.00011850316,0.00002099169,0.000005965846,0.000047486305,0.00007722201,0.0013627708,0.00018107975,0.9960001,0.00033826652,0.0018086979],"study_design_scores_gemma":[0.0000143101315,0.000010660767,0.00010341481,0.000008057291,0.0000046228683,0.00004842062,0.000069671245,0.008154162,0.0006827601,0.99021417,0.0006771219,0.000012694238],"about_ca_topic_score_codex":0.0009691986,"about_ca_topic_score_gemma":0.0004988529,"teacher_disagreement_score":0.010795073,"about_ca_system_score_codex":0.0019300182,"about_ca_system_score_gemma":0.00140788,"threshold_uncertainty_score":0.036113143},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75460756,0.00028760446,0.21146753,0.0004735225,0.000097836724,0.000086640925,0.00008322329,0.000402881,0.032493215],"genre_scores_gemma":[0.97520214,0.00014239084,0.018908055,0.000086651096,0.000017576021,0.0000646361,0.000048787795,0.00010264471,0.005427113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995258,0.000113908085,0.000018276292,0.000081074526,0.00012791457,0.00013303624],"domain_scores_gemma":[0.998816,0.0005010937,0.00012852623,0.00036066116,0.00008452428,0.00010922713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007205664,0.0005613795,0.00039263853,0.0005549684,0.0011377198,0.0012223714,0.00065604236,0.001082541,0.008683593],"category_scores_gemma":[0.002345586,0.0003057859,0.00047615494,0.00044870848,0.0022661444,0.0030779042,0.0018605279,0.0015796812,0.0004682281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001606669,0.00006916836,0.0004303587,0.000071156595,0.00001435877,0.0002803406,0.00032741463,0.025467398,0.021856586,0.9408469,0.0004884241,0.0099872155],"study_design_scores_gemma":[0.000026664637,0.00015890863,0.00031101558,0.000025975236,0.000007887277,0.00016187433,0.00012729093,0.11116143,0.030005101,0.85610586,0.0018830035,0.000025037381],"about_ca_topic_score_codex":0.00020024167,"about_ca_topic_score_gemma":0.00022962118,"teacher_disagreement_score":0.008683593,"about_ca_system_score_codex":0.00067332044,"about_ca_system_score_gemma":0.00037965048,"threshold_uncertainty_score":0.029049516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106632166,0.001794654,0.7512225,0.0029089982,0.00038439973,0.00016711128,0.00050140196,0.00096803566,0.13542068],"genre_scores_gemma":[0.91229635,0.00093499024,0.057458248,0.00041935916,0.00032601113,0.00025760967,0.00022319466,0.00019341602,0.027890623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992495,0.00025638836,0.000029592282,0.00014637406,0.00019156579,0.00012662148],"domain_scores_gemma":[0.99917716,0.0002506776,0.00007206506,0.00021772787,0.00014208184,0.0001402745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092165713,0.0005088615,0.0007872112,0.0006915346,0.0013605892,0.00216317,0.0016777376,0.0013201224,0.009986879],"category_scores_gemma":[0.0015942272,0.00029418734,0.00081446057,0.00061337807,0.003016515,0.0045892913,0.0018860444,0.0018046328,0.0015882447],"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.000008640687,0.000009117407,0.000032632353,0.000016877631,0.0000021662327,0.000037412075,0.000088018845,0.0035766545,0.00087066134,0.99414515,0.00035781402,0.00085484097],"study_design_scores_gemma":[0.000014565445,0.00004376801,0.00006388896,0.000017369313,0.000007759153,0.0001063966,0.00008251918,0.097147584,0.0008079323,0.8949818,0.006708318,0.000018141016],"about_ca_topic_score_codex":0.0012886899,"about_ca_topic_score_gemma":0.000926218,"teacher_disagreement_score":0.009986879,"about_ca_system_score_codex":0.0013590145,"about_ca_system_score_gemma":0.0011133739,"threshold_uncertainty_score":0.033409417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16311003,0.002476719,0.7834049,0.012144765,0.0014234842,0.00027717324,0.00038670423,0.0011667878,0.03560935],"genre_scores_gemma":[0.92266816,0.00079066085,0.062415585,0.001306047,0.00022214223,0.00015500958,0.00010652668,0.00022118924,0.0121147055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635494,0.00101764,0.00026216224,0.00058326265,0.0013241161,0.0004579247],"domain_scores_gemma":[0.9873426,0.0043329946,0.000990799,0.005844962,0.0009996805,0.0004890434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031433648,0.0005828842,0.00094245526,0.0006681624,0.0015668642,0.0036350538,0.0014426722,0.0026925078,0.005592205],"category_scores_gemma":[0.016117515,0.00061943644,0.00088920316,0.0007483338,0.005665958,0.012434426,0.0055928603,0.0048710727,0.0018884257],"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.0011454931,0.0001112034,0.001326868,0.0003669763,0.00016004845,0.001231126,0.0012240957,0.00530324,0.059818164,0.89119065,0.0052647605,0.032857403],"study_design_scores_gemma":[0.00015075147,0.00044952094,0.0008047013,0.00029962588,0.00015064541,0.002097406,0.000580779,0.05041199,0.19912586,0.70568466,0.039998848,0.00024513138],"about_ca_topic_score_codex":0.0002326915,"about_ca_topic_score_gemma":0.00014845635,"teacher_disagreement_score":0.005592205,"about_ca_system_score_codex":0.0009831314,"about_ca_system_score_gemma":0.0010196471,"threshold_uncertainty_score":0.018707752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.830881,0.00035696858,0.13731398,0.0006814467,0.000057369034,0.000096284086,0.000197731,0.00022583894,0.030189358],"genre_scores_gemma":[0.99144346,0.00008148051,0.0054127173,0.000049237147,0.000018747487,0.00005376511,0.00006886586,0.000037151407,0.0028345305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996333,0.00007067723,0.0000179291,0.000070972,0.00012649664,0.00008056451],"domain_scores_gemma":[0.99740785,0.0012099022,0.00032840882,0.0003845087,0.00036581207,0.00030350641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060811563,0.0002614973,0.00049898896,0.0011074677,0.0009561272,0.0011431185,0.0008717157,0.00089890236,0.006066943],"category_scores_gemma":[0.0062881736,0.00032214492,0.00038367673,0.0004444867,0.0016920601,0.0021029876,0.00095637183,0.0009516594,0.0003408988],"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.000105774605,0.000058875066,0.0019315158,0.00008850096,0.000017317545,0.00022627355,0.00016171011,0.062198933,0.0045541367,0.92522335,0.0009770972,0.0044564256],"study_design_scores_gemma":[0.000035563255,0.00005866555,0.0008499644,0.000023821318,0.000010671001,0.00013653463,0.00010947371,0.49903762,0.001448778,0.49677166,0.0014919759,0.000025258176],"about_ca_topic_score_codex":0.0011144552,"about_ca_topic_score_gemma":0.000991105,"teacher_disagreement_score":0.006066943,"about_ca_system_score_codex":0.00093064236,"about_ca_system_score_gemma":0.00066996505,"threshold_uncertainty_score":0.020295978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020673683,0.00066944846,0.96138155,0.0021251435,0.00019696601,0.0005125465,0.00081434933,0.003707435,0.009918876],"genre_scores_gemma":[0.3042433,0.0005143131,0.68138903,0.0011576343,0.00034141864,0.001158745,0.0024043014,0.0007344144,0.008056866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99142367,0.0019131294,0.0006481786,0.0022944375,0.0021836523,0.0015370676],"domain_scores_gemma":[0.98360217,0.0073385974,0.0010868808,0.006404698,0.0012232792,0.00034432122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036131933,0.0015109162,0.0015613915,0.0014497201,0.002496939,0.0036279473,0.0057329475,0.0032977029,0.010393173],"category_scores_gemma":[0.017627025,0.00094629545,0.002248046,0.0030319516,0.0022073898,0.0084955115,0.0057701324,0.0035381268,0.0033381],"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.0013485061,0.0008454996,0.0024894653,0.00075266947,0.00024283298,0.00014704278,0.0006107199,0.13806416,0.010610602,0.4586835,0.050479524,0.33572555],"study_design_scores_gemma":[0.00038959,0.00019360922,0.00041689,0.000048886624,0.00007637647,0.00022787214,0.00015858885,0.5500709,0.008678684,0.42232165,0.017327797,0.000089299094],"about_ca_topic_score_codex":0.0038587986,"about_ca_topic_score_gemma":0.0052050375,"teacher_disagreement_score":0.010393173,"about_ca_system_score_codex":0.004074874,"about_ca_system_score_gemma":0.0054307356,"threshold_uncertainty_score":0.03476864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22304592,0.00019735731,0.7102101,0.0010717924,0.00018114879,0.00047099995,0.0004844696,0.00050183816,0.06383645],"genre_scores_gemma":[0.90578246,0.00019401149,0.07825281,0.00042955266,0.00016702774,0.00058397127,0.0005685991,0.00011703129,0.013904499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956145,0.0013785119,0.00040000005,0.0010544203,0.0008518987,0.0007006255],"domain_scores_gemma":[0.9950812,0.0020606252,0.0005292365,0.0008155019,0.0008383879,0.0006749233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019755447,0.0005332669,0.0006864691,0.00089490844,0.001340602,0.0026836172,0.0014381107,0.00075927866,0.010863666],"category_scores_gemma":[0.006693447,0.00051843637,0.001696445,0.00070341816,0.003369247,0.0064056236,0.003159109,0.0023603635,0.00087051216],"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.000048367958,0.000059208447,0.0001861204,0.000023230054,0.000013059045,0.000047638572,0.00030657195,0.001938149,0.00087931805,0.9921842,0.00026658253,0.004047464],"study_design_scores_gemma":[0.0000427938,0.000041335057,0.0002689961,0.00000859489,0.000018417148,0.00005885405,0.00013335627,0.022581682,0.0014501623,0.9729498,0.002426724,0.000019357192],"about_ca_topic_score_codex":0.0025823482,"about_ca_topic_score_gemma":0.0017349784,"teacher_disagreement_score":0.010863666,"about_ca_system_score_codex":0.0016106733,"about_ca_system_score_gemma":0.0018936557,"threshold_uncertainty_score":0.03634256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01144292,0.0028200152,0.91102254,0.0030830556,0.00078636064,0.00072352693,0.0008743317,0.0008223516,0.06842486],"genre_scores_gemma":[0.48424125,0.0036485817,0.46726292,0.00225233,0.0011284763,0.001346541,0.0010942247,0.00021557006,0.038810063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99259174,0.001854956,0.0006029312,0.0010704221,0.0030311334,0.0008487431],"domain_scores_gemma":[0.99580884,0.001238664,0.0004206007,0.0017868804,0.00050227315,0.00024273881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035399897,0.0007989392,0.0013936968,0.001193523,0.0024909345,0.0039732927,0.0026762623,0.003414841,0.011093494],"category_scores_gemma":[0.0069442126,0.00056812493,0.0013563127,0.003068452,0.003871704,0.007421119,0.005436575,0.004066061,0.0034820756],"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.000020051948,0.000019339757,0.000028449327,0.000055126322,0.0000062623567,0.000031299573,0.00008565315,0.0009801035,0.0008637818,0.9876094,0.0015621011,0.008738429],"study_design_scores_gemma":[0.00005140994,0.000033679466,0.00006113553,0.00004468648,0.000013288469,0.00016224511,0.000026101834,0.018475233,0.004182322,0.91876376,0.05815187,0.000034350553],"about_ca_topic_score_codex":0.00033829728,"about_ca_topic_score_gemma":0.00031307305,"teacher_disagreement_score":0.011093494,"about_ca_system_score_codex":0.0024438587,"about_ca_system_score_gemma":0.0018098439,"threshold_uncertainty_score":0.03711146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43154213,0.0006454813,0.5225052,0.004346621,0.00025230253,0.00018904753,0.0007513432,0.0012068233,0.038561106],"genre_scores_gemma":[0.9552167,0.00022827838,0.03836452,0.00031459302,0.00009974086,0.00009826384,0.0005278966,0.00017021886,0.004979755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976693,0.0008226604,0.00011014455,0.00049352203,0.00047000183,0.00043437668],"domain_scores_gemma":[0.98268557,0.011254929,0.0010151041,0.002761778,0.0014104261,0.000872274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023655468,0.00055800215,0.0006700002,0.0007902021,0.0018655672,0.0022830951,0.0015116667,0.00096063205,0.009361527],"category_scores_gemma":[0.017573293,0.00037462646,0.00095594005,0.0011209863,0.0049177106,0.010695115,0.0024950646,0.002858227,0.00068699586],"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.0001828304,0.000057298636,0.002276178,0.00015470367,0.000020874459,0.0002468673,0.00038120773,0.0115920575,0.0029579515,0.9531036,0.0036756697,0.025350768],"study_design_scores_gemma":[0.000018159595,0.000039700837,0.0003408386,0.00001734841,0.00001578365,0.00013807432,0.00018808432,0.084200606,0.0037129752,0.9086643,0.002640971,0.000023080167],"about_ca_topic_score_codex":0.0030382683,"about_ca_topic_score_gemma":0.0026308345,"teacher_disagreement_score":0.009361527,"about_ca_system_score_codex":0.0016341357,"about_ca_system_score_gemma":0.0015581679,"threshold_uncertainty_score":0.031317472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2478747,0.002931782,0.67858285,0.01777675,0.00025771733,0.00024639707,0.0016119712,0.00075539,0.049962435],"genre_scores_gemma":[0.92322826,0.0016585261,0.06165976,0.0011118206,0.0006597217,0.00025975052,0.0014188926,0.00022893521,0.009774434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994204,0.0015227371,0.00026972938,0.00112661,0.0020665927,0.00081037864],"domain_scores_gemma":[0.97556597,0.019361056,0.0007752099,0.0028523945,0.00085410726,0.0005912469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002971777,0.00076441653,0.0017771012,0.0014231042,0.002297081,0.0046551432,0.0029263676,0.0028901966,0.00671978],"category_scores_gemma":[0.020909747,0.0006353153,0.0022812106,0.0017768136,0.0047842935,0.012620159,0.004524244,0.008132686,0.0005703043],"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.00016406243,0.00011724063,0.0009779305,0.000337247,0.000066184446,0.00009135752,0.000553361,0.041886,0.0014832439,0.92849594,0.0055992925,0.020228233],"study_design_scores_gemma":[0.000027632275,0.000024533541,0.00046110948,0.000026957085,0.000014249509,0.00007597111,0.0001071992,0.09627405,0.00077190413,0.8993593,0.0028392721,0.000017795537],"about_ca_topic_score_codex":0.0028754976,"about_ca_topic_score_gemma":0.0018951325,"teacher_disagreement_score":0.00671978,"about_ca_system_score_codex":0.0046511437,"about_ca_system_score_gemma":0.0023290263,"threshold_uncertainty_score":0.0337466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14269151,0.00062589266,0.80970556,0.017058287,0.00016935346,0.00057638,0.0011790086,0.0015525304,0.026441427],"genre_scores_gemma":[0.83188254,0.00048110454,0.1562719,0.0010742247,0.00022942344,0.0005120386,0.00097457087,0.0002667266,0.008307515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98947805,0.0038101524,0.00049803517,0.0017521511,0.002889933,0.0015717853],"domain_scores_gemma":[0.935015,0.053874202,0.0024529018,0.0059012845,0.0017405959,0.0010159306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069257803,0.0008294868,0.0011853256,0.0011261066,0.0044896463,0.005063788,0.004485379,0.0036893494,0.010344103],"category_scores_gemma":[0.02723645,0.00128448,0.00318327,0.0016218339,0.007495089,0.016018441,0.0067398455,0.010916539,0.0011783594],"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.00041353132,0.00018252949,0.0004449191,0.00030560882,0.00006772961,0.00023299035,0.00076454546,0.02123406,0.002963748,0.95452887,0.002989532,0.01587188],"study_design_scores_gemma":[0.000207174,0.00006775734,0.00024335821,0.000034881985,0.000056504097,0.00012873948,0.00016225707,0.085423894,0.008531913,0.90056044,0.0045316736,0.00005145615],"about_ca_topic_score_codex":0.0031564466,"about_ca_topic_score_gemma":0.002136341,"teacher_disagreement_score":0.010344103,"about_ca_system_score_codex":0.006048901,"about_ca_system_score_gemma":0.007026725,"threshold_uncertainty_score":0.043888092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7372006,0.00048680668,0.21824487,0.0012705175,0.000059537306,0.000061345025,0.0002266326,0.00025062653,0.04219904],"genre_scores_gemma":[0.9922701,0.00014729695,0.0055390364,0.00010089182,0.000026306981,0.000032809327,0.000034101606,0.000024612455,0.0018248697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935895,0.00019712417,0.00003312696,0.00015539648,0.00012326213,0.00013207283],"domain_scores_gemma":[0.99723333,0.0018924043,0.00017255392,0.00041442827,0.00009604539,0.00019117616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084263674,0.0002856715,0.0004897304,0.0005957391,0.0008769233,0.001558985,0.0006419399,0.0006966501,0.002753284],"category_scores_gemma":[0.0039269733,0.00025067097,0.0005201503,0.00048345997,0.0036779267,0.003973121,0.0017967393,0.0011092488,0.0001516041],"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.00009923859,0.00002219274,0.0003938367,0.00004121589,0.000013518623,0.00007326996,0.00017850276,0.014367935,0.0037866165,0.9751026,0.00029774115,0.0056232596],"study_design_scores_gemma":[0.000023400797,0.00004751071,0.00029101787,0.000017920158,0.000017303788,0.000084890926,0.000078981524,0.066688344,0.0033098261,0.9282634,0.0011651149,0.000012262409],"about_ca_topic_score_codex":0.00061503175,"about_ca_topic_score_gemma":0.0005037764,"teacher_disagreement_score":0.002753284,"about_ca_system_score_codex":0.0005552417,"about_ca_system_score_gemma":0.0005221223,"threshold_uncertainty_score":0.009210646},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80563354,0.00091294176,0.1567486,0.000568751,0.000084890984,0.00008268885,0.0003228133,0.00030503512,0.035340734],"genre_scores_gemma":[0.98905385,0.00014198567,0.008749941,0.00012358633,0.000035373243,0.00003860213,0.000110391535,0.000039360224,0.0017069532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993957,0.00014171314,0.00004546241,0.00013495758,0.00013056745,0.00015155235],"domain_scores_gemma":[0.99855644,0.0005257781,0.00019605881,0.00031799608,0.00017891018,0.00022486207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000659773,0.0002979789,0.000424787,0.0007385672,0.0008240914,0.0006880036,0.0007145406,0.00057641143,0.003556686],"category_scores_gemma":[0.0025876716,0.00025982675,0.0004327713,0.00031925595,0.0023391908,0.0019854428,0.0017876576,0.0007284137,0.0002115652],"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.000053148702,0.000035601795,0.00092625566,0.00011384982,0.000015245856,0.0001883854,0.00042050323,0.005398002,0.009947291,0.9755559,0.00062993006,0.006715881],"study_design_scores_gemma":[0.000023185126,0.000062788415,0.0009199036,0.000037552505,0.000009561657,0.00033249205,0.00017986534,0.04474776,0.0056028604,0.94474745,0.0033075751,0.000029100054],"about_ca_topic_score_codex":0.00028147158,"about_ca_topic_score_gemma":0.00027260985,"teacher_disagreement_score":0.003556686,"about_ca_system_score_codex":0.00044315,"about_ca_system_score_gemma":0.00037040017,"threshold_uncertainty_score":0.011898339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032255,0.00017165775,0.9543231,0.00036214155,0.000090184665,0.00012755158,0.00012652397,0.0008566346,0.011687202],"genre_scores_gemma":[0.52978325,0.0003921147,0.45997033,0.0002745287,0.0000573528,0.00061759,0.00024271634,0.00046024035,0.0082019605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994281,0.00021815006,0.000023771569,0.00007171242,0.00017743341,0.000080782294],"domain_scores_gemma":[0.99904674,0.000449278,0.00005524309,0.0003122594,0.0000797887,0.000056701705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072750007,0.00057996536,0.00083215,0.0004613795,0.000718496,0.00092390174,0.0017017801,0.0015299122,0.009511797],"category_scores_gemma":[0.0029104396,0.00044717305,0.00087056396,0.0005984648,0.0017179275,0.002170961,0.0016357369,0.0016818983,0.001152644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014234855,0.00009010095,0.0003309794,0.0001226976,0.000039838258,0.00012302028,0.00011358641,0.42890888,0.006127951,0.54317915,0.0016764563,0.019145092],"study_design_scores_gemma":[0.00002887483,0.00001877619,0.000024362631,0.0000070686633,0.000004647819,0.000015764494,0.000007674512,0.90810597,0.0028279426,0.08725764,0.0016912164,0.000010042764],"about_ca_topic_score_codex":0.0010858476,"about_ca_topic_score_gemma":0.0011183966,"teacher_disagreement_score":0.009511797,"about_ca_system_score_codex":0.00058228424,"about_ca_system_score_gemma":0.00091340096,"threshold_uncertainty_score":0.03182012},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53979224,0.0015903851,0.41443458,0.008995339,0.00042579303,0.00030125224,0.0007215585,0.0023321486,0.0314068],"genre_scores_gemma":[0.9266523,0.0008445173,0.06894719,0.00054621114,0.000108460656,0.00032854613,0.000423996,0.00026029104,0.0018884811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979001,0.00093159865,0.00012819693,0.00029567955,0.00050369796,0.0002406413],"domain_scores_gemma":[0.9696904,0.022353657,0.00089684164,0.00557732,0.00085730513,0.0006246623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036990352,0.0006865567,0.0011144807,0.00047581416,0.0011194514,0.0009955666,0.0025472462,0.001977427,0.0041171005],"category_scores_gemma":[0.024525872,0.00060745556,0.001166938,0.00050816085,0.002476591,0.0060248896,0.0023186456,0.0030529872,0.0004544582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005514253,0.0002472751,0.0028743087,0.00045064648,0.00012247382,0.00014214015,0.00022572294,0.7525331,0.010253674,0.20040083,0.0036563235,0.028542038],"study_design_scores_gemma":[0.000042091477,0.000070603724,0.00016817448,0.000016303205,0.000015094016,0.000031152376,0.000019754405,0.91132724,0.0028864164,0.08423846,0.0011725024,0.0000122012025],"about_ca_topic_score_codex":0.0020048725,"about_ca_topic_score_gemma":0.002173641,"teacher_disagreement_score":0.0041171005,"about_ca_system_score_codex":0.0012222101,"about_ca_system_score_gemma":0.0014741718,"threshold_uncertainty_score":0.019562602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021420948,0.00081103283,0.9211894,0.001618673,0.0012582899,0.00023020916,0.0021749295,0.004885879,0.046410546],"genre_scores_gemma":[0.26590717,0.0012744594,0.6931546,0.00076554803,0.0005838399,0.00040344466,0.004394944,0.0016733939,0.031842608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996234,0.00007729117,0.000018391416,0.00006676444,0.00018269233,0.000031495092],"domain_scores_gemma":[0.99897003,0.0005837168,0.000056570105,0.00019848403,0.00016964196,0.000021505854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040129395,0.000686212,0.0003631233,0.0007849097,0.0003586229,0.0008933767,0.00077312405,0.0008692332,0.06658849],"category_scores_gemma":[0.002611419,0.00034916852,0.0007124796,0.0005326264,0.00075254595,0.0011151194,0.0007799927,0.0008649597,0.0073709763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017785268,0.0004856237,0.0010185257,0.0007199909,0.00007580662,0.00034219972,0.00008609864,0.0868918,0.039917633,0.40054145,0.1257602,0.34398276],"study_design_scores_gemma":[0.00012334176,0.00017741541,0.0010218095,0.000108261615,0.000031654283,0.00040592515,0.000037043126,0.50639015,0.059364937,0.32007483,0.1121854,0.00007925349],"about_ca_topic_score_codex":0.0007668955,"about_ca_topic_score_gemma":0.0018167347,"teacher_disagreement_score":0.06658849,"about_ca_system_score_codex":0.0007476414,"about_ca_system_score_gemma":0.00078454486,"threshold_uncertainty_score":0.22276068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4833938,0.0022360575,0.47610447,0.00186435,0.00015214407,0.000089252244,0.00036056575,0.0007506111,0.035048675],"genre_scores_gemma":[0.9713614,0.00038774643,0.024803726,0.00012220815,0.000040429964,0.000058686845,0.00008157371,0.000119959455,0.0030242766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.00026617647,0.00004124559,0.00022381966,0.00024196223,0.00025922144],"domain_scores_gemma":[0.9910994,0.0061220843,0.0005917867,0.0014690185,0.00030493116,0.0004127033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011989322,0.0003696423,0.0007551591,0.00061831286,0.0007990645,0.0016050005,0.0010960157,0.0011949707,0.0063419617],"category_scores_gemma":[0.012703963,0.00047219748,0.0005196958,0.0007437539,0.0033908323,0.005429837,0.0023196274,0.0013084549,0.0003537442],"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.00046190235,0.00007543995,0.0010544015,0.00021194555,0.00002954595,0.00016887509,0.00042724604,0.1436311,0.0070915082,0.8138714,0.0017629564,0.031213606],"study_design_scores_gemma":[0.000047844114,0.00011905407,0.0008063361,0.00003915375,0.000020463074,0.00016302866,0.00018065258,0.31301445,0.004279536,0.6791952,0.0021052666,0.000028948465],"about_ca_topic_score_codex":0.0012826932,"about_ca_topic_score_gemma":0.00096612354,"teacher_disagreement_score":0.0063419617,"about_ca_system_score_codex":0.0012535636,"about_ca_system_score_gemma":0.0009348036,"threshold_uncertainty_score":0.021215975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054504104,0.0014292231,0.8866814,0.014282367,0.00030669008,0.00013543878,0.00039739392,0.00036151672,0.041901853],"genre_scores_gemma":[0.79462606,0.0012167798,0.19272107,0.0016566109,0.0011093973,0.00030458946,0.000307673,0.00022194715,0.007835762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99479693,0.0024932649,0.00018723049,0.000780267,0.0013640828,0.00037813612],"domain_scores_gemma":[0.9848605,0.010758182,0.00061024685,0.0020107797,0.0011736954,0.00058656564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386631,0.0007636215,0.0009896943,0.002765165,0.0017704404,0.004394038,0.0019618182,0.0022843385,0.005859025],"category_scores_gemma":[0.011706054,0.0006173542,0.001975446,0.001970072,0.0104827285,0.012545133,0.004979989,0.005976788,0.00033975756],"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.0000043573696,0.000009419308,0.00005623392,0.000019163745,0.0000053276376,0.000008875599,0.000055671502,0.0044047893,0.000110709356,0.9930599,0.0005092681,0.0017563307],"study_design_scores_gemma":[0.0000028731279,0.0000030383926,0.000033662152,0.000005777646,0.0000019374077,0.0000076666665,0.000020986332,0.020649305,0.000078166966,0.9780858,0.0011065588,0.000004183571],"about_ca_topic_score_codex":0.001750061,"about_ca_topic_score_gemma":0.0015552028,"teacher_disagreement_score":0.005859025,"about_ca_system_score_codex":0.003712175,"about_ca_system_score_gemma":0.0015009042,"threshold_uncertainty_score":0.026933849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051686717,0.00019060087,0.9817499,0.0008839819,0.00023545022,0.00031926093,0.0001746863,0.0022065872,0.009070889],"genre_scores_gemma":[0.07673015,0.00017873963,0.91176015,0.00055214926,0.00011071441,0.00066584995,0.00050297217,0.00052005565,0.0089792535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853206,0.00025960928,0.0001288024,0.0004285155,0.00044056913,0.0002104729],"domain_scores_gemma":[0.9985738,0.0005625337,0.00010356899,0.0003906875,0.00027311107,0.00009630757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427534,0.0013455874,0.0009419592,0.0012341306,0.0016007036,0.0023850254,0.0025399583,0.0024046206,0.018652976],"category_scores_gemma":[0.0040975567,0.0006342321,0.0019169252,0.0013773646,0.0017913431,0.0036473763,0.0033560316,0.0038488351,0.0054519116],"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.0005850523,0.00041327873,0.00081827544,0.0005783382,0.00012816349,0.00040706625,0.000403499,0.035684183,0.016071893,0.492419,0.037897997,0.41459322],"study_design_scores_gemma":[0.00043086297,0.00029253212,0.00029997184,0.0001430603,0.0000785141,0.00086481735,0.00015690703,0.4014148,0.019299539,0.5382823,0.038589697,0.00014708149],"about_ca_topic_score_codex":0.0018974601,"about_ca_topic_score_gemma":0.002781577,"teacher_disagreement_score":0.018652976,"about_ca_system_score_codex":0.0021781952,"about_ca_system_score_gemma":0.0034643402,"threshold_uncertainty_score":0.0624004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18237476,0.0017915802,0.5964681,0.012697133,0.00036888072,0.00012797596,0.00028134702,0.00017077666,0.2057195],"genre_scores_gemma":[0.89813495,0.0008401757,0.08763754,0.00089329475,0.00043732976,0.00017708368,0.00019459671,0.000045060642,0.011639943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765104,0.0009018158,0.00017169116,0.00031834713,0.0006708186,0.00028625992],"domain_scores_gemma":[0.99619484,0.0017264741,0.00048533335,0.000660405,0.0006432496,0.0002896294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003465791,0.00038475762,0.0006411258,0.0017824145,0.0022630265,0.0030086122,0.0013582814,0.0026589355,0.005218635],"category_scores_gemma":[0.0071961586,0.00036469556,0.00083244074,0.0011118307,0.010124867,0.008348622,0.0040849084,0.0032562886,0.00047028976],"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.0000023382895,0.0000033946328,0.00004014957,0.000012221162,9.695984e-7,0.000012300803,0.000053102056,0.00036195628,0.000044536646,0.99858034,0.00014875112,0.0007398604],"study_design_scores_gemma":[0.0000036210288,0.000008041429,0.00007058553,0.000010138695,0.0000021397714,0.00005360731,0.0000973603,0.0045093,0.00014161247,0.99386394,0.0012333733,0.000006270082],"about_ca_topic_score_codex":0.0005042254,"about_ca_topic_score_gemma":0.00044938826,"teacher_disagreement_score":0.005218635,"about_ca_system_score_codex":0.0013562494,"about_ca_system_score_gemma":0.0012849849,"threshold_uncertainty_score":0.018329024},"labels":[],"label_agreement":null}]}