{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34947217,0.00008658624,0.64451563,0.004831857,0.00005299733,0.00005385003,0.00000155413,0.00008885411,0.0008964755],"genre_scores_gemma":[0.9916698,0.0000020639488,0.0069948127,0.0013111844,0.000007966822,0.0000020962161,0.0000019554582,0.0000010960256,0.000009028364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995706,0.000011159843,0.00017967648,0.00003804545,0.00011479958,0.00008568558],"domain_scores_gemma":[0.9996824,0.000030107594,0.0001388567,0.00010358899,0.000034501583,0.000010502068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020205646,0.000040182855,0.00004152971,0.000032208365,0.0001541034,0.00025182244,0.00020110607,0.000007834926,3.8760768e-7],"category_scores_gemma":[0.0000072088233,0.00002716898,0.000009715919,0.00010641405,0.0001384422,0.0014564337,0.000049537568,0.00003273878,0.0000034787367],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007534363,0.000011148345,0.0004948795,0.00012370739,0.000005368018,6.0502776e-7,0.003499109,0.00082143873,0.0029071905,0.13272768,0.0038802193,0.85552114],"study_design_scores_gemma":[0.00075048435,0.000032791664,0.04747141,0.0001022287,0.00000526497,0.000037862024,0.0002386179,0.7434259,0.013066794,0.16691554,0.027598485,0.0003546078],"about_ca_topic_score_codex":0.000028158218,"about_ca_topic_score_gemma":0.000001346844,"teacher_disagreement_score":0.8551665,"about_ca_system_score_codex":0.000006663359,"about_ca_system_score_gemma":0.00001233311,"threshold_uncertainty_score":0.24283297},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11589263,0.000035451973,0.87727225,0.0059939018,0.00016386747,0.00006301468,0.0000031497084,0.00016588748,0.00040987946],"genre_scores_gemma":[0.9509046,0.00002240728,0.04437689,0.0045903637,0.000053926255,0.000010348461,0.000005357744,0.0000044883773,0.00003162282],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992023,0.000012628009,0.00023860107,0.00013863509,0.00022238363,0.00018547091],"domain_scores_gemma":[0.99949783,0.00003570878,0.00015594174,0.00020426816,0.00004340253,0.00006284626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019465153,0.00010089253,0.00008394826,0.00012493045,0.00018092174,0.00041301828,0.0003583692,0.000038678303,0.000006811563],"category_scores_gemma":[0.000031049378,0.000065787804,0.000014420266,0.00016964272,0.00004478484,0.0068965806,0.00017912178,0.000063369,0.00006340445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042041966,0.00000586652,0.0005027805,0.000037029793,0.0000035248363,0.0000016138524,0.0024613168,0.0000072883054,0.003132937,0.001085175,0.0029782017,0.98978007],"study_design_scores_gemma":[0.009842822,0.00033708703,0.046640787,0.0033335253,0.000056783392,0.0006787662,0.0008896582,0.43302733,0.035987567,0.009744603,0.45543838,0.004022692],"about_ca_topic_score_codex":0.0000047230665,"about_ca_topic_score_gemma":1.5814567e-7,"teacher_disagreement_score":0.98575735,"about_ca_system_score_codex":0.00003133507,"about_ca_system_score_gemma":0.000032533342,"threshold_uncertainty_score":0.49998543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015240081,0.00057085167,0.99319005,0.0027469315,0.00044707075,0.0009963202,0.00009250111,0.00038283825,0.000049411297],"genre_scores_gemma":[0.0861328,0.00007253256,0.9103984,0.002081609,0.00020944122,0.000354984,0.0006938012,0.00005096389,0.0000054545717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984697,0.000031108288,0.0008135736,0.00019302453,0.00028847368,0.0002041128],"domain_scores_gemma":[0.99883294,0.000106082975,0.0005266469,0.00018612233,0.000285323,0.00006290921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045755113,0.00032114272,0.000424765,0.00017907986,0.00018978758,0.00041418296,0.00026125018,0.00027665927,0.0000031976367],"category_scores_gemma":[0.00022398468,0.00026498223,0.00010167741,0.00021754943,0.00016680459,0.0007300365,0.00008640194,0.0005823064,0.0000033620165],"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.000033805296,0.0000074080235,0.0000039845986,0.0040653376,0.00009676947,1.9127293e-7,0.010780506,0.8881482,0.00014863735,0.00020185871,0.00020576346,0.096307546],"study_design_scores_gemma":[0.0020249798,0.0000082018605,0.000008661323,0.00031086412,0.00008635468,0.000004190645,0.0005523868,0.99418724,0.0021120643,0.00023855685,0.00017829594,0.00028822402],"about_ca_topic_score_codex":0.0000048236134,"about_ca_topic_score_gemma":4.473604e-7,"teacher_disagreement_score":0.10603903,"about_ca_system_score_codex":0.000051244067,"about_ca_system_score_gemma":0.000093818584,"threshold_uncertainty_score":0.9999802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14821163,0.0000099965455,0.8425127,0.008079848,0.00011599051,0.00009800891,0.0000010778874,0.0005920379,0.00037868356],"genre_scores_gemma":[0.8167487,2.8130347e-7,0.17602521,0.0070972503,0.00008868563,0.0000058908927,0.000019037972,0.000008400717,0.000006542054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989783,0.000016595168,0.0002701733,0.00015820419,0.0003278653,0.00024883696],"domain_scores_gemma":[0.9994465,0.000020656775,0.00021953518,0.00015430935,0.000092192065,0.00006676665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014555114,0.0001475876,0.00011388237,0.00017995012,0.00028202755,0.0005594577,0.0003656014,0.000036770576,0.0000014489835],"category_scores_gemma":[0.0000104761775,0.00012040939,0.000028780778,0.00045075692,0.00004865554,0.0025513647,0.00006344328,0.00016046087,0.00014657748],"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.00003242913,0.000034748522,0.000026920809,0.00008868105,0.000014986928,0.000010941073,0.007817151,0.73214924,0.0008834977,0.0003961406,0.0032739488,0.2552713],"study_design_scores_gemma":[0.0008801264,0.00010348428,0.00058324507,0.00011834587,0.000004330478,0.00011583947,0.000028416693,0.9943114,0.00044633585,0.00017839068,0.0029688673,0.0002612259],"about_ca_topic_score_codex":0.000019711273,"about_ca_topic_score_gemma":5.195529e-7,"teacher_disagreement_score":0.6685371,"about_ca_system_score_codex":0.00006157121,"about_ca_system_score_gemma":0.00013243439,"threshold_uncertainty_score":0.53948635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063389037,0.000027495425,0.9895304,0.002903265,0.0003189896,0.0004103756,0.0000062222584,0.00015402237,0.00031031994],"genre_scores_gemma":[0.10305355,0.000004238525,0.8864072,0.010274285,0.00009438381,0.00009168787,0.000041133742,0.000011817224,0.000021733307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847406,0.000014496419,0.00059456745,0.00018458522,0.0002720366,0.0004602617],"domain_scores_gemma":[0.9992624,0.000066514636,0.000252311,0.00021380905,0.00012093072,0.00008402501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091616076,0.00015839971,0.0001490416,0.00036148474,0.00020280275,0.00051651616,0.0005283037,0.000065576554,0.000004219105],"category_scores_gemma":[0.00002403122,0.00015587013,0.00006227254,0.00063766417,0.000048117425,0.0036412086,0.00009959189,0.00018526179,0.000015068132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009200327,0.000025494837,0.0000543631,0.00008771731,0.000006335837,0.000001783403,0.0042455043,0.00013131236,0.00089620036,0.0005458027,0.00088034495,0.99311596],"study_design_scores_gemma":[0.0014515442,0.00007908234,0.0009386492,0.00015667925,0.0000048924844,0.000022428767,0.00031770693,0.9687629,0.0058465046,0.0020211765,0.020011133,0.000387336],"about_ca_topic_score_codex":0.00001968905,"about_ca_topic_score_gemma":0.000008310426,"teacher_disagreement_score":0.9927286,"about_ca_system_score_codex":0.00012979156,"about_ca_system_score_gemma":0.00006835881,"threshold_uncertainty_score":0.63562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47313267,0.000031216696,0.51460814,0.010809574,0.00050393224,0.00016948787,0.0000014035251,0.00019937352,0.00054415915],"genre_scores_gemma":[0.86965156,0.0000037825412,0.09729653,0.03296319,0.00005827613,0.000012061278,0.000003693362,0.0000062379727,0.0000046686796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904716,0.000015253022,0.00025891513,0.00013684231,0.0003094346,0.0002323951],"domain_scores_gemma":[0.99939686,0.000030815143,0.00011831108,0.00028070624,0.0000841623,0.00008913548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022995882,0.00012030886,0.00009571933,0.0003356046,0.0002428149,0.0004202412,0.00047201893,0.000039866958,0.000009218546],"category_scores_gemma":[0.00006836635,0.000105892635,0.000047854384,0.00060156896,0.00004729778,0.0022849103,0.000074498865,0.00019232956,0.00013764489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007948464,0.0002705773,0.0040687323,0.0022324321,0.000095332056,0.000023895434,0.03597381,0.015268616,0.25078878,0.048924208,0.025496883,0.61677724],"study_design_scores_gemma":[0.0034662657,0.0006932169,0.048761155,0.0048931893,0.00012415343,0.00057233917,0.0009091805,0.53962684,0.23807155,0.008423945,0.14950563,0.0049525145],"about_ca_topic_score_codex":0.000011291694,"about_ca_topic_score_gemma":0.0000023368418,"teacher_disagreement_score":0.61182475,"about_ca_system_score_codex":0.00001548122,"about_ca_system_score_gemma":0.00004375289,"threshold_uncertainty_score":0.43181762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027831504,0.000014497211,0.9806233,0.014045502,0.00012853945,0.0001521453,9.619714e-7,0.00036075994,0.001891144],"genre_scores_gemma":[0.8133296,0.000009370269,0.1706893,0.015681276,0.00004005836,0.00004852412,0.000020615214,0.000009482251,0.00017180291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.000024385256,0.00024377256,0.0001321099,0.00031647805,0.00027219733],"domain_scores_gemma":[0.99929523,0.00000849706,0.00017669077,0.00024761262,0.00016912598,0.000102821294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018236195,0.00012103622,0.00009545462,0.0002469417,0.0001881983,0.0008709763,0.0005447038,0.00004380798,0.000011594945],"category_scores_gemma":[0.00003730012,0.000109469256,0.000032368996,0.00045641256,0.00004436968,0.005991455,0.00010349857,0.00013465903,0.000050340055],"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.000023142635,0.00011864506,0.00068070606,0.0004285962,0.000035155706,0.000023828328,0.14540216,0.013229743,0.0011430068,0.014948903,0.010850443,0.81311566],"study_design_scores_gemma":[0.0014797873,0.00015330978,0.0015694927,0.00020060218,0.000010425459,0.000075838245,0.0012014658,0.9712354,0.005835868,0.0014566868,0.015917525,0.00086357776],"about_ca_topic_score_codex":0.000013935185,"about_ca_topic_score_gemma":0.0000017928348,"teacher_disagreement_score":0.95800567,"about_ca_system_score_codex":0.00004105688,"about_ca_system_score_gemma":0.00007358736,"threshold_uncertainty_score":0.83988446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21061125,0.000011190445,0.7759774,0.011211536,0.00015202354,0.000082819424,0.000001042888,0.00013262258,0.0018201409],"genre_scores_gemma":[0.9671886,0.0000012144926,0.0030984003,0.02965492,0.000039422503,0.0000035926214,0.000004825811,0.0000022362985,0.000006817941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936056,0.00001457662,0.00017267003,0.00007268322,0.00018640242,0.00019307733],"domain_scores_gemma":[0.9996065,0.00009128068,0.00011092195,0.00013206068,0.00002174163,0.00003751747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039661347,0.00007202821,0.00004600768,0.00008181885,0.00020116667,0.00039867655,0.00021527031,0.000025926505,0.0000058347155],"category_scores_gemma":[0.0000325636,0.000049684397,0.000015470649,0.0001732844,0.000050660597,0.0019398704,0.00003839514,0.00009690038,0.000025663645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021537111,0.0000133394615,0.00016197634,0.00005625524,0.0000056496483,0.0000043653235,0.012248494,0.00012595959,0.0024720686,0.051487267,0.0057529123,0.92765015],"study_design_scores_gemma":[0.0029005639,0.00022870187,0.19015642,0.0009466009,0.000031121286,0.00030749966,0.0027074493,0.59059286,0.0418591,0.021785466,0.14672722,0.0017570297],"about_ca_topic_score_codex":0.0000027089354,"about_ca_topic_score_gemma":4.0789882e-7,"teacher_disagreement_score":0.9258931,"about_ca_system_score_codex":0.000031205014,"about_ca_system_score_gemma":0.000016411204,"threshold_uncertainty_score":0.3844447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06702804,0.000003449625,0.9277705,0.0039941943,0.00026959076,0.00015849576,0.000004731499,0.00015345457,0.0006175468],"genre_scores_gemma":[0.9178117,2.9201976e-7,0.07720334,0.004802583,0.000069371505,0.00004451856,0.000060342594,0.0000037507175,0.000004109259],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915266,0.00001681761,0.00031255776,0.00011589072,0.00018450634,0.00021754022],"domain_scores_gemma":[0.9993939,0.0000572396,0.00018372023,0.00017697523,0.00013913208,0.00004904713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036320018,0.00009675124,0.00008512073,0.00015677276,0.00031139178,0.00076708425,0.00035562695,0.000027503515,0.0000037623745],"category_scores_gemma":[0.00013452428,0.00009039866,0.000051371866,0.00031795664,0.000039908708,0.0026593453,0.000041604966,0.0000758849,0.000007242492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112306,0.00002482768,0.0005119817,0.00017995416,0.000014265439,2.0468526e-7,0.009974773,0.00014857802,0.0007466664,0.11809841,0.018137228,0.8521519],"study_design_scores_gemma":[0.002361857,0.00018026598,0.0045669773,0.00012889446,0.000025710438,0.000024095469,0.0010151283,0.44117418,0.002007555,0.020812785,0.52683663,0.0008659622],"about_ca_topic_score_codex":0.000021230524,"about_ca_topic_score_gemma":0.0000032918276,"teacher_disagreement_score":0.85128593,"about_ca_system_score_codex":0.000036976428,"about_ca_system_score_gemma":0.000038891743,"threshold_uncertainty_score":0.7397011},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7722051,0.00003708645,0.20879315,0.0141494665,0.0000702226,0.00014662658,3.3904652e-7,0.00013020315,0.0044677695],"genre_scores_gemma":[0.9842021,0.0000017874928,0.0012649855,0.014482409,0.000032314794,0.000008632243,0.0000030943627,0.0000019069212,0.0000028044815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992229,0.00010506388,0.00021391409,0.00008025718,0.00022089538,0.00015701618],"domain_scores_gemma":[0.9995775,0.0001130096,0.0000812732,0.00019400862,0.00002211579,0.00001208838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042594,0.00007727794,0.00005141154,0.00009347174,0.00043109595,0.0007031081,0.0006506111,0.000019924453,0.000011953606],"category_scores_gemma":[0.000017160492,0.00004618257,0.000036906633,0.0005793081,0.000057506328,0.0020915985,0.000024520992,0.0001499529,0.00005064562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006228231,0.000010879293,0.000501916,0.0000228578,0.0000025145341,0.0000010382715,0.053453732,0.00775838,0.000074573196,0.006818657,0.00051293225,0.93083626],"study_design_scores_gemma":[0.0010138525,0.00007858734,0.09043026,0.00025101667,0.000016904,0.00016555985,0.004697525,0.85018677,0.00045374347,0.011252392,0.040817708,0.00063569495],"about_ca_topic_score_codex":0.000009372001,"about_ca_topic_score_gemma":0.0000013683189,"teacher_disagreement_score":0.9302006,"about_ca_system_score_codex":0.000015387455,"about_ca_system_score_gemma":0.00001966393,"threshold_uncertainty_score":0.67800874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39680186,0.0000054564293,0.5994839,0.0026874137,0.00009001303,0.00010871177,0.0000019967472,0.0000708365,0.00074977335],"genre_scores_gemma":[0.9955462,1.9768873e-7,0.002442606,0.0019803175,0.000011261674,0.0000032063251,0.000004880036,0.0000027900155,0.000008512005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920917,0.000040578147,0.00022240465,0.00007882969,0.00030572774,0.00014331412],"domain_scores_gemma":[0.9994123,0.00008153741,0.000178197,0.00022087325,0.00009208387,0.000014981049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016477692,0.000076376215,0.00006006441,0.00023270662,0.00015298229,0.00015032198,0.00044381883,0.000026476504,0.000007704137],"category_scores_gemma":[0.000045008524,0.000051654515,0.00003286869,0.0005677937,0.00008694708,0.0018281091,0.000044700468,0.00014804603,0.000008465072],"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.000039631806,0.000019019673,0.00025042286,0.00009927067,0.000009610649,8.398053e-7,0.0027728984,0.01670921,0.052126527,0.84111094,0.0032271938,0.08363444],"study_design_scores_gemma":[0.00079585373,0.00014470951,0.003933933,0.00021204467,0.000006386315,0.000032862103,0.0005238012,0.08941629,0.18979385,0.71179163,0.0028877843,0.00046086148],"about_ca_topic_score_codex":0.000013018918,"about_ca_topic_score_gemma":0.0000020925095,"teacher_disagreement_score":0.59874433,"about_ca_system_score_codex":0.00003275544,"about_ca_system_score_gemma":0.000021418353,"threshold_uncertainty_score":0.210641},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0917272,0.000118223616,0.88771176,0.012458797,0.0014759316,0.00023363972,0.0000025071186,0.0007389106,0.0055330493],"genre_scores_gemma":[0.9766152,0.0000033266745,0.0026647171,0.020593382,0.00007020351,0.000010345304,0.0000082897695,0.0000037785935,0.000030747462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987307,0.000033073342,0.000448989,0.0001620639,0.00033710527,0.0002880366],"domain_scores_gemma":[0.9991332,0.00001564011,0.0003403026,0.00027950585,0.00015070158,0.00008064036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027053786,0.00015498207,0.00015295162,0.00026783158,0.0002964957,0.00084452913,0.000500467,0.00006868154,0.000006462099],"category_scores_gemma":[0.0000178941,0.00014088069,0.000083205574,0.000547448,0.00002622402,0.0049997186,0.00003158125,0.00016186264,0.000099928526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004899506,0.000121480334,0.0026595253,0.00028224417,0.00005347736,0.000028999879,0.023367016,0.010021196,0.0031696372,0.09491909,0.20164941,0.66367894],"study_design_scores_gemma":[0.0046457094,0.00060589967,0.055656455,0.0015720206,0.000044622815,0.00082444545,0.002464675,0.6368509,0.0045910124,0.023240466,0.26573497,0.0037688438],"about_ca_topic_score_codex":0.000016262426,"about_ca_topic_score_gemma":0.0000026906773,"teacher_disagreement_score":0.885047,"about_ca_system_score_codex":0.000051166175,"about_ca_system_score_gemma":0.000031263444,"threshold_uncertainty_score":0.81438136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05546614,0.000075933836,0.9351161,0.007359612,0.0003101541,0.00027854706,0.0006934431,0.00040792112,0.00029211844],"genre_scores_gemma":[0.2787158,0.000024507162,0.67090595,0.022585563,0.00051635795,0.00021690414,0.026974836,0.000033643657,0.00002642223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832207,0.000025712714,0.000529285,0.00033838855,0.00038942913,0.00039511558],"domain_scores_gemma":[0.99820054,0.000096236225,0.0003890876,0.0010776774,0.000107696294,0.00012877633],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021308007,0.00019658095,0.00016077209,0.00007555139,0.0003407216,0.0016833323,0.0017173729,0.00006829967,0.000046931807],"category_scores_gemma":[0.000062837826,0.00018486867,0.000027763364,0.0004540899,0.000048713704,0.010048699,0.000578495,0.00016302237,0.00021031885],"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.0000012176812,0.000022102704,0.001043113,0.000022841867,0.000022087765,0.0000010520516,0.001201973,0.00077687454,0.000118284624,0.00013123515,0.26329875,0.73336047],"study_design_scores_gemma":[0.00032913516,0.000008693269,0.012832004,0.00013810044,0.0000136460785,0.0000052206647,0.00014779794,0.90380555,0.00008131885,0.00025189752,0.08206351,0.00032312542],"about_ca_topic_score_codex":0.0004447568,"about_ca_topic_score_gemma":0.000008349013,"teacher_disagreement_score":0.90302867,"about_ca_system_score_codex":0.00007150385,"about_ca_system_score_gemma":0.000075916076,"threshold_uncertainty_score":0.999353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13230817,0.000009342842,0.8638149,0.0031179457,0.00004978589,0.00008325688,0.00000589967,0.000107663516,0.0005030527],"genre_scores_gemma":[0.9937991,0.000001967334,0.0038370886,0.0022931928,0.000013489701,0.000016963,0.000024169303,0.0000025116349,0.000011534425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993365,0.000009983026,0.00025102525,0.00008218946,0.0002164467,0.000103878294],"domain_scores_gemma":[0.99949265,0.000015242426,0.00017977809,0.00023233422,0.00005245154,0.000027559783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006232429,0.00006934217,0.00006260592,0.00012073398,0.00010115812,0.00015868913,0.0002834412,0.000023203607,0.000021149142],"category_scores_gemma":[0.000012499585,0.00006615743,0.000024688396,0.00022057751,0.000017510854,0.00177008,0.00002771217,0.00006509983,0.00015440365],"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.000004016792,0.00013367298,0.00040284012,0.0002689578,0.000014340449,0.0000019378638,0.0103277,0.01007572,0.018242514,0.027130596,0.011100442,0.92229724],"study_design_scores_gemma":[0.00051656074,0.000052700463,0.0021590714,0.00010728808,0.0000071941927,0.000017949438,0.000051721374,0.96356446,0.02397595,0.0003295425,0.008937902,0.00027968126],"about_ca_topic_score_codex":0.00000599779,"about_ca_topic_score_gemma":2.9196343e-7,"teacher_disagreement_score":0.9534887,"about_ca_system_score_codex":0.000022933853,"about_ca_system_score_gemma":0.000008403581,"threshold_uncertainty_score":0.2697822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4542188,0.000040646544,0.5420766,0.00091516995,0.00025208565,0.00017662792,0.0000147541205,0.0009879478,0.0013173838],"genre_scores_gemma":[0.7745441,0.000010714129,0.2224699,0.0025643737,0.0001563839,0.000029396817,0.00017780774,0.000035873974,0.000011433423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987089,0.0000063757134,0.00044310853,0.00013337703,0.00034260328,0.00036562825],"domain_scores_gemma":[0.99946916,0.000017301105,0.00012655678,0.00014638071,0.00013935326,0.00010124786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015128058,0.00024319808,0.00016040744,0.00029404092,0.00020525786,0.00025082775,0.00019248687,0.000084755295,0.000014097247],"category_scores_gemma":[0.00005737409,0.0002411899,0.000047500645,0.0004859544,0.00004926681,0.002084718,0.000020412213,0.00033096064,0.00013164835],"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.000013410386,0.000018325667,0.000031031035,0.00011970889,0.000014616904,0.0000014514476,0.0024730547,0.98623466,0.00013787963,0.000060375995,0.000030173353,0.010865295],"study_design_scores_gemma":[0.0015764697,0.000039333925,0.00011564039,0.00036105732,0.00001714175,0.000020064323,0.0009934425,0.988843,0.007060302,0.000043285643,0.0004913285,0.00043890785],"about_ca_topic_score_codex":0.0000045754186,"about_ca_topic_score_gemma":0.0000010291428,"teacher_disagreement_score":0.32032531,"about_ca_system_score_codex":0.00021069146,"about_ca_system_score_gemma":0.00007060577,"threshold_uncertainty_score":0.9835439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11089899,0.00002062761,0.8805165,0.004914372,0.00022096005,0.00016083877,0.0000013566555,0.00017660222,0.0030897232],"genre_scores_gemma":[0.85604966,0.0000026132986,0.13415678,0.009703055,0.000047503872,0.000010949495,0.000010665561,0.00000491303,0.000013837461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873734,0.000015011359,0.00045668273,0.00012350269,0.00032956162,0.00033793366],"domain_scores_gemma":[0.9994834,0.000022799357,0.00018798998,0.00018147368,0.000058717964,0.00006559883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066243485,0.00011009627,0.00009678798,0.0003772963,0.00013755445,0.0004547023,0.00049395225,0.000038065165,0.000006816019],"category_scores_gemma":[0.000016719763,0.000108598724,0.000031315845,0.000793629,0.0000371616,0.004463047,0.00010546722,0.00017976294,0.00007470835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021940134,0.00006263261,0.005916839,0.00022084576,0.000011086343,0.00002158447,0.022129074,0.0012336638,0.0015568793,0.004113081,0.0038101238,0.9609023],"study_design_scores_gemma":[0.007815895,0.00027567914,0.119413115,0.002126302,0.000021282483,0.00037731073,0.0033572968,0.5984618,0.035305765,0.030371493,0.19912188,0.0033521657],"about_ca_topic_score_codex":0.000016243286,"about_ca_topic_score_gemma":0.0000072970147,"teacher_disagreement_score":0.9575501,"about_ca_system_score_codex":0.00007797972,"about_ca_system_score_gemma":0.0000389622,"threshold_uncertainty_score":0.44285277},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060921386,0.000019775965,0.9752547,0.015176122,0.00027991188,0.00023709296,5.334801e-7,0.00077043095,0.0021692754],"genre_scores_gemma":[0.9063312,0.0000014037616,0.09048315,0.002885533,0.000021829319,0.000058143884,0.000010084991,0.000006764216,0.00020187724],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986607,0.000033717894,0.00039809832,0.00020360811,0.00041065173,0.00029325584],"domain_scores_gemma":[0.9990957,0.000033178156,0.00028279133,0.00042006213,0.00008020216,0.00008807869],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00015125534,0.00017700059,0.0001288748,0.000267087,0.00019974196,0.0010663603,0.00056625344,0.000077806035,0.00006707586],"category_scores_gemma":[0.0001256397,0.0001550285,0.000054055614,0.0004903569,0.000060640763,0.0033079402,0.000052133866,0.00015268444,0.00015816775],"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.00001879472,0.00006738297,0.00056727347,0.00023943759,0.000021515476,0.0000026807534,0.0020337065,0.0014787947,0.0038331642,0.45346138,0.034815487,0.5034604],"study_design_scores_gemma":[0.0066084564,0.00027355095,0.006397063,0.0004001215,0.00007084514,0.00004452365,0.0006231376,0.11487887,0.08724255,0.062691264,0.71820176,0.0025678305],"about_ca_topic_score_codex":0.0000052933415,"about_ca_topic_score_gemma":6.533801e-7,"teacher_disagreement_score":0.90023905,"about_ca_system_score_codex":0.00013428369,"about_ca_system_score_gemma":0.00025510683,"threshold_uncertainty_score":0.9999706},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5044126,0.00002277958,0.49511874,0.00015850014,0.00006168403,0.00008780233,0.0000016057808,0.00007149995,0.00006479863],"genre_scores_gemma":[0.9262652,9.598442e-7,0.07289834,0.00079798885,0.000020200987,0.0000024808226,0.0000102780095,0.0000035986202,9.5032453e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820215,0.00006169483,0.0008283383,0.00026298623,0.0003870403,0.0002578248],"domain_scores_gemma":[0.99864143,0.000119772216,0.0004956586,0.0004226306,0.00022640673,0.000094085604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012236569,0.00016783681,0.00028482545,0.00085138064,0.00022616745,0.0002372645,0.00031934,0.00007482355,0.0000047688045],"category_scores_gemma":[0.00006885119,0.00015833414,0.000089002024,0.0018931091,0.00012718457,0.0041715386,0.00024359132,0.0001407973,0.0000015917644],"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.000084603,0.00022591154,0.07689373,0.00063455635,0.00025769058,0.00012757919,0.017300075,0.08924661,0.010327927,0.00029868374,0.000044265587,0.8045584],"study_design_scores_gemma":[0.00026240473,0.00002753602,0.11481283,0.000025369998,0.0000634872,0.000113717084,0.00009701268,0.8829665,0.0012698569,0.00012918023,0.00005253021,0.0001795343],"about_ca_topic_score_codex":0.000121253375,"about_ca_topic_score_gemma":0.000020608399,"teacher_disagreement_score":0.8043788,"about_ca_system_score_codex":0.00013186723,"about_ca_system_score_gemma":0.00006447944,"threshold_uncertainty_score":0.64566785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053187087,0.0000047348726,0.9379524,0.0064828875,0.0013132921,0.00008849589,0.000001879925,0.00028268973,0.0006865368],"genre_scores_gemma":[0.97074115,4.124381e-7,0.02222775,0.0068457793,0.00012700947,0.000017350296,0.000024012104,0.0000040507052,0.000012512705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.000016564842,0.00039766522,0.000119174176,0.00023355514,0.00023049949],"domain_scores_gemma":[0.999326,0.000021893025,0.00021169767,0.00021342517,0.0001745074,0.00005247332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029232062,0.00011245173,0.00010467613,0.000118409946,0.00028032268,0.0008642741,0.0004499764,0.000065180284,0.0000075719613],"category_scores_gemma":[0.00003788271,0.00009879375,0.00003617209,0.00036165735,0.00002820485,0.003797554,0.000064077976,0.00022977764,0.0001151798],"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.00002367374,0.00004343665,0.0014268683,0.0004840318,0.000053710108,0.000017706665,0.018419605,0.013864163,0.0128347315,0.1622574,0.038153682,0.75242096],"study_design_scores_gemma":[0.0005015944,0.000014345437,0.0015330769,0.00013893524,0.0000036121596,0.00016436233,0.00018211798,0.74417585,0.0026644287,0.0004882983,0.24966012,0.0004732546],"about_ca_topic_score_codex":0.000012580313,"about_ca_topic_score_gemma":0.0000048841634,"teacher_disagreement_score":0.917554,"about_ca_system_score_codex":0.000044375647,"about_ca_system_score_gemma":0.00007672142,"threshold_uncertainty_score":0.8334215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015893996,0.000010079144,0.98164827,0.001676844,0.00019191299,0.00020929138,0.000013892339,0.00010951178,0.00024621323],"genre_scores_gemma":[0.4954108,2.2531592e-7,0.50253487,0.0018428458,0.000099121,0.000010749277,0.00009128292,0.0000037858445,0.000006339941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989714,0.000030283543,0.00042562964,0.00013879483,0.0002392523,0.0001946145],"domain_scores_gemma":[0.9990619,0.000118724,0.0003312293,0.00015395904,0.00028008097,0.000054095537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031158904,0.000113924696,0.00013870928,0.00026119483,0.00025235256,0.00020001704,0.0003457957,0.00004034727,0.000002591672],"category_scores_gemma":[0.000052627634,0.000114920986,0.00005812478,0.0004568432,0.000033498098,0.0018857396,0.00007449457,0.00006643073,0.000005851604],"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.0000040009913,0.00002428625,0.000017653403,0.000068534246,0.000013322361,1.205124e-7,0.0011488483,0.008704562,0.0029253766,0.0054469667,0.0012731784,0.98037314],"study_design_scores_gemma":[0.00044761656,0.000049809903,0.00089512195,0.000029473647,0.0000067189426,0.000006316572,0.000019214642,0.98490405,0.007538993,0.0011708988,0.0047922614,0.00013954457],"about_ca_topic_score_codex":0.000005646534,"about_ca_topic_score_gemma":3.7946472e-7,"teacher_disagreement_score":0.9802336,"about_ca_system_score_codex":0.00003125392,"about_ca_system_score_gemma":0.00007563991,"threshold_uncertainty_score":0.4686342},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037806417,0.00001594131,0.98034674,0.015566996,0.00009003286,0.00063055824,0.0000051337283,0.00012233194,0.0028441788],"genre_scores_gemma":[0.6274772,0.000021191174,0.33489218,0.03688581,0.000056559,0.0005158508,0.00002551814,0.000014701321,0.00011092891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999007,0.000026976075,0.00029764583,0.00012319513,0.00028432076,0.000260885],"domain_scores_gemma":[0.99917394,0.000057188226,0.00022542686,0.0002531907,0.00024915373,0.000041086583],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047804872,0.00012341212,0.000074329844,0.00007316274,0.0006170905,0.0013386495,0.0009698903,0.000031133157,0.000009285174],"category_scores_gemma":[0.000011319479,0.00007058557,0.000042300097,0.00023979189,0.00013832739,0.00574798,0.00011659837,0.00015091072,0.000021785574],"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.000011964747,0.000011061873,0.0000028136837,0.000033368677,0.00001536981,1.2792955e-7,0.017168183,0.8528907,0.000020530028,0.10853583,0.0034597162,0.01785038],"study_design_scores_gemma":[0.0002611398,0.00001470449,0.000013448612,0.00001728669,0.000005275853,0.00000360324,0.0010762053,0.98926836,0.00016724724,0.0046040136,0.004457148,0.00011157007],"about_ca_topic_score_codex":0.000023492898,"about_ca_topic_score_gemma":0.0000041528992,"teacher_disagreement_score":0.6454546,"about_ca_system_score_codex":0.000038480575,"about_ca_system_score_gemma":0.00018211226,"threshold_uncertainty_score":0.99969804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08166662,0.0000025266793,0.9163237,0.000515414,0.000052762367,0.00020556805,0.000016077132,0.000026044196,0.0011912768],"genre_scores_gemma":[0.99599665,1.8816927e-7,0.003253723,0.000508354,0.00003973546,0.00006034309,0.00012379771,0.0000056724048,0.000011552957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993708,0.0000132504965,0.00031095202,0.000072404495,0.00012667952,0.00010592131],"domain_scores_gemma":[0.9994223,0.000013099381,0.0003326916,0.000102923404,0.00010251211,0.000026442161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010533616,0.00008189059,0.00008642789,0.00006447307,0.00008926773,0.0000670108,0.00009409544,0.000014663469,0.000057774654],"category_scores_gemma":[0.000007293394,0.000075980395,0.00003446454,0.00011710293,0.000018431976,0.00079886836,0.000021054266,0.00005735449,0.000026565252],"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.000106206404,0.00041942063,0.004378697,0.00044613658,0.00011962957,9.531191e-8,0.010081225,0.001540057,0.085877076,0.35234252,0.003908817,0.5407801],"study_design_scores_gemma":[0.004131583,0.00014527199,0.004832833,0.00042481246,0.000108416854,9.5352414e-7,0.0034748593,0.77829397,0.08976739,0.023823192,0.09405548,0.0009412194],"about_ca_topic_score_codex":0.000022343824,"about_ca_topic_score_gemma":6.146497e-7,"teacher_disagreement_score":0.91433,"about_ca_system_score_codex":0.000018028093,"about_ca_system_score_gemma":0.000020886097,"threshold_uncertainty_score":0.30983907},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021635376,0.000033697892,0.9678478,0.0053969463,0.000071575414,0.00019127355,0.0000025173545,0.0028336444,0.0019871397],"genre_scores_gemma":[0.7702257,7.9081707e-7,0.22401124,0.0056740926,0.000040229173,0.000037287107,0.000001903611,0.000004015559,0.000004728418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990907,0.000019615836,0.00034117483,0.00010117492,0.00027032418,0.00017701257],"domain_scores_gemma":[0.9988467,0.0004135391,0.00031907778,0.00025331508,0.00013831475,0.000029050598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031325212,0.00010828253,0.0001018391,0.00009064045,0.00022860062,0.00024216057,0.00049490685,0.000034285385,0.000003001271],"category_scores_gemma":[0.00033458308,0.000081951715,0.000033765216,0.00037420876,0.00007207973,0.002597292,0.00011101911,0.00012463423,0.000032619762],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069645503,0.00004069176,0.0075578936,0.00011339885,0.000010442701,0.000003488033,0.0122267455,0.0012699574,0.00043528533,0.0006573555,0.027489226,0.9501886],"study_design_scores_gemma":[0.0012037439,0.0001604776,0.007187108,0.0018534913,0.000051696858,0.0013232472,0.00048991246,0.8931198,0.035751436,0.0037598184,0.053549398,0.0015498569],"about_ca_topic_score_codex":0.00002363226,"about_ca_topic_score_gemma":5.8328374e-7,"teacher_disagreement_score":0.9486387,"about_ca_system_score_codex":0.000041908777,"about_ca_system_score_gemma":0.0000572276,"threshold_uncertainty_score":0.33418941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6809355,0.000121096666,0.29948062,0.014399092,0.0012529909,0.000125707,0.00023073847,0.0011278428,0.0023264135],"genre_scores_gemma":[0.903685,0.000058404476,0.082602665,0.012077235,0.00040480323,0.00049234525,0.0005367323,0.000115267394,0.00002760353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548733,0.00009173998,0.001141739,0.000802972,0.0013235606,0.001152642],"domain_scores_gemma":[0.9945418,0.0005080596,0.0013489304,0.0031388616,0.00020757847,0.00025475342],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017216932,0.0004686804,0.00026601015,0.0003579745,0.0011378243,0.001858706,0.007290291,0.0007484627,0.000107628286],"category_scores_gemma":[0.0054010195,0.000648547,0.00040836405,0.00076559954,0.00046965387,0.0060247798,0.0075522186,0.0007816663,0.0009071947],"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.00014776195,0.00007982755,0.000028031627,0.0010339478,0.0002164313,0.000030224859,0.0017520627,0.0007651607,0.0015114502,0.58849394,0.37767363,0.02826751],"study_design_scores_gemma":[0.0009768377,0.00025471413,0.00007477288,0.0004882747,0.000116068164,0.0001695525,0.00021330579,0.8459494,0.115955085,0.0049979603,0.030067062,0.0007369508],"about_ca_topic_score_codex":0.00013906829,"about_ca_topic_score_gemma":0.000020141415,"teacher_disagreement_score":0.84518427,"about_ca_system_score_codex":0.00005002195,"about_ca_system_score_gemma":0.00046041718,"threshold_uncertainty_score":0.9998707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27920583,0.000033591903,0.7157043,0.0036328814,0.00007875704,0.000085554246,0.0000030819508,0.00007934974,0.001176624],"genre_scores_gemma":[0.98679954,8.4900154e-7,0.009826786,0.0033164702,0.000030407542,0.000006535002,0.000013990458,0.0000027037827,0.0000026950454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991213,0.0000368805,0.00027526068,0.00009376144,0.00033516114,0.00013763747],"domain_scores_gemma":[0.9992527,0.00008624861,0.00025208364,0.00030599334,0.00008272299,0.000020300145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036240864,0.00008559517,0.000075479984,0.000091105874,0.00020662822,0.00034081543,0.0005485254,0.000026645494,0.0000044376256],"category_scores_gemma":[0.000060793478,0.000058550035,0.000026993446,0.00030776305,0.00006791278,0.0026191878,0.00008238473,0.000097924436,0.00001764241],"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.000094506744,0.00027881755,0.0047507496,0.0009852302,0.000037289206,0.000037854763,0.00915525,0.032040495,0.09135597,0.3484968,0.036870386,0.47589666],"study_design_scores_gemma":[0.0011022914,0.00010626722,0.036285494,0.0013731479,0.000019882786,0.00017883684,0.0002140156,0.8879683,0.03947518,0.013688883,0.018634837,0.0009528772],"about_ca_topic_score_codex":0.00019204924,"about_ca_topic_score_gemma":8.011084e-7,"teacher_disagreement_score":0.8559278,"about_ca_system_score_codex":0.000031418193,"about_ca_system_score_gemma":0.00004238044,"threshold_uncertainty_score":0.3286491},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37194332,0.000004700622,0.623632,0.0031258361,0.00016282429,0.0001337803,5.444691e-7,0.00011050471,0.0008864561],"genre_scores_gemma":[0.9297992,6.770251e-7,0.06693844,0.0031653985,0.00002343317,0.00004018491,0.00000753007,0.0000047375875,0.000020379033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895996,0.000031849155,0.00028251228,0.00013165733,0.00032922043,0.000264785],"domain_scores_gemma":[0.9994516,0.000036526744,0.000118633834,0.00023467017,0.00010560674,0.00005296459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050711696,0.00009624413,0.00008185049,0.00060979975,0.00012555646,0.00035008616,0.0005347925,0.000051504627,0.000009645693],"category_scores_gemma":[0.00009799072,0.000092473114,0.0000306381,0.0008315356,0.00007233839,0.0068426747,0.00007701485,0.00028607188,0.00005517693],"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.000038565828,0.000050386894,0.0026626182,0.00010698071,0.0000059985246,0.000007736281,0.00884484,0.002120355,0.21586756,0.10283298,0.0007824741,0.6666795],"study_design_scores_gemma":[0.00504641,0.00012185902,0.0633734,0.0001698901,0.0000070194274,0.00012854482,0.00038481693,0.7364271,0.06284763,0.11108003,0.01874342,0.001669838],"about_ca_topic_score_codex":0.000006357926,"about_ca_topic_score_gemma":0.000004694493,"teacher_disagreement_score":0.7343068,"about_ca_system_score_codex":0.000030590945,"about_ca_system_score_gemma":0.00005313701,"threshold_uncertainty_score":0.4960774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008103375,0.000030041792,0.9872432,0.0021275538,0.00018786138,0.000057836896,0.0000024896071,0.00027115986,0.0019765263],"genre_scores_gemma":[0.8603806,0.0000020162788,0.13520657,0.004212755,0.00004836611,0.000011199243,0.00008632608,0.0000050869194,0.00004707539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921936,0.000009216489,0.00024743698,0.00010500593,0.00024165574,0.00017733137],"domain_scores_gemma":[0.999565,0.000011565901,0.00015026682,0.00019357914,0.000052457515,0.000027125534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001246315,0.000087780514,0.000067300854,0.0001326824,0.00021455326,0.00063203834,0.00040460855,0.000030025767,0.0000046045843],"category_scores_gemma":[0.0000069680896,0.00007856886,0.000021498783,0.00025185294,0.000020363965,0.0064746113,0.00010898094,0.000080258316,0.00009366757],"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.000007164421,0.000036512458,0.00027111795,0.00017779275,0.00000526749,0.0000086117025,0.0015047567,0.0069103274,0.009920458,0.011633432,0.029642973,0.93988156],"study_design_scores_gemma":[0.00025400243,0.000008149384,0.0024408961,0.00007262871,0.0000019371475,0.000020275267,0.000020705971,0.9613966,0.0007852469,0.0007052917,0.03409701,0.00019728769],"about_ca_topic_score_codex":0.000023174545,"about_ca_topic_score_gemma":7.123127e-7,"teacher_disagreement_score":0.95448625,"about_ca_system_score_codex":0.00004524972,"about_ca_system_score_gemma":0.000027197031,"threshold_uncertainty_score":0.60947603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007334273,0.000057719753,0.99008995,0.00020386225,0.00023557951,0.0001236771,0.000008427782,0.000046868474,0.0018996645],"genre_scores_gemma":[0.95677614,7.951841e-7,0.042771306,0.00040752668,0.000007877903,0.000011802703,0.000010371552,0.00000297754,0.0000112148045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891275,0.000030919015,0.00052087737,0.0000868851,0.00030705318,0.00014151644],"domain_scores_gemma":[0.9989143,0.000018182149,0.0005164267,0.00022021284,0.00029888703,0.000032012493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029744243,0.00008745289,0.00016500051,0.00011372814,0.000054400152,0.00007874562,0.00032405838,0.000041138333,0.0000028118109],"category_scores_gemma":[0.00005604521,0.00007980404,0.0000342451,0.0005605138,0.000049607,0.0020850922,0.000022531578,0.00006776733,0.0000035493663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091094125,0.00008326096,0.00035337717,0.0009369712,0.000021124335,0.0000019904635,0.0048915716,0.0040430436,0.0021170417,0.010592234,0.0024562022,0.9744941],"study_design_scores_gemma":[0.0028360125,0.00017550007,0.0023102574,0.0015896485,0.000025560312,0.00011801664,0.00093819614,0.5790603,0.32154676,0.0008136762,0.089632384,0.0009536783],"about_ca_topic_score_codex":0.000008227691,"about_ca_topic_score_gemma":1.6699174e-7,"teacher_disagreement_score":0.97354037,"about_ca_system_score_codex":0.000018938968,"about_ca_system_score_gemma":0.00009126373,"threshold_uncertainty_score":0.32543144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005632772,0.00004848624,0.98998606,0.0016990632,0.00012692894,0.000048989437,0.0000015159532,0.00016987999,0.0022863287],"genre_scores_gemma":[0.79775596,0.0000047613116,0.19191688,0.0101952,0.000030153278,0.00001300324,0.00003521869,0.000005585204,0.000043247335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908406,0.000030391166,0.0002651256,0.00013183417,0.00029958694,0.00018902628],"domain_scores_gemma":[0.9993524,0.00001698016,0.0001752218,0.00032529145,0.00007103628,0.000059078113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026196227,0.00010095289,0.00010870498,0.00029297647,0.00018852112,0.0007612088,0.0004226921,0.000035532903,0.000027017726],"category_scores_gemma":[0.000037017406,0.000085585765,0.000057481964,0.0009997587,0.000022057995,0.0062259454,0.0000594862,0.00009473004,0.00010458913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012262348,0.00009973594,0.009207245,0.00015587114,0.00029040434,0.000012217665,0.022296531,0.027905703,0.0016391702,0.024072262,0.025139283,0.88916934],"study_design_scores_gemma":[0.0006290104,0.000020396772,0.005888114,0.000046766178,0.000080578306,0.00002209924,0.0002228993,0.66526574,0.0020311272,0.0006936958,0.3245089,0.00059069344],"about_ca_topic_score_codex":0.000008520559,"about_ca_topic_score_gemma":5.0132763e-7,"teacher_disagreement_score":0.8885786,"about_ca_system_score_codex":0.000029139894,"about_ca_system_score_gemma":0.00004111243,"threshold_uncertainty_score":0.73403543},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04827308,0.00010198866,0.94516325,0.00487519,0.0002476014,0.00012679037,0.0000020528264,0.00006693307,0.001143089],"genre_scores_gemma":[0.984215,0.000019185114,0.012174373,0.0034323744,0.000066670575,0.000014522038,0.0000166886,0.0000030130725,0.000058173217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989324,0.000036634738,0.00040537887,0.00009558341,0.00039839325,0.00013160409],"domain_scores_gemma":[0.9990826,0.000102686696,0.00037603502,0.00016898157,0.0002380347,0.000031649015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027354434,0.00008563678,0.00007899203,0.00015719478,0.000520568,0.00013660328,0.0002544543,0.000035040077,0.000009182334],"category_scores_gemma":[0.00006858979,0.000067467656,0.00005348128,0.0006624445,0.00006633115,0.003953458,0.000041207248,0.00008391772,0.000033816494],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050778333,0.000060593782,0.0010422481,0.00011152175,0.00008237889,0.000002404183,0.04619311,0.029393485,0.0012791076,0.042186722,0.030281119,0.84931654],"study_design_scores_gemma":[0.0027083245,0.00020087024,0.06336969,0.0002510588,0.00004274919,0.00013710848,0.0004486407,0.7736277,0.02194727,0.027506055,0.1087364,0.001024124],"about_ca_topic_score_codex":0.0000039189213,"about_ca_topic_score_gemma":1.6723018e-7,"teacher_disagreement_score":0.93594193,"about_ca_system_score_codex":0.000029781373,"about_ca_system_score_gemma":0.00010989955,"threshold_uncertainty_score":0.40038407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15531914,0.000003177961,0.8384771,0.002391842,0.00005231947,0.0000945037,6.7513116e-7,0.00028847542,0.003372791],"genre_scores_gemma":[0.77963895,6.6974465e-8,0.21790102,0.0024196468,0.000012170393,0.000009624698,0.000007973747,0.000004398406,0.0000061594014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894327,0.000039795093,0.00045304224,0.000102329344,0.0002860363,0.0001755074],"domain_scores_gemma":[0.99914837,0.00008253626,0.00035093407,0.00024741108,0.00014593267,0.000024825224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444628,0.00010320878,0.00012988393,0.00013201918,0.00008431422,0.000559733,0.0007349932,0.00003218458,0.0000033082376],"category_scores_gemma":[0.00025780365,0.00008032112,0.000023776114,0.0005433405,0.000090130496,0.005294007,0.00013920416,0.00011937372,0.0000706769],"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.00002483956,0.00012842809,0.0072163604,0.0007848871,0.000017318664,0.000002574156,0.010189542,0.0058726673,0.017039659,0.0057922644,0.0041086455,0.9488228],"study_design_scores_gemma":[0.00022018146,0.000006844567,0.0015927234,0.00018793425,0.0000016736068,0.000015565249,0.0000072982934,0.99140793,0.0040800814,0.0018026107,0.0005528379,0.00012432037],"about_ca_topic_score_codex":0.000013237524,"about_ca_topic_score_gemma":1.5746267e-7,"teacher_disagreement_score":0.98553526,"about_ca_system_score_codex":0.000027709439,"about_ca_system_score_gemma":0.00003325659,"threshold_uncertainty_score":0.5397518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007760521,0.00095674105,0.9470272,0.034550596,0.0003993897,0.00025959391,0.000014577995,0.00071788323,0.0083135115],"genre_scores_gemma":[0.897251,0.000058202888,0.06757921,0.034408964,0.00014107914,0.000020106438,0.00007276157,0.000009166509,0.000459486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993559,0.000009299177,0.00015635045,0.00011490733,0.00020932841,0.00015421413],"domain_scores_gemma":[0.99965495,0.000014897509,0.00010155211,0.000159584,0.000030913718,0.000038102025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086881104,0.00009966171,0.000068757785,0.00014295663,0.00015727578,0.0009142335,0.00038404303,0.000043181215,0.00002066616],"category_scores_gemma":[0.000016210333,0.00008525471,0.000016596749,0.00030399818,0.000032510037,0.007908346,0.000112323585,0.00012869484,0.00005448402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.413458e-7,0.000009147339,0.00004792862,0.00007173269,0.0000067545197,0.0000037148702,0.0024848147,0.00013980665,0.00029905874,0.0016432652,0.096682414,0.8986104],"study_design_scores_gemma":[0.0006243009,0.000032351352,0.0021389357,0.000114793766,0.000011183691,0.000018877607,0.00017628493,0.69839174,0.00060925545,0.00047636117,0.29691723,0.00048869837],"about_ca_topic_score_codex":0.0000012323881,"about_ca_topic_score_gemma":2.8939994e-7,"teacher_disagreement_score":0.8981217,"about_ca_system_score_codex":0.000010445715,"about_ca_system_score_gemma":0.0000036936128,"threshold_uncertainty_score":0.88159746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008074978,0.00067498547,0.98408943,0.0057956264,0.000016430022,0.0002852813,0.000005885037,0.00052770815,0.00052967225],"genre_scores_gemma":[0.87296075,0.0000061610112,0.12289298,0.003989289,0.00001390644,0.000075107906,0.000045494304,0.0000073973374,0.000008902372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990606,0.000015016694,0.00028244528,0.00016001838,0.000293993,0.00018796028],"domain_scores_gemma":[0.9995309,0.00003945595,0.00016355912,0.00017761758,0.000050868577,0.00003757585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014223071,0.00014301906,0.00010201339,0.00023614202,0.00012666483,0.00032713544,0.0003979225,0.000050465507,0.0000026261675],"category_scores_gemma":[0.00001439834,0.00011799981,0.000017357515,0.00051746744,0.000021006479,0.0049389857,0.000022300575,0.00018748638,0.000018058403],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016463648,0.000036186353,0.00013104037,0.00007950947,0.0000031001746,7.8101914e-7,0.0028843272,0.0018958577,0.0057747867,0.0011653841,0.0004663407,0.9875462],"study_design_scores_gemma":[0.0021829729,0.000170538,0.0008260606,0.0007559281,0.000014963341,0.000036882953,0.00012529264,0.81587833,0.11503095,0.0007948259,0.06295933,0.0012239575],"about_ca_topic_score_codex":0.0000093314875,"about_ca_topic_score_gemma":0.000010072295,"teacher_disagreement_score":0.9863223,"about_ca_system_score_codex":0.00010428867,"about_ca_system_score_gemma":0.0000345744,"threshold_uncertainty_score":0.48118925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028091058,0.000007375785,0.9701835,0.0010133744,0.00006951116,0.00019367137,0.0000032021437,0.000326725,0.000111619156],"genre_scores_gemma":[0.6532647,2.782867e-7,0.34142396,0.005217186,0.000043990793,0.0000048267816,0.000038366445,0.0000043900973,0.0000023418054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998927,0.000024493707,0.0002755192,0.000152245,0.00027789382,0.00034285244],"domain_scores_gemma":[0.99928033,0.000060449813,0.00015549532,0.00025885008,0.00015272269,0.00009212325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035651724,0.00011740959,0.00010367848,0.00022464013,0.00037760343,0.0005884112,0.00066590676,0.000035887682,0.00000142664],"category_scores_gemma":[0.00004076977,0.0001094102,0.000040170988,0.0004111514,0.000035326044,0.0072064195,0.00003284077,0.00011183986,0.000008344833],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026146738,0.0000121237035,0.00004879599,0.000014129225,0.0000018625535,3.5678755e-7,0.0020442284,0.0018796294,0.0008917041,0.0025766967,0.0002467444,0.99228114],"study_design_scores_gemma":[0.00036543355,0.00010877681,0.0012855881,0.0000173346,0.0000017330051,0.00000555479,0.00016752437,0.9811255,0.0039205626,0.009399466,0.003381019,0.00022151221],"about_ca_topic_score_codex":0.0000014012014,"about_ca_topic_score_gemma":8.7811976e-8,"teacher_disagreement_score":0.9920596,"about_ca_system_score_codex":0.000047402373,"about_ca_system_score_gemma":0.000042724292,"threshold_uncertainty_score":0.56740624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119898014,0.00001793611,0.8764008,0.0019913758,0.00025623012,0.000064701446,4.302548e-7,0.00016386005,0.0012066028],"genre_scores_gemma":[0.92982364,3.4376495e-7,0.056909658,0.0131100565,0.0001071185,0.0000039011197,0.000016921242,0.0000028156721,0.000025525642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990669,0.000010782259,0.00030047636,0.00010221736,0.0003095008,0.00021012066],"domain_scores_gemma":[0.9995748,0.000031762433,0.00014317529,0.00012108809,0.00007179862,0.000057376536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048344192,0.00008688417,0.00006098131,0.00029883976,0.00030313854,0.00042120446,0.00024745625,0.000032703825,0.000008081775],"category_scores_gemma":[0.000035377318,0.000086193824,0.00003053675,0.0005269408,0.00001799247,0.0047330796,0.000054477812,0.000085598505,0.000055465764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008728203,0.000012614658,0.00030612282,0.000038562932,0.0000055176897,0.0000032484836,0.0069842436,0.0028936956,0.007720265,0.005813982,0.00228771,0.9739253],"study_design_scores_gemma":[0.0014553812,0.00006308016,0.057157658,0.00011651234,0.000009567408,0.00013696137,0.0003382414,0.8369568,0.013457312,0.0020039128,0.087456904,0.00084768963],"about_ca_topic_score_codex":0.000007440494,"about_ca_topic_score_gemma":0.0000013585708,"teacher_disagreement_score":0.9730776,"about_ca_system_score_codex":0.000055920635,"about_ca_system_score_gemma":0.00005087287,"threshold_uncertainty_score":0.40616843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48055187,0.00022889108,0.5084435,0.0063193757,0.0000829063,0.00007153922,0.0000013649312,0.00041224487,0.003888361],"genre_scores_gemma":[0.9839853,0.0000011056461,0.010192209,0.0057517155,0.000036540885,0.0000044767244,0.0000065625613,0.0000021626506,0.000019926489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995495,0.000008800157,0.0001377704,0.00006878027,0.00012004063,0.00011508854],"domain_scores_gemma":[0.99976915,0.000010903328,0.000074980584,0.000105277846,0.000019148845,0.000020561249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109317494,0.00006296661,0.000051391606,0.000083786384,0.00013063765,0.00057416863,0.00017510555,0.000019927125,0.0000025677436],"category_scores_gemma":[0.0000066295815,0.000054417273,0.0000114603545,0.00012337613,0.00003597974,0.0027514892,0.000045875768,0.000047445392,0.00002602073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036774074,0.00001756079,0.002476579,0.0001894933,0.0000054963375,0.000009707541,0.008272735,0.00027521918,0.0065606167,0.031665273,0.009910366,0.94061327],"study_design_scores_gemma":[0.0036903261,0.00013326682,0.28714046,0.0005660541,0.000035106885,0.0006536842,0.004435701,0.4216867,0.021176765,0.01409297,0.24382919,0.0025597613],"about_ca_topic_score_codex":0.000021763128,"about_ca_topic_score_gemma":9.671189e-7,"teacher_disagreement_score":0.9380535,"about_ca_system_score_codex":0.000012484237,"about_ca_system_score_gemma":0.000013993628,"threshold_uncertainty_score":0.55367213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13942084,0.000035886944,0.8517661,0.0065661,0.0005984597,0.0010864025,0.000026112391,0.00031730908,0.00018279474],"genre_scores_gemma":[0.9059928,0.00000989333,0.089802235,0.0038107142,0.000041476094,0.00028791465,0.000034194447,0.000012563322,0.000008224479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985289,0.000032108488,0.00047769296,0.000261113,0.00039281187,0.00030735836],"domain_scores_gemma":[0.99886256,0.0001677204,0.0003344829,0.000302274,0.0002552249,0.000077758625],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044082143,0.0002248533,0.00015486687,0.00036245945,0.00075031444,0.001205028,0.00048793133,0.00007809598,0.0000042080255],"category_scores_gemma":[0.000072550894,0.00015805627,0.00009223773,0.00055611716,0.0002882244,0.0033625492,0.00007566183,0.0003281788,0.000008347339],"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.00004781849,0.00006567552,0.00047469762,0.0003137322,0.000045509405,0.0000010388595,0.011478447,0.00033345557,0.004981799,0.11718029,0.000714681,0.86436284],"study_design_scores_gemma":[0.0018428427,0.00030186345,0.0067189108,0.0002565829,0.00004713124,0.0001264945,0.00064029853,0.9254496,0.0056925253,0.048119247,0.009916153,0.0008883315],"about_ca_topic_score_codex":0.000012399949,"about_ca_topic_score_gemma":0.000009111693,"teacher_disagreement_score":0.9251162,"about_ca_system_score_codex":0.00001920831,"about_ca_system_score_gemma":0.0000604606,"threshold_uncertainty_score":0.9998318},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81705785,0.000027987386,0.17326683,0.007326742,0.00018617835,0.0001417929,0.000006191686,0.00006091907,0.0019254967],"genre_scores_gemma":[0.9931129,2.3404256e-7,0.00038547142,0.006463107,0.000018886816,0.0000059987947,0.000002448476,0.0000025684812,0.000008339967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915123,0.000041333842,0.00033523142,0.000060915652,0.00029661198,0.00011466849],"domain_scores_gemma":[0.99901116,0.00015910249,0.00043547212,0.00031627304,0.00006854677,0.000009458524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054901,0.00007780268,0.000097155724,0.00005687291,0.0001304552,0.00011136146,0.00072794425,0.000025380352,0.000004225625],"category_scores_gemma":[0.000056370587,0.000043658212,0.000047187255,0.00029223703,0.00010591043,0.0010417991,0.00009161472,0.00008537281,0.0000037935167],"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.000052763175,0.000038379472,0.0022967332,0.00028397358,0.00002647884,8.7504105e-7,0.021006908,0.007142534,0.008679784,0.7228658,0.010402664,0.22720312],"study_design_scores_gemma":[0.004805098,0.00033216228,0.07859274,0.0037862035,0.000065151835,0.00006921647,0.01064535,0.5074171,0.28886464,0.07851486,0.025398642,0.0015088839],"about_ca_topic_score_codex":0.00005054431,"about_ca_topic_score_gemma":0.0000020225789,"teacher_disagreement_score":0.64435095,"about_ca_system_score_codex":0.00002003622,"about_ca_system_score_gemma":0.00004369545,"threshold_uncertainty_score":0.17803302},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014987461,0.000044697586,0.9000389,0.071926534,0.00010924221,0.00046879414,0.0000031493341,0.0003606322,0.012060612],"genre_scores_gemma":[0.9649156,0.0000055603073,0.014283286,0.020596905,0.000026877424,0.000070755275,0.0000020843577,0.0000067660812,0.000092197406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988226,0.000067370696,0.00024640205,0.00012992539,0.00044447047,0.00028918617],"domain_scores_gemma":[0.9991443,0.00020492461,0.00016684766,0.00031381802,0.00012121943,0.000048902602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037973432,0.00011774022,0.000082371786,0.00019140777,0.00039905586,0.0004889725,0.0007225328,0.0000324862,0.000023266219],"category_scores_gemma":[0.00011149262,0.00008021254,0.000037290512,0.00063306186,0.00014586333,0.0030512488,0.000092686496,0.00024227671,0.00053028256],"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.00005377824,0.000084888554,0.00015611989,0.00021218482,0.000029660312,0.00001550555,0.05251423,0.003949943,0.002586592,0.3251785,0.031401545,0.583817],"study_design_scores_gemma":[0.0022559238,0.00033631126,0.00088524166,0.00062023755,0.000015687192,0.00018666784,0.0011824993,0.7551307,0.021253115,0.062865354,0.1537462,0.0015220727],"about_ca_topic_score_codex":0.0000020204536,"about_ca_topic_score_gemma":3.1226892e-7,"teacher_disagreement_score":0.9499281,"about_ca_system_score_codex":0.000054616736,"about_ca_system_score_gemma":0.000025497466,"threshold_uncertainty_score":0.6815886},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070916004,0.000011502342,0.91501164,0.0069060274,0.00006576494,0.00014852127,0.0000013715833,0.00008504685,0.0068541365],"genre_scores_gemma":[0.98583245,7.796078e-7,0.008545906,0.005598609,0.000003108967,0.000009962337,0.0000011373057,0.0000025723155,0.0000054535494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908066,0.00006943887,0.00022180668,0.000079836595,0.00036970284,0.0001785602],"domain_scores_gemma":[0.9992639,0.000119523924,0.00017839894,0.0003017749,0.00010619547,0.000030205536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267679,0.00007655001,0.00007372773,0.00015526275,0.00020142428,0.00015524699,0.0005352594,0.000018733996,0.000010529972],"category_scores_gemma":[0.00021556162,0.000052201012,0.0000369232,0.00061194936,0.00032897937,0.001858259,0.00003992533,0.00013977071,0.00002921433],"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.000005107938,0.000009959739,0.00009388354,0.000032016356,0.0000038498733,2.788176e-7,0.0017451006,0.00042116482,0.00072824914,0.9842945,0.0006752253,0.011990707],"study_design_scores_gemma":[0.00082562177,0.00011917637,0.002765731,0.00021179525,0.0000049825926,0.000026179554,0.00047901156,0.022087201,0.064031765,0.8935759,0.015386225,0.00048642597],"about_ca_topic_score_codex":0.0000015545418,"about_ca_topic_score_gemma":1.806059e-7,"teacher_disagreement_score":0.91491646,"about_ca_system_score_codex":0.000018731773,"about_ca_system_score_gemma":0.000033537875,"threshold_uncertainty_score":0.21286954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008403251,0.00007186141,0.9767513,0.011522462,0.00062975695,0.0014443186,0.0000084765525,0.00026323207,0.0009053042],"genre_scores_gemma":[0.9793601,0.000003362535,0.0053670146,0.013368681,0.0005514878,0.0006902609,0.00056982785,0.000012194717,0.000077039454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986175,0.000008357141,0.0005636819,0.00013824011,0.00030778148,0.00036445793],"domain_scores_gemma":[0.99905276,0.000020777847,0.0002679126,0.00022763367,0.0004134396,0.000017459248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010751795,0.00018433561,0.00011961567,0.00017329957,0.00060862844,0.0005745146,0.00024139514,0.000054319753,0.00004708451],"category_scores_gemma":[0.00011882367,0.000140901,0.00006339717,0.0005053335,0.000056309662,0.009040853,0.00005876706,0.000104803425,0.00023525511],"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.00011719609,0.00019240484,0.0011965404,0.0048915558,0.000075030795,4.2528036e-8,0.00437194,0.16160333,0.00051937153,0.0050692875,0.026273018,0.7956903],"study_design_scores_gemma":[0.0004823035,0.0000035862372,0.0023008422,0.00002844142,0.000050684313,4.88237e-7,0.0010601534,0.84306,0.00006604569,0.00007054545,0.15264107,0.00023584899],"about_ca_topic_score_codex":0.00024336191,"about_ca_topic_score_gemma":0.000015347334,"teacher_disagreement_score":0.97138435,"about_ca_system_score_codex":0.000081041806,"about_ca_system_score_gemma":0.000023939732,"threshold_uncertainty_score":0.65544003},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22772004,0.0000075279336,0.7616207,0.0077752024,0.0008298785,0.00037155065,0.000016603197,0.00039746502,0.0012610622],"genre_scores_gemma":[0.8805568,0.0000039960964,0.10229886,0.016492106,0.00017641358,0.00019491062,0.00017328483,0.000013232402,0.000090355476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.000013267842,0.00035428634,0.00017512604,0.0002593589,0.0002626793],"domain_scores_gemma":[0.99916315,0.00005063221,0.00025785432,0.00021910178,0.00022549533,0.000083788866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002716691,0.000142539,0.0001063322,0.00018743835,0.00029922652,0.0006358357,0.0003775956,0.000101051555,0.000013852866],"category_scores_gemma":[0.00010893603,0.00013324688,0.00005946844,0.00023819588,0.00003785888,0.0057831523,0.000056489447,0.00021067011,0.0003256763],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022747934,0.000032950997,0.000036820973,0.0001865086,0.00000770126,9.917679e-7,0.0027907006,0.0001881224,0.052563347,0.00015526616,0.025691636,0.9183232],"study_design_scores_gemma":[0.0044994764,0.00016559081,0.0012841036,0.0005894667,0.000053521944,0.00017959336,0.0009549716,0.39480516,0.27833748,0.0058513824,0.31138843,0.001890822],"about_ca_topic_score_codex":0.0000060102934,"about_ca_topic_score_gemma":0.0000016347713,"teacher_disagreement_score":0.9164324,"about_ca_system_score_codex":0.000020698,"about_ca_system_score_gemma":0.000059383994,"threshold_uncertainty_score":0.6131378},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930764,0.000013079018,0.0011077097,0.0045215897,0.00039895086,0.00016368428,0.00002620386,0.00020483058,0.00048755095],"genre_scores_gemma":[0.9885602,8.1151677e-7,0.007827708,0.0032823447,0.00023307938,0.000009248664,0.00007733323,9.848056e-7,0.000008274332],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99884754,0.00002469643,0.00035860235,0.00015020191,0.0003201452,0.0002988187],"domain_scores_gemma":[0.9994498,0.00008233794,0.00018088362,0.00006992471,0.00012303403,0.00009403819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034751158,0.00014567029,0.00012601718,0.00005529008,0.00032818556,0.00029503705,0.00023814398,0.000109442044,0.00011438792],"category_scores_gemma":[0.00010705995,0.00006495787,0.00006325678,0.0007491294,0.00008987201,0.0020337766,0.000047242444,0.00028997724,0.00007140631],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007143547,0.000033302636,0.0025223882,0.000034589928,0.000005421265,0.0000013366298,0.0003485994,0.00006878269,0.18629198,0.00003613708,0.0007391475,0.8099112],"study_design_scores_gemma":[0.0016345851,0.0003815852,0.3755669,0.00019283331,0.000103288265,0.000328646,0.0029340542,0.21303247,0.069276355,0.00094866066,0.33247283,0.0031277877],"about_ca_topic_score_codex":0.000110528614,"about_ca_topic_score_gemma":0.00002375016,"teacher_disagreement_score":0.8067834,"about_ca_system_score_codex":0.00004297249,"about_ca_system_score_gemma":0.00001918165,"threshold_uncertainty_score":0.28450492},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33173043,0.000010719155,0.66641986,0.001298894,0.00003418554,0.00035216994,0.000006072377,0.00004313643,0.00010453507],"genre_scores_gemma":[0.87428504,0.0000022708716,0.12524006,0.00040829237,0.000004887673,0.00003354115,0.000020854915,0.000003515261,0.0000015117388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986266,0.000045657373,0.0006266254,0.00018142202,0.00025315295,0.00026656888],"domain_scores_gemma":[0.9989404,0.0002811305,0.00028977336,0.00025845508,0.00017648478,0.000053732834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024668202,0.00010281671,0.00014156188,0.00047079584,0.000116905874,0.000088211076,0.00027140946,0.000056552853,1.8113617e-7],"category_scores_gemma":[0.00041785324,0.00009446874,0.000028440736,0.0007222319,0.00015358126,0.003441641,0.00009593443,0.00013578878,7.714761e-7],"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.0010483745,0.0002025775,0.005016157,0.0016792592,0.000017200213,0.0000026708824,0.02018859,0.0026069279,0.015174183,0.2687197,0.00020499839,0.68513936],"study_design_scores_gemma":[0.006837336,0.00032177535,0.0647092,0.00045526092,0.000011092544,0.00002570337,0.0011763069,0.17460242,0.04914262,0.70100796,0.0008844571,0.0008258522],"about_ca_topic_score_codex":0.000012307683,"about_ca_topic_score_gemma":0.0000060372918,"teacher_disagreement_score":0.6843135,"about_ca_system_score_codex":0.000051650066,"about_ca_system_score_gemma":0.00004143906,"threshold_uncertainty_score":0.38523236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103912435,0.00016178901,0.89493734,0.00035252012,0.00001055245,0.00013762448,0.000001348221,0.00005356642,0.00043280938],"genre_scores_gemma":[0.99089104,0.000022171485,0.008450998,0.000580027,0.00000446294,0.000028387347,0.000010274718,0.0000023041935,0.000010360133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917865,0.00003093323,0.00030217145,0.0001142444,0.000205596,0.00016842363],"domain_scores_gemma":[0.9993771,0.00012471482,0.00017495715,0.00020528049,0.00007683574,0.00004112327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019607505,0.000072662966,0.00013970371,0.0014020836,0.0000717578,0.0001294497,0.0002836451,0.00003380806,0.00000516398],"category_scores_gemma":[0.000045334204,0.00007031469,0.00003020483,0.0051401253,0.00006513116,0.0019320226,0.000058511163,0.000105995845,0.0000028104116],"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.000012590116,0.0000989762,0.040834993,0.00016246949,0.00015941354,0.0000017909446,0.0057543814,0.3390766,0.0003255669,0.014139104,0.00035664107,0.59907746],"study_design_scores_gemma":[0.00016858801,0.000007205516,0.02788239,0.000012509799,0.000017174882,0.0000010427239,0.000026260732,0.9707367,0.00006186766,0.00042729944,0.0005660886,0.000092892915],"about_ca_topic_score_codex":0.000008418915,"about_ca_topic_score_gemma":0.0000024235821,"teacher_disagreement_score":0.88697857,"about_ca_system_score_codex":0.000033479366,"about_ca_system_score_gemma":0.000007570689,"threshold_uncertainty_score":0.286735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061719696,0.0000637216,0.9926643,0.004024165,0.00021764582,0.000079005724,0.0000023189937,0.00031429314,0.0020173963],"genre_scores_gemma":[0.0308682,0.000002333034,0.96174675,0.0068360236,0.00027924412,0.000008446194,0.00009457061,0.000007181941,0.00015725379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889094,0.000013263848,0.0003189225,0.00013920102,0.0004248788,0.00021281108],"domain_scores_gemma":[0.9994095,0.000014000291,0.0001868454,0.00026312578,0.000061659724,0.000064844695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014462593,0.00012192427,0.00009248759,0.00017081632,0.00046630576,0.00055728917,0.0006173943,0.000046151643,0.0000095834675],"category_scores_gemma":[0.000007692087,0.00010526349,0.000032577933,0.00037427054,0.000016378643,0.007184886,0.0006932776,0.000102405545,0.00009830816],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012603186,0.0000065115087,0.000014466135,0.000010266503,9.0394235e-7,0.000001763234,0.0005413729,0.000222994,0.00049118843,0.0006527344,0.026183115,0.9718734],"study_design_scores_gemma":[0.000801486,0.000024722121,0.0018290449,0.00009534577,0.00000449749,0.000038269467,0.000019853345,0.71575415,0.0027613894,0.0042458978,0.2740574,0.00036794977],"about_ca_topic_score_codex":0.00016906162,"about_ca_topic_score_gemma":0.0000017756086,"teacher_disagreement_score":0.97150546,"about_ca_system_score_codex":0.000051478706,"about_ca_system_score_gemma":0.00008882197,"threshold_uncertainty_score":0.53739524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20019002,0.0002197763,0.7914505,0.0048368922,0.00041902091,0.0004252111,0.0000050788667,0.00059341587,0.0018600955],"genre_scores_gemma":[0.9166128,0.0000112733815,0.08258799,0.00065399555,0.00004311716,0.00004544573,0.000024724759,0.000011925649,0.0000087119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00001121365,0.00038436253,0.000046451903,0.0001863803,0.00018254083],"domain_scores_gemma":[0.99956876,0.000027100885,0.0001140099,0.00011785335,0.00013330276,0.000038975108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019079582,0.00009898306,0.00009081094,0.000079730096,0.00018263991,0.00024584407,0.00015912023,0.000029940848,0.00002359703],"category_scores_gemma":[0.000032992066,0.00007688625,0.000028316113,0.0002252557,0.00013959425,0.0011867033,0.000015003986,0.00012740504,0.00007070821],"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.0000012243542,0.0000035957496,0.00019326954,0.0001557016,0.000012076229,4.308888e-8,0.0019203515,0.94621927,0.0010624861,0.00042688978,0.00041678638,0.049588315],"study_design_scores_gemma":[0.00026055714,0.0000039551405,0.00037569628,0.00006389352,0.0000036674655,0.0000026371642,0.00030317667,0.99639654,0.0017190201,0.00031843572,0.00044344217,0.00010900007],"about_ca_topic_score_codex":0.000020472175,"about_ca_topic_score_gemma":0.0000012471836,"teacher_disagreement_score":0.7164228,"about_ca_system_score_codex":0.000029758801,"about_ca_system_score_gemma":0.000016030943,"threshold_uncertainty_score":0.31353304},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103637286,0.000030099332,0.88636786,0.008937798,0.0001360999,0.000077986086,0.0000031081813,0.0004430478,0.00036673207],"genre_scores_gemma":[0.97474885,0.0000046534365,0.008028676,0.017151205,0.000032559008,0.000015800202,0.000008817954,0.000005689535,0.0000037605985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.000015045515,0.0002697429,0.00014725067,0.00030968495,0.00022041178],"domain_scores_gemma":[0.9994185,0.000020017524,0.00015391632,0.00028098308,0.00005016525,0.00007643843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020511409,0.00012724327,0.000096609445,0.00013482037,0.0002262716,0.0006443151,0.00043326808,0.00004209051,0.0000054764755],"category_scores_gemma":[0.000023643544,0.000110232904,0.000024095332,0.00017064436,0.00004891772,0.004966747,0.00018305027,0.00010838456,0.00007734294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.622065e-7,0.000016114069,0.00021700512,0.00008619431,0.000004514358,0.0000053668596,0.0058452105,0.0003093192,0.0017612682,0.000666184,0.0009272202,0.99016064],"study_design_scores_gemma":[0.0142663075,0.0003387222,0.09071013,0.0044206865,0.00007369049,0.0013846215,0.0029102988,0.72245115,0.043168608,0.027583364,0.0876664,0.005026033],"about_ca_topic_score_codex":0.000026494563,"about_ca_topic_score_gemma":8.5242664e-7,"teacher_disagreement_score":0.9851346,"about_ca_system_score_codex":0.000045794794,"about_ca_system_score_gemma":0.00004751646,"threshold_uncertainty_score":0.6213145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1634861,0.000067110406,0.8348226,0.00017371055,0.00024912544,0.00013694627,1.6927004e-7,0.000097782795,0.00096647564],"genre_scores_gemma":[0.97506577,0.000008226234,0.023771083,0.0011092186,0.000019714187,0.0000147788905,0.0000032929058,0.0000049592104,0.0000029620467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998687,0.00003569905,0.00056947756,0.00015860662,0.00026366493,0.0002855471],"domain_scores_gemma":[0.9990543,0.000047254016,0.00043941074,0.00028990218,0.00011794165,0.00005115707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004449712,0.00013616875,0.00017643654,0.00050144695,0.00007294333,0.0002442673,0.0006187713,0.000071997,0.0000081981],"category_scores_gemma":[0.0000369345,0.0001278896,0.000035816756,0.001387657,0.00005946567,0.004750673,0.00016256118,0.00020252961,0.000012927137],"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.0001553148,0.00021663544,0.008782272,0.00067812175,0.000038175585,0.000019074048,0.053755492,0.13451804,0.0017746566,0.0124379145,0.0013713668,0.7862529],"study_design_scores_gemma":[0.00057605095,0.000053158783,0.0049014585,0.00043485046,0.000005052682,0.00001009059,0.00015707416,0.9881717,0.0048963325,0.00036250567,0.0001595126,0.00027219055],"about_ca_topic_score_codex":0.000050993105,"about_ca_topic_score_gemma":0.000006026021,"teacher_disagreement_score":0.85365367,"about_ca_system_score_codex":0.00006094568,"about_ca_system_score_gemma":0.000054084732,"threshold_uncertainty_score":0.5215186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22341509,0.000008673927,0.77407223,0.0016282086,0.00007187523,0.00022526272,0.0000018812857,0.00014114722,0.00043566024],"genre_scores_gemma":[0.89257276,9.513375e-7,0.106040835,0.0012531605,0.00002592834,0.000053949298,0.000026143365,0.0000107681835,0.00001548935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846315,0.00007246779,0.00042398425,0.00022684889,0.00044527807,0.00036827193],"domain_scores_gemma":[0.99924654,0.000086945736,0.0001565807,0.00026207158,0.00016648366,0.00008135429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057219825,0.00014964327,0.00013298579,0.000633991,0.00017063213,0.00036817655,0.00042680954,0.000051360425,0.000017453378],"category_scores_gemma":[0.00041083238,0.00016603386,0.000025992511,0.0012106657,0.000024877054,0.0058691553,0.00010267579,0.00018990834,0.00015229062],"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.000056530207,0.00007213395,0.00080392795,0.00017595498,0.000015715703,0.000010533705,0.030958341,0.19152501,0.028755497,0.0072629876,0.000360803,0.7400026],"study_design_scores_gemma":[0.0011127193,0.00007291626,0.0054421895,0.00021713517,0.000004394831,0.000009371488,0.0008554195,0.9697693,0.010730477,0.004607504,0.0065782447,0.00060034584],"about_ca_topic_score_codex":0.0000242762,"about_ca_topic_score_gemma":0.000005558835,"teacher_disagreement_score":0.77824426,"about_ca_system_score_codex":0.00018365624,"about_ca_system_score_gemma":0.00007353894,"threshold_uncertainty_score":0.67706645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049181666,0.00002108739,0.94424236,0.003917927,0.00010976332,0.00012232445,0.000002471654,0.00029934428,0.0021030663],"genre_scores_gemma":[0.95117515,4.738042e-7,0.04385436,0.0048864363,0.00003704535,0.0000135345335,0.000017013846,0.000005108974,0.0000108952745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882185,0.000009032993,0.0003603386,0.00015095774,0.00037996515,0.00027784595],"domain_scores_gemma":[0.9992697,0.000008783256,0.00027174616,0.00021874721,0.0001639848,0.000067037545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718746,0.00013967871,0.00012458948,0.00009736826,0.00025373793,0.0006630765,0.00041642025,0.00003853124,0.0000011830705],"category_scores_gemma":[0.000021314201,0.00011360251,0.00002421006,0.000509926,0.00004836665,0.0051396666,0.000046385478,0.00012463663,0.000073871786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011161705,0.0001533968,0.0013651476,0.0011123131,0.000070483926,0.00012635776,0.022366999,0.14795431,0.0045554573,0.03882858,0.0027038674,0.78065145],"study_design_scores_gemma":[0.022586154,0.0006857519,0.017665142,0.00673693,0.000056532343,0.0030597616,0.0016558367,0.5943952,0.015904132,0.0018001773,0.33079332,0.0046610064],"about_ca_topic_score_codex":0.000030724044,"about_ca_topic_score_gemma":0.000002495108,"teacher_disagreement_score":0.90199345,"about_ca_system_score_codex":0.000047718277,"about_ca_system_score_gemma":0.00013733775,"threshold_uncertainty_score":0.63940626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92037475,0.000010282554,0.07726726,0.0012617529,0.00014002447,0.00037678285,0.00002022547,0.000034847086,0.00051407784],"genre_scores_gemma":[0.976686,4.0356983e-7,0.02261373,0.0006555264,0.00001681662,0.000009127009,0.000008070722,0.000005428139,0.0000049090972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875975,0.00003032137,0.00070174364,0.000055868975,0.00033261732,0.00011967311],"domain_scores_gemma":[0.998811,0.00008493887,0.00069649855,0.00020400943,0.0001885905,0.000014950864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029551357,0.00009491588,0.00017949946,0.000118801894,0.000045730598,0.00002143659,0.0001728034,0.00004558072,0.00000889697],"category_scores_gemma":[0.00073924515,0.00007004025,0.000035732304,0.00046851367,0.00004276979,0.00028093887,0.000020869393,0.00009236558,0.0000019723068],"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.00016140564,0.0012319853,0.0006759493,0.004868153,0.000059142032,0.0000022159413,0.08657453,0.2462623,0.24463826,0.32749507,0.018747326,0.069283664],"study_design_scores_gemma":[0.004960428,0.00023363484,0.0030543776,0.002963765,0.00011065947,0.00003055257,0.0016348063,0.3897456,0.19167602,0.40302256,0.0015450619,0.0010225537],"about_ca_topic_score_codex":0.0000017055729,"about_ca_topic_score_gemma":0.0000016482985,"teacher_disagreement_score":0.1434833,"about_ca_system_score_codex":0.0000546761,"about_ca_system_score_gemma":0.000054683966,"threshold_uncertainty_score":0.28561586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011328438,0.0000019522975,0.9197791,0.026302768,0.000013307513,0.05148108,6.253947e-7,0.00015802946,0.0011302625],"genre_scores_gemma":[0.71561545,1.4604686e-7,0.014035841,0.042020924,0.00004357042,0.22826084,0.0000072613107,0.0000058659675,0.000010061216],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871826,0.00007403035,0.00040730013,0.00012820153,0.00034876177,0.00032345921],"domain_scores_gemma":[0.99926597,0.00003916147,0.00023683094,0.0003711281,0.00006006425,0.000026833246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894663,0.00011683962,0.000084628744,0.00012722936,0.00017544466,0.0004510869,0.0010106985,0.00003403321,0.0000074002805],"category_scores_gemma":[0.00003631301,0.000089186186,0.000026574804,0.0005690751,0.00004737912,0.006146086,0.00007241116,0.0002747855,0.00014133491],"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.000036987596,0.0001589658,0.00037715404,0.00033682777,0.0000070151914,0.0000025980753,0.062305443,0.0048583895,0.00052402006,0.300098,0.0031236175,0.62817097],"study_design_scores_gemma":[0.0022452779,0.00006925135,0.0029066838,0.00013192261,0.000003515958,0.00009670166,0.00037845585,0.30449304,0.0017092006,0.021906452,0.66552615,0.0005333651],"about_ca_topic_score_codex":0.000002987328,"about_ca_topic_score_gemma":0.000004986186,"teacher_disagreement_score":0.9057433,"about_ca_system_score_codex":0.0001290535,"about_ca_system_score_gemma":0.000095872325,"threshold_uncertainty_score":0.44557637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055775363,0.0000071704235,0.9289739,0.014114764,0.000081241094,0.00029420422,0.000008423298,0.000049260547,0.0006956568],"genre_scores_gemma":[0.9088579,4.6106658e-7,0.07674341,0.014100562,0.00007077986,0.000063181295,0.0001205555,0.000004482361,0.00003868379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992375,0.000018608645,0.0002862646,0.000082856415,0.00025517377,0.00011959037],"domain_scores_gemma":[0.9994223,0.000105661005,0.00023349766,0.000116636256,0.000106376574,0.000015540321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030765374,0.000075509146,0.000063311214,0.00012241467,0.00012376378,0.00016889475,0.00025363482,0.000021957912,0.0000023062187],"category_scores_gemma":[0.000028715236,0.00005577386,0.00003217722,0.00022722787,0.000019237117,0.0011450374,0.000017419552,0.000043527038,0.000017960188],"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.00010831073,0.00012995854,0.00020563317,0.0005448811,0.000058789148,0.000001088743,0.007675482,0.14264514,0.009320333,0.48190966,0.12831452,0.22908619],"study_design_scores_gemma":[0.002425703,0.0003182938,0.0029976757,0.00030286156,0.000028109365,0.000028314116,0.00014378075,0.7398568,0.040380787,0.12178547,0.09106502,0.00066722225],"about_ca_topic_score_codex":0.0000050303306,"about_ca_topic_score_gemma":6.833417e-7,"teacher_disagreement_score":0.85308254,"about_ca_system_score_codex":0.000023607074,"about_ca_system_score_gemma":0.00004159663,"threshold_uncertainty_score":0.2274392},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11218255,0.000081294595,0.88110244,0.005772681,0.0001965612,0.0004065407,0.0000028516417,0.00021341165,0.00004169006],"genre_scores_gemma":[0.9530817,0.0000064868304,0.04030811,0.00637584,0.000098447024,0.00009958415,0.000013485807,0.0000067586398,0.000009587182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989062,0.000013699598,0.0003612168,0.00020924734,0.00019014387,0.00031946762],"domain_scores_gemma":[0.99929005,0.000054988297,0.0001840842,0.00023904555,0.00013674238,0.00009511293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027553824,0.00015377776,0.0001474294,0.00006287406,0.0003030538,0.00053569593,0.00027841804,0.00007611275,0.0000019354115],"category_scores_gemma":[0.00003908417,0.00013990983,0.000044253276,0.00021208538,0.00008320667,0.0023143983,0.000061927414,0.000119445416,0.000007368816],"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.00005798286,0.00005265661,0.00097251916,0.00020418804,0.000019408333,0.0000033717604,0.0017700744,0.30538732,0.000034686665,0.0073551647,0.0013696984,0.68277293],"study_design_scores_gemma":[0.002168082,0.000060939885,0.0018559215,0.00011926855,0.000016345899,0.00004416586,0.00002702468,0.98585105,0.000071010756,0.0027621354,0.006686515,0.0003375347],"about_ca_topic_score_codex":0.0000065387303,"about_ca_topic_score_gemma":0.000002913778,"teacher_disagreement_score":0.84089917,"about_ca_system_score_codex":0.00007152183,"about_ca_system_score_gemma":0.00007018161,"threshold_uncertainty_score":0.5705357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03777259,0.000008415013,0.9535303,0.0028538622,0.00024086963,0.0001018681,0.0000012417233,0.00018506436,0.0053057717],"genre_scores_gemma":[0.9622576,9.967173e-7,0.02441348,0.013196888,0.000055554523,0.0000053903946,0.000056066405,0.0000027508436,0.000011223768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902064,0.000011751592,0.0003259519,0.00009198576,0.0003714698,0.00017819287],"domain_scores_gemma":[0.99955785,0.000050993705,0.00013399708,0.00011615138,0.000086422,0.0000545992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842276,0.000092481474,0.000061026873,0.00031891468,0.00020413745,0.0002818092,0.00021657282,0.000037056892,0.0000050224485],"category_scores_gemma":[0.000027130542,0.00008788893,0.000028794144,0.00046491445,0.000013289447,0.0041467706,0.00000896102,0.00009322003,0.00013570361],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029258435,0.000027395006,0.00001890274,0.00006418915,0.000005757823,0.0000026319829,0.006039482,0.015354747,0.0018801593,0.1104319,0.0039396496,0.8622059],"study_design_scores_gemma":[0.00325255,0.00038211967,0.015919497,0.000297498,0.000018089046,0.00015495687,0.0004858846,0.74463135,0.039605092,0.017638465,0.17613705,0.0014774646],"about_ca_topic_score_codex":0.0000018334274,"about_ca_topic_score_gemma":5.211641e-7,"teacher_disagreement_score":0.92911685,"about_ca_system_score_codex":0.000057502046,"about_ca_system_score_gemma":0.000039269733,"threshold_uncertainty_score":0.35840067},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.474016,0.000014793046,0.5230353,0.001457881,0.00006278142,0.000043844448,5.996724e-7,0.000024303585,0.0013445092],"genre_scores_gemma":[0.93118584,5.7579143e-7,0.06758845,0.0011794746,0.000022281676,0.0000037079533,0.000004039219,0.0000012070783,0.000014430867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.00001781832,0.0002969931,0.00004917562,0.00022962195,0.00007340858],"domain_scores_gemma":[0.9995599,0.000039528204,0.00019245717,0.00011334693,0.00008130215,0.000013487613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019363583,0.000048434566,0.00006094139,0.000049829818,0.00008835898,0.000080417674,0.00024941764,0.00001483114,0.000031393774],"category_scores_gemma":[0.000024606798,0.000036353773,0.000023651557,0.00036083287,0.00003520602,0.0019672054,0.000020153304,0.0000400157,0.00002213235],"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.0000072115126,0.00001345745,0.00034244504,0.000105313105,0.0000066947355,1.10883875e-7,0.0048775245,0.1535928,0.0012664825,0.0015154157,0.00031088776,0.8379617],"study_design_scores_gemma":[0.00019017227,0.00001128384,0.0037220682,0.000065174725,0.0000054057914,0.00001493424,0.000032954264,0.9876356,0.0062639005,0.0006307103,0.0013497939,0.00007800935],"about_ca_topic_score_codex":0.000010349453,"about_ca_topic_score_gemma":1.4224835e-7,"teacher_disagreement_score":0.83788365,"about_ca_system_score_codex":0.000008737405,"about_ca_system_score_gemma":0.00004212471,"threshold_uncertainty_score":0.14824638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2122181,0.000081797734,0.784079,0.0030691663,0.0001004578,0.00014813195,0.0000023853197,0.000045272074,0.00025567392],"genre_scores_gemma":[0.8549465,0.000004113858,0.14374173,0.0012685241,0.000019281288,0.0000074189165,0.0000017785745,0.0000032405112,0.0000074055347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999066,0.000058888123,0.0004034633,0.000086990854,0.00024571916,0.0001389677],"domain_scores_gemma":[0.99907994,0.000086046355,0.00043814935,0.00021503765,0.00015281049,0.00002798626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918714,0.00008780761,0.00012726932,0.00010982254,0.0001321256,0.00013233551,0.00035819877,0.000038887323,0.0000012912361],"category_scores_gemma":[0.000085957254,0.00006648202,0.000027999275,0.00029664833,0.00017909531,0.0026798262,0.000084848754,0.00009458043,0.00000467625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057414858,0.000020244988,0.001070426,0.00054153125,0.000038312053,1.806517e-7,0.03271263,0.0022628189,0.012736208,0.015593076,0.0025469293,0.93242025],"study_design_scores_gemma":[0.00059399713,0.00009467228,0.009038046,0.00017747027,0.000012152893,0.000023470428,0.0003126396,0.79316765,0.17824242,0.0005027179,0.017612875,0.00022191237],"about_ca_topic_score_codex":0.000011802115,"about_ca_topic_score_gemma":2.393142e-7,"teacher_disagreement_score":0.9321983,"about_ca_system_score_codex":0.000035279812,"about_ca_system_score_gemma":0.000036787314,"threshold_uncertainty_score":0.2711058},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050601624,0.000002061368,0.94766754,0.0001374625,0.0000797234,0.00040366995,0.000042531345,0.000084622654,0.0009807437],"genre_scores_gemma":[0.047287058,3.336072e-7,0.9519085,0.00047365244,0.000023269578,0.00017845283,0.000045854358,0.000021116835,0.00006173506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990192,0.000021717855,0.0004510936,0.00008411546,0.00024180186,0.0001820928],"domain_scores_gemma":[0.9985662,0.00030030202,0.000615101,0.00015267439,0.00032027691,0.000045408593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000152392,0.00013479567,0.0001844289,0.00008281021,0.00021617666,0.000062337975,0.000095530166,0.000047734033,0.000051306408],"category_scores_gemma":[0.00083653704,0.00011763125,0.0000451862,0.00024301947,0.000057149817,0.00084301713,0.000011756054,0.00006746611,0.000009195472],"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.00013845481,0.00093990687,0.0006170716,0.010646132,0.0005355277,0.000007807236,0.11111945,0.007406382,0.015482376,0.5425857,0.086898156,0.22362308],"study_design_scores_gemma":[0.014275606,0.00040243845,0.000028528506,0.0028961687,0.0007122673,0.00048286875,0.024321632,0.36749643,0.05184215,0.49087724,0.04374479,0.0029198688],"about_ca_topic_score_codex":0.0000014667238,"about_ca_topic_score_gemma":7.464773e-7,"teacher_disagreement_score":0.36009008,"about_ca_system_score_codex":0.00006941874,"about_ca_system_score_gemma":0.0001230251,"threshold_uncertainty_score":0.47968632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011476215,0.000049984643,0.9892562,0.00811807,0.00014922177,0.00049672805,0.000027347365,0.000225058,0.0005297706],"genre_scores_gemma":[0.052829184,0.0000017445227,0.9382446,0.007598593,0.00044091232,0.0003480082,0.0002668251,0.000027442306,0.00024268148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985953,0.000024245017,0.0004509192,0.00020952291,0.00038033733,0.00033966676],"domain_scores_gemma":[0.99895865,0.00010290463,0.00036281653,0.00036830234,0.00015686279,0.000050488838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030114822,0.00019751163,0.00015628849,0.00013491408,0.0005838637,0.00080517476,0.00068391685,0.000056392226,0.0000046032965],"category_scores_gemma":[0.000008362366,0.00012577437,0.00005502529,0.00034405515,0.00009462768,0.0044431123,0.00008423546,0.00012900779,0.000051696472],"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.000032223357,0.000053573607,0.00003814511,0.000087206754,0.00002193061,0.0000027649257,0.002325453,0.001609884,0.00058746076,0.00018362753,0.17091049,0.8241472],"study_design_scores_gemma":[0.0010445998,0.000119137934,0.00033231566,0.000092601214,0.000018791397,0.000051151197,0.00015368413,0.91239804,0.00033671482,0.00012772335,0.08500137,0.00032385078],"about_ca_topic_score_codex":0.00008595125,"about_ca_topic_score_gemma":0.0000045725974,"teacher_disagreement_score":0.9107882,"about_ca_system_score_codex":0.000048966194,"about_ca_system_score_gemma":0.0001499001,"threshold_uncertainty_score":0.77643186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2050064,0.000011609793,0.789466,0.0015743828,0.0005427529,0.00014332964,6.8895116e-7,0.00011019315,0.0031445955],"genre_scores_gemma":[0.9819676,0.0000012940158,0.01272837,0.0052423747,0.000012525469,0.000021617523,0.000013425272,0.0000033764975,0.000009376617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990016,0.00005518752,0.0003084,0.00015041654,0.00031424314,0.00017014703],"domain_scores_gemma":[0.999578,0.000031290157,0.00014628559,0.00013441393,0.00007014731,0.000039852424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036975075,0.000106316096,0.0000782913,0.00057968096,0.00011844216,0.00029065605,0.00017374448,0.000048644564,0.0000065471068],"category_scores_gemma":[0.00007494896,0.000108174536,0.000031512587,0.000828624,0.000013145657,0.002732573,0.000021834658,0.00015589966,0.00006587302],"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.000053647702,0.00013587104,0.00075943203,0.00011701515,0.000011335905,0.000011998154,0.012220218,0.11462406,0.003992071,0.033252697,0.0025608558,0.8322608],"study_design_scores_gemma":[0.0063818656,0.0006093936,0.032266848,0.0007430492,0.000018785076,0.00039002203,0.000905651,0.7657507,0.05520372,0.06610902,0.06941857,0.0022023476],"about_ca_topic_score_codex":0.0000067907936,"about_ca_topic_score_gemma":0.0000063354987,"teacher_disagreement_score":0.83005846,"about_ca_system_score_codex":0.00014701993,"about_ca_system_score_gemma":0.00007254849,"threshold_uncertainty_score":0.44112295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18038575,0.000043586715,0.81498355,0.002861485,0.00007568321,0.00007785432,0.000005602122,0.00008736611,0.0014791065],"genre_scores_gemma":[0.93168235,0.0000066026923,0.061878838,0.006201705,0.00004670472,0.00001093813,0.00007712183,0.0000038289922,0.000091901195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914706,0.000018291406,0.00032267952,0.00009709358,0.00028163922,0.00013323266],"domain_scores_gemma":[0.99958944,0.000022434064,0.00015342559,0.00012247717,0.000074491494,0.000037743954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017372581,0.00008570305,0.00008782572,0.00012108958,0.00011056098,0.00021263525,0.00025728322,0.000022198004,0.00003877361],"category_scores_gemma":[0.0000147157225,0.00008715585,0.00002918027,0.00037072596,0.000023770115,0.0036587338,0.000028469101,0.000059446767,0.00006998523],"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.00002296767,0.000021674829,0.000121009114,0.00011778405,0.000014090704,8.6540746e-7,0.00472229,0.11515261,0.005031262,0.00188809,0.014574399,0.85833293],"study_design_scores_gemma":[0.0017478463,0.0000705901,0.0012305004,0.00013735972,0.0000098783385,0.000049925682,0.00007039258,0.8334569,0.017640555,0.0017413534,0.14332959,0.0005151087],"about_ca_topic_score_codex":0.000011609842,"about_ca_topic_score_gemma":3.6304536e-7,"teacher_disagreement_score":0.8578178,"about_ca_system_score_codex":0.000025654519,"about_ca_system_score_gemma":0.000049472088,"threshold_uncertainty_score":0.35541126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018476129,0.00012368242,0.9731841,0.006396667,0.0000986366,0.0003366523,0.00001186418,0.0008425626,0.0005297109],"genre_scores_gemma":[0.6509243,0.000014175397,0.34045622,0.00845791,0.000040311304,0.0000141666505,0.00007129673,0.000013479325,0.000008105495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851644,0.000009525035,0.0004230453,0.00020509757,0.00039744505,0.00044842734],"domain_scores_gemma":[0.99872655,0.00020180883,0.00048052365,0.00039142324,0.00013514253,0.000064569096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005260255,0.00020001434,0.00018326532,0.0003346469,0.00031183052,0.00031873662,0.000773643,0.000067067034,9.39463e-7],"category_scores_gemma":[0.00018671548,0.00016609044,0.0000341851,0.00060764205,0.00013643946,0.008582957,0.00008772465,0.00019939804,0.000014938706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002731575,0.00012439034,0.001875808,0.0035075487,0.00012839067,0.00005290129,0.02087218,0.037370592,0.005920687,0.03704459,0.018298956,0.8745308],"study_design_scores_gemma":[0.012246322,0.0015463157,0.007070099,0.008734868,0.00018261775,0.0005424321,0.011603295,0.28620258,0.18383995,0.009997192,0.47121888,0.006815449],"about_ca_topic_score_codex":0.000012890804,"about_ca_topic_score_gemma":0.000009886084,"teacher_disagreement_score":0.86771536,"about_ca_system_score_codex":0.00013009072,"about_ca_system_score_gemma":0.000078869554,"threshold_uncertainty_score":0.6772972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57820433,0.0000046162,0.41974896,0.0013116233,0.00024252516,0.00012675134,0.0000030795427,0.00006544802,0.00029266675],"genre_scores_gemma":[0.99551415,5.5445315e-7,0.0030944902,0.0012377696,0.000051605224,0.00002368083,0.00006189819,0.0000048451684,0.000011013172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988927,0.000029124727,0.00048470448,0.00013520241,0.00028235718,0.00017586273],"domain_scores_gemma":[0.9992297,0.000013356788,0.00037762642,0.00014601811,0.00019544282,0.000037803922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024224978,0.00011406251,0.00014917318,0.00030559846,0.00011008789,0.00011532411,0.00019525633,0.000054804732,0.00000395926],"category_scores_gemma":[0.000009700188,0.0000996684,0.00002481456,0.0005420279,0.000033876393,0.0029686252,0.00001416053,0.00019799275,0.00001587633],"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.000086912216,0.000074587326,0.0008986866,0.00029351015,0.000025089039,0.00000733771,0.0062369257,0.90232366,0.06847867,0.006080934,0.000071408664,0.015422289],"study_design_scores_gemma":[0.009173035,0.00043055648,0.020489337,0.005083078,0.000023902101,0.0012123307,0.00041458537,0.8520763,0.10575346,0.0005634428,0.0032642582,0.001515748],"about_ca_topic_score_codex":0.00012284193,"about_ca_topic_score_gemma":0.000020659356,"teacher_disagreement_score":0.41730982,"about_ca_system_score_codex":0.00012691479,"about_ca_system_score_gemma":0.00014762359,"threshold_uncertainty_score":0.40643597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12696938,0.000046020858,0.84670466,0.024758434,0.00035811603,0.00012289376,0.0000025721927,0.00012866071,0.0009092543],"genre_scores_gemma":[0.97594094,0.000008939091,0.018766517,0.0051672338,0.00007078122,0.0000067138753,0.0000070702126,0.000003360672,0.000028430675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931294,0.000015835965,0.00016809258,0.00011676835,0.00021714995,0.00016923253],"domain_scores_gemma":[0.9990825,0.000030887128,0.00028862464,0.0005054394,0.000049402843,0.000043143675],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031821037,0.00009194244,0.00007590703,0.000047861402,0.0016590275,0.00249924,0.00078981783,0.000033042503,0.0000022749693],"category_scores_gemma":[0.00007964961,0.00006296838,0.000017466222,0.000061246006,0.00007815066,0.0073888265,0.00045652804,0.00013736617,0.000025621634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008577386,0.000009163049,0.0039780643,0.000076778444,0.0000068739064,0.000004704506,0.004232529,0.00009911266,0.0005542218,0.0017416773,0.0147907,0.9744976],"study_design_scores_gemma":[0.0010136178,0.000024469387,0.20387267,0.000337965,0.000013164467,0.000097824595,0.00023233808,0.6909168,0.0019483321,0.00083808,0.100161515,0.0005432329],"about_ca_topic_score_codex":0.000041202275,"about_ca_topic_score_gemma":0.0000021371618,"teacher_disagreement_score":0.9739544,"about_ca_system_score_codex":0.000018175297,"about_ca_system_score_gemma":0.000025362859,"threshold_uncertainty_score":0.9996407},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018813804,0.000022039218,0.97276944,0.004115354,0.0006841915,0.00013296976,0.000007989303,0.00024153538,0.0032126643],"genre_scores_gemma":[0.937162,0.000005709324,0.05658754,0.0058646807,0.00014452383,0.000024435782,0.000078692,0.000011155713,0.00012130678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986783,0.000022633529,0.0003745207,0.00021264362,0.00042965496,0.00028223044],"domain_scores_gemma":[0.9982379,0.0000187374,0.0005368549,0.00093868974,0.00016687441,0.000100964506],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00019507362,0.0001768377,0.00014651594,0.00014188324,0.0010297777,0.0021531277,0.001377355,0.000065650165,0.000016898748],"category_scores_gemma":[0.00006750499,0.00014143824,0.000046234818,0.00009710503,0.00008833708,0.015497233,0.00068048394,0.0002002322,0.00016596972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002388313,0.00004374138,0.0012906732,0.000105353975,0.000012130147,0.000007888279,0.0031111625,0.0003492171,0.0021408685,0.0014182649,0.02494893,0.9665479],"study_design_scores_gemma":[0.0016364623,0.00005654516,0.017595042,0.0007243695,0.000012079491,0.000039622173,0.00018007238,0.71638787,0.0062661176,0.0003560518,0.2560188,0.0007270184],"about_ca_topic_score_codex":0.00003206445,"about_ca_topic_score_gemma":8.237161e-7,"teacher_disagreement_score":0.96582085,"about_ca_system_score_codex":0.00004026932,"about_ca_system_score_gemma":0.000048291313,"threshold_uncertainty_score":0.9988827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002850012,0.000009409951,0.9766907,0.009195705,0.00025233525,0.00059659255,0.000008039022,0.00022125799,0.010175924],"genre_scores_gemma":[0.40270692,0.000022222832,0.51377654,0.08127652,0.00028915837,0.00044521954,0.0014239731,0.000023668936,0.0000357756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980975,0.0001056889,0.0006056578,0.00015783872,0.00072850613,0.00030482365],"domain_scores_gemma":[0.9985582,0.000043018234,0.0005648884,0.0004821077,0.0003042563,0.00004747949],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011440442,0.00022161484,0.00016637913,0.00046731584,0.00023853083,0.0025971222,0.0012995005,0.0001270667,0.000009829328],"category_scores_gemma":[0.0000914432,0.00015089722,0.000032201504,0.00045298017,0.00007298058,0.009234715,0.00031319459,0.00070094556,0.00021621278],"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.00016422912,0.00012143029,0.0020846827,0.0039015312,0.00007021919,0.000016055406,0.32156855,0.46867567,0.00004233853,0.0052901222,0.07019455,0.12787062],"study_design_scores_gemma":[0.0006564698,0.0000675005,0.00078769017,0.00061908585,0.0000052826013,0.00003512209,0.00032963025,0.93913525,0.00003595545,0.0005816667,0.05728752,0.00045880486],"about_ca_topic_score_codex":0.000046115154,"about_ca_topic_score_gemma":0.0000029414832,"teacher_disagreement_score":0.4704596,"about_ca_system_score_codex":0.00010854515,"about_ca_system_score_gemma":0.00027255501,"threshold_uncertainty_score":0.9984383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6509,0.00003669961,0.34320492,0.0049040546,0.00016800914,0.00007226734,1.9722415e-7,0.00006440599,0.0006494772],"genre_scores_gemma":[0.9872402,0.0000059964977,0.01231757,0.00040322376,0.000020996466,0.0000061335713,9.827536e-7,0.0000017526625,0.0000031352129],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994812,0.000008563047,0.0001640893,0.00009478342,0.0001246861,0.00012665639],"domain_scores_gemma":[0.9995626,0.0000045109045,0.00014888667,0.00022985668,0.000026011507,0.00002811162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017578604,0.000062609986,0.00005967104,0.00019747125,0.0003848329,0.0010162626,0.0002962749,0.000029479475,4.8181477e-7],"category_scores_gemma":[0.000021664084,0.000059522135,0.000014934382,0.00010670481,0.00006670108,0.005901264,0.00008612347,0.000092076676,0.0000049384626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005694154,0.0000137333645,0.0062268996,0.00015057914,0.000004964686,0.0000042190404,0.009754524,0.0023565078,0.0040763207,0.003327169,0.00011495714,0.97396445],"study_design_scores_gemma":[0.0017789764,0.000045937973,0.52910876,0.0005129971,0.00000998817,0.00017442992,0.00067335315,0.45198464,0.00652326,0.0052078017,0.0032819894,0.0006978616],"about_ca_topic_score_codex":0.000043595104,"about_ca_topic_score_gemma":0.0000019658892,"teacher_disagreement_score":0.97326654,"about_ca_system_score_codex":0.00001490906,"about_ca_system_score_gemma":0.000014468372,"threshold_uncertainty_score":0.97998434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24907508,0.000021717435,0.7448801,0.004009753,0.00031143366,0.000098290875,0.0000011350628,0.00017757707,0.001424929],"genre_scores_gemma":[0.96873266,0.0000010975936,0.023324016,0.007811738,0.00007189595,0.000011085746,0.000029944762,0.0000026520165,0.000014899729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913913,0.000027792132,0.00030494656,0.00012399291,0.00023575197,0.00016841081],"domain_scores_gemma":[0.99953616,0.00003307635,0.00013265263,0.00013534668,0.00012484283,0.000037910708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024729196,0.00009207725,0.00007806825,0.00046447094,0.00016138068,0.00033673135,0.0003037161,0.000038384565,0.000008190103],"category_scores_gemma":[0.000054580825,0.00008969343,0.00002183223,0.0009815053,0.000042527077,0.0038969766,0.000030703122,0.000084402665,0.00010549422],"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.00006936718,0.00010587116,0.0031051214,0.00012869862,0.000026183841,0.000010502735,0.039826337,0.02761636,0.015888302,0.06506296,0.026387542,0.82177275],"study_design_scores_gemma":[0.001312852,0.000108253706,0.050418142,0.00012905565,0.0000050736694,0.00004174389,0.00017869528,0.9038743,0.010201751,0.009187473,0.024003506,0.00053916906],"about_ca_topic_score_codex":0.0000122536485,"about_ca_topic_score_gemma":0.000016303771,"teacher_disagreement_score":0.8762579,"about_ca_system_score_codex":0.000037413658,"about_ca_system_score_gemma":0.00006693807,"threshold_uncertainty_score":0.3657592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033079732,0.00077184197,0.92989,0.032558277,0.0008090656,0.0005286342,0.00004378742,0.0013130172,0.0010056631],"genre_scores_gemma":[0.9104982,0.00006495549,0.063149594,0.025711736,0.00017416892,0.000106929,0.00024606904,0.000028601895,0.000019756926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982402,0.000051088282,0.00056819327,0.00039814453,0.00043838908,0.0003040159],"domain_scores_gemma":[0.99870807,0.000036798887,0.0005459779,0.00049035,0.00009078934,0.00012799463],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027613743,0.00033363246,0.00030683214,0.00022022829,0.00021203565,0.0018816333,0.0010020705,0.00019856374,0.0000066166667],"category_scores_gemma":[0.0000635966,0.00031917228,0.0000715045,0.0002483497,0.00008612672,0.0033511745,0.0011768176,0.0005365495,0.00004651452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003612944,0.000054776076,0.00061754667,0.008409647,0.00013718565,0.00003094677,0.044674464,0.0025105204,0.0012340536,0.011514235,0.03142032,0.8993602],"study_design_scores_gemma":[0.0023302566,0.00018852003,0.009004852,0.004146314,0.00013717041,0.00023026565,0.0011452588,0.76815987,0.0031577768,0.048899893,0.1586156,0.0039842217],"about_ca_topic_score_codex":0.000021205153,"about_ca_topic_score_gemma":5.86611e-7,"teacher_disagreement_score":0.89537597,"about_ca_system_score_codex":0.00005630029,"about_ca_system_score_gemma":0.00017412422,"threshold_uncertainty_score":0.99992603},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003970662,0.000030288222,0.9518834,0.0463572,0.00008514004,0.00032523775,0.000034637,0.00041029148,0.0004767548],"genre_scores_gemma":[0.43114904,0.000050299426,0.4564325,0.110832304,0.00017517306,0.00006768191,0.0012527115,0.000017850603,0.000022445041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856526,0.000085362735,0.0005340077,0.00016500003,0.0004077667,0.00024260319],"domain_scores_gemma":[0.9990701,0.00007206795,0.0002922708,0.00014475065,0.00026987962,0.0001509129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000306252,0.00015516517,0.0002651012,0.00010922191,0.00023341605,0.000510786,0.00048488105,0.00004789977,0.000009968434],"category_scores_gemma":[0.00029480344,0.00013318488,0.00007576862,0.0006527328,0.00012536235,0.0046057203,0.00013499866,0.00019439189,0.00006152908],"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.004528714,0.00013472638,0.00003722695,0.00038737847,0.0001590789,0.000018357861,0.041455183,0.4396316,0.0003214479,0.009440554,0.01755837,0.48632735],"study_design_scores_gemma":[0.021661254,0.000019297267,0.000010531183,0.00003071228,0.0000055611604,0.0000016928775,0.00017843297,0.967372,0.0001457349,0.00005710718,0.0103486795,0.00016896975],"about_ca_topic_score_codex":0.00000467265,"about_ca_topic_score_gemma":3.5525184e-7,"teacher_disagreement_score":0.5277404,"about_ca_system_score_codex":0.000042004784,"about_ca_system_score_gemma":0.00009982649,"threshold_uncertainty_score":0.54311216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1333061,0.00023898428,0.83775055,0.02476113,0.00064432406,0.00021821131,0.000008991988,0.0009545873,0.0021171493],"genre_scores_gemma":[0.92709684,0.000034103516,0.06382603,0.008578006,0.00014681135,0.000018679986,0.00015592475,0.000020257816,0.0001233165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854606,0.000065830674,0.0003821645,0.00031442524,0.00041531827,0.00027617416],"domain_scores_gemma":[0.99861586,0.00003834061,0.000674972,0.00041018263,0.0001628381,0.000097829754],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00029547047,0.0002641524,0.00029483196,0.0002505295,0.00030147683,0.0029828548,0.0006342444,0.00014341576,0.0000081729995],"category_scores_gemma":[0.00006506718,0.00025354256,0.00005978551,0.0002643357,0.000052035222,0.0032537433,0.00047672377,0.000843514,0.000022611861],"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.000013154622,0.0000675435,0.0019581313,0.0026614661,0.000109354696,0.00004745961,0.016748983,0.020071127,0.0004260233,0.00026107774,0.009113311,0.9485224],"study_design_scores_gemma":[0.0004266104,0.00001428654,0.014925586,0.0008188269,0.000015277761,0.00006532456,0.00027512203,0.9700893,0.00047500842,0.00017466224,0.012192069,0.00052792707],"about_ca_topic_score_codex":0.000081506354,"about_ca_topic_score_gemma":7.6486316e-7,"teacher_disagreement_score":0.95001817,"about_ca_system_score_codex":0.000075688426,"about_ca_system_score_gemma":0.00018729692,"threshold_uncertainty_score":0.99999166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010140891,0.00011787332,0.9669602,0.016060354,0.00018440722,0.0001684719,0.0000030428455,0.00021023753,0.006154544],"genre_scores_gemma":[0.9273975,0.00000374815,0.056578275,0.0156234205,0.000044947978,0.000054145134,0.000046929414,0.00000812714,0.00024291512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988329,0.000074591604,0.00040265825,0.00015286393,0.000338006,0.0001990221],"domain_scores_gemma":[0.99898696,0.000048933118,0.00030235777,0.0003344131,0.00026841398,0.000058895956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888772,0.00012051609,0.00024805483,0.00006753075,0.0001526076,0.0007188692,0.0002632389,0.00003685844,0.0000030801496],"category_scores_gemma":[0.000076984914,0.00009441617,0.000054203872,0.00042290532,0.00010579161,0.0015810532,0.00004042352,0.000093190145,0.000034114786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013910804,0.0002065607,0.00045205583,0.0029924307,0.00056974386,0.000930924,0.042472806,0.028001765,0.0060260897,0.21112525,0.15138409,0.54192746],"study_design_scores_gemma":[0.2738134,0.00005552504,0.00027088437,0.001706622,0.00008210174,0.002155109,0.0014441629,0.3899382,0.008120983,0.0013468799,0.31926095,0.0018051966],"about_ca_topic_score_codex":0.000007364818,"about_ca_topic_score_gemma":7.927611e-7,"teacher_disagreement_score":0.9172566,"about_ca_system_score_codex":0.000035402427,"about_ca_system_score_gemma":0.00014849727,"threshold_uncertainty_score":0.6932072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011343392,0.00004602224,0.94228524,0.039864574,0.0003326069,0.00042534372,0.000010645858,0.00050138147,0.0051908167],"genre_scores_gemma":[0.921266,0.0000024440074,0.05151543,0.026849952,0.000014356127,0.00021083652,0.000109857545,0.000006772306,0.000024355213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802077,0.0003581035,0.0005310675,0.0001674066,0.0006574513,0.00026518485],"domain_scores_gemma":[0.99856687,0.00022850989,0.00043109947,0.00059974205,0.00010764307,0.00006616326],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014960031,0.00015233528,0.0002444182,0.0003838023,0.0014537354,0.00075184077,0.0014710539,0.000025278188,0.0000750208],"category_scores_gemma":[0.00014309993,0.00015133701,0.00011426123,0.0007620374,0.00023228001,0.0034438304,0.00054810604,0.00039704543,0.00005070241],"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.00089375826,0.00014238711,0.000019313202,0.00007101028,0.00003476873,0.0000020792509,0.009556252,0.0059568123,0.000049268,0.8178612,0.019283118,0.14613006],"study_design_scores_gemma":[0.027001576,0.000058692774,0.000152276,0.000042421987,0.00001009193,0.000046176403,0.0002937125,0.80213,0.00009474041,0.12179421,0.04786853,0.00050760154],"about_ca_topic_score_codex":0.000026306001,"about_ca_topic_score_gemma":0.0000011530021,"teacher_disagreement_score":0.9099226,"about_ca_system_score_codex":0.000134551,"about_ca_system_score_gemma":0.00008213716,"threshold_uncertainty_score":0.9998462},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034589846,0.000039255265,0.9640784,0.0003627127,0.00021539237,0.00019655254,0.000010248327,0.00015271848,0.00035484886],"genre_scores_gemma":[0.5862526,0.0000047596723,0.4122548,0.001356761,0.000023256856,0.00004075222,0.000055383003,0.0000054099964,0.000006205449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881464,0.00002680675,0.00048405185,0.00015868653,0.00027221508,0.0002436004],"domain_scores_gemma":[0.99920964,0.00006966491,0.00038603978,0.0002012852,0.00008600406,0.00004736933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028580058,0.00012931142,0.00015492605,0.0001433787,0.00028772862,0.00032290057,0.00038310158,0.000052389012,0.0000030591273],"category_scores_gemma":[0.000101534664,0.00010729079,0.00006463045,0.00031733245,0.00006312603,0.0055285483,0.00009636244,0.000086618595,0.0000032062521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020356616,0.00013664505,0.00275568,0.00029510757,0.00003708905,0.0000025876975,0.0027992236,0.00049109035,0.0046429355,0.013568265,0.002620644,0.9726304],"study_design_scores_gemma":[0.0033912456,0.00024566398,0.00808904,0.00047962114,0.00003982571,0.00007395594,0.00075290207,0.9068133,0.05453396,0.0064205737,0.018043526,0.0011163348],"about_ca_topic_score_codex":0.000015412785,"about_ca_topic_score_gemma":0.000001265464,"teacher_disagreement_score":0.97151405,"about_ca_system_score_codex":0.00003568714,"about_ca_system_score_gemma":0.000043447235,"threshold_uncertainty_score":0.43751916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042638343,0.00000942873,0.94059473,0.01568319,0.000094597766,0.00020210902,0.0000018589568,0.00024850736,0.00052721816],"genre_scores_gemma":[0.9616261,0.000011486082,0.03530186,0.0029145929,0.000022112155,0.000029171928,0.00001578015,0.0000056206,0.000073246876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987956,0.00005226623,0.00029065995,0.000102151345,0.00051014044,0.0002491789],"domain_scores_gemma":[0.99928975,0.00007653111,0.00012127891,0.00026432725,0.00020025797,0.00004785175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006891066,0.000068748144,0.0000737575,0.00019245317,0.00024329418,0.0004029033,0.0007548845,0.00002872172,0.0000064361093],"category_scores_gemma":[0.00008334606,0.00005457719,0.000030566265,0.0012150255,0.00009622178,0.0032670153,0.00020218194,0.00013382913,0.00013493566],"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.00000392661,0.0000076997885,0.00018841482,0.000098571974,0.000005468317,9.4611806e-7,0.012379207,0.85915273,0.00094805093,0.0007924685,0.003879789,0.12254275],"study_design_scores_gemma":[0.00018109435,0.000015916905,0.003936589,0.000042911164,0.0000011738708,0.0000037867458,0.00021712793,0.9918381,0.001838593,0.000049586364,0.001787622,0.00008748439],"about_ca_topic_score_codex":0.0000112294865,"about_ca_topic_score_gemma":3.300318e-7,"teacher_disagreement_score":0.9189878,"about_ca_system_score_codex":0.000019190999,"about_ca_system_score_gemma":0.00009356212,"threshold_uncertainty_score":0.3885206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037863728,0.0000042960824,0.95273113,0.005100695,0.00014314122,0.00030165972,0.000004398284,0.0036968598,0.0001540972],"genre_scores_gemma":[0.36127707,0.0000017345111,0.63388723,0.004554163,0.000041479652,0.00015519872,0.000046273275,0.000019223296,0.000017652706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984316,0.000023989793,0.00048575155,0.00023713076,0.00044596047,0.00037554395],"domain_scores_gemma":[0.9991782,0.000048444588,0.00016950446,0.00040370662,0.0000918586,0.00010831963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499185,0.00017802519,0.00015266833,0.00053450174,0.00023650118,0.00043562666,0.0006518106,0.0000735584,0.0000014810782],"category_scores_gemma":[0.00004636675,0.00018270829,0.000044913057,0.0013883382,0.000029062738,0.003576827,0.00010192313,0.00021305305,0.00015097922],"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.000012756176,0.000027345324,0.012277712,0.0013389831,0.000038190785,0.0000143320385,0.060064677,0.14066228,0.010839656,0.036886137,0.06479337,0.67304456],"study_design_scores_gemma":[0.000809265,0.00017510117,0.0407746,0.001357547,0.000017770551,0.000068884205,0.0001060792,0.7460965,0.0048238933,0.010762272,0.1929878,0.0020203076],"about_ca_topic_score_codex":0.000036150945,"about_ca_topic_score_gemma":0.0000014118616,"teacher_disagreement_score":0.67102426,"about_ca_system_score_codex":0.00009921263,"about_ca_system_score_gemma":0.00004590546,"threshold_uncertainty_score":0.74506277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51423347,0.00015691912,0.47568318,0.008212909,0.00017291337,0.00012471179,0.0000014514623,0.00087566633,0.00053875375],"genre_scores_gemma":[0.98672503,0.000023927365,0.007936017,0.0052524423,0.000025453215,0.000010683331,0.0000101470005,0.000005988998,0.000010333383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919826,0.00002075595,0.00022846105,0.00013798679,0.00019405052,0.00022049391],"domain_scores_gemma":[0.99960357,0.000060209397,0.000118682205,0.00014128028,0.000031928692,0.00004433666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004039967,0.00010688271,0.000100673395,0.0002532218,0.00028752963,0.00081238104,0.00021137543,0.000036877937,0.0000019251572],"category_scores_gemma":[0.0000423138,0.000101001184,0.00001379879,0.0005967001,0.000054789667,0.0035257197,0.00015172937,0.00008785098,0.000017368266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054688817,0.0000030522704,0.0006512957,0.00018938207,0.000008910389,0.000004509151,0.01351042,0.00020346249,0.0018280935,0.004926592,0.00081935053,0.9778495],"study_design_scores_gemma":[0.0017908037,0.000033040917,0.02226221,0.00046080234,0.000014659163,0.00010149663,0.0013466135,0.94344205,0.0011957566,0.010091262,0.01854171,0.0007196055],"about_ca_topic_score_codex":0.000007096303,"about_ca_topic_score_gemma":5.017667e-7,"teacher_disagreement_score":0.9771299,"about_ca_system_score_codex":0.0000130749895,"about_ca_system_score_gemma":0.000022977878,"threshold_uncertainty_score":0.78338087},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4222402,0.000080872785,0.540651,0.028466413,0.000377951,0.00073225243,0.000009202292,0.0020544145,0.0053876685],"genre_scores_gemma":[0.9884686,0.00001959649,0.0065003294,0.0049188193,0.000007720185,0.000030063806,0.000029062088,0.0000052333185,0.000020561614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991275,0.000035580655,0.00027873518,0.0001229375,0.00021983462,0.00021537552],"domain_scores_gemma":[0.9996192,0.00004658179,0.00009198556,0.00012909345,0.000052455795,0.00006070383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000282532,0.00008826456,0.00009064899,0.00049274106,0.00012224483,0.00042011816,0.00021257272,0.000039979106,0.0000029498929],"category_scores_gemma":[0.00007503293,0.00008489919,0.000015287853,0.0010630991,0.000043379638,0.002430623,0.00006199042,0.00012199149,0.00003761112],"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.00003949548,0.000063617,0.00688518,0.0009092054,0.000022776454,0.00009473596,0.04116574,0.023810694,0.0022918985,0.016174633,0.0067277807,0.9018142],"study_design_scores_gemma":[0.0008227397,0.000035081397,0.017268423,0.00011839139,0.000002352331,0.00003052288,0.00018053726,0.976919,0.00016390612,0.0024106395,0.0017963643,0.00025204004],"about_ca_topic_score_codex":0.000007551705,"about_ca_topic_score_gemma":0.0000028422976,"teacher_disagreement_score":0.9531083,"about_ca_system_score_codex":0.00002150897,"about_ca_system_score_gemma":0.00006212408,"threshold_uncertainty_score":0.4051209},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2112491,0.000034413184,0.78689176,0.0013100889,0.00009125478,0.00006659032,0.0000013406101,0.00011219591,0.0002432548],"genre_scores_gemma":[0.66749746,0.0000040583514,0.33032152,0.0021164434,0.000027046102,0.0000068225945,0.000008537826,0.000004049394,0.000014053951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992984,0.000015490636,0.00020261075,0.00012860198,0.00018674332,0.00016814793],"domain_scores_gemma":[0.99959075,0.000023445482,0.00010943568,0.00017458179,0.000060393795,0.000041400217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013750134,0.0000966059,0.00008473866,0.00024519043,0.00050150254,0.00086709094,0.00024695744,0.00002826682,8.534786e-7],"category_scores_gemma":[0.0000137823345,0.00008026063,0.000011613863,0.000404897,0.00005288783,0.0059150434,0.0001815135,0.00014201179,0.0000019991646],"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.00001474902,0.000014777123,0.0020752815,0.000390866,0.000025305444,0.0000034977072,0.0058362233,0.009045444,0.0031319698,0.008335864,0.00048723357,0.9706388],"study_design_scores_gemma":[0.00069454353,0.000017671411,0.0036361574,0.0007761051,0.00001416601,0.000086518965,0.0006820452,0.98355675,0.0025953767,0.0008281288,0.00680882,0.00030369862],"about_ca_topic_score_codex":0.000037262816,"about_ca_topic_score_gemma":9.007436e-7,"teacher_disagreement_score":0.9745113,"about_ca_system_score_codex":0.000040718216,"about_ca_system_score_gemma":0.000094098024,"threshold_uncertainty_score":0.8361378},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11744172,0.00010556748,0.87296176,0.0047970503,0.0012354556,0.00012728207,0.00045487622,0.00030865465,0.002567663],"genre_scores_gemma":[0.930697,0.000040998362,0.061316893,0.0053517614,0.0004568809,0.00045835925,0.0015512842,0.000059247737,0.000067524044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969944,0.000055961882,0.0009325904,0.0005745255,0.00074800546,0.00069451664],"domain_scores_gemma":[0.997675,0.00016816673,0.0008761463,0.00093524734,0.00018222646,0.0001632273],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00072909426,0.0003283225,0.00018352547,0.00021335766,0.0013565674,0.001704031,0.0010326715,0.00027272798,0.000100857855],"category_scores_gemma":[0.0002616111,0.00042206445,0.00023340037,0.00071967905,0.0001847892,0.0054791244,0.0005656137,0.00038949132,0.00025202445],"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.00009528297,0.00006616421,0.0000041324124,0.00064538774,0.00008667792,0.00001550146,0.0023722034,0.0011934709,0.0012306324,0.96046567,0.019937264,0.0138876205],"study_design_scores_gemma":[0.0007488107,0.000104083665,0.00029582033,0.0005524842,0.00010186065,0.00013980217,0.00021010806,0.95739406,0.014562521,0.001044048,0.024348022,0.0004983907],"about_ca_topic_score_codex":0.00013980384,"about_ca_topic_score_gemma":0.000010333603,"teacher_disagreement_score":0.95942163,"about_ca_system_score_codex":0.000039741913,"about_ca_system_score_gemma":0.00049187854,"threshold_uncertainty_score":0.99994355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070352578,0.000020724421,0.9872235,0.0041164835,0.00033062784,0.00055879494,0.000017955485,0.00027703086,0.00041964068],"genre_scores_gemma":[0.57917124,0.0000035028156,0.4043825,0.015499305,0.000096046206,0.00044037824,0.0003213927,0.000012589608,0.00007306854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.00003017651,0.00045708485,0.00022739214,0.00031409267,0.00030841673],"domain_scores_gemma":[0.99906033,0.0001800524,0.00022779127,0.00032591313,0.0001587078,0.000047184007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034715934,0.00018585722,0.00015412325,0.00049639546,0.00047276105,0.00051884993,0.00055874174,0.000062756844,0.0000040215327],"category_scores_gemma":[0.000109931156,0.00017969517,0.00008632542,0.00070894824,0.000053495394,0.0025148224,0.00011870534,0.00012145492,0.00001679012],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001580859,0.00005326928,0.00015827463,0.0001416289,0.000013079469,6.979214e-7,0.0007401773,0.002861348,0.00015698915,0.0029723537,0.0042193322,0.988667],"study_design_scores_gemma":[0.0010537889,0.000074764495,0.0048842565,0.00013056658,0.000007647818,0.000001834949,0.00007465982,0.96783435,0.0013791353,0.009897842,0.014448359,0.00021278791],"about_ca_topic_score_codex":0.0000144367195,"about_ca_topic_score_gemma":0.000009774646,"teacher_disagreement_score":0.9884543,"about_ca_system_score_codex":0.000106622494,"about_ca_system_score_gemma":0.000080949314,"threshold_uncertainty_score":0.7327756},"labels":[],"label_agreement":null}]}