{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":30,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":30,"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":"71a680768c21","filters":{"venue":"ACM SIGACT News"}},"results":[{"id":"W2050666081","doi":"10.1145/369836.571192","title":"Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":71,"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":"Computer science; Intuition; Algorithm; Presentation (obstetrics); Context (archaeology); Computational geometry; Artificial intelligence; Cognitive science","retraction":null,"screen_n_in":null,"score":{"opus":0.009808366371430902,"gpt":0.2592474286857505,"spread":0.2494390623143196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004637305,0.000197988,0.0002877536,0.0001351694,0.0001770929,0.0001040702,0.0004809977,0.00007451091,0.00028842],"category_scores_gemma":[0.0001146337,0.0002043865,0.00005862973,0.0007181487,0.00008017516,0.0004999367,0.0002100549,0.0001356612,0.0000199094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003966995,"about_ca_system_score_gemma":0.0001358351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005599533,"about_ca_topic_score_gemma":0.000003172529,"domain_scores_codex":[0.9983881,0.0001250305,0.0004310691,0.000473843,0.0003318622,0.0002501615],"domain_scores_gemma":[0.9985727,0.0004789681,0.0001611459,0.0004750873,0.0001251796,0.0001869002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001277186,0.0001173992,0.000745006,0.0005482108,0.00005224493,0.000002481567,0.00007017872,0.0005608074,0.0003710411,0.00343665,0.07386138,0.9202218],"study_design_scores_gemma":[0.001341631,0.0002064122,0.01581488,0.0008291021,0.00008671176,0.0002032442,0.00001932253,0.02822199,0.0006671468,0.04114448,0.9106827,0.0007823217],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03587414,0.09512503,0.8570107,0.006907393,0.0001628219,0.001596307,0.0002154615,0.0001851969,0.002922978],"genre_scores_gemma":[0.1046449,0.1310234,0.741229,0.0175783,0.000702826,0.0003811067,0.001090467,0.00008031897,0.003269634],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9194395,"threshold_uncertainty_score":0.8334639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898165178","doi":"10.1145/3289137.3289150","title":"Recent Algorithmic Advances in Population Protocols","year":2018,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Theoretical computer science; Probabilistic logic; Population; Abstraction; Protocol (science); Graph; Distributed computing; Communications protocol; Wireless network; Wireless; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.025634826433567,"gpt":0.3262800787899436,"spread":0.3006452523563766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002088446,0.0001129904,0.0001625121,0.00006464709,0.00006722471,0.0001140581,0.0008726115,0.000055597,0.00002183962],"category_scores_gemma":[0.0001257014,0.00009871793,0.00002853885,0.0005092294,0.00002127439,0.0009530176,0.0001418136,0.00008699702,0.0001297823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006618797,"about_ca_system_score_gemma":0.00003397568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001419715,"about_ca_topic_score_gemma":0.00028989,"domain_scores_codex":[0.9988318,0.0000626045,0.0002975037,0.0003355205,0.0002147491,0.000257824],"domain_scores_gemma":[0.9989384,0.00003616685,0.0001180275,0.0007712322,0.00007563573,0.000060537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009544259,0.00005585477,0.01183109,0.00001213142,0.000002052269,0.000006620261,0.0002256871,0.00001835778,0.0002457571,0.002522697,0.001341909,0.9837283],"study_design_scores_gemma":[0.0006420218,0.0001802608,0.04291657,0.0001403416,9.089796e-7,0.000008791265,0.00002064886,0.007515718,0.0008798569,0.005527375,0.9419156,0.0002519311],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1546269,0.004668736,0.7126225,0.01482768,0.006673182,0.06370661,0.00006797726,0.001909065,0.0408973],"genre_scores_gemma":[0.9550723,0.0002569931,0.03711316,0.0009035137,0.0008913978,0.005357548,0.00002765501,0.00002449777,0.0003528818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9834764,"threshold_uncertainty_score":0.40256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095409339","doi":"10.1145/1855118.1855133","title":"The story of set disjointness","year":2010,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"Citation; Library science; Computer science; Set (abstract data type); World Wide Web; Media studies; Operations research; Sociology; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0365966246474522,"gpt":0.2410202351192273,"spread":0.2044236104717751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001442476,0.00008489689,0.0002180658,0.00004656234,0.0001683317,0.00003341041,0.0005321504,0.00007084302,0.0001552454],"category_scores_gemma":[0.001210265,0.00006841229,0.00009041687,0.00009300816,0.0001029837,0.00008653582,0.0000761037,0.0002950469,0.0004419363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001001052,"about_ca_system_score_gemma":0.00001157648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001332697,"about_ca_topic_score_gemma":0.0001230469,"domain_scores_codex":[0.9992473,0.00003956475,0.0003475672,0.0001655754,0.00002381056,0.0001762378],"domain_scores_gemma":[0.9982963,0.0005147078,0.0003133954,0.0008141925,0.00001707941,0.00004433826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003104681,0.00005324164,0.08672617,0.00004020804,0.00005920786,0.000001485393,0.001896132,0.000008534506,0.002909191,0.8947768,0.007160728,0.006337276],"study_design_scores_gemma":[0.0005323118,0.00008524207,0.06878293,0.00001884988,0.000007173437,0.000008782574,0.0008478172,0.00009630274,0.002587291,0.1558908,0.7708134,0.0003291373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9811453,0.0003221184,0.00008412789,0.0009881833,0.001577341,0.0001104539,0.00003548987,0.00002466176,0.01571237],"genre_scores_gemma":[0.9967306,0.00002124073,0.00007007421,0.00006131839,0.000183569,0.000008968446,0.000002790062,0.00001415848,0.002907332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7636526,"threshold_uncertainty_score":0.5680345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157209735","doi":"10.1145/1412700.1412717","title":"Can quantum mechanics help distributed computing?","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Focus (optics); Quantum information science; Quantum computer; Theoretical computer science; Computation; Quantum; Algorithm; Quantum mechanics; Physics; Quantum entanglement","retraction":null,"screen_n_in":null,"score":{"opus":0.01888000359325341,"gpt":0.2381378307352617,"spread":0.2192578271420083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002145495,0.0003150424,0.000351013,0.0001160563,0.000553062,0.000132091,0.002404803,0.000114539,0.0000107251],"category_scores_gemma":[0.0002647725,0.0002782002,0.0001640608,0.000729657,0.00005199876,0.0001463262,0.00111522,0.0003237535,0.00007213004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000579758,"about_ca_system_score_gemma":0.0001654678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000276197,"about_ca_topic_score_gemma":0.00002496716,"domain_scores_codex":[0.9977151,0.0001193591,0.0003790395,0.0006630799,0.0004445304,0.0006788737],"domain_scores_gemma":[0.9975861,0.0003127736,0.0001798986,0.001561204,0.00009477981,0.0002651872],"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.00007820101,0.001560929,0.008845721,0.0001702403,0.000459883,0.003614292,0.01950737,0.06556434,0.01113935,0.243728,0.1248107,0.5205209],"study_design_scores_gemma":[0.0005566422,0.0002340048,0.002684944,0.00004043268,0.000008019204,0.0004659429,0.00004272701,0.9531403,0.001332827,0.0271973,0.01372137,0.0005755632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2819223,0.0001315827,0.7097999,0.006138036,0.0009930431,0.0001802963,0.00001991229,0.0007282325,0.00008664132],"genre_scores_gemma":[0.9623569,0.00002658424,0.03591466,0.001277953,0.0003274705,0.000002917943,0.00002503111,0.00002551239,0.00004296257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8875759,"threshold_uncertainty_score":0.999967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244155401","doi":"10.1145/1466390.1466393","title":"Combinatorial designs","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"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":"Citation; Computer science; World Wide Web; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.03345425073650395,"gpt":0.2174117216361128,"spread":0.1839574708996088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007386046,0.0001133529,0.0001410039,0.00004399514,0.00007947823,0.00001167835,0.0002529318,0.00007474935,0.00009847077],"category_scores_gemma":[0.00005089111,0.0001092378,0.00006550238,0.0001308222,0.00002768138,0.00009964913,0.0000212279,0.0001113537,0.0003581978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001901988,"about_ca_system_score_gemma":0.000009722605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001819236,"about_ca_topic_score_gemma":0.000002836713,"domain_scores_codex":[0.9994244,0.00003446922,0.0001425749,0.00009846012,0.0001019348,0.0001981922],"domain_scores_gemma":[0.999407,0.00008865249,0.00001485203,0.0004008349,0.00001190586,0.00007674949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002274026,0.0004172805,0.04948686,0.0003494654,0.0007041059,0.0008460638,0.01199545,0.006428971,0.2988536,0.2548229,0.3577215,0.01814641],"study_design_scores_gemma":[0.005506487,0.0005182537,0.01485492,0.000123597,0.00008708408,0.0005288435,0.0007762448,0.001632931,0.1818451,0.1490129,0.6427295,0.002384138],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9678447,0.0002344329,0.0005093103,0.00002743616,0.002512174,0.0001256116,0.000002478231,0.0004662582,0.02827766],"genre_scores_gemma":[0.999301,0.00003850881,0.00009575101,0.00003966145,0.0002977763,0.00001366874,0.000003230958,0.00002610456,0.0001843153],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.285008,"threshold_uncertainty_score":0.4604027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003926749","doi":"10.1145/507457.507473","title":"The computational complexity of the local postage stamp problem","year":2002,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"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":"Integer (computer science); Postage Stamps; Combinatorics; Mathematics; Time complexity; Discrete mathematics; Set (abstract data type); Computational complexity theory; Turing; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02713917776118397,"gpt":0.2068266196016482,"spread":0.1796874418404642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000145254,0.00009565739,0.0001086785,0.0000156804,0.0001487831,0.00002451861,0.0004381381,0.00003748458,0.00009129697],"category_scores_gemma":[0.00002598248,0.00005572674,0.00008263705,0.0001472588,0.0002059145,0.00005267259,0.00005653636,0.0001336379,0.00004355424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001974202,"about_ca_system_score_gemma":0.00000540838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003135787,"about_ca_topic_score_gemma":0.00006065925,"domain_scores_codex":[0.9992947,0.0000796231,0.0002146651,0.0000785558,0.0001714479,0.000161035],"domain_scores_gemma":[0.999262,0.0002280461,0.00004671814,0.0004025155,0.00002753564,0.0000331836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005965727,0.000216485,0.01185598,0.0004023308,0.0004619186,0.000009161888,0.0077728,0.4017681,0.007232937,0.4514726,0.06429909,0.05444893],"study_design_scores_gemma":[0.002188666,0.0002331489,0.05183016,0.0002583469,0.00008072595,0.00008200861,0.003787007,0.2862131,0.009070192,0.456554,0.1886542,0.001048383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9594456,0.001017172,0.008429578,0.001743161,0.0008200498,0.0007257832,0.00006653209,0.0002564711,0.02749566],"genre_scores_gemma":[0.9994438,0.00001005924,0.0001963853,0.00006240668,0.00003376067,0.000007821525,0.000002691092,0.00001351144,0.0002295496],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1243551,"threshold_uncertainty_score":0.2272471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973442596","doi":"10.1145/568438.568441","title":"Review of <b>Data Structures and Algorithms in Java (2nd ed)</b>","year":2001,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"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":"Computer science; Java; Object (grammar); Class (philosophy); Set (abstract data type); Algorithm; Garbage collection; Data structure; Sequence (biology); Linked list; Programming language; Information retrieval; Artificial intelligence; Garbage","retraction":null,"screen_n_in":null,"score":{"opus":0.05217211995221574,"gpt":0.3271956880794476,"spread":0.2750235681272318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003472223,0.0001378363,0.0002924985,0.00007323057,0.00004049777,0.00005335989,0.002299519,0.00005251297,0.0000628722],"category_scores_gemma":[0.0002581151,0.0001066935,0.00002539647,0.0003240915,0.00003965849,0.001013035,0.0021894,0.0001340126,0.000007360633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001096249,"about_ca_system_score_gemma":0.0000486302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005812189,"about_ca_topic_score_gemma":0.00003906294,"domain_scores_codex":[0.9986855,0.00007499541,0.0003373525,0.0004685155,0.000222671,0.0002109542],"domain_scores_gemma":[0.9972909,0.0001634202,0.0001355854,0.002286402,0.0000383941,0.00008527297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004047424,0.00003483792,0.001819192,0.0003051308,0.000006455383,0.00002988694,0.00008713329,0.00000132092,0.0001957333,0.0004396992,0.03768408,0.9593925],"study_design_scores_gemma":[0.00149083,0.0002195676,0.03360058,0.005372482,0.00002468697,0.000232367,0.00006481441,0.0243629,0.0007386042,0.01584064,0.9172823,0.0007702546],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.03654871,0.5120419,0.4306807,0.0126025,0.001645296,0.001910765,0.0003209797,0.0003599591,0.003889188],"genre_scores_gemma":[0.03655445,0.3630743,0.5924726,0.006972672,0.0004317684,0.00001774111,0.0002554609,0.0000395565,0.000181562],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9586222,"threshold_uncertainty_score":0.4350836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100677024","doi":"10.1145/945526.945527","title":"Some myths about famous mutual exclusion algorithms","year":2003,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Algorithm; Computer science; Dijkstra's algorithm; Software; Process (computing); Theoretical computer science; Programming language; Shortest path problem","retraction":null,"screen_n_in":null,"score":{"opus":0.01872739838913388,"gpt":0.2595506680645361,"spread":0.2408232696754022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120243,0.0002408018,0.000293944,0.00007706319,0.0002259611,0.0002636992,0.001489185,0.0001341445,0.00003480854],"category_scores_gemma":[0.0002443289,0.0002102001,0.0001234206,0.0004165386,0.00003975838,0.0008174306,0.00032226,0.0002056271,0.0006170844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006634761,"about_ca_system_score_gemma":0.0001094844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009551427,"about_ca_topic_score_gemma":0.000008965593,"domain_scores_codex":[0.9979689,0.0001242357,0.0003777249,0.0005671378,0.0004373338,0.0005246567],"domain_scores_gemma":[0.9979649,0.0001170239,0.0001427379,0.001485883,0.0000780445,0.0002114628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002677155,0.0007195297,0.001963474,0.00009375568,0.0001137726,0.0006158747,0.005020359,0.0003276462,0.01755351,0.1935394,0.1518866,0.6281393],"study_design_scores_gemma":[0.001609385,0.0002382355,0.002802554,0.00008923567,0.00001216831,0.0001698956,0.0002480313,0.009062391,0.008062806,0.007745083,0.9690465,0.0009137142],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09737463,0.008035847,0.8420578,0.003593076,0.009193246,0.001246695,0.00007758188,0.001400869,0.03702023],"genre_scores_gemma":[0.9731738,0.0001502597,0.02127056,0.001716328,0.0004982065,0.00003619614,0.00001447683,0.00002847565,0.003111714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8757991,"threshold_uncertainty_score":0.8571712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171906598","doi":"10.1145/1067309.1067322","title":"Algorithmic foundations of the internet","year":2005,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"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":"The Internet; Computer science; Field (mathematics); Sample (material); Data science; Theoretical computer science; World Wide Web; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02243935603176384,"gpt":0.2699510865481896,"spread":0.2475117305164257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008804439,0.00007571253,0.00008677624,0.00003400131,0.00006614744,0.00006662159,0.002032031,0.00003117142,0.00006994014],"category_scores_gemma":[0.00008841026,0.00004821417,0.00006205435,0.0002047774,0.00003574298,0.0005117439,0.001040314,0.00009569939,0.00009466536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002242705,"about_ca_system_score_gemma":0.00004740814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001699338,"about_ca_topic_score_gemma":0.00004624359,"domain_scores_codex":[0.999292,0.00003734064,0.0001771492,0.0001802094,0.000183764,0.0001295796],"domain_scores_gemma":[0.9985037,0.00009281684,0.00009656286,0.001229853,0.00003794058,0.00003910413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002537841,0.00011015,0.001168335,0.00000512992,0.00001816598,0.000001177087,0.0008653431,0.00008606096,0.00264655,0.01831538,0.05302531,0.9237559],"study_design_scores_gemma":[0.0005861255,0.00007621153,0.01573877,0.00006382242,0.00001218044,0.00002374625,0.00004109318,0.1468318,0.02449073,0.008315963,0.8035467,0.0002728653],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03897091,0.0001987523,0.9435074,0.01050764,0.001070107,0.0002942982,0.00001627123,0.000138945,0.00529567],"genre_scores_gemma":[0.8240703,0.0000202834,0.1731862,0.0008726891,0.0002487876,0.000009790894,0.000006658764,0.00000793636,0.001577443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.923483,"threshold_uncertainty_score":0.3776053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3127457110","doi":"10.1145/3197406.3197420","title":"Proving PACELC","year":2018,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"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":"Liveness; Computer science; Scalability; Consistency (knowledge bases); Partition (number theory); Cache coherence; Latency (audio); Model checking; Theoretical computer science; Distributed computing; Computer network; Mathematics; Artificial intelligence; Operating system; Combinatorics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01926804898218138,"gpt":0.2635805219920797,"spread":0.2443124730098983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001573943,0.0001089759,0.000131337,0.0000343855,0.0001309783,0.0002129487,0.001285644,0.00005093209,0.00003104052],"category_scores_gemma":[0.0001480001,0.00009135954,0.00004825977,0.0002870509,0.00003983325,0.0004615646,0.0003166934,0.00008083673,0.0007139651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002471214,"about_ca_system_score_gemma":0.00005577147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001437447,"about_ca_topic_score_gemma":0.00005449391,"domain_scores_codex":[0.9989915,0.00003446242,0.0001767347,0.0003173398,0.0001912747,0.0002886375],"domain_scores_gemma":[0.9985323,0.00005211855,0.00007857628,0.00116118,0.00007972605,0.00009609944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001643123,0.0001713877,0.01065919,0.00005015151,0.00005214395,0.00007869535,0.003602115,0.000009263024,0.02239177,0.06391148,0.2538713,0.6451861],"study_design_scores_gemma":[0.0004899908,0.0002317596,0.006460761,0.00006714066,0.000004404065,0.00003570665,0.00008987289,0.006660813,0.009552594,0.003667685,0.9723206,0.0004186656],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1452259,0.0003491138,0.7659653,0.00745374,0.00314106,0.0005459188,0.00001208534,0.0009114823,0.07639541],"genre_scores_gemma":[0.9853931,0.000003318304,0.01204563,0.0007433966,0.0004211919,0.00001139119,0.000001757312,0.000007730437,0.001372482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8401672,"threshold_uncertainty_score":0.9176815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224209627","doi":"10.1145/3532737.3532746","title":"Guest Column","year":2022,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Perspective (graphical); Communication complexity; Theoretical computer science; Column (typography); Circuit complexity; Upper and lower bounds; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence; Electronic circuit","retraction":null,"screen_n_in":null,"score":{"opus":0.02997993845767251,"gpt":0.2524561424002102,"spread":0.2224762039425377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002052309,0.00009614488,0.0001177803,0.00008527056,0.0004851295,0.0001246825,0.002583975,0.00001781058,0.0003321547],"category_scores_gemma":[0.0000747308,0.0001064023,0.00008350766,0.0005930885,0.00003447934,0.0002451842,0.002240211,0.0002338652,0.0001064953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004466045,"about_ca_system_score_gemma":0.00005962556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002038682,"about_ca_topic_score_gemma":0.00003921583,"domain_scores_codex":[0.9988455,0.00009156709,0.0001507023,0.000318801,0.0003345629,0.0002588432],"domain_scores_gemma":[0.9984769,0.0001648649,0.00005751459,0.001199299,0.00002062272,0.00008079254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002023029,0.0006229029,0.005997142,0.00001841394,0.00007186808,0.0003097787,0.003410376,0.0003285986,0.002014665,0.2417103,0.4147172,0.3307786],"study_design_scores_gemma":[0.0003022474,0.0001944226,0.001990615,0.000002695215,0.000003561839,0.00006021641,0.0001211269,0.004660855,0.0004986119,0.04506114,0.9468485,0.0002559679],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3852271,0.002815151,0.3049326,0.08805671,0.04721248,0.002722662,0.0001731575,0.005728966,0.1631313],"genre_scores_gemma":[0.9165007,0.00002702891,0.07269835,0.006579794,0.0007094094,0.0001310912,0.00001608045,0.00002368443,0.003313873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5321314,"threshold_uncertainty_score":0.4801711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058294560","doi":"10.1145/568438.568443","title":"Review of <b>How to Solve It: Modern Heuristics</b>","year":2001,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"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; Computer science; Heuristic; Key (lock); Fuzzy logic; Presentation (obstetrics); Process (computing); Artificial intelligence; Management science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.06339484273346335,"gpt":0.3417286862962899,"spread":0.2783338435628266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801263,0.0001824057,0.0003978837,0.0001832863,0.00006890071,0.0001219674,0.002495305,0.00005657919,0.0002653987],"category_scores_gemma":[0.005139549,0.0001642228,0.0001072982,0.001087275,0.00003978634,0.0003035165,0.0009017064,0.0001768438,0.0002789838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004729228,"about_ca_system_score_gemma":0.0001746983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004243983,"about_ca_topic_score_gemma":0.000009348039,"domain_scores_codex":[0.9978288,0.0001107862,0.0004394979,0.0004881645,0.0007148282,0.0004179494],"domain_scores_gemma":[0.9965389,0.0003799247,0.0001623058,0.002123051,0.000479267,0.0003165967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001418067,0.0002131543,0.0002129593,0.001221766,0.00004969025,0.00009289317,0.0005465127,0.0006695745,0.0007405476,0.004283772,0.3879091,0.6040459],"study_design_scores_gemma":[0.0007383928,0.0003744686,0.0002550153,0.002503053,0.00003939888,0.00008922661,0.0000300324,0.2291214,0.001732356,0.005582829,0.758783,0.0007507945],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000432032,0.003208647,0.9593099,0.0320554,0.0002192346,0.0004556431,0.000005896361,0.00008059211,0.00462148],"genre_scores_gemma":[0.003848388,0.02472479,0.9514319,0.01612352,0.0001908231,0.00005761154,0.00001158761,0.00003838111,0.003572938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6032951,"threshold_uncertainty_score":0.6696813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102047759","doi":"10.1145/2421119.2421136","title":"Computational geometry column 54","year":2012,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Column (typography); Spanning tree; Geometry; Plane (geometry); Combinatorics; Graph; Computer science; Line segment; Set (abstract data type); Mathematics; Connection (principal bundle)","retraction":null,"screen_n_in":null,"score":{"opus":0.02655385791581369,"gpt":0.2750105416370427,"spread":0.248456683721229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003069135,0.0001307785,0.0001307824,0.0001901315,0.0001755418,0.0001463129,0.000707855,0.00006015558,0.0001235276],"category_scores_gemma":[0.0002340107,0.0001340743,0.00007267266,0.0007815755,0.0000230148,0.001067115,0.0003113649,0.0001150176,0.0005832323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005203365,"about_ca_system_score_gemma":0.00008833503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002673468,"about_ca_topic_score_gemma":0.000004021654,"domain_scores_codex":[0.9987137,0.00006776692,0.0002325161,0.0002491227,0.0003964647,0.0003404806],"domain_scores_gemma":[0.9987461,0.0003907092,0.00009051285,0.0004741315,0.0001049403,0.0001935972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002284087,0.0007946786,0.04730455,0.00003881897,0.0001268191,0.00001321391,0.002432282,0.04495408,0.002534475,0.2943591,0.1155944,0.4918247],"study_design_scores_gemma":[0.001836055,0.0002935246,0.3705725,0.00003109364,0.00003630585,0.0002173918,0.00009407303,0.1660564,0.005614698,0.07658845,0.3772944,0.001365079],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2315455,0.0004195478,0.761752,0.00197221,0.001289965,0.0001640695,0.000004253444,0.0002005248,0.002651926],"genre_scores_gemma":[0.8575789,0.000006684609,0.1395802,0.001718093,0.0005023242,0.0000122802,0.00003781057,0.000008053207,0.0005556801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6260334,"threshold_uncertainty_score":0.7496465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128257486","doi":"10.1145/2261417.2261437","title":"Automated model repair for distributed programs","year":2012,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"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":"Computer science; Model transformation; Scalability; Model checking; Automaton; Distributed computing; Property (philosophy); Transformation (genetics); Mutual exclusion; Finite-state machine; Security token; Theoretical computer science; Programming language; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0418212947630007,"gpt":0.2959016699125667,"spread":0.2540803751495659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003623716,0.0002131323,0.0002725836,0.00003946601,0.0001578687,0.0001612206,0.001158381,0.0001230668,0.000002619727],"category_scores_gemma":[0.0002018496,0.0001824368,0.0002042363,0.0004000781,0.00002824886,0.0009099641,0.000251871,0.00009937715,0.00006258075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006736926,"about_ca_system_score_gemma":0.00006924167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004764237,"about_ca_topic_score_gemma":0.000007880971,"domain_scores_codex":[0.9982408,0.00004073828,0.000367717,0.0003764477,0.000246632,0.0007276938],"domain_scores_gemma":[0.9980281,0.00009077119,0.0001489796,0.00134479,0.0001258053,0.0002615416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001001121,0.002198004,0.02522935,0.0003742789,0.0003518919,0.00001933136,0.003609064,0.004358905,0.004023709,0.1469386,0.6391909,0.1736058],"study_design_scores_gemma":[0.0005600738,0.00007595174,0.001212534,0.00003231472,0.0000124798,0.00001266133,0.00003033694,0.8519701,0.0003679077,0.000886804,0.1445257,0.0003131258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02515967,0.0002976007,0.9672276,0.0008922895,0.0007031753,0.0008945839,0.0001297306,0.004066507,0.000628862],"genre_scores_gemma":[0.9079103,0.000004098439,0.09082018,0.0002797223,0.0001771262,0.0002484715,0.0001921616,0.00001973537,0.0003481806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8827506,"threshold_uncertainty_score":0.7439556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393185920","doi":"10.1145/3654780.3654788","title":"Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes","year":2024,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computability, Logic, AI Algorithms","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":"McGill University","funders":"","keywords":"Communication complexity; Constant (computer programming); Column (typography); Computer science; Structural complexity theory; Theoretical computer science; Mathematics; Computational complexity theory; Complexity class; Algorithm; Telecommunications; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0740858890672719,"gpt":0.3144465188398266,"spread":0.2403606297725547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004807663,0.0002992789,0.0004258627,0.0001881822,0.0002218334,0.0008191856,0.002090231,0.0001462598,0.00007018274],"category_scores_gemma":[0.0003175857,0.0002904904,0.00007232263,0.0008715254,0.0006657591,0.0007772892,0.001978278,0.0006045798,0.00003192954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002128745,"about_ca_system_score_gemma":0.0001866569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534475,"about_ca_topic_score_gemma":0.00940636,"domain_scores_codex":[0.9975074,0.0004133465,0.0005053835,0.000789264,0.0003444255,0.0004401972],"domain_scores_gemma":[0.9963176,0.001205735,0.0001018619,0.002102338,0.0001039491,0.0001685689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006402071,0.0006347549,0.0964506,0.0005694563,0.0001436855,0.0002516914,0.007986655,0.0001893465,0.003200425,0.5934947,0.02142585,0.2755889],"study_design_scores_gemma":[0.001072264,0.000214732,0.1837682,0.0002315627,0.00002435025,0.0002330025,0.000379505,0.1657548,0.0006706516,0.590982,0.05568748,0.0009815654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.882044,0.006511191,0.06494175,0.03055448,0.003568557,0.00302044,0.0003373415,0.00198879,0.007033442],"genre_scores_gemma":[0.9316935,0.0001229668,0.06745683,0.000494014,0.0001234021,0.00001868961,0.00004665321,0.00001716949,0.00002677551],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2746073,"threshold_uncertainty_score":0.9999547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970277269","doi":"10.1145/1360443.1360454","title":"The complexity of fixed-parameter problems","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Graph Theory Research","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 Waterloo","funders":"","keywords":"Completeness (order theory); Computer science; Mathematics; Theoretical computer science; Algorithm; Calculus (dental); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1141920545832621,"gpt":0.3186488220123281,"spread":0.204456767429066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547636,0.0001151603,0.0001667366,0.00006131647,0.0003312257,0.00004325036,0.002781589,0.00003849102,0.00001551656],"category_scores_gemma":[0.000671607,0.0000752867,0.00009636463,0.0004882766,0.0008831755,0.0003403671,0.0007817542,0.0002102197,0.00007139424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002049868,"about_ca_system_score_gemma":0.00006590082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005858747,"about_ca_topic_score_gemma":0.0000388647,"domain_scores_codex":[0.9985317,0.0001666169,0.0002492833,0.0002771737,0.000398139,0.0003770601],"domain_scores_gemma":[0.9967991,0.001063594,0.0001097119,0.001830864,0.0001062226,0.00009056891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001233905,0.0003994218,0.020788,0.00006285164,0.0001437035,0.00006953738,0.004733326,0.0004487387,0.02900027,0.7772392,0.01571647,0.1512751],"study_design_scores_gemma":[0.000543378,0.0003088255,0.01334487,0.00002027503,0.000003277584,0.00007130529,0.00005089016,0.003658557,0.02724474,0.9202768,0.03419282,0.0002842479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6627694,0.001176552,0.3098128,0.01246285,0.000679332,0.001451859,0.00001125931,0.0004276384,0.01120824],"genre_scores_gemma":[0.9591924,0.0001274857,0.03972342,0.000198254,0.00003174845,0.00002563826,0.000001009354,0.00001087134,0.0006891513],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.296423,"threshold_uncertainty_score":0.516893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116601704","doi":"10.1145/3532737.3532745","title":"SIGACT News Complexity Theory Column 112","year":2022,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Blame; Column (typography); Completeness (order theory); Bit (key); Computer science; Operations research; Psychology; Mathematics; Telecommunications; Computer security; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.02750123540892304,"gpt":0.2247213540626842,"spread":0.1972201186537612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006210853,0.0002991997,0.0003932655,0.0001316433,0.0004150216,0.00007471431,0.0009520776,0.00008159363,0.00309088],"category_scores_gemma":[0.0001119029,0.0003216308,0.0002255395,0.0004434201,0.00008897281,0.0001878007,0.0002985757,0.0005332197,0.0003053771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001347692,"about_ca_system_score_gemma":0.00003179412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002224458,"about_ca_topic_score_gemma":0.0001537013,"domain_scores_codex":[0.9979645,0.0004437355,0.0004064554,0.000327747,0.0003359153,0.0005216707],"domain_scores_gemma":[0.9981747,0.0004010856,0.00007969599,0.001146041,0.00002079776,0.0001777116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007861384,0.0008122534,0.02557173,0.0006703699,0.001433798,0.0004478761,0.01369227,0.04231329,0.08927307,0.3904832,0.353395,0.08112099],"study_design_scores_gemma":[0.001630125,0.0003540925,0.004977931,0.00003974329,0.0001017212,0.0001379148,0.007303645,0.002131168,0.004365695,0.177191,0.8003522,0.001414753],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9384562,0.001028253,0.0008092495,0.0003056925,0.00252667,0.0006651937,0.0001277082,0.00115701,0.05492397],"genre_scores_gemma":[0.9971659,0.00002324989,0.000167905,0.0005549875,0.0002474631,0.0001470785,0.00005123824,0.00008426981,0.001557971],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4469571,"threshold_uncertainty_score":0.9999236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086999408","doi":"10.1145/369836.571190","title":"Review of: Modern Graph Theory by Béla Bollobás","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Graph Theory Research","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 Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Discrete mathematics; Graph; Graph theory; Mathematics; Graph property; Theoretical computer science; Combinatorics; Voltage graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02140027879410072,"gpt":0.3065390506198449,"spread":0.2851387718257442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895925,0.0001960726,0.0003415335,0.0001016378,0.0000951317,0.00003996959,0.002981438,0.0000640206,0.000589693],"category_scores_gemma":[0.00037939,0.0001660111,0.0001894677,0.0008539351,0.0001579519,0.0005765349,0.0003299183,0.0002492605,0.0002160655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086387,"about_ca_system_score_gemma":0.00006562729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001323673,"about_ca_topic_score_gemma":0.000001819446,"domain_scores_codex":[0.9978772,0.0003913013,0.0003653615,0.0004799117,0.0004372664,0.0004489193],"domain_scores_gemma":[0.9968516,0.000537076,0.0001039644,0.002256341,0.00008346234,0.0001675333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003013696,0.0001034962,0.00007491413,0.0003723582,0.00003196441,0.000009354055,0.0001939569,0.00001377013,0.003957846,0.03616038,0.02353183,0.93552],"study_design_scores_gemma":[0.0003535403,0.0001367217,0.00006155363,0.0009705072,0.00001245025,0.00001758667,0.000008088444,0.0002339505,0.006533263,0.881568,0.1097784,0.0003259592],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.02290223,0.4795611,0.4098484,0.008072531,0.0004213517,0.002105128,0.00006656643,0.0008399827,0.07618268],"genre_scores_gemma":[0.4075307,0.4281396,0.09862222,0.03989844,0.0002934581,0.0003398265,0.00006619147,0.000230271,0.02487928],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.935194,"threshold_uncertainty_score":0.6769737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984231426","doi":"10.1145/1711475.1714372","title":"On Developing New Models, with Paging as a Case Study","year":2010,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Optimization and Search Problems","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 Waterloo","funders":"","keywords":"Computer science; Paging; Contrast (vision); Cache; Theoretical computer science; Computation; Data science; Artificial intelligence; Algorithm; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.05400918196770679,"gpt":0.3089274411305257,"spread":0.2549182591628189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002041473,0.0001349315,0.0001200554,0.0001140295,0.000188739,0.0003197946,0.0008001079,0.00003633249,0.00003075119],"category_scores_gemma":[0.0001198477,0.0001031935,0.00002106268,0.0003903699,0.00001479716,0.0006277792,0.0002967789,0.0002928764,0.00007516445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002140376,"about_ca_system_score_gemma":0.0003567408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001504344,"about_ca_topic_score_gemma":0.001298329,"domain_scores_codex":[0.9988678,0.00005080748,0.0001505452,0.0003672777,0.0002948007,0.0002688131],"domain_scores_gemma":[0.9986312,0.0001450172,0.0000536603,0.0009130354,0.00006899327,0.0001880908],"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.00008995629,0.001089133,0.006282096,0.00003337029,0.0001848055,0.01166381,0.0676529,0.07368834,0.0009414044,0.3814309,0.008369338,0.4485739],"study_design_scores_gemma":[0.007706406,0.003122981,0.0005588447,0.0001598884,0.00003471458,0.005412847,0.005625154,0.8457701,0.001754077,0.1175654,0.01014616,0.002143381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.388477,0.000005337069,0.6040685,0.003270433,0.0001700382,0.0004404751,1.808403e-7,0.0002139692,0.003354026],"genre_scores_gemma":[0.8075356,0.000002757813,0.1905315,0.001337476,0.00003887178,0.00001280578,5.825175e-7,0.0000125236,0.0005278737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7720818,"threshold_uncertainty_score":0.4208109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077566826","doi":"10.1145/369836.369849","title":"Half century of automata theory","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Citation; Computer science; Automaton; World Wide Web; Information retrieval; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01063045978310218,"gpt":0.2336770994239625,"spread":0.2230466396408604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884149,0.0001489776,0.0002090807,0.00006919215,0.00006498163,0.00006618565,0.002220145,0.00006839752,0.0009092847],"category_scores_gemma":[0.0001021626,0.0001234095,0.0001059818,0.0002925865,0.00006677312,0.000478373,0.0003069318,0.0001078018,0.000414409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000160219,"about_ca_system_score_gemma":0.00004638807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007922581,"about_ca_topic_score_gemma":0.000002575794,"domain_scores_codex":[0.9987499,0.0001329047,0.0002698144,0.0003198178,0.000239437,0.0002881575],"domain_scores_gemma":[0.9976091,0.0003480752,0.0000870033,0.001841734,0.00002291767,0.00009121189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001871097,0.0001222833,0.000129153,0.00001509002,0.00002542041,0.00001995826,0.001340222,0.00002798182,0.002595351,0.1116217,0.003433716,0.8806504],"study_design_scores_gemma":[0.002278295,0.000479041,0.01280609,0.0002173226,0.00004965119,0.0001450356,0.0005265187,0.01839773,0.0412083,0.4882295,0.4343576,0.001304964],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9152359,0.001572084,0.0189306,0.003536044,0.0008106833,0.000357404,0.00001467344,0.001165272,0.05837731],"genre_scores_gemma":[0.98467,0.0002463316,0.01247427,0.001454169,0.00009707579,0.000006799868,0.000004612078,0.00001663604,0.001030138],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8793455,"threshold_uncertainty_score":0.9956031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405845721","doi":"10.1145/3710795.3710801","title":"SIGACT News Complexity Theory Column 123","year":2024,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Column (typography); Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02877659169123449,"gpt":0.2760565798404229,"spread":0.2472799881491884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005970743,0.0003723368,0.0003773721,0.0001963981,0.0003255936,0.0009701693,0.002657521,0.00013138,0.0001172331],"category_scores_gemma":[0.0002747865,0.0003105029,0.0002772344,0.0008639181,0.0001594033,0.0004330737,0.001205753,0.0006529237,0.0008194895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006959362,"about_ca_system_score_gemma":0.0002138205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000321725,"about_ca_topic_score_gemma":0.00009470701,"domain_scores_codex":[0.9971992,0.0002957554,0.0004121051,0.0009385243,0.0004622677,0.0006921359],"domain_scores_gemma":[0.9966412,0.001133175,0.00009180127,0.001815327,0.00005200915,0.000266507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001884871,0.0001270581,0.0003271067,0.00009753418,0.0001244199,0.0003579801,0.00279772,0.0008602312,0.001763612,0.1115194,0.038936,0.8430701],"study_design_scores_gemma":[0.0004395572,0.0003388651,0.002543722,0.000219504,0.00003207352,0.0001986312,0.000112194,0.3375115,0.001397376,0.3651136,0.2911828,0.0009102762],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2616097,0.003432775,0.6851888,0.02374329,0.006660427,0.0008810702,0.00004406061,0.004251894,0.01418805],"genre_scores_gemma":[0.9084678,0.0000622793,0.08438435,0.003744396,0.001289962,0.00002209139,0.0000167999,0.00007306122,0.001939255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8421598,"threshold_uncertainty_score":0.9999585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030729535","doi":"10.1145/1412700.1412704","title":"Joint review of general lattice theory (second edition) and the congruences of a finite lattice","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Lattice (music); Mathematics; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0288947469895576,"gpt":0.2571599559105279,"spread":0.2282652089209703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005515377,0.0001116987,0.0003278315,0.0000343218,0.00009547458,0.00001179705,0.0006615368,0.00003195441,0.0001204285],"category_scores_gemma":[0.001009286,0.00006722056,0.00008567322,0.0002269635,0.0004135572,0.0003700956,0.0002436996,0.0001135986,0.00001018582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005241337,"about_ca_system_score_gemma":0.000059424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000225014,"about_ca_topic_score_gemma":0.000007384167,"domain_scores_codex":[0.9988517,0.0002428916,0.0003581979,0.0002062794,0.0001936922,0.0001472537],"domain_scores_gemma":[0.9974402,0.001462193,0.0002853078,0.0006600234,0.0001039843,0.00004832086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005730861,0.0000993306,0.0005337755,0.001387262,0.00009099463,0.00003375571,0.002393789,0.00003081965,0.001280372,0.9596292,0.004760839,0.02970253],"study_design_scores_gemma":[0.003377191,0.0005289801,0.01519985,0.00240496,0.0001508089,0.0003282024,0.0002200961,0.001767556,0.01630014,0.9280222,0.03098891,0.000711087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5374971,0.1885321,0.2113334,0.02264373,0.001886111,0.002344878,0.0000564103,0.0002477212,0.03545851],"genre_scores_gemma":[0.9000993,0.03320236,0.05010412,0.01521375,0.0002668767,0.00003959238,0.000005577801,0.00001445705,0.001053974],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3626022,"threshold_uncertainty_score":0.2741175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027982484","doi":"10.1145/1122480.1122499","title":"2005","year":2006,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Computer science; Column (typography); Information retrieval; Library science; Telecommunications; Geography; Archaeology","retraction":null,"screen_n_in":null,"score":{"opus":0.01876000521620824,"gpt":0.2568832196939013,"spread":0.238123214477693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001118538,0.00006369514,0.00006517048,0.00005471072,0.00006683692,0.0001462747,0.0008336579,0.00003066487,0.0001518946],"category_scores_gemma":[0.00004883647,0.00005582403,0.00003223862,0.0001957428,0.00001535015,0.0003574447,0.0002056512,0.00006746545,0.0005048985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000171851,"about_ca_system_score_gemma":0.00004281545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001596752,"about_ca_topic_score_gemma":0.00006916891,"domain_scores_codex":[0.9992725,0.00003147065,0.0001189656,0.0001792833,0.0001653127,0.0002324888],"domain_scores_gemma":[0.9992035,0.00005714845,0.00003058005,0.0006139924,0.00003052874,0.00006423726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004443715,0.0002192106,0.005146749,0.00001128697,0.00001267588,0.00003368254,0.0003159635,0.007639772,0.004231615,0.2343416,0.6528672,0.09517579],"study_design_scores_gemma":[0.0006192636,0.00006195377,0.004647517,0.000009447052,0.000002267239,0.0000116316,0.00001316675,0.05610774,0.003410348,0.03690881,0.897889,0.0003188783],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004352049,0.0001797755,0.8513386,0.02020498,0.0003928934,0.0002495514,0.000001481011,0.0005323348,0.1227483],"genre_scores_gemma":[0.4999552,0.00009111004,0.4566044,0.005048187,0.0004581856,0.00002956093,0.00001712485,0.00002593537,0.03777032],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4956031,"threshold_uncertainty_score":0.6489617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414234929","doi":"10.1145/3767145.3767151","title":"SIGACT News Complexity Theory Column 126 <b>Locally Decodable Codes for Insertions and Deletions</b>","year":2025,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Decoding methods; Hamming distance; Synchronization (alternating current); Hamming code; List decoding; Key (lock); Hamming weight","retraction":null,"screen_n_in":null,"score":{"opus":0.03030504865872188,"gpt":0.3013024295391453,"spread":0.2709973808804235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002976882,0.0001977698,0.0002438864,0.00004376995,0.0003683724,0.00008017814,0.0003588664,0.0002131842,0.00002494232],"category_scores_gemma":[0.001060101,0.0001666095,0.0001336703,0.0001364353,0.0001991682,0.000006869635,0.0003470665,0.0001171881,0.000006044862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001820188,"about_ca_system_score_gemma":0.0001062416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001213982,"about_ca_topic_score_gemma":0.0006405098,"domain_scores_codex":[0.998715,0.0001348141,0.0002914433,0.0004562623,0.00006382035,0.0003386365],"domain_scores_gemma":[0.9989433,0.0002958027,0.000083862,0.0004660973,0.000109906,0.0001010565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009930336,0.0004581921,0.03570026,0.0001275133,0.0003007415,0.000003998649,0.0000665634,0.00009099489,0.8184454,0.01984679,0.03283375,0.0911328],"study_design_scores_gemma":[0.003655486,0.002161971,0.05003592,0.0001447483,0.0002197338,0.00002461492,0.0007117916,0.001110095,0.1593337,0.1241583,0.6572345,0.001209168],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9479221,0.0009569167,0.04542558,0.001711299,0.0001755104,0.0005595532,0.00006088425,0.00005689834,0.003131277],"genre_scores_gemma":[0.9860619,0.0002128283,0.008141644,0.003808236,0.0001554826,0.00006257172,0.0002171305,0.00001452374,0.001325703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6591117,"threshold_uncertainty_score":0.6794138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050766540","doi":"10.1145/1412700.1412705","title":"A brief response to J. A. Cohen's joint review","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Jewish Identity and Society","field":"Social Sciences","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 Manitoba","funders":"","keywords":"Rebuttal; Joint (building); Computer science; Cognitive science; Epistemology; Psychoanalysis; Philosophy; Psychology; Law; Political science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07385197257358649,"gpt":0.3362033393574469,"spread":0.2623513667838604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001603326,0.0001059237,0.0002582015,0.00003657182,0.0006958934,0.00005542953,0.0005369877,0.00009624076,0.0005710876],"category_scores_gemma":[0.007531549,0.0001074333,0.0001901332,0.0005226728,0.0001833514,0.0002461256,0.0001479379,0.0001609349,0.001029854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000150344,"about_ca_system_score_gemma":0.0004032306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005285012,"about_ca_topic_score_gemma":0.0009517145,"domain_scores_codex":[0.9980766,0.0005468408,0.0002460261,0.0002495,0.0005058556,0.0003751391],"domain_scores_gemma":[0.9986782,0.000298181,0.00007359991,0.0005461047,0.0001047041,0.0002992187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001605484,0.00007393911,0.003376719,0.00005568902,0.00002256137,0.00006677459,0.01641787,6.342199e-7,0.0008335984,0.001925178,0.9740136,0.003197444],"study_design_scores_gemma":[0.0001458202,0.00004448205,0.02137591,0.0001847971,0.00001368135,0.000004951942,0.0008905874,1.633636e-7,0.00008451041,0.0004604927,0.9766329,0.0001616994],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7579983,0.007872839,0.000083741,0.1713357,0.0006892615,0.001161798,0.00001184902,0.0003048113,0.06054161],"genre_scores_gemma":[0.8618297,0.04175751,0.002005028,0.06996284,0.0007153986,0.00007371056,0.000005988965,0.00003402202,0.02361584],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1038313,"threshold_uncertainty_score":0.9997479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2993653833","doi":"10.1145/3374857.3374866","title":"PODC 2019 Review","year":2019,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Banquet; Operations research; Library science; Art history; Mathematics; History","retraction":null,"screen_n_in":null,"score":{"opus":0.01974455852597813,"gpt":0.2676747125311587,"spread":0.2479301540051805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002312259,0.0001361881,0.0002355219,0.00005842354,0.00005771315,0.0000851486,0.002223957,0.00004071176,0.0003992722],"category_scores_gemma":[0.0001136426,0.0001176764,0.0001344478,0.0004412786,0.0000217788,0.0004481207,0.000695779,0.0001654726,0.003334575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001706934,"about_ca_system_score_gemma":0.00005018832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006925173,"about_ca_topic_score_gemma":0.00000615213,"domain_scores_codex":[0.9988257,0.00005754957,0.0002129153,0.0003702908,0.0002589428,0.0002745512],"domain_scores_gemma":[0.9976838,0.0001710018,0.00008084876,0.001931175,0.00004279325,0.00009043919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003518443,0.0001140393,0.002584472,0.0003701892,0.00003950017,0.00002442053,0.0001978242,0.000006102569,0.0007986772,0.08391059,0.3515088,0.5604419],"study_design_scores_gemma":[0.0003522239,0.0001408565,0.003786248,0.0006306954,0.00001123302,0.00004012736,0.000007755139,0.001111689,0.0005065179,0.03281615,0.9601611,0.0004353624],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.07704651,0.1970342,0.1917486,0.1987347,0.02423791,0.006921761,0.00005873901,0.004284394,0.2999332],"genre_scores_gemma":[0.1866557,0.06153664,0.5474719,0.1530816,0.001780448,0.0001256701,0.00008123003,0.0001531284,0.04911369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6086524,"threshold_uncertainty_score":0.9974415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033427227","doi":"10.1145/1711475.1711499","title":"Introduction to the SIGACT news online algorithms column","year":2010,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Paging; Column (typography); Computer science; Competitive analysis; Quarter (Canadian coin); Online algorithm; Algorithm; Operations research; Information retrieval; Telecommunications; History; Mathematics; Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.02205290292875095,"gpt":0.2866052760490196,"spread":0.2645523731202686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003995339,0.0001769264,0.0001728158,0.0001223269,0.0002757484,0.0004637927,0.002178143,0.00009448152,0.0003328724],"category_scores_gemma":[0.0008771574,0.0001292421,0.00007879648,0.0008446472,0.00005174936,0.0006041939,0.0006229592,0.0005231028,0.0006850403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003364987,"about_ca_system_score_gemma":0.0001310651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000503077,"about_ca_topic_score_gemma":0.002107731,"domain_scores_codex":[0.9981909,0.0001177965,0.0003002399,0.0005472816,0.0004237577,0.0004200497],"domain_scores_gemma":[0.9973291,0.0001733094,0.00009465657,0.001962809,0.0001824238,0.0002576742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001235102,0.0002708884,0.0006501491,0.000007411521,0.00002942534,0.00000752059,0.001621453,0.003992472,0.01313092,0.004738631,0.3900812,0.5854576],"study_design_scores_gemma":[0.0003209365,0.0001832097,0.001066747,0.000004653922,0.000005381679,0.00002143629,0.0001459767,0.04528658,0.001661926,0.001022946,0.9500282,0.0002519416],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03123469,0.00004527561,0.4827187,0.4765758,0.00563215,0.001389587,0.00001806786,0.0006107294,0.001774982],"genre_scores_gemma":[0.1230921,0.0002018359,0.8206229,0.02780717,0.0122886,0.0001719683,0.0001132293,0.0000942046,0.01560806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5852056,"threshold_uncertainty_score":0.8805035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4322723545","doi":"10.1145/3586165.3586179","title":"A Brief Summary of PODC 2022","year":2023,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Computer science; Operations research; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1689774629311761,"gpt":0.4000661851885368,"spread":0.2310887222573607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00421202,0.00009566813,0.000215978,0.0004539048,0.0001153699,0.0002108684,0.002270246,0.00003246616,0.0007963735],"category_scores_gemma":[0.008581762,0.00007264566,0.0001202102,0.002819484,0.00007491873,0.0002181169,0.001823535,0.00008108012,0.002232915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001319216,"about_ca_system_score_gemma":0.0000494681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002653362,"about_ca_topic_score_gemma":0.00007834443,"domain_scores_codex":[0.997075,0.0001248667,0.0005353556,0.0005978887,0.001389944,0.0002769681],"domain_scores_gemma":[0.9951515,0.001846732,0.0001919214,0.002605377,0.0001092207,0.00009529344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007231474,0.00002106844,0.005640558,0.000002670013,0.000007121537,0.00001238154,0.0001883137,0.00007832815,0.0005494014,0.0004954366,0.8118356,0.1811619],"study_design_scores_gemma":[0.0002579686,0.00004079739,0.04175724,0.000017033,0.000008104659,0.000001748185,0.001202844,0.002278215,0.0005276844,0.02263328,0.9311373,0.00013782],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9292223,0.000181933,0.001444642,0.01049809,0.004283573,0.0003456434,0.000118082,0.0003520938,0.05355368],"genre_scores_gemma":[0.925577,0.00004465766,0.001273332,0.0008756805,0.0001987126,0.000007915954,0.00006603298,0.00001630353,0.07194029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1810241,"threshold_uncertainty_score":0.9997694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012638757","doi":"10.1145/2556663.2556672","title":"Review of computability and complexity theory by Steven Homer and Alan L. Selman","year":2013,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computability, Logic, AI 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":"Computability; Computer science; Computability theory; Mathematical economics; Cognitive science; Programming language; Theoretical computer science; Mathematics; Algorithm; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.02999220050859049,"gpt":0.2634734976997031,"spread":0.2334812971911126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111989,0.0002718862,0.0006270131,0.00005257646,0.0001040864,0.000113014,0.001211673,0.00007828532,0.000130704],"category_scores_gemma":[0.0004385732,0.0002242487,0.00008585516,0.0003064559,0.0004362591,0.0005065165,0.001673492,0.0002099454,0.00002325775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004148497,"about_ca_system_score_gemma":0.00004681661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006000185,"about_ca_topic_score_gemma":0.00002269458,"domain_scores_codex":[0.9975521,0.0005588528,0.000540818,0.0007155002,0.0002869241,0.0003458025],"domain_scores_gemma":[0.996726,0.001037885,0.000219323,0.001600881,0.000177982,0.0002379411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001332192,0.0005987507,0.04843171,0.004580799,0.0001113879,0.000004065279,0.00146428,0.000003581334,0.001266896,0.01349088,0.03527256,0.8947617],"study_design_scores_gemma":[0.001900967,0.0009451715,0.411479,0.001662316,0.00009443658,0.0001273888,0.0001869343,0.01858913,0.001124261,0.525615,0.03660525,0.001670168],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7998368,0.06533333,0.1122102,0.01565432,0.0005723505,0.003569646,0.00005936237,0.0005268389,0.002237211],"genre_scores_gemma":[0.9107381,0.004192112,0.07968601,0.005109626,0.00008628385,0.00005294138,0.00001843603,0.00002810797,0.00008834559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8930916,"threshold_uncertainty_score":0.9144595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904813721","doi":"10.1145/3300150.3300166","title":"SIROCCO 2018 Review","year":2018,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Manitoba","funders":"","keywords":"Milestone; Focus (optics); Library science; Computer science; Telecommunications; History; Archaeology","retraction":null,"screen_n_in":null,"score":{"opus":0.02836137454252424,"gpt":0.2893704127327221,"spread":0.2610090381901979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002484304,0.000142471,0.0002430286,0.00002779905,0.0001135635,0.0001095662,0.001814563,0.00005212509,0.00010855],"category_scores_gemma":[0.0002157854,0.000115533,0.00008419446,0.0004194684,0.00005135605,0.0004354299,0.0003399799,0.00009128285,0.002424948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002594039,"about_ca_system_score_gemma":0.00005402728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008276314,"about_ca_topic_score_gemma":0.00002416072,"domain_scores_codex":[0.9987315,0.00005500937,0.0002887481,0.0003738163,0.0002451407,0.0003058211],"domain_scores_gemma":[0.9978651,0.00005785829,0.0001187677,0.001727402,0.0001074525,0.0001234285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000201421,0.00003955219,0.0003107935,0.0001308343,0.0000147473,0.00001464787,0.0001277314,2.710396e-7,0.0007687555,0.005984868,0.8550878,0.137518],"study_design_scores_gemma":[0.0001464451,0.00008403251,0.0006557321,0.000468605,0.000005547628,0.00002267848,0.000004824821,0.0002684587,0.0005819364,0.0009074339,0.9966661,0.0001881979],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01064815,0.06074658,0.6616669,0.05317003,0.009135554,0.002078849,0.00006255408,0.001840659,0.2006508],"genre_scores_gemma":[0.8843875,0.006790813,0.04419627,0.05061491,0.003007049,0.0001184126,0.00003304605,0.0000603312,0.01079165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8737394,"threshold_uncertainty_score":0.9983518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}