{"meta":{"query_hash":"664228451d50","filters":{"venue":"Journal of Algorithms"},"cohort_total":23,"direct_labels_cover":0,"predictions_cover":23,"exported":23,"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/664228451d50","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Algorithms"},"results":[{"id":"W1546783087","doi":"10.1006/jagm.2001.1169","title":"How Helpers Hasten h-Relations","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Attachment and Relationship Dynamics","field":"Psychology","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":"Computer science; Network packet; Scheduling (production processes); Set (abstract data type); Computer network; Distributed computing; Parallel computing; Theoretical computer science; Mathematics; Mathematical optimization; Programming language","score_opus":0.02137014463455823,"score_gpt":0.3530840445356046,"score_spread":0.3317138999010464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546783087","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.64234585,0.004100918,0.07257522,0.033879384,0.0061903917,0.00038457714,0.00002803815,0.0000981351,0.24039747],"genre_scores_gemma":[0.7594462,0.00007325637,0.010435039,0.00017248196,0.001005306,0.0000025746913,0.0000065812255,0.00002540119,0.22883312],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922204,0.000059742215,0.00027303625,0.00008152309,0.00020107342,0.00016255528],"domain_scores_gemma":[0.99944323,0.00006767631,0.00018432013,0.00012467815,0.00008506864,0.00009500496],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020130447,0.00008759499,0.00014685356,0.00012707927,0.000105167404,0.000049618633,0.00014607077,0.000116419935,0.003285913],"category_scores_gemma":[0.000012349182,0.00006861094,0.00014680182,0.00017219121,0.000053973614,0.00021889916,0.0000059209247,0.00034134806,0.00030807368],"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.00027543667,0.0009946291,0.111148976,0.0000106565185,0.001499818,0.00046527522,0.015379625,0.003790169,0.00012307448,0.01218946,0.07637586,0.77774704],"study_design_scores_gemma":[0.0071529006,0.0015224529,0.3557716,0.00013431172,0.0006481044,0.0025604474,0.011665353,0.012610573,0.000023332568,0.007305493,0.5997033,0.0009021451],"about_ca_topic_score_codex":0.000004363836,"about_ca_topic_score_gemma":0.0000015379156,"teacher_disagreement_score":0.77684486,"about_ca_system_score_codex":0.000044254462,"about_ca_system_score_gemma":0.000031605756,"threshold_uncertainty_score":0.99762523},"labels":[],"label_agreement":null},{"id":"W1572683371","doi":"10.1016/s0196-6774(03)00086-5","title":"Selecting the branches for an evolutionary tree.","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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 Waterloo","funders":"","keywords":"Sequence (biology); Tree (set theory); Polynomial; Polynomial-time approximation scheme; Computer science; Integer (computer science); Time complexity; Mathematics; Approximation algorithm; Scheme (mathematics); Algorithm; Mathematical optimization; Combinatorics; Biology","score_opus":0.018670791150418253,"score_gpt":0.26591722306746146,"score_spread":0.2472464319170432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572683371","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.9799742,0.0047375355,0.013814891,0.00078254467,0.00037695584,0.000114639806,0.000009131705,0.0000011398137,0.00018897658],"genre_scores_gemma":[0.9741591,0.00024368922,0.024064735,0.00016990163,0.0012879099,0.000004122159,0.000002823548,0.000010730249,0.000056991485],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995258,0.000016468553,0.00017769155,0.00008386651,0.000075411226,0.00012078088],"domain_scores_gemma":[0.9995502,0.000015480251,0.00013064295,0.000094251234,0.0001705659,0.000038816303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022525829,0.00007013035,0.00009190621,0.000018940498,0.00013352053,0.000013570673,0.00014600222,0.000042985193,7.893636e-7],"category_scores_gemma":[0.000050170343,0.0000465063,0.000106290216,0.000037365244,0.00003863178,0.0000012852739,0.000023793602,0.000058315516,3.6642908e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019754976,0.00018849949,0.0016883473,0.000014010889,0.00039255878,0.0000032547869,0.00066640135,0.0040590023,0.924658,0.00021283289,0.0024841295,0.06543539],"study_design_scores_gemma":[0.008473122,0.012594507,0.09871821,0.00007745191,0.00034560595,0.0017745907,0.0034886599,0.0009751768,0.5507178,0.027173065,0.29473075,0.00093106215],"about_ca_topic_score_codex":0.000005883,"about_ca_topic_score_gemma":0.000011322547,"teacher_disagreement_score":0.37394023,"about_ca_system_score_codex":0.000013580487,"about_ca_system_score_gemma":0.00009340582,"threshold_uncertainty_score":0.18964717},"labels":[],"label_agreement":null},{"id":"W1972805029","doi":"10.1006/jagm.2000.1133","title":"Constructing Optimal Trees from Quartets","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":77,"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":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Phylogenetic tree; Tree rearrangement; Weight-balanced tree; Mathematics; Constraint (computer-aided design); Bounded function; Sequence (biology); Phylogenetic network; Time complexity; Combinatorics; Tree (set theory); Algorithm; Discrete mathematics; Biology; Binary search tree; Binary tree","score_opus":0.012168600829376252,"score_gpt":0.24486195700617105,"score_spread":0.2326933561767948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972805029","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.992928,0.0028239393,0.002802683,0.00020214445,0.00044895802,0.000028046214,0.000014020993,9.729827e-7,0.00075120176],"genre_scores_gemma":[0.9747687,0.00069186016,0.023164783,0.000069375244,0.0011769957,6.168109e-7,0.0000047272765,0.000010599709,0.00011231612],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993552,0.00002354287,0.00026620636,0.00010980653,0.00010644459,0.00013879062],"domain_scores_gemma":[0.9994824,0.000017754706,0.00019827577,0.00010938348,0.00012518372,0.000066986715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011853872,0.00009561696,0.00016365794,0.00003086658,0.000048383456,0.000019908168,0.00013823427,0.00006151185,0.000022000339],"category_scores_gemma":[0.000036845806,0.00008082832,0.000113599606,0.00003826906,0.00005238292,0.0000010858669,0.000044091543,0.00007931284,0.0000027922042],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022734061,0.00012561379,0.064889915,0.0000037390757,0.00073326833,0.00013160922,0.00039170068,0.00056654186,0.71799314,0.000050427727,0.0029728669,0.21191387],"study_design_scores_gemma":[0.008784433,0.0052626813,0.19284977,0.00013589366,0.0004489097,0.004379855,0.013202153,0.0018151829,0.44465014,0.0019454178,0.32495686,0.0015687103],"about_ca_topic_score_codex":0.000017711342,"about_ca_topic_score_gemma":0.000017240936,"teacher_disagreement_score":0.321984,"about_ca_system_score_codex":0.000010140855,"about_ca_system_score_gemma":0.000043286185,"threshold_uncertainty_score":0.32960832},"labels":[],"label_agreement":null},{"id":"W1992517803","doi":"10.1016/j.jalgor.2004.04.011","title":"A polynomial-time algorithm for near-unanimity graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Simon Fraser University; Concordia University","funders":"","keywords":"Time complexity; Unanimity; Algorithm; Combinatorics; Polynomial; Mathematics; Computer science; Discrete mathematics","score_opus":0.016181630222047556,"score_gpt":0.2872839656478463,"score_spread":0.27110233542579876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992517803","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.005499127,0.00041066014,0.9917136,0.0011995763,0.0006646909,0.0002678261,0.0000133973,0.00005635418,0.00017480372],"genre_scores_gemma":[0.0064994306,0.000049717815,0.99262273,0.0002336647,0.0003273895,0.000009633986,9.994026e-7,0.00002745943,0.00022898962],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779767,0.00008184788,0.00058736256,0.0002992196,0.00067414565,0.000559772],"domain_scores_gemma":[0.9979412,0.00023986374,0.00041827653,0.00046155526,0.00060425804,0.00033486728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013021443,0.00020794332,0.00041398127,0.00033352416,0.00027316192,0.0002540574,0.0015749586,0.00010042749,0.000013925795],"category_scores_gemma":[0.00015331592,0.00017532388,0.00041794003,0.00073311984,0.00018099353,0.0011376041,0.00019198368,0.00040765645,0.000038135386],"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.0000978124,0.00044798033,0.0000272383,0.000017910364,0.00020292107,0.00027568016,0.0006743121,0.0012491499,0.0039703962,0.006935403,0.0036191547,0.982482],"study_design_scores_gemma":[0.017560497,0.0073682293,0.0015478578,0.00030854295,0.00011146982,0.004402134,0.00017912655,0.23134631,0.045470092,0.6353648,0.0546672,0.0016737506],"about_ca_topic_score_codex":0.000008880475,"about_ca_topic_score_gemma":7.80766e-7,"teacher_disagreement_score":0.9808083,"about_ca_system_score_codex":0.0001499167,"about_ca_system_score_gemma":0.0004579985,"threshold_uncertainty_score":0.71494997},"labels":[],"label_agreement":null},{"id":"W1994612875","doi":"10.1006/jagm.2002.1221","title":"Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Háskóli Íslands; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rectangle; Approximation algorithm; Combinatorics; Mathematics; Constant (computer programming); Space (punctuation); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.04323806333478964,"score_gpt":0.25696351552347346,"score_spread":0.21372545218868383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994612875","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.00033728906,0.0032442585,0.98474,0.009290598,0.00063628855,0.00089302706,0.000006999462,0.000052383133,0.0007991136],"genre_scores_gemma":[0.034861613,0.0011982056,0.9621176,0.00048525044,0.00090808794,0.00013131856,0.0000018151997,0.000027806618,0.00026827268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978724,0.0002144795,0.00078134815,0.00026401278,0.000526422,0.00034130499],"domain_scores_gemma":[0.99702173,0.0013292715,0.0007055541,0.00034664015,0.00050159334,0.000095197756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795875,0.00019909765,0.00033978737,0.00013099091,0.0009014231,0.0006142355,0.0007431805,0.000067292654,0.000017653316],"category_scores_gemma":[0.0002049498,0.0001113029,0.00020897562,0.0005322928,0.00032721317,0.0008849648,0.00014214261,0.00043689983,0.0000025646773],"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.00011719422,0.00022949612,0.00004408547,0.00008254737,0.00033087854,0.000021014459,0.0104956385,0.0018115373,0.00019061539,0.17140447,0.0044541135,0.81081843],"study_design_scores_gemma":[0.0028886443,0.00029180947,0.000025126541,0.00011104192,0.000061693725,0.0005239366,0.00052636623,0.91803014,0.00050615554,0.06944918,0.0074051092,0.00018081376],"about_ca_topic_score_codex":0.000016198137,"about_ca_topic_score_gemma":0.0000066931702,"teacher_disagreement_score":0.9162186,"about_ca_system_score_codex":0.00005816306,"about_ca_system_score_gemma":0.00006302611,"threshold_uncertainty_score":0.69331086},"labels":[],"label_agreement":null},{"id":"W2029731475","doi":"10.1016/s0196-6774(03)00004-x","title":"Elastic labels around the perimeter of a map","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","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":"University of Waterloo; University of New Brunswick","funders":"","keywords":"Panning (audio); Rectangle; Perimeter; Clipping (morphology); Zoom; Mathematics; Boundary (topology); Time complexity; Achromatic lens; Artificial intelligence; Computer science; Computer vision; Combinatorics; Geometry; Mathematical analysis","score_opus":0.01757324017823872,"score_gpt":0.255436192997203,"score_spread":0.23786295281896427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029731475","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.023732707,0.00073071563,0.97343993,0.0006738522,0.0010348172,0.000039548857,5.7374365e-7,0.0000040831665,0.00034377532],"genre_scores_gemma":[0.7337946,0.000015532396,0.26545456,0.00014389439,0.00024323222,7.7717834e-7,2.019538e-7,0.0000037055572,0.00034349185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913126,0.00009070175,0.0002918473,0.00006993312,0.00032547137,0.000090754984],"domain_scores_gemma":[0.99913,0.00017830006,0.00024811027,0.00013161183,0.0002688359,0.000043137366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058944954,0.00005893461,0.0001148173,0.00009936578,0.00005809636,0.000060904964,0.00028313094,0.00002199969,0.000022247204],"category_scores_gemma":[0.000081483086,0.00003711261,0.00008270921,0.00028215407,0.000021698657,0.00026769607,0.000026780415,0.00010899356,0.00000811323],"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.0000775921,0.0010419575,0.0011915037,0.00011381113,0.0007601956,0.00019577624,0.0060831294,0.09099606,0.038517904,0.42829397,0.016678805,0.4160493],"study_design_scores_gemma":[0.005592915,0.0042803953,0.017457401,0.00029375296,0.00023866324,0.00481045,0.0007951738,0.3886511,0.1619434,0.21969138,0.19518673,0.0010586096],"about_ca_topic_score_codex":0.0000010192211,"about_ca_topic_score_gemma":2.2723475e-7,"teacher_disagreement_score":0.7100619,"about_ca_system_score_codex":0.000018267125,"about_ca_system_score_gemma":0.00011923223,"threshold_uncertainty_score":0.15134084},"labels":[],"label_agreement":null},{"id":"W2046592997","doi":"10.1016/s0196-6774(02)00215-8","title":"A constructive enumeration of fusenes and benzenoids","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Graph theory and applications","field":"Mathematics","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":"HEC Montréal","funders":"","keywords":"Enumeration; Constructive; Mathematics; Computer science; Combinatorics; Programming language; Process (computing)","score_opus":0.05096497404794445,"score_gpt":0.2903613363710243,"score_spread":0.23939636232307984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046592997","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.98865086,0.0005888479,0.0091148745,0.00033948015,0.00011357264,0.000083047766,0.000009163145,0.000006654267,0.0010934863],"genre_scores_gemma":[0.9510042,0.00013625364,0.048645474,0.000014312226,0.00011269887,0.0000012067629,1.6650013e-7,0.000005826021,0.00007982889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949855,0.000030734416,0.00026984757,0.000041920313,0.00010711747,0.00005186361],"domain_scores_gemma":[0.99930257,0.00015484953,0.00029331472,0.000067972345,0.00014474244,0.000036567293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019030167,0.000049621012,0.00014777594,0.00007048688,0.00004200347,0.000009408009,0.000052920794,0.000032166685,0.00006978711],"category_scores_gemma":[0.00007125606,0.00003977074,0.000048701513,0.00008324373,0.0000730134,0.00009898776,0.000008999248,0.00008249567,0.0000012087945],"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.000035143607,0.00046323522,0.0010035753,0.00008975336,0.00025826466,0.000012452235,0.0055312826,0.000009280218,0.015080092,0.8953786,0.003373928,0.07876437],"study_design_scores_gemma":[0.0008278204,0.00025985978,0.0007936396,0.00006802083,0.00011740616,0.00047787593,0.001046924,0.0011381997,0.013453112,0.98050255,0.0012073667,0.00010721164],"about_ca_topic_score_codex":6.7327227e-7,"about_ca_topic_score_gemma":3.1650762e-7,"teacher_disagreement_score":0.08512394,"about_ca_system_score_codex":0.00000568025,"about_ca_system_score_gemma":0.0000061235014,"threshold_uncertainty_score":0.16218038},"labels":[],"label_agreement":null},{"id":"W2049328058","doi":"10.1006/jagm.1999.1050","title":"Some Open Problems in Computational Molecular Biology","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"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":"Network topology; Property (philosophy); Mathematics; Consistency (knowledge bases); Tree (set theory); Set (abstract data type); Function (biology); Combinatorics; Domain (mathematical analysis); Discrete mathematics; Upper and lower bounds; Algorithm; Computer science; Biology; Mathematical analysis","score_opus":0.018205429609056824,"score_gpt":0.3037905689558141,"score_spread":0.2855851393467573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049328058","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.015037361,0.0012445924,0.9804648,0.0019752465,0.000453592,0.00019011335,0.000007981249,0.000018088875,0.00060821674],"genre_scores_gemma":[0.098596975,0.00021961753,0.8995648,0.0010305126,0.00036659627,0.000006876827,0.00001143902,0.000016026746,0.00018717241],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987248,0.00010362707,0.0005041934,0.00020174235,0.0002524884,0.00021310907],"domain_scores_gemma":[0.9992894,0.000058086644,0.00021190313,0.0002274268,0.00010782123,0.00010537299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005532388,0.00011084747,0.00025978638,0.00017287271,0.000051542484,0.00018892708,0.0017162672,0.000062474704,0.00008444833],"category_scores_gemma":[0.000013366697,0.000087189015,0.00006396955,0.00029204707,0.000034786306,0.001387078,0.00030418608,0.00024033371,0.000029535227],"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.0000287898,0.00057962467,0.00056416274,0.000012549264,0.000062666484,0.00041617773,0.0005066198,0.08219881,0.0009348077,0.04785981,0.0020539796,0.864782],"study_design_scores_gemma":[0.0027831916,0.00066386955,0.0044525163,0.00016181546,0.0000072810503,0.00062638026,0.00001532756,0.4505066,0.00031594487,0.52040035,0.019730357,0.00033637107],"about_ca_topic_score_codex":0.000044062053,"about_ca_topic_score_gemma":9.188489e-7,"teacher_disagreement_score":0.8644456,"about_ca_system_score_codex":0.00004373719,"about_ca_system_score_gemma":0.00014273869,"threshold_uncertainty_score":0.35554647},"labels":[],"label_agreement":null},{"id":"W2054626845","doi":"10.1016/s0196-6774(02)00003-2","title":"A linear time algorithm for recognizing regular Boolean functions","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotonic function; Boolean function; Monotone polygon; Corollary; Time complexity; Combinatorics; Function (biology); Algorithm; Discrete mathematics","score_opus":0.02007652376892932,"score_gpt":0.24515777599527802,"score_spread":0.2250812522263487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054626845","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.00039790597,0.00080836687,0.99360925,0.0027474842,0.0014730559,0.00015436958,0.000013779249,0.000104467945,0.00069134304],"genre_scores_gemma":[0.0005895511,0.000081270104,0.98457015,0.00034370474,0.0024718118,0.000007989638,0.0000044899944,0.000038777052,0.011892238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978963,0.00010367248,0.00070324907,0.00032678264,0.0005238051,0.00044617825],"domain_scores_gemma":[0.99801683,0.00021527531,0.0005720418,0.00041278193,0.00051349757,0.00026954946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010418141,0.0002379896,0.00042932964,0.00035180253,0.0003086064,0.00019244823,0.0008773103,0.00011614775,0.00014942334],"category_scores_gemma":[0.00019717,0.00020372657,0.0004007483,0.000512563,0.000045723904,0.0007219259,0.00011037357,0.00052937435,0.00021728584],"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.000003892008,0.00014211584,0.000008776011,0.000008506756,0.00009139317,0.000056386816,0.00028495656,0.0003327937,0.00016503978,0.000056366418,0.019049745,0.97980005],"study_design_scores_gemma":[0.0009996489,0.0006906581,0.000032583077,0.000064134176,0.000039968745,0.0007001484,0.00003498022,0.87097824,0.00029931558,0.000729794,0.12518905,0.00024148809],"about_ca_topic_score_codex":0.0000051831353,"about_ca_topic_score_gemma":1.9777804e-7,"teacher_disagreement_score":0.9795585,"about_ca_system_score_codex":0.000068862624,"about_ca_system_score_gemma":0.000054738677,"threshold_uncertainty_score":0.8307728},"labels":[],"label_agreement":null},{"id":"W2055960596","doi":"10.1006/jagm.1999.1068","title":"Distributed Online Frequency Assignment in Cellular Networks","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":63,"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; Carleton University; Dalhousie University","funders":"","keywords":"Frequency assignment; Vertex (graph theory); Competitive analysis; Computer science; Online algorithm; Graph; Lattice (music); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Upper and lower bounds; Telecommunications","score_opus":0.014104128320367778,"score_gpt":0.24859558391952347,"score_spread":0.23449145559915568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055960596","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.0042761946,0.00037458848,0.99310565,0.001614756,0.00022530292,0.00007094393,0.0000040493924,0.000016023636,0.00031247994],"genre_scores_gemma":[0.46941006,0.0014985893,0.5269703,0.00073681265,0.0006101255,0.000003631938,0.000027823487,0.00002113815,0.00072148134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987013,0.00010101428,0.00047710148,0.00012105322,0.00036384113,0.00023569047],"domain_scores_gemma":[0.9993777,0.00003891261,0.00014593198,0.00017799978,0.00011503534,0.00014437707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970863,0.000088572284,0.00017578759,0.00011360865,0.000040075684,0.000093929186,0.00056282926,0.000055833138,0.0002460404],"category_scores_gemma":[0.000016991933,0.00007223809,0.000069314396,0.00046606187,0.000021821545,0.00043183568,0.00003722645,0.00032211214,0.000010133305],"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.000013581113,0.0007352435,0.00089598855,0.0000062348336,0.000037421123,0.0005551311,0.00036185753,0.68638474,0.00021384971,0.0009841485,0.0014134893,0.30839834],"study_design_scores_gemma":[0.0008583999,0.00024398697,0.002259699,0.000050924704,0.0000033812123,0.00006017464,0.000018758403,0.99128413,0.000082765386,0.0014291629,0.0035873582,0.000121283876],"about_ca_topic_score_codex":0.000011376284,"about_ca_topic_score_gemma":0.0000028349864,"teacher_disagreement_score":0.46613532,"about_ca_system_score_codex":0.00009329802,"about_ca_system_score_gemma":0.00008431043,"threshold_uncertainty_score":0.29457837},"labels":[],"label_agreement":null},{"id":"W2065654144","doi":"10.1016/j.jalgor.2005.01.009","title":"Refinements of Miller's algorithm for computing the Weil/Tate pairing","year":2005,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":66,"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":"Computation; Cryptography; Algorithm; Hamming weight; Integer (computer science); Hamming distance; Computer science; Field (mathematics); Binary number; Finite field; Pairing; Elliptic curve; Mathematics; Theoretical computer science; Discrete mathematics; Hamming code; Arithmetic; Programming language; Pure mathematics","score_opus":0.014071028587777224,"score_gpt":0.2615776276533546,"score_spread":0.2475065990655774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065654144","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.00960762,0.0013754764,0.9854995,0.0024150698,0.00075848855,0.00015615477,0.000003883957,0.000020200358,0.00016363093],"genre_scores_gemma":[0.08474067,0.00015028233,0.91401994,0.00027235426,0.0007339377,0.0000021378505,4.4210668e-7,0.000013172091,0.00006705099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829215,0.00006944085,0.000719336,0.0001629722,0.00045973004,0.0002963521],"domain_scores_gemma":[0.9982922,0.00029417212,0.0006669588,0.00029205278,0.0003621456,0.00009245629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400565,0.00014317995,0.0002976006,0.00021938431,0.0001988225,0.0000794293,0.0010200721,0.000050032417,0.000006287328],"category_scores_gemma":[0.000039257968,0.00009124276,0.00033390347,0.00041784893,0.00007983023,0.00031152484,0.00015338101,0.0002308017,0.0000020628613],"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.00000668715,0.00011495831,0.00009316044,0.00001499342,0.00013370643,0.000008254715,0.00080984074,0.001216727,0.00023140383,0.000604343,0.0013250428,0.9954409],"study_design_scores_gemma":[0.0031997887,0.00090292626,0.005318552,0.00029047264,0.00009869975,0.0004548057,0.00039610424,0.92718244,0.010871202,0.0033220581,0.047594883,0.00036810088],"about_ca_topic_score_codex":0.000009144029,"about_ca_topic_score_gemma":0.0000021864594,"teacher_disagreement_score":0.9950728,"about_ca_system_score_codex":0.00002949866,"about_ca_system_score_gemma":0.00007061672,"threshold_uncertainty_score":0.37207717},"labels":[],"label_agreement":null},{"id":"W2077583313","doi":"10.1006/jagm.2000.1108","title":"Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":82,"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":"Mathematics; Combinatorics; Necklace; Alphabet; Permutation (music); Algorithm; Discrete mathematics","score_opus":0.011280661338109824,"score_gpt":0.25752807666333566,"score_spread":0.24624741532522584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077583313","genre_codex":"empirical","genre_gemma":"methods","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.5164453,0.010633068,0.45420435,0.009247213,0.005449508,0.0009968819,0.00016495024,0.000299811,0.0025589038],"genre_scores_gemma":[0.03517928,0.0028292625,0.9484095,0.0027727678,0.0037358068,0.000019649662,0.000017049879,0.000107514854,0.0069291717],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99638355,0.0001795058,0.0010806313,0.00069582195,0.0009360369,0.0007244547],"domain_scores_gemma":[0.99742395,0.00012723554,0.0004920425,0.00082639384,0.0003103511,0.0008200455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011031933,0.0004485161,0.00075893983,0.00043672058,0.0003273809,0.00077393866,0.0015422,0.00018180604,0.000399034],"category_scores_gemma":[0.000052916534,0.0003617124,0.00018594797,0.0008638393,0.00008440263,0.0020513665,0.00045687935,0.0004942092,0.000106526364],"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.000100727644,0.00025815246,0.00016151939,0.00001796835,0.00012090276,0.00026238142,0.00080498017,0.001447919,0.003423872,0.00024077554,0.044873502,0.9482873],"study_design_scores_gemma":[0.008751879,0.0032807558,0.013371366,0.000678158,0.00017595159,0.0036596837,0.0002597121,0.37903258,0.016583767,0.0020695901,0.5696835,0.0024530347],"about_ca_topic_score_codex":0.00016611954,"about_ca_topic_score_gemma":0.000005749015,"teacher_disagreement_score":0.9458343,"about_ca_system_score_codex":0.0001216125,"about_ca_system_score_gemma":0.00027951697,"threshold_uncertainty_score":0.9998835},"labels":[],"label_agreement":null},{"id":"W2079313211","doi":"10.1016/j.jalgor.2004.02.001","title":"The dominating set problem is fixed parameter tractable for graphs of bounded genus","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"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; University of Victoria","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; Genus; Planar graph; Maximal independent set; Dominating set; Discrete mathematics; Set (abstract data type); Planar; Pathwidth; Chordal graph; 1-planar graph; Graph; Computer science; Line graph","score_opus":0.029409478559451214,"score_gpt":0.31751576923085983,"score_spread":0.28810629067140864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079313211","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.07631182,0.00069741346,0.919313,0.0026878025,0.00038759288,0.00044563893,0.000012341547,0.000017065515,0.00012728923],"genre_scores_gemma":[0.19951797,0.00010886613,0.7999569,0.00011580478,0.00010166453,0.000018714874,4.4109262e-7,0.000018830893,0.00016081896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814856,0.0000825439,0.0006106907,0.00017299538,0.00058129424,0.000403913],"domain_scores_gemma":[0.99742895,0.00087586086,0.00063038117,0.00035117278,0.0006009986,0.000112653404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019403176,0.00012744026,0.00027308657,0.00018149165,0.00028112717,0.00017039022,0.0011787959,0.000056864374,0.0000032659698],"category_scores_gemma":[0.00026391455,0.00008284775,0.00027083693,0.0004965146,0.0001524829,0.0006810447,0.000103265855,0.0003138821,0.0000015907546],"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.0005727804,0.0006092343,0.00025335434,0.00019641624,0.0006852918,0.000125774,0.0097559,0.0033595054,0.016123552,0.16363037,0.0016571943,0.8030306],"study_design_scores_gemma":[0.0022813245,0.0010003104,0.00016057774,0.000097316915,0.000019987876,0.00025997806,0.00025875343,0.008377116,0.052572116,0.93160856,0.0031979259,0.00016604141],"about_ca_topic_score_codex":0.0000067906835,"about_ca_topic_score_gemma":0.000002253594,"teacher_disagreement_score":0.8028646,"about_ca_system_score_codex":0.000069412534,"about_ca_system_score_gemma":0.00020290577,"threshold_uncertainty_score":0.33784333},"labels":[],"label_agreement":null},{"id":"W2085072732","doi":"10.1016/s0196-6774(03)00126-3","title":"Rectangular drawings of planar graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","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 Alberta","funders":"","keywords":"Planar graph; Book embedding; Planar straight-line graph; Outerplanar graph; Combinatorics; Rectangle; Mathematics; Planar; Graph; Polyhedral graph; Embedding; Vertex (graph theory); Plane (geometry); 1-planar graph; Geometry; Line graph; Computer science; Pathwidth; Computer graphics (images); Artificial intelligence","score_opus":0.011175260138379248,"score_gpt":0.23730742971906998,"score_spread":0.22613216958069074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085072732","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.052300267,0.0008529876,0.9446744,0.00036592016,0.0008745302,0.00003829293,8.376618e-7,0.000009151326,0.00088364433],"genre_scores_gemma":[0.46541974,0.000057948135,0.5341148,0.00014045558,0.000118331714,4.6061814e-7,6.2501823e-7,0.0000048300335,0.00014281874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990708,0.000064925945,0.00033985515,0.00008324149,0.00034590147,0.000095270814],"domain_scores_gemma":[0.9991647,0.0000726246,0.00030267914,0.00011590115,0.00027867625,0.0000654102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899918,0.00006227987,0.00014724745,0.00023692338,0.00004216753,0.000032146003,0.00023591644,0.000031662355,0.000011309207],"category_scores_gemma":[0.000095470015,0.00005317157,0.000103063205,0.00048118416,0.00001742173,0.00033303088,0.000011964098,0.000098385506,0.0000026473485],"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.00004452179,0.0005875708,0.0013280271,0.000058705897,0.00033353554,0.00028927563,0.0029587378,0.009406687,0.037681937,0.71289104,0.011473654,0.22294633],"study_design_scores_gemma":[0.0036454408,0.0024946756,0.010940219,0.00022240821,0.00009373955,0.0035649147,0.00026800952,0.038157165,0.22378369,0.63559306,0.08048157,0.000755132],"about_ca_topic_score_codex":0.0000018635654,"about_ca_topic_score_gemma":2.599975e-7,"teacher_disagreement_score":0.41311947,"about_ca_system_score_codex":0.000017092561,"about_ca_system_score_gemma":0.000111202644,"threshold_uncertainty_score":0.21682738},"labels":[],"label_agreement":null},{"id":"W2085524666","doi":"10.1006/jagm.2001.1189","title":"Fly Cheaply: On the Minimum Fuel Consumption Problem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"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":"Subdivision; Function (biology); Fuel efficiency; Path (computing); Class (philosophy); Sequence (biology); Set (abstract data type); Mathematical optimization; Computer science; Combinatorics; Mathematics; Engineering; Artificial intelligence; Aerospace engineering","score_opus":0.03404273858224385,"score_gpt":0.2688807568102196,"score_spread":0.23483801822797576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085524666","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.10515446,0.00064372487,0.8680605,0.022016406,0.0014538451,0.00018529913,0.0000011372031,0.000035112425,0.002449513],"genre_scores_gemma":[0.88096035,0.0004060375,0.11377313,0.0021875575,0.0013706883,0.0000060099374,0.0000020546615,0.000010666907,0.0012834775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989484,0.00007774957,0.00030501574,0.000111586174,0.0004266742,0.00013059373],"domain_scores_gemma":[0.99909884,0.00018701512,0.00025353106,0.00015501108,0.0002363381,0.000069250076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069265894,0.0000833147,0.0001081722,0.00013723486,0.00010640527,0.00013101022,0.00036177674,0.000035164456,0.00003838702],"category_scores_gemma":[0.000045773904,0.000053340325,0.00008328323,0.00031031447,0.000023016613,0.00034914177,0.000039476174,0.00018339044,0.000062496074],"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.00015805243,0.0008563967,0.0009853833,0.000044557783,0.00022548005,0.00030605405,0.0027298508,0.022267675,0.005900167,0.15945573,0.040354785,0.7667159],"study_design_scores_gemma":[0.0038185506,0.0031201711,0.038313672,0.00032317796,0.00007544468,0.004726763,0.00019498981,0.5473677,0.00772629,0.19527113,0.1982184,0.00084372],"about_ca_topic_score_codex":0.0000011965035,"about_ca_topic_score_gemma":7.8357704e-7,"teacher_disagreement_score":0.7758059,"about_ca_system_score_codex":0.000041738916,"about_ca_system_score_gemma":0.00008285425,"threshold_uncertainty_score":0.21751553},"labels":[],"label_agreement":null},{"id":"W2089329507","doi":"10.1016/j.jalgor.2004.01.002","title":"Simple constant amortized time generation of fixed length numeric partitions","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Numerical Methods and Algorithms","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 Victoria","funders":"","keywords":"Amortized analysis; Simple (philosophy); Constant (computer programming); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Data structure; Computer science","score_opus":0.03443542798261186,"score_gpt":0.29426492655903175,"score_spread":0.2598294985764199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089329507","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.022207491,0.00022974044,0.9758301,0.0008680964,0.0005279493,0.0000914634,0.000008755589,0.000026716649,0.00020971781],"genre_scores_gemma":[0.13225445,0.00008497918,0.86703986,0.00016969013,0.00038867406,0.0000028952497,0.0000022675988,0.0000113154065,0.000045873043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981898,0.00013066821,0.0007880934,0.0001752757,0.00047327857,0.0002428801],"domain_scores_gemma":[0.99837697,0.00011295691,0.00068207335,0.00027350517,0.00037377144,0.00018069969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006382685,0.00014097904,0.00042101703,0.00015377169,0.00009855078,0.00007326952,0.00046975331,0.000056085722,0.00006307297],"category_scores_gemma":[0.00014749785,0.0001108942,0.00021066777,0.0005575386,0.00008764233,0.0005306484,0.000071278955,0.00020504942,0.000020570136],"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.000056058427,0.0016239665,0.00021371765,0.00003919534,0.00043390697,0.000388171,0.0012603272,0.015010274,0.26560253,0.02072214,0.003079651,0.69157004],"study_design_scores_gemma":[0.011209761,0.0054477975,0.0037825939,0.0003010144,0.0002696387,0.0017168402,0.00025805202,0.47952434,0.29717255,0.18363744,0.015190444,0.0014895503],"about_ca_topic_score_codex":0.000019672236,"about_ca_topic_score_gemma":5.9828295e-7,"teacher_disagreement_score":0.6900805,"about_ca_system_score_codex":0.0000697555,"about_ca_system_score_gemma":0.00022801985,"threshold_uncertainty_score":0.45221344},"labels":[],"label_agreement":null},{"id":"W2090986925","doi":"10.1016/s0196-6774(02)00251-1","title":"A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"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":"Approximation algorithm; Open shop; Mathematics; Algorithm; Mathematical optimization; Computer science; Job shop scheduling; Flow shop scheduling","score_opus":0.024416593517046954,"score_gpt":0.24623961560496757,"score_spread":0.22182302208792062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090986925","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.0007605253,0.0014589775,0.99447376,0.00043473058,0.0005400076,0.0010338414,0.00003244503,0.00007166513,0.0011940739],"genre_scores_gemma":[0.0028419865,0.0003855425,0.9950391,0.00008771419,0.0006026574,0.000107365275,0.000007628575,0.00007276869,0.0008552127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985694,0.000050552262,0.0005305199,0.00017412109,0.00037663843,0.00029876656],"domain_scores_gemma":[0.9985582,0.00022047157,0.00030218475,0.0002139439,0.0005834793,0.00012170155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005480985,0.00024454322,0.00037480288,0.00015025598,0.00017812473,0.00026693215,0.0005658198,0.00010106269,0.00009796116],"category_scores_gemma":[0.00004273888,0.00015374801,0.000136529,0.00039004534,0.00006198096,0.00058426184,0.00004246086,0.00030984762,0.000009344883],"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.00012002238,0.0002641385,0.00003969155,0.000056218694,0.0012153352,0.000026204385,0.0049446146,0.37888578,0.000095136886,0.000183348,0.0063977563,0.60777175],"study_design_scores_gemma":[0.0028345382,0.00042801845,0.00005198521,0.000082438404,0.00014351071,0.0001988162,0.00076057256,0.991533,0.0011414754,0.00023110569,0.002351141,0.00024341901],"about_ca_topic_score_codex":0.000008949107,"about_ca_topic_score_gemma":0.000004015275,"teacher_disagreement_score":0.6126472,"about_ca_system_score_codex":0.00013161972,"about_ca_system_score_gemma":0.000044259854,"threshold_uncertainty_score":0.62696624},"labels":[],"label_agreement":null},{"id":"W2114790712","doi":"10.1006/jagm.2000.1151","title":"Space Efficient Suffix Trees","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":103,"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":"Suffix; Space (punctuation); Computer science; Suffix tree; Artificial intelligence; Mathematics; Combinatorics; Linguistics; Philosophy","score_opus":0.014614309316282275,"score_gpt":0.2550175803153401,"score_spread":0.24040327099905784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114790712","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.031974826,0.00088760053,0.96251905,0.00192448,0.0014487619,0.00005676291,0.0000022475137,0.0000435877,0.0011426647],"genre_scores_gemma":[0.33072522,0.00068372494,0.6649441,0.00042823632,0.0019172174,0.0000023288692,0.0000022217314,0.000029893154,0.0012670193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841523,0.000058219135,0.000423128,0.00019441318,0.000627315,0.00028166498],"domain_scores_gemma":[0.9986703,0.000088821726,0.00036086622,0.0004215573,0.0002480759,0.0002104284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532933,0.00014315093,0.0002518429,0.00020477582,0.00011548665,0.00017640102,0.0010939704,0.000057945195,0.000041914845],"category_scores_gemma":[0.000050103572,0.000102865,0.00014624115,0.0004328592,0.000036161047,0.00053914497,0.0002498618,0.00025509074,0.00004409507],"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.00010549518,0.0014319723,0.0013720036,0.000017899554,0.00016292355,0.003005179,0.002184517,0.016552538,0.0044152737,0.014283508,0.0406463,0.9158224],"study_design_scores_gemma":[0.0022025288,0.0010051011,0.011549741,0.0001920001,0.000033072312,0.0041371975,0.00021211393,0.7194228,0.0034392069,0.0024064046,0.25485712,0.00054273155],"about_ca_topic_score_codex":0.000015066794,"about_ca_topic_score_gemma":0.0000013314365,"teacher_disagreement_score":0.9152797,"about_ca_system_score_codex":0.000054003514,"about_ca_system_score_gemma":0.000094984636,"threshold_uncertainty_score":0.4194713},"labels":[],"label_agreement":null},{"id":"W2120749565","doi":"10.1006/jagm.2001.1158","title":"The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"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":"Factorization of polynomials; Factorization; Finite field; Mathematics; Polynomial; Factoring; Degree (music); Square-free polynomial; Algorithm; Singularity; Algebra over a field; Discrete mathematics; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.016552816498077758,"score_gpt":0.25349352498912764,"score_spread":0.23694070849104987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120749565","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.015337406,0.00021479843,0.9831149,0.00039746417,0.0007045641,0.000036593978,0.000006839436,0.000012710657,0.00017473924],"genre_scores_gemma":[0.9477864,0.00040610554,0.050993856,0.0002142044,0.00047361554,0.0000013151234,0.0000027505735,0.000008842441,0.00011293988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867743,0.00011761881,0.0005016018,0.00011780313,0.00040646808,0.00017907491],"domain_scores_gemma":[0.9983333,0.0005100447,0.0005285605,0.00031270372,0.0002370908,0.0000783486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918323,0.0001036288,0.00028066686,0.0004238931,0.00016027829,0.0001219694,0.00079441816,0.000057575187,0.00003262776],"category_scores_gemma":[0.000062870895,0.00006976686,0.00041385763,0.0016926447,0.000063569954,0.00033300207,0.00008751934,0.0001941563,0.0000013323842],"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.00012289654,0.00023952621,0.006183843,0.0000059526064,0.002750834,0.00008201048,0.002592527,0.0050294297,0.0005692161,0.008521521,0.0013892499,0.972513],"study_design_scores_gemma":[0.0013168947,0.000936724,0.05671414,0.000042878342,0.0007449673,0.000096577074,0.00019594714,0.8808863,0.000575382,0.011915665,0.04620917,0.0003653511],"about_ca_topic_score_codex":0.000016392069,"about_ca_topic_score_gemma":0.0000072587163,"teacher_disagreement_score":0.97214764,"about_ca_system_score_codex":0.00002086401,"about_ca_system_score_gemma":0.0000473248,"threshold_uncertainty_score":0.284501},"labels":[],"label_agreement":null},{"id":"W2122491543","doi":"10.1016/j.jalgor.2004.04.005","title":"Estimating the maximum","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph; Sample (material); Property (philosophy); Sampling (signal processing); Maximum likelihood; Discrete mathematics; Sample complexity; Algorithm; Statistics; Computer science; Artificial intelligence","score_opus":0.02866371422076207,"score_gpt":0.30652404181212844,"score_spread":0.27786032759136636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122491543","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.78645045,0.0005018664,0.20299786,0.002304927,0.0034548321,0.00014625688,0.0000030764415,0.00003320968,0.004107541],"genre_scores_gemma":[0.55989516,0.0000092534865,0.43868947,0.00021993394,0.0011056062,6.8850034e-7,8.50498e-8,0.000017546072,0.00006228042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910617,0.00003650102,0.0003663852,0.00005380968,0.00029751295,0.00013960837],"domain_scores_gemma":[0.9991069,0.00020041542,0.00035000427,0.00017506426,0.00011649593,0.000051113784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297564,0.000087537344,0.00017097553,0.000054304797,0.00020805423,0.00003363773,0.0003154139,0.000043475822,0.000035377],"category_scores_gemma":[0.0003391358,0.000044420707,0.0001494527,0.00009934973,0.00007556829,0.00010116661,0.000051280436,0.00030339626,0.0000024005096],"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.00010280137,0.00031980805,0.00036349185,0.00013531778,0.00065440073,0.0004912749,0.016576966,0.0070841624,0.00054573617,0.77539253,0.004776479,0.19355701],"study_design_scores_gemma":[0.0004486416,0.00009090692,0.00022312219,0.000056968343,0.00004124227,0.00073598756,0.00021943774,0.00031493686,0.0004599354,0.99678767,0.0005578065,0.000063354295],"about_ca_topic_score_codex":0.00000236282,"about_ca_topic_score_gemma":5.233372e-7,"teacher_disagreement_score":0.2356916,"about_ca_system_score_codex":0.000034084504,"about_ca_system_score_gemma":0.000041613323,"threshold_uncertainty_score":0.18114239},"labels":[],"label_agreement":null},{"id":"W2137498124","doi":"10.1006/jagm.2000.1132","title":"Efficient Algorithms for Petersen's Matching Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"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; Carleton University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Algorithm; Planar graph; Discrete mathematics; Graph algorithms; Graph","score_opus":0.021894238488722132,"score_gpt":0.2809147616313767,"score_spread":0.25902052314265456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137498124","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.03921706,0.00022540877,0.95686406,0.0016904891,0.001594943,0.00011868304,0.0000021992585,0.00002671662,0.00026041715],"genre_scores_gemma":[0.30597633,0.000033395547,0.6919147,0.00040461932,0.0013091015,0.0000048277066,0.0000024511878,0.0000127188405,0.00034189006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864435,0.000052120726,0.0004438589,0.0001787183,0.00044966498,0.0002312753],"domain_scores_gemma":[0.9987185,0.00022580972,0.00033604173,0.00017078145,0.00042104628,0.00012782088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394324,0.00012475903,0.00019981028,0.00026169224,0.00015554806,0.00016446215,0.00043885713,0.00004526262,0.0000112893695],"category_scores_gemma":[0.00005953081,0.00010248601,0.00019620551,0.00038700312,0.000021062257,0.00025636127,0.00006682112,0.00014290573,0.0000094738625],"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.00007553714,0.0003625984,0.000027224482,0.000022303933,0.00012354905,0.00017829884,0.0017873637,0.3513112,0.003272425,0.04746327,0.0016930094,0.59368324],"study_design_scores_gemma":[0.0011698544,0.0004405018,0.0006613691,0.00004263046,0.00002151333,0.001283424,0.0001243449,0.948006,0.001198061,0.034188017,0.012648643,0.0002156842],"about_ca_topic_score_codex":0.0000020825357,"about_ca_topic_score_gemma":3.8479442e-7,"teacher_disagreement_score":0.59669477,"about_ca_system_score_codex":0.000063419466,"about_ca_system_score_gemma":0.00011205828,"threshold_uncertainty_score":0.4179258},"labels":[],"label_agreement":null},{"id":"W2156623776","doi":"10.1006/jagm.2001.1195","title":"On Graph Powers for Leaf-Labeled Trees","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"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":"Combinatorics; Gomory–Hu tree; Mathematics; Tree (set theory); Graph; K-ary tree; Spanning tree; Path (computing); Basis (linear algebra); Trémaux tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Computer science; Binary tree; Line graph; Artificial intelligence; Pathwidth","score_opus":0.03359346603976615,"score_gpt":0.3027998815668668,"score_spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156623776","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.0097192405,0.00069466326,0.98557234,0.002310569,0.000749701,0.00017353956,0.0000037247878,0.000036190875,0.0007400155],"genre_scores_gemma":[0.40852866,0.0006586592,0.5845398,0.0012465067,0.0008120199,0.000022098558,0.0000013396473,0.00006987902,0.0041210833],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850637,0.00007176486,0.00034095114,0.00018774685,0.0005465663,0.000346585],"domain_scores_gemma":[0.9984966,0.00045711308,0.00024202022,0.0003318491,0.00029420113,0.00017822681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063958456,0.00012737926,0.00023546127,0.00042444354,0.000121740195,0.000090933114,0.0010450741,0.000051076942,0.000044336466],"category_scores_gemma":[0.00021798935,0.00009901651,0.0002315064,0.00050153997,0.000071289294,0.0005336372,0.000058144436,0.00029021373,0.000025938827],"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.00037223147,0.0012903877,0.00011639311,0.00003790876,0.00040323188,0.00046872694,0.0021690724,0.004201855,0.007837825,0.1827552,0.03441151,0.76593566],"study_design_scores_gemma":[0.009287728,0.010961228,0.0005601627,0.00022326867,0.000043539087,0.0007936193,0.00027578312,0.18355268,0.015902309,0.73309547,0.044389997,0.00091422733],"about_ca_topic_score_codex":5.431888e-7,"about_ca_topic_score_gemma":6.3118864e-7,"teacher_disagreement_score":0.76502144,"about_ca_system_score_codex":0.000049036018,"about_ca_system_score_gemma":0.000024077523,"threshold_uncertainty_score":0.40377763},"labels":[],"label_agreement":null},{"id":"W298519903","doi":"10.1006/jagm.2000.1147","title":"Fault-Tolerant Broadcasting in Radio Networks","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Computer science; Broadcasting (networking); Node (physics); Computer network; Upper and lower bounds; RADIUS; Situated; Range (aeronautics); Fault tolerance; Topology (electrical circuits); Algorithm; Distributed computing; Mathematics; Combinatorics; Physics","score_opus":0.014003932048168658,"score_gpt":0.24600307803705548,"score_spread":0.23199914598888682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W298519903","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.030452026,0.001992412,0.9644836,0.0005371438,0.0014309208,0.000067475885,0.0000010002917,0.00002385931,0.0010115393],"genre_scores_gemma":[0.96286505,0.00021708886,0.035514038,0.00017841606,0.0009181234,0.0000019564739,6.9955024e-7,0.000011481346,0.0002931667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829656,0.000071214134,0.00073180295,0.00017316088,0.0003800655,0.00034722287],"domain_scores_gemma":[0.9989467,0.00007357087,0.00041933733,0.00023742307,0.00018096736,0.00014198458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552914,0.0001342309,0.00034671108,0.00016029413,0.00006146056,0.00016855149,0.00076526706,0.000078151636,0.000010915096],"category_scores_gemma":[0.000041018775,0.00011020897,0.00012239788,0.000663971,0.000021417987,0.0006671751,0.000066711626,0.00039285934,0.0000062309514],"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.000050322644,0.00033875817,0.009234882,0.000017269913,0.000072042436,0.0046659606,0.0013055502,0.16193236,0.0001971418,0.0012681535,0.0069854693,0.81393206],"study_design_scores_gemma":[0.0011844102,0.0001425717,0.009000627,0.00024455183,0.000004578829,0.002750073,0.000077221644,0.9537213,0.000026201282,0.00020026235,0.032457426,0.00019077884],"about_ca_topic_score_codex":0.00003259725,"about_ca_topic_score_gemma":0.0000057388947,"teacher_disagreement_score":0.932413,"about_ca_system_score_codex":0.00008427303,"about_ca_system_score_gemma":0.000069422575,"threshold_uncertainty_score":0.44941917},"labels":[],"label_agreement":null}]}