{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Daniel Gottesman","is_ca":true},{"name":"Hoi-Kwong Lo","is_ca":true},{"name":"John Preskill","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008169536,0.001304376,0.002639036,0.001373187,0.002289284,0.006960898,0.003160019,0.003974695,0.002874683],"category_scores_gemma":[0.03422547,0.001204775,0.001132802,0.001714912,0.009369821,0.01025379,0.009919625,0.00504624,0.001176087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003251366,"about_ca_system_score_gemma":0.002766483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007696215,"about_ca_topic_score_gemma":0.0002354178,"domain_scores_codex":[0.9899422,0.003257743,0.0005939858,0.001402723,0.003386173,0.001417242],"domain_scores_gemma":[0.9677637,0.0199563,0.002267894,0.007647453,0.001770754,0.000593856],"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.0003949084,0.0000536116,0.0006648264,0.0001997386,0.00007124866,0.0002117071,0.0002917598,0.0547055,0.006547401,0.9244785,0.0008253045,0.01155547],"study_design_scores_gemma":[0.0001485652,0.0001236789,0.0002504363,0.00009511583,0.00005401766,0.0003364728,0.00006401115,0.3366767,0.01285908,0.6462812,0.003017563,0.00009323832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1357983,0.001307742,0.8306485,0.003283519,0.0001704041,0.0001646214,0.0002909485,0.0004850869,0.0278508],"genre_scores_gemma":[0.969619,0.0006019573,0.02689689,0.0001811454,0.00009956474,0.000171276,0.00009998523,0.00004364974,0.002286701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008169536,"threshold_uncertainty_score":0.04320514,"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","authors":[{"name":"Panos Aliferis","is_ca":false},{"name":"Daniel Gottesman","is_ca":true},{"name":"John Preskill","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935734,0.0004472775,0.0007982928,0.0007702234,0.0008632204,0.001820447,0.001118635,0.001430605,0.003568103],"category_scores_gemma":[0.01588425,0.0003182637,0.0005471975,0.000650402,0.002456954,0.002824334,0.002916299,0.002165885,0.0007283297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002259705,"about_ca_system_score_gemma":0.001317938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001169614,"about_ca_topic_score_gemma":0.0007173974,"domain_scores_codex":[0.9970618,0.0003660847,0.0001934363,0.0003595038,0.001549429,0.0004697479],"domain_scores_gemma":[0.9886879,0.006786923,0.001182641,0.001644024,0.001286369,0.0004121198],"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.0002189016,0.00004597647,0.001596604,0.000103946,0.00002997029,0.0001749583,0.0002521647,0.2313432,0.01693354,0.7306884,0.001344384,0.01726793],"study_design_scores_gemma":[0.00001909119,0.00009931254,0.000572268,0.00003650474,0.00001976485,0.0002031312,0.00003384925,0.6791142,0.02240891,0.2954422,0.001998064,0.00005258939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2386182,0.0006224193,0.7337699,0.001071367,0.0001538855,0.0000608721,0.000276766,0.0007778649,0.02464871],"genre_scores_gemma":[0.966028,0.0001754172,0.03058662,0.0001976268,0.00004607943,0.00005969351,0.0000938629,0.0000921096,0.00272058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003568103,"threshold_uncertainty_score":0.01639533,"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","authors":[{"name":"Andrew M. Childs","is_ca":true},{"name":"Nathan Wiebe","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007425545,0.0004324573,0.0005785272,0.0003179965,0.0004279991,0.0005889472,0.00115556,0.0006131519,0.003082161],"category_scores_gemma":[0.002392023,0.0003483798,0.000479025,0.0004761463,0.0009600437,0.001560739,0.001162332,0.000971683,0.000391384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003493303,"about_ca_system_score_gemma":0.0006271107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000748096,"about_ca_topic_score_gemma":0.0009282907,"domain_scores_codex":[0.9993953,0.000241331,0.00002889209,0.00007704181,0.0002008705,0.0000566012],"domain_scores_gemma":[0.9990267,0.0005329114,0.00007074355,0.0002243064,0.00009025865,0.00005509902],"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.0002562543,0.0001630527,0.0006316156,0.0001035808,0.00006666256,0.0001380239,0.000127549,0.6839354,0.01502662,0.2470713,0.000915347,0.05156469],"study_design_scores_gemma":[0.00001552767,0.00004440845,0.00002630883,0.000002497529,0.000005243597,0.0000162967,0.000005236551,0.9780634,0.003078573,0.01830657,0.000428591,0.000007324681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0522788,0.00007670946,0.9423072,0.00009860245,0.00004399772,0.00006725898,0.00002831475,0.000428176,0.004670919],"genre_scores_gemma":[0.6843029,0.000159878,0.3126779,0.00007252535,0.00002827599,0.0002121389,0.0000637208,0.0001239695,0.002358702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003082161,"threshold_uncertainty_score":0.01031083,"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","authors":[{"name":"John Proos","is_ca":true},{"name":"Ch. Zalka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756333,0.0006672938,0.001051849,0.000935356,0.001629663,0.002168209,0.00144819,0.001199726,0.007785625],"category_scores_gemma":[0.003717802,0.0004576934,0.0009670288,0.001312499,0.002102009,0.004624823,0.002657233,0.00186867,0.002660034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009902,"about_ca_system_score_gemma":0.002005103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008055853,"about_ca_topic_score_gemma":0.0007752876,"domain_scores_codex":[0.9978368,0.0004679883,0.0001450341,0.00023135,0.0009881522,0.0003307728],"domain_scores_gemma":[0.9991366,0.0002672087,0.00004456141,0.000335942,0.0001675255,0.00004814765],"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.0001285918,0.00005885333,0.0001862091,0.0001278773,0.00002024002,0.0001108831,0.0002157632,0.02322846,0.003285984,0.8972077,0.005960744,0.0694686],"study_design_scores_gemma":[0.000119462,0.0001010312,0.00009563938,0.00005570329,0.00001886665,0.0001394769,0.00007637022,0.1253061,0.01137048,0.8323405,0.03031977,0.00005653949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02140043,0.0006199974,0.9443083,0.001533567,0.000401834,0.0002401589,0.0001606166,0.001333887,0.03000113],"genre_scores_gemma":[0.3344362,0.001108433,0.6472998,0.0004065965,0.0002224725,0.000363233,0.0003666671,0.0003727319,0.01542381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007785625,"threshold_uncertainty_score":0.0260455,"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","authors":[{"name":"Sevag Gharibian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393504,0.000876172,0.001654695,0.0006500844,0.002233209,0.004345224,0.003198569,0.002243055,0.006066242],"category_scores_gemma":[0.01250669,0.0008728535,0.001736694,0.001214523,0.004892207,0.008284708,0.004674098,0.009299481,0.0007330201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002311767,"about_ca_system_score_gemma":0.001912074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034869,"about_ca_topic_score_gemma":0.001592985,"domain_scores_codex":[0.9966962,0.0008941635,0.0001710432,0.0009151201,0.0008791028,0.0004442446],"domain_scores_gemma":[0.9816616,0.0150913,0.0007287292,0.001247425,0.0006441482,0.000626948],"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.001425787,0.0006580746,0.002909024,0.0009966743,0.0002583063,0.0008026532,0.001200057,0.135903,0.01269919,0.7714189,0.02418616,0.0475421],"study_design_scores_gemma":[0.0001556974,0.00005679413,0.0006408768,0.00003481328,0.00003979754,0.0002095333,0.0002020303,0.131861,0.004137272,0.8580798,0.004551183,0.00003125044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5341007,0.001846947,0.3382704,0.02507171,0.0004018072,0.0002492459,0.003596993,0.001295181,0.09516709],"genre_scores_gemma":[0.9548776,0.0006516391,0.03340221,0.001156615,0.0003488876,0.0002436261,0.001919068,0.0001739142,0.007226383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006066242,"threshold_uncertainty_score":0.02029359,"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","authors":[{"name":"Stéphane Beauregard","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761738,0.0004704722,0.0007250396,0.0002886604,0.0009007633,0.0009747796,0.000979808,0.0009518438,0.01465151],"category_scores_gemma":[0.001288651,0.0002792828,0.000627081,0.0004569658,0.001046039,0.002173288,0.001161832,0.001022975,0.001482515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009690491,"about_ca_system_score_gemma":0.001388877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009559878,"about_ca_topic_score_gemma":0.001536646,"domain_scores_codex":[0.9994575,0.00008559441,0.00002735206,0.00009453526,0.0002111143,0.0001237974],"domain_scores_gemma":[0.9997388,0.0001003913,0.00002085748,0.00007579225,0.00004294466,0.00002127973],"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.0007561664,0.000279607,0.0007528813,0.0005364601,0.00006975701,0.0003314708,0.0004312564,0.05620446,0.0447652,0.7681019,0.01191109,0.1158597],"study_design_scores_gemma":[0.0005221844,0.0006685956,0.0008359064,0.0001446821,0.0001029447,0.000625918,0.0001569961,0.4068706,0.07003033,0.4755619,0.04434286,0.000137071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08186919,0.000399003,0.8849717,0.001729798,0.0002747066,0.0004514653,0.0005181592,0.002501223,0.02728471],"genre_scores_gemma":[0.5702466,0.0003343948,0.4192942,0.0003894546,0.00007882494,0.00039635,0.0004143936,0.0001792095,0.008666461],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01465151,"threshold_uncertainty_score":0.04901415,"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","authors":[{"name":"Daniel Gottesman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001187556,0.0004123844,0.0008706229,0.0005464241,0.0007172932,0.001362234,0.001363097,0.001110908,0.002421036],"category_scores_gemma":[0.01383354,0.000264724,0.0004052511,0.0006715402,0.001822812,0.004256603,0.001637714,0.001933282,0.0004370344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001283209,"about_ca_system_score_gemma":0.0007472193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002346405,"about_ca_topic_score_gemma":0.0001836712,"domain_scores_codex":[0.9986369,0.0003056017,0.00005344267,0.0001933209,0.0006141158,0.0001965443],"domain_scores_gemma":[0.9933736,0.003940642,0.0003498996,0.001620393,0.0004547728,0.000260652],"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.0004275928,0.0001048837,0.0004645062,0.0002142907,0.00003306401,0.0001746148,0.000150193,0.09670055,0.02416546,0.8439297,0.002606112,0.03102889],"study_design_scores_gemma":[0.00005345724,0.0000889842,0.0002275073,0.00002811266,0.00002001657,0.0001712958,0.00003360505,0.4411149,0.0114608,0.5438573,0.002922243,0.00002176912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2959841,0.001351016,0.6678208,0.004220618,0.0004727627,0.00008571953,0.0001074433,0.001720518,0.02823694],"genre_scores_gemma":[0.9344568,0.0003986739,0.06209528,0.0002626428,0.0001545323,0.00007953351,0.00004603732,0.0001259309,0.002380671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002421036,"threshold_uncertainty_score":0.009310424,"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)","authors":[{"name":"Bing Qi","is_ca":true},{"name":"C.-H. F. Fung","is_ca":true},{"name":"Hoi‐Kwong Lo","is_ca":true},{"name":"Fermi Ma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004252347,0.0007245429,0.0008691119,0.000875741,0.001652274,0.002478818,0.001059782,0.003459469,0.003125487],"category_scores_gemma":[0.01090426,0.0006418922,0.0007618777,0.00114521,0.005907133,0.007733807,0.003003759,0.003075776,0.0006276366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724278,"about_ca_system_score_gemma":0.0008943562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003774297,"about_ca_topic_score_gemma":0.0001743391,"domain_scores_codex":[0.9946185,0.002088869,0.0002650277,0.0006121834,0.001958045,0.0004575309],"domain_scores_gemma":[0.9901924,0.006604188,0.0009157471,0.001647617,0.0004356609,0.0002043277],"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.0003988776,0.00005818712,0.0006964814,0.0001829318,0.00005379967,0.0004647201,0.0004127891,0.03462759,0.01150999,0.9213907,0.00183387,0.02837],"study_design_scores_gemma":[0.0001671916,0.0002020716,0.0003374037,0.00008214155,0.00004252597,0.0007154221,0.0001514307,0.3068272,0.0199572,0.6594768,0.01196519,0.00007544499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2023169,0.00294941,0.7536473,0.00574717,0.0003511478,0.0002449705,0.0001073184,0.000529262,0.03410637],"genre_scores_gemma":[0.9533886,0.001122976,0.04112959,0.000277306,0.0002265473,0.0001231005,0.00003384589,0.00003835879,0.003659757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004252347,"threshold_uncertainty_score":0.02248883,"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","authors":[{"name":"David Poulin","is_ca":true},{"name":"Yeojin Chung","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348111,0.0007787087,0.0008186842,0.0007709184,0.0005206264,0.0009943018,0.001043162,0.001331938,0.001865471],"category_scores_gemma":[0.01185957,0.0003245299,0.0005153592,0.00148385,0.00215186,0.001704936,0.001812071,0.001482826,0.0007845691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006762629,"about_ca_system_score_gemma":0.00116597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789292,"about_ca_topic_score_gemma":0.001481225,"domain_scores_codex":[0.9987469,0.0004885526,0.00004692393,0.0001291784,0.0004502535,0.0001382214],"domain_scores_gemma":[0.9956635,0.00302529,0.0002516306,0.000413183,0.0005647227,0.0000817487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001243209,0.00004336654,0.0005013109,0.0001311478,0.0000385156,0.0001397279,0.0002641147,0.5621963,0.005210654,0.3635873,0.002091216,0.06567203],"study_design_scores_gemma":[0.00001229863,0.0000269252,0.00005968053,0.0000165111,0.000006147035,0.00004305705,0.00001440349,0.8293958,0.002584076,0.1668595,0.0009683071,0.00001326906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02407892,0.0003858352,0.9666873,0.0004384779,0.00007876263,0.00003417326,0.00004945337,0.0001330721,0.00811411],"genre_scores_gemma":[0.5394453,0.001859088,0.4479568,0.0004336488,0.0003111442,0.0001837726,0.0002578382,0.0001977084,0.009354727],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001865471,"threshold_uncertainty_score":0.00712955,"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","authors":[{"name":"Mark R. Dowling","is_ca":false},{"name":"Morten Nielsen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190102,0.0003291219,0.0004691042,0.001026554,0.002521493,0.004713654,0.000649347,0.0009072549,0.005234338],"category_scores_gemma":[0.003058136,0.0002789427,0.0005681869,0.0006796719,0.009843334,0.007189345,0.002419127,0.002439338,0.0006293893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002870405,"about_ca_system_score_gemma":0.001077596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003213315,"about_ca_topic_score_gemma":0.001247941,"domain_scores_codex":[0.9987227,0.0004797568,0.00004168495,0.0002544189,0.0003477948,0.0001535911],"domain_scores_gemma":[0.9988455,0.0005770969,0.00008186258,0.000233438,0.0001400408,0.000121976],"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.00000193074,7.118154e-7,0.00001540604,0.000003655109,8.6847e-7,0.000003495761,0.0000548022,0.0001521044,0.00004525899,0.9988942,0.0002969161,0.0005307525],"study_design_scores_gemma":[0.000002305151,0.00000307596,0.00006139321,0.000003800913,0.000001032538,0.000007612894,0.00003975325,0.0007079481,0.00005335511,0.9945744,0.004542645,0.000002765795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.190016,0.01357777,0.1191362,0.02964021,0.001151586,0.00009789885,0.0008174059,0.0004010769,0.6451619],"genre_scores_gemma":[0.9734491,0.001927288,0.009844184,0.0007392651,0.0007213477,0.00006415979,0.000137611,0.00006211907,0.013055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005234338,"threshold_uncertainty_score":0.0208264,"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","authors":[{"name":"Vadym Kliuchnikov","is_ca":true},{"name":"Dmitri Maslov","is_ca":false},{"name":"Michele Mosca","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000527991,0.0003562401,0.0005944485,0.0003377588,0.0005079369,0.001163344,0.001010932,0.0006110129,0.003302057],"category_scores_gemma":[0.001998633,0.0002236444,0.0005962626,0.0004304785,0.0009294934,0.001688283,0.001039285,0.0007867774,0.0004678203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006424056,"about_ca_system_score_gemma":0.0006715101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004120594,"about_ca_topic_score_gemma":0.0005464892,"domain_scores_codex":[0.9993379,0.0001353629,0.00005296167,0.0001641239,0.0001785083,0.0001311691],"domain_scores_gemma":[0.9993535,0.0002964212,0.00006887667,0.0001890798,0.00005526294,0.00003693547],"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.0005978922,0.0001578309,0.0007774431,0.0004452203,0.00008439367,0.0002740542,0.0003040796,0.09183409,0.06574679,0.7202085,0.002109113,0.1174606],"study_design_scores_gemma":[0.0001319948,0.0002999713,0.0002835115,0.00005532762,0.00004487426,0.000156193,0.00007849697,0.5532362,0.1450167,0.295127,0.005524724,0.00004484757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.28347,0.0006594006,0.69184,0.0003701738,0.0001730884,0.0001456024,0.0002179124,0.0009639672,0.02215988],"genre_scores_gemma":[0.8997009,0.0001560095,0.09734953,0.0001026918,0.00002506952,0.000102665,0.0001150153,0.00009031652,0.00235783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003302057,"threshold_uncertainty_score":0.01104653,"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","authors":[{"name":"David Poulin","is_ca":true},{"name":"M. B. Hastings","is_ca":false},{"name":"D. Wecker","is_ca":false},{"name":"Nathan Wiebe","is_ca":false},{"name":"Andrew C. Doberty","is_ca":false},{"name":"Matthias Troyer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287499,0.000479672,0.0008992399,0.0004748902,0.0009142451,0.0007844932,0.001717065,0.001635035,0.005445583],"category_scores_gemma":[0.01083527,0.000464543,0.0005681848,0.0006081107,0.001205712,0.00219497,0.0008062579,0.003835385,0.001142178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009645954,"about_ca_system_score_gemma":0.001536134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001998414,"about_ca_topic_score_gemma":0.002483369,"domain_scores_codex":[0.9991953,0.0002208002,0.00003975471,0.00008289395,0.0003940648,0.00006727262],"domain_scores_gemma":[0.9936122,0.004543438,0.0002891721,0.001026516,0.0003912162,0.0001375082],"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.0003027953,0.0003112709,0.002226927,0.0005618354,0.0001116838,0.0002935818,0.0003545521,0.5375456,0.04988319,0.3536506,0.003770484,0.0509874],"study_design_scores_gemma":[0.00002474308,0.00007683122,0.0003061212,0.00002525924,0.00001345015,0.00006028854,0.00001730424,0.9532811,0.008770593,0.03478289,0.002623167,0.0000183058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109581,0.001336472,0.8645341,0.001758637,0.0004751224,0.0002185514,0.0003076828,0.001354579,0.01905682],"genre_scores_gemma":[0.6721096,0.001231421,0.3217391,0.0003560131,0.0001858944,0.0006057783,0.0002235998,0.0004365328,0.003112029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005445583,"threshold_uncertainty_score":0.01821727,"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","authors":[{"name":"Andrew M. Childs","is_ca":true},{"name":"Nathan Wiebe","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006031374,0.0004221796,0.0005114524,0.0002943453,0.0005004019,0.0007134359,0.001074975,0.000627151,0.004281513],"category_scores_gemma":[0.002159248,0.0003464864,0.0004250603,0.0004697546,0.0008995634,0.001774423,0.001226951,0.001016495,0.0005899093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000361567,"about_ca_system_score_gemma":0.0005765461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007027987,"about_ca_topic_score_gemma":0.0009840112,"domain_scores_codex":[0.9994082,0.0002366981,0.0000284075,0.00007493363,0.0001958947,0.00005595275],"domain_scores_gemma":[0.9991906,0.0004255168,0.00004744228,0.0002104379,0.00008176571,0.00004433268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000338115,0.0002026751,0.0006747706,0.0001193985,0.00006936661,0.0002014077,0.0002131631,0.5575769,0.02273182,0.3437525,0.001928475,0.07219135],"study_design_scores_gemma":[0.00002011271,0.00004378869,0.00002991616,0.000002854945,0.000005913311,0.00002248629,0.000008335177,0.9678909,0.005400462,0.02571356,0.0008525028,0.00000914435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06849506,0.00009193485,0.9214879,0.000147734,0.00007275441,0.00008180599,0.00004003281,0.0008292239,0.008753528],"genre_scores_gemma":[0.7051917,0.0001520983,0.2904254,0.00007871445,0.00003141732,0.0001975252,0.00007952793,0.0001998764,0.003643738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004281513,"threshold_uncertainty_score":0.01432312,"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","authors":[{"name":"Hoi‐Kwong Lo","is_ca":true},{"name":"John Preskill","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006929914,0.001179307,0.001148169,0.001344349,0.001918946,0.003802516,0.00182322,0.002479224,0.002730286],"category_scores_gemma":[0.02270404,0.0007980707,0.000884732,0.001401756,0.007821386,0.006110224,0.007662876,0.003682163,0.0009440769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001783265,"about_ca_system_score_gemma":0.002237577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004522536,"about_ca_topic_score_gemma":0.0002034101,"domain_scores_codex":[0.9938261,0.002360564,0.0002881515,0.0005588483,0.002072664,0.0008936401],"domain_scores_gemma":[0.9815223,0.01257915,0.001506567,0.00289857,0.001053898,0.0004395086],"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.0003076151,0.00007261945,0.0004353561,0.0001641073,0.00005105909,0.0001456011,0.0002440029,0.02347064,0.00796879,0.9562978,0.0007190343,0.0101234],"study_design_scores_gemma":[0.000202133,0.000218145,0.0002205209,0.00007695612,0.00005035271,0.0001962875,0.00007250936,0.2129122,0.02508955,0.757999,0.002884086,0.00007832942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1788549,0.0007615223,0.7925205,0.003673564,0.000167428,0.0001829829,0.0001769429,0.0003062146,0.02335596],"genre_scores_gemma":[0.9686587,0.0004743468,0.02842496,0.0002824505,0.0001194914,0.000217103,0.00006701011,0.00003753327,0.001718398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006929914,"threshold_uncertainty_score":0.03664935,"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","authors":[{"name":"Andrew M. Childs","is_ca":true},{"name":"Dominic W. Berry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007275001,0.0005799654,0.00083215,0.0004613795,0.000718496,0.0009239017,0.00170178,0.001529912,0.009511797],"category_scores_gemma":[0.00291044,0.000447173,0.000870564,0.0005984648,0.001717928,0.002170961,0.001635737,0.001681898,0.001152644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005822842,"about_ca_system_score_gemma":0.000913401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001085848,"about_ca_topic_score_gemma":0.001118397,"domain_scores_codex":[0.9994281,0.0002181501,0.00002377157,0.00007171242,0.0001774334,0.00008078229],"domain_scores_gemma":[0.9990467,0.000449278,0.00005524309,0.0003122594,0.0000797887,0.00005670171],"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.0001423486,0.00009010095,0.0003309794,0.0001226976,0.00003983826,0.0001230203,0.0001135864,0.4289089,0.006127951,0.5431792,0.001676456,0.01914509],"study_design_scores_gemma":[0.00002887483,0.00001877619,0.00002436263,0.000007068663,0.000004647819,0.00001576449,0.000007674512,0.908106,0.002827943,0.08725764,0.001691216,0.00001004276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.032255,0.0001716578,0.9543231,0.0003621416,0.00009018467,0.0001275516,0.000126524,0.0008566346,0.0116872],"genre_scores_gemma":[0.5297832,0.0003921147,0.4599703,0.0002745287,0.0000573528,0.00061759,0.0002427163,0.0004602403,0.00820196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009511797,"threshold_uncertainty_score":0.03182012,"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","authors":[{"name":"Ke Chen","is_ca":true},{"name":"Hoi-Kwong Lo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061837,0.0004944826,0.0006186288,0.0006299242,0.001134829,0.001714425,0.001840015,0.001129646,0.00317758],"category_scores_gemma":[0.005269443,0.0004933997,0.0006412886,0.0007922631,0.002830893,0.003780124,0.003709282,0.001755907,0.0007213957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008590635,"about_ca_system_score_gemma":0.0006893168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002334582,"about_ca_topic_score_gemma":0.0003489805,"domain_scores_codex":[0.998243,0.0006289864,0.00009884701,0.0002539201,0.000546844,0.0002284708],"domain_scores_gemma":[0.9959515,0.00178236,0.0004490811,0.00145931,0.0002126005,0.0001451812],"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.0001958786,0.0000748122,0.0003246615,0.0001049285,0.00003694924,0.0001167003,0.0003018228,0.03811365,0.01847646,0.9290264,0.0008817238,0.01234599],"study_design_scores_gemma":[0.0001378434,0.0001821604,0.0003453097,0.00005703103,0.00005980911,0.0002392889,0.0001637454,0.5071062,0.0746851,0.405039,0.01189066,0.0000938142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1339634,0.0003949001,0.8446237,0.0009432936,0.0001118458,0.0002312291,0.0001435934,0.0004568509,0.0191312],"genre_scores_gemma":[0.8822573,0.0002673838,0.110894,0.0002192202,0.00005425671,0.0003743051,0.00008534453,0.00007125628,0.0057769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00317758,"threshold_uncertainty_score":0.01090419,"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","authors":[{"name":"Ellie D’Hondt","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002164735,0.000309659,0.0006491637,0.0008857095,0.001766268,0.003575524,0.001060756,0.001338005,0.005095141],"category_scores_gemma":[0.006594412,0.0004476385,0.0008412099,0.0007918947,0.006530142,0.00752816,0.003070358,0.002636455,0.0005692968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006448682,"about_ca_system_score_gemma":0.0008033939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004503699,"about_ca_topic_score_gemma":0.0002519695,"domain_scores_codex":[0.9984182,0.0005801962,0.00007538978,0.0002689263,0.0003205363,0.0003367974],"domain_scores_gemma":[0.9960146,0.00251225,0.000249228,0.000913423,0.0001372741,0.0001732712],"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.00003497359,0.000009722572,0.0000787906,0.00001905198,0.000003610929,0.00002314335,0.0000656515,0.00197268,0.0007410035,0.9928949,0.0002876548,0.003868751],"study_design_scores_gemma":[0.00001599613,0.00002095724,0.00008682909,0.00001346347,0.000004499938,0.00004319992,0.00003996513,0.0187532,0.001255032,0.9784343,0.001318143,0.00001448542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4530139,0.002098076,0.3858496,0.006618552,0.0004247513,0.0001306087,0.0003137881,0.0004199223,0.1511308],"genre_scores_gemma":[0.9726113,0.0005815533,0.02271088,0.0003599648,0.0001677165,0.0001333518,0.00006082383,0.00004507018,0.003329342],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005095141,"threshold_uncertainty_score":0.01704496,"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","authors":[{"name":"Peter Selinger","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192608,0.0007193588,0.0008128115,0.0003590302,0.0005810529,0.0008412584,0.001547841,0.0008288319,0.004245667],"category_scores_gemma":[0.002652357,0.0003034816,0.0007029588,0.0005623231,0.0008754268,0.001344088,0.001442875,0.00113697,0.00125411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001247147,"about_ca_system_score_gemma":0.001911475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00304196,"about_ca_topic_score_gemma":0.004639353,"domain_scores_codex":[0.9990897,0.0001856295,0.00004483122,0.0001286679,0.0003416408,0.0002095097],"domain_scores_gemma":[0.9991073,0.0002628486,0.00008197702,0.0003809104,0.0001125953,0.00005446898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001330538,0.0003169396,0.002486184,0.0003392635,0.00009683501,0.0003744076,0.0003476568,0.3814948,0.04355091,0.3148876,0.0106748,0.2441002],"study_design_scores_gemma":[0.00007315732,0.00008110714,0.0001220343,0.00001068295,0.000009790505,0.00006503068,0.00002574181,0.9336383,0.01367791,0.05088165,0.001399935,0.00001473822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.139057,0.0001897304,0.8478087,0.0003442291,0.00007931452,0.0001228806,0.0001431634,0.00252189,0.009733126],"genre_scores_gemma":[0.6878667,0.0001106971,0.3052958,0.0001849403,0.00003256294,0.0001676306,0.000341664,0.0002552031,0.005744664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004245667,"threshold_uncertainty_score":0.01420319,"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","authors":[{"name":"Panos Aliferis","is_ca":false},{"name":"Daniel Gottesman","is_ca":true},{"name":"John Preskill","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521447,0.0005599164,0.001010529,0.0009990019,0.001058292,0.002350857,0.002222393,0.001586838,0.004275768],"category_scores_gemma":[0.02647704,0.000406746,0.0006829134,0.000686264,0.004386135,0.004370959,0.003660375,0.004099777,0.0008389134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002440578,"about_ca_system_score_gemma":0.00147101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007640451,"about_ca_topic_score_gemma":0.0003717825,"domain_scores_codex":[0.9947201,0.0006678887,0.0002317178,0.0006746312,0.002879388,0.0008262683],"domain_scores_gemma":[0.983465,0.009784551,0.00127342,0.003026938,0.001904481,0.0005456073],"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.0002405691,0.00005570783,0.0007747677,0.0001254634,0.000026354,0.0001157955,0.0001708173,0.07064587,0.01142567,0.8984049,0.001570985,0.01644312],"study_design_scores_gemma":[0.00003979587,0.0001369138,0.0003949984,0.00005037055,0.0000222185,0.0001651946,0.00003497214,0.4545034,0.02427276,0.5175938,0.002738047,0.0000475199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1305482,0.0009610499,0.8356882,0.002331303,0.0003359883,0.0000842444,0.0001933543,0.0009493421,0.02890827],"genre_scores_gemma":[0.9635432,0.0003180436,0.03270935,0.0003216297,0.0001044748,0.00007801849,0.00006943139,0.0001135548,0.002742267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004275768,"threshold_uncertainty_score":0.01862341,"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","authors":[{"name":"John Watrous","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003826946,0.0005977745,0.0005589331,0.001631223,0.001089477,0.002169729,0.001242286,0.0009447383,0.003972881],"category_scores_gemma":[0.007503018,0.0003757297,0.0008899299,0.0008673237,0.005381022,0.005431686,0.002116344,0.003764786,0.0004710524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001363955,"about_ca_system_score_gemma":0.00083647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006434844,"about_ca_topic_score_gemma":0.0006325054,"domain_scores_codex":[0.9976452,0.0007806726,0.0001017673,0.0003607761,0.0009055037,0.0002059956],"domain_scores_gemma":[0.9936112,0.003561554,0.0005693714,0.0005634786,0.0009886972,0.0007057576],"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.000008644677,0.000005468888,0.00005227278,0.00001349679,0.000001710136,0.00002638036,0.00007832927,0.0003922923,0.0006347061,0.9975947,0.0002598776,0.0009320821],"study_design_scores_gemma":[0.000006929182,0.00003711268,0.0002170853,0.00001404614,0.00000324898,0.00009477191,0.00006098527,0.01271905,0.0008710068,0.9836233,0.002335644,0.00001684001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3422701,0.003444559,0.426669,0.005649373,0.0009804592,0.00006649279,0.0003652088,0.0002840634,0.2202707],"genre_scores_gemma":[0.9226058,0.001336335,0.05645276,0.001254913,0.001116117,0.0001500967,0.0002127641,0.0002341663,0.01663707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003972881,"threshold_uncertainty_score":0.02023906,"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","authors":[{"name":"Adam Paetznick","is_ca":true},{"name":"Krysta M. Svore","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009400491,0.0007994484,0.0007521348,0.0004724543,0.0006447417,0.0009649865,0.001556186,0.0009385527,0.005237339],"category_scores_gemma":[0.004502078,0.0004163038,0.0007756371,0.0004189161,0.001473246,0.002082872,0.002027767,0.001794388,0.00140466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001033866,"about_ca_system_score_gemma":0.001221086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009465854,"about_ca_topic_score_gemma":0.001489558,"domain_scores_codex":[0.9989381,0.0003044017,0.00005102368,0.0001851521,0.0003359087,0.0001854108],"domain_scores_gemma":[0.9982485,0.0006182613,0.0002010528,0.0006306705,0.0001858333,0.000115624],"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.0008869232,0.0002281407,0.001157314,0.0002474252,0.00007491123,0.0001547536,0.0002938394,0.2584308,0.04735953,0.452634,0.005588563,0.2329438],"study_design_scores_gemma":[0.00005923374,0.000181305,0.0001176871,0.00002241586,0.00001460362,0.00006356514,0.00003261495,0.8807667,0.02915977,0.08692992,0.00262535,0.00002682963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05038356,0.0001177509,0.9423991,0.0001668163,0.00003944624,0.00009355664,0.00006354359,0.001303715,0.005432438],"genre_scores_gemma":[0.5942469,0.0001039208,0.3991595,0.0002097764,0.00002882042,0.0002394868,0.0002384066,0.000351884,0.005421352],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005237339,"threshold_uncertainty_score":0.01752067,"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","authors":[{"name":"David W. Kribs","is_ca":false},{"name":"Raymond Laflamme","is_ca":false},{"name":"David Poulin","is_ca":false},{"name":"Maia Lesosky","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001734251,0.0005634132,0.0008343133,0.000990589,0.001258031,0.001580728,0.001840932,0.001177117,0.01227364],"category_scores_gemma":[0.005520069,0.0002133185,0.0007725864,0.001203801,0.002460667,0.003245664,0.002229656,0.002012531,0.002218443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008445112,"about_ca_system_score_gemma":0.001304495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007699045,"about_ca_topic_score_gemma":0.0005724421,"domain_scores_codex":[0.9979285,0.0005105781,0.00009311832,0.0002578369,0.001031677,0.0001783251],"domain_scores_gemma":[0.9979317,0.0005478724,0.0001425034,0.0007985245,0.0005042087,0.0000752111],"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.00002045242,0.000008413349,0.00005302072,0.00004708337,0.000006296844,0.00003798801,0.00006068197,0.002367498,0.001239547,0.9788269,0.00246797,0.01486419],"study_design_scores_gemma":[0.00002652548,0.00007408112,0.0001305898,0.00006316728,0.00002040418,0.000352807,0.00004505244,0.07150278,0.007421307,0.8468129,0.07348876,0.00006158502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008525793,0.0009362939,0.9225138,0.001335005,0.002088211,0.0001186497,0.0002271495,0.000795338,0.06345978],"genre_scores_gemma":[0.4808801,0.002580819,0.4237227,0.00201079,0.001363528,0.0003060158,0.0004060125,0.0008140933,0.08791596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01227364,"threshold_uncertainty_score":0.04105943,"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","authors":[{"name":"David Gosset","is_ca":true},{"name":"Vadym Kliuchnikov","is_ca":true},{"name":"Michele Mosca","is_ca":true},{"name":"Vincent M. Russo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427534,0.001345587,0.0009419592,0.001234131,0.001600704,0.002385025,0.002539958,0.002404621,0.01865298],"category_scores_gemma":[0.004097557,0.0006342321,0.001916925,0.001377365,0.001791343,0.003647376,0.003356032,0.003848835,0.005451912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002178195,"about_ca_system_score_gemma":0.00346434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00189746,"about_ca_topic_score_gemma":0.002781577,"domain_scores_codex":[0.9985321,0.0002596093,0.0001288024,0.0004285155,0.0004405691,0.0002104729],"domain_scores_gemma":[0.9985738,0.0005625337,0.000103569,0.0003906875,0.0002731111,0.00009630757],"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.0005850523,0.0004132787,0.0008182754,0.0005783382,0.0001281635,0.0004070663,0.000403499,0.03568418,0.01607189,0.492419,0.037898,0.4145932],"study_design_scores_gemma":[0.000430863,0.0002925321,0.0002999718,0.0001430603,0.0000785141,0.0008648174,0.000156907,0.4014148,0.01929954,0.5382823,0.0385897,0.0001470815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005168672,0.0001906009,0.9817499,0.0008839819,0.0002354502,0.0003192609,0.0001746863,0.002206587,0.009070889],"genre_scores_gemma":[0.07673015,0.0001787396,0.9117602,0.0005521493,0.0001107144,0.0006658499,0.0005029722,0.0005200556,0.008979253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01865298,"threshold_uncertainty_score":0.0624004,"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","authors":[{"name":"Andrew M. Childs","is_ca":false},{"name":"Robin Kothari","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003699035,0.0006865567,0.001114481,0.0004758142,0.001119451,0.0009955666,0.002547246,0.001977427,0.0041171],"category_scores_gemma":[0.02452587,0.0006074556,0.001166938,0.0005081609,0.002476591,0.00602489,0.002318646,0.003052987,0.0004544582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00122221,"about_ca_system_score_gemma":0.001474172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004873,"about_ca_topic_score_gemma":0.002173641,"domain_scores_codex":[0.9979001,0.0009315987,0.0001281969,0.0002956796,0.000503698,0.0002406413],"domain_scores_gemma":[0.9696904,0.02235366,0.0008968416,0.00557732,0.0008573051,0.0006246623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005514253,0.0002472751,0.002874309,0.0004506465,0.0001224738,0.0001421402,0.0002257229,0.7525331,0.01025367,0.2004008,0.003656324,0.02854204],"study_design_scores_gemma":[0.00004209148,0.00007060372,0.0001681745,0.00001630321,0.00001509402,0.00003115238,0.00001975441,0.9113272,0.002886416,0.08423846,0.001172502,0.0000122012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5397922,0.001590385,0.4144346,0.008995339,0.000425793,0.0003012522,0.0007215585,0.002332149,0.0314068],"genre_scores_gemma":[0.9266523,0.0008445173,0.06894719,0.0005462111,0.0001084607,0.0003285461,0.000423996,0.000260291,0.001888481],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0041171,"threshold_uncertainty_score":0.0195626,"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","authors":[{"name":"Tzu-Chieh Wei","is_ca":false},{"name":"Marie Ericsson","is_ca":true},{"name":"Paul M. Goldbart","is_ca":false},{"name":"William J. Munro","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002474439,0.0006536295,0.0006768245,0.004047105,0.0009838729,0.002270387,0.001103985,0.0009794029,0.004360904],"category_scores_gemma":[0.01599161,0.0003825062,0.0005712626,0.001881078,0.006036028,0.00717356,0.002974533,0.002054141,0.0003535139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587942,"about_ca_system_score_gemma":0.0005366159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003144506,"about_ca_topic_score_gemma":0.0002559754,"domain_scores_codex":[0.9974046,0.0008119562,0.0001055227,0.0004949832,0.0008287132,0.0003541759],"domain_scores_gemma":[0.9858178,0.01071591,0.001237759,0.001130994,0.0007026852,0.0003948648],"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.00001713031,0.00001518145,0.0005542607,0.00004622644,0.00001418612,0.00003989106,0.000103029,0.01147896,0.0009374886,0.9817175,0.0002645775,0.004811595],"study_design_scores_gemma":[0.000004308594,0.00002318818,0.000886266,0.00001990014,0.000006662547,0.00008647203,0.00005140746,0.031159,0.0007665514,0.9656531,0.001318428,0.00002481762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2566922,0.006854305,0.6398802,0.002888157,0.0003173147,0.0001026665,0.0003445713,0.000243973,0.09267654],"genre_scores_gemma":[0.9681845,0.002005583,0.02597995,0.000199378,0.0003746844,0.00009835417,0.0001447311,0.00007467441,0.002938129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004360904,"threshold_uncertainty_score":0.01458871,"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","authors":[{"name":"Christopher J. Wood","is_ca":true},{"name":"Jacob Biamonte","is_ca":true},{"name":"David G. Cory","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002954407,0.0009701359,0.0006661856,0.002487392,0.002134871,0.003889591,0.001364782,0.001264863,0.007501189],"category_scores_gemma":[0.005905288,0.0004467855,0.001520875,0.002259971,0.00574651,0.007620182,0.002525122,0.003070926,0.001110461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002496433,"about_ca_system_score_gemma":0.001391816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002784825,"about_ca_topic_score_gemma":0.001902919,"domain_scores_codex":[0.9976285,0.000984252,0.0001403737,0.0003443605,0.0006532422,0.0002493592],"domain_scores_gemma":[0.9975604,0.001258806,0.0002388613,0.0003227644,0.0004232119,0.0001958518],"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.000001289555,0.000001712964,0.000008333044,0.000009243573,0.000001313289,0.00001109144,0.00004219795,0.0007500956,0.00007811104,0.9979302,0.0002517899,0.0009147539],"study_design_scores_gemma":[0.000002587281,0.000004096779,0.00001754646,0.00001145626,0.000002988069,0.00002408571,0.00002188595,0.008171249,0.0001138707,0.9854248,0.006198404,0.000006937875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01128071,0.001666058,0.945347,0.002008833,0.0003617524,0.00009096289,0.0003749639,0.0003265199,0.03854332],"genre_scores_gemma":[0.5495505,0.003938814,0.419108,0.001540903,0.001017425,0.0007095232,0.0005458458,0.0003817816,0.0232073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007501189,"threshold_uncertainty_score":0.02509397,"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","authors":[{"name":"Sergio Boixo","is_ca":false},{"name":"E. Knill","is_ca":false},{"name":"Rolando D. Somma","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005329707,0.0003432105,0.0004264946,0.0004662508,0.0007224817,0.0007192444,0.0009656317,0.0006385135,0.005901525],"category_scores_gemma":[0.002057632,0.0003687745,0.0004220331,0.0006632752,0.0008796481,0.001617483,0.001304615,0.0007500838,0.0009451772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007944416,"about_ca_system_score_gemma":0.001273612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001498024,"about_ca_topic_score_gemma":0.002076534,"domain_scores_codex":[0.9995382,0.0001519694,0.0000200311,0.0001157039,0.0001086092,0.00006546946],"domain_scores_gemma":[0.9990774,0.0004181696,0.00008779371,0.0002859424,0.00008129384,0.00004932193],"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.0005661928,0.0002088252,0.001409346,0.0001727907,0.00004905175,0.0001563782,0.0002404506,0.2704101,0.02835365,0.4862263,0.006745659,0.2054612],"study_design_scores_gemma":[0.00005474992,0.00007601027,0.0001884859,0.00001243129,0.00001044677,0.00008143426,0.0000249411,0.8690752,0.008841293,0.1141031,0.007511512,0.00002041497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0802777,0.000313949,0.9069583,0.0003271342,0.00007051128,0.0001335643,0.0001975165,0.002076783,0.009644581],"genre_scores_gemma":[0.5806431,0.0003025414,0.4087202,0.0001635144,0.00002732537,0.0003148862,0.0003853452,0.0003587797,0.009084349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005901525,"threshold_uncertainty_score":0.01974255,"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)","authors":[{"name":"Guillaume Duclos-Cianci","is_ca":true},{"name":"David Poulin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004764971,0.0002657631,0.0004064774,0.0004636445,0.0005029138,0.0007000957,0.0008538333,0.0009943988,0.001524338],"category_scores_gemma":[0.002703267,0.0001333723,0.0003636852,0.000368703,0.0009615375,0.0009594452,0.001093208,0.0007916341,0.0005064474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008823873,"about_ca_system_score_gemma":0.0008820993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007017874,"about_ca_topic_score_gemma":0.0008165167,"domain_scores_codex":[0.9995145,0.0001203516,0.00003243506,0.00006022783,0.0002039182,0.0000686696],"domain_scores_gemma":[0.99902,0.0003436757,0.00009284772,0.0003425889,0.0001537636,0.00004713413],"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.0003691164,0.0001025295,0.001265724,0.0001173772,0.00004494674,0.000334121,0.000315307,0.1514846,0.06956019,0.6958376,0.002926012,0.07764243],"study_design_scores_gemma":[0.00004783594,0.00007756813,0.0002596145,0.00001187673,0.000007478798,0.0001489182,0.00002214992,0.8175596,0.04012224,0.1388169,0.00288501,0.00004073482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.272926,0.0001904337,0.7107247,0.0008171801,0.0001682918,0.0001028378,0.00016159,0.001465507,0.0134434],"genre_scores_gemma":[0.7645842,0.00007690302,0.2313363,0.0002200538,0.00003386311,0.00009160582,0.000117392,0.000128634,0.003411029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001524338,"threshold_uncertainty_score":0.006402194,"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","authors":[{"name":"Richard Cleve","is_ca":true},{"name":"Debbie Leung","is_ca":true},{"name":"Li Liu","is_ca":true},{"name":"Chunhao Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626894,0.0006507247,0.0006868195,0.0007045909,0.0008295762,0.002208833,0.001705127,0.001449599,0.01054303],"category_scores_gemma":[0.009537213,0.0009619889,0.0009968085,0.0009035596,0.002285749,0.005627143,0.004244698,0.002465723,0.002218715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001178106,"about_ca_system_score_gemma":0.0009545407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003344399,"about_ca_topic_score_gemma":0.0005014837,"domain_scores_codex":[0.996884,0.0007968658,0.0002173913,0.0005254003,0.001096751,0.0004795636],"domain_scores_gemma":[0.9949987,0.002521041,0.0002723052,0.001643566,0.0003954763,0.0001689287],"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.0003720259,0.0001030853,0.000573905,0.0003098286,0.00003936562,0.0001257891,0.0003396956,0.02801154,0.01286724,0.8836005,0.002864685,0.07079232],"study_design_scores_gemma":[0.00009746714,0.0001564277,0.0001996555,0.00006773582,0.00003703636,0.0001950365,0.00006569014,0.1045721,0.01814787,0.8683016,0.008107856,0.00005163292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08873318,0.0006659902,0.887571,0.0006186845,0.000194218,0.000168338,0.0003328738,0.001659726,0.02005608],"genre_scores_gemma":[0.6551095,0.0004555581,0.3327972,0.0005905504,0.0001307272,0.0004677855,0.0003654381,0.0003530202,0.009730227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01054303,"threshold_uncertainty_score":0.03526992,"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","authors":[{"name":"Daniel Gottesman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941955,0.0006823521,0.0009506964,0.0007365562,0.001544002,0.003128235,0.001868053,0.001712891,0.01120466],"category_scores_gemma":[0.007680994,0.0005447284,0.001138299,0.001222409,0.004275203,0.008780803,0.005714563,0.004022856,0.005393723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001670628,"about_ca_system_score_gemma":0.001530819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005138887,"about_ca_topic_score_gemma":0.000461627,"domain_scores_codex":[0.9959902,0.0008670903,0.0003202133,0.0007468522,0.00148114,0.0005944734],"domain_scores_gemma":[0.9936002,0.001411964,0.0004700725,0.00367409,0.0006937773,0.0001498182],"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.00003819696,0.00001447028,0.00009923831,0.00007839742,0.000008403412,0.00007865993,0.0001747795,0.0008581177,0.001714523,0.9751371,0.004702301,0.0170958],"study_design_scores_gemma":[0.00005206475,0.00006007964,0.0001730826,0.0001419733,0.00001913466,0.0007072259,0.00006312392,0.01512169,0.01184871,0.8450511,0.1267198,0.00004215552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01571344,0.002370875,0.8253191,0.005381134,0.0009956819,0.0003089993,0.0008098094,0.001095453,0.1480056],"genre_scores_gemma":[0.5783422,0.004533523,0.3063179,0.00468414,0.0008254003,0.001142284,0.001439005,0.0007114441,0.1020042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01120466,"threshold_uncertainty_score":0.03748333,"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","authors":[{"name":"Peter W. Shor","is_ca":false},{"name":"Stephen P. Jordan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481681,0.0007680386,0.00172035,0.0009033108,0.001204873,0.003061147,0.002073556,0.001493488,0.004821478],"category_scores_gemma":[0.01934224,0.0006344609,0.001249201,0.001281048,0.002233726,0.006953361,0.001967612,0.003123484,0.0006429382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001937596,"about_ca_system_score_gemma":0.002582052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004741494,"about_ca_topic_score_gemma":0.003297523,"domain_scores_codex":[0.9970195,0.000728653,0.0001349304,0.0009004789,0.0008097115,0.0004066754],"domain_scores_gemma":[0.979484,0.0146307,0.001324899,0.003114951,0.001056453,0.0003890285],"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.0006720202,0.0003188165,0.007010917,0.0004304905,0.0001702392,0.0002418524,0.0005454707,0.432781,0.006126238,0.433854,0.006287117,0.1115619],"study_design_scores_gemma":[0.00003420224,0.00006999296,0.001013134,0.00001715858,0.00002148164,0.0000805081,0.0001071613,0.6192625,0.003528151,0.3740738,0.00175493,0.0000370175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2374582,0.0003782161,0.7544198,0.001546573,0.00004678365,0.0001073643,0.0006285676,0.0007856624,0.004628795],"genre_scores_gemma":[0.795118,0.0003890434,0.1981346,0.0001979916,0.0001438598,0.0001183532,0.001277368,0.0002450367,0.004375706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004821478,"threshold_uncertainty_score":0.01612943,"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","authors":[{"name":"Adam Paetznick","is_ca":true},{"name":"Ben W. Reichardt","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001714025,0.001218485,0.001259818,0.001344832,0.001414771,0.002646845,0.001864276,0.001636454,0.005785667],"category_scores_gemma":[0.01388473,0.0004957856,0.000838108,0.001047838,0.00356881,0.00356784,0.002540547,0.00349383,0.001008489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003501871,"about_ca_system_score_gemma":0.002170869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001437055,"about_ca_topic_score_gemma":0.001305725,"domain_scores_codex":[0.9978751,0.0003241991,0.00008851531,0.0003047109,0.0008557825,0.0005517707],"domain_scores_gemma":[0.9870234,0.00966842,0.0007670596,0.001196683,0.0008752062,0.000469258],"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.0006816462,0.0002201778,0.001461181,0.0003974339,0.00006923788,0.0002878038,0.0003390373,0.2683681,0.03039703,0.6624506,0.00479019,0.0305377],"study_design_scores_gemma":[0.00005787721,0.0001464817,0.0003888156,0.0001095876,0.00004761372,0.0002103071,0.00005529855,0.6664684,0.02499558,0.3049166,0.002521509,0.00008181782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2820032,0.004297695,0.6255317,0.00418569,0.0003351298,0.0002026925,0.0007060813,0.002470857,0.08026685],"genre_scores_gemma":[0.9418336,0.0009963888,0.05078013,0.0004723407,0.0001431994,0.0002145688,0.000297984,0.0003029058,0.004959073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005785667,"threshold_uncertainty_score":0.02540803,"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)","authors":[{"name":"C.-H. F. Fung","is_ca":false},{"name":"Kiyoshi Tamaki","is_ca":false},{"name":"B. Qi","is_ca":true},{"name":"Hoi‐Kwong Lo","is_ca":true},{"name":"Xiongfeng Ma","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003886716,0.0008959566,0.001162092,0.0009884236,0.001334977,0.002073389,0.001341726,0.002242232,0.005423647],"category_scores_gemma":[0.01360766,0.000872139,0.001083616,0.0009813065,0.005243816,0.004856445,0.005821411,0.004055376,0.001002875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00163298,"about_ca_system_score_gemma":0.001980393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002483662,"about_ca_topic_score_gemma":0.00006893981,"domain_scores_codex":[0.9959603,0.0008488782,0.0002486484,0.0009167942,0.001476439,0.0005488683],"domain_scores_gemma":[0.9911053,0.005658274,0.0008460201,0.001294931,0.000862455,0.0002329322],"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.0002247394,0.0000619423,0.0004549452,0.000216318,0.00004835784,0.0003403592,0.0001645515,0.008892792,0.01599897,0.9635074,0.001818597,0.008271116],"study_design_scores_gemma":[0.0003225222,0.0001536704,0.0004453231,0.00007952617,0.00005824398,0.0008860078,0.00005236845,0.0784548,0.04380202,0.8689593,0.006684502,0.0001017767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09294292,0.001392673,0.8583643,0.005769614,0.0004833714,0.0002764193,0.000673325,0.0006415829,0.03945588],"genre_scores_gemma":[0.9393641,0.0006519427,0.05589473,0.001021919,0.000213069,0.0002676887,0.0001689461,0.0000835835,0.00233389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005423647,"threshold_uncertainty_score":0.02055514,"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","authors":[{"name":"Raymond Laflamme","is_ca":true},{"name":"David G. Cory","is_ca":false},{"name":"C. Negrevergne","is_ca":false},{"name":"Lorenza Viola","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245986,0.0002553385,0.0003992019,0.0004281244,0.001140056,0.001714327,0.0006727525,0.002192829,0.003656371],"category_scores_gemma":[0.00328534,0.0002083008,0.0002681511,0.0003552577,0.006277287,0.005837024,0.001477108,0.002268643,0.0005266713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008366454,"about_ca_system_score_gemma":0.0004205075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003056157,"about_ca_topic_score_gemma":0.0002813492,"domain_scores_codex":[0.9992918,0.0002465529,0.00002982416,0.0001101882,0.0002541454,0.00006758618],"domain_scores_gemma":[0.9987676,0.0007910993,0.00008354339,0.0001793086,0.000136693,0.00004170739],"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.000008781409,0.000005169926,0.00003322753,0.00004639752,0.000003223068,0.00004542899,0.0001327344,0.0004805015,0.0009863938,0.9890882,0.002485789,0.006684308],"study_design_scores_gemma":[0.000007037729,0.00001977005,0.0001063794,0.00004991861,0.000004528166,0.0001114885,0.00008636225,0.00247321,0.001440836,0.9439415,0.05174418,0.0000146811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0448342,0.100099,0.334738,0.1750452,0.01137313,0.00008160149,0.0002114883,0.0003759732,0.3332414],"genre_scores_gemma":[0.7962373,0.05322389,0.07048402,0.01948484,0.01585996,0.0001452002,0.00009752168,0.0001738583,0.04429345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003656371,"threshold_uncertainty_score":0.01223171,"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","authors":[{"name":"Cyril Branciard","is_ca":false},{"name":"Nicolas Gisin","is_ca":false},{"name":"Norbert Lütkenhaus","is_ca":true},{"name":"Valerio Scarani","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01148362,0.001097254,0.001414786,0.0021304,0.0009377871,0.003261305,0.001484351,0.001601722,0.0008991405],"category_scores_gemma":[0.04833355,0.0009540607,0.0007584206,0.001899273,0.009882473,0.00769984,0.002274494,0.003532741,0.0001885636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001538725,"about_ca_system_score_gemma":0.001648584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003648839,"about_ca_topic_score_gemma":0.0001959645,"domain_scores_codex":[0.9907109,0.005380797,0.0002597726,0.0006153326,0.002472756,0.0005604665],"domain_scores_gemma":[0.9306887,0.0601092,0.003797229,0.003227232,0.001530439,0.0006472419],"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.0002264607,0.0000909379,0.002216511,0.00008837284,0.00006197967,0.0002377245,0.0003120312,0.08622272,0.005461202,0.8954667,0.0004148261,0.009200494],"study_design_scores_gemma":[0.00003668785,0.0001446629,0.0007730423,0.00004570363,0.00002584938,0.0002032085,0.00005724336,0.5894883,0.004988462,0.4036786,0.0004757968,0.00008239585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3856095,0.00134976,0.6006785,0.001600109,0.00008783535,0.0001242902,0.0001169663,0.0002421484,0.01019093],"genre_scores_gemma":[0.963681,0.0009336454,0.03347669,0.0001772744,0.0001560102,0.0001005571,0.00006131524,0.0001162708,0.0012972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01148362,"threshold_uncertainty_score":0.06073195,"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","authors":[{"name":"Daniel A. Lidar","is_ca":true},{"name":"Sara Schneider","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639594,0.0002773511,0.0002662739,0.000162789,0.0003466252,0.0004103469,0.0005137018,0.000463506,0.0009542961],"category_scores_gemma":[0.00178267,0.0001020835,0.0001481735,0.0001945846,0.001073719,0.0006256838,0.0009935744,0.0004331374,0.0000960131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004586065,"about_ca_system_score_gemma":0.0004978082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001322474,"about_ca_topic_score_gemma":0.001089562,"domain_scores_codex":[0.9998379,0.00004209769,0.000006236738,0.00004028552,0.00003500535,0.00003850345],"domain_scores_gemma":[0.999263,0.0004304708,0.0001269982,0.0000657427,0.00006447647,0.00004938051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003962344,0.0001678535,0.001296557,0.0001570268,0.00004905319,0.0003018901,0.0003781317,0.6549336,0.1021215,0.1929292,0.0007683604,0.04650054],"study_design_scores_gemma":[0.00004706872,0.0001915059,0.0002293422,0.000005892099,0.000009899484,0.00002869709,0.00002264753,0.9593809,0.01188831,0.02761526,0.0005683706,0.00001202081],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3787644,0.0003764082,0.6133163,0.0004832269,0.00005660364,0.00005940967,0.0000396639,0.0002238916,0.00668009],"genre_scores_gemma":[0.9896469,0.00008448323,0.009188537,0.00003853377,0.00001068819,0.00002377955,0.00001160776,0.000008684635,0.0009867803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001322474,"threshold_uncertainty_score":0.003327489,"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","authors":[{"name":"D. M. Appleby","is_ca":false},{"name":"Christopher A. Fuchs","is_ca":false},{"name":"Huangjun Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033974,0.0004020068,0.0006297289,0.00184694,0.002276584,0.003128256,0.001351632,0.002602696,0.005214617],"category_scores_gemma":[0.007065638,0.000368703,0.0008519369,0.001175377,0.01022465,0.008615402,0.004182125,0.003329718,0.0004763764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001378321,"about_ca_system_score_gemma":0.001316063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005553119,"about_ca_topic_score_gemma":0.0004916279,"domain_scores_codex":[0.9975536,0.0009345449,0.0001819059,0.0003388319,0.0006914508,0.0002995434],"domain_scores_gemma":[0.9961979,0.001693666,0.0004945376,0.0006282751,0.0006929325,0.0002926751],"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.000002342525,0.000003723444,0.00004417613,0.0000130662,0.00000101522,0.0000138302,0.00005981814,0.0003860268,0.00004599899,0.9984702,0.0001549225,0.0008048869],"study_design_scores_gemma":[0.000003687189,0.000008457785,0.00007675185,0.0000106932,0.000002281716,0.00005830854,0.0001117573,0.004522309,0.0001434335,0.9936693,0.001386447,0.000006651507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1781012,0.001804814,0.59342,0.01212592,0.0003630221,0.0001326969,0.0002877037,0.0001651224,0.2135997],"genre_scores_gemma":[0.8943958,0.0008717361,0.09066965,0.0008773178,0.0004603278,0.0001781456,0.0002121318,0.0000447775,0.01229019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005214617,"threshold_uncertainty_score":0.0179674,"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","authors":[{"name":"Xiongfeng Ma","is_ca":true},{"name":"Norbert Lütkenhaus","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167361,0.0008600791,0.0007391192,0.0008820351,0.000690176,0.001820592,0.001686025,0.0009205539,0.002061861],"category_scores_gemma":[0.00571704,0.0005858626,0.0008532542,0.0007858209,0.002484418,0.003290846,0.002663298,0.002828019,0.0006938593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290583,"about_ca_system_score_gemma":0.0007250748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002330279,"about_ca_topic_score_gemma":0.0001688621,"domain_scores_codex":[0.9977181,0.0004741741,0.0001267472,0.0003252803,0.001082544,0.0002730736],"domain_scores_gemma":[0.9971523,0.001126502,0.0003525373,0.001045899,0.00025854,0.00006417598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001075488,0.000255509,0.002064632,0.0004973088,0.00005912379,0.0003998843,0.0005171178,0.1410016,0.4183072,0.3396157,0.001203285,0.09500311],"study_design_scores_gemma":[0.00008854145,0.000393167,0.0009560593,0.00006294061,0.00004350644,0.0002910325,0.00005952776,0.4661618,0.4593974,0.06765182,0.004790136,0.0001040925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08517315,0.0005291941,0.9078459,0.0003487687,0.00009054696,0.00009196111,0.00007537632,0.0005706329,0.005274546],"genre_scores_gemma":[0.8483096,0.0005243499,0.1482682,0.0001401144,0.00004194925,0.0001277314,0.00008006213,0.0002011725,0.0023068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002167361,"threshold_uncertainty_score":0.01146221,"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","authors":[{"name":"H-K Lo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020909,0.0003946522,0.0006184802,0.000542117,0.002169069,0.002932956,0.001093364,0.002008172,0.007584265],"category_scores_gemma":[0.009567358,0.0003684616,0.0006537218,0.0005275666,0.005562753,0.008952175,0.003454628,0.002950032,0.001157593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006939085,"about_ca_system_score_gemma":0.0005839215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004033162,"about_ca_topic_score_gemma":0.0001946394,"domain_scores_codex":[0.9988154,0.0004677706,0.00003315881,0.0001960502,0.0002906567,0.0001969852],"domain_scores_gemma":[0.9967799,0.001577228,0.0002773333,0.0008631235,0.0002628966,0.0002395809],"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.00008688644,0.00002940358,0.0001782758,0.00005428189,0.0000188345,0.00008179299,0.0001999365,0.001613069,0.001477493,0.9887378,0.00170378,0.005818467],"study_design_scores_gemma":[0.00001623675,0.00003327334,0.00007311593,0.00001728391,0.00000996629,0.00007122548,0.00008148111,0.01617561,0.001231878,0.9800309,0.002245239,0.00001375431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3310579,0.001935593,0.5267602,0.02844569,0.001140571,0.0001201762,0.0002180357,0.0005387037,0.1097832],"genre_scores_gemma":[0.9713284,0.0006365284,0.01479732,0.00144454,0.0003234326,0.000050492,0.00004612421,0.0001328999,0.01124037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007584265,"threshold_uncertainty_score":0.02537191,"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","authors":[{"name":"Gilles Brassard","is_ca":true},{"name":"Anne Broadbent","is_ca":true},{"name":"Alain Tapp","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003266825,0.001406934,0.001161189,0.0007439755,0.001614741,0.003173953,0.002536284,0.003242536,0.007973762],"category_scores_gemma":[0.01017214,0.0005249763,0.001235512,0.0006596674,0.005857872,0.008423127,0.003548567,0.00410751,0.0008782265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003541307,"about_ca_system_score_gemma":0.002544113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001560708,"about_ca_topic_score_gemma":0.001819009,"domain_scores_codex":[0.9963562,0.001808705,0.0001356501,0.0006232463,0.0005809774,0.0004952279],"domain_scores_gemma":[0.9953234,0.003350521,0.0003219653,0.0004265932,0.0002265102,0.00035102],"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.00009149026,0.00003389462,0.000129792,0.0000523106,0.00001638426,0.00007283979,0.0002146013,0.0101437,0.0008415631,0.9833332,0.001382751,0.003687588],"study_design_scores_gemma":[0.00004074124,0.00006679216,0.00009568302,0.00002287828,0.000009254968,0.00006405318,0.00005539594,0.09385207,0.0007323172,0.900941,0.004098117,0.00002181185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05742698,0.0004602518,0.8297941,0.008861803,0.0002336787,0.0003821233,0.0002545517,0.0002398857,0.1023467],"genre_scores_gemma":[0.8283582,0.0006784077,0.143679,0.001913998,0.0001901277,0.0007710491,0.0001437135,0.0001473146,0.02411824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007973762,"threshold_uncertainty_score":0.02667487,"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","authors":[{"name":"John Watrous","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954496,0.0008505568,0.001417255,0.0008642449,0.001975814,0.003311896,0.001585967,0.002075797,0.004576388],"category_scores_gemma":[0.01478865,0.000602996,0.001157825,0.0009519428,0.007126751,0.01345407,0.005131968,0.004511424,0.0008890185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008347983,"about_ca_system_score_gemma":0.001174433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002442207,"about_ca_topic_score_gemma":0.0003100977,"domain_scores_codex":[0.9954667,0.001094456,0.0005030599,0.001212932,0.001159808,0.0005630985],"domain_scores_gemma":[0.9815422,0.01101455,0.001175359,0.004648501,0.000849327,0.000769997],"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.0003522161,0.0000978708,0.0005647296,0.0001174173,0.00002511467,0.00009433484,0.0002964854,0.00559357,0.01712363,0.9559169,0.0005767407,0.01924092],"study_design_scores_gemma":[0.00004759336,0.0001219,0.0002840663,0.00001919582,0.00001958514,0.0001987959,0.00009693983,0.02803026,0.01352561,0.9555934,0.002022771,0.00003982829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3294162,0.0005186114,0.6423013,0.001227393,0.0002042952,0.0001719723,0.0002397699,0.0005544898,0.0253661],"genre_scores_gemma":[0.8638182,0.000261072,0.1319146,0.0003976212,0.0002166155,0.000160512,0.0002187189,0.000114521,0.002898145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004576388,"threshold_uncertainty_score":0.02091366,"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","authors":[{"name":"Ashwin Nayak","is_ca":true},{"name":"Pranab Kumar Sen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001368691,0.0004039803,0.0004203953,0.0006665048,0.0006545169,0.001826111,0.0007324853,0.0008738901,0.004868681],"category_scores_gemma":[0.006144888,0.0002813425,0.000465422,0.0005019321,0.004639822,0.004683111,0.002530869,0.00185973,0.0005248437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009573924,"about_ca_system_score_gemma":0.0008163545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004605109,"about_ca_topic_score_gemma":0.00032917,"domain_scores_codex":[0.9981964,0.0004394318,0.00009747597,0.0002761602,0.000671647,0.000318898],"domain_scores_gemma":[0.9954602,0.002801649,0.0003852822,0.0008767683,0.0003143943,0.0001617],"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.00003433773,0.00001978231,0.00009318077,0.00003159287,0.000003258628,0.00007192409,0.0001100632,0.005373817,0.00231647,0.9864292,0.0003028764,0.005213452],"study_design_scores_gemma":[0.00002089783,0.00005245334,0.000103252,0.00001456821,0.000004566023,0.0001316158,0.00004546051,0.04497974,0.006254319,0.9459402,0.002438959,0.00001400586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2491416,0.0008426237,0.6708373,0.002202266,0.0001277807,0.0001174244,0.0001761057,0.0003437221,0.07621114],"genre_scores_gemma":[0.9620589,0.0003617834,0.03160811,0.0001871579,0.00008904532,0.00006310225,0.00006646748,0.00004904838,0.005516496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004868681,"threshold_uncertainty_score":0.01628739,"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","authors":[{"name":"Dmitry Gavinsky","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006877466,0.0003919114,0.0009154227,0.0003686665,0.001251678,0.001278665,0.001426009,0.001141755,0.007569021],"category_scores_gemma":[0.003878169,0.0002302954,0.0009169442,0.0005478812,0.001909276,0.002668331,0.002412009,0.002070412,0.0006243527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001143792,"about_ca_system_score_gemma":0.001135432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001238504,"about_ca_topic_score_gemma":0.001825266,"domain_scores_codex":[0.9992162,0.000205428,0.00003589272,0.0001813582,0.000172032,0.0001890841],"domain_scores_gemma":[0.9980447,0.001042097,0.0001486783,0.0004801893,0.0001155984,0.0001686162],"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.0004297554,0.0001928194,0.0008754239,0.0001562244,0.00004724238,0.0002580078,0.0005422141,0.05449275,0.005521472,0.9010209,0.007704829,0.02875842],"study_design_scores_gemma":[0.00007106579,0.00003351703,0.0001496816,0.00001028075,0.000007593157,0.00003651378,0.0000853289,0.1937881,0.001494647,0.8025686,0.001741098,0.00001361656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5531182,0.0005483125,0.4061279,0.004617677,0.0002353589,0.0001817431,0.0004232112,0.0008605645,0.03388712],"genre_scores_gemma":[0.9050004,0.0002010665,0.08295983,0.0004408802,0.0001597416,0.0001509955,0.0004898688,0.0001784392,0.01041873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007569021,"threshold_uncertainty_score":0.02532089,"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","authors":[{"name":"Hoi‐Kwong Lo","is_ca":true},{"name":"Tsz-Mei Ko","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511793,0.001060296,0.0006973263,0.001586192,0.002787404,0.00290848,0.001381005,0.003571069,0.003503279],"category_scores_gemma":[0.009290247,0.0008026907,0.001911652,0.001750305,0.00490242,0.006386722,0.005169352,0.005223395,0.0009305988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001757231,"about_ca_system_score_gemma":0.0008184657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000623405,"about_ca_topic_score_gemma":0.0001994511,"domain_scores_codex":[0.9946277,0.001743208,0.0003041961,0.0004919945,0.002208723,0.0006242008],"domain_scores_gemma":[0.9963924,0.001598065,0.0003133113,0.001304636,0.0002827445,0.0001088758],"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.0001134121,0.0000432292,0.0003335036,0.0001230586,0.00003678322,0.0002939459,0.0005464471,0.01075194,0.005294366,0.9611273,0.003599753,0.01773619],"study_design_scores_gemma":[0.0001177749,0.0001128296,0.0003105668,0.0001106226,0.00005288507,0.000666389,0.0001399397,0.1804362,0.0187617,0.7530972,0.04612628,0.00006754769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1298293,0.004125833,0.7037126,0.01642593,0.0008467045,0.0009006355,0.0006415554,0.001454904,0.1420624],"genre_scores_gemma":[0.915105,0.003092151,0.06396123,0.001823017,0.0006305195,0.0008547316,0.0002457747,0.0001628904,0.01412458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003571069,"threshold_uncertainty_score":0.01328385,"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","authors":[{"name":"D. M. Appleby","is_ca":false},{"name":"Christopher A. Fuchs","is_ca":false},{"name":"Huangjun Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003465791,0.0003847576,0.0006411258,0.001782415,0.002263027,0.003008612,0.001358281,0.002658935,0.005218635],"category_scores_gemma":[0.007196159,0.0003646956,0.0008324407,0.001111831,0.01012487,0.008348622,0.004084908,0.003256289,0.0004702898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001356249,"about_ca_system_score_gemma":0.001284985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005042254,"about_ca_topic_score_gemma":0.0004493883,"domain_scores_codex":[0.997651,0.0009018158,0.0001716912,0.0003183471,0.0006708186,0.0002862599],"domain_scores_gemma":[0.9961948,0.001726474,0.0004853334,0.000660405,0.0006432496,0.0002896294],"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.00000233829,0.000003394633,0.00004014957,0.00001222116,9.695984e-7,0.0000123008,0.00005310206,0.0003619563,0.00004453665,0.9985803,0.0001487511,0.0007398604],"study_design_scores_gemma":[0.000003621029,0.000008041429,0.00007058553,0.00001013869,0.000002139771,0.00005360731,0.0000973603,0.0045093,0.0001416125,0.9938639,0.001233373,0.000006270082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1823748,0.00179158,0.5964681,0.01269713,0.0003688807,0.000127976,0.000281347,0.0001707767,0.2057195],"genre_scores_gemma":[0.8981349,0.0008401757,0.08763754,0.0008932948,0.0004373298,0.0001770837,0.0001945967,0.00004506064,0.01163994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005218635,"threshold_uncertainty_score":0.01832902,"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","authors":[{"name":"Alessandro Cosentino","is_ca":true},{"name":"Vincent M. Russo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485022,0.0005580928,0.001142887,0.0009695524,0.001397226,0.002968473,0.002419166,0.001752563,0.003524349],"category_scores_gemma":[0.01353861,0.0007388974,0.0008600516,0.000741626,0.006050469,0.005975949,0.005454546,0.003155656,0.0002847375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001377929,"about_ca_system_score_gemma":0.000569168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003061225,"about_ca_topic_score_gemma":0.0002359819,"domain_scores_codex":[0.9966851,0.001177983,0.000168443,0.0006399759,0.0009596344,0.0003688239],"domain_scores_gemma":[0.98427,0.01159741,0.001336784,0.001624503,0.0004713797,0.0007000579],"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.0004054759,0.0001398875,0.001354793,0.00013669,0.00008192737,0.0003905261,0.0004920028,0.02678449,0.01002634,0.9536437,0.0007897867,0.005754268],"study_design_scores_gemma":[0.0001389926,0.00013964,0.0008611168,0.00003861669,0.0000380077,0.0002069473,0.0002257396,0.208757,0.008804878,0.779197,0.001547427,0.00004467524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7413861,0.0003741138,0.2332312,0.001580253,0.00006716868,0.0001150001,0.0003961707,0.0002784617,0.02257155],"genre_scores_gemma":[0.9815001,0.00007763134,0.01602504,0.0001826519,0.00004261988,0.0001349485,0.0001985197,0.00003082565,0.001807689],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003524349,"threshold_uncertainty_score":0.01314223,"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","authors":[{"name":"Ben W. Reichardt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001408506,0.0004999254,0.0006417083,0.0009446203,0.0007808104,0.001614814,0.001071637,0.0007994898,0.002940024],"category_scores_gemma":[0.007010581,0.0005609639,0.0005653185,0.0006224521,0.004194334,0.004118053,0.003625171,0.002173273,0.0004008802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009143332,"about_ca_system_score_gemma":0.0005282369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000348578,"about_ca_topic_score_gemma":0.0003617571,"domain_scores_codex":[0.9986373,0.0003001412,0.00008572733,0.000329628,0.0004131309,0.0002341446],"domain_scores_gemma":[0.9958172,0.002285862,0.0003202502,0.001167883,0.000266246,0.0001424226],"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.0001588469,0.00005054234,0.0004658606,0.0001334078,0.00002267155,0.00007841943,0.0002029422,0.01924616,0.02340369,0.9265006,0.0007352867,0.02900152],"study_design_scores_gemma":[0.00003971669,0.0001013502,0.0002679076,0.00003145344,0.00002362571,0.0001044922,0.00003446877,0.1797244,0.05330242,0.7625878,0.003736561,0.00004592214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2942955,0.001290258,0.6657965,0.001858112,0.0001445884,0.000124307,0.0001647745,0.002212807,0.03411308],"genre_scores_gemma":[0.9545313,0.0002645958,0.0428934,0.0001581759,0.00004682864,0.0001006188,0.00006403934,0.0001288974,0.001812192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002940024,"threshold_uncertainty_score":0.009835362,"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","authors":[{"name":"M. Acton","is_ca":false},{"name":"Kathy-Anne Brickman","is_ca":false},{"name":"P. C. Haljan","is_ca":true},{"name":"P. J. Lee","is_ca":false},{"name":"Louis Deslauriers","is_ca":false},{"name":"C. Monroe","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006562537,0.000313225,0.0005816796,0.0003533832,0.0005103187,0.001347707,0.0008037362,0.000624489,0.002430231],"category_scores_gemma":[0.002493322,0.0004640221,0.0001314909,0.0003739204,0.001387679,0.001855601,0.002029056,0.0006561796,0.0004900498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004242197,"about_ca_system_score_gemma":0.0006764624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003584414,"about_ca_topic_score_gemma":0.0008581909,"domain_scores_codex":[0.9985771,0.0001739987,0.0000534143,0.0004250412,0.0006052504,0.0001652232],"domain_scores_gemma":[0.9987325,0.0003126474,0.0001796827,0.0005008573,0.0001616764,0.000112684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008426485,0.0001346102,0.003625052,0.0002171895,0.00009271623,0.0004444127,0.0002839926,0.01510629,0.7081174,0.1454236,0.002724142,0.1229881],"study_design_scores_gemma":[0.0001569289,0.000548019,0.002623303,0.00003470025,0.00006469496,0.0009618254,0.0001131543,0.179041,0.759411,0.04339032,0.01355244,0.000102665],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7207398,0.0006079575,0.247011,0.00072834,0.0001769164,0.00007017198,0.0003404598,0.001756803,0.02856858],"genre_scores_gemma":[0.9511423,0.00008875703,0.04686956,0.00006205133,0.00002480119,0.00002462678,0.00006722005,0.00002625412,0.001694438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002430231,"threshold_uncertainty_score":0.008129954,"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","authors":[{"name":"Ashley M. Stephens","is_ca":false},{"name":"Austin G. Fowler","is_ca":true},{"name":"Lloyd C. L. Hollenberg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553314,0.0001981952,0.0005665295,0.0003234204,0.0005741133,0.0007635684,0.0007841603,0.0005984317,0.002435879],"category_scores_gemma":[0.003400778,0.0001744467,0.0002649851,0.0003785708,0.001422862,0.001758124,0.001683546,0.0007971624,0.0003237965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006107987,"about_ca_system_score_gemma":0.0003680662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005189066,"about_ca_topic_score_gemma":0.0004944722,"domain_scores_codex":[0.9992499,0.000196482,0.00004038176,0.00009783312,0.0002485109,0.0001669278],"domain_scores_gemma":[0.9980102,0.0009712182,0.0002732445,0.0004209472,0.0002015519,0.0001228627],"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.0003518732,0.0001011059,0.0008283484,0.00008321533,0.00002006169,0.0002690438,0.0002225059,0.4012004,0.0231208,0.5500052,0.001019526,0.02277796],"study_design_scores_gemma":[0.00001766929,0.00005855018,0.0001240094,0.000006276322,0.000003480932,0.00004692102,0.00002136139,0.886502,0.008907256,0.1037444,0.000553676,0.00001435934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4978895,0.0001718208,0.4860601,0.0004328872,0.00007843506,0.00005706435,0.00008066111,0.0006270327,0.01460255],"genre_scores_gemma":[0.9766583,0.00004573847,0.02148889,0.00004832149,0.00001398676,0.00003048967,0.00002596524,0.00001995148,0.001668373],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002435879,"threshold_uncertainty_score":0.008148849,"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","authors":[{"name":"Phillip Kaye","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004290927,0.0004694951,0.0005711755,0.0004150342,0.0005736894,0.001201361,0.001405141,0.0006926239,0.008573164],"category_scores_gemma":[0.001533809,0.00030539,0.0003745286,0.0007476307,0.0005986459,0.001473108,0.0008346873,0.001060799,0.00156982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001248462,"about_ca_system_score_gemma":0.001858757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002605846,"about_ca_topic_score_gemma":0.004379805,"domain_scores_codex":[0.9989634,0.0001584487,0.00005791538,0.0001174413,0.0004698236,0.0002330787],"domain_scores_gemma":[0.9994546,0.0001296262,0.00005268161,0.000176407,0.0001532005,0.0000335291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001606534,0.000766815,0.002546836,0.0004806059,0.0001330092,0.000484132,0.0004019054,0.2885384,0.1218204,0.278865,0.02330082,0.2810556],"study_design_scores_gemma":[0.0003778996,0.0003419148,0.000922663,0.00004401943,0.00004837162,0.0001096685,0.00008978198,0.857399,0.0761843,0.04628237,0.0181319,0.00006816744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3774797,0.0008267448,0.5300117,0.00185974,0.0004489328,0.0002996406,0.0006279816,0.007897541,0.08054815],"genre_scores_gemma":[0.8137223,0.000228651,0.1745633,0.0002437669,0.00004457749,0.0001621125,0.0004113768,0.0002527222,0.01037115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008573164,"threshold_uncertainty_score":0.02868015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}