{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":23,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":23,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d2150b147155","filters":{"venue":"ACM Journal of Experimental Algorithmics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02788303691864616,"gpt":0.3083020289660293,"spread":0.2804189920473832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475197,0.0001373649,0.0001886724,0.0001337478,0.00005650009,0.00008637566,0.001767455,0.00005266305,0.00002395898],"category_scores_gemma":[0.0000956285,0.0001178886,0.00009713603,0.0001777498,0.00004531553,0.001825046,0.0007353874,0.0001750977,0.00002141087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001224859,"about_ca_system_score_gemma":0.00004923008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001004742,"about_ca_topic_score_gemma":7.775659e-8,"domain_scores_codex":[0.9987592,0.00004236103,0.0003575585,0.000111665,0.0003605142,0.0003686972],"domain_scores_gemma":[0.9986714,0.00007244753,0.0002875946,0.0006366975,0.00007916179,0.0002527418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007460069,0.004403681,0.03103404,0.00001573638,0.0003947454,0.0003081261,0.01192599,0.000005435208,0.2136094,0.07450914,0.09041564,0.5733034],"study_design_scores_gemma":[0.0007544169,0.0008913094,0.002532327,0.00005782641,0.00001676105,0.00168089,0.0007087431,0.0006172594,0.9634644,0.002509906,0.02635401,0.0004120979],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5332254,0.01280798,0.4422491,0.000838172,0.004561166,0.0002444987,0.00002332772,0.000383401,0.005666959],"genre_scores_gemma":[0.4857931,0.0000498434,0.5137334,0.00011274,0.0002866804,0.000001486826,0.000001203057,0.000008073275,0.00001352718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.749855,"threshold_uncertainty_score":0.4807359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03599654909467832,"gpt":0.2578440371868842,"spread":0.2218474880922059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001097535,0.0001056109,0.0001710053,0.00004913264,0.00005858098,0.0001054682,0.001331243,0.00002983848,0.00001500408],"category_scores_gemma":[0.00006230937,0.00009197225,0.0001526724,0.0001428558,0.00002603278,0.0005161344,0.0003477659,0.000191767,0.00002458483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000445351,"about_ca_system_score_gemma":0.00004682983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006325468,"about_ca_topic_score_gemma":5.192859e-8,"domain_scores_codex":[0.9990736,0.00003382918,0.0002929501,0.0001389299,0.0003068253,0.0001538348],"domain_scores_gemma":[0.9992681,0.00004597106,0.0001773852,0.0002367236,0.00007086202,0.0002009301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000168843,0.0005911581,0.0007907943,0.00001420997,0.000332133,0.001185463,0.01014444,0.0003813438,0.8470303,0.005566759,0.04644342,0.08735114],"study_design_scores_gemma":[0.00751607,0.0069658,0.0008916528,0.0001920163,0.00007496966,0.002766005,0.005616664,0.2561733,0.6797935,0.002159375,0.03620158,0.001649062],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6050608,0.006509758,0.3651896,0.01878761,0.00312754,0.0001502467,0.00000692861,0.0001434999,0.001023927],"genre_scores_gemma":[0.9405084,0.00004872456,0.05596222,0.003050701,0.0003998559,7.18158e-7,4.785413e-7,0.000008297455,0.00002057633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3354476,"threshold_uncertainty_score":0.375052,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0479229736013965,"gpt":0.3482190534161552,"spread":0.3002960798147586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005934482,0.0002289705,0.0003490046,0.0002832782,0.0001809697,0.0001596583,0.001497826,0.00009560204,0.000009229614],"category_scores_gemma":[0.00004718012,0.0002039671,0.0001840311,0.0002554845,0.00008171205,0.002437826,0.0002292361,0.0002368364,0.000001535251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001777017,"about_ca_system_score_gemma":0.0001116959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002264675,"about_ca_topic_score_gemma":2.84744e-7,"domain_scores_codex":[0.9979779,0.0001103829,0.0007407944,0.000319912,0.0005577921,0.0002932422],"domain_scores_gemma":[0.9981913,0.00009728653,0.0006138174,0.0005900039,0.0002581553,0.0002494203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001329763,0.000499768,0.00007853331,0.000007240461,0.00003895554,0.00001812667,0.006040193,0.0001864432,0.9254264,0.001987977,0.0007378199,0.06484553],"study_design_scores_gemma":[0.001419881,0.004399514,0.00051291,0.00009515913,0.00001024052,0.0002683123,0.002258458,0.1190323,0.8681633,0.003411104,0.0001780025,0.0002508991],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4877282,0.0008274399,0.5100704,0.0001957608,0.0008624661,0.000228811,0.00001811646,0.00003683225,0.00003188791],"genre_scores_gemma":[0.6340944,0.00001392213,0.3654032,0.000141324,0.0003099772,0.00000425593,0.00001708303,0.00001117765,0.000004732221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1463661,"threshold_uncertainty_score":0.8317535,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1340056843624997,"gpt":0.413582351479498,"spread":0.2795766671169983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00174782,0.0001371624,0.0003438618,0.0001442499,0.0002630147,0.0001337695,0.001298757,0.00006768869,0.00133597],"category_scores_gemma":[0.004250277,0.00008328106,0.0003038287,0.0006254622,0.0003920424,0.0003460716,0.0001453283,0.0002874399,0.0001147377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004581106,"about_ca_system_score_gemma":0.00002811022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001186679,"about_ca_topic_score_gemma":3.985342e-7,"domain_scores_codex":[0.9970111,0.0001873708,0.001004065,0.000165842,0.001362134,0.0002694821],"domain_scores_gemma":[0.9963346,0.002225778,0.0004581945,0.0005025909,0.0003313383,0.0001475592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002119519,0.01124026,0.02212589,0.00004419635,0.001422293,0.0003111063,0.04645779,0.001173753,0.2709345,0.0436167,0.5419368,0.0605248],"study_design_scores_gemma":[0.006978481,0.002661371,0.003521365,0.0005623965,0.0006837907,0.006694676,0.06967038,0.1316397,0.5064684,0.2490802,0.02016729,0.00187195],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9765429,0.007357345,0.007818229,0.004043338,0.001703772,0.0001047027,0.0000317408,0.00001694237,0.002381024],"genre_scores_gemma":[0.9716482,0.00005212042,0.02779034,0.0001552009,0.0001322447,0.000001738722,4.811052e-7,0.00001163699,0.0002081034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5217695,"threshold_uncertainty_score":0.9995769,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05509203364200714,"gpt":0.3722407228452136,"spread":0.3171486892032064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005278689,0.0001254811,0.0002457997,0.0001067422,0.0005238156,0.0004771859,0.002625963,0.00004831731,0.000002324192],"category_scores_gemma":[0.0002192325,0.0001124728,0.0001507365,0.00004411058,0.00006628147,0.000526124,0.0002498037,0.0001749603,0.000001898173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006547713,"about_ca_system_score_gemma":0.0001226058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007891732,"about_ca_topic_score_gemma":3.068111e-7,"domain_scores_codex":[0.9989034,0.00004214227,0.0003859467,0.0001633775,0.0002875501,0.0002175732],"domain_scores_gemma":[0.9981833,0.0001507672,0.0006439362,0.0006991875,0.0002042953,0.0001185036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001180216,0.006611218,0.02200836,0.0001647499,0.0009567592,0.0003449321,0.01707782,0.09024719,0.2815409,0.04270793,0.06761763,0.4695423],"study_design_scores_gemma":[0.001307338,0.0008311906,0.0003153943,0.0000787841,0.00000702594,0.00004692767,0.00009627295,0.5049585,0.4879531,0.002074581,0.002092018,0.0002388469],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009824527,0.0003589927,0.987875,0.0008684288,0.0005699006,0.000110855,0.000002113283,0.00005538807,0.0003347252],"genre_scores_gemma":[0.4610984,0.000005102595,0.5386302,0.000114009,0.0001298308,0.00000241661,7.39235e-7,0.000006738388,0.0000125591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4693035,"threshold_uncertainty_score":0.4879736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02087264857275021,"gpt":0.2426543320571644,"spread":0.2217816834844142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924336,0.0001597149,0.000211006,0.0001772344,0.0002948604,0.0001457184,0.001246993,0.00002682322,0.00004296052],"category_scores_gemma":[0.00001860809,0.0001504745,0.0001450901,0.0001674267,0.00005402106,0.000557726,0.001389409,0.0003486916,0.000003588427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271942,"about_ca_system_score_gemma":0.00005592462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003779885,"about_ca_topic_score_gemma":4.562863e-7,"domain_scores_codex":[0.9986476,0.0001056665,0.0003332369,0.0002253094,0.0004526123,0.000235632],"domain_scores_gemma":[0.9990984,0.00007712545,0.0002334741,0.0003873536,0.00004967219,0.0001539584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007491292,0.003307314,0.005507483,0.00003223542,0.0009431161,0.004416508,0.03135002,0.002585856,0.7742088,0.002949047,0.0439924,0.1299581],"study_design_scores_gemma":[0.02874143,0.03447235,0.01479359,0.0005572205,0.0003031337,0.04044627,0.1059992,0.5503569,0.1603679,0.004713289,0.05304424,0.006204467],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865098,0.003517743,0.006700801,0.001368675,0.001630057,0.00008626995,0.00001365377,0.00003727627,0.000135696],"genre_scores_gemma":[0.9804183,0.000103596,0.0183581,0.0007579997,0.0001741588,0.000006755852,0.000002657403,0.00001472906,0.0001636597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6138408,"threshold_uncertainty_score":0.6136171,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02280547117846976,"gpt":0.2986947756010033,"spread":0.2758893044225336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003350952,0.0001678309,0.0003010732,0.0005508288,0.00009291004,0.00007356251,0.001117138,0.00004404226,0.00001299776],"category_scores_gemma":[0.00005820521,0.0001541072,0.000131484,0.001054086,0.00002578634,0.0007575914,0.000196133,0.00015016,0.000003458138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046041,"about_ca_system_score_gemma":0.00007711714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006704953,"about_ca_topic_score_gemma":1.272803e-7,"domain_scores_codex":[0.9981413,0.00007558784,0.0006654735,0.000209654,0.0007147624,0.0001932591],"domain_scores_gemma":[0.9986953,0.00008328528,0.0004830402,0.0003714073,0.0002319044,0.0001351161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002956247,0.02846977,0.0006486537,0.000007481514,0.0003362859,0.0003446727,0.0152178,0.01303243,0.8089104,0.005298308,0.004203746,0.1232348],"study_design_scores_gemma":[0.003280279,0.01322172,0.002530973,0.00002119632,0.00001969621,0.0004115558,0.004499245,0.006366242,0.9682449,0.0006878942,0.0003988557,0.0003174545],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9278464,0.002940061,0.06788984,0.0001531439,0.000793464,0.0001636385,0.000001060124,0.00001872798,0.0001937069],"genre_scores_gemma":[0.9343886,0.0000155691,0.06517676,0.0001799324,0.0002074323,0.000001872568,0.000001357244,0.000006123753,0.00002229763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1593345,"threshold_uncertainty_score":0.6284311,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03450389665994346,"gpt":0.314868580395484,"spread":0.2803646837355405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127711,0.0002337324,0.0003473543,0.0002024561,0.0002246038,0.0001898526,0.001946336,0.00008356573,0.00002946078],"category_scores_gemma":[0.0001139817,0.0001924393,0.000298367,0.0002970816,0.00004699361,0.002292636,0.0009227074,0.0002195806,0.00001358711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007856018,"about_ca_system_score_gemma":0.00003169371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003001282,"about_ca_topic_score_gemma":1.20687e-7,"domain_scores_codex":[0.997872,0.00005703456,0.0006507873,0.0002338217,0.0004561327,0.0007302086],"domain_scores_gemma":[0.9984439,0.000145533,0.0004877026,0.0005085196,0.0001354379,0.0002789093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004460654,0.003212969,0.001779008,0.0000212364,0.0004310486,0.0001293354,0.002543331,0.000004103222,0.006359081,0.256371,0.01196912,0.7171352],"study_design_scores_gemma":[0.02291043,0.008528268,0.004100084,0.0003039262,0.0003979637,0.003646771,0.01449161,0.3109314,0.2835861,0.1146193,0.2317144,0.004769762],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01087821,0.003062951,0.9823629,0.0003906314,0.00263949,0.000240236,0.00002067625,0.00006275476,0.0003421321],"genre_scores_gemma":[0.1460983,0.00007614627,0.8521805,0.0005480892,0.0009631755,0.00001597551,0.00001009255,0.00001932893,0.00008842866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7123654,"threshold_uncertainty_score":0.7847447,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Heuristic; Matching (statistics); Mathematical optimization; Travelling salesman problem; Duality (order theory); Combinatorics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05586580032839563,"gpt":0.3173452730164984,"spread":0.2614794726881028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362151,0.0002077732,0.0003116167,0.0003248758,0.0001895607,0.000242801,0.002716275,0.00005846505,0.00007419412],"category_scores_gemma":[0.00009926582,0.0001948507,0.0001276585,0.0005729133,0.00007648044,0.001716838,0.0008349819,0.0003654458,0.00005024655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001767671,"about_ca_system_score_gemma":0.00003461076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004014449,"about_ca_topic_score_gemma":3.875402e-7,"domain_scores_codex":[0.9976645,0.0001299482,0.0005202824,0.0003441802,0.0008024145,0.0005386491],"domain_scores_gemma":[0.9980916,0.00008431183,0.0002452299,0.0008240648,0.0002453711,0.0005094542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001768071,0.003556254,0.0002742547,0.00003097883,0.0002338972,0.0006245044,0.0139776,0.0009753841,0.7306497,0.05118788,0.001563757,0.196749],"study_design_scores_gemma":[0.004718468,0.008973921,0.000293426,0.0003943421,0.00003098478,0.003210527,0.00251513,0.1918752,0.675935,0.1051921,0.005067355,0.001793616],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2181423,0.003716988,0.7733507,0.001614853,0.0007084102,0.0006261294,0.000007259069,0.0001532354,0.001680106],"genre_scores_gemma":[0.2161852,0.00006558687,0.7830274,0.0003284279,0.0002216607,0.00001204908,5.145711e-7,0.00002656951,0.0001325606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1949554,"threshold_uncertainty_score":0.7945782,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01649643846463986,"gpt":0.2993828352694884,"spread":0.2828863968048486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000573101,0.0001266327,0.0001684497,0.0002381688,0.0001669998,0.00009280671,0.0006948364,0.00003784795,0.000004923612],"category_scores_gemma":[0.0000301345,0.00009660966,0.00004671745,0.0003179099,0.0001611756,0.0008090399,0.0001559222,0.0002412754,0.000002429983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008341191,"about_ca_system_score_gemma":0.00003782572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005135993,"about_ca_topic_score_gemma":0.000002622003,"domain_scores_codex":[0.9987394,0.00004137028,0.0002866052,0.0001731677,0.00045256,0.0003068897],"domain_scores_gemma":[0.9989657,0.0001885634,0.0001888236,0.0002885933,0.0001343399,0.0002339858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001081837,0.0009666643,0.02108388,0.00001913849,0.000425875,0.004171349,0.005973684,0.00004489014,0.1321826,0.7098251,0.0005383314,0.1236866],"study_design_scores_gemma":[0.004961801,0.004892641,0.01013682,0.0003011757,0.00002465471,0.00920005,0.00367027,0.001914692,0.8055413,0.1565134,0.001987427,0.0008558162],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6814688,0.002646539,0.3148119,0.0002039314,0.0002229626,0.0001018315,0.000001487008,0.00002680364,0.000515643],"genre_scores_gemma":[0.6954819,0.00007503462,0.3042468,0.0001018817,0.00006955996,0.000001184631,5.518529e-7,0.000009640866,0.00001340708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6733587,"threshold_uncertainty_score":0.3939628,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09430588576968296,"gpt":0.3590821632634274,"spread":0.2647762774937444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001429161,0.0001870657,0.0003603626,0.0002104194,0.0001115955,0.00008612265,0.005891575,0.00005824001,0.000001890002],"category_scores_gemma":[0.0001095821,0.0001583328,0.00003951974,0.0002845821,0.00004402603,0.002481052,0.003741104,0.0002255309,3.278349e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001564072,"about_ca_system_score_gemma":0.0002427736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002475737,"about_ca_topic_score_gemma":0.0000140825,"domain_scores_codex":[0.9978197,0.0000528893,0.000875548,0.0004696088,0.0005169287,0.0002653463],"domain_scores_gemma":[0.9965202,0.00008823869,0.0006580572,0.002519037,0.0001299269,0.00008459971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006762268,0.01424088,0.009961681,0.0002438659,0.0001721041,0.0002597971,0.004535853,0.001811886,0.08062167,0.0003309119,0.0005177758,0.8866273],"study_design_scores_gemma":[0.00866645,0.00553907,0.0015897,0.0005232912,0.00004680768,0.0001003774,0.003485164,0.8253739,0.1533591,0.0002399771,0.0005037258,0.0005724131],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4727789,0.0004205275,0.5258482,0.00008735742,0.0002652678,0.0004425494,0.0001236293,0.00002499684,0.000008612287],"genre_scores_gemma":[0.5630347,0.00001109707,0.4367829,0.00003541403,0.00007591704,0.000005844739,0.00004466973,0.000008845444,6.235019e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8860549,"threshold_uncertainty_score":0.999487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07553904577710992,"gpt":0.317989338474552,"spread":0.2424502926974421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002851822,0.0001274332,0.000145784,0.00005035854,0.0001196016,0.00005218801,0.0004090963,0.00007664337,0.000006035027],"category_scores_gemma":[0.0000567547,0.000119234,0.00005548524,0.00003863931,0.0000540104,0.00004457885,0.0003310869,0.00006850328,4.028563e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002854493,"about_ca_system_score_gemma":0.00005695911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001150326,"about_ca_topic_score_gemma":0.00000152084,"domain_scores_codex":[0.9991711,0.00001809365,0.000334646,0.000192535,0.0001052143,0.0001784088],"domain_scores_gemma":[0.9992601,0.00001224506,0.0002543673,0.0002891311,0.000112666,0.00007154881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003356037,0.0003902412,0.001695572,0.00005986416,0.0004141894,0.00001324292,0.004278029,0.00001014518,0.914291,0.0004820932,0.000398678,0.0776313],"study_design_scores_gemma":[0.002700724,0.001877545,0.001049511,0.0000779955,0.0001424351,0.001334494,0.01566913,0.003922041,0.9663343,0.0009339089,0.005416381,0.0005415315],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9398091,0.003474433,0.05580782,0.00004434119,0.0005201546,0.0002283841,0.00005089445,0.000006382388,0.00005849478],"genre_scores_gemma":[0.7418204,0.0001504335,0.2575729,0.00002603052,0.0002643364,0.000005339572,0.00009868785,0.00001838815,0.00004348545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2017651,"threshold_uncertainty_score":0.4862221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04409935035977574,"gpt":0.2762889576835892,"spread":0.2321896073238134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261036,0.0002706069,0.000317442,0.0001875986,0.000371685,0.0002139821,0.003387294,0.00007413769,0.000002890218],"category_scores_gemma":[0.00001792335,0.0001798309,0.0002017599,0.0003975285,0.00006300141,0.001114813,0.001430006,0.0004791737,0.00001277368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001111675,"about_ca_system_score_gemma":0.00008256482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000298656,"about_ca_topic_score_gemma":4.773954e-7,"domain_scores_codex":[0.9976785,0.00006630614,0.0006261578,0.000355868,0.0008179328,0.0004552845],"domain_scores_gemma":[0.9982752,0.00006989576,0.0003503752,0.0008921089,0.0001228867,0.0002895296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006811259,0.01088069,0.002323747,0.0001202962,0.002487837,0.003986133,0.1818836,0.07783013,0.3361888,0.06028068,0.1320465,0.1912905],"study_design_scores_gemma":[0.01475848,0.005646412,0.005122724,0.001201437,0.0002241466,0.03634652,0.01519343,0.4029352,0.3516121,0.03232943,0.1281274,0.006502755],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.291038,0.003535003,0.7008393,0.00125509,0.00109342,0.0004571293,0.000009218993,0.000090024,0.001682815],"genre_scores_gemma":[0.4225859,0.0002388486,0.575327,0.001361649,0.0004133609,0.00001346654,0.000005609704,0.00002421639,0.00002993174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3251051,"threshold_uncertainty_score":0.7333291,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03544455592503067,"gpt":0.2810990042413903,"spread":0.2456544483163596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002312709,0.0001626577,0.0003542609,0.00006802341,0.00009205694,0.00007448586,0.001524516,0.00006316991,0.0000195893],"category_scores_gemma":[0.0001068152,0.0001376127,0.0001524621,0.000256348,0.00006030006,0.000625869,0.0009680763,0.0002452298,0.000005316128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004056801,"about_ca_system_score_gemma":0.00007492831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001209944,"about_ca_topic_score_gemma":7.230604e-8,"domain_scores_codex":[0.9983196,0.00007680195,0.0006846514,0.0002179509,0.0004829601,0.0002180134],"domain_scores_gemma":[0.9985933,0.0001178442,0.0006022647,0.0003539255,0.0001262186,0.0002064544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003296011,0.001614842,0.003107902,0.0000886827,0.000403953,0.000874932,0.02728329,0.001580681,0.5773704,0.02756573,0.009981917,0.3497981],"study_design_scores_gemma":[0.002154444,0.001905933,0.00123971,0.0001813956,0.00002192319,0.0002962143,0.001049305,0.4562055,0.5314996,0.001402808,0.003592548,0.0004506233],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.31341,0.002120367,0.6817876,0.001203957,0.001111738,0.0001257843,0.00001090919,0.00005721185,0.0001724333],"genre_scores_gemma":[0.6418123,0.00002842928,0.3574066,0.0002562503,0.0004814639,4.895115e-7,0.000002170339,0.000009707846,0.000002621627],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4546249,"threshold_uncertainty_score":0.5611684,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04379081623079347,"gpt":0.2955807081901236,"spread":0.2517898919593301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385426,0.0002739959,0.000323134,0.0001737723,0.0007114047,0.0004479111,0.002379392,0.00006215118,0.000024697],"category_scores_gemma":[0.00008393161,0.0002077677,0.0003280064,0.0004312352,0.0001039303,0.001356789,0.0007683491,0.0003025233,0.000005979137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002104972,"about_ca_system_score_gemma":0.00008576299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001377235,"about_ca_topic_score_gemma":0.000003675608,"domain_scores_codex":[0.9974276,0.00006756312,0.0008958103,0.0003224308,0.0006211237,0.0006655104],"domain_scores_gemma":[0.9977416,0.0004571208,0.0006639545,0.0006712321,0.0003215045,0.0001445528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002823077,0.0005190093,0.00002238948,0.00001430685,0.0001489545,0.000005197658,0.002427151,0.002273066,0.007960066,0.007354893,0.001666949,0.9775798],"study_design_scores_gemma":[0.001653595,0.0005705261,0.00002546304,0.00005703124,0.00003992961,0.0004387604,0.001014506,0.8047073,0.08219694,0.007336135,0.1015927,0.000367023],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002340288,0.003004139,0.9908985,0.002303532,0.0006947176,0.00046149,0.0000101629,0.00006612655,0.0002209695],"genre_scores_gemma":[0.0323243,0.00005470392,0.9657568,0.0004167575,0.001252635,0.00003882059,0.000005834788,0.00002840089,0.000121734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9772128,"threshold_uncertainty_score":0.847252,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.036574168632612,"gpt":0.3145395867388859,"spread":0.277965418106274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004203898,0.0002415404,0.0003400065,0.0001998137,0.0003444538,0.0002906618,0.002373994,0.00008682986,0.00003932831],"category_scores_gemma":[0.0001010428,0.0002068479,0.0001341235,0.0003416728,0.00004347191,0.002680471,0.002206212,0.0003956961,0.000007456236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001944481,"about_ca_system_score_gemma":0.0001089441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003705069,"about_ca_topic_score_gemma":7.883768e-7,"domain_scores_codex":[0.997721,0.00008072593,0.000806548,0.000298146,0.0006846678,0.0004089259],"domain_scores_gemma":[0.9979846,0.0001060059,0.0007203639,0.0007127649,0.0002488865,0.0002274177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006454159,0.0008071191,0.0008738877,0.00002008595,0.0001212874,0.0002344067,0.003016004,0.0248909,0.612106,0.001793631,0.001471157,0.354601],"study_design_scores_gemma":[0.001117245,0.0001937675,0.0001476461,0.0002831098,0.00001240399,0.0006740636,0.0007342875,0.7814437,0.2125351,0.0005101109,0.002002136,0.0003465005],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2729835,0.002985867,0.7225316,0.000257077,0.0008853048,0.00009533354,0.000003379924,0.00005470368,0.0002032353],"genre_scores_gemma":[0.3600139,0.00004684381,0.6391006,0.0001170204,0.0006855823,8.526449e-7,0.000001793018,0.0000174486,0.00001605341],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7565528,"threshold_uncertainty_score":0.8435013,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1174703531014551,"gpt":0.3966672885918802,"spread":0.2791969354904251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166108,0.0001388577,0.0002958733,0.0007289487,0.0003178807,0.0001844007,0.0004287415,0.00007538337,0.00002813259],"category_scores_gemma":[0.0008465176,0.0001181271,0.0001186429,0.001046591,0.0000810097,0.0002573864,0.000147715,0.0001125958,0.00002075202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000432359,"about_ca_system_score_gemma":0.00004976258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009490159,"about_ca_topic_score_gemma":0.000001246453,"domain_scores_codex":[0.9981608,0.000046279,0.0006700433,0.0002624171,0.0005990957,0.0002613099],"domain_scores_gemma":[0.998159,0.0007783017,0.0003134692,0.0002520038,0.0002731894,0.0002240489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002791327,0.00111639,0.004097091,0.00003821712,0.0006083968,0.0001220733,0.02214382,0.3797562,0.5022487,0.007174487,0.04184027,0.03806303],"study_design_scores_gemma":[0.01326095,0.00760048,0.007785878,0.0003285391,0.0003513293,0.0005486027,0.06585818,0.4566504,0.3622741,0.06073105,0.02248936,0.002121083],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9556123,0.0006490466,0.04137502,0.0009244258,0.001010791,0.0002880818,0.00002345308,0.00004492474,0.00007195612],"genre_scores_gemma":[0.8590944,0.000116427,0.1402493,0.000166339,0.0002442016,0.00003195648,0.00002084581,0.00001818739,0.00005833379],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1399746,"threshold_uncertainty_score":0.4817085,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006637733434060977,"gpt":0.2543754159048994,"spread":0.2477376824708384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070049,0.0001660226,0.0002555478,0.0001404556,0.0002025244,0.0002122117,0.0006365789,0.00008829144,0.00000650237],"category_scores_gemma":[0.0002677103,0.0001489491,0.00007688763,0.0003419166,0.00004445965,0.0009752241,0.0002592683,0.000230565,0.00000179503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000209392,"about_ca_system_score_gemma":0.00007897826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004056389,"about_ca_topic_score_gemma":0.000002412308,"domain_scores_codex":[0.9985393,0.00004499023,0.0006477282,0.0002085503,0.0003001045,0.0002593184],"domain_scores_gemma":[0.9987229,0.00008523106,0.0005066411,0.0002406307,0.0002328724,0.0002117269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001039101,0.0002243608,0.0007934449,0.00005094161,0.0002391058,0.0005054563,0.009834633,0.0002137819,0.6008888,0.03603859,0.0007501983,0.3503568],"study_design_scores_gemma":[0.003483624,0.001973933,0.00046474,0.00081852,0.00003567096,0.002924174,0.01958573,0.1758645,0.7748091,0.01720653,0.001753568,0.001079932],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09138642,0.00133262,0.905966,0.0001348002,0.0009171384,0.00007716374,0.000001616657,0.00002876775,0.0001554866],"genre_scores_gemma":[0.7239709,0.00002205228,0.2757639,0.0001031654,0.0001138425,8.891151e-7,0.000001878566,0.000009890796,0.00001344872],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6325845,"threshold_uncertainty_score":0.607397,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0256782719106334,"gpt":0.3086487864999469,"spread":0.2829705145893135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006685298,0.00009731085,0.0002007629,0.0002201937,0.00004423528,0.00003224579,0.0004070386,0.00003933438,0.000004282541],"category_scores_gemma":[0.0001349824,0.00009438291,0.00008334723,0.0001299969,0.0000135791,0.0003271112,0.00008430778,0.00009829125,3.118522e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008837229,"about_ca_system_score_gemma":0.00006915307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006361345,"about_ca_topic_score_gemma":0.000001642207,"domain_scores_codex":[0.9988172,0.00001658654,0.0006209272,0.0001161243,0.0002570541,0.0001721232],"domain_scores_gemma":[0.9989228,0.0003093677,0.0004085032,0.0001516748,0.0001345713,0.00007303482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006722677,0.002404531,0.004272759,0.0001539117,0.000276908,0.0008242432,0.01104133,0.08614432,0.4337246,0.01249851,0.001473625,0.446513],"study_design_scores_gemma":[0.001215715,0.0005405558,0.002771098,0.00006702021,0.000005773531,0.0002681288,0.0003457966,0.1847608,0.8072256,0.002526971,0.0001285883,0.0001438836],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.316634,0.0002124512,0.6824175,0.00004756698,0.0005678202,0.00007676713,0.000001974457,0.00000466805,0.00003723143],"genre_scores_gemma":[0.5364741,0.000002410858,0.4633861,0.0000295943,0.00009679605,7.47648e-7,0.00000234599,0.000003492125,0.000004367366],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4463691,"threshold_uncertainty_score":0.3848823,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09766027536202379,"gpt":0.3921035343862945,"spread":0.2944432590242707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005842896,0.0004439189,0.0008945696,0.0003357197,0.000144508,0.0003107167,0.003755956,0.0001846168,0.00001586394],"category_scores_gemma":[0.00006197872,0.0004194518,0.000345526,0.0002722769,0.00006387334,0.0007884157,0.002289798,0.0007403769,0.000001658977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001926098,"about_ca_system_score_gemma":0.0003064585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005687183,"about_ca_topic_score_gemma":0.000002237198,"domain_scores_codex":[0.9962965,0.0002334824,0.001478612,0.000622339,0.0009858973,0.000383168],"domain_scores_gemma":[0.9965897,0.0001048547,0.001338378,0.001042796,0.0005025613,0.0004216697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001310281,0.09492735,0.0004614381,0.0004467133,0.002809512,0.0007278059,0.1960271,0.1223508,0.5326239,0.004608989,0.002123167,0.04158293],"study_design_scores_gemma":[0.007923472,0.02196558,0.00009782588,0.0003289904,0.00009796421,0.0001813514,0.03356558,0.6929302,0.2352602,0.006178478,0.0002624918,0.001207887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5176576,0.001921567,0.4758732,0.0006125213,0.002240995,0.001475705,0.0001069013,0.00008690266,0.00002463556],"genre_scores_gemma":[0.4758006,0.00005062195,0.5234653,0.0001430442,0.0004275406,0.00003131559,0.0000330192,0.00004099649,0.000007521645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5705794,"threshold_uncertainty_score":0.9998257,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02827921308986038,"gpt":0.2957232502654412,"spread":0.2674440371755809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590109,0.0002590687,0.0006962347,0.0002152383,0.0004542049,0.0001393888,0.002305624,0.0000573855,0.00004125149],"category_scores_gemma":[0.0002348188,0.0002404063,0.0003135504,0.0005592547,0.0001066265,0.0009888208,0.001143543,0.0006429178,0.000007917136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003310091,"about_ca_system_score_gemma":0.0001239489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002322838,"about_ca_topic_score_gemma":1.104528e-8,"domain_scores_codex":[0.9969241,0.0005381871,0.000902594,0.0003169061,0.0009188241,0.0003993719],"domain_scores_gemma":[0.9978229,0.0004188679,0.0008891625,0.0005715509,0.0001573361,0.0001402049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.03004817,0.007958715,0.001501365,0.0000721902,0.003561852,0.01598259,0.1184413,0.5109979,0.1303506,0.04796885,0.06142454,0.07169187],"study_design_scores_gemma":[0.174588,0.002494623,0.0001206731,0.0001586187,0.0001419455,0.01277639,0.006715474,0.6940102,0.08685578,0.01616341,0.00449512,0.00147974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02227017,0.005000314,0.9666252,0.0009440733,0.003911454,0.0003168441,0.000007560976,0.0001187635,0.0008055995],"genre_scores_gemma":[0.3944232,0.0000247939,0.6044983,0.0006367742,0.0002661209,0.00002851898,0.00000841636,0.00002836081,0.00008555212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.372153,"threshold_uncertainty_score":0.9803485,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04067249351576445,"gpt":0.3062741948405774,"spread":0.265601701324813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006995637,0.0005085118,0.0007899384,0.0003975103,0.0001726673,0.000551024,0.002476133,0.0002614438,0.00002467157],"category_scores_gemma":[0.0000375437,0.0004355524,0.0004121505,0.0001266654,0.00004583659,0.0005175396,0.002617867,0.0006636257,0.00001040067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001476182,"about_ca_system_score_gemma":0.0001269616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003705594,"about_ca_topic_score_gemma":2.153598e-7,"domain_scores_codex":[0.9974308,0.0001145919,0.0008551291,0.0005975099,0.0005415931,0.0004603721],"domain_scores_gemma":[0.9976181,0.0004002774,0.0007667267,0.000744553,0.0002410515,0.0002292293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002635838,0.006223291,0.0005598679,0.003614233,0.004602722,0.001481646,0.04539084,0.01265616,0.09720489,0.1454138,0.01790204,0.6623147],"study_design_scores_gemma":[0.004327588,0.003819545,0.0002437382,0.00126386,0.0001098493,0.001338878,0.0004899966,0.9278987,0.03079256,0.01947441,0.008679879,0.00156099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3194824,0.008124673,0.6613468,0.001389229,0.00739803,0.001657864,0.0001374406,0.00007381777,0.000389672],"genre_scores_gemma":[0.4551549,0.0002731047,0.5418772,0.0007765263,0.001741661,0.00002387517,0.00001598282,0.00005285291,0.00008393866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9152426,"threshold_uncertainty_score":0.9998096,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02518562286733398,"gpt":0.2741900172678776,"spread":0.2490043944005436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002884634,0.000106434,0.0001495915,0.0001065943,0.0001759603,0.0000370208,0.0008026296,0.00003549153,0.000004038658],"category_scores_gemma":[0.00002195132,0.0000749342,0.0000912012,0.0002906691,0.00005394119,0.0005121572,0.0001778023,0.000133872,0.000001467623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005961266,"about_ca_system_score_gemma":0.00007710129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000454542,"about_ca_topic_score_gemma":3.219964e-7,"domain_scores_codex":[0.9987321,0.0001169393,0.0004307295,0.000136376,0.0004646919,0.0001191672],"domain_scores_gemma":[0.9989854,0.00006412429,0.0004502838,0.000266413,0.0001763703,0.00005739272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003446195,0.009148253,0.008787967,0.00006674942,0.0004241129,0.0001140354,0.05612101,0.1119691,0.5662004,0.03927894,0.003644749,0.2039001],"study_design_scores_gemma":[0.001678177,0.001235693,0.006927887,0.0001077315,0.000007449505,0.0008760221,0.000405652,0.5195363,0.465963,0.002542913,0.0004740401,0.000245162],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8894742,0.0001564131,0.109371,0.0002856845,0.000429893,0.0001105656,0.000001843676,0.00001167923,0.0001586907],"genre_scores_gemma":[0.7977149,0.000007876313,0.2020022,0.0001275874,0.0001252973,6.242281e-7,0.000002851317,0.000004766448,0.00001380508],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4075672,"threshold_uncertainty_score":0.3055728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}