{"meta":{"query_hash":"df19c594e022","filters":{"venue":"Information Processing Letters"},"cohort_total":82,"direct_labels_cover":0,"predictions_cover":82,"exported":82,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/df19c594e022","api":"https://metacan.xera.ac/api/v1/cohort?venue=Information+Processing+Letters"},"results":[{"id":"W1482663448","doi":"10.1016/j.ipl.2005.06.011","title":"The state complexity of and","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unary operation; Alphabet; State (computer science); Mathematics; Computational complexity theory; Combinatorics; Time complexity; Discrete mathematics; Regular language; Algorithm; Computer science; Automaton; Theoretical computer science; Linguistics","score_opus":0.01051109242909641,"score_gpt":0.2119664226953609,"score_spread":0.2014553302662645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482663448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44940585,0.0010663146,0.4014953,0.013066884,0.00034993733,0.00019678043,0.002753061,0.0009056286,0.1307601],"genre_scores_gemma":[0.9772618,0.0002457304,0.010313906,0.00024452858,0.00015096205,0.000121280944,0.0006257269,0.00014408487,0.010892019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955782,0.001126692,0.00025507002,0.0010520802,0.0012540101,0.00073387794],"domain_scores_gemma":[0.96722066,0.023836663,0.0016376902,0.0044203214,0.0018662467,0.0010183041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023532384,0.00064062583,0.0013757063,0.001416873,0.002226319,0.00734341,0.0021948006,0.0027974013,0.018329252],"category_scores_gemma":[0.02635446,0.0008422706,0.0012834558,0.0015878046,0.0036912689,0.017268889,0.0034607206,0.003933174,0.0015366385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099222314,0.000033349104,0.00061185,0.00005283153,0.000018295232,0.000051030867,0.0003049185,0.008387187,0.00067335216,0.98191386,0.0013353967,0.006518736],"study_design_scores_gemma":[0.000014593658,0.000015457752,0.00038865514,0.000014977768,0.00001570934,0.00006437488,0.00008030095,0.05745262,0.0009530405,0.93944573,0.0015331283,0.000021299093],"about_ca_topic_score_codex":0.0015928047,"about_ca_topic_score_gemma":0.001109624,"teacher_disagreement_score":0.018329252,"about_ca_system_score_codex":0.0029222062,"about_ca_system_score_gemma":0.0026077838,"threshold_uncertainty_score":0.061317503},"labels":[],"label_agreement":null},{"id":"W1492505833","doi":"10.1016/j.ipl.2016.07.001","title":"Palindromic rich words and run-length encodings","year":2016,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Upper and lower bounds; Integer (computer science); Function (biology); Combinatorics; Binary number; Word (group theory); Word length; Mathematics; Order (exchange); Discrete mathematics; Computer science; Arithmetic; Natural language processing; Geometry","score_opus":0.0070363417484431085,"score_gpt":0.20831222670602956,"score_spread":0.20127588495758644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492505833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20494011,0.0023319025,0.749554,0.001507967,0.0003878758,0.00009674901,0.0007636806,0.0018953136,0.0385224],"genre_scores_gemma":[0.76861644,0.0015222399,0.20083152,0.0005803893,0.0005547353,0.00018483444,0.0012552673,0.000798959,0.02565568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992218,0.00025010182,0.000077472454,0.00012751484,0.0002181714,0.00010488204],"domain_scores_gemma":[0.99754673,0.0011746077,0.0002539979,0.00075032,0.00021287141,0.00006151822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005960768,0.0005270779,0.0004793313,0.0010423497,0.0005176883,0.0014110752,0.0007485806,0.00090348255,0.0053799143],"category_scores_gemma":[0.0042441534,0.000305681,0.0003931408,0.0013157198,0.0010116006,0.0024157637,0.0012807809,0.0012726597,0.0021780056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055460585,0.00007126434,0.00052951253,0.00019440298,0.000026050946,0.0006742512,0.0003658858,0.021284744,0.024999753,0.7939263,0.004508789,0.15286441],"study_design_scores_gemma":[0.000039817958,0.00013818471,0.0004019836,0.00009617672,0.000042854517,0.00095027545,0.00015203217,0.09530105,0.028164137,0.85997623,0.014676945,0.000060381208],"about_ca_topic_score_codex":0.000250906,"about_ca_topic_score_gemma":0.00033764483,"teacher_disagreement_score":0.0053799143,"about_ca_system_score_codex":0.00039770358,"about_ca_system_score_gemma":0.00037176037,"threshold_uncertainty_score":0.017997622},"labels":[],"label_agreement":null},{"id":"W1604003500","doi":"10.1016/j.ipl.2020.105959","title":"Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman–Sethi conjecture","year":2020,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Job shop scheduling; Conjecture; Scheduling (production processes); Computer science; Parallel computing; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Embedded system","score_opus":0.02114070675591026,"score_gpt":0.24629684263510437,"score_spread":0.2251561358791941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604003500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24681275,0.007684091,0.6674852,0.0142193325,0.0010389404,0.00020524528,0.0008833111,0.002511694,0.05915945],"genre_scores_gemma":[0.84107375,0.0012972329,0.146637,0.0015092337,0.0004609114,0.0003014808,0.0006807666,0.00055961177,0.0074801035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696904,0.0013684856,0.00008472549,0.0004609981,0.00055638206,0.00056043494],"domain_scores_gemma":[0.97764856,0.016855374,0.00063643703,0.00316224,0.0009991223,0.00069823314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005640413,0.0012101706,0.002013012,0.0016524855,0.001587488,0.0035115785,0.0036034693,0.0025961292,0.007962424],"category_scores_gemma":[0.033335064,0.00054815575,0.0010234743,0.0023981484,0.0022115442,0.0052114613,0.0019257875,0.004241271,0.0012488313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036883347,0.00068291713,0.004769574,0.00068395963,0.00020987946,0.00022128022,0.0004926997,0.4251682,0.008276404,0.35761032,0.045942783,0.15225369],"study_design_scores_gemma":[0.000107644264,0.0000933972,0.00051781273,0.00004260128,0.000043011678,0.0000804636,0.00006594416,0.8463331,0.0019582196,0.14886308,0.0018753613,0.00001930064],"about_ca_topic_score_codex":0.0037806705,"about_ca_topic_score_gemma":0.003377394,"teacher_disagreement_score":0.007962424,"about_ca_system_score_codex":0.0048670107,"about_ca_system_score_gemma":0.0040512066,"threshold_uncertainty_score":0.03531283},"labels":[],"label_agreement":null},{"id":"W1910560010","doi":"10.1016/j.ipl.2004.02.005","title":"Polynomial time quantum computation with advice","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; University of Ottawa","funders":"","keywords":"Advice (programming); Computation; Quantum computer; Bounded function; Polynomial; Computer science; Quantum algorithm; Quantum; State (computer science); Discrete mathematics; Mathematics; Algorithm; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.0036287721442083438,"score_gpt":0.19755343976412654,"score_spread":0.1939246676199182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1910560010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16201851,0.00096882903,0.6697317,0.01006013,0.0011612148,0.00022532417,0.0005514957,0.0066635627,0.14861923],"genre_scores_gemma":[0.8389003,0.00047561256,0.12312625,0.00094293954,0.0003947873,0.00010847119,0.00025314066,0.0005054229,0.03529293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989637,0.00019544957,0.00004098565,0.00013391393,0.00045494968,0.00021101882],"domain_scores_gemma":[0.9974681,0.0012370412,0.00007143962,0.0006250105,0.00045742883,0.00014095826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008471504,0.0004855037,0.0007978494,0.00060401467,0.0011724159,0.0013227906,0.00093699497,0.0011540728,0.008821818],"category_scores_gemma":[0.007155732,0.00027668182,0.0004880434,0.00095969526,0.0013149657,0.0019945598,0.0015979542,0.002179068,0.0018589303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005072412,0.0000919539,0.0007530198,0.0001803496,0.000027915767,0.00014110796,0.00030244855,0.011749128,0.0065237833,0.86199284,0.020525979,0.097204275],"study_design_scores_gemma":[0.000095276075,0.000027506161,0.00020343617,0.00001975395,0.000025014713,0.000057842222,0.000022493079,0.08861148,0.004501457,0.8975714,0.008849149,0.000015218068],"about_ca_topic_score_codex":0.0030040257,"about_ca_topic_score_gemma":0.0048822328,"teacher_disagreement_score":0.008821818,"about_ca_system_score_codex":0.00155247,"about_ca_system_score_gemma":0.0017322733,"threshold_uncertainty_score":0.029511929},"labels":[],"label_agreement":null},{"id":"W1964180408","doi":"10.1016/j.ipl.2007.08.014","title":"Improved FPT algorithm for feedback vertex set problem in bipartite tournament","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tournament; Bipartite graph; Vertex (graph theory); Feedback vertex set; Mathematics; Algorithm; Combinatorics; Set (abstract data type); Vertex cover; Feedback arc set; Approximation algorithm; Computer science; Graph","score_opus":0.01527569381448809,"score_gpt":0.25495503024486904,"score_spread":0.23967933643038095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964180408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09074248,0.0012991701,0.8804411,0.001917384,0.00067304453,0.0005620232,0.0012090511,0.0045203506,0.018635346],"genre_scores_gemma":[0.43848696,0.00031797437,0.54874736,0.00066916033,0.00039732398,0.00071431743,0.002360997,0.00044567185,0.007860194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790657,0.0004997966,0.00011150172,0.0005080615,0.0005101826,0.00046394987],"domain_scores_gemma":[0.9969132,0.0017507293,0.00013454714,0.000527698,0.00043455587,0.00023917665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014613166,0.0011424435,0.0025474217,0.001315277,0.0015133201,0.0025279846,0.0038265917,0.0026305965,0.011474123],"category_scores_gemma":[0.0061932807,0.00049202173,0.0014802135,0.002079001,0.0007496857,0.0029804332,0.001835942,0.0021776843,0.0012692998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001958509,0.001214207,0.002640978,0.00074244157,0.00020013764,0.00048470992,0.00029290185,0.31668982,0.009313174,0.050982744,0.06080863,0.55467176],"study_design_scores_gemma":[0.00033378735,0.00015502411,0.00039950278,0.000029390494,0.000052213894,0.00020463887,0.000059999897,0.95179003,0.0018098749,0.04254597,0.002599711,0.000019843406],"about_ca_topic_score_codex":0.0062958268,"about_ca_topic_score_gemma":0.005243391,"teacher_disagreement_score":0.011474123,"about_ca_system_score_codex":0.0019999307,"about_ca_system_score_gemma":0.0028076877,"threshold_uncertainty_score":0.038384795},"labels":[],"label_agreement":null},{"id":"W1970247635","doi":"10.1016/j.ipl.2010.12.014","title":"Using 5-isogenies to quintuple points on elliptic curves","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Elliptic curve; Supersingular elliptic curve; Computer science; Pure mathematics","score_opus":0.01480046710351335,"score_gpt":0.2552411734903963,"score_spread":0.24044070638688297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970247635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5283855,0.0020214568,0.3505675,0.002017019,0.0019636066,0.00017547476,0.00013449653,0.0011636802,0.11357129],"genre_scores_gemma":[0.9268255,0.0013026386,0.047593683,0.0003585917,0.0005213634,0.00006872162,0.00010603166,0.00036714572,0.022856178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909365,0.0002666229,0.00006776845,0.00014741134,0.00023027313,0.00019436746],"domain_scores_gemma":[0.99912757,0.00024751006,0.000096495976,0.00027799417,0.00013291185,0.00011750803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014970332,0.0012578999,0.0008595998,0.002954131,0.0013950599,0.0032063413,0.000903873,0.0011508595,0.008087191],"category_scores_gemma":[0.0031942239,0.0005120448,0.0011920506,0.001811572,0.002904627,0.005017273,0.004010425,0.002403716,0.00223578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023576307,0.00006592592,0.0005139006,0.00006716884,0.000020031606,0.0003809168,0.0006170361,0.00292228,0.0035581924,0.95051926,0.0015511279,0.03954828],"study_design_scores_gemma":[0.000058693895,0.00014185275,0.00037103787,0.000071288065,0.000030003333,0.00032628514,0.00030607282,0.010011036,0.0056308,0.9696518,0.013354096,0.000047111476],"about_ca_topic_score_codex":0.0003804372,"about_ca_topic_score_gemma":0.00034230243,"teacher_disagreement_score":0.008087191,"about_ca_system_score_codex":0.0010520814,"about_ca_system_score_gemma":0.00036720707,"threshold_uncertainty_score":0.02705431},"labels":[],"label_agreement":null},{"id":"W1970669897","doi":"10.1016/j.ipl.2011.07.018","title":"How many oblivious robots can explore a line","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Impossibility; Computer science; Line (geometry); Theoretical computer science; Mobile robot; Node (physics); Combinatorics; Distributed computing; Artificial intelligence; Mathematics; Computer network; Physics","score_opus":0.056753769306573394,"score_gpt":0.23498676798739124,"score_spread":0.17823299868081785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970669897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5203198,0.0021077853,0.41473484,0.009901595,0.00026126902,0.00014978442,0.00035749204,0.0013517481,0.050815668],"genre_scores_gemma":[0.9354521,0.00054134516,0.05211351,0.0002807441,0.00006851187,0.00010780558,0.00016494404,0.00019378301,0.011077215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993318,0.00024139296,0.000036222464,0.0001561825,0.000090472386,0.00014401425],"domain_scores_gemma":[0.99698716,0.0019079854,0.00023893402,0.000528541,0.00014810827,0.00018937721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009012806,0.0004624951,0.00062048377,0.00033867045,0.0010638736,0.0019135989,0.0011632905,0.0014188915,0.00669868],"category_scores_gemma":[0.007256211,0.00042165208,0.0004691824,0.0005636208,0.001558907,0.005637109,0.0016593831,0.0014256272,0.000852598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017073146,0.00025741747,0.004498696,0.0005630443,0.00025671217,0.00017798634,0.0007747339,0.49092066,0.0070528323,0.28957385,0.015322414,0.18889423],"study_design_scores_gemma":[0.00012712406,0.00025871847,0.00082270755,0.000063605905,0.0000911255,0.0001657827,0.000536617,0.557677,0.004709796,0.42755577,0.007959676,0.000032083928],"about_ca_topic_score_codex":0.00081961724,"about_ca_topic_score_gemma":0.0011751468,"teacher_disagreement_score":0.00669868,"about_ca_system_score_codex":0.0006964583,"about_ca_system_score_gemma":0.0007925191,"threshold_uncertainty_score":0.02240926},"labels":[],"label_agreement":null},{"id":"W1975841184","doi":"10.1016/j.ipl.2007.09.005","title":"A note on the Markoff condition and central words","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematics; Natural language processing; Theoretical computer science; Programming language","score_opus":0.005901160824610333,"score_gpt":0.22163953948542195,"score_spread":0.2157383786608116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975841184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08395252,0.012083898,0.6063264,0.03366526,0.012134141,0.00010562977,0.00061900157,0.0008737258,0.25023946],"genre_scores_gemma":[0.80880994,0.006219507,0.11776632,0.009212529,0.012324987,0.0003175847,0.0004907477,0.0008426387,0.044015817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736553,0.0008813759,0.00021532882,0.0006729488,0.00054701406,0.0003178159],"domain_scores_gemma":[0.9816996,0.0141359465,0.000511951,0.0018260704,0.0012417509,0.0005846862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048089335,0.0008230229,0.0019568615,0.002138774,0.0034296205,0.004312253,0.002332032,0.0048102182,0.013414907],"category_scores_gemma":[0.018329225,0.00087763503,0.0016948091,0.0024215209,0.009492171,0.021157173,0.005314274,0.0075414395,0.0023545823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003907841,0.0000066078032,0.00005308737,0.000036384532,0.00000360052,0.000053457275,0.00008934293,0.00018500813,0.000387631,0.99429166,0.0017280511,0.0031260434],"study_design_scores_gemma":[0.000007654792,0.000010589798,0.00004169563,0.000009375145,0.000004720845,0.000044823075,0.000021214297,0.00066382205,0.0003221588,0.99501944,0.0038423324,0.0000121611365],"about_ca_topic_score_codex":0.00089103205,"about_ca_topic_score_gemma":0.00074044673,"teacher_disagreement_score":0.013414907,"about_ca_system_score_codex":0.0015504477,"about_ca_system_score_gemma":0.001483192,"threshold_uncertainty_score":0.04487735},"labels":[],"label_agreement":null},{"id":"W1979429135","doi":"10.1016/j.ipl.2014.03.005","title":"Integral distinguishers for reduced-round Stribog","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; GOST (hash function); Permutation (music); Mathematics; Cryptographic hash function; Function (biology); Cryptography; Computer science; Algorithm; Statistics; Computer security","score_opus":0.012487966435994436,"score_gpt":0.2607166727354172,"score_spread":0.24822870629942279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979429135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19960257,0.0007660371,0.7412628,0.0015232404,0.00045169514,0.0002144344,0.0003832767,0.0028951708,0.052900888],"genre_scores_gemma":[0.9022019,0.0002503703,0.07940837,0.0005060355,0.00016704889,0.00017528159,0.00030360275,0.00033821998,0.016649194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976071,0.0003738617,0.00014021793,0.0004969003,0.0007854213,0.0005965012],"domain_scores_gemma":[0.9967781,0.0013378402,0.00023311906,0.001160584,0.0002611248,0.00022921353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020733539,0.000637183,0.001248644,0.0010460075,0.0015415824,0.0032645152,0.0016437249,0.0017691794,0.011251015],"category_scores_gemma":[0.005612335,0.00052557234,0.00065291487,0.00088726665,0.0026012484,0.005091116,0.005357957,0.0037255508,0.0029665963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074261636,0.00011156537,0.00034802177,0.0000949929,0.000025138708,0.000115896386,0.00031562487,0.008120398,0.0085916305,0.92786217,0.0036169526,0.050054975],"study_design_scores_gemma":[0.00009501555,0.00014939636,0.00025208655,0.000052440704,0.00003389364,0.00015973566,0.00006985059,0.07575731,0.014913288,0.9000751,0.008380689,0.00006127824],"about_ca_topic_score_codex":0.00030462028,"about_ca_topic_score_gemma":0.0004637542,"teacher_disagreement_score":0.011251015,"about_ca_system_score_codex":0.001267347,"about_ca_system_score_gemma":0.0015560988,"threshold_uncertainty_score":0.037638366},"labels":[],"label_agreement":null},{"id":"W1981011717","doi":"10.1016/s0020-0190(00)00103-4","title":"Computing the cycles in the perfect shuffle permutation","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Permutation (music); Computer science; Combinatorics; Theoretical computer science; Mathematics; Parallel computing; Algorithm","score_opus":0.007141469881151602,"score_gpt":0.2216170375375544,"score_spread":0.2144755676564028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981011717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77669156,0.00079169724,0.18800457,0.0018343707,0.00024306688,0.000107087784,0.0005242822,0.0007379141,0.03106554],"genre_scores_gemma":[0.94572115,0.00035732804,0.04532021,0.00020510281,0.00007341544,0.000041986128,0.0003344508,0.00010634811,0.007839936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996146,0.0001115644,0.000022207796,0.00008001912,0.00007916867,0.000092538045],"domain_scores_gemma":[0.998976,0.00047144305,0.00010291054,0.0002165126,0.00011943297,0.00011368086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004924529,0.0003999241,0.00054103584,0.00082967815,0.0010022159,0.0023721275,0.00056846236,0.00093204214,0.003985829],"category_scores_gemma":[0.0033022827,0.00032625752,0.00037500414,0.000856644,0.0015462781,0.003162249,0.0011209063,0.0008228712,0.0007443946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010759581,0.00014174164,0.003670296,0.00019565101,0.000044283493,0.0002717107,0.000457077,0.09259355,0.011433761,0.71779,0.009132104,0.16319387],"study_design_scores_gemma":[0.000042292522,0.00008343175,0.00035950873,0.000026615497,0.000012304234,0.00006571618,0.00010082868,0.1138485,0.0063116057,0.874741,0.004383461,0.000024722707],"about_ca_topic_score_codex":0.0022746096,"about_ca_topic_score_gemma":0.0038454344,"teacher_disagreement_score":0.003985829,"about_ca_system_score_codex":0.0008444565,"about_ca_system_score_gemma":0.0014478886,"threshold_uncertainty_score":0.013333917},"labels":[],"label_agreement":null},{"id":"W1982107102","doi":"10.1016/j.ipl.2006.01.013","title":"On the structure of certain intersection graphs","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Intersection (aeronautics); Computer science; Data structure; Combinatorics; Mathematics; Discrete mathematics; Programming language; Engineering","score_opus":0.007812606576568194,"score_gpt":0.2381557933190754,"score_spread":0.23034318674250723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982107102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8013448,0.00060817885,0.12875575,0.0023589313,0.000059031914,0.000097593926,0.0013155162,0.00042167152,0.06503855],"genre_scores_gemma":[0.9481629,0.0007624731,0.03941347,0.00034352037,0.00016566447,0.00012162186,0.0029055548,0.00021936138,0.007905276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990584,0.00022659932,0.0000467636,0.0002020911,0.0002565959,0.00020943725],"domain_scores_gemma":[0.9884312,0.0068674474,0.0016591091,0.0007598614,0.0012909712,0.00099141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010794464,0.00055714016,0.0009468204,0.0044901683,0.003653799,0.0039888364,0.0018274714,0.0014307281,0.008869736],"category_scores_gemma":[0.00727136,0.00090175733,0.0008154293,0.004431217,0.003134052,0.0075261616,0.0022085612,0.0031956849,0.00080073724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013255139,0.000060276463,0.0016247081,0.000055378132,0.000018433087,0.00014896758,0.00071078225,0.0021953473,0.0012777338,0.98288584,0.002163809,0.008726223],"study_design_scores_gemma":[0.000019102547,0.000021149272,0.00080024474,0.000024340805,0.00002133691,0.0001948259,0.0003673731,0.013016878,0.000915811,0.9820672,0.002537183,0.000014438733],"about_ca_topic_score_codex":0.0011308113,"about_ca_topic_score_gemma":0.0011746332,"teacher_disagreement_score":0.008869736,"about_ca_system_score_codex":0.0013578559,"about_ca_system_score_gemma":0.0008247089,"threshold_uncertainty_score":0.029672205},"labels":[],"label_agreement":null},{"id":"W1982630460","doi":"10.1016/j.ipl.2009.03.009","title":"Honeycomb toroidal graphs are Cayley graphs","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cayley graph; Toroid; Combinatorics; Chordal graph; Mathematics; Discrete mathematics; Computer science; Physics; Graph; Quantum mechanics","score_opus":0.007792930118177193,"score_gpt":0.20873459803438688,"score_spread":0.20094166791620968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982630460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53813094,0.0018822949,0.2560414,0.0014874721,0.0014325031,0.00032228077,0.0012846644,0.0014298989,0.19798861],"genre_scores_gemma":[0.9394472,0.0009939979,0.027804818,0.00050820643,0.00014530985,0.00012900801,0.0005916128,0.00011561051,0.030264236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999031,0.000019781233,0.0000046172822,0.000022082275,0.000027764632,0.000022653723],"domain_scores_gemma":[0.9996376,0.00007788793,0.00007569213,0.000052652078,0.000095842355,0.000060329356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077891156,0.00032781172,0.0003290642,0.0007097705,0.0006855195,0.0012759981,0.00033563096,0.00059641205,0.008474771],"category_scores_gemma":[0.00052708614,0.00025919036,0.00027950923,0.000694238,0.0005856027,0.0010142052,0.00043710478,0.0006951165,0.0012051482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014152756,0.000035099652,0.0006918647,0.00017523185,0.00003603713,0.0005449512,0.00027106167,0.008787936,0.014205913,0.9137464,0.014007142,0.04735685],"study_design_scores_gemma":[0.00004188655,0.00009405618,0.0014900084,0.000036712994,0.000029610941,0.0007585206,0.00040629753,0.04143811,0.0064794812,0.91465276,0.0345298,0.000042712607],"about_ca_topic_score_codex":0.00076467555,"about_ca_topic_score_gemma":0.001464974,"teacher_disagreement_score":0.008474771,"about_ca_system_score_codex":0.00029718594,"about_ca_system_score_gemma":0.00025459513,"threshold_uncertainty_score":0.02835095},"labels":[],"label_agreement":null},{"id":"W1994599362","doi":"10.1016/j.ipl.2013.07.016","title":"P2P-FISM: Mining (recently) frequent item sets from distributed data streams over P2P network","year":2013,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Asynchronous communication; Distributed computing; Data stream mining; Overhead (engineering); File sharing; Data stream; Distributed database; Computer network; Network topology; Peer-to-peer; Data mining; Database; The Internet; World Wide Web","score_opus":0.020568116366212537,"score_gpt":0.24554403671266442,"score_spread":0.2249759203464519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994599362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061055183,0.0011156925,0.91288996,0.0007149157,0.00029083266,0.0005445084,0.0041342205,0.017363442,0.0018912298],"genre_scores_gemma":[0.32871443,0.00048376885,0.6625767,0.00020008707,0.00021203843,0.00040395313,0.0051271995,0.00024620804,0.0020357943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927825,0.00010785222,0.00007221284,0.00020453974,0.0002742819,0.00006285141],"domain_scores_gemma":[0.99778193,0.001158216,0.0001391336,0.00047885897,0.00035064018,0.000091222115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013997143,0.0013615335,0.0012918672,0.0031573556,0.0009910502,0.0013609119,0.0023860876,0.0011875271,0.002355558],"category_scores_gemma":[0.0064263274,0.0004957913,0.0007356107,0.0039450787,0.00047368472,0.0021649841,0.0012837761,0.001021637,0.0011547557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016508913,0.0003981417,0.017991472,0.0006668127,0.00043148396,0.0015839619,0.0002620409,0.07076203,0.014516106,0.0059314654,0.028794982,0.85701054],"study_design_scores_gemma":[0.000072464856,0.00010472164,0.0018855127,0.000017981816,0.00005278053,0.00055821164,0.000093554605,0.97247654,0.006790015,0.013640796,0.0042889444,0.000018531173],"about_ca_topic_score_codex":0.003929589,"about_ca_topic_score_gemma":0.0045103896,"teacher_disagreement_score":0.003929589,"about_ca_system_score_codex":0.00042984827,"about_ca_system_score_gemma":0.0010535512,"threshold_uncertainty_score":0.007880092},"labels":[],"label_agreement":null},{"id":"W2000986355","doi":"10.1016/s0020-0190(01)00231-9","title":"On enumeration of catastrophic fault patterns","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Enumeration; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.009894622370969868,"score_gpt":0.20068764577932288,"score_spread":0.19079302340835302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000986355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26990053,0.0009058736,0.6850488,0.0018917704,0.00028238594,0.00013001564,0.0013233068,0.0010791095,0.03943821],"genre_scores_gemma":[0.83276695,0.00095783395,0.15002622,0.0006031073,0.00020776833,0.00023381397,0.0025716804,0.00029076744,0.0123418635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991685,0.00024160893,0.000070124435,0.00013093774,0.0002522529,0.00013647092],"domain_scores_gemma":[0.99058867,0.006865363,0.0005591535,0.0009123553,0.00081283966,0.00026170284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070358947,0.0006856697,0.0008861219,0.0016312537,0.00080994726,0.0016662095,0.0012118373,0.0011404244,0.0061295484],"category_scores_gemma":[0.01293974,0.0005069712,0.00072028633,0.002039174,0.001082326,0.0027354741,0.0019382816,0.0013427384,0.00065224903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044966882,0.00014210398,0.0054027783,0.00051227707,0.00007770165,0.00045826557,0.00041272445,0.13796519,0.006250289,0.6426857,0.017517474,0.18812586],"study_design_scores_gemma":[0.000023482016,0.000043553406,0.0005071412,0.000050736056,0.000018509048,0.0002305637,0.00007361777,0.21359,0.0015561476,0.7816882,0.0022022813,0.000015809797],"about_ca_topic_score_codex":0.00077133405,"about_ca_topic_score_gemma":0.0014251054,"teacher_disagreement_score":0.0061295484,"about_ca_system_score_codex":0.0005968477,"about_ca_system_score_gemma":0.00065516785,"threshold_uncertainty_score":0.020505428},"labels":[],"label_agreement":null},{"id":"W2002707982","doi":"10.1016/j.ipl.2004.09.003","title":"Optimal preemptive semi-online scheduling on two uniform processors","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Job shop scheduling; Scheduling (production processes); Computer science; Online algorithm; Preemption; Parallel computing; Upper and lower bounds; Fair-share scheduling; Mathematical optimization; Algorithm; Mathematics; Schedule","score_opus":0.009031892342331585,"score_gpt":0.23094668956496697,"score_spread":0.22191479722263538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002707982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3562916,0.00036900298,0.63298506,0.00046964566,0.00024839173,0.00014080183,0.0001949638,0.0009651316,0.0083354805],"genre_scores_gemma":[0.8991991,0.00007407607,0.097716525,0.00007779559,0.000051551775,0.00010960551,0.00008935536,0.0000841702,0.0025977357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898607,0.00041934077,0.00005352155,0.00014283646,0.0001369257,0.000261293],"domain_scores_gemma":[0.9969926,0.0016130635,0.00022316146,0.0004946617,0.00035991863,0.00031656894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014212204,0.00071482663,0.0016750338,0.00043060078,0.00075978745,0.0010811656,0.001553693,0.00086738996,0.0037316654],"category_scores_gemma":[0.0038679026,0.0006944107,0.00039366938,0.0010326515,0.0006248147,0.0013904519,0.0013414576,0.0007488806,0.00036063438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005219787,0.0006205559,0.0011283297,0.00035931173,0.00007739414,0.00035187375,0.00015778348,0.8507627,0.020493286,0.030958202,0.004393402,0.08547744],"study_design_scores_gemma":[0.00009649815,0.00011032181,0.0002545736,0.0000038208436,0.000010647935,0.00002163836,0.000020710791,0.9909293,0.0017406647,0.006553275,0.0002523837,0.000006197596],"about_ca_topic_score_codex":0.0015388371,"about_ca_topic_score_gemma":0.0022289357,"teacher_disagreement_score":0.0037316654,"about_ca_system_score_codex":0.00081974384,"about_ca_system_score_gemma":0.0013462866,"threshold_uncertainty_score":0.012483656},"labels":[],"label_agreement":null},{"id":"W2003833943","doi":"10.1016/j.ipl.2007.08.023","title":"Feedback arc set problem in bipartite tournaments","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipartite; Bipartite graph; Arc (geometry); Feedback arc set; Set (abstract data type); Mathematics; Tournament; Combinatorics; Discrete mathematics; Computer science; Quantum entanglement","score_opus":0.01714777052366188,"score_gpt":0.2536164302606104,"score_spread":0.23646865973694856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003833943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4042649,0.0016768943,0.55366844,0.0051010796,0.0003629872,0.00054210704,0.0024075303,0.0010985663,0.030877527],"genre_scores_gemma":[0.8857975,0.00078577234,0.09741978,0.00051223085,0.0003266185,0.00049668545,0.0017332033,0.00023539853,0.012692751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996329,0.0017069546,0.00019676468,0.0006531271,0.00059923285,0.00051489135],"domain_scores_gemma":[0.9789108,0.016565247,0.0011545783,0.00094388716,0.0009041799,0.0015212871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035172328,0.0012044813,0.0033975535,0.0015395618,0.0021116724,0.0063283793,0.004750657,0.003750709,0.015016963],"category_scores_gemma":[0.023773927,0.0010077563,0.0015121455,0.0029517233,0.0019471516,0.008423434,0.002669293,0.0030256968,0.0009576912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025850004,0.0011199901,0.003070467,0.0012433155,0.00031800187,0.0004926744,0.00080743065,0.3686424,0.0037353109,0.5029051,0.024296427,0.09078393],"study_design_scores_gemma":[0.00032898,0.0001560486,0.0005233515,0.000071501854,0.00008555015,0.00016456602,0.00024746615,0.58226144,0.0013841273,0.41246152,0.0022723663,0.000043048054],"about_ca_topic_score_codex":0.0026652503,"about_ca_topic_score_gemma":0.0024554562,"teacher_disagreement_score":0.015016963,"about_ca_system_score_codex":0.0023370886,"about_ca_system_score_gemma":0.0017651485,"threshold_uncertainty_score":0.05023676},"labels":[],"label_agreement":null},{"id":"W2016325519","doi":"10.1016/j.ipl.2003.09.002","title":"A new differential LSI space-based probabilistic document classifier","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Classifier (UML); Probabilistic logic; Probabilistic classification; Computer science; Search engine indexing; Artificial intelligence; Pattern recognition (psychology); Data mining; A priori and a posteriori; Document classification; Adaptability; Machine learning; Support vector machine; Naive Bayes classifier","score_opus":0.011591561788639012,"score_gpt":0.22220464448286778,"score_spread":0.21061308269422876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016325519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018249035,0.0011100746,0.9736264,0.00031258984,0.0002875182,0.00010066249,0.00037248732,0.003134225,0.0028069867],"genre_scores_gemma":[0.28736907,0.000986522,0.6909477,0.0005192067,0.0005526026,0.00031520703,0.0023708227,0.0002674306,0.016671421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809915,0.00019440429,0.00011486449,0.00033034928,0.0011296625,0.0001316619],"domain_scores_gemma":[0.9988662,0.00023932317,0.0000702782,0.00017794114,0.0005756838,0.00007062799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011883236,0.00064792414,0.0015527679,0.0025763346,0.0008110926,0.0017573645,0.0018934205,0.0011861557,0.0036807503],"category_scores_gemma":[0.0022251648,0.0003160977,0.00088050973,0.0023270617,0.0005291114,0.0027728858,0.0015321027,0.0010873916,0.0036413874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031151852,0.00018372182,0.0016054139,0.00012924644,0.00006462381,0.00008552875,0.000045432986,0.007016772,0.035139278,0.00658657,0.007404163,0.94142765],"study_design_scores_gemma":[0.000043706554,0.00021393535,0.002131874,0.000017610526,0.00009017247,0.0007700149,0.00003328452,0.9458182,0.03148755,0.005711124,0.013623722,0.000058874877],"about_ca_topic_score_codex":0.0018745225,"about_ca_topic_score_gemma":0.0025665078,"teacher_disagreement_score":0.0036807503,"about_ca_system_score_codex":0.0007419487,"about_ca_system_score_gemma":0.0013844412,"threshold_uncertainty_score":0.012313306},"labels":[],"label_agreement":null},{"id":"W2018207776","doi":"10.1016/j.ipl.2007.01.007","title":"Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada; Tsinghua University; National Science Foundation","keywords":"Quicksort; Binary tree; Computer science; Tree (set theory); Mathematics; Parallel computing; Algorithm; Combinatorics; Sorting; Sorting algorithm","score_opus":0.017267737570640127,"score_gpt":0.26163612009311654,"score_spread":0.24436838252247642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018207776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4584079,0.0043546027,0.5081939,0.0025752317,0.0002321843,0.000099428464,0.00080152,0.0020277246,0.023307547],"genre_scores_gemma":[0.9658373,0.0005952583,0.029237552,0.00015172061,0.00033117848,0.000051151797,0.00030251098,0.00041093727,0.0030823925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930864,0.0015449293,0.00033365842,0.0010361501,0.002396597,0.0016023288],"domain_scores_gemma":[0.87536484,0.10227923,0.005764809,0.008488218,0.0051779626,0.0029249827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0100222435,0.00124894,0.0025209745,0.0062225685,0.0019826142,0.0047467067,0.0066827782,0.0027166954,0.010596308],"category_scores_gemma":[0.083246335,0.0012165844,0.0014290669,0.0073060663,0.0047840704,0.019040298,0.0029970803,0.0033670892,0.000737599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007466107,0.00028892324,0.006557367,0.00031046255,0.000118941374,0.00057678286,0.00034861598,0.51552415,0.0035652397,0.42984483,0.004674954,0.03744325],"study_design_scores_gemma":[0.000015376001,0.00004304836,0.0006576087,0.000015631205,0.000038968843,0.00020114948,0.00004882202,0.90719163,0.0011550772,0.0902165,0.0003920824,0.00002404781],"about_ca_topic_score_codex":0.0042565954,"about_ca_topic_score_gemma":0.004287078,"teacher_disagreement_score":0.010596308,"about_ca_system_score_codex":0.0042403387,"about_ca_system_score_gemma":0.0029885352,"threshold_uncertainty_score":0.05300331},"labels":[],"label_agreement":null},{"id":"W2021931635","doi":"10.1016/j.ipl.2010.10.002","title":"Developing fault-tolerant distributed loops","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Circulant matrix; Computer science; Fault tolerance; Loop (graph theory); Distributed computing; Node (physics); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Engineering","score_opus":0.010280794861545104,"score_gpt":0.2269768062843992,"score_spread":0.2166960114228541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021931635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09267981,0.000116877476,0.90232426,0.00015214577,0.0000606168,0.000087843095,0.000021479464,0.0009292373,0.003627788],"genre_scores_gemma":[0.8483037,0.00010945372,0.14783627,0.00010288474,0.000030828647,0.0001084461,0.00006584755,0.00011055842,0.0033320733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975103,0.000052681058,0.00001477717,0.000057833113,0.0000772686,0.000046474735],"domain_scores_gemma":[0.9987172,0.00062961446,0.00014642619,0.0001850404,0.00025534502,0.00006632111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535,0.00040131746,0.00046117266,0.00033967756,0.00034606666,0.0005049259,0.0010564327,0.00066076696,0.0021185684],"category_scores_gemma":[0.002754756,0.0002842037,0.00024166674,0.00024431993,0.0005132684,0.0008155762,0.0010706976,0.0006000615,0.00029142536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019597163,0.00016227727,0.0010035139,0.00019274358,0.00003422315,0.00022840589,0.00031545333,0.75873107,0.04599388,0.0438986,0.0014605324,0.14778326],"study_design_scores_gemma":[0.000034581815,0.0001632784,0.00006492034,0.000008328893,0.000012470116,0.00003343248,0.000029712783,0.9701376,0.011324762,0.016649181,0.0015370728,0.0000047586805],"about_ca_topic_score_codex":0.0005149969,"about_ca_topic_score_gemma":0.0006801981,"teacher_disagreement_score":0.0021185684,"about_ca_system_score_codex":0.00045173182,"about_ca_system_score_gemma":0.00047808234,"threshold_uncertainty_score":0.0070872903},"labels":[],"label_agreement":null},{"id":"W2025673372","doi":"10.1016/j.ipl.2014.09.021","title":"A simple algorithm for computing positively weighted straight skeletons of monotone polygons","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Monotone polygon; Polygon (computer graphics); Combinatorics; Simple (philosophy); Rectilinear polygon; Simple polygon; Algorithm; Mathematics; SIMPLE algorithm; Polygon covering; Computational geometry; Computer science; Geometry","score_opus":0.0069810991131492636,"score_gpt":0.2381842154663723,"score_spread":0.23120311635322305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025673372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016975071,0.00004941028,0.98005795,0.000031847507,0.000016201555,0.00008120952,0.00009573803,0.0008794356,0.0018131926],"genre_scores_gemma":[0.098278955,0.000097852855,0.8989304,0.000021804064,0.0000138214655,0.00011165878,0.00047977478,0.00021145107,0.0018542266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967897,0.0000362998,0.000029423256,0.00006804863,0.00014731551,0.00004001784],"domain_scores_gemma":[0.99934,0.00017656134,0.00006461101,0.0001390295,0.00022930857,0.000050471077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035602122,0.00066739495,0.00056650356,0.0013615945,0.00054151326,0.0007979806,0.0009291667,0.0005455345,0.007430866],"category_scores_gemma":[0.0022110338,0.00042679618,0.0006326552,0.0013325715,0.0006678963,0.001441945,0.0015631864,0.0007192646,0.0014895791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026771662,0.000106784624,0.0019812905,0.00035497214,0.000061525105,0.00028732434,0.00034061438,0.069922216,0.067540884,0.07483404,0.005305071,0.7789975],"study_design_scores_gemma":[0.00012256234,0.00037720837,0.0015229154,0.00007812537,0.00005277175,0.0006318582,0.000257672,0.7804042,0.038786564,0.1567693,0.020920902,0.000075914984],"about_ca_topic_score_codex":0.0008765311,"about_ca_topic_score_gemma":0.0019510569,"teacher_disagreement_score":0.007430866,"about_ca_system_score_codex":0.00029493545,"about_ca_system_score_gemma":0.00055977365,"threshold_uncertainty_score":0.024858654},"labels":[],"label_agreement":null},{"id":"W2026266551","doi":"10.1016/j.ipl.2011.12.001","title":"Optimal strategies for the list update problem under the MRM alternative cost model","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Combinatorics; Paging; Mathematics; Algorithm; Discrete mathematics","score_opus":0.05248951916879621,"score_gpt":0.2750355865265959,"score_spread":0.22254606735779967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026266551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063073166,0.0016617266,0.91492045,0.002551363,0.00013549154,0.00025900314,0.000505153,0.0003649001,0.016528709],"genre_scores_gemma":[0.68875694,0.0012538141,0.2843759,0.0005928006,0.00024247733,0.00057119475,0.0005916341,0.00027602343,0.023339195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987993,0.0006207789,0.00005627318,0.00014138619,0.0001997043,0.00018252188],"domain_scores_gemma":[0.9959979,0.0030120288,0.00031776505,0.00019743656,0.0003202619,0.00015469627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022712066,0.0009441395,0.001826575,0.0013420896,0.00048506106,0.002117484,0.0025516625,0.002599354,0.009780407],"category_scores_gemma":[0.009082046,0.0007317359,0.0006356952,0.0017606339,0.00092218677,0.0032879736,0.001267283,0.0016862346,0.00130784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000630354,0.00027128024,0.0006474192,0.00044415746,0.00010545511,0.00017050061,0.00019935629,0.6783806,0.0012182252,0.1838318,0.008508481,0.1255923],"study_design_scores_gemma":[0.000085193155,0.00008570867,0.0001898178,0.000032901036,0.000028325512,0.000044556375,0.000043882625,0.9352125,0.00031819634,0.06253155,0.0014021832,0.000025143307],"about_ca_topic_score_codex":0.0041652,"about_ca_topic_score_gemma":0.0047957953,"teacher_disagreement_score":0.009780407,"about_ca_system_score_codex":0.0016234647,"about_ca_system_score_gemma":0.001854305,"threshold_uncertainty_score":0.032718718},"labels":[],"label_agreement":null},{"id":"W2027107615","doi":"10.1016/j.ipl.2014.05.005","title":"Parallelization of entanglement-resistant multi-prover interactive proofs","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada Foundation for Innovation; Ontario Research Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Gas meter prover; Soundness; Mathematical proof; Quantum entanglement; Computer science; Theoretical computer science; Proof assistant; Programming language; Mathematics; Quantum; Quantum mechanics; Physics","score_opus":0.007859988746605873,"score_gpt":0.24204528478848944,"score_spread":0.23418529604188357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027107615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098284036,0.0007180235,0.8569111,0.0015078973,0.00066241046,0.00052654353,0.0007168364,0.012529642,0.028143523],"genre_scores_gemma":[0.79814017,0.000212988,0.18963596,0.00036887146,0.0003254891,0.00031596445,0.00068504136,0.0012802542,0.009035224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873045,0.0032624668,0.0006960364,0.0018205856,0.004674266,0.0022420457],"domain_scores_gemma":[0.97209215,0.0128410105,0.0009246607,0.010693226,0.002636893,0.00081207923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00439193,0.0016209518,0.0027055782,0.0012981212,0.0020818915,0.0040520877,0.0042314148,0.0017834931,0.022304947],"category_scores_gemma":[0.017137278,0.001192321,0.001936481,0.0015822719,0.0022106837,0.00514612,0.007788299,0.003305698,0.0036343217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008382523,0.0016380987,0.0022762287,0.0012347737,0.00054882566,0.0013362583,0.0010085428,0.23933826,0.06408134,0.29697922,0.03139325,0.35178268],"study_design_scores_gemma":[0.0005617126,0.00031253565,0.00038685973,0.00004516372,0.0001049252,0.00024845853,0.00009446859,0.79422736,0.038548965,0.1596552,0.0057396595,0.00007474263],"about_ca_topic_score_codex":0.0012379262,"about_ca_topic_score_gemma":0.0024563067,"teacher_disagreement_score":0.022304947,"about_ca_system_score_codex":0.0016893977,"about_ca_system_score_gemma":0.004322551,"threshold_uncertainty_score":0.074617505},"labels":[],"label_agreement":null},{"id":"W2028661287","doi":"10.1016/j.ipl.2005.01.011","title":"Minimizing the number of inputs while applying adaptive test cases","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computerized adaptive testing; Test (biology); Algorithm; Mathematics; Statistics","score_opus":0.024393448385554278,"score_gpt":0.26021796415042353,"score_spread":0.23582451576486926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028661287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24601549,0.00038197835,0.744472,0.00054195634,0.000052080726,0.0003605315,0.00011081623,0.0043400275,0.0037251262],"genre_scores_gemma":[0.67304856,0.00012259222,0.32466704,0.00019093898,0.00003595937,0.00014345924,0.00017554044,0.00039800245,0.0012179107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951881,0.0017636014,0.00042969923,0.0007389644,0.0014209376,0.00045873306],"domain_scores_gemma":[0.95745337,0.030633327,0.003276767,0.0048158905,0.0032599543,0.0005606019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001684459,0.0020064437,0.0012166284,0.0012375702,0.00043868512,0.001151433,0.0029166427,0.0011071565,0.0027862035],"category_scores_gemma":[0.028121855,0.0005950519,0.0005631628,0.0010600444,0.0006439092,0.0024410181,0.0011626419,0.0016322542,0.00063054264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024001964,0.00084891956,0.016921842,0.0005497448,0.00016553642,0.00063252676,0.00040937925,0.16416943,0.1286843,0.005553603,0.0024254723,0.6772391],"study_design_scores_gemma":[0.00021930784,0.0008980326,0.00793605,0.000117369564,0.00022378222,0.00079575623,0.00025710597,0.87898386,0.08916122,0.018465847,0.0028789656,0.00006272462],"about_ca_topic_score_codex":0.001756692,"about_ca_topic_score_gemma":0.0039202846,"teacher_disagreement_score":0.0029166427,"about_ca_system_score_codex":0.0007725853,"about_ca_system_score_gemma":0.0016240607,"threshold_uncertainty_score":0.009320736},"labels":[],"label_agreement":null},{"id":"W2029584013","doi":"10.1016/j.ipl.2014.10.011","title":"k-Attribute-Anonymity is hard even for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:math>","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Table (database); Anonymity; Column (typography); Algorithm; Combinatorics; Mathematics; Computer science; Cover (algebra); Data mining; Geometry","score_opus":0.021810126034982533,"score_gpt":0.24475273722720256,"score_spread":0.22294261119222003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029584013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2595063,0.004662438,0.5110237,0.05632645,0.0019379406,0.00065846444,0.02855135,0.006918483,0.13041486],"genre_scores_gemma":[0.92679715,0.0018005099,0.046822205,0.0032310965,0.00090705615,0.00034254702,0.0050475555,0.000638076,0.014413746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97940356,0.004253529,0.0020396854,0.005794193,0.0041057565,0.0044032675],"domain_scores_gemma":[0.8743826,0.071131505,0.008962762,0.034793705,0.0070930766,0.0036364512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009714122,0.0022553415,0.00646074,0.0015912692,0.008131378,0.015620133,0.0043435656,0.005366767,0.013515208],"category_scores_gemma":[0.048294872,0.0021390936,0.00302078,0.0046575433,0.006126386,0.038421534,0.014647341,0.009264122,0.01026504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009838375,0.00082116196,0.005931449,0.0037859464,0.0012001155,0.0019331521,0.0028797372,0.039144363,0.0154252015,0.7013982,0.12669145,0.09095083],"study_design_scores_gemma":[0.00018315887,0.000112876856,0.00053008937,0.00013106538,0.00010612267,0.0014038519,0.0006904741,0.030252673,0.006506015,0.94960356,0.010364938,0.000115286064],"about_ca_topic_score_codex":0.0012325717,"about_ca_topic_score_gemma":0.0009895652,"teacher_disagreement_score":0.015620133,"about_ca_system_score_codex":0.0031906427,"about_ca_system_score_gemma":0.005192151,"threshold_uncertainty_score":0.05137384},"labels":[],"label_agreement":null},{"id":"W2042983118","doi":"10.1016/j.ipl.2006.08.003","title":"On the longest increasing subsequence of a circular list","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest common subsequence problem; Longest increasing subsequence; Subsequence; Monte Carlo method; Combinatorics; Algorithm; Mathematics; Computer science; Discrete mathematics; Statistics","score_opus":0.008014596510657073,"score_gpt":0.19912213834986703,"score_spread":0.19110754183920994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042983118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3044029,0.0019676299,0.6529098,0.0012436805,0.0010573632,0.00016587625,0.0012509025,0.0016013643,0.03540051],"genre_scores_gemma":[0.6287199,0.0018802615,0.3273833,0.00059943367,0.00075404975,0.00017768145,0.0041430877,0.00064859557,0.035693746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.00008482309,0.000050764065,0.00010499577,0.00021266683,0.000082476596],"domain_scores_gemma":[0.9974172,0.0011243292,0.00024313318,0.00044121334,0.0006132494,0.00016078922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058156427,0.0004723631,0.0005328755,0.002300802,0.0010981911,0.0011006482,0.00097161916,0.00071907474,0.006884772],"category_scores_gemma":[0.0056182244,0.00026007855,0.0004489141,0.0034099713,0.00088798936,0.0020174466,0.0009848609,0.00078361947,0.0019956934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014208172,0.00019062354,0.004674622,0.00051994936,0.00006303488,0.0015655842,0.0009524685,0.04000222,0.04852887,0.47961372,0.027015088,0.395453],"study_design_scores_gemma":[0.000084582825,0.0004259487,0.0028172384,0.00019647912,0.00008038618,0.0014690906,0.00046027097,0.36631554,0.022114862,0.56146497,0.04449064,0.00007997647],"about_ca_topic_score_codex":0.0018355183,"about_ca_topic_score_gemma":0.0023052238,"teacher_disagreement_score":0.006884772,"about_ca_system_score_codex":0.00055976317,"about_ca_system_score_gemma":0.0009085875,"threshold_uncertainty_score":0.02303189},"labels":[],"label_agreement":null},{"id":"W2045037050","doi":"10.1016/j.ipl.2010.05.019","title":"Upper signed k-domination in a general graph","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Upper and lower bounds; Graph; Computer science; Discrete mathematics; Vertex (graph theory)","score_opus":0.007070255514333437,"score_gpt":0.258272288875039,"score_spread":0.25120203336070557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045037050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7867482,0.00055759563,0.14041893,0.0015294753,0.00014101129,0.00009047973,0.00067724806,0.0003407295,0.06949632],"genre_scores_gemma":[0.9519784,0.00032481342,0.022403505,0.00038340144,0.00009103786,0.00009631465,0.0004724687,0.0001574482,0.024092535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998973,0.00021557572,0.000055242224,0.00022222736,0.00029215834,0.00024179305],"domain_scores_gemma":[0.99430865,0.0031244054,0.00065311685,0.0005630928,0.00062485156,0.0007258331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008527856,0.0005880472,0.0009431824,0.0019819255,0.0019302572,0.0029881713,0.001537516,0.0011240231,0.008715075],"category_scores_gemma":[0.005084471,0.0004340846,0.0006036245,0.0017405429,0.0019321193,0.003757482,0.0019623963,0.0016805906,0.0009060994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038365173,0.00013147542,0.0018607593,0.00024660814,0.000040925115,0.0009789754,0.0009230611,0.014766041,0.013286034,0.9366478,0.0047218306,0.026012855],"study_design_scores_gemma":[0.0000438241,0.000042005508,0.0011878825,0.00003614108,0.000023794233,0.0005162722,0.00022184048,0.049293343,0.0032703865,0.9421041,0.0032284604,0.000031969394],"about_ca_topic_score_codex":0.0010409262,"about_ca_topic_score_gemma":0.0019700937,"teacher_disagreement_score":0.008715075,"about_ca_system_score_codex":0.0011378098,"about_ca_system_score_gemma":0.0007163931,"threshold_uncertainty_score":0.029154778},"labels":[],"label_agreement":null},{"id":"W2046831124","doi":"10.1016/j.ipl.2006.09.015","title":"Dynamic Shannon coding","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Alphabet; ENCODE; Mathematics; Coding (social sciences); Entropy (arrow of time); Algorithm; Entropy encoding; Combinatorics; Variable-length code; Discrete mathematics; Decoding methods; Statistics; Physics","score_opus":0.004679726946155797,"score_gpt":0.20918922387086586,"score_spread":0.20450949692471007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046831124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022350576,0.0025984065,0.70449615,0.0031513171,0.0016125544,0.00016729218,0.0013019445,0.0011094165,0.26321232],"genre_scores_gemma":[0.69193894,0.004735615,0.15034188,0.0026264314,0.0015074676,0.00042068932,0.0019748164,0.00063784374,0.14581625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992637,0.00014569875,0.000030686733,0.000119998105,0.0003445505,0.000095325566],"domain_scores_gemma":[0.9990036,0.00030304343,0.0000648266,0.00035441213,0.00020976036,0.000064467364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052550447,0.000692853,0.00060717424,0.0016725138,0.0009986488,0.0020733953,0.00079233863,0.0013397735,0.015016892],"category_scores_gemma":[0.0031385617,0.0003424343,0.00041200596,0.001684128,0.0016344244,0.0022202937,0.0020599323,0.0017913268,0.0039946167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040279632,0.000013267266,0.00008285552,0.000031943342,0.0000072507655,0.000056986726,0.000036588244,0.006737237,0.0020897156,0.9476776,0.0062949145,0.036931425],"study_design_scores_gemma":[0.000016628142,0.000030873573,0.00015921246,0.000049716804,0.00001405299,0.0003384788,0.00003306835,0.07977954,0.005472214,0.87978,0.034284167,0.000042162326],"about_ca_topic_score_codex":0.0007209789,"about_ca_topic_score_gemma":0.0006128387,"teacher_disagreement_score":0.015016892,"about_ca_system_score_codex":0.0009002137,"about_ca_system_score_gemma":0.0011123896,"threshold_uncertainty_score":0.050236464},"labels":[],"label_agreement":null},{"id":"W2048438387","doi":"10.1016/s0020-0190(03)00227-8","title":"Proof of correctness of Ressel's adOPTed algorithm","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Algorithm; Computer science","score_opus":0.007103674795007354,"score_gpt":0.2133890013111565,"score_spread":0.20628532651614917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048438387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05262178,0.00081124535,0.8595985,0.0037887113,0.0012600604,0.00035134295,0.00079185725,0.0058206897,0.07495574],"genre_scores_gemma":[0.6492817,0.0009163986,0.315632,0.0019543462,0.0003628267,0.000460806,0.00078314677,0.0011387217,0.029470041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654996,0.00064935075,0.00023502386,0.0006339263,0.0012846052,0.00064722454],"domain_scores_gemma":[0.9949279,0.0015487628,0.00015182486,0.0017162232,0.0015392902,0.00011604737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006475,0.0010418226,0.0009239304,0.0008396147,0.001183246,0.002718956,0.002390605,0.0019526706,0.011718054],"category_scores_gemma":[0.009932272,0.0005481936,0.001126066,0.0009436076,0.0025198883,0.0026470618,0.0045318897,0.0023735214,0.0047275885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007990136,0.0001519893,0.0014156285,0.0005400331,0.00013967861,0.0005870846,0.0006613892,0.017785922,0.021077214,0.81135684,0.024636526,0.12084869],"study_design_scores_gemma":[0.00044653038,0.00021400626,0.0011359625,0.00019857759,0.00018483572,0.000689453,0.00025692765,0.08714081,0.06558003,0.7596214,0.084400035,0.00013144143],"about_ca_topic_score_codex":0.0013105152,"about_ca_topic_score_gemma":0.0009508477,"teacher_disagreement_score":0.011718054,"about_ca_system_score_codex":0.001192915,"about_ca_system_score_gemma":0.0017380054,"threshold_uncertainty_score":0.039200842},"labels":[],"label_agreement":null},{"id":"W2048541619","doi":"10.1016/s0020-0190(02)00500-8","title":"Cuckoo hashing: Further analysis","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cuckoo; Hash function; Cuckoo search; Theoretical computer science; Algorithm; Programming language","score_opus":0.00865126449561512,"score_gpt":0.22049945294107579,"score_spread":0.21184818844546066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048541619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16540664,0.006460902,0.7277422,0.005787178,0.0010225356,0.00055536063,0.001156629,0.0013934628,0.09047517],"genre_scores_gemma":[0.8656198,0.003198602,0.07894488,0.0010584191,0.0014418638,0.0003583964,0.001411232,0.00057735306,0.0473895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861026,0.00032210388,0.00005117034,0.0001764425,0.00065704493,0.000182999],"domain_scores_gemma":[0.9935887,0.003143391,0.00035267504,0.0014727993,0.001261327,0.00018102332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306641,0.0007424014,0.000990538,0.0018161469,0.0014099664,0.0019094661,0.0015670008,0.0010838851,0.01772729],"category_scores_gemma":[0.01510229,0.00035346352,0.000688301,0.0028604688,0.0016725757,0.004268828,0.0015837883,0.0016707511,0.0023280072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002766173,0.00016923185,0.0033666878,0.00028504804,0.00003650532,0.00027076047,0.00035830174,0.033720285,0.0030667009,0.8250535,0.030026333,0.10336995],"study_design_scores_gemma":[0.000037397775,0.00008142999,0.0027904965,0.000072948766,0.000033103188,0.00064355176,0.00017637001,0.44311732,0.002562916,0.5342103,0.016203264,0.0000708305],"about_ca_topic_score_codex":0.0023545655,"about_ca_topic_score_gemma":0.0025121612,"teacher_disagreement_score":0.01772729,"about_ca_system_score_codex":0.0013480977,"about_ca_system_score_gemma":0.0012836477,"threshold_uncertainty_score":0.0593037},"labels":[],"label_agreement":null},{"id":"W2049589900","doi":"10.1016/j.ipl.2008.09.006","title":"The relative neighbourhood graph is a part of every 30°-triangulation","year":2008,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Neighbourhood (mathematics); Combinatorics; Pitteway triangulation; Mathematics; Delaunay triangulation; Triangulation; Euclidean geometry; Graph; Surface triangulation; Discrete mathematics; Constrained Delaunay triangulation; Geometry; Mathematical analysis","score_opus":0.014155256485922044,"score_gpt":0.21788020283242357,"score_spread":0.2037249463465015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049589900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14279966,0.00034326932,0.74578464,0.000638136,0.0005331003,0.00017201803,0.0015270038,0.0009041372,0.10729801],"genre_scores_gemma":[0.68394965,0.0005708492,0.26549405,0.00032876586,0.000095055206,0.00027791812,0.0038130893,0.0009954065,0.04447528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994912,0.00006508031,0.000029174857,0.00015349203,0.00019709178,0.00006397999],"domain_scores_gemma":[0.9993198,0.00013145633,0.00007343785,0.00017961851,0.00021062227,0.00008516226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022202756,0.0004580574,0.00042074645,0.0008943144,0.0011350282,0.001269451,0.0007929372,0.0007103095,0.014420061],"category_scores_gemma":[0.0014130359,0.00040238377,0.00046103288,0.0006782331,0.0007949986,0.0015447021,0.0011665613,0.0011673799,0.004220455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035882654,0.00013168063,0.0040605078,0.00038942602,0.000058731042,0.0007750764,0.0007972733,0.013543675,0.061850596,0.71955496,0.012672247,0.18580697],"study_design_scores_gemma":[0.000059270285,0.00029970036,0.009628172,0.000156703,0.00006288235,0.0021145658,0.001656673,0.05813902,0.03565221,0.7386247,0.15348375,0.00012233571],"about_ca_topic_score_codex":0.0012968854,"about_ca_topic_score_gemma":0.0015508588,"teacher_disagreement_score":0.014420061,"about_ca_system_score_codex":0.00026676513,"about_ca_system_score_gemma":0.00042194378,"threshold_uncertainty_score":0.048239887},"labels":[],"label_agreement":null},{"id":"W2054063908","doi":"10.1016/j.ipl.2014.05.008","title":"Estimating the number of connected components in sublinear time","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Connected component; Sublinear function; Connectivity; Combinatorics; Strongly connected component; Graph; Component (thermodynamics); Computer science; Time complexity; Discrete mathematics; Mathematics; Minimum spanning tree; Algorithm","score_opus":0.012527989659151443,"score_gpt":0.24632686955367414,"score_spread":0.2337988798945227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054063908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11292778,0.0016042583,0.87133276,0.0022435004,0.00029398868,0.00014412736,0.0012533633,0.0037661176,0.0064340197],"genre_scores_gemma":[0.5433758,0.0007886179,0.43863195,0.0004779689,0.0003574958,0.00025947328,0.0030842794,0.0007886276,0.012235752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987097,0.00031008094,0.0000852256,0.0003511937,0.00038459955,0.0001592318],"domain_scores_gemma":[0.98457515,0.012394426,0.00057401357,0.0013308893,0.00078639487,0.0003390283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013004843,0.0014828313,0.0014975687,0.0018063602,0.00065334217,0.002509498,0.0022724797,0.0020686926,0.007608073],"category_scores_gemma":[0.018607855,0.0009251358,0.0008790101,0.0016051831,0.0011471699,0.005762451,0.002234421,0.0023515094,0.0022606226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028456885,0.00033973387,0.012009563,0.0010428069,0.0003186058,0.00054456864,0.00034512574,0.39608383,0.045873877,0.04627703,0.02192025,0.47239888],"study_design_scores_gemma":[0.000041150863,0.000034047593,0.0012569632,0.000018493567,0.000026100217,0.000095021,0.000048080237,0.95607316,0.0037692715,0.03730865,0.0013156998,0.000013431755],"about_ca_topic_score_codex":0.0056342524,"about_ca_topic_score_gemma":0.010995231,"teacher_disagreement_score":0.007608073,"about_ca_system_score_codex":0.0015145253,"about_ca_system_score_gemma":0.0015159762,"threshold_uncertainty_score":0.0254516},"labels":[],"label_agreement":null},{"id":"W2057222780","doi":"10.1016/s0020-0190(01)00266-6","title":"Signature files and signature trees","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Signature (topology); Search engine indexing; Overhead (engineering); Tree (set theory); Information retrieval; Inefficiency; Inverted index; Data mining; Database; Mathematics; Operating system","score_opus":0.008946689608552622,"score_gpt":0.19419754317582877,"score_spread":0.18525085356727614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057222780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04065147,0.003397292,0.8860234,0.0054962994,0.0010143829,0.0002256168,0.0028962963,0.0036944987,0.056600824],"genre_scores_gemma":[0.588085,0.0057161115,0.2956996,0.0020458512,0.0018850509,0.00041132755,0.0063568917,0.0014437909,0.09835631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99602145,0.0006225127,0.00036079212,0.00069745316,0.0018565825,0.00044128345],"domain_scores_gemma":[0.99195427,0.002560055,0.0009393957,0.0031591093,0.0010689825,0.0003181672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699553,0.0007759594,0.0011457136,0.0031641405,0.002475947,0.0074057155,0.0017060805,0.0025927322,0.016441496],"category_scores_gemma":[0.0112419,0.00085589086,0.0006853052,0.008496371,0.0034997116,0.019721668,0.0031230634,0.0029897888,0.0069351858],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015352145,0.000033596807,0.00041581012,0.00007107251,0.00000997059,0.0001252045,0.00020156452,0.0030044285,0.000839439,0.91299665,0.011084807,0.07106389],"study_design_scores_gemma":[0.00001738693,0.000022963008,0.00012853844,0.000028130251,0.00001293284,0.00037179183,0.00010156404,0.010596967,0.0021550676,0.9501308,0.03640985,0.000023922903],"about_ca_topic_score_codex":0.0009710843,"about_ca_topic_score_gemma":0.0006801384,"teacher_disagreement_score":0.016441496,"about_ca_system_score_codex":0.0017412638,"about_ca_system_score_gemma":0.0021067276,"threshold_uncertainty_score":0.055002272},"labels":[],"label_agreement":null},{"id":"W2058621291","doi":"10.1016/j.ipl.2005.09.006","title":"Vertex covering by paths on trees with its applications in machine translation","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Edge cover; Vertex cover; Vertex (graph theory); Path (computing); Combinatorics; Set cover problem; Enhanced Data Rates for GSM Evolution; Tree (set theory); Mathematics; Cover (algebra); Translation (biology); Computer science; Set (abstract data type); Algorithm; Time complexity; Discrete mathematics; Artificial intelligence; Graph","score_opus":0.0062437251733380335,"score_gpt":0.22703625289583707,"score_spread":0.22079252772249902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058621291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077009775,0.002080202,0.90698737,0.00068717013,0.00018609245,0.0000859795,0.00049627136,0.0011303533,0.011336735],"genre_scores_gemma":[0.39717832,0.002591128,0.5870802,0.00022994836,0.0003868522,0.0002179144,0.0012369286,0.0005866779,0.010491992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938285,0.00023227125,0.000035165638,0.00015690082,0.00011522982,0.00007763644],"domain_scores_gemma":[0.9960418,0.0029280693,0.00021566614,0.000420973,0.00023652615,0.00015703203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006968158,0.00052885705,0.00094060955,0.0016408899,0.0012972696,0.0012400073,0.00093842845,0.0011560555,0.004900102],"category_scores_gemma":[0.0052962094,0.00053973345,0.0010205805,0.0044120564,0.0013139028,0.0026717149,0.001982617,0.0011608773,0.00087678083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049196614,0.00013785124,0.0016960308,0.00045281302,0.000071499366,0.0005158956,0.0008119756,0.13044935,0.0065604243,0.5171266,0.012414171,0.32927144],"study_design_scores_gemma":[0.000024790897,0.0000637684,0.0004231952,0.0000378376,0.00003308952,0.00019166376,0.000072075585,0.26379648,0.0019468715,0.7237874,0.009601187,0.000021667882],"about_ca_topic_score_codex":0.0023186046,"about_ca_topic_score_gemma":0.0018643342,"teacher_disagreement_score":0.004900102,"about_ca_system_score_codex":0.00050177367,"about_ca_system_score_gemma":0.0005468774,"threshold_uncertainty_score":0.01639247},"labels":[],"label_agreement":null},{"id":"W2059051297","doi":"10.1016/j.ipl.2009.02.013","title":"An algorithm for computing simple k-factors","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Combinatorics; Algorithm; SIMPLE algorithm; Factor (programming language); Degenerate energy levels; Graphics; Computer science; Simple graph; Mathematics; Graph theory; Factor graph; Graph; Discrete mathematics","score_opus":0.01734897957320729,"score_gpt":0.30848656557231624,"score_spread":0.29113758599910894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059051297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03138113,0.00056192634,0.94416803,0.00043963213,0.00027461408,0.00034035518,0.000849052,0.00717116,0.014814024],"genre_scores_gemma":[0.10823012,0.00026949434,0.8788674,0.00014575667,0.000078176716,0.00028505866,0.0015920491,0.00063975394,0.009892128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.00010299843,0.00007338928,0.00022547635,0.0002777414,0.00017935036],"domain_scores_gemma":[0.99859995,0.00040878795,0.000069611844,0.00046731243,0.00035045375,0.00010391205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054379925,0.00165392,0.0013884658,0.0016810994,0.0014967973,0.0022782919,0.001754211,0.0011476317,0.019425536],"category_scores_gemma":[0.003259314,0.00065292855,0.0015655385,0.0030574417,0.0010400341,0.003938685,0.0026007735,0.001397804,0.009580457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010788526,0.00024896357,0.0014638047,0.00058132055,0.000118201606,0.00017119193,0.00046164912,0.009890327,0.020759847,0.090918,0.028851256,0.84545654],"study_design_scores_gemma":[0.00079367595,0.00057903473,0.0019921192,0.00016882067,0.00032393806,0.0010487139,0.0006151956,0.1549061,0.037134647,0.7183349,0.083858594,0.00024422156],"about_ca_topic_score_codex":0.0026963009,"about_ca_topic_score_gemma":0.0050735315,"teacher_disagreement_score":0.019425536,"about_ca_system_score_codex":0.0010157088,"about_ca_system_score_gemma":0.001839313,"threshold_uncertainty_score":0.06498492},"labels":[],"label_agreement":null},{"id":"W2060313721","doi":"10.1016/j.ipl.2007.08.008","title":"Flying over a polyhedral terrain","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Terrain; Approximation algorithm; Shortest path problem; Combinatorics; Metric (unit); Mathematics; Obstacle; Euclidean shortest path; Euclidean space; Computational geometry; Euclidean geometry; Path (computing); Space (punctuation); Euclidean distance; Metric space; Algorithm; Computer science; Discrete mathematics; K shortest path routing; Graph; Geometry; Geography","score_opus":0.007763657452015505,"score_gpt":0.24528319179360558,"score_spread":0.23751953434159007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060313721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7022244,0.00026787794,0.279851,0.00067828473,0.0001978412,0.000084957064,0.00048254075,0.0005041315,0.015708968],"genre_scores_gemma":[0.9458067,0.00016281464,0.050609134,0.000055063803,0.00003026383,0.000017476017,0.00029547646,0.000042341217,0.002980859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99990785,0.000013125119,0.0000027998394,0.000020472668,0.00003454099,0.000021201025],"domain_scores_gemma":[0.99983513,0.0000638194,0.000016651398,0.00003058309,0.000020321017,0.000033514494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009934571,0.0002367201,0.0003767539,0.00032070008,0.0007252541,0.0005349536,0.0005394997,0.00067241245,0.002356386],"category_scores_gemma":[0.00053646375,0.0002275839,0.00033165247,0.00043183565,0.00045026516,0.00053924,0.0007528455,0.0004941315,0.00020514651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002963747,0.000077930745,0.0027864205,0.000082930586,0.00009597573,0.0009012505,0.0002075127,0.91827506,0.027882203,0.013414899,0.0024955599,0.033483807],"study_design_scores_gemma":[0.000015770524,0.00005229126,0.0008269187,0.0000046981054,0.0000075342186,0.00008298132,0.00007842545,0.993835,0.0009832634,0.0035685059,0.0005373386,0.0000073386204],"about_ca_topic_score_codex":0.007903563,"about_ca_topic_score_gemma":0.00576585,"teacher_disagreement_score":0.007903563,"about_ca_system_score_codex":0.00030531458,"about_ca_system_score_gemma":0.00034385832,"threshold_uncertainty_score":0.015715122},"labels":[],"label_agreement":null},{"id":"W2061476943","doi":"10.1016/j.ipl.2005.05.029","title":"Periodic and Sturmian languages","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bounded function; Mathematics; Complexity class; Discrete mathematics; Function (biology); Regular language; Computational complexity theory; Combinatorics; Formal language; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.0027857875453301253,"score_gpt":0.1951722247371072,"score_spread":0.1923864371917771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061476943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4906057,0.002576023,0.27747226,0.0034530517,0.0007566769,0.00009173275,0.00048368654,0.0009817429,0.22357917],"genre_scores_gemma":[0.9457217,0.0005294557,0.022146503,0.0003798717,0.00044491366,0.00008818961,0.00027416088,0.00010246676,0.030312818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951565,0.0001238909,0.00003845076,0.00011219007,0.00013704924,0.00007281005],"domain_scores_gemma":[0.99868304,0.00073556206,0.00013414584,0.00016106298,0.000185877,0.000100314435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065826724,0.00034502632,0.0004890262,0.0012452691,0.0013011235,0.0017704077,0.0005360012,0.000905575,0.009047861],"category_scores_gemma":[0.003379486,0.0003149642,0.00056704326,0.00082827045,0.002089639,0.003371568,0.00097478146,0.0009112265,0.0009614803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002276722,0.000006772446,0.00006993243,0.000021578075,0.000002569168,0.0000948287,0.0002219362,0.00035778095,0.00058781845,0.99396133,0.00069946307,0.003953267],"study_design_scores_gemma":[0.0000066030943,0.000012721949,0.00009558612,0.000006564806,0.0000038255494,0.00017120666,0.00006192503,0.0034770174,0.00032361323,0.99356705,0.0022661197,0.000007851718],"about_ca_topic_score_codex":0.00035881784,"about_ca_topic_score_gemma":0.00040286046,"teacher_disagreement_score":0.009047861,"about_ca_system_score_codex":0.0005495012,"about_ca_system_score_gemma":0.00048404787,"threshold_uncertainty_score":0.030268133},"labels":[],"label_agreement":null},{"id":"W2063494850","doi":"10.1016/j.ipl.2010.05.011","title":"Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Bipartite graph; Mathematics; Indifference graph; Maximal independent set; Interval graph; Permutation graph; Pathwidth; Induced subgraph isomorphism problem; Cograph; Discrete mathematics; Clique-sum; Split graph; Algorithm; 1-planar graph; Line graph; Graph; Voltage graph","score_opus":0.023393805936179624,"score_gpt":0.25343921096351546,"score_spread":0.23004540502733584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063494850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10449098,0.001988691,0.8748285,0.002321189,0.00017353099,0.0002734612,0.0012051212,0.0026829694,0.012035466],"genre_scores_gemma":[0.5511084,0.0012530219,0.43619716,0.0004978922,0.00029250752,0.00037011006,0.0031970378,0.0007900426,0.006293855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974401,0.0007311097,0.0001145438,0.00074067403,0.00046007003,0.00051355653],"domain_scores_gemma":[0.9906397,0.0060075065,0.0006720188,0.0018022967,0.00045604893,0.00042235592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023734865,0.0022873047,0.0029673595,0.00198215,0.0013006632,0.003670892,0.005413797,0.0026009318,0.010648029],"category_scores_gemma":[0.014412012,0.0010623701,0.0017141715,0.0057076663,0.0018935555,0.010579954,0.0027155096,0.0036461812,0.0017828837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002605297,0.0010923977,0.0031442693,0.0008670263,0.00028092443,0.0002330865,0.0007225612,0.5615088,0.004436537,0.14768992,0.03292501,0.2444941],"study_design_scores_gemma":[0.00022297644,0.00009898426,0.00040831306,0.000028081779,0.00005795044,0.000105323394,0.0001344872,0.8357042,0.0010050872,0.16032219,0.001890753,0.0000217491],"about_ca_topic_score_codex":0.008779399,"about_ca_topic_score_gemma":0.010314319,"teacher_disagreement_score":0.010648029,"about_ca_system_score_codex":0.0036907448,"about_ca_system_score_gemma":0.0027649545,"threshold_uncertainty_score":0.035621226},"labels":[],"label_agreement":null},{"id":"W2065040823","doi":"10.1016/j.ipl.2006.11.008","title":"On the context-freeness of the set of words containing overlaps","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context (archaeology); Set (abstract data type); Computer science; Theoretical computer science; Algorithm; Mathematics; Programming language; History","score_opus":0.007714664186438252,"score_gpt":0.20165906239308723,"score_spread":0.19394439820664897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065040823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65214384,0.002399638,0.2980583,0.0035030595,0.00029162737,0.00013255808,0.001872275,0.00067162147,0.040927038],"genre_scores_gemma":[0.9611298,0.0007521576,0.032338854,0.0005670803,0.00059354515,0.0002405097,0.0010875146,0.0002036206,0.0030870603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99287957,0.0018329807,0.000844083,0.0021314272,0.0014286415,0.0008834146],"domain_scores_gemma":[0.9154099,0.06872406,0.0035151786,0.005780833,0.003874378,0.0026956357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00564799,0.000986043,0.0024932174,0.0047570686,0.0058119306,0.007602217,0.0026690874,0.002878103,0.005505059],"category_scores_gemma":[0.031485897,0.0015928084,0.0021931608,0.0034631386,0.008902026,0.014306362,0.0052426327,0.003220419,0.00073177845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039892455,0.00008890724,0.0020391557,0.00018476849,0.00008357895,0.00050772517,0.0017350418,0.005231743,0.003751243,0.97450155,0.0009092708,0.01056807],"study_design_scores_gemma":[0.00003720257,0.000043698437,0.0006212032,0.0000666286,0.000057827398,0.0004446736,0.00024429648,0.012733561,0.0012974879,0.9831513,0.0012589232,0.000043081927],"about_ca_topic_score_codex":0.0010313316,"about_ca_topic_score_gemma":0.00075704325,"teacher_disagreement_score":0.007602217,"about_ca_system_score_codex":0.0011708456,"about_ca_system_score_gemma":0.0017629822,"threshold_uncertainty_score":0.029869795},"labels":[],"label_agreement":null},{"id":"W2065242306","doi":"10.1016/s0020-0190(01)00325-8","title":"A note on the Consecutive Ones Submatrix problem","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Permutation (music); Completeness (order theory); Row; Property (philosophy); Logical matrix; Column (typography); Existential quantification; Mathematics; Integer (computer science); Binary number; Matrix (chemical analysis); Row and column spaces; Discrete mathematics; Computer science; Arithmetic; Group (periodic table); Chemistry; Database; Programming language; Philosophy","score_opus":0.022599517655816973,"score_gpt":0.26169837773065996,"score_spread":0.239098860074843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065242306","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01994889,0.008294348,0.80017865,0.03872738,0.01817252,0.00029270165,0.0014794646,0.0007870437,0.112119004],"genre_scores_gemma":[0.18891263,0.013605672,0.65084267,0.014033111,0.028201906,0.0007620925,0.0039477893,0.0017681344,0.09792595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974017,0.00088669243,0.00015876656,0.0006190813,0.00067227945,0.00026157065],"domain_scores_gemma":[0.9902228,0.006364984,0.00033098646,0.001986915,0.00064880645,0.00044550395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027391333,0.0014197303,0.0019641726,0.0012436439,0.0028662018,0.003243991,0.0037426797,0.003364428,0.022781147],"category_scores_gemma":[0.014616989,0.0006348481,0.0016433422,0.0036991586,0.003384602,0.0097867455,0.005178334,0.010193161,0.0073305955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004008892,0.00023305936,0.00053167006,0.000735669,0.000077344004,0.0007397339,0.00026639158,0.014112633,0.002701612,0.6061083,0.18309082,0.19100188],"study_design_scores_gemma":[0.000053359698,0.00008510753,0.00021362655,0.0000807616,0.000018387636,0.0003880074,0.00010575301,0.017388001,0.0009651649,0.9359885,0.044667646,0.000045758294],"about_ca_topic_score_codex":0.0014265663,"about_ca_topic_score_gemma":0.0016653746,"teacher_disagreement_score":0.022781147,"about_ca_system_score_codex":0.0007060015,"about_ca_system_score_gemma":0.0015953575,"threshold_uncertainty_score":0.0762105},"labels":[],"label_agreement":null},{"id":"W2067491157","doi":"10.1016/s0020-0190(02)00478-7","title":"On the complexity of digraph packings","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.03886923167219776,"score_gpt":0.2733865819034409,"score_spread":0.23451735023124315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067491157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72979033,0.0036647613,0.16164887,0.010367946,0.0005435913,0.00027757147,0.0049904957,0.0011029349,0.08761344],"genre_scores_gemma":[0.914411,0.0029397376,0.059068285,0.0006508891,0.00061140774,0.0002240374,0.0043654917,0.0005840228,0.017145032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971834,0.0007059081,0.00020066231,0.00040760764,0.00093618507,0.00056634285],"domain_scores_gemma":[0.9624023,0.03013725,0.0020443934,0.0027984458,0.0011334182,0.0014842716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016956563,0.0012889619,0.0024781453,0.002931605,0.002349973,0.008083901,0.0030510894,0.0029825468,0.022064045],"category_scores_gemma":[0.02649535,0.001492293,0.0017431786,0.0058776657,0.0029198783,0.015587012,0.0045364546,0.00427413,0.0017835771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001152253,0.0005334754,0.007363934,0.0008583978,0.00014870016,0.00053583365,0.001094824,0.22608331,0.0032494173,0.6251023,0.036074333,0.0978033],"study_design_scores_gemma":[0.000083389066,0.00006434719,0.0010386191,0.000051680363,0.000048254115,0.00026410163,0.00026675724,0.21460697,0.00083747675,0.7791457,0.0035563072,0.000036365804],"about_ca_topic_score_codex":0.0033625867,"about_ca_topic_score_gemma":0.0039865086,"teacher_disagreement_score":0.022064045,"about_ca_system_score_codex":0.0034817464,"about_ca_system_score_gemma":0.0016811186,"threshold_uncertainty_score":0.07381165},"labels":[],"label_agreement":null},{"id":"W2071709128","doi":"10.1016/j.ipl.2012.02.004","title":"Improved approximation algorithms for the robust fault-tolerant facility location problem","year":2012,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Facility location problem; Subroutine; Rounding; Approximation algorithm; Algorithm; Computer science; Key (lock); Mathematics; Mathematical optimization","score_opus":0.032564875818662097,"score_gpt":0.2328679527158756,"score_spread":0.2003030768972135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071709128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018394617,0.00066467567,0.97667056,0.0005039625,0.00011217033,0.000057460955,0.00017541932,0.0006067015,0.002814363],"genre_scores_gemma":[0.5302442,0.00066908804,0.4627961,0.00029506208,0.00022833447,0.00024416082,0.00090767024,0.00030239418,0.004313074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824667,0.0005777774,0.00008756373,0.0003091322,0.00046438645,0.0003145092],"domain_scores_gemma":[0.9949169,0.0033638235,0.0004158359,0.00061652454,0.00049570703,0.0001911883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348499,0.0014235034,0.002390763,0.0011492677,0.0007204974,0.0018668649,0.0038148018,0.0021802401,0.004700752],"category_scores_gemma":[0.01206459,0.00070738577,0.0011469771,0.002059746,0.000979123,0.0032491214,0.0021171889,0.0027048488,0.0007947372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026629292,0.00010222864,0.00037009633,0.00010556963,0.000042854386,0.000046599784,0.000052899835,0.9313957,0.00061208336,0.016611602,0.0033079954,0.047086027],"study_design_scores_gemma":[0.000029027493,0.000023098082,0.00005361321,0.0000058222595,0.000008391516,0.000015174438,0.0000104372175,0.99044764,0.00014929388,0.008926154,0.00032702525,0.0000043088153],"about_ca_topic_score_codex":0.00863924,"about_ca_topic_score_gemma":0.0059177834,"teacher_disagreement_score":0.00863924,"about_ca_system_score_codex":0.0023073514,"about_ca_system_score_gemma":0.0020128943,"threshold_uncertainty_score":0.01717794},"labels":[],"label_agreement":null},{"id":"W2072626792","doi":"10.1016/j.ipl.2010.06.006","title":"Block-wise 2D kernel PCA/LDA for face recognition","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Kernel principal component analysis; Subspace topology; Pattern recognition (psychology); Linear discriminant analysis; Kernel Fisher discriminant analysis; Kernel (algebra); Block (permutation group theory); Kernel method; Principal component analysis; Artificial intelligence; Facial recognition system; Computer science; Mathematics; Linear subspace; Algorithm; Support vector machine; Combinatorics","score_opus":0.01519062657803476,"score_gpt":0.23624132395059055,"score_spread":0.22105069737255578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072626792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013890663,0.0006926519,0.98219657,0.0001115914,0.00009328898,0.000041341977,0.00028419495,0.0013803525,0.001309321],"genre_scores_gemma":[0.25668898,0.0011714516,0.727864,0.00009700146,0.00009662173,0.0002235192,0.0012986248,0.000335324,0.012224451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996872,0.00007304261,0.000015633843,0.00004965251,0.00013228541,0.000042207957],"domain_scores_gemma":[0.9997509,0.000049245107,0.000016515603,0.00006689738,0.00010437047,0.000011966527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027011117,0.00040469496,0.0005826581,0.00061436475,0.00035032004,0.00042907512,0.00046044766,0.00034709755,0.0039356914],"category_scores_gemma":[0.0007809503,0.00022505448,0.00054570794,0.00086058123,0.00020532656,0.0005183939,0.00047281836,0.00049598346,0.0031341831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031841075,0.000104823026,0.0006937897,0.00016615119,0.000058153706,0.00006103728,0.000070067465,0.02510343,0.10806192,0.007119182,0.009729149,0.84851384],"study_design_scores_gemma":[0.000014193271,0.00006510897,0.0028430028,0.000012863142,0.000033185286,0.00018611203,0.000029282222,0.9403902,0.04421068,0.0036519608,0.008531611,0.00003180878],"about_ca_topic_score_codex":0.003105462,"about_ca_topic_score_gemma":0.0047442876,"teacher_disagreement_score":0.0039356914,"about_ca_system_score_codex":0.0002478484,"about_ca_system_score_gemma":0.00058966415,"threshold_uncertainty_score":0.013166189},"labels":[],"label_agreement":null},{"id":"W2074482157","doi":"10.1016/j.ipl.2010.09.004","title":"Highly-fair bakery algorithm using symmetric tokens","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Food Supply Chain Traceability","field":"Agricultural and Biological Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Algorithm","score_opus":0.011116841332198537,"score_gpt":0.2083102172990459,"score_spread":0.19719337596684736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074482157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09047324,0.0003957359,0.89638746,0.0009554145,0.0004187119,0.00030430043,0.00031241908,0.0035430328,0.00720965],"genre_scores_gemma":[0.47244197,0.000108378495,0.51194096,0.0003236424,0.00015571908,0.00018219004,0.000619222,0.0004819756,0.01374592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815035,0.0003691763,0.00013725573,0.00047684202,0.0005319912,0.0003343759],"domain_scores_gemma":[0.9960427,0.0016260801,0.0001411787,0.0013843836,0.00059710257,0.00020853801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031773746,0.0007673685,0.0018338454,0.0015825996,0.0020691503,0.0027837893,0.003550378,0.0019133814,0.012408361],"category_scores_gemma":[0.009624103,0.00057107856,0.0008130442,0.0018606836,0.0014366283,0.005504401,0.0034861185,0.0019892373,0.0017805183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038995813,0.001092569,0.0034427799,0.00029714557,0.00020878011,0.00026741123,0.00033946545,0.11140217,0.0137600135,0.17882925,0.01810022,0.6683606],"study_design_scores_gemma":[0.00049698976,0.00024564774,0.00043673022,0.000024143268,0.00006966466,0.00013027393,0.00010330243,0.7668679,0.0096786395,0.21815039,0.0037508316,0.000045496676],"about_ca_topic_score_codex":0.004075284,"about_ca_topic_score_gemma":0.0066348966,"teacher_disagreement_score":0.012408361,"about_ca_system_score_codex":0.0014042251,"about_ca_system_score_gemma":0.004571913,"threshold_uncertainty_score":0.041510046},"labels":[],"label_agreement":null},{"id":"W2074892433","doi":"10.1016/j.ipl.2007.08.005","title":"Approximation and inapproximability results for maximum clique of disc graphs in high dimensions","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Clique; Mathematics; Approximation algorithm; Set (abstract data type); Euclidean geometry; Euclidean space; Time complexity; Space (punctuation); Independent set; Euclidean distance; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.014009683904518814,"score_gpt":0.278734077731017,"score_spread":0.2647243938264982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074892433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29430476,0.016347144,0.5678044,0.030172782,0.001172613,0.000834918,0.0066856146,0.0031040232,0.0795737],"genre_scores_gemma":[0.77587295,0.0067880116,0.18809363,0.0034390835,0.0024885924,0.0011233483,0.00578039,0.0012080012,0.015206065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99168056,0.0028687438,0.00030657387,0.0015601777,0.0017564114,0.0018276455],"domain_scores_gemma":[0.9305681,0.05533617,0.0028680887,0.0059690257,0.0021005908,0.0031579921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009136013,0.0059579476,0.006631098,0.005781055,0.004499454,0.011043533,0.014060772,0.00643522,0.013822333],"category_scores_gemma":[0.054354303,0.0030799855,0.004496695,0.00948178,0.0067615774,0.020902311,0.009021281,0.0139059285,0.0023874468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006013601,0.0025817992,0.010166364,0.003347413,0.0008061339,0.00046248318,0.0024731061,0.39195716,0.006755308,0.4093305,0.07686062,0.08924552],"study_design_scores_gemma":[0.00034300337,0.00016293,0.00096931733,0.00012903301,0.00022120244,0.00022814788,0.00039637668,0.6060913,0.0019008045,0.38557667,0.003919283,0.00006189099],"about_ca_topic_score_codex":0.0064542517,"about_ca_topic_score_gemma":0.007487541,"teacher_disagreement_score":0.014060772,"about_ca_system_score_codex":0.008481152,"about_ca_system_score_gemma":0.0044865934,"threshold_uncertainty_score":0.061535418},"labels":[],"label_agreement":null},{"id":"W2076192504","doi":"10.1016/s0020-0190(02)00364-2","title":"Parametric analysis of overall min-cuts and applications in undirected networks","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Minimum cut; Parametric statistics; Combinatorics; Maximum cut; Algorithm; Cut; Function (biology); Arc (geometry); Discrete mathematics; Ranging; Undirected graph; Computer science; Graph; Artificial intelligence; Geometry; Telecommunications; Statistics","score_opus":0.013917309012479045,"score_gpt":0.25349634715455605,"score_spread":0.239579038142077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076192504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080109276,0.0006972893,0.91487193,0.0003553275,0.000036858906,0.00005047239,0.00020808636,0.00017795074,0.0034928245],"genre_scores_gemma":[0.83908683,0.0014744417,0.15245643,0.00011350135,0.00027685886,0.00024608936,0.00057370705,0.00032868228,0.0054434454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980463,0.0008678807,0.00007669454,0.0004191297,0.00038604712,0.00020391036],"domain_scores_gemma":[0.9695011,0.0234324,0.002609568,0.0018016127,0.001906926,0.0007483946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004443536,0.0012785243,0.00180423,0.002908105,0.0009652265,0.0025049627,0.0042521995,0.0017388304,0.0047964845],"category_scores_gemma":[0.04388451,0.0012148138,0.0014073993,0.0038040823,0.0023408895,0.005587932,0.0026306966,0.003020115,0.0002994016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024131211,0.00009338719,0.0035264315,0.00023450216,0.00009590791,0.00014400063,0.00042922972,0.6646263,0.0026392115,0.24372911,0.0017130311,0.08252757],"study_design_scores_gemma":[0.000006947818,0.00006216309,0.0014822705,0.000027279302,0.000034834236,0.000109618784,0.00011907203,0.7488411,0.00058234675,0.24776259,0.00095053995,0.000021247755],"about_ca_topic_score_codex":0.0015971473,"about_ca_topic_score_gemma":0.0015713313,"teacher_disagreement_score":0.0047964845,"about_ca_system_score_codex":0.0012388439,"about_ca_system_score_gemma":0.0007344332,"threshold_uncertainty_score":0.023499966},"labels":[],"label_agreement":null},{"id":"W2079685570","doi":"10.1016/j.ipl.2005.11.022","title":"A new tree inclusion algorithm","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Mathematics; Matching (statistics); Algorithm; Node (physics); Space (punctuation); Time complexity; Discrete mathematics; Computer science; Physics; Statistics","score_opus":0.004709152392638082,"score_gpt":0.20485827849132324,"score_spread":0.20014912609868515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079685570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005569203,0.00053319556,0.983631,0.00032827773,0.00036982755,0.00013068265,0.0001924308,0.00187029,0.007375044],"genre_scores_gemma":[0.042194925,0.0004693333,0.94088405,0.00036027955,0.00035379123,0.00022308057,0.0007737622,0.0008208198,0.013919897],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808216,0.00031841,0.00014773487,0.00034012008,0.0009439909,0.00016753026],"domain_scores_gemma":[0.997097,0.00072137796,0.0000940524,0.00089290785,0.0010205199,0.00017410038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012411465,0.00090670784,0.0014990031,0.0025982896,0.0015745327,0.0027783753,0.0025442275,0.0017059378,0.012244412],"category_scores_gemma":[0.0052106306,0.0005628459,0.0010708618,0.0036044095,0.0008005397,0.004965901,0.0040406347,0.0022852677,0.007588717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003197582,0.00024554244,0.00037623258,0.00019250545,0.000055331177,0.00012819984,0.00014727551,0.012203475,0.012042182,0.08790998,0.023073802,0.86330575],"study_design_scores_gemma":[0.00016237498,0.0003190773,0.000520517,0.0001217424,0.00014045899,0.0009247195,0.00009706808,0.64612716,0.033988316,0.19311865,0.12439629,0.00008361441],"about_ca_topic_score_codex":0.0010735047,"about_ca_topic_score_gemma":0.0017695911,"teacher_disagreement_score":0.012244412,"about_ca_system_score_codex":0.00068583805,"about_ca_system_score_gemma":0.001757218,"threshold_uncertainty_score":0.040961623},"labels":[],"label_agreement":null},{"id":"W2081396989","doi":"10.1016/j.ipl.2013.05.005","title":"The complexity of two supply chain scheduling problems","year":2013,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Beijing Postdoctoral Science Foundation","keywords":"Unary operation; Bottleneck; Scheduling (production processes); Computer science; Component (thermodynamics); Binary number; Supply chain; Job shop scheduling; Product (mathematics); Mathematical optimization; Mathematics; Combinatorics; Arithmetic; Business; Operating system","score_opus":0.015604487879058953,"score_gpt":0.21738352685074533,"score_spread":0.20177903897168636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081396989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40674752,0.0025676284,0.5088353,0.019238438,0.00066993304,0.00043330464,0.0025913795,0.00041224872,0.058504213],"genre_scores_gemma":[0.89387476,0.0010441318,0.08763404,0.0005645785,0.0005191515,0.00038298525,0.001552548,0.00018634407,0.014241427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680424,0.0013871633,0.00013830281,0.0004792482,0.000739436,0.00045161994],"domain_scores_gemma":[0.97240645,0.02446877,0.0010097341,0.00059667457,0.0006693395,0.00084904535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037085775,0.0012958057,0.0023493324,0.0013955714,0.0013722922,0.00502079,0.002309527,0.0037653833,0.011604207],"category_scores_gemma":[0.022668693,0.0010915773,0.0015060081,0.0022901185,0.0023061968,0.006074159,0.0028287703,0.0038283768,0.0004362768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085361145,0.0004349515,0.0017632571,0.0004652942,0.00015305169,0.00043731523,0.00032727592,0.7625642,0.0010129794,0.19573843,0.008230195,0.02801935],"study_design_scores_gemma":[0.0001636081,0.000048807964,0.0004931598,0.000019649782,0.000029469138,0.000052807176,0.00010842833,0.85587174,0.00023683805,0.14192256,0.0010299355,0.000022856817],"about_ca_topic_score_codex":0.006916735,"about_ca_topic_score_gemma":0.004475294,"teacher_disagreement_score":0.011604207,"about_ca_system_score_codex":0.0040790928,"about_ca_system_score_gemma":0.0032927948,"threshold_uncertainty_score":0.03881997},"labels":[],"label_agreement":null},{"id":"W2082135431","doi":"10.1016/j.ipl.2004.09.007","title":"Pattern expressions and pattern automata","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Automaton; Computer science; Regular expression; Theoretical computer science; Mathematics; Programming language","score_opus":0.006898938926469907,"score_gpt":0.20985433685877816,"score_spread":0.20295539793230827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082135431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027358506,0.0021721446,0.9086885,0.0033602687,0.0005973503,0.00012643493,0.0006846467,0.0011581617,0.055853948],"genre_scores_gemma":[0.57931834,0.0033901518,0.34901258,0.00165692,0.0010258285,0.0007786273,0.0021825691,0.00082594546,0.061809048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976641,0.0006056244,0.00029147827,0.00067273725,0.0005822109,0.00018384056],"domain_scores_gemma":[0.99642664,0.0017870787,0.00024884436,0.00094919314,0.00046143593,0.00012672278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012878549,0.00087498565,0.0012978319,0.0019157971,0.001858233,0.005521839,0.0012371918,0.0018390811,0.013012245],"category_scores_gemma":[0.0070543,0.00088030554,0.0014774329,0.002989159,0.0038813783,0.014729666,0.0032737914,0.0027409913,0.0034152854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017986904,0.000010955472,0.00014737582,0.000040582458,0.0000072932426,0.00008686595,0.0002388077,0.0006299442,0.0004379981,0.98004353,0.0016084677,0.016730173],"study_design_scores_gemma":[0.0000037630205,0.000005603773,0.000029537625,0.000009305166,0.0000060537977,0.00009842007,0.000047015354,0.003610256,0.0003940029,0.98944664,0.006344087,0.000005360596],"about_ca_topic_score_codex":0.0007450634,"about_ca_topic_score_gemma":0.0004318822,"teacher_disagreement_score":0.013012245,"about_ca_system_score_codex":0.00089824176,"about_ca_system_score_gemma":0.00078250834,"threshold_uncertainty_score":0.043530345},"labels":[],"label_agreement":null},{"id":"W2082898666","doi":"10.1016/j.ipl.2011.09.013","title":"Low-interference networks in metric spaces of bounded doubling dimension","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Bounded function; Dimension (graph theory); Metric (unit); Interference (communication); Mathematics; Metric space; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Algorithm; Theoretical computer science; Telecommunications; Mathematical analysis; Engineering","score_opus":0.01753522022955412,"score_gpt":0.2214610976034818,"score_spread":0.20392587737392767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082898666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38262063,0.0040818686,0.5716706,0.0028480943,0.0002448286,0.00010659533,0.00076491514,0.00045454918,0.037207887],"genre_scores_gemma":[0.9620085,0.0013915927,0.028476493,0.00036077911,0.00018956845,0.00012917514,0.00034236116,0.00006527002,0.0070363274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837446,0.00067858153,0.00006930603,0.00019566392,0.000422102,0.00025981545],"domain_scores_gemma":[0.9905595,0.0063472507,0.0010238307,0.00042125818,0.00080137845,0.0008467194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755868,0.0011182678,0.0015779389,0.0023929328,0.001527933,0.0037589814,0.0021046465,0.0013359942,0.003132091],"category_scores_gemma":[0.008481088,0.0006974107,0.0005411658,0.0016329451,0.0023681994,0.004334561,0.0039985613,0.0020133913,0.0004546233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032040596,0.000042222615,0.0007837925,0.00013698718,0.00005060436,0.0002894015,0.0002626002,0.071457185,0.0029466765,0.91408545,0.0021802506,0.0074443812],"study_design_scores_gemma":[0.000055240478,0.00007450381,0.0005570847,0.000026000105,0.00002262011,0.00035616613,0.00020205336,0.31316555,0.0012168515,0.6813748,0.002904056,0.0000451369],"about_ca_topic_score_codex":0.0018667111,"about_ca_topic_score_gemma":0.0012394488,"teacher_disagreement_score":0.0037589814,"about_ca_system_score_codex":0.0021132836,"about_ca_system_score_gemma":0.0005329857,"threshold_uncertainty_score":0.015332997},"labels":[],"label_agreement":null},{"id":"W2093941744","doi":"10.1016/s0020-0190(03)00228-x","title":"From a simple elimination ordering to a strong elimination ordering in linear time","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Simple (philosophy); Chordal graph; Mathematics; Time complexity; Graph; Computer science; Combinatorics; Algorithm","score_opus":0.013666661840455533,"score_gpt":0.2796372488493467,"score_spread":0.2659705870088912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093941744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116519734,0.0008054044,0.8216427,0.003826941,0.0005598551,0.00019062977,0.0009458712,0.0036777821,0.051831085],"genre_scores_gemma":[0.5037665,0.0007945871,0.45901528,0.0014195405,0.00052086246,0.00022236395,0.0015186502,0.0014212352,0.031320956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876106,0.00032771446,0.0000868776,0.00021437956,0.00034808606,0.00026176285],"domain_scores_gemma":[0.9949656,0.003063929,0.00025082126,0.000839212,0.00056395296,0.0003164268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435296,0.0007923265,0.00078505673,0.0010015238,0.001401176,0.0028025801,0.0012300776,0.00078380987,0.010400626],"category_scores_gemma":[0.004934496,0.0006776904,0.0010111781,0.0019257079,0.0017010731,0.00690529,0.0019796018,0.0031021247,0.0016588941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074824825,0.00034977018,0.00071411085,0.00044496392,0.000058464673,0.00025353595,0.00072548405,0.023422433,0.00801007,0.72651756,0.032005426,0.20674989],"study_design_scores_gemma":[0.0000816464,0.0000711221,0.00014860868,0.000017975384,0.00003537331,0.000084103594,0.00009930344,0.033958264,0.002374391,0.9559115,0.0071983603,0.000019366842],"about_ca_topic_score_codex":0.0026740446,"about_ca_topic_score_gemma":0.0055250847,"teacher_disagreement_score":0.010400626,"about_ca_system_score_codex":0.0012121814,"about_ca_system_score_gemma":0.0023091743,"threshold_uncertainty_score":0.034793556},"labels":[],"label_agreement":null},{"id":"W2094285453","doi":"10.1016/j.ipl.2004.10.007","title":"Broadcasting with locally bounded Byzantine faults","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Resilience (materials science); Distributed computing; Broadcasting (networking); Node (physics); Greedy algorithm; Heuristic; Byzantine fault tolerance; Wireless sensor network; Computer network; Fault tolerance; Algorithm","score_opus":0.005448011887945285,"score_gpt":0.19689970072595941,"score_spread":0.19145168883801414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094285453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35715804,0.0030735843,0.6061857,0.0037420664,0.0004616644,0.00015022235,0.0004197357,0.0036729602,0.025136143],"genre_scores_gemma":[0.95591706,0.00058267836,0.035736658,0.00019643793,0.00015599446,0.0000782526,0.00013458506,0.00017703853,0.0070213177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871683,0.00034150388,0.00007370397,0.00017542171,0.00037553054,0.00031705265],"domain_scores_gemma":[0.988781,0.006983841,0.0008161111,0.0023655,0.0007696653,0.00028382306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015191582,0.0006926318,0.0016405368,0.0012032052,0.001622169,0.0024343808,0.0012846936,0.0018941811,0.0033967737],"category_scores_gemma":[0.011807004,0.00048704376,0.0002787295,0.001568554,0.0017535832,0.0047923415,0.0028736785,0.0019253687,0.0006482855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044653416,0.00015497628,0.0018899045,0.00083762815,0.00008069442,0.0012583549,0.001412695,0.34536403,0.04993916,0.44055736,0.011840432,0.14219938],"study_design_scores_gemma":[0.0002626241,0.0003060249,0.0003933468,0.000068149435,0.00006165108,0.00049023295,0.00023673596,0.6472647,0.027700907,0.3142623,0.0088920295,0.00006134569],"about_ca_topic_score_codex":0.0019170484,"about_ca_topic_score_gemma":0.0022887983,"teacher_disagreement_score":0.0033967737,"about_ca_system_score_codex":0.0021636412,"about_ca_system_score_gemma":0.0011492419,"threshold_uncertainty_score":0.015698314},"labels":[],"label_agreement":null},{"id":"W2102921272","doi":"10.1016/j.ipl.2009.03.005","title":"Efficient generation of the ideals of a poset in Gray code order","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially ordered set; Gray code; Mathematics; Squire; Ideal (ethics); Combinatorics; Code (set theory); Discrete mathematics; Order (exchange); Algorithm; Computer science; Set (abstract data type)","score_opus":0.0306036593354886,"score_gpt":0.29796036275768095,"score_spread":0.26735670342219237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102921272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3598557,0.0003391076,0.57314646,0.0010090233,0.0003726255,0.0004815147,0.00079460995,0.00226336,0.061737537],"genre_scores_gemma":[0.8285207,0.00017106923,0.1535363,0.00019829793,0.00011470115,0.00014135822,0.001283466,0.00048530786,0.015548873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994733,0.00010359656,0.000024689622,0.00006975736,0.00018015668,0.0001485215],"domain_scores_gemma":[0.99911267,0.00032567844,0.000061964456,0.00018781389,0.00019286296,0.00011905411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049496384,0.00044738024,0.0006459912,0.000857405,0.00081453426,0.0015689549,0.0006209509,0.00041544923,0.007382824],"category_scores_gemma":[0.0015022127,0.00031577118,0.0008451041,0.00046870255,0.0010825199,0.0013738202,0.0016526356,0.001126392,0.0016180412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040995041,0.00027349687,0.0015616403,0.00029496467,0.000032949854,0.00067170506,0.0012104391,0.032844882,0.032610435,0.7951734,0.017387515,0.11752862],"study_design_scores_gemma":[0.00011684392,0.00026794986,0.00057956594,0.000057538236,0.000046217843,0.00038218373,0.00040032822,0.16143641,0.04062044,0.77580506,0.020230237,0.00005732069],"about_ca_topic_score_codex":0.0006763493,"about_ca_topic_score_gemma":0.0015892091,"teacher_disagreement_score":0.007382824,"about_ca_system_score_codex":0.0006415347,"about_ca_system_score_gemma":0.00088557746,"threshold_uncertainty_score":0.02469796},"labels":[],"label_agreement":null},{"id":"W2106874035","doi":"10.1016/j.ipl.2005.10.002","title":"A flaw in the electronic commerce protocol SET","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Protocol (science); Database transaction; Computer security; Computer science; Set (abstract data type); Credit card; TRACE (psycholinguistics); E-commerce; Software; World Wide Web; Database; Operating system; Programming language; Payment","score_opus":0.012800272631243201,"score_gpt":0.29705790607678223,"score_spread":0.284257633445539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106874035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06323297,0.0006186983,0.7982357,0.03505086,0.0029925916,0.00048587157,0.0010941732,0.006923378,0.091365814],"genre_scores_gemma":[0.7110913,0.00079760345,0.24310718,0.0066408385,0.0009881872,0.0008256936,0.0010819269,0.002135044,0.03333235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96630627,0.0074494523,0.0025169959,0.0026642873,0.019199857,0.0018631909],"domain_scores_gemma":[0.93336296,0.024656165,0.0018147213,0.031451017,0.007790321,0.00092478556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017027846,0.0010598096,0.0022719414,0.0030229837,0.0065243565,0.01027087,0.005065458,0.007972171,0.010340345],"category_scores_gemma":[0.06765243,0.0022210302,0.0022578838,0.0028755865,0.01101433,0.021491334,0.008741272,0.0158679,0.0057910257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001844719,0.00005987121,0.0003054327,0.00006454338,0.000025381594,0.00015929154,0.0004355578,0.0009942553,0.0014458178,0.97251976,0.008679678,0.015126009],"study_design_scores_gemma":[0.00009670646,0.00008353698,0.00016813104,0.000116272975,0.00006463776,0.00057873916,0.00015598697,0.01789636,0.0077008866,0.9442287,0.028826691,0.00008326671],"about_ca_topic_score_codex":0.00129458,"about_ca_topic_score_gemma":0.0007754069,"teacher_disagreement_score":0.017027846,"about_ca_system_score_codex":0.0026539958,"about_ca_system_score_gemma":0.004349267,"threshold_uncertainty_score":0.0900529},"labels":[],"label_agreement":null},{"id":"W2107945074","doi":"10.1016/j.ipl.2006.06.015","title":"On the All-Farthest-Segments problem for a planar set of points","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Set (abstract data type); Planar; Combinatorics; Computer science; Mathematics; Computational geometry; Algorithm; Computer graphics (images); Programming language","score_opus":0.015606133536053017,"score_gpt":0.23386586222278158,"score_spread":0.21825972868672855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107945074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09382423,0.0015125973,0.8759166,0.003777332,0.0002335632,0.0004203142,0.0016948528,0.00046433805,0.022156091],"genre_scores_gemma":[0.39748064,0.002177243,0.55548036,0.0007429427,0.00068727677,0.0006316759,0.005178423,0.001065727,0.036555775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889624,0.00038429754,0.00006444065,0.00030817764,0.00020819991,0.00013867862],"domain_scores_gemma":[0.994093,0.004722564,0.00035067066,0.00033161434,0.00025105148,0.0002511602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141619,0.002198803,0.003770696,0.0019393972,0.001777108,0.0031183003,0.0043751625,0.0070676897,0.021009736],"category_scores_gemma":[0.0122076655,0.0015906314,0.0018196487,0.0026842682,0.0026892999,0.007177208,0.0041570296,0.0034042706,0.0017055918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066334766,0.0002755641,0.0009837039,0.0008218237,0.00009234475,0.00035217663,0.00039723236,0.7531407,0.0015045949,0.13854706,0.01836629,0.084855236],"study_design_scores_gemma":[0.0001078013,0.00011673832,0.00021909384,0.00007057986,0.00002375735,0.00009651697,0.00022712236,0.8068912,0.0005277959,0.18881345,0.0028825502,0.00002344403],"about_ca_topic_score_codex":0.0066833696,"about_ca_topic_score_gemma":0.005135156,"teacher_disagreement_score":0.021009736,"about_ca_system_score_codex":0.0013051503,"about_ca_system_score_gemma":0.0012520249,"threshold_uncertainty_score":0.070284605},"labels":[],"label_agreement":null},{"id":"W2110691754","doi":"10.1016/j.ipl.2004.01.008","title":"Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure; Concordia University","funders":"","keywords":"Computer network; Multicast; Computer science; Multiprotocol Label Switching; Source-specific multicast; Xcast; IP multicast; Hybrid automatic repeat request; Distributed computing; Quality of service","score_opus":0.007454997472252719,"score_gpt":0.20679080822070448,"score_spread":0.19933581074845175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110691754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7569466,0.0017133399,0.23429205,0.0010110943,0.00007951265,0.000072064584,0.00033696683,0.00060239696,0.0049459217],"genre_scores_gemma":[0.99546695,0.00030980987,0.0032414766,0.00003509285,0.00004741067,0.000027925891,0.00009848493,0.000036812922,0.0007359727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832326,0.00045566788,0.000072314724,0.00016258654,0.0007035353,0.00028251592],"domain_scores_gemma":[0.96094996,0.032791115,0.00233967,0.0014518857,0.0019946476,0.00047274074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007135252,0.0005253159,0.0009734427,0.0015927131,0.0007168921,0.0012836152,0.0013550351,0.00092230004,0.0013628957],"category_scores_gemma":[0.028504314,0.0005729257,0.00028823383,0.001048231,0.0016430465,0.0019015897,0.00088275864,0.0010000394,0.00015571977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029434075,0.00027724885,0.017628033,0.0002537476,0.00010331932,0.00063333387,0.0005653913,0.84750056,0.012532233,0.065995686,0.0035525202,0.04801457],"study_design_scores_gemma":[0.00003073693,0.00010831427,0.0034053114,0.000012710922,0.000048715727,0.00016978764,0.000076077245,0.9825882,0.0029532888,0.010345553,0.00023499953,0.000026345706],"about_ca_topic_score_codex":0.002035954,"about_ca_topic_score_gemma":0.0013466662,"teacher_disagreement_score":0.007135252,"about_ca_system_score_codex":0.0023085899,"about_ca_system_score_gemma":0.0006614383,"threshold_uncertainty_score":0.037735283},"labels":[],"label_agreement":null},{"id":"W2114125964","doi":"10.1016/j.ipl.2007.05.009","title":"On planar path transformation","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Planar; Mathematics; Path (computing); General position; Position (finance); Hamiltonian path; Regular polygon; Combinatorics; Hamiltonian (control theory); Plane (geometry); Geometry; Computer science; Mathematical optimization; Graph","score_opus":0.008217308766478882,"score_gpt":0.22678855360038522,"score_spread":0.21857124483390633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114125964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020445539,0.0006908892,0.90288347,0.00066495663,0.00053519604,0.00008796673,0.00042382293,0.00082141336,0.07344678],"genre_scores_gemma":[0.46299115,0.003197467,0.36704612,0.0009072601,0.00056761614,0.00024613892,0.0026032173,0.001639835,0.1608012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964905,0.00005919262,0.000012112253,0.000097035394,0.00014306327,0.000039400034],"domain_scores_gemma":[0.99972254,0.00007245456,0.000022683442,0.00008719816,0.00007524131,0.000019963845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022079491,0.000715152,0.0005167237,0.0013716918,0.00065891247,0.00086015573,0.00075590075,0.00058555696,0.017645655],"category_scores_gemma":[0.00134403,0.0003034446,0.00059003773,0.0015351153,0.0009458195,0.0016350243,0.0021588544,0.001713018,0.003945461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007147129,0.00003224285,0.00021932038,0.0000653389,0.000017127233,0.00007470537,0.00012260182,0.02289281,0.004197822,0.7442507,0.013215081,0.2148409],"study_design_scores_gemma":[0.000016231465,0.00006039561,0.00028716872,0.000023988869,0.000016715607,0.00019686946,0.000101529404,0.11905885,0.0038628478,0.8121742,0.06418327,0.000017896205],"about_ca_topic_score_codex":0.0016105864,"about_ca_topic_score_gemma":0.0012202727,"teacher_disagreement_score":0.017645655,"about_ca_system_score_codex":0.00048765022,"about_ca_system_score_gemma":0.00044163968,"threshold_uncertainty_score":0.059030592},"labels":[],"label_agreement":null},{"id":"W2123276592","doi":"10.1016/s0020-0190(00)00011-9","title":"Estimating the number of vertices of a polyhedron","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polyhedron; Combinatorics; Computer science; Mathematics","score_opus":0.0074845664320263615,"score_gpt":0.24575505388399693,"score_spread":0.23827048745197058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123276592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2279235,0.0005264342,0.76454526,0.00028754547,0.00011820227,0.0001177666,0.0011519378,0.0014208995,0.0039085452],"genre_scores_gemma":[0.6228578,0.00029799444,0.37284818,0.000040223153,0.00005154348,0.000067397086,0.0014864199,0.00019299878,0.0021574094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914646,0.0001611591,0.000056913406,0.00025609165,0.00028248073,0.00009680825],"domain_scores_gemma":[0.99651706,0.0021138887,0.0002431794,0.0004950084,0.0004401596,0.00019067757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042545548,0.00072718813,0.001233459,0.0019043873,0.00062873727,0.0016748491,0.0015985691,0.0022247783,0.0036470923],"category_scores_gemma":[0.007842888,0.0010157842,0.0007845624,0.0011947094,0.00075596734,0.0018750097,0.0012407575,0.0013284936,0.0013021071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00152601,0.0001765055,0.020670386,0.00044207694,0.00016259257,0.00050558825,0.00015956015,0.6100462,0.039770205,0.016932365,0.005156427,0.30445212],"study_design_scores_gemma":[0.000020903613,0.000055615586,0.0020815965,0.000020892892,0.000013698039,0.00012625408,0.000059292885,0.9835089,0.006768655,0.00652387,0.00080579286,0.000014505093],"about_ca_topic_score_codex":0.0032348314,"about_ca_topic_score_gemma":0.0034704218,"teacher_disagreement_score":0.0036470923,"about_ca_system_score_codex":0.0004514397,"about_ca_system_score_gemma":0.0005348498,"threshold_uncertainty_score":0.012200713},"labels":[],"label_agreement":null},{"id":"W2123615615","doi":"10.1016/j.ipl.2005.04.004","title":"The convex hull of a regular set of integer vectors is polyhedral and effectively computable","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Convex hull; Polyhedron; Convex polytope; Mathematics; Combinatorics; Integer (computer science); Regular polygon; Set (abstract data type); Numerical digit; Convex set; Discrete mathematics; Representation (politics); Computer science; Arithmetic; Convex optimization","score_opus":0.010070287330799664,"score_gpt":0.25320449769055053,"score_spread":0.24313421035975086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123615615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14098357,0.00020196561,0.8303678,0.0005834357,0.00007623239,0.00009216585,0.00062816625,0.00061790925,0.026448712],"genre_scores_gemma":[0.8348084,0.00036008708,0.15198408,0.0002046866,0.00009999096,0.00022081613,0.0014714177,0.00028003953,0.010570441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972045,0.000374092,0.00018592956,0.00064231,0.0011333067,0.00045978898],"domain_scores_gemma":[0.99489874,0.0025211293,0.00071430975,0.00080497033,0.00070694584,0.00035381387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010101253,0.00075613626,0.0013797481,0.001481278,0.0009391848,0.0055357264,0.0014435332,0.00068947097,0.0033177494],"category_scores_gemma":[0.007246126,0.0007420226,0.0010194076,0.001586752,0.0038519497,0.005721321,0.0018681715,0.0028349308,0.000741526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026415568,0.00009064199,0.00074124045,0.00014868964,0.00004596567,0.00021974149,0.000326071,0.03646696,0.00707384,0.9244968,0.0014487368,0.028677167],"study_design_scores_gemma":[0.000034923305,0.00009328686,0.0005584506,0.000043476186,0.000023942515,0.00021116876,0.00023919407,0.13534856,0.00924567,0.84950656,0.0046546697,0.00004020115],"about_ca_topic_score_codex":0.0025039823,"about_ca_topic_score_gemma":0.0017787928,"teacher_disagreement_score":0.0055357264,"about_ca_system_score_codex":0.0015627362,"about_ca_system_score_gemma":0.0011285486,"threshold_uncertainty_score":0.011338472},"labels":[],"label_agreement":null},{"id":"W2128278061","doi":"10.1016/s0020-0190(02)00481-7","title":"A CAT algorithm for generating permutations with a fixed number of inversions","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Combinatorics; Algorithm; Mathematics; Constant (computer programming); Data structure; Computer science; Discrete mathematics","score_opus":0.023545475983421896,"score_gpt":0.3017395781108965,"score_spread":0.27819410212747464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128278061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03801486,0.0002267688,0.93405586,0.00050382444,0.00021878177,0.00036300503,0.00045456277,0.0026548367,0.02350752],"genre_scores_gemma":[0.23239239,0.00019367975,0.7426293,0.00037015032,0.000081648235,0.0006467185,0.0011241554,0.0007649962,0.021797065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986706,0.0003412501,0.000080456295,0.00027923618,0.00042576157,0.00020276019],"domain_scores_gemma":[0.9974371,0.0011321482,0.00008467648,0.00080074114,0.00042279373,0.00012252863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010688666,0.0008475783,0.0008804875,0.0013905413,0.0013732512,0.0022944785,0.0018924602,0.0018609248,0.012339529],"category_scores_gemma":[0.0042694644,0.0006628487,0.0012633259,0.0018228543,0.0011154058,0.0025088107,0.0019099023,0.001965507,0.0037887928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012444635,0.00030626822,0.001106536,0.0002732633,0.00008773791,0.00026436074,0.0003191565,0.049171135,0.020072643,0.39511788,0.023663476,0.508373],"study_design_scores_gemma":[0.00047593837,0.0003745088,0.0003889851,0.00009627886,0.00012274261,0.0005522535,0.00013449561,0.4975158,0.026323186,0.4411349,0.032780714,0.00010011647],"about_ca_topic_score_codex":0.0024988118,"about_ca_topic_score_gemma":0.0048201033,"teacher_disagreement_score":0.012339529,"about_ca_system_score_codex":0.0012983053,"about_ca_system_score_gemma":0.0030780435,"threshold_uncertainty_score":0.041279852},"labels":[],"label_agreement":null},{"id":"W2142543306","doi":"10.1016/j.ipl.2006.05.013","title":"A polynomial time algorithm for the minimum quartet inconsistency problem with quartet errors","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Time complexity; Polynomial; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.004749491763813111,"score_gpt":0.19647819872110153,"score_spread":0.19172870695728841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142543306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023325589,0.00041699404,0.9670291,0.00089517346,0.00019068287,0.00028796843,0.00033474408,0.0028576748,0.00466198],"genre_scores_gemma":[0.1366133,0.0001874135,0.85743314,0.00029377514,0.00011562596,0.00024933895,0.001316563,0.00065217906,0.003138653],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816954,0.00028854658,0.0001620575,0.0005814388,0.00053530897,0.0002630729],"domain_scores_gemma":[0.9949987,0.0027297589,0.00037004377,0.0011629673,0.00054817897,0.00019024474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654944,0.0014540511,0.0022850067,0.0015051514,0.0016232762,0.002629716,0.0038217013,0.0023503038,0.012343097],"category_scores_gemma":[0.008546715,0.0010695588,0.0015016418,0.0030703433,0.0010854019,0.004627209,0.0040406846,0.0030940499,0.0019931954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011611533,0.00054372795,0.0013236225,0.000774826,0.00016092331,0.00034568724,0.0005031958,0.1072642,0.012989129,0.05436725,0.0348938,0.7856724],"study_design_scores_gemma":[0.00078820647,0.00030631453,0.0006720382,0.00007924925,0.00012063054,0.00069957,0.0003572115,0.7397814,0.009690913,0.23798068,0.009455596,0.00006820958],"about_ca_topic_score_codex":0.002372343,"about_ca_topic_score_gemma":0.0035367685,"teacher_disagreement_score":0.012343097,"about_ca_system_score_codex":0.0012832737,"about_ca_system_score_gemma":0.0023055628,"threshold_uncertainty_score":0.041291833},"labels":[],"label_agreement":null},{"id":"W2155875791","doi":"10.1016/j.ipl.2003.09.019","title":"A note on maximum independent sets in rectangle intersection graphs","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Rectangle; Intersection (aeronautics); Upper and lower bounds; Intersection graph; Running time; Integer (computer science); Constant (computer programming); Time complexity; Approximation algorithm; Independent set; Discrete mathematics; Graph; Algorithm; Computer science; Line graph; Geometry","score_opus":0.010233888979936713,"score_gpt":0.23899568601044968,"score_spread":0.22876179703051297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155875791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019457093,0.0112323025,0.86343265,0.014733743,0.0065450366,0.00019468665,0.0012754785,0.0009480378,0.082181044],"genre_scores_gemma":[0.33904243,0.022958579,0.5666546,0.008425834,0.018956408,0.0009714121,0.0026357602,0.0020288103,0.0383261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958835,0.0011271581,0.00027531435,0.0010363342,0.0012891873,0.00038843957],"domain_scores_gemma":[0.9720757,0.022381589,0.0006723232,0.002854296,0.0013220775,0.00069396483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004413322,0.0021972468,0.0036365949,0.0036739574,0.0041924343,0.0047717225,0.006887211,0.0034618885,0.013054126],"category_scores_gemma":[0.026766513,0.0019529206,0.0037620508,0.010382125,0.004975485,0.01682337,0.007103477,0.015585367,0.0027498193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004593009,0.00011948535,0.0006828816,0.00085372577,0.00012240403,0.00033931865,0.0005056692,0.030331856,0.0028124969,0.8273858,0.05602085,0.08036628],"study_design_scores_gemma":[0.000039305334,0.00005632029,0.0004410538,0.000102509606,0.00008228933,0.00016166893,0.00009676108,0.031627826,0.0014367632,0.9414773,0.024424471,0.000053801035],"about_ca_topic_score_codex":0.0033917024,"about_ca_topic_score_gemma":0.0038505099,"teacher_disagreement_score":0.013054126,"about_ca_system_score_codex":0.0027791536,"about_ca_system_score_gemma":0.0014616395,"threshold_uncertainty_score":0.043670416},"labels":[],"label_agreement":null},{"id":"W215657516","doi":"10.1016/s0020-0190(00)00093-4","title":"Covering a set of points by two axis-parallel boxes","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Measure (data warehouse); Combinatorics; Monotone polygon; Set (abstract data type); Mathematics; Set function; Space (punctuation); Simple (philosophy); Cover (algebra); Function (biology); Computational geometry; Binary logarithm; Set cover problem; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.007962567998770969,"score_gpt":0.2328252668648898,"score_spread":0.22486269886611884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W215657516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10141358,0.00029876933,0.88518304,0.00018004834,0.00012109277,0.00018704147,0.0006493635,0.00064753176,0.011319465],"genre_scores_gemma":[0.37091357,0.0003940438,0.62028563,0.00006239806,0.000032736945,0.00042716594,0.0010058793,0.00013668794,0.0067419256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991099,0.00019951983,0.00008676128,0.00015468671,0.00032923633,0.00011989133],"domain_scores_gemma":[0.9990495,0.00036036313,0.00011470914,0.00023196891,0.0001611771,0.00008238357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297258,0.0008711424,0.0007916511,0.001090324,0.00064737635,0.0012218126,0.0011830386,0.0009772494,0.006294252],"category_scores_gemma":[0.0021482531,0.0005452956,0.00063284615,0.0015568081,0.00067463785,0.0012948427,0.0025859764,0.0007214995,0.001693621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033384927,0.00040679504,0.00901806,0.0010817598,0.00019855236,0.0017460242,0.0010958607,0.34955058,0.13121967,0.17024852,0.009570273,0.32252538],"study_design_scores_gemma":[0.00032261215,0.00063940353,0.0039419886,0.00021002324,0.00009144452,0.0016190158,0.00056762225,0.8030951,0.0705751,0.07371239,0.04513055,0.00009471032],"about_ca_topic_score_codex":0.00090480107,"about_ca_topic_score_gemma":0.0005648198,"teacher_disagreement_score":0.006294252,"about_ca_system_score_codex":0.00032763023,"about_ca_system_score_gemma":0.00043520035,"threshold_uncertainty_score":0.021056354},"labels":[],"label_agreement":null},{"id":"W2157953951","doi":"10.1016/j.ipl.2007.08.034","title":"Compact Hilbert indices: Space-filling curves for domains with unequal side lengths","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Hilbert curve; Hilbert R-tree; Hilbert space; Dimension (graph theory); Mathematics; Hilbert manifold; Representation (politics); Grid; Reproducing kernel Hilbert space; Space (punctuation); Rigged Hilbert space; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Geometry","score_opus":0.015010405668049061,"score_gpt":0.26037189541166983,"score_spread":0.24536148974362076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157953951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20025428,0.0013271814,0.7190952,0.0012458873,0.0004976959,0.00016031925,0.00056050334,0.0010227094,0.07583624],"genre_scores_gemma":[0.7935701,0.0012681556,0.18293732,0.00039908514,0.00030829056,0.00023276896,0.0004977758,0.0009953269,0.019791218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993451,0.000174293,0.00003370836,0.000087661094,0.00022178076,0.00013740442],"domain_scores_gemma":[0.9981754,0.00067235384,0.00019392934,0.00042310948,0.00023626523,0.00029889462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011733477,0.00090718304,0.0008612251,0.0017600867,0.0011002136,0.004137973,0.0012817901,0.0015485657,0.007268443],"category_scores_gemma":[0.005727411,0.00043192125,0.00050618243,0.0017066565,0.0028758517,0.005061576,0.002586147,0.0025792413,0.0016385379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000808427,0.00001599002,0.000081181024,0.00003252728,0.0000024902968,0.000044776312,0.00014538024,0.0020212124,0.0022346287,0.97974306,0.0013248274,0.014273043],"study_design_scores_gemma":[0.000026846135,0.000030614927,0.00007081972,0.000018632414,0.0000032216299,0.00012349717,0.00008494428,0.022795437,0.0027238545,0.96785897,0.0062413043,0.000021908523],"about_ca_topic_score_codex":0.00025898658,"about_ca_topic_score_gemma":0.00019126819,"teacher_disagreement_score":0.007268443,"about_ca_system_score_codex":0.0010380044,"about_ca_system_score_gemma":0.0006915218,"threshold_uncertainty_score":0.024315298},"labels":[],"label_agreement":null},{"id":"W2169603675","doi":"10.1016/j.ipl.2004.08.005","title":"Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Control reconfiguration; Redundancy (engineering); Catastrophic failure; Computer science; Very-large-scale integration; Characterization (materials science); Fault (geology); Parallel computing; Algorithm; Embedded system; Geology; Materials science; Seismology; Nanotechnology","score_opus":0.0072592819552914105,"score_gpt":0.20682085188365668,"score_spread":0.19956156992836527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169603675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97605807,0.000115626004,0.022224573,0.000051433653,0.000015331743,0.000011459459,0.00006570809,0.00019323126,0.0012645079],"genre_scores_gemma":[0.9983205,0.000016363476,0.0013625246,0.0000088003835,0.000002959497,0.000006336853,0.000048562924,0.0000053497806,0.00022855333],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998647,0.000019630379,0.000010111563,0.00002129269,0.000059263064,0.000024960047],"domain_scores_gemma":[0.9983139,0.0006184207,0.0005131892,0.00018002013,0.00028474428,0.000089728055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014222815,0.00022950934,0.00016047726,0.0006346947,0.00026176596,0.0003351251,0.00039965592,0.000368355,0.0008235592],"category_scores_gemma":[0.0018125215,0.00013761553,0.00009406208,0.000347725,0.0004164165,0.00040952628,0.00021182356,0.00019484675,0.00009028263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018747876,0.00029169588,0.046215404,0.00033897551,0.00007749106,0.0025083208,0.000397706,0.21073228,0.6702726,0.018442623,0.0011647112,0.04768348],"study_design_scores_gemma":[0.00005854831,0.0012786053,0.024945451,0.000021711563,0.000051371833,0.0020031543,0.00027974168,0.6401676,0.3211859,0.00845971,0.001498538,0.00004967471],"about_ca_topic_score_codex":0.00023907244,"about_ca_topic_score_gemma":0.00044594263,"teacher_disagreement_score":0.0008235592,"about_ca_system_score_codex":0.00026880915,"about_ca_system_score_gemma":0.0002140383,"threshold_uncertainty_score":0.002755046},"labels":[],"label_agreement":null},{"id":"W2610512692","doi":"10.1016/j.ipl.2017.04.010","title":"Finding the largest fixed-density necklace and Lyndon word","year":2017,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Necklace; Lexicographical order; Word (group theory); String (physics); Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.013703008732276704,"score_gpt":0.24386364245283912,"score_spread":0.23016063372056242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610512692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28315496,0.0022025125,0.69151676,0.0020278434,0.00042672205,0.00022400652,0.0013754582,0.0023201087,0.01675162],"genre_scores_gemma":[0.589299,0.0007169736,0.3873584,0.0004749987,0.00019385102,0.00034094608,0.002114925,0.00067140936,0.018829497],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991617,0.00015693194,0.00008365346,0.00022880656,0.00024279453,0.0001261437],"domain_scores_gemma":[0.99636203,0.0020320266,0.00022049669,0.00057401083,0.0005967155,0.00021479094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146324,0.00096992386,0.0016494603,0.0026272773,0.0014228508,0.0015919335,0.0018106204,0.0022499796,0.010709468],"category_scores_gemma":[0.016846407,0.0007324894,0.0007668889,0.0017169971,0.0016445201,0.0045052953,0.0023623887,0.0016014735,0.0030459722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002402964,0.00039773996,0.006601711,0.0011953915,0.00014955757,0.0015987427,0.0011873529,0.08468735,0.036938563,0.309675,0.053277403,0.5018882],"study_design_scores_gemma":[0.00016840569,0.0003705413,0.0017942666,0.00021369144,0.00010678607,0.001208997,0.0007660982,0.5075792,0.023072042,0.44687697,0.017674822,0.00016819205],"about_ca_topic_score_codex":0.0018899307,"about_ca_topic_score_gemma":0.0028841882,"teacher_disagreement_score":0.010709468,"about_ca_system_score_codex":0.0009278025,"about_ca_system_score_gemma":0.0014077284,"threshold_uncertainty_score":0.035826743},"labels":[],"label_agreement":null},{"id":"W2758508602","doi":"10.1016/j.ipl.2017.09.011","title":"Stream VByte : Faster byte-oriented integer compression","year":2017,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"National Research Council Canada","keywords":"Byte; Computer science; SIMD; Data compression; Parallel computing; Data stream; Decoding methods; Integer (computer science); Cache; Compression (physics); Algorithm; Computer hardware; Programming language","score_opus":0.01176430296315444,"score_gpt":0.24859861746291584,"score_spread":0.2368343144997614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758508602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05266717,0.0051403,0.80341756,0.0010531913,0.0023154712,0.0005026883,0.0042511467,0.09495306,0.035699412],"genre_scores_gemma":[0.23162585,0.0017184325,0.71503925,0.0011384106,0.0006166769,0.00044878063,0.007938086,0.006404495,0.03507003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934286,0.00008011998,0.000052330284,0.00008292058,0.00035548926,0.00008625296],"domain_scores_gemma":[0.99902546,0.00032606922,0.00004605965,0.00030426023,0.00023329756,0.00006477215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007262747,0.0011430559,0.0008561021,0.0020001458,0.0004244375,0.0020250913,0.0013171842,0.00065605046,0.026645346],"category_scores_gemma":[0.002858659,0.00040124878,0.000446249,0.0023292436,0.00043907235,0.002220825,0.0016769966,0.0010814185,0.00656005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021536013,0.00020894929,0.0008846833,0.0003446069,0.00008739533,0.00020444504,0.00014303564,0.0058165626,0.03734106,0.018884158,0.068927445,0.865004],"study_design_scores_gemma":[0.0011663184,0.00067360123,0.0016209949,0.00028408066,0.00012827847,0.0011073835,0.00022250219,0.46695524,0.33689803,0.03538906,0.15540095,0.00015368332],"about_ca_topic_score_codex":0.0020511972,"about_ca_topic_score_gemma":0.0028350304,"teacher_disagreement_score":0.026645346,"about_ca_system_score_codex":0.00063623243,"about_ca_system_score_gemma":0.0009817166,"threshold_uncertainty_score":0.089137495},"labels":[],"label_agreement":null},{"id":"W2765981104","doi":"10.1016/j.ipl.2018.04.006","title":"Reaching a target in the plane with no information","year":2018,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Multiplicative function; Plane (geometry); Bounded function; Binary logarithm; Trajectory; Combinatorics; Mathematics; Euclidean geometry; Euclidean distance; Computer science; Discrete mathematics; Physics; Mathematical analysis; Geometry","score_opus":0.012523325368783537,"score_gpt":0.23126683504676068,"score_spread":0.21874350967797715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765981104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10458619,0.0005822816,0.84443486,0.0024613666,0.0001824774,0.00014797242,0.00059822627,0.0005067512,0.046499863],"genre_scores_gemma":[0.78748983,0.0007594771,0.18810089,0.0005824912,0.0001743803,0.0002998963,0.00087053096,0.0002745286,0.021447962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913293,0.00021017682,0.000041975352,0.00026659932,0.00020366062,0.00014474904],"domain_scores_gemma":[0.9979001,0.0014926682,0.00018587019,0.00014620122,0.00016618735,0.000109011824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009802175,0.0014906157,0.0016713929,0.000960956,0.00092809834,0.0027433436,0.0012193745,0.004475804,0.005192594],"category_scores_gemma":[0.0070969732,0.000805014,0.0008791416,0.001006356,0.0016472349,0.0040314286,0.0035053787,0.002366572,0.0014839867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017666023,0.00023629615,0.0015204819,0.0005824724,0.00021016276,0.00069762836,0.00042202833,0.73934174,0.013480208,0.17857179,0.0084474,0.05472322],"study_design_scores_gemma":[0.00008531028,0.0001381487,0.00033049096,0.00004143445,0.000028456552,0.00013393241,0.00012502805,0.8589654,0.0028129758,0.13583228,0.0014781414,0.000028418854],"about_ca_topic_score_codex":0.003469851,"about_ca_topic_score_gemma":0.0017191431,"teacher_disagreement_score":0.005192594,"about_ca_system_score_codex":0.0010402561,"about_ca_system_score_gemma":0.0012726743,"threshold_uncertainty_score":0.017370999},"labels":[],"label_agreement":null},{"id":"W2772513563","doi":"10.1016/j.ipl.2017.12.002","title":"Fast modular reduction and squaring in GF (2 m )","year":2017,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Reduction (mathematics); Modular design; Basis (linear algebra); Polynomial; Simple (philosophy); Irreducible polynomial; Discrete mathematics; Contrast (vision); Combinatorics; Computer science; Matrix polynomial; Artificial intelligence","score_opus":0.007708864062896335,"score_gpt":0.2216530982816451,"score_spread":0.21394423421874875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772513563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1945813,0.0018883783,0.75408894,0.00087247876,0.0006530138,0.00021737743,0.00030386343,0.008439009,0.038955726],"genre_scores_gemma":[0.62050426,0.0005945338,0.34911093,0.00032713005,0.00034958738,0.00013877038,0.0004967852,0.00050849246,0.027969506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00011001043,0.000029477385,0.0000867331,0.00026116974,0.00012711693],"domain_scores_gemma":[0.9995055,0.00019473264,0.00003732528,0.00014941864,0.00008402186,0.000029021263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050782267,0.0011999118,0.0008446677,0.0009516266,0.0006589056,0.0012991892,0.0005997516,0.0005092179,0.0128231095],"category_scores_gemma":[0.0017156777,0.0002791955,0.00075021497,0.0011286691,0.0006548598,0.0014563466,0.0014375342,0.00088885496,0.0047106054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012227824,0.00018447402,0.0011391228,0.00038337955,0.00010704431,0.00089132733,0.00043703933,0.01405601,0.08774634,0.060060658,0.01718483,0.81658703],"study_design_scores_gemma":[0.0011149284,0.0021399062,0.0050704814,0.00025495616,0.00034973223,0.0039193844,0.0007277821,0.2981501,0.3075375,0.2999746,0.080518216,0.00024243411],"about_ca_topic_score_codex":0.0009863719,"about_ca_topic_score_gemma":0.0026470793,"teacher_disagreement_score":0.0128231095,"about_ca_system_score_codex":0.00057393214,"about_ca_system_score_gemma":0.0009347439,"threshold_uncertainty_score":0.042897582},"labels":[],"label_agreement":null},{"id":"W2902703949","doi":"10.1016/j.ipl.2018.11.009","title":"Thin trees in 8-edge-connected planar graphs","year":2018,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Spanning tree; Mathematics; Trémaux tree; Disjoint sets; Graph; Planar straight-line graph; Discrete mathematics; Line graph; 1-planar graph; Pathwidth","score_opus":0.010390285266438311,"score_gpt":0.22778797335976597,"score_spread":0.21739768809332766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902703949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49304885,0.0008833872,0.4776918,0.0009162908,0.000114837945,0.00018665993,0.0010718758,0.0005734526,0.025512762],"genre_scores_gemma":[0.77500767,0.0012060149,0.2009074,0.0002898637,0.00008667017,0.0001999704,0.0016253704,0.00029277027,0.020384217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967074,0.00007032555,0.000024250145,0.00006499932,0.00010553904,0.000064218475],"domain_scores_gemma":[0.99809235,0.0010027853,0.00034409773,0.00013426265,0.00022332369,0.00020315769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030963836,0.0004422809,0.000601694,0.0015800566,0.0009113581,0.0014432954,0.0012713609,0.0013027143,0.0057542855],"category_scores_gemma":[0.0036693176,0.00084743125,0.00041765484,0.0015604657,0.00085539476,0.0018245018,0.0013264088,0.0012819275,0.0009429056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005231118,0.00015900253,0.0028700745,0.00060493,0.00007917332,0.0013940451,0.0010403827,0.21747316,0.017619954,0.63962734,0.012405169,0.10620373],"study_design_scores_gemma":[0.00006125108,0.00006332233,0.0015436902,0.000107851614,0.000047384186,0.0005389414,0.00048457496,0.40031713,0.004819807,0.5839316,0.008056226,0.000028210112],"about_ca_topic_score_codex":0.0018584118,"about_ca_topic_score_gemma":0.0028960481,"teacher_disagreement_score":0.0057542855,"about_ca_system_score_codex":0.00066997885,"about_ca_system_score_gemma":0.00037374825,"threshold_uncertainty_score":0.019250035},"labels":[],"label_agreement":null},{"id":"W2948857561","doi":"10.1016/j.ipl.2020.106027","title":"Borders, palindrome prefixes, and square prefixes","year":2020,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prefix; Palindrome; Conjecture; Combinatorics; Mathematics; Alphabet; Bijection; Square (algebra); Linguistics; Geometry","score_opus":0.013896880524760269,"score_gpt":0.23957471478753883,"score_spread":0.22567783426277857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948857561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56773645,0.0021057855,0.33922854,0.0018890359,0.00051495724,0.00009634375,0.00042059133,0.00065125007,0.08735701],"genre_scores_gemma":[0.9467844,0.00049050146,0.041570205,0.00031090493,0.00020335114,0.00007924291,0.0001903346,0.00011284289,0.010258225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989722,0.00022845225,0.0000931241,0.0003589465,0.00018106496,0.00016630767],"domain_scores_gemma":[0.9947501,0.003188845,0.0005307941,0.0008020426,0.00038480954,0.00034342165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010912046,0.0003359314,0.0005621907,0.0009099745,0.001216337,0.0031128635,0.0006241484,0.0013661218,0.0076485123],"category_scores_gemma":[0.0065733944,0.00037918967,0.00058188447,0.0009245873,0.0030906936,0.007258351,0.0017137416,0.0015273447,0.00091585587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001607232,0.000023477362,0.0003759209,0.000050894967,0.000005964788,0.00031561754,0.0003922449,0.00104123,0.0042829546,0.9812004,0.000643449,0.011507151],"study_design_scores_gemma":[0.000018507193,0.00004693624,0.00017205492,0.000016439442,0.000008908866,0.00029468734,0.00017805655,0.0064756633,0.0024427888,0.9873324,0.0029975832,0.000015961697],"about_ca_topic_score_codex":0.00027816673,"about_ca_topic_score_gemma":0.00029749353,"teacher_disagreement_score":0.0076485123,"about_ca_system_score_codex":0.00043751372,"about_ca_system_score_gemma":0.0003988329,"threshold_uncertainty_score":0.025586784},"labels":[],"label_agreement":null},{"id":"W3022187609","doi":"10.1016/j.ipl.2020.105973","title":"Randomized distributed online algorithms against adaptive offline adversaries","year":2020,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Danmarks Frie Forskningsfond","keywords":"Adversary; Competitive analysis; Adversary model; Online algorithm; Computer science; Randomized algorithm; Randomization; Algorithm; Deterministic algorithm; Theoretical computer science; Mathematics; Upper and lower bounds; Computer security; Randomized controlled trial","score_opus":0.025858568714240946,"score_gpt":0.24563019098400907,"score_spread":0.21977162226976812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022187609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06052782,0.00081020826,0.922963,0.0028667864,0.0004974395,0.00028090627,0.00028429608,0.0015888778,0.010180675],"genre_scores_gemma":[0.8796347,0.0003392511,0.10938215,0.00079389615,0.00038423788,0.0005244802,0.0002509196,0.0003430194,0.008347459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916642,0.00365449,0.0003435314,0.0017116738,0.0015455309,0.0010805536],"domain_scores_gemma":[0.9509995,0.036821924,0.002193287,0.007032354,0.0017410248,0.0012118641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008544007,0.0025995765,0.0033646517,0.001293684,0.0015594125,0.003034162,0.0048035597,0.0044764797,0.0051418254],"category_scores_gemma":[0.035215706,0.0013404998,0.0011526413,0.0017869881,0.0042564115,0.0061794636,0.007237494,0.0055238185,0.0013192659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029147516,0.0004942759,0.0010779328,0.00027613016,0.0001796904,0.00016128155,0.0001218388,0.8456045,0.0039354456,0.08725231,0.0076129474,0.050368864],"study_design_scores_gemma":[0.00016709008,0.00011280399,0.00009080009,0.000015681615,0.000019461517,0.00004582387,0.000017580256,0.958276,0.001233003,0.039569303,0.00043940078,0.000013020617],"about_ca_topic_score_codex":0.00092480046,"about_ca_topic_score_gemma":0.0011462622,"teacher_disagreement_score":0.008544007,"about_ca_system_score_codex":0.0027508643,"about_ca_system_score_gemma":0.003488828,"threshold_uncertainty_score":0.045185626},"labels":[],"label_agreement":null},{"id":"W3110571569","doi":"10.1016/j.ipl.2021.106133","title":"Weighted automata are compact and actively learnable","year":2021,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; James S. McDonnell Foundation","keywords":"ω-automaton; Generalization; Quantum finite automata; Automaton; Mathematics; Discrete mathematics; Deterministic automaton; Time complexity; Deterministic finite automaton; Automata theory; Timed automaton; Mobile automaton; DFA minimization; Nondeterministic finite automaton; Algorithm; Computer science; Finite-state machine; Theoretical computer science","score_opus":0.010278333150746062,"score_gpt":0.23921076495620378,"score_spread":0.22893243180545772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110571569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108910754,0.00066135055,0.87800294,0.0006566753,0.00016354112,0.00006455109,0.00043781628,0.00093453424,0.010167838],"genre_scores_gemma":[0.8662614,0.00063096656,0.11034204,0.00039946678,0.00029913374,0.00036755833,0.0007350595,0.00058806915,0.020376312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980567,0.00035217902,0.00014531722,0.0007646,0.00046367332,0.00021755985],"domain_scores_gemma":[0.98419225,0.010088671,0.0013852693,0.0022612058,0.0015543865,0.0005182083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012123367,0.001100373,0.0014407021,0.001531412,0.00097199326,0.0033281124,0.0021494064,0.0023872969,0.0050770063],"category_scores_gemma":[0.016137935,0.0012391183,0.0011641147,0.0011380276,0.0028094742,0.010406895,0.0030089698,0.0037942394,0.0011554742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011109452,0.00006804129,0.00085122656,0.0001672562,0.00004597353,0.00023481062,0.0004776925,0.02413228,0.0066993753,0.93536365,0.0013534208,0.030495096],"study_design_scores_gemma":[0.0000108182085,0.000031057043,0.0001472966,0.000015500907,0.000012373259,0.00009476314,0.000042070944,0.11718309,0.0016021337,0.8794183,0.0014282978,0.000014272601],"about_ca_topic_score_codex":0.00078075536,"about_ca_topic_score_gemma":0.00098515,"teacher_disagreement_score":0.0050770063,"about_ca_system_score_codex":0.00095652987,"about_ca_system_score_gemma":0.00075590255,"threshold_uncertainty_score":0.016984284},"labels":[],"label_agreement":null},{"id":"W3192049267","doi":"10.1016/j.ipl.2021.106173","title":"Randomized consensus with regular registers","year":2021,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Computer science; Adversary; Randomized algorithm; Adversary model; Algorithm; Theoretical computer science; Computer security","score_opus":0.008307946532752642,"score_gpt":0.2101698602278566,"score_spread":0.20186191369510398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192049267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08598901,0.000408131,0.8894543,0.0018486785,0.0005623529,0.00024075617,0.00030522692,0.001951568,0.019239947],"genre_scores_gemma":[0.89718115,0.0001743329,0.08765717,0.0004916285,0.0002059644,0.0004156124,0.00025958885,0.00021541677,0.013399094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532473,0.0018358098,0.0003018434,0.0010679429,0.0008195003,0.00065006915],"domain_scores_gemma":[0.9883459,0.0057295137,0.0006482771,0.0037688615,0.0011252349,0.0003822206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035065063,0.0007949652,0.0020959824,0.0010692654,0.0015057836,0.0023519672,0.0022791147,0.002020449,0.0062981835],"category_scores_gemma":[0.018487634,0.00073746196,0.00092295243,0.0011812004,0.0023433967,0.0034960501,0.0036081518,0.0019395994,0.0012709602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002277155,0.00017706295,0.00046204543,0.00019952614,0.00010724242,0.00018876402,0.00024936133,0.24765092,0.0059494553,0.67677224,0.0073574046,0.058608834],"study_design_scores_gemma":[0.00031470222,0.00018272406,0.00007411353,0.000020879517,0.00003587018,0.000040697632,0.000036251462,0.64309776,0.003238349,0.3510893,0.0018327198,0.000036709545],"about_ca_topic_score_codex":0.0012494201,"about_ca_topic_score_gemma":0.0013052947,"teacher_disagreement_score":0.0062981835,"about_ca_system_score_codex":0.0013126213,"about_ca_system_score_gemma":0.0028725418,"threshold_uncertainty_score":0.021069527},"labels":[],"label_agreement":null},{"id":"W3204704467","doi":"10.1016/j.ipl.2022.106293","title":"On public-coin zero-error randomized communication complexity","year":2022,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication complexity; Zero (linguistics); Mathematics; Theoretical computer science; Upper and lower bounds; Computer science; Polynomial; PSPACE; Computational complexity theory; Discrete mathematics; Algorithm","score_opus":0.037043340476142904,"score_gpt":0.25551627706450736,"score_spread":0.21847293658836445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204704467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11444697,0.00340192,0.7887229,0.02620415,0.0010255289,0.0003786602,0.0019267583,0.0016219834,0.06227118],"genre_scores_gemma":[0.90707695,0.0022804723,0.0640357,0.0028830015,0.0016886436,0.0010244071,0.0011706227,0.00087032,0.018969804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97562134,0.011090628,0.00089807104,0.0033739212,0.0048577976,0.004158222],"domain_scores_gemma":[0.7944077,0.18111382,0.003823633,0.013462571,0.005024894,0.0021673597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016940981,0.0031408123,0.005526389,0.0031288273,0.0038470912,0.009606389,0.0070848935,0.006446377,0.015586924],"category_scores_gemma":[0.10138897,0.0019479397,0.0026467054,0.0056056543,0.010943685,0.025301937,0.010980525,0.011984862,0.0023953563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088576024,0.0002287379,0.0009128895,0.00027506065,0.00009944904,0.00011337296,0.0003009757,0.12160453,0.0009403724,0.847791,0.009977773,0.016870169],"study_design_scores_gemma":[0.00013797432,0.000043492375,0.00020118823,0.000052415857,0.000040075574,0.00004204044,0.000043887783,0.19790278,0.0005824812,0.8000008,0.0009112933,0.000041569918],"about_ca_topic_score_codex":0.0039258804,"about_ca_topic_score_gemma":0.003513037,"teacher_disagreement_score":0.016940981,"about_ca_system_score_codex":0.010311029,"about_ca_system_score_gemma":0.008998035,"threshold_uncertainty_score":0.08959353},"labels":[],"label_agreement":null},{"id":"W4245009066","doi":"10.1016/j.ipl.2003.07.005","title":"Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Topological sorting; Cover (algebra); Sorting; Directed acyclic graph; Algorithm; Node (physics); Bounded function; Mathematics; Computational complexity theory; Computer science; Combinatorics; Discrete mathematics","score_opus":0.014654559237537848,"score_gpt":0.24698117496591082,"score_spread":0.232326615728373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245009066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03145603,0.00087124563,0.95862544,0.0005533091,0.00012086107,0.00034900912,0.0010828138,0.004024348,0.0029170052],"genre_scores_gemma":[0.11278667,0.00035779184,0.8806113,0.00016433447,0.00005013725,0.00020741792,0.0026381286,0.00024080067,0.0029434566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987478,0.00021589064,0.00013233276,0.00025425665,0.00044487632,0.00020475955],"domain_scores_gemma":[0.99493045,0.0026854996,0.00036662698,0.0008916036,0.000862042,0.00026384267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015533683,0.001111439,0.002221153,0.0066200695,0.0019385149,0.0025937275,0.00348239,0.001664448,0.0047891135],"category_scores_gemma":[0.007900411,0.0009117989,0.0011751368,0.005951975,0.00107697,0.0039860187,0.002559177,0.0019685773,0.001324116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076799246,0.00040573074,0.0022091211,0.000587654,0.00011872732,0.00016565777,0.00041600922,0.07270363,0.009403979,0.050950438,0.01774342,0.84452766],"study_design_scores_gemma":[0.0002447706,0.00026824887,0.0009557528,0.0000901528,0.00013356186,0.0003276664,0.0002597955,0.8576761,0.015637288,0.11046279,0.013862664,0.0000811847],"about_ca_topic_score_codex":0.009694192,"about_ca_topic_score_gemma":0.016099332,"teacher_disagreement_score":0.009694192,"about_ca_system_score_codex":0.002147414,"about_ca_system_score_gemma":0.005470211,"threshold_uncertainty_score":0.019275546},"labels":[],"label_agreement":null},{"id":"W4323659995","doi":"10.1016/j.ipl.2023.106391","title":"Optimal circle search despite the presence of faulty robots","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Search and rescue; Computer science; Linear search; Crash; Search algorithm; Algorithm; Mobile robot; Artificial intelligence","score_opus":0.024219429274543396,"score_gpt":0.2745886169192998,"score_spread":0.2503691876447564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323659995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47671056,0.0011131822,0.49435464,0.0021532197,0.00018994423,0.000052201,0.00013953734,0.0010348067,0.02425194],"genre_scores_gemma":[0.9686581,0.00007572864,0.027729716,0.00006810019,0.000021579408,0.000023689541,0.00004968973,0.00006076384,0.0033126834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995289,0.00014013905,0.000021889764,0.000107712,0.00011642481,0.000084910396],"domain_scores_gemma":[0.9948257,0.0031712635,0.00052159786,0.0005192119,0.0006298293,0.00033241816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009101216,0.00043313057,0.0011696818,0.0005788998,0.0006990833,0.0009267379,0.0009164839,0.0019750774,0.0018575698],"category_scores_gemma":[0.008788309,0.0004524903,0.00022836032,0.0007959044,0.0013550377,0.0014917651,0.0011968048,0.00069860177,0.0004880476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096084044,0.00006209468,0.0008313811,0.00011073437,0.000048499838,0.0003095501,0.0002144831,0.91469085,0.0069825985,0.0441769,0.0034547648,0.02815728],"study_design_scores_gemma":[0.000033586875,0.000054526194,0.00020829911,0.000004893571,0.0000048535117,0.00003971415,0.000028876073,0.9860848,0.00145678,0.011653618,0.00041975113,0.000010299538],"about_ca_topic_score_codex":0.003449551,"about_ca_topic_score_gemma":0.0022931297,"teacher_disagreement_score":0.003449551,"about_ca_system_score_codex":0.0007663034,"about_ca_system_score_gemma":0.0009410643,"threshold_uncertainty_score":0.006858945},"labels":[],"label_agreement":null},{"id":"W4386827762","doi":"10.1016/j.ipl.2023.106446","title":"Relating planar graph drawings to planar satisfiability problems","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Satisfiability; Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Discrete mathematics; Boolean satisfiability problem; Neighbourhood (mathematics); Epigraph; Graph; Algorithm; Mathematical optimization","score_opus":0.012388626148830045,"score_gpt":0.22567825607238598,"score_spread":0.21328962992355593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386827762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055889912,0.00078899524,0.92092425,0.0018382999,0.000118080745,0.00020364656,0.00042908528,0.00054773653,0.019259986],"genre_scores_gemma":[0.5084391,0.0036601904,0.46790925,0.0010473887,0.00039640025,0.00048930227,0.003398307,0.0006118641,0.0140482085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980046,0.0007349369,0.00014014704,0.00037960496,0.00055029616,0.00019049928],"domain_scores_gemma":[0.9820968,0.014459799,0.0014549461,0.0010042164,0.0007937451,0.00019061494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013730793,0.0011387733,0.0011521725,0.0029341956,0.0014106298,0.0032564478,0.0024187947,0.0028720293,0.008123755],"category_scores_gemma":[0.027685791,0.0015450602,0.0016883629,0.006023733,0.001954835,0.006690607,0.0036994254,0.004958893,0.0006859145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011333673,0.00017658643,0.0011029881,0.0003920784,0.000058909958,0.00030751876,0.00047737124,0.20701098,0.0015385158,0.6835254,0.007463109,0.0978333],"study_design_scores_gemma":[0.000017802684,0.000017786037,0.00019405106,0.00003118681,0.000021418298,0.00006374742,0.0000969759,0.124635406,0.0005274035,0.8720182,0.0023641938,0.0000118333855],"about_ca_topic_score_codex":0.0040468452,"about_ca_topic_score_gemma":0.003664398,"teacher_disagreement_score":0.008123755,"about_ca_system_score_codex":0.0017765522,"about_ca_system_score_gemma":0.0010286082,"threshold_uncertainty_score":0.027176678},"labels":[],"label_agreement":null},{"id":"W4387579616","doi":"10.1016/j.ipl.2023.106452","title":"Ranking and unranking bordered and unbordered words","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of Winnipeg","keywords":"Suffix; Prefix; Word (group theory); Rank (graph theory); Ranking (information retrieval); Alphabet; Combinatorics; Space (punctuation); Mathematics; Computer science; Unit (ring theory); Arithmetic; Artificial intelligence; Linguistics; Geometry","score_opus":0.006699653823596698,"score_gpt":0.21484779076425592,"score_spread":0.20814813694065923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387579616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53253096,0.0010837816,0.44782636,0.00036152228,0.00033678242,0.00036799334,0.0013889592,0.0037425477,0.012361055],"genre_scores_gemma":[0.60277426,0.00035567896,0.38192394,0.00009751406,0.00014543206,0.000116569994,0.0028143034,0.00035045968,0.011421848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879956,0.00022009398,0.0001710219,0.00029211736,0.00029345736,0.00022374232],"domain_scores_gemma":[0.9963252,0.0014781,0.00054449326,0.0006255023,0.0007265766,0.00030023782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073061447,0.00071998435,0.0011987123,0.0017162103,0.00083984877,0.0020378092,0.00093470834,0.00056233193,0.006747738],"category_scores_gemma":[0.0054217675,0.0003107876,0.00066990504,0.0012648416,0.00078358734,0.0030690548,0.0011325517,0.000575047,0.0023230442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019268598,0.00036738973,0.007935417,0.0012058485,0.00012376654,0.0013181046,0.0012830463,0.04879247,0.09144631,0.10396897,0.015018567,0.7266133],"study_design_scores_gemma":[0.00029469255,0.0017560283,0.0043678526,0.00025493765,0.00020796494,0.0018344189,0.0022560037,0.38261616,0.12513895,0.4360297,0.044979844,0.0002634299],"about_ca_topic_score_codex":0.0009669713,"about_ca_topic_score_gemma":0.0025451353,"teacher_disagreement_score":0.006747738,"about_ca_system_score_codex":0.00046801186,"about_ca_system_score_gemma":0.00089084834,"threshold_uncertainty_score":0.022573471},"labels":[],"label_agreement":null},{"id":"W4387872170","doi":"10.1016/j.ipl.2023.106455","title":"Deterministic treasure hunt and rendezvous in arbitrary connected graphs","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Treasure; Rendezvous; Traverse; Time complexity; Computer science; Algorithm; Node (physics); Connectivity; Combinatorics; Mathematics; Graph; Discrete mathematics; Theoretical computer science","score_opus":0.01283665702480478,"score_gpt":0.23167264811662977,"score_spread":0.218835991091825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387872170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5889347,0.0010330473,0.36300805,0.002366001,0.00022792297,0.00016831,0.0006453889,0.0006772784,0.04293937],"genre_scores_gemma":[0.9626957,0.00035511455,0.021901522,0.00019015564,0.00004716567,0.00008868107,0.00026494171,0.00017621172,0.014280523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991855,0.00024251635,0.000029838084,0.00019743365,0.00012665661,0.00021801685],"domain_scores_gemma":[0.99287754,0.0052291984,0.0005332571,0.0005495924,0.00024898688,0.00056136504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009159305,0.0007272388,0.0018204491,0.0012183007,0.0017608847,0.0023745245,0.0026053651,0.002569356,0.0071164607],"category_scores_gemma":[0.010497676,0.0010143656,0.0011306459,0.0016251829,0.0032056663,0.0040520453,0.0031961587,0.0021929627,0.000661219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000731273,0.00009278977,0.0010890376,0.00018773567,0.00010628462,0.0004598803,0.00031261734,0.5292956,0.0024211318,0.4470129,0.0049377615,0.013352997],"study_design_scores_gemma":[0.00007281315,0.00004276988,0.00029230805,0.000020324827,0.000021380543,0.00009772725,0.00012225767,0.6220347,0.00079112704,0.3755867,0.0008888313,0.000029018505],"about_ca_topic_score_codex":0.005110996,"about_ca_topic_score_gemma":0.005728913,"teacher_disagreement_score":0.0071164607,"about_ca_system_score_codex":0.0014921025,"about_ca_system_score_gemma":0.0010435539,"threshold_uncertainty_score":0.02380693},"labels":[],"label_agreement":null},{"id":"W4406309980","doi":"10.1016/j.ipl.2025.106557","title":"String searching with mismatches using AVX2 and AVX-512 instructions","year":2025,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sheridan College","funders":"","keywords":"Computer science; String (physics); Programming language; Parallel computing; Algorithm; Theoretical computer science; Arithmetic; Physics; Mathematics; Theoretical physics","score_opus":0.0071819911603793075,"score_gpt":0.22879901375158454,"score_spread":0.22161702259120522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406309980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074817374,0.0006084787,0.9093702,0.00029184716,0.00016328575,0.0001559057,0.00047354464,0.0074313153,0.0066880626],"genre_scores_gemma":[0.2842892,0.00018353322,0.70598763,0.00026020818,0.000049959275,0.00019775111,0.0020388495,0.00042986058,0.006562957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749494,0.00027631002,0.00038822522,0.0004944908,0.0011595871,0.00018646783],"domain_scores_gemma":[0.99755245,0.00054297794,0.00022064331,0.001164237,0.0004521911,0.00006746224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094989466,0.0007698811,0.00092579983,0.0016286821,0.00086761557,0.0016891451,0.0020824147,0.0011098847,0.0053914106],"category_scores_gemma":[0.0067657065,0.00049701636,0.00061175675,0.0031529705,0.00069588074,0.00342306,0.0026231296,0.00088710064,0.0018785275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009137053,0.00020725679,0.0053607393,0.00021630609,0.00008874975,0.00021798142,0.00026985302,0.046454776,0.029596712,0.03776659,0.01042764,0.86847967],"study_design_scores_gemma":[0.00017928044,0.000453556,0.0021666887,0.0000727179,0.000051585022,0.0008988882,0.00032413224,0.7872893,0.102793686,0.07663816,0.029034698,0.00009723384],"about_ca_topic_score_codex":0.002599329,"about_ca_topic_score_gemma":0.0028901622,"teacher_disagreement_score":0.0053914106,"about_ca_system_score_codex":0.0009885771,"about_ca_system_score_gemma":0.001737691,"threshold_uncertainty_score":0.018036067},"labels":[],"label_agreement":null},{"id":"W4406660008","doi":"10.1016/j.ipl.2025.106560","title":"Total variation distance for product distributions is <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"> <mml:mi mathvariant=\"normal\">#</mml:mi> <mml:mi mathvariant=\"sans-serif\">P</mml:mi> </mml:math> -complete","year":2025,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Research Foundation Singapore; Science and Engineering Research Board; Amazon Web Services; National Science Foundation","keywords":"Product (mathematics); Variation (astronomy); Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.012970238517820323,"score_gpt":0.2337184539889568,"score_spread":0.2207482154711365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406660008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011146539,0.0010776347,0.9633771,0.0007950715,0.00022624175,0.000059232225,0.0020730908,0.0014947429,0.01975039],"genre_scores_gemma":[0.43569055,0.0050460612,0.4415173,0.0011436135,0.00092446397,0.0005465099,0.018194376,0.005037099,0.091900036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709034,0.0006852851,0.00021362757,0.0007307746,0.0010370217,0.00024291864],"domain_scores_gemma":[0.99330115,0.003110066,0.00034379837,0.0017827428,0.0012485827,0.00021360202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025524357,0.001095989,0.00096480956,0.003083903,0.0007720606,0.0030931528,0.0018491864,0.001022491,0.019714493],"category_scores_gemma":[0.013630494,0.00044298213,0.0011990269,0.0031715082,0.0016824212,0.004258787,0.001962656,0.0016097579,0.010735229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021784905,0.00009487551,0.0013655118,0.00035930992,0.00011775691,0.00018468694,0.00020576475,0.025025051,0.0032847235,0.64550894,0.044458386,0.27917713],"study_design_scores_gemma":[0.0000275195,0.00014503066,0.0028311866,0.00008609696,0.00004002605,0.00085492677,0.00011649451,0.1784893,0.0072343512,0.74603015,0.064054534,0.000090297355],"about_ca_topic_score_codex":0.0027126702,"about_ca_topic_score_gemma":0.0027351205,"teacher_disagreement_score":0.019714493,"about_ca_system_score_codex":0.0012888507,"about_ca_system_score_gemma":0.0013983279,"threshold_uncertainty_score":0.065951586},"labels":[],"label_agreement":null},{"id":"W4408059813","doi":"10.1016/j.ipl.2025.106572","title":"A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees","year":2025,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Simple (philosophy); Binary number; Mathematics; Binary tree; Algorithm; Combinatorics; Weight-balanced tree; Tree (set theory); Binary search tree; Arithmetic","score_opus":0.015516512004594286,"score_gpt":0.2570153997252107,"score_spread":0.24149888772061642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408059813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028733103,0.00040688703,0.9590368,0.00073355634,0.00012123543,0.0003418362,0.0004109264,0.0027448693,0.0074708727],"genre_scores_gemma":[0.11636829,0.00014499949,0.8791697,0.00024200129,0.0000650749,0.0003452429,0.0008680526,0.00029269815,0.0025039478],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983321,0.00028243006,0.000108494474,0.00036559242,0.0004906862,0.00042064482],"domain_scores_gemma":[0.9974674,0.0013601586,0.00021497264,0.00047491607,0.00033560148,0.00014699185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629024,0.0014667223,0.0014425946,0.0011285567,0.001147165,0.0020523074,0.0022849622,0.0017338177,0.010309657],"category_scores_gemma":[0.0053705787,0.00075150974,0.0014996199,0.002245893,0.0007508944,0.0037099875,0.002536806,0.0034096988,0.0026712704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010692463,0.00076245755,0.0015835383,0.00063564157,0.00011515054,0.00031542088,0.00055669044,0.3354999,0.015897874,0.075222336,0.027206559,0.5411352],"study_design_scores_gemma":[0.0002722035,0.00013945234,0.00025949674,0.000051925836,0.000035321435,0.00021635083,0.00016381353,0.9012407,0.0042446284,0.08606655,0.007280682,0.000028820217],"about_ca_topic_score_codex":0.0028023391,"about_ca_topic_score_gemma":0.0042227902,"teacher_disagreement_score":0.010309657,"about_ca_system_score_codex":0.002023998,"about_ca_system_score_gemma":0.0028713017,"threshold_uncertainty_score":0.034489274},"labels":[],"label_agreement":null}]}