{"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":"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.9398091,0.0034744334,0.055807818,0.00004434119,0.0005201546,0.00022838406,0.00005089445,0.0000063823877,0.000058494777],"genre_scores_gemma":[0.7418204,0.00015043345,0.25757292,0.000026030522,0.00026433636,0.0000053395725,0.00009868785,0.00001838815,0.000043485452],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991711,0.000018093655,0.00033464603,0.00019253498,0.00010521428,0.00017840875],"domain_scores_gemma":[0.99926007,0.0000122450565,0.00025436733,0.0002891311,0.00011266603,0.00007154881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028518224,0.00012743325,0.00014578401,0.000050358543,0.00011960157,0.00005218801,0.00040909633,0.000076643366,0.000006035027],"category_scores_gemma":[0.000056754703,0.000119234006,0.000055485238,0.000038639315,0.000054010397,0.00004457885,0.00033108692,0.00006850328,4.0285627e-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.00033560372,0.00039024116,0.0016955724,0.00005986416,0.00041418945,0.000013242921,0.004278029,0.000010145184,0.914291,0.00048209322,0.00039867798,0.0776313],"study_design_scores_gemma":[0.0027007242,0.0018775455,0.001049511,0.0000779955,0.00014243509,0.0013344941,0.015669132,0.0039220406,0.9663343,0.00093390886,0.005416381,0.0005415315],"about_ca_topic_score_codex":0.000011503258,"about_ca_topic_score_gemma":0.0000015208404,"teacher_disagreement_score":0.2017651,"about_ca_system_score_codex":0.000028544933,"about_ca_system_score_gemma":0.00005695911,"threshold_uncertainty_score":0.48622215},"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":"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.47277895,0.00042052747,0.52584815,0.000087357424,0.0002652678,0.0004425494,0.00012362929,0.000024996836,0.000008612287],"genre_scores_gemma":[0.56303465,0.0000110970705,0.43678293,0.00003541403,0.000075917036,0.000005844739,0.000044669727,0.000008845444,6.235019e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781966,0.000052889296,0.000875548,0.00046960879,0.00051692873,0.0002653463],"domain_scores_gemma":[0.99652016,0.00008823869,0.0006580572,0.0025190369,0.00012992688,0.00008459971],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0014291614,0.00018706569,0.00036036255,0.00021041944,0.00011159548,0.00008612265,0.0058915755,0.00005824001,0.0000018900018],"category_scores_gemma":[0.00010958211,0.00015833278,0.00003951974,0.0002845821,0.000044026034,0.0024810517,0.0037411044,0.00022553092,3.2783493e-7],"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.0006762268,0.0142408805,0.0099616805,0.00024386594,0.00017210406,0.00025979712,0.004535853,0.0018118859,0.080621675,0.0003309119,0.00051777577,0.8866273],"study_design_scores_gemma":[0.00866645,0.00553907,0.0015897005,0.0005232912,0.000046807683,0.00010037743,0.003485164,0.82537395,0.15335907,0.00023997715,0.0005037258,0.00057241315],"about_ca_topic_score_codex":0.0002475737,"about_ca_topic_score_gemma":0.000014082502,"teacher_disagreement_score":0.88605493,"about_ca_system_score_codex":0.00015640716,"about_ca_system_score_gemma":0.00024277363,"threshold_uncertainty_score":0.99948704},"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":"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.010878215,0.0030629514,0.9823629,0.00039063144,0.0026394904,0.000240236,0.000020676247,0.000062754756,0.0003421321],"genre_scores_gemma":[0.14609826,0.00007614627,0.85218054,0.0005480892,0.0009631755,0.000015975505,0.0000100925545,0.000019328934,0.000088428664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997872,0.00005703456,0.00065078726,0.00023382166,0.0004561327,0.0007302086],"domain_scores_gemma":[0.9984439,0.000145533,0.00048770264,0.00050851965,0.00013543792,0.00027890925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127711,0.0002337324,0.00034735433,0.00020245614,0.00022460379,0.0001898526,0.001946336,0.000083565734,0.000029460783],"category_scores_gemma":[0.00011398173,0.00019243931,0.000298367,0.0002970816,0.000046993613,0.002292636,0.0009227074,0.00021958057,0.000013587106],"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.00004460654,0.0032129693,0.0017790077,0.000021236403,0.0004310486,0.00012933543,0.002543331,0.000004103222,0.0063590812,0.256371,0.011969123,0.7171352],"study_design_scores_gemma":[0.02291043,0.008528268,0.0041000843,0.00030392624,0.0003979637,0.0036467712,0.014491607,0.31093135,0.28358614,0.1146193,0.23171437,0.004769762],"about_ca_topic_score_codex":0.0000030012825,"about_ca_topic_score_gemma":1.2068698e-7,"teacher_disagreement_score":0.7123654,"about_ca_system_score_codex":0.00007856018,"about_ca_system_score_gemma":0.000031693715,"threshold_uncertainty_score":0.78474474},"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":"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.8894742,0.0001564131,0.109371014,0.00028568454,0.00042989297,0.000110565576,0.0000018436763,0.000011679227,0.00015869075],"genre_scores_gemma":[0.79771495,0.000007876313,0.20200223,0.0001275874,0.00012529726,6.2422805e-7,0.000002851317,0.000004766448,0.000013805085],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987321,0.00011693928,0.00043072947,0.00013637595,0.0004646919,0.00011916717],"domain_scores_gemma":[0.9989854,0.00006412429,0.0004502838,0.000266413,0.00017637032,0.000057392717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028846343,0.000106434025,0.00014959153,0.00010659428,0.00017596035,0.000037020796,0.0008026296,0.000035491532,0.0000040386576],"category_scores_gemma":[0.000021951319,0.0000749342,0.000091201204,0.0002906691,0.00005394119,0.0005121572,0.0001778023,0.00013387196,0.0000014676226],"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.00034461953,0.009148253,0.008787967,0.00006674942,0.00042411295,0.00011403541,0.056121007,0.1119691,0.5662004,0.039278936,0.0036447488,0.20390013],"study_design_scores_gemma":[0.0016781772,0.0012356931,0.0069278874,0.00010773149,0.000007449505,0.0008760221,0.00040565198,0.51953626,0.465963,0.0025429132,0.00047404008,0.00024516197],"about_ca_topic_score_codex":0.00000454542,"about_ca_topic_score_gemma":3.2199637e-7,"teacher_disagreement_score":0.40756717,"about_ca_system_score_codex":0.000059612656,"about_ca_system_score_gemma":0.00007710129,"threshold_uncertainty_score":0.3055728},"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":"empirical","genre_gemma":"methods","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.5332254,0.01280798,0.44224906,0.000838172,0.004561166,0.00024449875,0.00002332772,0.000383401,0.0056669586],"genre_scores_gemma":[0.48579305,0.000049843402,0.5137334,0.000112740025,0.00028668038,0.000001486826,0.0000012030573,0.000008073275,0.000013527182],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987592,0.000042361033,0.00035755854,0.000111665046,0.00036051418,0.00036869725],"domain_scores_gemma":[0.99867135,0.00007244753,0.00028759456,0.0006366975,0.000079161786,0.00025274183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034751967,0.0001373649,0.00018867236,0.00013374782,0.000056500092,0.00008637566,0.0017674547,0.00005266305,0.000023958984],"category_scores_gemma":[0.0000956285,0.00011788864,0.00009713603,0.00017774984,0.00004531553,0.0018250459,0.0007353874,0.00017509765,0.000021410868],"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.00007460069,0.0044036806,0.031034043,0.000015736381,0.00039474538,0.00030812612,0.011925985,0.0000054352076,0.21360944,0.07450914,0.09041564,0.5733034],"study_design_scores_gemma":[0.0007544169,0.0008913094,0.002532327,0.00005782641,0.000016761045,0.0016808899,0.0007087431,0.0006172594,0.96346444,0.0025099064,0.026354011,0.00041209793],"about_ca_topic_score_codex":0.000010047417,"about_ca_topic_score_gemma":7.775659e-8,"teacher_disagreement_score":0.749855,"about_ca_system_score_codex":0.00012248592,"about_ca_system_score_gemma":0.000049230075,"threshold_uncertainty_score":0.4807359},"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":"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.31663403,0.00021245124,0.6824175,0.000047566977,0.00056782016,0.00007676713,0.0000019744568,0.0000046680498,0.000037231428],"genre_scores_gemma":[0.5364741,0.0000024108579,0.46338612,0.000029594305,0.00009679605,7.4764796e-7,0.0000023459895,0.0000034921254,0.0000043673663],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988172,0.00001658654,0.0006209272,0.0001161243,0.00025705414,0.00017212321],"domain_scores_gemma":[0.9989228,0.00030936772,0.00040850323,0.00015167479,0.00013457125,0.00007303482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066852977,0.000097310854,0.0002007629,0.00022019372,0.00004423528,0.000032245793,0.00040703858,0.00003933438,0.0000042825413],"category_scores_gemma":[0.00013498236,0.00009438291,0.00008334723,0.00012999687,0.000013579099,0.0003271112,0.00008430778,0.000098291246,3.118522e-7],"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.0006722677,0.002404531,0.004272759,0.00015391171,0.000276908,0.0008242432,0.011041326,0.08614432,0.43372455,0.012498513,0.0014736252,0.44651303],"study_design_scores_gemma":[0.001215715,0.0005405558,0.002771098,0.000067020206,0.0000057735315,0.00026812876,0.00034579655,0.1847608,0.80722564,0.0025269713,0.00012858829,0.00014388363],"about_ca_topic_score_codex":0.0000063613447,"about_ca_topic_score_gemma":0.0000016422072,"teacher_disagreement_score":0.44636914,"about_ca_system_score_codex":0.00008837229,"about_ca_system_score_gemma":0.000069153066,"threshold_uncertainty_score":0.38488233},"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":"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.9765429,0.0073573454,0.0078182295,0.004043338,0.0017037719,0.00010470273,0.000031740798,0.00001694237,0.0023810237],"genre_scores_gemma":[0.97164816,0.000052120424,0.027790338,0.00015520093,0.00013224475,0.0000017387218,4.8110525e-7,0.000011636988,0.00020810337],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970111,0.00018737084,0.0010040652,0.000165842,0.0013621342,0.0002694821],"domain_scores_gemma":[0.99633455,0.0022257778,0.00045819452,0.0005025909,0.0003313383,0.00014755919],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017478202,0.00013716237,0.00034386182,0.00014424986,0.00026301472,0.00013376948,0.0012987566,0.00006768869,0.0013359702],"category_scores_gemma":[0.004250277,0.00008328106,0.00030382868,0.0006254622,0.0003920424,0.00034607158,0.00014532835,0.00028743994,0.00011473765],"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.00021195188,0.011240258,0.02212589,0.000044196346,0.0014222931,0.00031110627,0.046457786,0.0011737533,0.27093452,0.0436167,0.54193676,0.0605248],"study_design_scores_gemma":[0.0069784806,0.0026613711,0.0035213646,0.00056239654,0.0006837907,0.0066946764,0.06967038,0.13163975,0.50646836,0.24908017,0.020167293,0.0018719499],"about_ca_topic_score_codex":0.000011866794,"about_ca_topic_score_gemma":3.9853416e-7,"teacher_disagreement_score":0.52176946,"about_ca_system_score_codex":0.000045811055,"about_ca_system_score_gemma":0.000028110224,"threshold_uncertainty_score":0.9995769},"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":"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.27298352,0.002985867,0.7225316,0.00025707702,0.00088530476,0.00009533354,0.0000033799242,0.00005470368,0.00020323526],"genre_scores_gemma":[0.36001387,0.00004684381,0.63910055,0.000117020376,0.00068558234,8.526449e-7,0.0000017930181,0.000017448601,0.000016053413],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772096,0.00008072593,0.000806548,0.000298146,0.0006846678,0.00040892587],"domain_scores_gemma":[0.9979846,0.000106005915,0.0007203639,0.0007127649,0.00024888647,0.00022741774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042038978,0.00024154045,0.0003400065,0.00019981373,0.0003444538,0.0002906618,0.0023739936,0.00008682986,0.000039328308],"category_scores_gemma":[0.00010104276,0.0002068479,0.0001341235,0.00034167283,0.000043471915,0.0026804714,0.0022062121,0.00039569614,0.000007456236],"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.000064541586,0.0008071191,0.0008738877,0.000020085949,0.00012128741,0.00023440675,0.0030160036,0.024890896,0.612106,0.0017936315,0.0014711574,0.35460097],"study_design_scores_gemma":[0.0011172454,0.00019376745,0.00014764612,0.00028310975,0.000012403994,0.00067406363,0.0007342875,0.78144366,0.21253505,0.0005101109,0.002002136,0.00034650048],"about_ca_topic_score_codex":0.000037050686,"about_ca_topic_score_gemma":7.8837684e-7,"teacher_disagreement_score":0.75655276,"about_ca_system_score_codex":0.00019444808,"about_ca_system_score_gemma":0.000108944114,"threshold_uncertainty_score":0.84350127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9278464,0.0029400613,0.06788984,0.0001531439,0.00079346396,0.00016363851,0.0000010601236,0.000018727977,0.00019370693],"genre_scores_gemma":[0.93438864,0.000015569101,0.065176755,0.00017993244,0.00020743227,0.000001872568,0.000001357244,0.000006123753,0.000022297634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981413,0.00007558784,0.00066547346,0.00020965397,0.00071476237,0.0001932591],"domain_scores_gemma":[0.99869525,0.00008328528,0.00048304023,0.00037140728,0.00023190441,0.00013511613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003350952,0.00016783093,0.00030107322,0.00055082876,0.000092910035,0.000073562514,0.001117138,0.000044042263,0.000012997757],"category_scores_gemma":[0.000058205213,0.00015410724,0.00013148403,0.0010540856,0.000025786345,0.0007575914,0.00019613298,0.00015016005,0.0000034581383],"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.00029562475,0.028469775,0.00064865366,0.000007481514,0.00033628588,0.00034467274,0.015217799,0.013032432,0.8089104,0.0052983076,0.004203746,0.12323481],"study_design_scores_gemma":[0.0032802795,0.013221717,0.0025309732,0.000021196322,0.000019696212,0.00041155575,0.0044992454,0.006366242,0.9682449,0.0006878942,0.00039885571,0.00031745445],"about_ca_topic_score_codex":0.000006704953,"about_ca_topic_score_gemma":1.2728033e-7,"teacher_disagreement_score":0.15933448,"about_ca_system_score_codex":0.00010460414,"about_ca_system_score_gemma":0.00007711714,"threshold_uncertainty_score":0.6284311},"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":"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.291038,0.0035350034,0.7008393,0.0012550905,0.0010934199,0.0004571293,0.000009218993,0.000090024,0.0016828153],"genre_scores_gemma":[0.42258593,0.00023884857,0.575327,0.0013616486,0.0004133609,0.000013466544,0.0000056097037,0.000024216391,0.000029931742],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767846,0.000066306144,0.0006261578,0.00035586805,0.0008179328,0.00045528455],"domain_scores_gemma":[0.9982752,0.00006989576,0.0003503752,0.0008921089,0.00012288669,0.00028952962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261036,0.00027060692,0.00031744197,0.00018759858,0.000371685,0.00021398207,0.003387294,0.000074137686,0.0000028902182],"category_scores_gemma":[0.000017923347,0.0001798309,0.0002017599,0.0003975285,0.00006300141,0.0011148129,0.001430006,0.00047917373,0.000012773679],"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.0006811259,0.010880689,0.0023237467,0.000120296165,0.002487837,0.0039861333,0.18188365,0.07783013,0.33618876,0.060280684,0.13204646,0.19129048],"study_design_scores_gemma":[0.014758482,0.0056464123,0.0051227235,0.0012014372,0.00022414658,0.03634652,0.015193433,0.4029352,0.35161206,0.03232943,0.1281274,0.006502755],"about_ca_topic_score_codex":0.000029865598,"about_ca_topic_score_gemma":4.7739536e-7,"teacher_disagreement_score":0.32510507,"about_ca_system_score_codex":0.000111167516,"about_ca_system_score_gemma":0.00008256482,"threshold_uncertainty_score":0.7333291},"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":"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.4877282,0.0008274399,0.51007044,0.00019576077,0.0008624661,0.000228811,0.00001811646,0.000036832247,0.00003188791],"genre_scores_gemma":[0.63409436,0.000013922135,0.36540318,0.00014132398,0.00030997721,0.0000042559295,0.000017083028,0.00001117765,0.0000047322214],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797785,0.000110382854,0.0007407944,0.000319912,0.0005577921,0.0002932422],"domain_scores_gemma":[0.9981913,0.00009728653,0.00061381736,0.00059000385,0.00025815528,0.00024942026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005934482,0.0002289705,0.0003490046,0.00028327818,0.00018096974,0.0001596583,0.0014978262,0.000095602045,0.000009229614],"category_scores_gemma":[0.000047180118,0.00020396705,0.00018403113,0.00025548454,0.00008171205,0.0024378262,0.00022923606,0.00023683644,0.0000015352512],"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.00013297627,0.000499768,0.00007853331,0.0000072404614,0.00003895554,0.000018126666,0.0060401927,0.00018644324,0.9254264,0.0019879767,0.0007378199,0.06484553],"study_design_scores_gemma":[0.0014198808,0.004399514,0.00051291,0.00009515913,0.000010240523,0.00026831232,0.002258458,0.11903226,0.8681633,0.0034111037,0.00017800255,0.00025089906],"about_ca_topic_score_codex":0.00002264675,"about_ca_topic_score_gemma":2.8474398e-7,"teacher_disagreement_score":0.14636612,"about_ca_system_score_codex":0.00017770166,"about_ca_system_score_gemma":0.000111695925,"threshold_uncertainty_score":0.8317535},"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":"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.09138642,0.0013326198,0.905966,0.00013480023,0.0009171384,0.000077163735,0.0000016166571,0.000028767754,0.00015548663],"genre_scores_gemma":[0.7239709,0.000022052278,0.27576393,0.00010316542,0.00011384246,8.891151e-7,0.0000018785663,0.000009890796,0.00001344872],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985393,0.000044990225,0.00064772816,0.00020855032,0.0003001045,0.00025931845],"domain_scores_gemma":[0.9987229,0.00008523106,0.0005066411,0.0002406307,0.0002328724,0.00021172692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010700489,0.0001660226,0.0002555478,0.0001404556,0.00020252439,0.00021221169,0.00063657894,0.00008829144,0.0000065023696],"category_scores_gemma":[0.00026771027,0.00014894914,0.000076887634,0.00034191663,0.00004445965,0.00097522413,0.00025926833,0.00023056498,0.0000017950301],"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.000103910126,0.0002243608,0.00079344487,0.00005094161,0.0002391058,0.0005054563,0.009834633,0.00021378185,0.6008888,0.036038592,0.00075019826,0.35035682],"study_design_scores_gemma":[0.0034836242,0.001973933,0.00046474003,0.00081851997,0.000035670957,0.0029241736,0.019585727,0.17586446,0.7748091,0.017206525,0.0017535678,0.0010799322],"about_ca_topic_score_codex":0.000040563886,"about_ca_topic_score_gemma":0.0000024123078,"teacher_disagreement_score":0.63258445,"about_ca_system_score_codex":0.00020939205,"about_ca_system_score_gemma":0.000078978264,"threshold_uncertainty_score":0.60739696},"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":"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.0023402877,0.0030041386,0.99089855,0.0023035319,0.0006947176,0.00046149,0.000010162896,0.00006612655,0.00022096948],"genre_scores_gemma":[0.032324303,0.00005470392,0.96575683,0.0004167575,0.0012526355,0.00003882059,0.000005834788,0.00002840089,0.00012173396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974276,0.000067563116,0.0008958103,0.00032243083,0.0006211237,0.0006655104],"domain_scores_gemma":[0.99774164,0.00045712083,0.00066395453,0.00067123206,0.00032150446,0.00014455279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013854259,0.00027399586,0.00032313395,0.00017377234,0.0007114047,0.00044791112,0.0023793918,0.00006215118,0.000024696998],"category_scores_gemma":[0.00008393161,0.00020776768,0.00032800637,0.00043123518,0.000103930266,0.0013567891,0.0007683491,0.00030252335,0.000005979137],"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.000028230774,0.0005190093,0.000022389477,0.000014306849,0.00014895454,0.0000051976576,0.0024271512,0.0022730664,0.007960066,0.0073548933,0.0016669485,0.9775798],"study_design_scores_gemma":[0.001653595,0.0005705261,0.000025463043,0.00005703124,0.00003992961,0.00043876038,0.0010145064,0.80470735,0.082196936,0.007336135,0.10159273,0.00036702296],"about_ca_topic_score_codex":0.000013772348,"about_ca_topic_score_gemma":0.000003675608,"teacher_disagreement_score":0.9772128,"about_ca_system_score_codex":0.00021049716,"about_ca_system_score_gemma":0.00008576299,"threshold_uncertainty_score":0.847252},"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":"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.21814232,0.0037169885,0.7733507,0.0016148534,0.00070841017,0.0006261294,0.000007259069,0.00015323539,0.0016801062],"genre_scores_gemma":[0.2161852,0.00006558687,0.7830274,0.00032842788,0.00022166074,0.000012049079,5.1457107e-7,0.000026569509,0.0001325606],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976645,0.00012994822,0.00052028237,0.0003441802,0.00080241455,0.0005386491],"domain_scores_gemma":[0.9980916,0.000084311825,0.00024522986,0.00082406483,0.0002453711,0.00050945417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362151,0.00020777324,0.00031161672,0.00032487584,0.00018956067,0.00024280105,0.002716275,0.000058465048,0.00007419412],"category_scores_gemma":[0.000099265824,0.00019485073,0.00012765847,0.0005729133,0.00007648044,0.001716838,0.00083498185,0.00036544583,0.00005024655],"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.00017680714,0.0035562543,0.00027425474,0.000030978834,0.00023389721,0.0006245044,0.013977603,0.0009753841,0.73064965,0.051187877,0.0015637567,0.19674903],"study_design_scores_gemma":[0.004718468,0.008973921,0.000293426,0.00039434212,0.00003098478,0.0032105267,0.0025151302,0.1918752,0.675935,0.10519209,0.0050673555,0.0017936159],"about_ca_topic_score_codex":0.000004014449,"about_ca_topic_score_gemma":3.8754015e-7,"teacher_disagreement_score":0.19495542,"about_ca_system_score_codex":0.00017676713,"about_ca_system_score_gemma":0.000034610755,"threshold_uncertainty_score":0.7945782},"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":"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.68146884,0.002646539,0.31481194,0.0002039314,0.00022296258,0.00010183145,0.0000014870081,0.000026803637,0.00051564304],"genre_scores_gemma":[0.6954819,0.00007503462,0.30424684,0.00010188169,0.00006955996,0.0000011846308,5.518529e-7,0.000009640866,0.000013407076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987394,0.000041370284,0.00028660515,0.00017316766,0.00045256,0.00030688968],"domain_scores_gemma":[0.9989657,0.00018856337,0.00018882356,0.00028859335,0.00013433986,0.00023398579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000573101,0.00012663267,0.00016844965,0.00023816878,0.00016699985,0.00009280671,0.0006948364,0.000037847953,0.0000049236123],"category_scores_gemma":[0.000030134504,0.00009660966,0.000046717447,0.00031790993,0.00016117557,0.00080903986,0.00015592223,0.00024127537,0.000002429983],"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.0010818369,0.0009666643,0.021083884,0.000019138492,0.000425875,0.0041713486,0.005973684,0.000044890145,0.13218258,0.7098251,0.0005383314,0.12368665],"study_design_scores_gemma":[0.0049618008,0.0048926407,0.010136817,0.00030117572,0.000024654712,0.0092000505,0.0036702703,0.0019146922,0.8055413,0.15651338,0.0019874272,0.0008558162],"about_ca_topic_score_codex":0.000005135993,"about_ca_topic_score_gemma":0.0000026220032,"teacher_disagreement_score":0.6733587,"about_ca_system_score_codex":0.000083411906,"about_ca_system_score_gemma":0.00003782572,"threshold_uncertainty_score":0.39396277},"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":"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.009824527,0.0003589927,0.98787504,0.00086842885,0.0005699006,0.00011085498,0.0000021132826,0.000055388075,0.00033472516],"genre_scores_gemma":[0.46109837,0.0000051025945,0.53863025,0.00011400896,0.00012983083,0.0000024166102,7.3923496e-7,0.000006738388,0.000012559103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989034,0.000042142266,0.00038594665,0.00016337754,0.00028755006,0.00021757316],"domain_scores_gemma":[0.9981833,0.00015076718,0.00064393616,0.0006991875,0.00020429525,0.00011850363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052786886,0.00012548114,0.0002457997,0.00010674219,0.00052381563,0.00047718588,0.002625963,0.000048317306,0.0000023241917],"category_scores_gemma":[0.00021923252,0.000112472786,0.00015073651,0.00004411058,0.00006628147,0.000526124,0.00024980374,0.0001749603,0.0000018981729],"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.0011802157,0.006611218,0.022008363,0.00016474989,0.0009567592,0.00034493205,0.017077822,0.09024719,0.2815409,0.042707928,0.06761763,0.4695423],"study_design_scores_gemma":[0.001307338,0.0008311906,0.00031539425,0.0000787841,0.0000070259402,0.000046927667,0.000096272954,0.5049585,0.4879531,0.0020745813,0.0020920176,0.00023884689],"about_ca_topic_score_codex":0.000007891732,"about_ca_topic_score_gemma":3.0681113e-7,"teacher_disagreement_score":0.46930346,"about_ca_system_score_codex":0.00006547713,"about_ca_system_score_gemma":0.00012260575,"threshold_uncertainty_score":0.4879736},"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":"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.31948245,0.008124673,0.6613468,0.0013892289,0.0073980303,0.0016578637,0.00013744058,0.00007381777,0.00038967203],"genre_scores_gemma":[0.4551549,0.00027310467,0.54187715,0.00077652634,0.001741661,0.00002387517,0.000015982816,0.000052852905,0.00008393866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974308,0.00011459193,0.0008551291,0.0005975099,0.00054159306,0.00046037213],"domain_scores_gemma":[0.99761814,0.0004002774,0.00076672673,0.000744553,0.0002410515,0.0002292293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006995637,0.0005085118,0.0007899384,0.0003975103,0.00017266734,0.00055102404,0.002476133,0.00026144378,0.000024671572],"category_scores_gemma":[0.000037543705,0.00043555239,0.0004121505,0.00012666539,0.000045836587,0.00051753956,0.002617867,0.00066362566,0.000010400668],"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.0026358378,0.006223291,0.0005598679,0.003614233,0.004602722,0.0014816462,0.04539084,0.012656161,0.097204894,0.14541383,0.017902039,0.66231465],"study_design_scores_gemma":[0.004327588,0.0038195448,0.00024373816,0.0012638604,0.00010984934,0.001338878,0.00048999663,0.9278987,0.030792564,0.019474413,0.008679879,0.0015609899],"about_ca_topic_score_codex":0.0000037055936,"about_ca_topic_score_gemma":2.153598e-7,"teacher_disagreement_score":0.91524255,"about_ca_system_score_codex":0.0001476182,"about_ca_system_score_gemma":0.00012696165,"threshold_uncertainty_score":0.9998096},"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":"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.5176576,0.0019215668,0.4758732,0.00061252125,0.002240995,0.0014757053,0.000106901294,0.000086902655,0.000024635556],"genre_scores_gemma":[0.47580063,0.000050621948,0.52346534,0.00014304424,0.00042754062,0.000031315587,0.000033019198,0.00004099649,0.000007521645],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962965,0.0002334824,0.0014786122,0.00062233896,0.0009858973,0.000383168],"domain_scores_gemma":[0.9965897,0.00010485472,0.0013383781,0.0010427958,0.0005025613,0.00042166974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005842896,0.0004439189,0.00089456956,0.00033571967,0.00014450795,0.00031071668,0.0037559564,0.00018461677,0.000015863936],"category_scores_gemma":[0.00006197872,0.00041945183,0.000345526,0.0002722769,0.00006387334,0.0007884157,0.0022897979,0.0007403769,0.0000016589769],"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.0013102812,0.09492735,0.00046143815,0.00044671333,0.0028095117,0.0007278059,0.19602713,0.12235082,0.5326239,0.004608989,0.0021231673,0.041582935],"study_design_scores_gemma":[0.007923472,0.02196558,0.000097825876,0.00032899043,0.000097964206,0.00018135138,0.03356558,0.6929302,0.23526017,0.0061784782,0.00026249184,0.0012078871],"about_ca_topic_score_codex":0.000056871828,"about_ca_topic_score_gemma":0.0000022371985,"teacher_disagreement_score":0.5705794,"about_ca_system_score_codex":0.00019260976,"about_ca_system_score_gemma":0.0003064585,"threshold_uncertainty_score":0.9998257},"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":"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.6050608,0.006509758,0.36518964,0.01878761,0.0031275405,0.00015024668,0.0000069286098,0.00014349994,0.0010239267],"genre_scores_gemma":[0.9405084,0.00004872456,0.055962224,0.0030507008,0.00039985587,7.18158e-7,4.7854127e-7,0.000008297455,0.00002057633],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990736,0.000033829183,0.0002929501,0.00013892988,0.0003068253,0.00015383484],"domain_scores_gemma":[0.9992681,0.00004597106,0.00017738521,0.00023672364,0.00007086202,0.00020093008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109753506,0.000105610874,0.00017100526,0.00004913264,0.00005858098,0.00010546816,0.0013312432,0.000029838477,0.000015004084],"category_scores_gemma":[0.000062309366,0.00009197225,0.00015267242,0.00014285583,0.00002603278,0.0005161344,0.00034776592,0.00019176699,0.000024584826],"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.00016884296,0.0005911581,0.00079079426,0.000014209966,0.000332133,0.0011854629,0.010144441,0.00038134377,0.8470303,0.0055667586,0.04644342,0.087351136],"study_design_scores_gemma":[0.00751607,0.0069657997,0.0008916528,0.00019201629,0.000074969656,0.002766005,0.0056166644,0.25617334,0.6797935,0.0021593755,0.03620158,0.0016490625],"about_ca_topic_score_codex":0.000006325468,"about_ca_topic_score_gemma":5.1928595e-8,"teacher_disagreement_score":0.33544758,"about_ca_system_score_codex":0.000044535103,"about_ca_system_score_gemma":0.000046829835,"threshold_uncertainty_score":0.37505198},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31340998,0.0021203668,0.6817876,0.0012039565,0.0011117382,0.00012578431,0.000010909193,0.00005721185,0.00017243327],"genre_scores_gemma":[0.64181226,0.000028429276,0.35740662,0.00025625032,0.00048146388,4.895115e-7,0.0000021703395,0.000009707846,0.0000026216273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983196,0.000076801945,0.00068465143,0.00021795093,0.0004829601,0.00021801345],"domain_scores_gemma":[0.9985933,0.00011784415,0.00060226466,0.00035392548,0.00012621858,0.0002064544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023127087,0.00016265771,0.0003542609,0.00006802341,0.000092056944,0.000074485855,0.0015245161,0.00006316991,0.000019589299],"category_scores_gemma":[0.000106815154,0.00013761272,0.00015246215,0.000256348,0.00006030006,0.000625869,0.0009680763,0.00024522984,0.000005316128],"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.0003296011,0.0016148419,0.0031079021,0.000088682704,0.00040395305,0.000874932,0.027283287,0.0015806808,0.5773704,0.027565725,0.009981917,0.34979808],"study_design_scores_gemma":[0.002154444,0.0019059333,0.0012397101,0.0001813956,0.000021923188,0.00029621428,0.0010493054,0.45620555,0.53149956,0.0014028082,0.0035925484,0.00045062328],"about_ca_topic_score_codex":0.000012099439,"about_ca_topic_score_gemma":7.2306044e-8,"teacher_disagreement_score":0.45462486,"about_ca_system_score_codex":0.000040568008,"about_ca_system_score_gemma":0.000074928306,"threshold_uncertainty_score":0.5611684},"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":"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.9865098,0.003517743,0.006700801,0.0013686751,0.0016300565,0.000086269945,0.000013653775,0.000037276273,0.00013569597],"genre_scores_gemma":[0.9804183,0.000103596016,0.018358104,0.00075799966,0.00017415885,0.000006755852,0.0000026574032,0.000014729061,0.00016365966],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986476,0.00010566653,0.00033323685,0.00022530941,0.0004526123,0.00023563197],"domain_scores_gemma":[0.9990984,0.00007712545,0.0002334741,0.0003873536,0.000049672188,0.00015395836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029243357,0.00015971494,0.00021100604,0.00017723444,0.00029486037,0.00014571844,0.0012469927,0.000026823222,0.00004296052],"category_scores_gemma":[0.000018608087,0.00015047447,0.00014509006,0.00016742673,0.00005402106,0.00055772596,0.0013894094,0.00034869157,0.000003588427],"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.00074912916,0.0033073144,0.005507483,0.000032235424,0.0009431161,0.004416508,0.03135002,0.0025858565,0.7742088,0.0029490474,0.043992396,0.12995812],"study_design_scores_gemma":[0.028741432,0.03447235,0.014793586,0.0005572205,0.00030313365,0.04044627,0.1059992,0.55035686,0.16036792,0.0047132885,0.053044245,0.0062044673],"about_ca_topic_score_codex":0.00003779885,"about_ca_topic_score_gemma":4.562863e-7,"teacher_disagreement_score":0.6138408,"about_ca_system_score_codex":0.00012719422,"about_ca_system_score_gemma":0.00005592462,"threshold_uncertainty_score":0.61361706},"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":"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.02227017,0.005000314,0.9666252,0.0009440733,0.003911454,0.00031684406,0.0000075609755,0.000118763484,0.0008055995],"genre_scores_gemma":[0.39442322,0.000024793897,0.60449827,0.0006367742,0.00026612094,0.000028518982,0.00000841636,0.000028360811,0.00008555212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969241,0.0005381871,0.00090259395,0.00031690608,0.0009188241,0.00039937187],"domain_scores_gemma":[0.9978229,0.00041886786,0.00088916253,0.0005715509,0.00015733611,0.00014020488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015901094,0.00025906874,0.0006962347,0.00021523834,0.00045420486,0.00013938882,0.002305624,0.000057385503,0.000041251493],"category_scores_gemma":[0.00023481878,0.00024040631,0.00031355035,0.0005592547,0.0001066265,0.0009888208,0.001143543,0.0006429178,0.000007917136],"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.030048165,0.007958715,0.0015013647,0.000072190196,0.0035618525,0.015982589,0.118441336,0.5109979,0.13035062,0.047968846,0.061424542,0.07169187],"study_design_scores_gemma":[0.17458804,0.002494623,0.000120673074,0.00015861868,0.0001419455,0.012776393,0.006715474,0.6940102,0.086855784,0.016163407,0.0044951197,0.0014797398],"about_ca_topic_score_codex":0.000023228384,"about_ca_topic_score_gemma":1.1045281e-8,"teacher_disagreement_score":0.37215304,"about_ca_system_score_codex":0.00033100913,"about_ca_system_score_gemma":0.00012394892,"threshold_uncertainty_score":0.98034847},"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":"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.9556123,0.0006490466,0.04137502,0.0009244258,0.0010107914,0.00028808176,0.00002345308,0.000044924738,0.00007195612],"genre_scores_gemma":[0.8590944,0.00011642699,0.14024934,0.00016633904,0.00024420157,0.000031956482,0.000020845806,0.000018187386,0.000058333786],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816084,0.000046279005,0.0006700433,0.00026241713,0.00059909566,0.0002613099],"domain_scores_gemma":[0.998159,0.0007783017,0.00031346915,0.0002520038,0.00027318942,0.00022404891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016610803,0.00013885772,0.00029587327,0.0007289487,0.0003178807,0.00018440068,0.0004287415,0.000075383374,0.00002813259],"category_scores_gemma":[0.0008465176,0.000118127144,0.000118642856,0.0010465912,0.0000810097,0.0002573864,0.00014771496,0.0001125958,0.000020752015],"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.0027913274,0.0011163898,0.004097091,0.000038217117,0.0006083968,0.00012207325,0.022143818,0.37975618,0.5022487,0.0071744868,0.041840266,0.038063034],"study_design_scores_gemma":[0.013260954,0.0076004798,0.0077858777,0.00032853906,0.00035132933,0.0005486027,0.06585818,0.4566504,0.36227414,0.06073105,0.022489356,0.0021210827],"about_ca_topic_score_codex":0.000009490159,"about_ca_topic_score_gemma":0.0000012464529,"teacher_disagreement_score":0.13997456,"about_ca_system_score_codex":0.0000432359,"about_ca_system_score_gemma":0.000049762584,"threshold_uncertainty_score":0.48170853},"labels":[],"label_agreement":null}]}