{"meta":{"query_hash":"d2150b147155","filters":{"venue":"ACM Journal of Experimental Algorithmics"},"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/d2150b147155","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Journal+of+Experimental+Algorithmics"},"results":[{"id":"W1968018533","doi":"10.1145/1963190.2063517","title":"Approximation algorithms for speeding up dynamic programming and denoising aCGH data","year":2011,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Genomic variations and chromosomal abnormalities","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Approximation algorithm; Multiplicative function; Mathematics; Logarithm; Regularization (linguistics); Dynamic programming; Normalization (sociology); Computer science; Mathematical optimization; Artificial intelligence","score_opus":0.07553904577710992,"score_gpt":0.31798933847455196,"score_spread":0.24245029269744206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968018533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007951861,0.00030066847,0.9883426,0.00048777528,0.00006520924,0.00005305676,0.00009693121,0.0010277698,0.0016741096],"genre_scores_gemma":[0.14720173,0.00037117623,0.8468434,0.0004966273,0.00014196381,0.00042330337,0.0008383677,0.0005637382,0.0031196286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983078,0.00054548826,0.000081341444,0.0004247323,0.00040720325,0.00023340603],"domain_scores_gemma":[0.9964379,0.0024277903,0.00021934355,0.00039637182,0.00040115946,0.00011737726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028499938,0.001983958,0.0019187615,0.0010784818,0.0008871091,0.0018233818,0.0029026691,0.0020745904,0.004095368],"category_scores_gemma":[0.010944381,0.0010801964,0.0014466014,0.0017882386,0.0014909698,0.0031349356,0.0024136603,0.0047254884,0.0013498771],"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.00024532535,0.00018010869,0.0010761886,0.00018193343,0.000085611566,0.00007784503,0.00016812168,0.83104146,0.0028586506,0.03060292,0.006995444,0.12648644],"study_design_scores_gemma":[0.00001706894,0.00001425735,0.00004708874,0.000006075709,0.0000051094485,0.000013236592,0.000015150983,0.98811173,0.00036920744,0.010697119,0.0006994399,0.000004517577],"about_ca_topic_score_codex":0.008676667,"about_ca_topic_score_gemma":0.00852087,"teacher_disagreement_score":0.008676667,"about_ca_system_score_codex":0.0018773449,"about_ca_system_score_gemma":0.0024342071,"threshold_uncertainty_score":0.017252326},"labels":[],"label_agreement":null},{"id":"W1999806580","doi":"10.1145/1005813.1041511","title":"A performance study of data layout techniques for improving data locality in refinement-based pathfinding","year":2004,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"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 Alberta","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada","keywords":"Locality; Computer science; Compiler; Locality of reference; Exploit; CAS latency; Pathfinding; Data structure; Parallel computing; Cache; Optimizing compiler; Theoretical computer science; Programming language; Memory controller; Operating system; Graph","score_opus":0.09430588576968296,"score_gpt":0.3590821632634274,"score_spread":0.26477627749374444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999806580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6191695,0.0024829127,0.3677601,0.00033160162,0.000061501574,0.00035831117,0.00022927388,0.0054226704,0.0041841054],"genre_scores_gemma":[0.67379725,0.00054109655,0.32370543,0.00006274613,0.000020363866,0.00010908869,0.00031125027,0.00032288113,0.0011298473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980585,0.00075106,0.00015194905,0.00021436856,0.0006678276,0.00015623808],"domain_scores_gemma":[0.9866946,0.008410057,0.000942233,0.0023225388,0.0014995293,0.00013097307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020678225,0.0006432238,0.00048241086,0.0012270486,0.00047948436,0.000529033,0.001180277,0.0005581189,0.0012749649],"category_scores_gemma":[0.012682282,0.000332167,0.00044345701,0.002907061,0.0007395444,0.0018383904,0.0005015016,0.00054947234,0.00036100348],"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.0016432123,0.000760647,0.008450808,0.0006928845,0.00016959742,0.00014880359,0.0005764143,0.17026037,0.14615688,0.0063652582,0.0026968308,0.66207826],"study_design_scores_gemma":[0.00036426095,0.0034550298,0.0068708844,0.000034456156,0.00017365583,0.00065973325,0.0001802277,0.7223709,0.25804815,0.0027893335,0.004961078,0.00009230227],"about_ca_topic_score_codex":0.003472675,"about_ca_topic_score_gemma":0.004343186,"teacher_disagreement_score":0.003472675,"about_ca_system_score_codex":0.0009782149,"about_ca_system_score_gemma":0.000984444,"threshold_uncertainty_score":0.010935783},"labels":[],"label_agreement":null},{"id":"W2018416407","doi":"10.1145/2133803.2330083","title":"A topological sorting algorithm for large graphs","year":2012,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Topological sorting; Reachability; Computer science; Sorting; Algorithm; Sorting algorithm; Vertex (graph theory); sort; Directed acyclic graph; Graph; Theoretical computer science; Mathematics","score_opus":0.03450389665994346,"score_gpt":0.314868580395484,"score_spread":0.2803646837355405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018416407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0175224,0.00022114653,0.9660055,0.0002256793,0.00008270534,0.00016400896,0.00087731984,0.009614041,0.0052872812],"genre_scores_gemma":[0.10560294,0.0002204593,0.8861035,0.00012621276,0.00004668577,0.0002519132,0.002523874,0.00062609283,0.004498352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942553,0.00008271726,0.0000668786,0.00011806132,0.00023338562,0.000073437346],"domain_scores_gemma":[0.998565,0.00044245424,0.00013980031,0.00041360105,0.0003503897,0.00008870178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790706,0.0007705079,0.0005440185,0.002135213,0.0007965523,0.0014105983,0.0015409008,0.000657149,0.008235252],"category_scores_gemma":[0.0032158468,0.00041698077,0.000797211,0.002599507,0.00063123956,0.0025898372,0.0018189523,0.00085502554,0.0020231004],"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.00041661842,0.00015472558,0.0017508259,0.0005189176,0.000090522066,0.00015130505,0.00026816712,0.076609224,0.023790017,0.064227045,0.025724562,0.8062981],"study_design_scores_gemma":[0.00031316633,0.0005266816,0.0013581873,0.00012833343,0.00011964923,0.00076613156,0.00035905367,0.6629214,0.055084173,0.17615348,0.10216026,0.00010941613],"about_ca_topic_score_codex":0.0023269907,"about_ca_topic_score_gemma":0.00336359,"teacher_disagreement_score":0.008235252,"about_ca_system_score_codex":0.0009538366,"about_ca_system_score_gemma":0.0015786483,"threshold_uncertainty_score":0.027549624},"labels":[],"label_agreement":null},{"id":"W2033938169","doi":"10.1145/1412228.1412231","title":"Computing an approximation of the 1-center problem on weighted terrain surfaces","year":2008,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Convex hull; Vertex (graph theory); Running time; Approximation algorithm; Minimum bounding box; Graph; Regular polygon; Algorithm; Geometry; Computer science; Artificial intelligence","score_opus":0.025185622867333984,"score_gpt":0.2741900172678776,"score_spread":0.24900439440054364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033938169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22407211,0.00051277346,0.7624981,0.00076684385,0.0001286273,0.00017353983,0.0009009505,0.00240024,0.008546852],"genre_scores_gemma":[0.5096605,0.00019950453,0.4844594,0.00014747454,0.000066070286,0.00021314004,0.0019441114,0.00033954813,0.0029702343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999385,0.00010409126,0.000028926694,0.00017327076,0.00015361379,0.00015515737],"domain_scores_gemma":[0.9983348,0.0010722642,0.00014446027,0.0001564036,0.0001661187,0.00012595773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086409145,0.0014111928,0.0017743009,0.0012914176,0.00086562126,0.0015631893,0.0023758735,0.0024796014,0.006413935],"category_scores_gemma":[0.0048505445,0.00064997975,0.0011448817,0.0014364012,0.0010712729,0.003049235,0.0023278832,0.0013634539,0.0009960448],"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.00022012046,0.0000854,0.0012904532,0.00011343502,0.000031151467,0.000103405284,0.000093108036,0.9612878,0.0011129165,0.0077540027,0.0024082183,0.025499988],"study_design_scores_gemma":[0.000017133656,0.000017540087,0.00008768405,0.000004597778,0.0000024256701,0.000014253858,0.00003396838,0.9933036,0.0002089418,0.006022582,0.00028470196,0.0000026015005],"about_ca_topic_score_codex":0.010432619,"about_ca_topic_score_gemma":0.011435446,"teacher_disagreement_score":0.010432619,"about_ca_system_score_codex":0.0014166207,"about_ca_system_score_gemma":0.0013158777,"threshold_uncertainty_score":0.021456778},"labels":[],"label_agreement":null},{"id":"W2048442462","doi":"10.1145/2133803.2184450","title":"StreamKM++","year":2012,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":295,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Computer science; Data stream; Tree (set theory); Sample (material); Sampling (signal processing); Streaming algorithm; Cluster analysis; Mathematics; Combinatorics; Upper and lower bounds; Artificial intelligence","score_opus":0.027883036918646156,"score_gpt":0.3083020289660293,"score_spread":0.2804189920473832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048442462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00256059,0.000488618,0.84808576,0.0005317923,0.00061486434,0.0006105235,0.009648777,0.123925686,0.013533345],"genre_scores_gemma":[0.018737884,0.00054001744,0.9210148,0.00084769673,0.00017869034,0.0009624561,0.025710585,0.012431102,0.019576872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979037,0.00023672411,0.00023765017,0.00056880165,0.00088578946,0.00016735695],"domain_scores_gemma":[0.9981711,0.00030881385,0.00009848836,0.00066994503,0.00063184125,0.000119750584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014166975,0.0022053805,0.0016380809,0.0018278821,0.00089755916,0.0040564276,0.0063451477,0.0016498757,0.038372274],"category_scores_gemma":[0.0058146706,0.0014426118,0.0022601644,0.002772977,0.0007494696,0.0056514237,0.0044180932,0.0029360713,0.037035245],"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.00081425067,0.00021714243,0.0012951967,0.001073527,0.00015683722,0.0001861348,0.00019315277,0.028759498,0.008816073,0.052273463,0.28799868,0.618216],"study_design_scores_gemma":[0.00037031304,0.00019404318,0.0005569643,0.00009858889,0.000057025256,0.00039730605,0.00006130176,0.4190661,0.023494713,0.06423175,0.49133733,0.00013457243],"about_ca_topic_score_codex":0.0037139198,"about_ca_topic_score_gemma":0.00556512,"teacher_disagreement_score":0.038372274,"about_ca_system_score_codex":0.0013986856,"about_ca_system_score_gemma":0.0018268046,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2050275819","doi":"10.1145/1187436.1210589","title":"Heuristics for estimating contact area of supports in layered manufacturing","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Suite; Computer science; Representation (politics); Heuristic; Regular polygon; Range (aeronautics); Mathematical optimization; Key (lock); Convex hull; Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry","score_opus":0.0256782719106334,"score_gpt":0.30864878649994687,"score_spread":0.2829705145893135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050275819","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107206024,0.0003210141,0.89051664,0.000081477614,0.000012251546,0.00011247385,0.00009349029,0.0006408008,0.0010157673],"genre_scores_gemma":[0.5320702,0.00016937932,0.46683177,0.000024722942,0.000013875154,0.00011312131,0.000250192,0.00011595774,0.00041077723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877256,0.00039401287,0.000074746546,0.00017272122,0.00041244374,0.00017351254],"domain_scores_gemma":[0.9936575,0.004650109,0.00060708827,0.00044227138,0.00044906803,0.00019393033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626357,0.000947899,0.0014953762,0.0023227758,0.00064161996,0.0017839167,0.0018695117,0.0012208946,0.001285778],"category_scores_gemma":[0.010088973,0.0009251551,0.0008056494,0.0014246345,0.00094083045,0.0018027407,0.0017282622,0.0007638147,0.00031703452],"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.0002442769,0.0000839653,0.0029460008,0.00010397928,0.00004856935,0.00013567637,0.00015435307,0.91092914,0.0040281904,0.0054313764,0.0005745502,0.075320065],"study_design_scores_gemma":[0.000018288794,0.000053539698,0.00042870909,0.000011811704,0.0000121550065,0.000035346464,0.000052555595,0.9922896,0.002494658,0.004317523,0.00027419685,0.000011648371],"about_ca_topic_score_codex":0.0030237786,"about_ca_topic_score_gemma":0.003953989,"teacher_disagreement_score":0.0030237786,"about_ca_system_score_codex":0.0010032965,"about_ca_system_score_gemma":0.0010859894,"threshold_uncertainty_score":0.008601129},"labels":[],"label_agreement":null},{"id":"W2058048384","doi":"10.1145/944618.944628","title":"Finding the chromatic number by means of critical graphs","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Chromatic scale; Critical graph; Mathematics; Graph coloring; Graph; Discrete mathematics; Graph factorization; Random graph; Edge coloring; Graph power; Line graph","score_opus":0.1340056843624997,"score_gpt":0.413582351479498,"score_spread":0.2795766671169983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058048384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041544605,0.00021409872,0.9540816,0.00017372024,0.00003178423,0.00009922959,0.00016463225,0.00076752243,0.0029226954],"genre_scores_gemma":[0.2296766,0.00019927781,0.76730776,0.000056059846,0.000032307184,0.00013651252,0.000571261,0.0001479436,0.0018723588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954516,0.00007173929,0.00001943786,0.00015801913,0.00013657482,0.000069026275],"domain_scores_gemma":[0.99866617,0.0005700904,0.00019473617,0.00025155544,0.00023298735,0.000084410756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760273,0.0008248742,0.00070320506,0.0024070651,0.0009938182,0.0010815004,0.0016444988,0.0006890919,0.004127093],"category_scores_gemma":[0.0029029413,0.00049049844,0.00048507442,0.0013836755,0.0009723772,0.0025252698,0.0009675933,0.0008413414,0.00054896274],"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.00033724296,0.00022154565,0.0067404136,0.0004218636,0.00007260832,0.00018915434,0.00031757518,0.4354525,0.02504611,0.11725664,0.0065256474,0.4074187],"study_design_scores_gemma":[0.00004844564,0.000074259406,0.00063433626,0.000025487168,0.00002088746,0.00013787657,0.000071836774,0.91153383,0.007884038,0.07522649,0.004311097,0.000031479834],"about_ca_topic_score_codex":0.0047920463,"about_ca_topic_score_gemma":0.006459109,"teacher_disagreement_score":0.0047920463,"about_ca_system_score_codex":0.00146348,"about_ca_system_score_gemma":0.0022485917,"threshold_uncertainty_score":0.013806462},"labels":[],"label_agreement":null},{"id":"W2059818323","doi":"10.1145/1064546.1180611","title":"Fast string sorting using order-preserving compression","year":2005,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Algorithm; Sorting; Computer science; String (physics); Sorting algorithm; Data compression; Bounded function; Online algorithm; Compression (physics); Data structure; Theoretical computer science; Mathematics","score_opus":0.036574168632612,"score_gpt":0.31453958673888593,"score_spread":0.27796541810627395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059818323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5834325,0.0020165693,0.35193425,0.0008566729,0.00052623235,0.0005419113,0.0022973493,0.03172546,0.026669046],"genre_scores_gemma":[0.78038085,0.000787504,0.20832956,0.00024472878,0.00009997444,0.00030036113,0.0029897096,0.00090021896,0.0059670717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821764,0.00016017842,0.00019760917,0.00022441223,0.0009471311,0.00025301054],"domain_scores_gemma":[0.99347794,0.0025684624,0.00033077953,0.002227446,0.0012590161,0.00013631729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011224215,0.00072667556,0.0005714562,0.0018394897,0.0008183854,0.0013282177,0.0015098958,0.0008592956,0.005162708],"category_scores_gemma":[0.0064982055,0.000265458,0.0004860341,0.0053609107,0.00085154694,0.004294463,0.0009834999,0.0008847564,0.0011274511],"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.0032342905,0.0011853157,0.004887313,0.0009465941,0.0001608343,0.00055576646,0.00057315524,0.14693068,0.14812665,0.054172102,0.020291353,0.61893606],"study_design_scores_gemma":[0.00047116156,0.0012314791,0.0027217923,0.00008144102,0.00010163434,0.0006223946,0.0001814541,0.47199738,0.4759842,0.027487423,0.019011695,0.00010791766],"about_ca_topic_score_codex":0.0031789353,"about_ca_topic_score_gemma":0.0024174592,"teacher_disagreement_score":0.005162708,"about_ca_system_score_codex":0.0012840751,"about_ca_system_score_gemma":0.0014801311,"threshold_uncertainty_score":0.017270982},"labels":[],"label_agreement":null},{"id":"W2067110987","doi":"10.1145/1498698.1564499","title":"Experimental study of geometric <i>t</i> -spanners","year":2009,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Euclidean geometry; Set (abstract data type); Perspective (graphical); Point (geometry); Quality (philosophy); Combinatorics; Degree (music); Computer science; Plane (geometry); Euclidean distance; Mathematics; Algorithm; Discrete mathematics; Artificial intelligence; Geometry; Physics; Database","score_opus":0.022805471178469764,"score_gpt":0.2986947756010033,"score_spread":0.27588930442253357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067110987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8788448,0.00048603935,0.10944428,0.00022253553,0.00018217432,0.000299161,0.0010483208,0.0027803245,0.00669242],"genre_scores_gemma":[0.8261971,0.0003380968,0.16685915,0.00008281004,0.00004297718,0.0002820528,0.0035224704,0.0006756039,0.0019997887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971494,0.0006954419,0.00031092862,0.00061574084,0.00092686457,0.0003016519],"domain_scores_gemma":[0.9852046,0.008240857,0.0008984956,0.0031442633,0.0019043214,0.0006075294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028351936,0.0010613666,0.0009677062,0.0016427345,0.0007899763,0.0007177028,0.00216338,0.00121772,0.006454576],"category_scores_gemma":[0.01432826,0.00038916548,0.0008642417,0.0021768555,0.0011233215,0.0018753115,0.0017480364,0.0009417112,0.0013487475],"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.0034277327,0.003152922,0.013658113,0.0029561308,0.00042304557,0.0008208557,0.00093258603,0.43812123,0.19391955,0.018614182,0.008821506,0.3151522],"study_design_scores_gemma":[0.00036501235,0.005931551,0.0093071405,0.00015414557,0.00012951584,0.0010169912,0.00086235063,0.6342566,0.32641017,0.012898192,0.008545038,0.00012318269],"about_ca_topic_score_codex":0.00059010665,"about_ca_topic_score_gemma":0.0005494127,"teacher_disagreement_score":0.006454576,"about_ca_system_score_codex":0.00055808004,"about_ca_system_score_gemma":0.00042371044,"threshold_uncertainty_score":0.021592736},"labels":[],"label_agreement":null},{"id":"W2086354937","doi":"10.1145/1227161.1370601","title":"A graph approach to the threshold all-against-all substring matching problem","year":2008,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","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":"University of Victoria","funders":"","keywords":"Substring; Graph; Matching (statistics); Computer science; Upper and lower bounds; Mathematics; Algorithm; Running time; Combinatorics; Theoretical computer science; Data structure; Statistics","score_opus":0.04409935035977574,"score_gpt":0.2762889576835892,"score_spread":0.23218960732381344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086354937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008863348,0.00020447836,0.98707354,0.00053834636,0.000048203652,0.00010254546,0.00024850783,0.0005092125,0.0024117867],"genre_scores_gemma":[0.1669865,0.0007569353,0.82451266,0.00057203206,0.00017690012,0.00025231406,0.0013440666,0.00029460152,0.005103995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813217,0.0004676917,0.000101558246,0.0006508942,0.00049204094,0.00015567936],"domain_scores_gemma":[0.99716187,0.0013803641,0.000319483,0.00069157616,0.00027893612,0.00016775246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009827442,0.0011055666,0.0014320504,0.0020788081,0.0011484972,0.0017929776,0.0037025567,0.0023947626,0.006212946],"category_scores_gemma":[0.0051425523,0.00058124645,0.0011824499,0.003637419,0.0018040369,0.007516992,0.0024443248,0.0025757807,0.0014437552],"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.00035568493,0.00040071222,0.0012833031,0.0005991646,0.00012839127,0.0004753618,0.00039906453,0.3700523,0.013641085,0.39180294,0.016634366,0.20422761],"study_design_scores_gemma":[0.000046378835,0.0001171596,0.00021187506,0.000023999031,0.000047527967,0.0003657291,0.0001224716,0.64912194,0.0033855408,0.33616942,0.01035721,0.00003082389],"about_ca_topic_score_codex":0.002291968,"about_ca_topic_score_gemma":0.0025457018,"teacher_disagreement_score":0.006212946,"about_ca_system_score_codex":0.0013156747,"about_ca_system_score_gemma":0.0016390121,"threshold_uncertainty_score":0.020784378},"labels":[],"label_agreement":null},{"id":"W2094154930","doi":"10.1145/1498698.1564507","title":"An experimental investigation of set intersection algorithms for text searching","year":2009,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Context (archaeology); Set (abstract data type); Computer science; Algorithm; Theoretical computer science; Randomized algorithm; Information retrieval; Mathematics","score_opus":0.0479229736013965,"score_gpt":0.34821905341615517,"score_spread":0.30029607981475864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094154930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79716235,0.008279687,0.14713073,0.0018814311,0.00077019626,0.0015662191,0.0057492396,0.015096114,0.022363953],"genre_scores_gemma":[0.6515135,0.0014265499,0.33000892,0.00035079455,0.00023316109,0.0012733254,0.010410073,0.0012210048,0.0035626118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9735156,0.011003322,0.003365615,0.0028097685,0.008079876,0.0012257445],"domain_scores_gemma":[0.90793586,0.065476865,0.002809742,0.014480516,0.008281083,0.0010158893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013577845,0.0020030912,0.002437027,0.0043478487,0.002110477,0.0031804089,0.004360543,0.002915689,0.005356369],"category_scores_gemma":[0.07633378,0.000828636,0.0012299827,0.010356249,0.0018585348,0.010023804,0.0029669192,0.0025045876,0.0020533488],"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.017640185,0.0067677023,0.015474038,0.0031421606,0.0010376321,0.00028031718,0.0010161912,0.15802579,0.024679542,0.02127401,0.033048604,0.71761376],"study_design_scores_gemma":[0.0023854473,0.0059872163,0.00850171,0.00014811373,0.00039156567,0.00087638356,0.001230593,0.8830354,0.059111137,0.02395898,0.014185342,0.00018802349],"about_ca_topic_score_codex":0.00566234,"about_ca_topic_score_gemma":0.004351618,"teacher_disagreement_score":0.013577845,"about_ca_system_score_codex":0.0031628294,"about_ca_system_score_gemma":0.0030327113,"threshold_uncertainty_score":0.071807384},"labels":[],"label_agreement":null},{"id":"W2112434174","doi":"10.1145/1187436.1216586","title":"Integrating coordinated checkpointing and recovery mechanisms into DSM synchronization barriers","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Synchronization (alternating current); Overhead (engineering); Shared memory; Abstraction; Distributed shared memory; Parallel computing; Consistency (knowledge bases); Memory management; Computer network; Uniform memory access; Operating system; Overlay","score_opus":0.006637733434060977,"score_gpt":0.2543754159048994,"score_spread":0.24773768247083844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112434174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14611529,0.0012351535,0.8409176,0.00055869203,0.00016593479,0.00022314704,0.000074989075,0.005974217,0.0047349567],"genre_scores_gemma":[0.7963099,0.00024423542,0.20149718,0.00008345939,0.000043707434,0.00011452051,0.00008641915,0.00023925053,0.0013813779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978194,0.0005601378,0.00014713238,0.00020803876,0.0009735514,0.0002916429],"domain_scores_gemma":[0.99627054,0.0009029177,0.00041658714,0.0012992601,0.00084932806,0.00026137367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016628426,0.0005512121,0.000755226,0.0005845602,0.00055908575,0.0013170708,0.002083623,0.0008753659,0.001607987],"category_scores_gemma":[0.0060140705,0.0004858776,0.00041827981,0.00064874935,0.00062886043,0.0015927395,0.0022745791,0.0015222187,0.00037601602],"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.0013846988,0.0007559196,0.006078693,0.00092671905,0.00027905777,0.00063843216,0.0006728763,0.3927115,0.19339529,0.08134873,0.005567079,0.3162409],"study_design_scores_gemma":[0.00046897723,0.0009935924,0.0028002416,0.00007489991,0.00025365487,0.0003873415,0.0002869782,0.8514172,0.09973347,0.019793505,0.023663994,0.0001261563],"about_ca_topic_score_codex":0.0013750847,"about_ca_topic_score_gemma":0.0010930639,"teacher_disagreement_score":0.002083623,"about_ca_system_score_codex":0.00061747513,"about_ca_system_score_gemma":0.001448923,"threshold_uncertainty_score":0.00879401},"labels":[],"label_agreement":null},{"id":"W2131242765","doi":"10.1145/1064546.1180614","title":"Implementing approximation algorithms for the single-source unsplittable flow problem","year":2005,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Approximation algorithm; Heuristics; Minimum-cost flow problem; Algorithm; Mathematics; Vertex (graph theory); Multi-commodity flow problem; Flow (mathematics); Computer science; Flow network; Enhanced Data Rates for GSM Evolution; Path (computing); Mathematical optimization; Graph; Combinatorics","score_opus":0.04379081623079347,"score_gpt":0.29558070819012355,"score_spread":0.2517898919593301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131242765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117215335,0.00085240824,0.86324006,0.0007505214,0.00013351237,0.00026955994,0.0003419328,0.0054775584,0.011718993],"genre_scores_gemma":[0.37999612,0.00038858695,0.615764,0.000205464,0.00004348733,0.0002918755,0.00090403546,0.0003385289,0.0020678726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743646,0.00065418554,0.00016381111,0.0004641069,0.0007178908,0.0005634411],"domain_scores_gemma":[0.99375534,0.0035342379,0.00046119007,0.001300868,0.0007501318,0.00019818594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002702145,0.0014679471,0.0012598868,0.0012421345,0.0013333865,0.002725662,0.0036256006,0.0022223936,0.004831193],"category_scores_gemma":[0.014327081,0.0007410036,0.00091179495,0.0032607892,0.0008872083,0.00399097,0.0017481411,0.0016574836,0.0013555721],"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.0011871752,0.0007965401,0.0026102702,0.00027160838,0.00009284089,0.00009125285,0.00037275878,0.7051436,0.0044137696,0.04104488,0.008152114,0.23582323],"study_design_scores_gemma":[0.00014521269,0.00005980035,0.00016468175,0.000014264425,0.000019387171,0.00004760353,0.00006645405,0.9724087,0.002100163,0.023166759,0.0017962902,0.000010645484],"about_ca_topic_score_codex":0.007196189,"about_ca_topic_score_gemma":0.008507618,"teacher_disagreement_score":0.007196189,"about_ca_system_score_codex":0.0026820567,"about_ca_system_score_gemma":0.0032836527,"threshold_uncertainty_score":0.019459784},"labels":[],"label_agreement":null},{"id":"W2152727633","doi":"10.1145/944618.944629","title":"Solving a \"Hard\" problem to approximate an \"Easy\" one","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Heuristic; Matching (statistics); Mathematical optimization; Travelling salesman problem; Duality (order theory); Combinatorics; Algorithm","score_opus":0.05586580032839563,"score_gpt":0.3173452730164984,"score_spread":0.2614794726881028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152727633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27101567,0.0008070616,0.6842739,0.0030048825,0.00034380433,0.00023740888,0.00046410825,0.0010450425,0.038808078],"genre_scores_gemma":[0.5409044,0.0004029364,0.44992697,0.00039838828,0.00016082871,0.0002714998,0.0005735511,0.0002160382,0.007145404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989002,0.00036316187,0.00004004322,0.00029437523,0.00019249691,0.00020976266],"domain_scores_gemma":[0.99732345,0.0017969145,0.00024367924,0.0003485794,0.00016334331,0.00012396746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014524666,0.0012767141,0.0009799822,0.000857676,0.00085453485,0.0011390542,0.0017096936,0.0019052521,0.010738247],"category_scores_gemma":[0.009800095,0.0004474419,0.0008915922,0.0010177973,0.0013099207,0.0038294026,0.0020242909,0.0016167993,0.0009603899],"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.00035732347,0.00034977318,0.0013062985,0.00035009507,0.000081943355,0.00018340941,0.00009390651,0.7989491,0.0021455458,0.10294539,0.006521345,0.08671581],"study_design_scores_gemma":[0.00007796821,0.00013404085,0.00027957646,0.000025983243,0.000020138374,0.00007214602,0.00009815685,0.91648585,0.0013206188,0.078073375,0.0033983008,0.000013794346],"about_ca_topic_score_codex":0.0020768158,"about_ca_topic_score_gemma":0.002161204,"teacher_disagreement_score":0.010738247,"about_ca_system_score_codex":0.00095179304,"about_ca_system_score_gemma":0.001027986,"threshold_uncertainty_score":0.035923064},"labels":[],"label_agreement":null},{"id":"W2170069407","doi":"10.1145/1187436.1210588","title":"Partitioning planar graphs with costs and weights","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph partition; Book embedding; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Partition (number theory); Computer science; Graph; Outerplanar graph; Mathematics; Discrete mathematics; Pathwidth; Line graph","score_opus":0.016496438464639857,"score_gpt":0.29938283526948845,"score_spread":0.2828863968048486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170069407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21007627,0.00019995931,0.78251904,0.0002939074,0.00003945243,0.00020779751,0.0004512926,0.0015418603,0.004670375],"genre_scores_gemma":[0.40109605,0.0003472111,0.59370416,0.000090728885,0.0000265938,0.00023214857,0.0013371044,0.00044944498,0.0027166281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985837,0.00022365534,0.00009501744,0.00028013551,0.00065706373,0.0001604647],"domain_scores_gemma":[0.9946055,0.0025295594,0.0007757264,0.0010829115,0.00087817694,0.0001280904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074995327,0.0011411178,0.00080741785,0.0018065098,0.0008009521,0.0015940806,0.0013583959,0.00091153523,0.0026269897],"category_scores_gemma":[0.010013731,0.00075086544,0.000719329,0.002689016,0.0009460033,0.0033724047,0.0021871398,0.0010845073,0.0005552152],"study_design_candidate":"bench_or_experimental","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.0006162442,0.00015909024,0.0044759777,0.00043614281,0.00011339497,0.00023878424,0.00029958796,0.6185828,0.057115495,0.076267436,0.0037492076,0.23794584],"study_design_scores_gemma":[0.00010365303,0.00017104823,0.0024953547,0.000036033445,0.0000920356,0.0003296357,0.00033112903,0.81374353,0.05024408,0.12457004,0.007801059,0.00008243176],"about_ca_topic_score_codex":0.003392149,"about_ca_topic_score_gemma":0.0045753405,"teacher_disagreement_score":0.003392149,"about_ca_system_score_codex":0.0011953755,"about_ca_system_score_gemma":0.0011005915,"threshold_uncertainty_score":0.008788168},"labels":[],"label_agreement":null},{"id":"W2220328383","doi":"10.1145/3053370","title":"Array Layouts for Comparison-Based Searching","year":2017,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"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":"Computer science; Cache; Binary search algorithm; Value (mathematics); Parallel computing; Binary tree; Binary number; Latency (audio); Algorithm; Search algorithm; Arithmetic; Mathematics","score_opus":0.05509203364200714,"score_gpt":0.3722407228452136,"score_spread":0.31714868920320644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220328383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067032673,0.0027239376,0.96092665,0.0006575514,0.00046113142,0.00019005651,0.001041091,0.010193178,0.017103229],"genre_scores_gemma":[0.07988312,0.001281188,0.90782684,0.0004929058,0.00019011278,0.0003825683,0.0010532907,0.0018833304,0.0070065362],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983657,0.00042962085,0.0001770696,0.00034615505,0.00054638,0.00013498432],"domain_scores_gemma":[0.9951454,0.0017543266,0.00042185208,0.001744248,0.0008130016,0.00012117934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014444669,0.0010906804,0.0009014493,0.0017397403,0.0009955771,0.0029104317,0.0028230734,0.0011764208,0.027089102],"category_scores_gemma":[0.010304088,0.00073665247,0.000814827,0.004315272,0.0011152017,0.006000708,0.001902532,0.001370347,0.011422178],"study_design_candidate":"bench_or_experimental","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.0006932633,0.00017395252,0.0013408939,0.0010690012,0.00008456983,0.00022941422,0.00038511286,0.04103215,0.026450707,0.34759906,0.043192957,0.53774893],"study_design_scores_gemma":[0.0002702942,0.0007623711,0.00080655166,0.00028894373,0.000108912,0.0010183209,0.00028729276,0.13533424,0.049964678,0.5146514,0.29632607,0.00018098604],"about_ca_topic_score_codex":0.0011998815,"about_ca_topic_score_gemma":0.0019824593,"teacher_disagreement_score":0.027089102,"about_ca_system_score_codex":0.0013411465,"about_ca_system_score_gemma":0.0015820061,"threshold_uncertainty_score":0.09062201},"labels":[],"label_agreement":null},{"id":"W2806308536","doi":"10.1145/3325111","title":"A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer","year":2019,"lang":"en","type":"preprint","venue":"ACM Journal of Experimental Algorithmics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Supercomputer; Parallelizable manifold; Parallel computing; Benchmarking; Computer science; Titan (rocket family); Embarrassingly parallel; Matrix (chemical analysis); Computational science; FLOPS; Algorithm; Parallel algorithm; Physics; Chemistry","score_opus":0.04067249351576445,"score_gpt":0.30627419484057744,"score_spread":0.265601701324813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806308536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17024374,0.0022310244,0.76512647,0.0012070113,0.00072059355,0.00020864862,0.0013140186,0.009632631,0.04931586],"genre_scores_gemma":[0.47423336,0.000835111,0.514487,0.00031849474,0.00020886958,0.0002834798,0.0020346695,0.0017427948,0.005856118],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978192,0.00034941547,0.00011547317,0.00019523775,0.0013369055,0.00018375256],"domain_scores_gemma":[0.99522984,0.0015122419,0.0002174366,0.0013371005,0.0015139757,0.00018936493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020092365,0.0009214266,0.0009518249,0.002790696,0.00077982334,0.0013085802,0.0020885644,0.0011120511,0.008843496],"category_scores_gemma":[0.012044482,0.00028829926,0.0005828864,0.003919073,0.00083279656,0.0038490873,0.0011308183,0.0013874024,0.0016657249],"study_design_candidate":"bench_or_experimental","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.0005473287,0.0004112145,0.004004014,0.00058462704,0.0001290134,0.00028063127,0.000465844,0.26957458,0.01621711,0.24743935,0.039288647,0.4210576],"study_design_scores_gemma":[0.00009347919,0.0001204173,0.001052108,0.000051900406,0.00002087542,0.0001277976,0.00007790319,0.8943,0.010599528,0.07771759,0.015792249,0.000046130765],"about_ca_topic_score_codex":0.007955493,"about_ca_topic_score_gemma":0.0062308777,"teacher_disagreement_score":0.008843496,"about_ca_system_score_codex":0.0014297339,"about_ca_system_score_gemma":0.0014628216,"threshold_uncertainty_score":0.029584467},"labels":[],"label_agreement":null},{"id":"W2886931138","doi":"10.1145/3379552","title":"An Experimental Study of Algorithms for Online Bipartite Matching","year":2020,"lang":"en","type":"preprint","venue":"ACM Journal of Experimental Algorithmics","topic":"Optimization and Search Problems","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":"Concordia University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Greedy algorithm; Bipartite graph; Computer science; Matching (statistics); Algorithm; Preprocessor; Ranking (information retrieval); Online algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Mathematics; Graph","score_opus":0.09766027536202379,"score_gpt":0.3921035343862945,"score_spread":0.2944432590242707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886931138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7083427,0.008524172,0.19483125,0.0058243084,0.0022083456,0.0024458824,0.011349304,0.015581801,0.05089239],"genre_scores_gemma":[0.79030144,0.0011015112,0.18650515,0.0010090189,0.00036410693,0.001271289,0.013895031,0.0013048991,0.004247545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97150505,0.012933149,0.0027587821,0.003988071,0.0063994,0.00241554],"domain_scores_gemma":[0.8803639,0.074462555,0.005766916,0.028837847,0.008531949,0.0020369182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017587014,0.002433979,0.0019654254,0.0029007252,0.002067728,0.0025660854,0.0053592203,0.0029710452,0.0078102737],"category_scores_gemma":[0.0748284,0.00081814174,0.001602333,0.00529354,0.002369121,0.0068390053,0.0031651845,0.0040668184,0.0022070957],"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.010925724,0.01427413,0.017985463,0.0037632703,0.001154025,0.00045566526,0.0004419758,0.5092623,0.020480435,0.044781897,0.072992064,0.30348295],"study_design_scores_gemma":[0.0018007895,0.0036073227,0.00586882,0.00019643371,0.00023075023,0.0007557326,0.00051367225,0.9066765,0.026925426,0.035679776,0.017625624,0.00011912194],"about_ca_topic_score_codex":0.0030023968,"about_ca_topic_score_gemma":0.0034381612,"teacher_disagreement_score":0.017587014,"about_ca_system_score_codex":0.0041131997,"about_ca_system_score_gemma":0.0029115153,"threshold_uncertainty_score":0.09301019},"labels":[],"label_agreement":null},{"id":"W2994941531","doi":"10.1145/3376122","title":"Xor Filters","year":2020,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bloom filter; Filter (signal processing); Cuckoo; Generalization; Set (abstract data type); Bitwise operation; Filter design","score_opus":0.03599654909467832,"score_gpt":0.2578440371868842,"score_spread":0.2218474880922059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994941531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029220391,0.0019234743,0.8982734,0.0014878093,0.00070287107,0.00093901064,0.003691741,0.012672704,0.05108849],"genre_scores_gemma":[0.32749853,0.0025958049,0.5888689,0.001880688,0.0006149513,0.0011523989,0.005328514,0.001540268,0.070519924],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99678624,0.0003964319,0.00034864622,0.00066189514,0.0013403996,0.00046649014],"domain_scores_gemma":[0.99245197,0.0022741691,0.00054747536,0.0025938784,0.0018870461,0.00024547844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021078566,0.0011013341,0.001574673,0.0019668646,0.0019829366,0.0040244693,0.0021287187,0.0016170362,0.030293768],"category_scores_gemma":[0.012486165,0.0007962909,0.0011258557,0.0024520806,0.0011771556,0.008318209,0.0026695114,0.0015976796,0.010483293],"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.0016070892,0.00025059193,0.0032858958,0.00065166084,0.00012923186,0.0003465273,0.00040016836,0.01583508,0.022447336,0.30511233,0.06679122,0.58314294],"study_design_scores_gemma":[0.0003216401,0.0005493909,0.0014466975,0.00034325555,0.00023933682,0.0015968782,0.00040964963,0.23158067,0.084634036,0.29216686,0.38652366,0.00018788173],"about_ca_topic_score_codex":0.0038749895,"about_ca_topic_score_gemma":0.0045846063,"teacher_disagreement_score":0.030293768,"about_ca_system_score_codex":0.0026828095,"about_ca_system_score_gemma":0.0031032586,"threshold_uncertainty_score":0.10134274},"labels":[],"label_agreement":null},{"id":"W3089486988","doi":"10.1145/3412324","title":"Computing Autotopism Groups of Partial Latin Rectangles","year":2020,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Backtracking; Computation; Graph; Software; Group (periodic table); Theoretical computer science; Algorithm; Programming language","score_opus":0.035444555925030666,"score_gpt":0.2810990042413903,"score_spread":0.24565444831635963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089486988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4567426,0.00020261947,0.5226224,0.00014964635,0.000047998463,0.00009679649,0.00028376147,0.0055074985,0.014346569],"genre_scores_gemma":[0.6878049,0.000076657605,0.3070072,0.000071105795,0.00002805558,0.0000667306,0.0008589778,0.0005307067,0.0035557374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917173,0.000205356,0.00005563142,0.00024397002,0.00018807342,0.00013528875],"domain_scores_gemma":[0.9974661,0.001089149,0.00032841953,0.0007271783,0.00028049745,0.0001086156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008315643,0.0005180432,0.0006013047,0.001251464,0.00041744427,0.0013197655,0.0010370031,0.0005287046,0.0053201704],"category_scores_gemma":[0.003449115,0.00037628837,0.00092835125,0.00093678915,0.0010731438,0.0027521257,0.0014957557,0.00054535846,0.0012120318],"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.0010850491,0.00023443597,0.020682326,0.0005796597,0.00016451554,0.00051076186,0.0014674463,0.23704281,0.051199608,0.17203322,0.007949302,0.5070509],"study_design_scores_gemma":[0.00015487634,0.00054199423,0.0036659946,0.00006731163,0.000055130196,0.00043545844,0.0007199768,0.80590385,0.054791857,0.12156877,0.012014654,0.00008015126],"about_ca_topic_score_codex":0.0018211207,"about_ca_topic_score_gemma":0.0022245096,"teacher_disagreement_score":0.0053201704,"about_ca_system_score_codex":0.0005440644,"about_ca_system_score_gemma":0.0008490697,"threshold_uncertainty_score":0.017797709},"labels":[],"label_agreement":null},{"id":"W4214926007","doi":"10.1145/3510449","title":"Binary Fuse Filters: Fast and Smaller Than Xor Filters","year":2022,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Bloom filter; Cuckoo; Binary number; Fuse (electrical); Computer science; Cuckoo search; Algorithm; Upper and lower bounds; Quotient; Mathematics; Arithmetic; Engineering; Electrical engineering","score_opus":0.020872648572750205,"score_gpt":0.24265433205716438,"score_spread":0.22178168348441418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214926007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12287324,0.0021281794,0.84677607,0.0010853683,0.00024478917,0.00048459382,0.0009940555,0.009217025,0.016196761],"genre_scores_gemma":[0.5734394,0.0008799904,0.4112615,0.0006120712,0.00015650677,0.00030198813,0.0013607563,0.00054247404,0.01144533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970541,0.0003179837,0.00019460882,0.00036890502,0.0016851245,0.00037929116],"domain_scores_gemma":[0.9915338,0.0032230704,0.00077285623,0.0021833119,0.0019577753,0.00032921607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024231214,0.0008470018,0.0013176284,0.0019475697,0.0015355744,0.0034366336,0.001675751,0.0019562505,0.006701977],"category_scores_gemma":[0.014074924,0.000586473,0.000790067,0.002233915,0.0011678454,0.008185149,0.0020828994,0.0012825845,0.0020159772],"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.0025223843,0.00040509054,0.006339058,0.00047250572,0.00014562483,0.00017186573,0.00061246287,0.057098154,0.06588234,0.1562636,0.02844092,0.68164593],"study_design_scores_gemma":[0.0002195841,0.00076047826,0.0030388613,0.0001524574,0.000157747,0.0008236592,0.00043196965,0.69934696,0.11731863,0.11323297,0.064329684,0.00018705838],"about_ca_topic_score_codex":0.01176799,"about_ca_topic_score_gemma":0.009167544,"teacher_disagreement_score":0.01176799,"about_ca_system_score_codex":0.004004656,"about_ca_system_score_gemma":0.0026467268,"threshold_uncertainty_score":0.029055953},"labels":[],"label_agreement":null},{"id":"W4229008461","doi":"10.1145/3524134","title":"Coordinated Motion Planning Through Randomized <i>k</i> -Opt","year":2022,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Initialization; Job shop scheduling; Mathematical optimization; Computer science; Square (algebra); Sequence (biology); Motion (physics); Robot; Phase (matter); Mathematics; Motion planning; Artificial intelligence; Schedule; Geometry; Physics","score_opus":0.02827921308986038,"score_gpt":0.2957232502654412,"score_spread":0.26744403717558085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229008461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04662843,0.00029692613,0.9362294,0.00043306986,0.00009584971,0.00020604793,0.00019640541,0.0023493965,0.013564387],"genre_scores_gemma":[0.6907636,0.000099274905,0.30351856,0.00028162164,0.000029502324,0.0003779562,0.00025914586,0.00034964568,0.004320736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988458,0.00038581915,0.000051509316,0.00028205983,0.0002001865,0.00023459703],"domain_scores_gemma":[0.9985696,0.00079319044,0.00019183314,0.00022017366,0.00012240656,0.00010273769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013808775,0.0010423661,0.0012635895,0.00055341254,0.00092299056,0.0010593473,0.0021120422,0.0010573398,0.004510696],"category_scores_gemma":[0.003971257,0.00064069574,0.00066834653,0.00073613453,0.001829528,0.001447934,0.0022242344,0.0012631544,0.0009589996],"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.00064373616,0.000113868744,0.0005014699,0.00011983177,0.00004744533,0.00010301153,0.000108306296,0.9205101,0.0024895438,0.02000171,0.0040742396,0.05128674],"study_design_scores_gemma":[0.00016015136,0.00021839948,0.000118270014,0.000014519648,0.00001883645,0.000040789342,0.000041193158,0.9835902,0.0011482035,0.013251274,0.001381502,0.000016651351],"about_ca_topic_score_codex":0.005442457,"about_ca_topic_score_gemma":0.0108979475,"teacher_disagreement_score":0.005442457,"about_ca_system_score_codex":0.0010942896,"about_ca_system_score_gemma":0.0021301594,"threshold_uncertainty_score":0.01508981},"labels":[],"label_agreement":null},{"id":"W4361003657","doi":"10.1145/3588869","title":"Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring","year":2023,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Graph coloring; Constraint satisfaction problem; Partition (number theory); Computer science; Vertex (graph theory); Implementation; Binary number; Graph; Graph partition; Theoretical computer science; Mathematical optimization; Combinatorics; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.11747035310145508,"score_gpt":0.3966672885918802,"score_spread":0.2791969354904251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361003657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02597036,0.00032011155,0.96139324,0.00065604906,0.00011247951,0.0001873487,0.0002847419,0.0006631348,0.010412556],"genre_scores_gemma":[0.36386186,0.00043859452,0.6294782,0.00034438734,0.00014386859,0.0003486353,0.00069261255,0.0005343975,0.004157407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968863,0.0015157495,0.00011312079,0.00035534953,0.00072822336,0.0004011708],"domain_scores_gemma":[0.9949857,0.0036883117,0.00029452035,0.0004023348,0.0004282468,0.00020099968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028344456,0.0011440193,0.0010065808,0.0010233013,0.000993644,0.0018936376,0.001714121,0.001011011,0.0054589356],"category_scores_gemma":[0.010938561,0.0005506791,0.0010779286,0.0026994993,0.0013000594,0.002349991,0.0023149566,0.0024606884,0.0005824982],"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.00040581022,0.00026971143,0.0007603705,0.00034013914,0.00007376165,0.00007180595,0.00020987344,0.72516507,0.0037769964,0.1645245,0.010208526,0.09419339],"study_design_scores_gemma":[0.000048586367,0.000051063813,0.00011784141,0.000013605029,0.0000126379155,0.000021987735,0.000039013892,0.9384384,0.0017127163,0.057685103,0.0018499893,0.000009061693],"about_ca_topic_score_codex":0.011035661,"about_ca_topic_score_gemma":0.008016452,"teacher_disagreement_score":0.011035661,"about_ca_system_score_codex":0.0022285148,"about_ca_system_score_gemma":0.0035263912,"threshold_uncertainty_score":0.021942854},"labels":[],"label_agreement":null}]}