{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":143,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":143,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"3a7cc1195425","filters":{"venue":"Quantum Information and Computation"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006256060056635696,"gpt":0.2236223428578774,"spread":0.2173662828012417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003015206,0.000163523,0.0001805701,0.000222705,0.0001856258,0.0002342286,0.0002150143,0.00007052025,0.000003797228],"category_scores_gemma":[0.00002036628,0.000135955,0.00005389367,0.0006913552,0.00008475366,0.004260817,0.00005564556,0.0001108532,0.00003142444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003791335,"about_ca_system_score_gemma":0.0001038223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006668459,"about_ca_topic_score_gemma":0.000006765994,"domain_scores_codex":[0.998703,0.00003596587,0.0005499347,0.0001325017,0.0003879324,0.0001906368],"domain_scores_gemma":[0.9989269,0.00004143846,0.0004307466,0.0001853436,0.0003194328,0.00009612649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003561207,0.00004422426,0.0004645925,0.0001224863,0.00001818242,4.836338e-7,0.003889466,0.005801742,0.0000176898,0.978368,0.0001010021,0.01113655],"study_design_scores_gemma":[0.002304858,0.0007492337,0.02406892,0.0001187488,0.00001852469,0.00007327507,0.001330629,0.90986,0.001337869,0.05679227,0.002934091,0.0004116284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3445256,0.0000324101,0.6543133,0.0003198501,0.00008397392,0.0001581657,0.00001222042,0.0001290851,0.0004254011],"genre_scores_gemma":[0.9968036,0.00003434145,0.002638174,0.0003045441,0.00001028571,0.00001191174,0.0001932938,0.000003428181,3.731412e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9215757,"threshold_uncertainty_score":0.5544084,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01256792958409867,"gpt":0.2551793519209167,"spread":0.2426114223368181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002887619,0.0001965341,0.0001933356,0.0001754373,0.0003812615,0.0005452923,0.0002927039,0.0000783571,0.000001778794],"category_scores_gemma":[0.00004283947,0.0001753513,0.00006704604,0.0003333042,0.00005290024,0.001449641,0.00008398687,0.0001241022,0.0000203066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003647156,"about_ca_system_score_gemma":0.00005503382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004465567,"about_ca_topic_score_gemma":0.000005832255,"domain_scores_codex":[0.9986357,0.00002955979,0.0005488836,0.0002340839,0.0002517679,0.0002999823],"domain_scores_gemma":[0.9989822,0.000220999,0.0003196664,0.0001905986,0.0002128448,0.00007367159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003041796,0.00004712227,0.0001782341,0.00009510155,0.00001332547,0.000001382172,0.0008040556,0.05961084,0.00008519138,0.835583,0.004021528,0.09952975],"study_design_scores_gemma":[0.0008349564,0.0001087354,0.002486114,0.00002608503,0.000005346509,0.000018895,0.00005546558,0.9127262,0.0001354653,0.06937156,0.01400115,0.0002300654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1011441,0.0001037848,0.8959702,0.001231385,0.0004131875,0.0003772324,0.00002415354,0.0003764101,0.0003595711],"genre_scores_gemma":[0.9818181,0.00001105854,0.01728799,0.0005233953,0.00008830881,0.00003054311,0.0002134467,0.00000874257,0.00001836216],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8806741,"threshold_uncertainty_score":0.7150619,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.161797514434894,"gpt":0.4465181793535156,"spread":0.2847206649186216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009714835,0.0001019688,0.0001544594,0.0004722654,0.0003236285,0.0001097015,0.0001234483,0.00007430768,0.00005118606],"category_scores_gemma":[0.0003841326,0.00009212067,0.00004896977,0.0008195889,0.000068369,0.002770805,0.00004783991,0.00007578106,0.00005577869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003241272,"about_ca_system_score_gemma":0.0000480991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005971392,"about_ca_topic_score_gemma":0.00000307294,"domain_scores_codex":[0.9982511,0.00009452475,0.0008921814,0.00009902372,0.0005250222,0.0001381059],"domain_scores_gemma":[0.9982185,0.0004168642,0.000291567,0.0001924109,0.0007862281,0.00009437539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007945841,0.0001204342,0.003989277,0.000008338783,0.000007636048,1.878155e-8,0.002111736,0.8309087,0.0001207465,0.125309,0.0001568311,0.0372594],"study_design_scores_gemma":[0.000332312,0.00002916129,0.02008668,0.000007943874,0.00001102747,0.00000274832,0.000825885,0.96704,0.000139436,0.007375567,0.004048254,0.000100963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4320723,0.00002652009,0.5668984,0.0001724912,0.00008327299,0.0002142594,0.00001918691,0.00004904023,0.0004644845],"genre_scores_gemma":[0.9855136,0.000007053133,0.01408456,0.0002208258,0.00003455822,0.00001088786,0.0001009896,0.000005368266,0.00002220709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5534412,"threshold_uncertainty_score":0.3756572,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01243195162450697,"gpt":0.2534901271177673,"spread":0.2410581754932603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004458039,0.0001555485,0.000162517,0.0002231997,0.0002759581,0.0002858561,0.000180647,0.00006692736,0.000004515508],"category_scores_gemma":[0.00005468096,0.0001394497,0.00008046361,0.0003913559,0.00005635751,0.001741524,0.00003553711,0.00009263041,0.00002299198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159693,"about_ca_system_score_gemma":0.00005379566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001031108,"about_ca_topic_score_gemma":0.000001066365,"domain_scores_codex":[0.9988285,0.00006719334,0.0004445403,0.0001823647,0.0002380318,0.0002393332],"domain_scores_gemma":[0.9992293,0.0001449656,0.0001857742,0.0001681739,0.0001756353,0.0000962011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005028072,0.00003987625,0.00004408344,0.000200665,0.00002761104,9.00162e-7,0.0008596792,0.001196929,0.000008870349,0.7240327,0.001525495,0.2720582],"study_design_scores_gemma":[0.0005606254,0.0001559291,0.0005655373,0.00006024872,0.00001336901,0.00003128211,0.000162628,0.9477159,0.0001029602,0.03899558,0.01142491,0.0002109877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001703009,0.0006276761,0.995652,0.0005734826,0.000423187,0.000421563,0.00001010527,0.000154276,0.0004347098],"genre_scores_gemma":[0.6847903,0.0008652827,0.3118315,0.002107678,0.00005366497,0.0001201442,0.0001866699,0.0000151861,0.00002958138],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.946519,"threshold_uncertainty_score":0.5686593,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007837065178921783,"gpt":0.2405058865934042,"spread":0.2326688214144824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957249,0.0001355892,0.0001513296,0.00009577798,0.0002564403,0.000184938,0.0004440106,0.00007151769,0.000003433682],"category_scores_gemma":[0.00005123202,0.00009584714,0.00006741806,0.0003766364,0.0001074976,0.0009035163,0.000210284,0.0002933307,0.000008400087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001039252,"about_ca_system_score_gemma":0.00008820606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004346326,"about_ca_topic_score_gemma":0.000006819807,"domain_scores_codex":[0.9987927,0.00007396225,0.0004697843,0.0001619128,0.000320377,0.0001812484],"domain_scores_gemma":[0.9989934,0.0000847827,0.000340266,0.0003185871,0.0001994636,0.00006351627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001529872,0.00009037531,0.002734302,0.0002016067,0.00002114071,3.610016e-7,0.005879596,0.02658758,0.0006669177,0.683831,0.0005744329,0.2793974],"study_design_scores_gemma":[0.0002734594,0.00005453172,0.02281252,0.00001766246,0.000003896006,0.00002563426,0.0000623784,0.9515278,0.0002788563,0.0230492,0.001772134,0.0001218937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5644844,0.000008926865,0.433296,0.0008782006,0.0006899945,0.0002066016,0.000004308342,0.00009491023,0.0003367144],"genre_scores_gemma":[0.9873128,0.000001775911,0.01244505,0.0001843923,0.0000319804,0.000006839088,0.000007905262,0.000003700467,0.000005536834],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9249402,"threshold_uncertainty_score":0.3908533,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02214648016103968,"gpt":0.261198085010206,"spread":0.2390516048491663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004309524,0.0001581415,0.000155971,0.0002009312,0.0003568148,0.0003878823,0.0001755929,0.00006926182,0.000002101002],"category_scores_gemma":[0.00005787737,0.0001529748,0.00005740016,0.0003149917,0.00002790393,0.001144573,0.00004414583,0.0001010374,0.00001076996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003183221,"about_ca_system_score_gemma":0.00008712574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001049782,"about_ca_topic_score_gemma":3.936813e-7,"domain_scores_codex":[0.9988526,0.00005717359,0.0004238517,0.0001934353,0.0002169489,0.0002560553],"domain_scores_gemma":[0.9992576,0.0001098069,0.0002080665,0.0001507926,0.0001799126,0.00009377861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002862425,0.00002450691,0.00002779606,0.00005160859,0.00001500236,7.291429e-7,0.001849781,0.03933302,0.00004917752,0.2310787,0.0001920302,0.7273748],"study_design_scores_gemma":[0.0005039299,0.00009097454,0.0001812889,0.00002017852,0.000005600112,0.00006748454,0.00009985373,0.9586331,0.0001502821,0.0334039,0.006642078,0.0002012841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03250529,0.0000746024,0.9659952,0.0001381393,0.0005233035,0.0002917667,0.000006379774,0.0001783866,0.0002869138],"genre_scores_gemma":[0.6136875,0.000008193881,0.3855487,0.0006229133,0.00006419732,0.00001482822,0.00003416295,0.000009534258,0.000009996927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9193001,"threshold_uncertainty_score":0.6238132,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007549946387218678,"gpt":0.22724153338666,"spread":0.2196915869994414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004832224,0.0002762535,0.0002806534,0.0002900725,0.000421424,0.0006217837,0.0002670421,0.00008712028,0.000002681766],"category_scores_gemma":[0.00003695213,0.0002248359,0.00005082754,0.0004813231,0.00009983977,0.001551086,0.0001086914,0.0002269225,0.00005579958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003620113,"about_ca_system_score_gemma":0.00008442064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004478499,"about_ca_topic_score_gemma":0.000003959403,"domain_scores_codex":[0.9981273,0.0001353955,0.0005773442,0.0003136803,0.0005053341,0.0003408948],"domain_scores_gemma":[0.9987474,0.0002163497,0.0003816136,0.0002278379,0.0002652189,0.0001615966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004671067,0.00005648967,0.0001865223,0.0001098276,0.00002811035,0.000003285588,0.003293371,0.2119987,0.00003653461,0.3354309,0.0004785151,0.4483311],"study_design_scores_gemma":[0.001133715,0.0004392556,0.003056978,0.00008840927,0.000008647642,0.0001215923,0.0001670566,0.9765347,0.0000375109,0.01538119,0.002689659,0.0003413464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1838017,0.00003608651,0.8134151,0.0009453865,0.0002937567,0.0002344763,0.00000396701,0.0003863812,0.0008831384],"genre_scores_gemma":[0.961852,0.000009371479,0.03700885,0.0009796746,0.00005668288,0.00001026943,0.00006685994,0.00001075663,0.000005515944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7780503,"threshold_uncertainty_score":0.916854,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02044945921705929,"gpt":0.2956105423566552,"spread":0.2751610831395959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506319,0.0001998924,0.0002175865,0.0007783576,0.0001730885,0.0004495927,0.0002353502,0.0001365492,0.00001767037],"category_scores_gemma":[0.00008539818,0.0001946123,0.00006221724,0.0009694747,0.00006954668,0.005930974,0.0000918499,0.0002285195,0.0006321513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005733738,"about_ca_system_score_gemma":0.00008804993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002710614,"about_ca_topic_score_gemma":0.000009979693,"domain_scores_codex":[0.9978409,0.00007918763,0.001018414,0.0001885748,0.0004936269,0.0003793362],"domain_scores_gemma":[0.9988292,0.0002233956,0.0003851005,0.0002287217,0.0001607248,0.0001727975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006367338,0.00009173976,0.000731824,0.0001064361,0.00001482098,0.000007723181,0.007798539,0.001511408,0.00003082239,0.9350483,0.002496056,0.05209859],"study_design_scores_gemma":[0.0008993587,0.0001302366,0.0180322,0.00003783778,0.000003318233,0.00005608356,0.0008672441,0.9593146,0.00005691362,0.00742179,0.01289431,0.00028612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1857422,0.00002777326,0.807793,0.0009922966,0.0003164407,0.0002940707,0.000002080714,0.000254435,0.004577779],"genre_scores_gemma":[0.9913233,0.00001594496,0.007464378,0.001087738,0.00003179741,0.00001135143,0.00005360994,0.000005966099,0.00000593876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9578032,"threshold_uncertainty_score":0.8125236,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02085461096442548,"gpt":0.2456400102863635,"spread":0.224785399321938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002938564,0.0001282066,0.0001460067,0.0001557994,0.0003947279,0.0001125963,0.0002391959,0.00003875963,0.000003573095],"category_scores_gemma":[0.00007721315,0.00008772572,0.00004577259,0.0003102569,0.00008902773,0.0006209605,0.00008084653,0.0001394736,0.00002246807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001347776,"about_ca_system_score_gemma":0.0000422193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000186087,"about_ca_topic_score_gemma":6.007098e-7,"domain_scores_codex":[0.9989874,0.00008846109,0.0003739895,0.0001252314,0.0002775626,0.0001473635],"domain_scores_gemma":[0.9989748,0.000406662,0.0002639436,0.0001681239,0.0001395798,0.00004691843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001970098,0.00004121869,0.0001086382,0.00003015583,0.00001892236,0.000002663511,0.01448653,0.06417765,0.00004210931,0.8679141,0.001269834,0.05188842],"study_design_scores_gemma":[0.0002339275,0.0001679804,0.00235736,0.0000403687,0.000002037114,0.00004543428,0.000175038,0.975225,0.0002733892,0.02102686,0.0003439877,0.0001086131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4834276,0.00002072923,0.5152891,0.000700238,0.00012733,0.0001001786,0.000002591529,0.00006067935,0.000271492],"genre_scores_gemma":[0.9928283,0.00002782682,0.006292456,0.0008048524,0.0000202641,0.00000531165,0.00001332813,0.000003289076,0.000004377067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9110473,"threshold_uncertainty_score":0.3577351,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01181955509425251,"gpt":0.2373156616422663,"spread":0.2254961065480138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004100903,0.0001431645,0.000163483,0.0002087874,0.0006872677,0.0001586101,0.0003051604,0.00005709408,8.211362e-7],"category_scores_gemma":[0.00006531605,0.0001065453,0.0000587687,0.0005698637,0.0001401922,0.000941992,0.0001302765,0.0001500895,0.00002053599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001785089,"about_ca_system_score_gemma":0.00007826877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003052407,"about_ca_topic_score_gemma":6.543341e-7,"domain_scores_codex":[0.998593,0.00008162211,0.0005742708,0.0001473526,0.000393471,0.0002102258],"domain_scores_gemma":[0.9987853,0.0003190036,0.0003931024,0.0001806738,0.0002505215,0.00007145823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002816176,0.00005480192,0.0005380567,0.0000790592,0.0000354979,0.000003171985,0.005827296,0.09914043,0.00005357799,0.3009395,0.001710789,0.5915896],"study_design_scores_gemma":[0.0003560868,0.000132007,0.01436614,0.00001744134,0.000002913732,0.00009524296,0.000138098,0.9711835,0.00008288991,0.01187437,0.001620181,0.000131077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3075425,0.0001325117,0.6910211,0.0005685468,0.0003128214,0.0001231929,0.000001947139,0.0001149456,0.0001824341],"genre_scores_gemma":[0.9890137,0.0001015505,0.01061821,0.0001969145,0.00003296408,0.000004970848,0.00001981588,0.00000472198,0.000007141211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8720431,"threshold_uncertainty_score":0.5285977,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007051825671954051,"gpt":0.2003256337283936,"spread":0.1932738080564395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001580982,0.0001335637,0.0001627762,0.0001477188,0.0001887623,0.0003826179,0.00009614045,0.00005045632,0.000002481062],"category_scores_gemma":[0.00004278724,0.0001128078,0.00001643572,0.0002074908,0.00009783007,0.0006424271,0.0001007455,0.00006923069,0.000004517015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000900351,"about_ca_system_score_gemma":0.00001566329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007893689,"about_ca_topic_score_gemma":7.964529e-7,"domain_scores_codex":[0.9991526,0.0000505056,0.0003463987,0.0001415619,0.0001613457,0.0001475773],"domain_scores_gemma":[0.9993155,0.0001805414,0.000199849,0.0000924498,0.0001314813,0.00008019512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009914656,0.00005632026,0.0004536363,0.0001508289,0.00002439022,3.603506e-7,0.004174191,0.03388863,0.001499673,0.01629189,0.0004094933,0.9430407],"study_design_scores_gemma":[0.0002233952,0.0001237211,0.003972321,0.00003950464,0.000005364307,0.0000180907,0.0002387974,0.9922647,0.00130234,0.001473042,0.0002020342,0.0001366971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.678661,0.0001236212,0.320537,0.0003806227,0.0000548745,0.0001267076,0.000004893057,0.00005957544,0.00005165765],"genre_scores_gemma":[0.9889169,0.00002805599,0.01086803,0.0001438837,0.000009863603,0.000007662888,0.00001883775,0.000003877742,0.000002897319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.958376,"threshold_uncertainty_score":0.460017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Scaling; Statistical physics; Computer science; Quantum; Algorithm; Quantum mechanics; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02274902032063512,"gpt":0.2797801669984358,"spread":0.2570311466778006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000889484,0.0002000999,0.0002226121,0.00007029978,0.0003518021,0.000400003,0.0003916725,0.00009635653,9.901755e-7],"category_scores_gemma":[0.0004166717,0.0001518435,0.00008400823,0.000322348,0.00008624218,0.001197111,0.0001267405,0.0001319928,0.000008444678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000385664,"about_ca_system_score_gemma":0.0001406754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001620926,"about_ca_topic_score_gemma":5.863637e-7,"domain_scores_codex":[0.9982525,0.00008134785,0.0007704948,0.0002084745,0.0004038778,0.0002833041],"domain_scores_gemma":[0.997538,0.000886464,0.0006063421,0.0002889269,0.0005551729,0.0001250914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001987372,0.00005440381,0.00004691357,0.0002077037,0.00004530825,6.923563e-7,0.004531728,0.7290746,0.0002253212,0.06721813,0.001599917,0.1967966],"study_design_scores_gemma":[0.001087308,0.000187218,0.0004478485,0.0000338318,0.00000877063,0.000009635716,0.0003739334,0.9696318,0.000220942,0.02226148,0.005545618,0.0001916512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1130986,0.00008634086,0.8845856,0.001156038,0.0004400848,0.0003914687,0.000009930968,0.0001400553,0.00009190323],"genre_scores_gemma":[0.9908814,0.000008789895,0.008705818,0.0002285954,0.00008396873,0.00002633056,0.00003852187,0.000009304496,0.00001730935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8777828,"threshold_uncertainty_score":0.6191996,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02443551560942047,"gpt":0.2976477463470241,"spread":0.2732122307376036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003322442,0.0003035709,0.000363839,0.0006624944,0.0004282344,0.0002314883,0.0003385424,0.000248495,0.00002608828],"category_scores_gemma":[0.00004112927,0.0003038878,0.00009195743,0.0006266517,0.00007624357,0.001933436,0.000204225,0.0003417695,0.0002018141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006180562,"about_ca_system_score_gemma":0.0002338665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001347347,"about_ca_topic_score_gemma":0.00000306723,"domain_scores_codex":[0.9980652,0.0001459877,0.0008862954,0.0002177591,0.0004137351,0.0002710101],"domain_scores_gemma":[0.9983523,0.0001749315,0.00050536,0.0003014467,0.0005445465,0.0001214221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000310994,0.00006931357,0.000004690567,0.0001318938,0.00002679553,1.698294e-7,0.001798582,0.9589455,0.00001059831,0.008623841,0.0007337623,0.02965178],"study_design_scores_gemma":[0.0005211669,0.00009073273,0.0002433961,0.0001334063,0.00002544002,0.00001530887,0.00007088647,0.9877225,0.00002578823,0.0004712381,0.01036481,0.0003153081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02506282,0.0004221223,0.9711719,0.0002152718,0.001547016,0.0003930434,0.00007616771,0.00009795486,0.001013781],"genre_scores_gemma":[0.9295903,0.00009092665,0.06854796,0.0003258047,0.0002017022,0.00001011795,0.0009968834,0.00002146029,0.0002148801],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9045274,"threshold_uncertainty_score":0.9999413,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01107557163195827,"gpt":0.2555289271778758,"spread":0.2444533555459176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006668294,0.0001855131,0.00022285,0.0002910451,0.0002142499,0.0002251428,0.000182028,0.00007066307,0.00000816881],"category_scores_gemma":[0.00002373494,0.0001565179,0.0000593589,0.0006858335,0.0001065763,0.003246737,0.00005283025,0.0001140407,0.000008310088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004285193,"about_ca_system_score_gemma":0.00007184343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007982631,"about_ca_topic_score_gemma":0.000007870933,"domain_scores_codex":[0.998306,0.00004401141,0.0007877896,0.0001383824,0.0004692781,0.0002545068],"domain_scores_gemma":[0.9985405,0.0001205687,0.0005988522,0.0001740047,0.0004443997,0.0001217211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006360239,0.0002774097,0.002102148,0.0003679834,0.00009464145,0.000002429415,0.01118251,0.0185028,0.0002477617,0.9043152,0.0009333583,0.06133774],"study_design_scores_gemma":[0.001811856,0.0003099775,0.003673992,0.00006363105,0.00001475814,0.00003490527,0.001468589,0.9813737,0.001193027,0.007305845,0.002519678,0.0002300179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3658606,0.00004132028,0.6333252,0.00006183121,0.0001091923,0.0002045636,0.0000200815,0.00009350302,0.0002837053],"genre_scores_gemma":[0.9956594,0.00004524352,0.003792139,0.0001465393,0.00001446164,0.00000502719,0.0003321682,0.000004184305,8.30686e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9628709,"threshold_uncertainty_score":0.6382616,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01430933494924921,"gpt":0.2878214857583136,"spread":0.2735121508090644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003381479,0.0001343729,0.0001058928,0.0002029256,0.0002543442,0.0002557657,0.00009608134,0.00005019079,0.000003974791],"category_scores_gemma":[0.00001523778,0.0001275981,0.00002148603,0.0002495637,0.00004051557,0.002777072,0.000102466,0.00009955458,0.00002383177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002210811,"about_ca_system_score_gemma":0.00002313191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003253098,"about_ca_topic_score_gemma":0.000001897718,"domain_scores_codex":[0.9990466,0.00006383246,0.000328842,0.0001204297,0.0002077847,0.0002325042],"domain_scores_gemma":[0.9994106,0.00009927074,0.000167837,0.0001115794,0.000087058,0.000123645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007509792,0.00002606329,0.00248901,0.00005957601,0.00001498876,3.572821e-7,0.01500169,0.08816031,0.00002656874,0.06801148,0.0001819595,0.8260205],"study_design_scores_gemma":[0.0003778535,0.00006751414,0.05550729,0.00001063466,0.00000535353,0.00001574784,0.000511826,0.9381572,0.0000327518,0.00300089,0.002156839,0.0001561088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4257982,0.00006313137,0.5732594,0.0003578197,0.0001614744,0.0001285825,0.000002355859,0.0001180744,0.0001109347],"genre_scores_gemma":[0.982686,0.00001550358,0.01658685,0.0005687055,0.00006812784,0.000004118484,0.00006299013,0.000004690788,0.000002976688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8499969,"threshold_uncertainty_score":0.52033,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01624554292209988,"gpt":0.2767990757494363,"spread":0.2605535328273364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008986124,0.0002828562,0.0002323555,0.0008024957,0.0003889984,0.0007681937,0.0003541108,0.00010672,0.00001075385],"category_scores_gemma":[0.00002387198,0.0002355347,0.00007500139,0.001279616,0.0001275386,0.005457787,0.00008301628,0.0002085488,0.0001248929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002954594,"about_ca_system_score_gemma":0.00007383661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003145745,"about_ca_topic_score_gemma":0.00001801953,"domain_scores_codex":[0.9978,0.00005174999,0.0008844212,0.0002360844,0.0005764716,0.0004512853],"domain_scores_gemma":[0.9984131,0.0000976517,0.0005163903,0.0003122005,0.0004234135,0.0002372448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003594368,0.0003373336,0.006744486,0.0004694128,0.0001062303,0.00001029304,0.0171419,0.008065433,0.000269451,0.7870291,0.001495615,0.1779713],"study_design_scores_gemma":[0.001907829,0.000465315,0.0344744,0.00008147627,0.0000079888,0.00005016237,0.001126933,0.9412912,0.0003281742,0.005662947,0.01415711,0.0004464691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08903428,0.00002263143,0.9068952,0.0003329813,0.0001272601,0.002518942,0.000005312472,0.000487961,0.0005753896],"genre_scores_gemma":[0.9333048,0.00002627275,0.06444957,0.001579082,0.00002663663,0.0004871974,0.0001078693,0.00001240436,0.00000619081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9332258,"threshold_uncertainty_score":0.9604826,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.003800272703281674,"gpt":0.2064399048298038,"spread":0.2026396321265221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000251234,0.00008631744,0.00007711608,0.00005217751,0.0004430554,0.0002625027,0.0001947805,0.00002653477,5.034191e-7],"category_scores_gemma":[0.00001638592,0.00005021588,0.00002827759,0.0002141818,0.0001165782,0.0004161995,0.0001320047,0.00008504403,0.000002362028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007957202,"about_ca_system_score_gemma":0.00003382606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004282443,"about_ca_topic_score_gemma":0.000003105699,"domain_scores_codex":[0.9991829,0.00005395326,0.0003192341,0.00008751811,0.0002401157,0.0001162174],"domain_scores_gemma":[0.9992936,0.0002254449,0.0002195204,0.000114904,0.0001225641,0.00002396386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008792096,0.00002196371,0.0008772531,0.00003095539,0.0000125009,2.315224e-7,0.002762602,0.3851977,0.00001184998,0.4644362,0.001291371,0.1453486],"study_design_scores_gemma":[0.0001910442,0.00003411878,0.05102821,0.00001155739,0.000001784672,0.0000164915,0.000104989,0.8619019,0.00002299526,0.08480712,0.001819027,0.00006074023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4644251,0.0001349149,0.5326807,0.002197501,0.0001911088,0.0001208001,0.000003579905,0.00004714578,0.0001990975],"genre_scores_gemma":[0.9937093,0.000009793122,0.006001382,0.0002431097,0.00001375319,0.0000024965,0.000009459208,0.000002258978,0.000008420762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5292842,"threshold_uncertainty_score":0.3407669,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0183306586862418,"gpt":0.2417000462960589,"spread":0.2233693876098171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004243736,0.0001200807,0.0001511197,0.00022326,0.00009572604,0.0001818148,0.0001882951,0.00005264465,7.796885e-7],"category_scores_gemma":[0.00006028074,0.000106095,0.0000338366,0.0004068672,0.00004163723,0.0005299285,0.0001033852,0.0000798063,0.00001800663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003130754,"about_ca_system_score_gemma":0.00007033011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001537925,"about_ca_topic_score_gemma":3.743505e-7,"domain_scores_codex":[0.9988554,0.00005622913,0.0004632822,0.0001324848,0.0003440783,0.0001484889],"domain_scores_gemma":[0.9991409,0.00004836385,0.0002684244,0.0001491028,0.0002834511,0.0001097104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001715304,0.0000871109,0.00009908888,0.00007129645,0.00001086823,5.945774e-7,0.008878926,0.5611047,0.0001478659,0.1006471,0.0002598991,0.3286754],"study_design_scores_gemma":[0.0005356914,0.0002061432,0.0005115544,0.00002643092,0.000003150603,0.00001915231,0.0002979499,0.993515,0.000390561,0.003868715,0.0004982217,0.0001274429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3891773,0.00003094683,0.6097142,0.0002167706,0.0002211578,0.0001207894,0.000001607565,0.0000972526,0.000420042],"genre_scores_gemma":[0.9603011,0.000001443999,0.03947201,0.0001672696,0.00002524132,0.000004416799,0.00002226238,0.000003660933,0.000002597855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5711238,"threshold_uncertainty_score":0.4326427,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01813572326580032,"gpt":0.2622148126651445,"spread":0.2440790893993441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915878,0.0002387716,0.0002388165,0.0003199964,0.0007118316,0.0003108804,0.0002981866,0.0001013012,0.000001849205],"category_scores_gemma":[0.00009134303,0.0002270986,0.00008432104,0.0005299845,0.00006528666,0.001937723,0.0001055338,0.0001748208,0.00003259636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004300805,"about_ca_system_score_gemma":0.0001303159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001908708,"about_ca_topic_score_gemma":7.372377e-7,"domain_scores_codex":[0.9983649,0.00005129359,0.0006025363,0.0002843713,0.0003568096,0.0003401062],"domain_scores_gemma":[0.9986113,0.0002905107,0.0003747403,0.0001905029,0.0004041044,0.0001288638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001481649,0.000162221,0.0006196237,0.0002098758,0.00007305366,0.000005886608,0.009025979,0.1376663,0.0002032336,0.2444894,0.007174985,0.6002213],"study_design_scores_gemma":[0.001133794,0.0003381101,0.009398575,0.0000243532,0.000006226505,0.0001175611,0.00005734118,0.9717447,0.00009561635,0.01508152,0.00170895,0.0002932797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2707508,0.00007630288,0.7271011,0.0007666433,0.0003600957,0.0004127077,0.000006920416,0.0004000584,0.0001253706],"genre_scores_gemma":[0.9572486,0.00003398719,0.04162061,0.0007922158,0.00007945917,0.00002566987,0.0001808791,0.0000112917,0.000007304986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8340784,"threshold_uncertainty_score":0.926081,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0126155946364572,"gpt":0.2425891958319248,"spread":0.2299736011954676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002978404,0.0002350274,0.0001852229,0.000408835,0.0003333935,0.0007121047,0.0003195353,0.0001156328,0.00002623282],"category_scores_gemma":[0.00004075551,0.0001929276,0.00006634965,0.0005359084,0.00003827152,0.006326227,0.00007389538,0.0001951543,0.0007646611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004654319,"about_ca_system_score_gemma":0.00005227133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002420131,"about_ca_topic_score_gemma":0.000003958934,"domain_scores_codex":[0.9984081,0.00003863968,0.0006214853,0.000188782,0.0004642168,0.0002787629],"domain_scores_gemma":[0.9990787,0.0000821836,0.0002258232,0.0002450232,0.0001995136,0.0001687905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004142499,0.000131669,0.0003124741,0.00005738775,0.00003222957,4.15276e-7,0.007505438,0.003092724,0.0005778542,0.3537156,0.007268003,0.6272647],"study_design_scores_gemma":[0.001270133,0.0003640181,0.003893028,0.00002964668,0.000005233856,0.00001438703,0.0004182451,0.956534,0.002640946,0.001761583,0.03260681,0.0004619251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4962093,0.00003295521,0.4966257,0.004402032,0.0002589477,0.0002713916,0.0000111554,0.0003637724,0.001824746],"genre_scores_gemma":[0.9897436,0.00003445403,0.003204386,0.006794382,0.000047011,0.00002547412,0.0001355353,0.000006873945,0.000008243103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534413,"threshold_uncertainty_score":0.9828427,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007566230245772135,"gpt":0.240249210815786,"spread":0.2326829805700139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003207777,0.0001512298,0.0002004492,0.0002502842,0.0002149688,0.0002790361,0.000247027,0.00006320892,0.000001989942],"category_scores_gemma":[0.0000588303,0.0001418662,0.0000469242,0.0003123868,0.00007138827,0.001126729,0.000115029,0.0001018809,0.0000155348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001749848,"about_ca_system_score_gemma":0.00003062667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000235631,"about_ca_topic_score_gemma":0.000001567013,"domain_scores_codex":[0.9987974,0.00007313646,0.0005297707,0.0001663247,0.00025894,0.0001744885],"domain_scores_gemma":[0.9989927,0.0001754292,0.0003727663,0.0002074619,0.0001777398,0.00007392992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003280463,0.00009362766,0.0003816536,0.0002978173,0.00002418122,0.00000150234,0.005046959,0.04680573,0.0007595018,0.1634516,0.0001816299,0.782923],"study_design_scores_gemma":[0.0004056988,0.0003485026,0.005995454,0.00007284549,0.000007478703,0.00003206973,0.00005445552,0.9773532,0.0005694895,0.01426816,0.0007250897,0.000167571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.344826,0.0000111192,0.6540509,0.0001905925,0.0002109694,0.00009451668,0.000002129627,0.00009606361,0.0005176789],"genre_scores_gemma":[0.9658033,0.000004141312,0.03382174,0.0002735281,0.00004096986,0.000004330674,0.00004413894,0.000004984576,0.000002905169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9305475,"threshold_uncertainty_score":0.5785134,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009021169394826136,"gpt":0.2346620443819905,"spread":0.2256408749871643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002995032,0.0001833409,0.0001537156,0.0004345614,0.0003528532,0.000702447,0.0002245726,0.00009107994,0.000016651],"category_scores_gemma":[0.00002227013,0.0001753975,0.0000650377,0.0006720381,0.00004986791,0.005406835,0.00006623959,0.0001324409,0.0002851034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003689748,"about_ca_system_score_gemma":0.0000624196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001028141,"about_ca_topic_score_gemma":0.000009779541,"domain_scores_codex":[0.9985463,0.00005483058,0.0006394995,0.000164584,0.000356912,0.0002378592],"domain_scores_gemma":[0.9991267,0.00005078496,0.0002832936,0.0001940294,0.0002548464,0.00009034146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001633388,0.00004844073,0.0005033523,0.00004403999,0.000009281415,7.618311e-7,0.001029237,0.005212147,0.00006622445,0.8898453,0.01790052,0.08532438],"study_design_scores_gemma":[0.0005570197,0.00009640092,0.01247129,0.00001454727,0.000004435597,0.00003846859,0.0003824201,0.9531136,0.000219566,0.01383886,0.0190202,0.0002432488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1224187,0.00004990469,0.8707612,0.0005839836,0.001205337,0.0002222434,0.000003483829,0.0004937488,0.004261417],"genre_scores_gemma":[0.9947313,0.00001936932,0.003991036,0.001012832,0.00005595792,0.00002514706,0.0001244247,0.000005606636,0.00003433716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9479014,"threshold_uncertainty_score":0.7152504,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009848571169841867,"gpt":0.2555538596453963,"spread":0.2457052884755545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141378,0.0001927532,0.0001544254,0.00009519266,0.001173237,0.0008989873,0.0006181324,0.00006800226,0.000001106283],"category_scores_gemma":[0.0000420737,0.0001152624,0.00008763219,0.0002334017,0.00007318686,0.001048531,0.00007091669,0.0001365402,0.000007670225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002442748,"about_ca_system_score_gemma":0.00005390127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004186363,"about_ca_topic_score_gemma":0.000003508488,"domain_scores_codex":[0.9987185,0.00005899681,0.0004089805,0.0002219047,0.0002994767,0.0002921171],"domain_scores_gemma":[0.997958,0.001063507,0.0002547646,0.0003523203,0.0002962237,0.00007520512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003496123,0.00001539348,0.000001497851,0.00001240866,0.00001511668,3.64707e-8,0.001206906,0.0181235,0.000002474504,0.02851129,0.0005451874,0.9515627],"study_design_scores_gemma":[0.0006563768,0.0003532078,0.0004583437,0.00001089694,0.00001765874,0.0000198372,0.000262645,0.9419078,0.00002567432,0.01365406,0.04245367,0.0001798051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000957183,0.0001080102,0.9948003,0.002095025,0.0009450986,0.000848062,0.00002606827,0.0001900662,0.00003021737],"genre_scores_gemma":[0.2690272,0.00005721703,0.7246392,0.004821472,0.0008845154,0.0003510583,0.0001702869,0.00002667396,0.00002240552],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9513829,"threshold_uncertainty_score":0.9023705,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0241629315509909,"gpt":0.2546455599317617,"spread":0.2304826283807708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003110615,0.0001038336,0.00009518328,0.0001598144,0.000252667,0.0001639807,0.0002276631,0.00005224163,0.000002600554],"category_scores_gemma":[0.0001098368,0.00007450706,0.00003896161,0.0003200062,0.00005782927,0.0005960241,0.00005557682,0.0002088962,0.00002848078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005789502,"about_ca_system_score_gemma":0.00003983625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001003087,"about_ca_topic_score_gemma":0.00000350121,"domain_scores_codex":[0.9991761,0.00003732308,0.0003250391,0.0001079234,0.000234357,0.0001192356],"domain_scores_gemma":[0.9988247,0.0005223881,0.0002280878,0.0002136064,0.0001671645,0.00004402311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005837034,0.00002860945,0.00003950903,0.00001362884,0.000007202678,1.978596e-7,0.003746058,0.5566863,0.0002290591,0.1638866,0.0001440983,0.2752128],"study_design_scores_gemma":[0.0001896255,0.0001036679,0.009158424,0.00001451158,0.000002747711,0.000004373441,0.00009408977,0.9814708,0.0001823752,0.007355114,0.001335328,0.00008898893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.377955,0.000002511503,0.6197376,0.001218835,0.0002506016,0.0001366488,0.00000214357,0.00005915696,0.0006375388],"genre_scores_gemma":[0.988247,0.000003803069,0.01112016,0.0005713453,0.0000311769,0.00000656918,0.0000119363,0.000003416674,0.000004563288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6102921,"threshold_uncertainty_score":0.303831,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0130798921708418,"gpt":0.2433448068610807,"spread":0.2302649146902389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003051086,0.0001157526,0.0001907704,0.0004056938,0.0001273819,0.00005613788,0.0001185672,0.00004341748,0.000001981155],"category_scores_gemma":[0.00004053211,0.0001057563,0.00004070201,0.0005790828,0.00005649339,0.0006974334,0.00009940797,0.00009389524,0.000002309669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000404475,"about_ca_system_score_gemma":0.00005211551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006197182,"about_ca_topic_score_gemma":0.000001605022,"domain_scores_codex":[0.9988419,0.00004452066,0.0005305394,0.0001298936,0.0003221997,0.0001309116],"domain_scores_gemma":[0.9991131,0.0001109229,0.0004144637,0.0001107693,0.0001852189,0.00006551799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000017544,0.0001058067,0.00374423,0.0001781358,0.0001140525,7.901334e-7,0.01079691,0.03136449,0.0001966515,0.6320646,0.00004008241,0.3213767],"study_design_scores_gemma":[0.004766344,0.001770497,0.1017354,0.0003049402,0.00007885246,0.00004378945,0.001422566,0.7949619,0.006010926,0.08728035,0.001110595,0.0005138491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3773868,0.00009043474,0.6217626,0.0004112513,0.00007945661,0.0001555573,0.00001071081,0.00003284548,0.00007026449],"genre_scores_gemma":[0.9767718,0.00002785298,0.02309292,0.00005426164,0.00001722367,0.00000423315,0.00002790527,0.000002842193,0.000001014402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7635974,"threshold_uncertainty_score":0.4312615,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02436090355698631,"gpt":0.2745504652321133,"spread":0.250189561675127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007172141,0.0001649175,0.0002231089,0.0001587115,0.0002773601,0.001283608,0.0003551685,0.00009311827,2.063118e-7],"category_scores_gemma":[0.00006503204,0.0001402617,0.00003203276,0.0002835925,0.00005273978,0.001417074,0.0002912235,0.0001304932,0.000004461743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002051035,"about_ca_system_score_gemma":0.00006697392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009564926,"about_ca_topic_score_gemma":0.000001814784,"domain_scores_codex":[0.9988033,0.00007652769,0.0004300835,0.0002272593,0.0002159817,0.0002468167],"domain_scores_gemma":[0.9989977,0.0001471143,0.0002147681,0.0001624266,0.0002607477,0.0002172825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005499428,0.00003425545,0.0001834673,0.00008652802,0.00002478411,0.00000180589,0.002113303,0.2250884,0.000002004497,0.6345992,0.003048312,0.134763],"study_design_scores_gemma":[0.001080718,0.0002896769,0.001134486,0.00003505885,0.000006623912,0.00007773085,0.0002675218,0.9814944,0.000001577498,0.010539,0.004869636,0.0002036051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04434255,0.0002990227,0.9528762,0.0009684776,0.0006570386,0.0006045463,0.000005601029,0.0001555485,0.00009100279],"genre_scores_gemma":[0.9829103,0.00001998678,0.01632546,0.0005426421,0.00008985924,0.00004436157,0.00005033916,0.00000762854,0.000009408934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9385678,"threshold_uncertainty_score":0.9997532,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005472509669327465,"gpt":0.2429029828329795,"spread":0.237430473163652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247191,0.0001331666,0.0001388066,0.0001474326,0.0002190138,0.0003559389,0.0001692033,0.00005410541,0.000003048134],"category_scores_gemma":[0.00002302391,0.000121518,0.00003806518,0.0002855685,0.00001913013,0.001394014,0.00002592325,0.0001018385,0.00002227322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001754351,"about_ca_system_score_gemma":0.00003111431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005117106,"about_ca_topic_score_gemma":1.177286e-7,"domain_scores_codex":[0.9990456,0.00005306104,0.0003494573,0.0001481285,0.0002309203,0.000172879],"domain_scores_gemma":[0.99949,0.0000462399,0.0001733565,0.0001158338,0.00008599464,0.0000885842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004324284,0.00006366074,0.000003880114,0.000009178306,0.000005246661,7.944965e-7,0.002118717,0.009532016,0.0001780347,0.03783245,0.002153775,0.948059],"study_design_scores_gemma":[0.003373069,0.0002858909,0.0002716076,0.00001063487,0.000003789203,0.00002049365,0.00003857131,0.9834059,0.0002195656,0.009793689,0.002419616,0.000157151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1036104,0.00006718706,0.8941333,0.001277224,0.0001709425,0.0001704239,0.000004550852,0.0002395836,0.0003264663],"genre_scores_gemma":[0.9862617,0.00002448821,0.01231495,0.001239627,0.00003417516,0.000002869523,0.0001115728,0.000002758461,0.000007906979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9738739,"threshold_uncertainty_score":0.4955361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01007864777184532,"gpt":0.2487124666169714,"spread":0.238633818845126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004737563,0.0001504362,0.0001662498,0.0001601958,0.0003661008,0.0003757396,0.0002149099,0.00008444213,0.000002224654],"category_scores_gemma":[0.00007176915,0.0001274094,0.00004984482,0.0002207778,0.00004089839,0.0009724332,0.00007584316,0.00008951204,0.0000143059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001681612,"about_ca_system_score_gemma":0.00001879186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000161013,"about_ca_topic_score_gemma":0.000003321165,"domain_scores_codex":[0.998891,0.00007451185,0.000414605,0.0001950297,0.0001993027,0.0002255375],"domain_scores_gemma":[0.9992324,0.0001770919,0.0002039372,0.0001461823,0.0001536032,0.00008675207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001700207,0.00002967936,0.000094791,0.00006520053,0.000009055891,2.006473e-7,0.001533748,0.05840595,0.00003061695,0.4659457,0.0004423267,0.4734257],"study_design_scores_gemma":[0.0006016445,0.000254061,0.002217821,0.00002054706,0.000004435075,0.00001818864,0.00005399354,0.9517728,0.00004026475,0.03421842,0.01061827,0.0001795536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07348453,0.00003032412,0.9244767,0.0009382318,0.0003371108,0.000243975,0.000004269658,0.0002606025,0.000224257],"genre_scores_gemma":[0.9028485,0.00001036448,0.09571953,0.00119915,0.00007626213,0.0000210923,0.0001133144,0.000005229775,0.00000651454],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8933669,"threshold_uncertainty_score":0.5195604,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0152851609505867,"gpt":0.2467111823356186,"spread":0.2314260213850319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001953173,0.0001023014,0.0001234633,0.0001477138,0.0001762363,0.00007752745,0.0001694195,0.00004515863,0.000006456062],"category_scores_gemma":[0.00003786972,0.00007264849,0.00003664875,0.0002793979,0.0001068916,0.00107474,0.00007583437,0.00006349339,0.00002548538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001344028,"about_ca_system_score_gemma":0.00007721358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001881255,"about_ca_topic_score_gemma":5.517041e-7,"domain_scores_codex":[0.9991437,0.00005301469,0.0003662277,0.0001134772,0.0001873625,0.0001361997],"domain_scores_gemma":[0.9992645,0.0001564284,0.0002054991,0.000151033,0.000156395,0.0000660997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001165199,0.00002600346,0.0004067889,0.00004105238,0.00001922424,9.072087e-7,0.001772268,0.01200671,0.0003461466,0.1499857,0.0002816859,0.8351018],"study_design_scores_gemma":[0.000475556,0.000129133,0.004067438,0.00004706542,0.000003705828,0.00004823323,0.00008063101,0.981505,0.0003291948,0.01179925,0.001392298,0.0001224411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2752085,0.00001626707,0.7235045,0.0006993336,0.0001758037,0.0000776905,0.000005997842,0.0001081662,0.0002036808],"genre_scores_gemma":[0.94199,0.00001446454,0.05781025,0.0001430951,0.00002218902,0.000002516389,0.000008166431,0.00000312101,0.000006260403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9694983,"threshold_uncertainty_score":0.2962519,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.010786032058141,"gpt":0.2289266390103164,"spread":0.2181406069521754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003868615,0.0001206663,0.0001017915,0.000300232,0.0002356577,0.0004247758,0.0001415522,0.00006065142,0.00002328702],"category_scores_gemma":[0.00004446633,0.0001160004,0.00004148323,0.0005210709,0.00003072897,0.004820179,0.00002916854,0.00008613882,0.0002788635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002132919,"about_ca_system_score_gemma":0.0000502476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007009245,"about_ca_topic_score_gemma":5.380542e-7,"domain_scores_codex":[0.9989799,0.00005897488,0.0004046848,0.000111658,0.0002645171,0.0001802594],"domain_scores_gemma":[0.9993615,0.00003890235,0.0001861201,0.0001599985,0.0001573967,0.00009609207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002371818,0.00001149649,0.0001064816,0.00001782459,0.000004360585,1.66649e-7,0.0009503873,0.0005841326,0.00001989664,0.9589361,0.0007515857,0.03861519],"study_design_scores_gemma":[0.0008314909,0.0001138802,0.002991842,0.00001416393,0.00000473581,0.000054689,0.0006033317,0.8190029,0.0004714616,0.09806117,0.07755136,0.0002989728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03221485,0.00004872534,0.9485468,0.0002729158,0.0003049011,0.0001517347,0.000001132052,0.0002684325,0.01819051],"genre_scores_gemma":[0.9787081,0.00004813441,0.02007326,0.001102899,0.000008200078,0.00001531253,0.00002863865,0.000002919481,0.00001254994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9464932,"threshold_uncertainty_score":0.4730359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02902893302079605,"gpt":0.2569567659439299,"spread":0.2279278329231338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003050133,0.0001750401,0.00022639,0.0002013755,0.0006561028,0.0002738985,0.0002495319,0.00006159979,0.000002743765],"category_scores_gemma":[0.00003518576,0.0001704819,0.00006703602,0.0002676232,0.00005607014,0.001176444,0.0001102274,0.0001121392,0.00002964222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002303395,"about_ca_system_score_gemma":0.00007025134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004278329,"about_ca_topic_score_gemma":0.000001199316,"domain_scores_codex":[0.9986548,0.00003998348,0.0005543489,0.0002196428,0.0002626663,0.0002686009],"domain_scores_gemma":[0.9990513,0.0001571169,0.0003336886,0.0001669917,0.0001928812,0.00009801019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004906992,0.00009996301,0.0001747664,0.0003655476,0.00005735922,0.000002080032,0.02299343,0.08773281,0.0001649947,0.0593848,0.006158516,0.8228167],"study_design_scores_gemma":[0.0007191444,0.0001942343,0.001567263,0.00005165031,0.000005233439,0.00007493101,0.00007006768,0.9817765,0.0001011936,0.01328142,0.001935408,0.0002229771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103765,0.0000298152,0.8935518,0.001525528,0.0002394634,0.0004316972,0.00001421309,0.0002631827,0.0001793083],"genre_scores_gemma":[0.5689564,0.000006180164,0.429774,0.001081448,0.00009574474,0.0000240319,0.00004483433,0.000007146874,0.00001020174],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8940437,"threshold_uncertainty_score":0.695205,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01386412253971376,"gpt":0.2658587244044163,"spread":0.2519946018647025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005933582,0.0001672808,0.0001419256,0.00009870311,0.0005662915,0.0005539245,0.0001863064,0.00006903508,0.000001276005],"category_scores_gemma":[0.00003486203,0.0001202601,0.00004755879,0.0001936572,0.00005873707,0.001756815,0.0001017658,0.0001185642,0.00001367543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337566,"about_ca_system_score_gemma":0.00003927585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009521966,"about_ca_topic_score_gemma":0.000003082424,"domain_scores_codex":[0.9988973,0.0000343471,0.0003739298,0.0001601569,0.0002498184,0.0002845177],"domain_scores_gemma":[0.9991257,0.0002191521,0.0002102831,0.0001939692,0.0001456512,0.0001052678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002090379,0.0001580897,0.001120049,0.0002636049,0.000086911,7.581946e-7,0.03534445,0.1559484,0.0001910781,0.2384821,0.006388433,0.5618072],"study_design_scores_gemma":[0.0005209384,0.0001479156,0.005426626,0.00002005636,0.00001130488,0.00003516417,0.0001215143,0.9722487,0.00005085275,0.002546072,0.01869671,0.0001741979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2516005,0.0004178774,0.7457018,0.0009992154,0.00059497,0.000422238,0.000008542662,0.0001226829,0.000132141],"genre_scores_gemma":[0.9893727,0.00003766554,0.009463848,0.0008762706,0.0001464501,0.00003923152,0.00003812445,0.00000660145,0.00001914185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8163003,"threshold_uncertainty_score":0.5341507,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.005558103140995537,"gpt":0.2169883230702582,"spread":0.2114302199292627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003688937,0.0001784752,0.0001920401,0.0002733903,0.0002234993,0.0002269496,0.0002131647,0.00008755593,0.000003065362],"category_scores_gemma":[0.00002816256,0.0001527071,0.00005681022,0.0009169531,0.00006503669,0.00346018,0.00002945223,0.0001342321,0.00001266025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003311265,"about_ca_system_score_gemma":0.00006004931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001603959,"about_ca_topic_score_gemma":0.000001875418,"domain_scores_codex":[0.998467,0.00005355918,0.0006431099,0.0001582482,0.0004622967,0.0002158131],"domain_scores_gemma":[0.9987546,0.00003814316,0.0005032975,0.0002077868,0.0003982448,0.0000979188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001292911,0.0001853796,0.000140017,0.0001650641,0.00001888758,7.743175e-7,0.007292244,0.006912856,0.0001878072,0.7583867,0.0002642545,0.2263168],"study_design_scores_gemma":[0.0007761137,0.0007747913,0.005928103,0.00004011925,0.000008720802,0.00003593842,0.0004292266,0.9644316,0.004108537,0.02236863,0.0008802406,0.0002179724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2356156,0.00002688696,0.7628942,0.0003586988,0.000100187,0.0002687225,0.000007679644,0.0001581467,0.0005698398],"genre_scores_gemma":[0.9983697,0.0000145626,0.001213823,0.0002624477,0.00001179019,0.000009966247,0.0001139634,0.000002748626,0.000001002304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9575188,"threshold_uncertainty_score":0.6227216,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum entanglement; Quantum information processing; Quantum; Quantum information; Physics; Quantum sensor; Quantum mechanics; Quantum network","retraction":null,"screen_n_in":null,"score":{"opus":0.01162527823708187,"gpt":0.2282391988132924,"spread":0.2166139205762105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000268225,0.0001807477,0.0001502063,0.0002865877,0.0003996143,0.0008849725,0.0001758377,0.00006459315,0.000008097664],"category_scores_gemma":[0.0000279081,0.0001655047,0.00002920132,0.0003422529,0.00004616396,0.004505073,0.0001425437,0.0001480254,0.00006143512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002973522,"about_ca_system_score_gemma":0.00002082704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001700012,"about_ca_topic_score_gemma":6.957487e-7,"domain_scores_codex":[0.9987027,0.00004411216,0.0005206995,0.0001542247,0.0003373972,0.0002408558],"domain_scores_gemma":[0.9992633,0.00004770845,0.0002953507,0.0001354506,0.0001439168,0.0001143001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003997294,0.00001981198,0.00009708094,0.0001000744,0.000006609446,6.956305e-7,0.008013499,0.004399413,0.000006318005,0.03691688,0.0006493537,0.9497862],"study_design_scores_gemma":[0.0005383493,0.0001276157,0.002391201,0.00004580023,0.00000489375,0.00006268113,0.0003304623,0.9821113,0.00001812603,0.004255063,0.00990172,0.0002128035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1342142,0.0002401133,0.8624311,0.001684485,0.0002056579,0.0002427843,0.000004141385,0.000299438,0.0006780545],"genre_scores_gemma":[0.9839555,0.00007535395,0.01475867,0.001113975,0.00003819752,0.00001124483,0.00003630017,0.000004378052,0.00000635902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9777119,"threshold_uncertainty_score":0.853381,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03069184851153925,"gpt":0.3161141286558338,"spread":0.2854222801442946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404007,0.0002014889,0.0001742695,0.0005939355,0.000355085,0.0005629577,0.0002437404,0.0001050449,0.00000308572],"category_scores_gemma":[0.00005271966,0.0001642788,0.00005411328,0.0007187724,0.00008651811,0.00223775,0.00004934753,0.0001788866,0.00001111429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002827249,"about_ca_system_score_gemma":0.00003410398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002706776,"about_ca_topic_score_gemma":0.00003868755,"domain_scores_codex":[0.9981736,0.00007648482,0.0008388275,0.0001817122,0.0004170522,0.0003123223],"domain_scores_gemma":[0.9987459,0.0002961662,0.0004143033,0.0001926614,0.0002560015,0.00009495173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001489346,0.00009739339,0.0005164151,0.0002899569,0.00001513113,5.567635e-7,0.006703993,0.0003012357,0.00004322374,0.7087313,0.00086787,0.282284],"study_design_scores_gemma":[0.002575311,0.0005785,0.04214536,0.00005094706,0.000009103754,0.00002408214,0.001521254,0.8592462,0.00017757,0.07733419,0.0160133,0.0003241886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01391049,0.000006806842,0.9633375,0.0002672866,0.0001375499,0.02185914,0.00001177378,0.0001164166,0.0003530574],"genre_scores_gemma":[0.9545736,0.000007536825,0.02901246,0.001376577,0.00003168217,0.01491729,0.00007070559,0.000008809345,0.00000129194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9406632,"threshold_uncertainty_score":0.6699097,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008980207097274944,"gpt":0.23467951403764,"spread":0.2256993069403651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003362688,0.0001519087,0.0001532988,0.000162986,0.0002609371,0.000435553,0.0002484233,0.00005690789,0.000005907375],"category_scores_gemma":[0.00002625967,0.0001400872,0.00004289967,0.0002702023,0.00003477681,0.00218461,0.00006469209,0.0001601162,0.00008145929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003238618,"about_ca_system_score_gemma":0.00004211675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001697723,"about_ca_topic_score_gemma":0.000004106113,"domain_scores_codex":[0.9988328,0.00005761853,0.0004217654,0.0001810402,0.0002733008,0.0002334717],"domain_scores_gemma":[0.9992785,0.0001104529,0.0002071989,0.0001649839,0.0001424059,0.00009645378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006449076,0.00001973927,0.0001230278,0.00002019874,0.000007074985,5.379479e-7,0.002160609,0.075547,0.00007549904,0.0148594,0.0001209162,0.9070596],"study_design_scores_gemma":[0.000624174,0.0000869846,0.00398036,0.00001975339,0.000003625168,0.00004048994,0.00006938222,0.9874254,0.0001213826,0.004145415,0.003299368,0.0001836811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1236747,0.00007453218,0.8735775,0.001697098,0.0002138721,0.0001771455,0.000002004185,0.0002915212,0.0002916049],"genre_scores_gemma":[0.9644793,0.000004309969,0.0343125,0.001078788,0.00009734894,0.000007986873,0.00001041039,0.000004574071,0.000004769019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9118784,"threshold_uncertainty_score":0.5712592,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01503154884078769,"gpt":0.2430378286548151,"spread":0.2280062798140274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002087576,0.00009874549,0.0001054035,0.00005706544,0.0001763984,0.00008154789,0.00008494622,0.00002766051,0.000009964629],"category_scores_gemma":[0.000008224307,0.00007523738,0.00003400211,0.0001973993,0.00007027904,0.0005133789,0.00005902389,0.00007558982,0.00001007204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001002027,"about_ca_system_score_gemma":0.00004476101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003836068,"about_ca_topic_score_gemma":0.000002289403,"domain_scores_codex":[0.9992776,0.00003072276,0.00033602,0.00008790772,0.0001608188,0.0001069531],"domain_scores_gemma":[0.9993768,0.00004641345,0.0002542362,0.0001176089,0.0001352808,0.00006971102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004264952,0.00002019636,0.0004807271,0.0000181191,0.000007629117,7.136492e-9,0.001113927,0.00004955547,0.00002926666,0.9834366,0.0000911842,0.01474849],"study_design_scores_gemma":[0.0003959368,0.00005020249,0.002576289,0.00002119998,0.00001627199,0.000001715522,0.001032794,0.1244778,0.0001193642,0.8703898,0.0008287753,0.00008985071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7604625,0.00002884777,0.2365024,0.0003987004,0.00006206065,0.0003609264,0.00001995445,0.00002245918,0.002142124],"genre_scores_gemma":[0.9985085,0.000004834506,0.001231611,0.00009316131,0.00002434591,0.00003694897,0.0000871565,0.000005256803,0.000008193734],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.238046,"threshold_uncertainty_score":0.3068091,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01705356756772208,"gpt":0.2781427047566181,"spread":0.261089137188896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127739,0.0001890118,0.0001845418,0.0005000545,0.000158021,0.0004223587,0.0003910291,0.0001152613,0.000001669111],"category_scores_gemma":[0.00006612829,0.000191397,0.00001830451,0.0009911393,0.00003832215,0.009523412,0.0003208686,0.0001876631,0.00003093858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008497494,"about_ca_system_score_gemma":0.00007059581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001874802,"about_ca_topic_score_gemma":0.00008572382,"domain_scores_codex":[0.9982442,0.00006106013,0.0007512101,0.000242996,0.000320413,0.0003800812],"domain_scores_gemma":[0.9989763,0.00004328496,0.0002814614,0.0003338688,0.0001760558,0.0001890215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000128603,0.0002272967,0.03375958,0.0003642259,0.000009613906,9.652839e-7,0.02278728,0.003359774,0.0002964223,0.2835643,0.0002474252,0.6552545],"study_design_scores_gemma":[0.000633289,0.00005428384,0.1601796,0.000037324,0.000003194837,0.0000202033,0.001028222,0.8349933,0.00003236021,0.001158555,0.001643867,0.000215832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.390726,0.00009194087,0.6077996,0.0007513527,0.0001012185,0.0003542394,0.00002170182,0.00007593673,0.00007794274],"genre_scores_gemma":[0.9952512,0.00004032188,0.002654111,0.001167627,0.00002271313,0.0000453612,0.000812726,0.000005350681,5.656442e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8316335,"threshold_uncertainty_score":0.7804942,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01522114171343536,"gpt":0.2609398379872985,"spread":0.2457186962738632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004826425,0.000104221,0.0001287877,0.0003792121,0.0001607359,0.0002417136,0.000200486,0.00005525208,0.000006355479],"category_scores_gemma":[0.00004522506,0.0001018091,0.00005087873,0.0003045068,0.00003324441,0.005944688,0.00007473931,0.0001080621,0.00006738078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000180972,"about_ca_system_score_gemma":0.00003438425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006684205,"about_ca_topic_score_gemma":8.704036e-7,"domain_scores_codex":[0.998816,0.00002977047,0.0006181547,0.00008869195,0.000298041,0.0001493466],"domain_scores_gemma":[0.9991518,0.00007772214,0.0003960897,0.0001343996,0.0001779389,0.00006199761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004733874,0.00001564391,0.00007503945,0.00006617863,0.000009950058,9.056531e-8,0.02994749,0.005077189,0.0001910233,0.4114775,0.0002188429,0.5529163],"study_design_scores_gemma":[0.0003781077,0.00004130629,0.001285011,0.00002807208,0.000003186411,0.000005950007,0.000702952,0.9799179,0.0008037311,0.004312585,0.01238089,0.0001403465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06774891,0.00004290903,0.9271274,0.001261371,0.0002109016,0.0001072972,0.000001321475,0.0001714303,0.003328489],"genre_scores_gemma":[0.9368707,0.00001757974,0.06142603,0.001633341,0.00002782527,0.000004352076,0.00001384974,0.000002703222,0.000003595144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9748407,"threshold_uncertainty_score":0.4309756,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01532091587678499,"gpt":0.2666908944151126,"spread":0.2513699785383277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005242365,0.0001524456,0.0001564388,0.0002717919,0.0002387264,0.0002654276,0.0003550665,0.00009053754,0.00001178514],"category_scores_gemma":[0.0000967768,0.0001168111,0.00007184973,0.0006218211,0.0000820277,0.00327316,0.0001049029,0.0001856838,0.00008885742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002204491,"about_ca_system_score_gemma":0.00004649061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002508234,"about_ca_topic_score_gemma":0.000005035079,"domain_scores_codex":[0.998548,0.00006521975,0.0007223021,0.0001211099,0.0003568956,0.0001864996],"domain_scores_gemma":[0.9987605,0.0001762593,0.0004901639,0.0002478304,0.0002496227,0.00007558834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001166248,0.00003197141,0.0001759706,0.00004876055,0.00001470628,1.790791e-7,0.03167138,0.006008045,0.0000402852,0.3428406,0.0002633796,0.618893],"study_design_scores_gemma":[0.0003857347,0.00006545139,0.002845691,0.00003844178,0.000005849471,0.00001567327,0.001366124,0.9808733,0.0003420452,0.007035773,0.006870333,0.0001555218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1684064,0.00007699494,0.8293192,0.001110836,0.0001924893,0.0001852121,0.000001508554,0.0001277652,0.0005795907],"genre_scores_gemma":[0.902447,0.00005509597,0.09606746,0.001357626,0.00003516068,0.00001406363,0.00001502594,0.000004037761,0.000004468932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9748653,"threshold_uncertainty_score":0.4763419,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01505608627899911,"gpt":0.2456687686379319,"spread":0.2306126823589328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003158344,0.0002126356,0.0002000739,0.0002513348,0.001174414,0.0006556524,0.0003346108,0.00007486839,0.000004131486],"category_scores_gemma":[0.0001249901,0.000197826,0.00005613498,0.0004996539,0.000070991,0.002311041,0.0001901255,0.0002373283,0.00005577867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003964042,"about_ca_system_score_gemma":0.0001190662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001259439,"about_ca_topic_score_gemma":0.000005081149,"domain_scores_codex":[0.9984628,0.00008163817,0.0005537363,0.0002560068,0.0003521298,0.0002937086],"domain_scores_gemma":[0.9991518,0.00009936484,0.0001470143,0.0002284758,0.0002272357,0.0001461579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001267726,0.0001040387,0.001402695,0.0001034914,0.00004085344,0.0000295352,0.02740466,0.427927,0.0001390086,0.3149454,0.001567062,0.2263235],"study_design_scores_gemma":[0.0003678564,0.00008709658,0.006856973,0.00003976245,0.000004002952,0.0002101389,0.0001864151,0.9886009,0.0000494009,0.001556897,0.001772876,0.000267648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3935738,0.00006337868,0.6046488,0.0005587168,0.0003991674,0.0001379929,0.00000304333,0.0003036875,0.0003113788],"genre_scores_gemma":[0.957505,0.0000309736,0.04160548,0.0006964905,0.00007651795,0.00001127299,0.00005156374,0.000008584457,0.00001405899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5639312,"threshold_uncertainty_score":0.9032765,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008959282702468613,"gpt":0.2458973485539104,"spread":0.2369380658514418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451291,0.0001900488,0.0002178578,0.0004096581,0.0003259375,0.0002712658,0.0001861951,0.00008563665,0.00000324789],"category_scores_gemma":[0.00005855021,0.0001733832,0.00004455384,0.000475429,0.00009694036,0.001616129,0.0001315502,0.0001677306,0.00001219452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002508412,"about_ca_system_score_gemma":0.00006268688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001665868,"about_ca_topic_score_gemma":0.00001162699,"domain_scores_codex":[0.9984531,0.0000695413,0.0006689175,0.0002195922,0.0003206569,0.000268156],"domain_scores_gemma":[0.9990476,0.0001835153,0.0002187397,0.0001811946,0.0002403377,0.0001286602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000513682,0.00009765177,0.001062937,0.0002562689,0.00003841541,0.000003036219,0.01506104,0.08932195,0.001144848,0.5718176,0.0002805462,0.3208643],"study_design_scores_gemma":[0.0004910778,0.0002947634,0.01244574,0.00004886958,0.000007486338,0.00004378475,0.0005135298,0.9718965,0.0005349587,0.01307283,0.0004461048,0.0002044003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4554933,0.00009410195,0.5436699,0.0002836561,0.000162979,0.0001326292,0.000003550598,0.00009717981,0.00006269915],"genre_scores_gemma":[0.983596,0.00009632231,0.01588712,0.0003115797,0.00003459969,0.000004303721,0.0000593069,0.000006747664,0.00000407097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8825745,"threshold_uncertainty_score":0.7070362,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01027269309249842,"gpt":0.2373356775268577,"spread":0.2270629844343593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735497,0.0002113126,0.0001733918,0.0001731625,0.0008806846,0.000829428,0.0004457119,0.00007963006,0.000001108253],"category_scores_gemma":[0.00004301521,0.0001625657,0.00007879769,0.0005238182,0.00005255643,0.001167814,0.0001714134,0.0001661347,0.00007012631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007469882,"about_ca_system_score_gemma":0.000121871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001307936,"about_ca_topic_score_gemma":0.00002255364,"domain_scores_codex":[0.9984612,0.0000517841,0.0005005132,0.0002652779,0.0003431716,0.0003780185],"domain_scores_gemma":[0.9990736,0.0001027638,0.0002287831,0.0002634678,0.0001921715,0.0001391912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000353823,0.00005092514,0.00002764985,0.000083698,0.00002110673,8.603172e-7,0.01347827,0.06967326,0.0000591691,0.4199247,0.00105527,0.4955897],"study_design_scores_gemma":[0.0007656727,0.000360229,0.003469976,0.0000469718,0.000007039717,0.00004187281,0.0002006149,0.9337915,0.00005290125,0.05445395,0.006568177,0.0002410479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1120777,0.00008453132,0.8752583,0.01099681,0.0004790274,0.0007428332,0.000009826127,0.0002716624,0.00007929673],"genre_scores_gemma":[0.8773094,0.00000701438,0.1206215,0.001813983,0.000110162,0.0000672622,0.00005501309,0.00000984388,0.000005743695],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8641183,"threshold_uncertainty_score":0.7998194,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01956889494904168,"gpt":0.2843809318125789,"spread":0.2648120368635372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004693852,0.0002734642,0.0002192472,0.0008877455,0.000371327,0.0007468914,0.0004120693,0.0001253019,0.00001887748],"category_scores_gemma":[0.00003446382,0.0002532213,0.000121756,0.0007916206,0.00007963758,0.005938365,0.00005921708,0.000221576,0.0005027318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004341281,"about_ca_system_score_gemma":0.00009764966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005911712,"about_ca_topic_score_gemma":0.000001224894,"domain_scores_codex":[0.9979303,0.00008088884,0.0008037082,0.0002333005,0.000612706,0.0003390733],"domain_scores_gemma":[0.9986867,0.0001028992,0.0004258123,0.0003641487,0.0002314008,0.0001890304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004144088,0.0000881767,0.0001102591,0.00006599688,0.00001084562,4.227367e-7,0.0008140387,0.01066097,0.00001849879,0.8704914,0.002013388,0.1156845],"study_design_scores_gemma":[0.001390361,0.0003722582,0.003608981,0.0000634895,0.000004037575,0.000008096062,0.00009659536,0.9317386,0.0002919871,0.01625172,0.04583554,0.0003383426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04056194,0.00003916336,0.9496137,0.003564214,0.0002479753,0.003286838,0.000008537527,0.000792528,0.001885049],"genre_scores_gemma":[0.9783886,0.00002042018,0.01175385,0.00871515,0.00009977916,0.0009323996,0.00007510954,0.00001011545,0.000004549671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9378599,"threshold_uncertainty_score":0.999992,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04720131900658231,"gpt":0.320527603127554,"spread":0.2733262841209717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005091014,0.000124554,0.0001571027,0.0001153576,0.000174066,0.0000939679,0.000122268,0.00005869062,0.00000660671],"category_scores_gemma":[0.0003178936,0.00009034117,0.00003155682,0.0002995577,0.0001774973,0.00111313,0.0001119153,0.0001327626,0.000009806613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003888917,"about_ca_system_score_gemma":0.00007121952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009438341,"about_ca_topic_score_gemma":0.000009210115,"domain_scores_codex":[0.9987752,0.00009246731,0.0004747714,0.0001040875,0.0003913181,0.0001621171],"domain_scores_gemma":[0.9989824,0.0001997742,0.0002597023,0.0001659013,0.0002951045,0.00009715684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001985331,0.00002193533,0.000218833,0.0001385334,0.000008695301,9.68822e-8,0.00368299,0.0000808594,0.00003762908,0.9844823,0.0001040762,0.01120422],"study_design_scores_gemma":[0.0006777025,0.0001272113,0.001807014,0.00005315221,0.00001391777,0.00001564125,0.001334204,0.08550671,0.0001877312,0.9099642,0.0002003605,0.0001121271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8755437,0.0000633215,0.1219753,0.0004363526,0.00006337571,0.0005908054,0.000007685376,0.00005198346,0.00126747],"genre_scores_gemma":[0.9884126,0.00001702002,0.01137061,0.0001092799,0.00001430261,0.00002798062,0.00002053305,0.00000975508,0.00001790762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1128689,"threshold_uncertainty_score":0.3684006,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01216896844723628,"gpt":0.2225147353145484,"spread":0.2103457668673121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513055,0.0001455446,0.000178681,0.0003755282,0.0001417014,0.0002487946,0.000261219,0.00006423768,0.00001212368],"category_scores_gemma":[0.00005914128,0.0001384629,0.00005691944,0.0004764019,0.0000601177,0.001689024,0.00008966404,0.00009395155,0.00004936644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001418948,"about_ca_system_score_gemma":0.00005796747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002798225,"about_ca_topic_score_gemma":0.000006549086,"domain_scores_codex":[0.9986247,0.00006126282,0.0006818309,0.0001232306,0.0003157928,0.0001931744],"domain_scores_gemma":[0.9988161,0.0001024476,0.0004648656,0.0001683263,0.0003474388,0.0001008764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003175277,0.00004776573,0.001558727,0.0001852222,0.00002167315,3.349516e-7,0.004849762,0.004739366,0.00002548526,0.6956936,0.0004646072,0.2923817],"study_design_scores_gemma":[0.0007234951,0.0002048585,0.01047188,0.00003390391,0.000005179963,0.00001482488,0.0003244431,0.9600078,0.0001807207,0.02323016,0.004621195,0.0001815107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2165826,0.00001319012,0.7790512,0.0001658524,0.0001500826,0.0001394186,0.00000602916,0.0001366359,0.00375497],"genre_scores_gemma":[0.9753752,0.00002072184,0.02353045,0.000896183,0.00001158644,0.00000906591,0.0001497671,0.000004025496,0.000002979778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9552684,"threshold_uncertainty_score":0.5646354,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006348388901392206,"gpt":0.2276200462815898,"spread":0.2212716573801976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002630086,0.0001559791,0.0001393661,0.0001479422,0.0002593505,0.0003842474,0.0002052262,0.00005089746,0.000002006123],"category_scores_gemma":[0.00002280319,0.0001469369,0.00003750174,0.0003502517,0.00003116878,0.001712335,0.00005140019,0.0001316413,0.00002785468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003540991,"about_ca_system_score_gemma":0.00003823104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002841626,"about_ca_topic_score_gemma":5.6724e-7,"domain_scores_codex":[0.998884,0.00006677703,0.0003694051,0.0001890249,0.0002780205,0.0002127648],"domain_scores_gemma":[0.999326,0.0000589221,0.0002251084,0.0001638603,0.0001193769,0.0001067673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001698533,0.00004006055,0.00008541158,0.00002071997,0.000008567986,0.00000137886,0.002716006,0.02278918,0.0001007504,0.1298363,0.002527734,0.841857],"study_design_scores_gemma":[0.0003700624,0.0001602648,0.009389558,0.00001371843,0.000002596825,0.00001330127,0.00005254472,0.9469295,0.00005754126,0.03826075,0.004563643,0.000186524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050413,0.00004965603,0.7923304,0.001652533,0.0001698226,0.0001246984,0.000008151826,0.0002868662,0.0003365709],"genre_scores_gemma":[0.9929198,0.00002371238,0.006106324,0.0008248723,0.00002067089,0.000001202407,0.00008766828,0.00000304312,0.00001268331],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9241403,"threshold_uncertainty_score":0.5991912,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00841151625109927,"gpt":0.1992975510209865,"spread":0.1908860347698872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009207943,0.00006601208,0.00007798839,0.00005226396,0.00003753588,0.00005474748,0.00002224418,0.00002394289,0.000004188107],"category_scores_gemma":[0.00001334003,0.00006506989,0.0000190344,0.00007866277,0.0000204875,0.0002594555,0.000004341,0.00003838816,0.00001865337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002706445,"about_ca_system_score_gemma":0.000008723745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005427975,"about_ca_topic_score_gemma":0.000005695197,"domain_scores_codex":[0.9994746,0.000008132313,0.0002432749,0.00003469974,0.0001658405,0.00007346572],"domain_scores_gemma":[0.9997718,0.00002104378,0.00005036894,0.00004683858,0.00009321261,0.00001670455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001387783,0.00001227203,0.0002506645,0.0001955321,0.00001160408,6.620744e-7,0.0009087354,0.9363362,0.0007443721,0.001818518,0.001453297,0.05825433],"study_design_scores_gemma":[0.0002721836,0.00002418559,0.001811937,0.00002394743,0.000006189281,0.000006949473,0.00008763459,0.9919845,0.0005942729,0.0003439451,0.004764981,0.00007929542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8824425,0.0001254499,0.1124796,0.00005798795,0.0001379551,0.0001245055,0.00000360201,0.0001800916,0.004448297],"genre_scores_gemma":[0.9994306,0.000006262774,0.0004798032,0.00003245957,0.00001508272,0.000002240643,0.00002197301,0.000004625834,0.000006970129],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1169881,"threshold_uncertainty_score":0.2653473,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01440491895055201,"gpt":0.234745910412612,"spread":0.22034099146206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002571266,0.0002933214,0.000268335,0.0004045904,0.0007049906,0.0003163281,0.0003223829,0.0001145842,0.000004723705],"category_scores_gemma":[0.0000462745,0.0002689436,0.00008666405,0.0006091085,0.0001069747,0.001521659,0.0001190771,0.0003039663,0.0001459986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006185126,"about_ca_system_score_gemma":0.000135737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006889177,"about_ca_topic_score_gemma":0.000001784909,"domain_scores_codex":[0.998048,0.0001168399,0.0005941178,0.0003462153,0.0005462987,0.0003485438],"domain_scores_gemma":[0.9987912,0.0002039698,0.000332681,0.000241889,0.0002518958,0.0001783277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007421629,0.0001321644,0.0001495709,0.00006267396,0.00002923569,0.0000269205,0.007527675,0.7461613,0.00005515241,0.09851101,0.001764633,0.1455054],"study_design_scores_gemma":[0.001000994,0.0004428229,0.005273223,0.00004728891,0.000005274625,0.000137721,0.000190657,0.9867711,0.0000689691,0.002799217,0.002926712,0.0003360284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.34783,0.00002415012,0.6495168,0.001224425,0.0004661597,0.0002171439,0.000007192023,0.0003564906,0.0003576865],"genre_scores_gemma":[0.9802517,0.00003090681,0.0185079,0.0009628851,0.0001053623,0.000006223057,0.0001113979,0.00001239138,0.00001120118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6324217,"threshold_uncertainty_score":0.9999763,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01081686408051893,"gpt":0.2742233040731158,"spread":0.2634064399925969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283847,0.0001256149,0.0001599951,0.0003568049,0.0001247464,0.0001427758,0.0001737328,0.00006771128,0.00002585158],"category_scores_gemma":[0.00001156153,0.0001173334,0.00006686943,0.0004319971,0.00004548864,0.001997518,0.00006915291,0.00009480219,0.000020917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001935261,"about_ca_system_score_gemma":0.00004915933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007665422,"about_ca_topic_score_gemma":0.000005400636,"domain_scores_codex":[0.998819,0.00006201694,0.0005485466,0.0001342783,0.0002710289,0.0001651322],"domain_scores_gemma":[0.9992663,0.00009378349,0.0002886894,0.0001567592,0.0001315304,0.00006295854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005783994,0.0001489818,0.001135274,0.0002119005,0.00007273821,0.000001645621,0.00982245,0.0913156,0.0001730479,0.4338047,0.001130597,0.4621252],"study_design_scores_gemma":[0.001148445,0.0001857211,0.02470724,0.00001999751,0.00001328138,0.00001053647,0.0004498572,0.9669977,0.0004227114,0.005208135,0.0006806889,0.0001556095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3104602,0.0001089006,0.6883129,0.0005879084,0.0001395825,0.0001793275,0.000003262387,0.00006951923,0.0001383697],"genre_scores_gemma":[0.9661859,0.0001071894,0.03331079,0.0003146521,0.00002374258,0.00001162463,0.00003940222,0.000003553582,0.000003147104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8756822,"threshold_uncertainty_score":0.4784718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}