{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Hassan Masum","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001897228,0.00183199,0.002256269,0.004444188,0.001140322,0.004640731,0.001851934,0.001990382,0.02647661],"category_scores_gemma":[0.00479216,0.00137993,0.001395647,0.00766128,0.002485655,0.006354757,0.002041895,0.005584049,0.02942073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002533322,"about_ca_system_score_gemma":0.00347028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00312948,"about_ca_topic_score_gemma":0.003436591,"domain_scores_codex":[0.998472,0.0002199643,0.0001174458,0.0002830454,0.0008137481,0.00009372486],"domain_scores_gemma":[0.9979218,0.0008705949,0.00014356,0.0001124721,0.000788232,0.0001634026],"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.00002350867,0.00002419511,0.0001642826,0.002936885,0.00003773339,0.00005871429,0.000175352,0.001547427,0.0002673852,0.04199668,0.6760308,0.276737],"study_design_scores_gemma":[0.000004305541,0.00001774127,0.0003040183,0.001085922,0.000008390635,0.0002253595,0.00005183378,0.0003313,0.00006612025,0.01341855,0.9844686,0.0000177251],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"commentary","genre_scores_codex":[0.0002936714,0.9447398,0.01094311,0.009952157,0.01100272,0.00003960573,0.0004503354,0.0002491938,0.02232933],"genre_scores_gemma":[0.002924379,0.9343678,0.008987641,0.003061677,0.01154446,0.0001106489,0.001014177,0.0003203611,0.03766904],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.02647661,"threshold_uncertainty_score":0.0885731,"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","authors":[{"name":"Dan Alistarh","is_ca":false},{"name":"Rati Gelashvili","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003861179,0.001379779,0.001361884,0.001748899,0.001618023,0.003543909,0.003345049,0.002748443,0.008053949],"category_scores_gemma":[0.01465229,0.0009252434,0.001760172,0.002990758,0.004325238,0.006510296,0.004534166,0.006819522,0.002336762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002635218,"about_ca_system_score_gemma":0.002107915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103117,"about_ca_topic_score_gemma":0.001285031,"domain_scores_codex":[0.9966069,0.001166437,0.0001649098,0.0006890238,0.001124627,0.0002480605],"domain_scores_gemma":[0.9926029,0.00505718,0.0002957562,0.001030173,0.0007694291,0.0002445488],"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.00001993317,0.00002785245,0.0002357471,0.0002262574,0.00003221427,0.00004543859,0.0001526703,0.014278,0.0001660262,0.9391629,0.006185332,0.03946776],"study_design_scores_gemma":[0.00003030674,0.00002619508,0.0001413553,0.0001051075,0.00002111647,0.00009220913,0.00005194917,0.0479811,0.0001645942,0.8780268,0.07334056,0.00001882573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006129992,0.04969748,0.8291168,0.01560486,0.001876245,0.0001411611,0.0003093546,0.0003789619,0.09674516],"genre_scores_gemma":[0.2850692,0.1109496,0.5313735,0.007728835,0.01048533,0.001334989,0.001323547,0.0006846816,0.05105026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008053949,"threshold_uncertainty_score":0.02694315,"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","authors":[{"name":"Arkadev Chattopadhyay","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006126476,0.0004785554,0.0007670178,0.001103628,0.00576112,0.008341799,0.001179464,0.003205404,0.0149777],"category_scores_gemma":[0.02224209,0.0005429369,0.0007929187,0.001727863,0.02047609,0.01935698,0.005673678,0.01030642,0.002845023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005051304,"about_ca_system_score_gemma":0.002005262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004919573,"about_ca_topic_score_gemma":0.002894724,"domain_scores_codex":[0.9939535,0.003007131,0.0001570987,0.0008175772,0.001556557,0.0005080324],"domain_scores_gemma":[0.9861749,0.01002626,0.0003876504,0.001488312,0.001222206,0.0007006975],"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.00002303914,0.000005147939,0.00008495343,0.00003861646,0.000008175936,0.00003420078,0.0007820066,0.000182214,0.00003816577,0.8876374,0.1018866,0.009279506],"study_design_scores_gemma":[0.00001109273,0.000008305792,0.0001158626,0.00006637955,0.000004327776,0.00009561035,0.0004870685,0.0003302269,0.0001080671,0.6654398,0.333323,0.00001025446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.008721997,0.03914833,0.02693396,0.4641861,0.008859237,0.00002224892,0.000660705,0.000250457,0.4512169],"genre_scores_gemma":[0.7291931,0.03148777,0.01125237,0.07796231,0.01750309,0.0002136903,0.0007400699,0.0009466668,0.130701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0149777,"threshold_uncertainty_score":0.05010539,"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","authors":[{"name":"Anne Broadbent","is_ca":true},{"name":"Alain Tapp","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004417304,0.000736941,0.001204057,0.001015032,0.002288501,0.003941299,0.001651245,0.003816247,0.01400008],"category_scores_gemma":[0.01384794,0.0007383019,0.001014274,0.00151122,0.00742114,0.02197619,0.002887819,0.00530357,0.004061214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002400473,"about_ca_system_score_gemma":0.001527184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001871941,"about_ca_topic_score_gemma":0.001455723,"domain_scores_codex":[0.9978635,0.0009647749,0.00007071984,0.0002356946,0.0005608179,0.0003044813],"domain_scores_gemma":[0.9924693,0.005506949,0.0002109272,0.001016033,0.0005415435,0.0002553152],"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.00002426337,0.00003420699,0.0001503785,0.0002295936,0.00002502899,0.00004471105,0.0001529788,0.001534034,0.0001587524,0.9424501,0.02008327,0.03511268],"study_design_scores_gemma":[0.00001441673,0.00001283099,0.00006696103,0.0000860389,0.000005856064,0.00003637429,0.00008668799,0.002190156,0.0001395741,0.9536027,0.04374805,0.00001030647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.01401799,0.1711695,0.2189024,0.3960394,0.01303443,0.00008597699,0.0002386758,0.0009279969,0.1855837],"genre_scores_gemma":[0.5649473,0.2107435,0.1004361,0.048542,0.02191603,0.0003971715,0.000303174,0.0007144248,0.05200038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01400008,"threshold_uncertainty_score":0.04683495,"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","authors":[{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001183158,0.001086523,0.001158117,0.00398363,0.0005764359,0.002373936,0.001509526,0.001164942,0.08560733],"category_scores_gemma":[0.005930221,0.0004232121,0.0008856255,0.005431921,0.0009379033,0.002935669,0.0009791235,0.001436279,0.03344306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002181856,"about_ca_system_score_gemma":0.001628123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001353828,"about_ca_topic_score_gemma":0.002459908,"domain_scores_codex":[0.9986206,0.0003017693,0.00008568152,0.0002071344,0.0006978422,0.00008689728],"domain_scores_gemma":[0.9971763,0.000991688,0.0001910247,0.0003541049,0.001114422,0.0001724136],"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.00004360768,0.00003446679,0.0002608444,0.004144267,0.0001047136,0.00006729824,0.00006074628,0.0008463904,0.0006417606,0.0952898,0.3839822,0.5145239],"study_design_scores_gemma":[0.000007651229,0.0000235289,0.0002139843,0.0008026112,0.0000295501,0.0002001291,0.00002811713,0.0001092052,0.0002454821,0.02092922,0.9774008,0.000009649625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.001894351,0.6030648,0.03112561,0.0074975,0.008341264,0.0002400447,0.002169292,0.0005774272,0.3450896],"genre_scores_gemma":[0.03671516,0.7652435,0.01802815,0.005947661,0.007467559,0.0003796683,0.004544666,0.0005054928,0.1611682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.08560733,"threshold_uncertainty_score":0.286385,"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","authors":[{"name":"Jeffrey Shallit","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001327884,0.0008731534,0.001736079,0.0006075311,0.001858421,0.006413227,0.002503327,0.002394283,0.0131512],"category_scores_gemma":[0.01115892,0.0007573023,0.001852609,0.001737021,0.002730907,0.01136057,0.002706479,0.004146403,0.001683153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002786993,"about_ca_system_score_gemma":0.002652238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004939316,"about_ca_topic_score_gemma":0.003999476,"domain_scores_codex":[0.9973927,0.0007600882,0.0001314107,0.0006677367,0.0004295862,0.0006185856],"domain_scores_gemma":[0.988328,0.009375589,0.0006599055,0.0009117515,0.0003579024,0.0003668193],"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.002483499,0.00063391,0.005341987,0.001431148,0.0002758014,0.000725658,0.001172087,0.3946915,0.007847982,0.4054501,0.05517032,0.124776],"study_design_scores_gemma":[0.0002192795,0.00007732529,0.001003707,0.00004495786,0.00009394791,0.000230991,0.000437109,0.3729408,0.003590065,0.6150324,0.00627909,0.0000502353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6182916,0.002108659,0.2705338,0.02409434,0.0003860244,0.0003934594,0.00637214,0.002540161,0.07527985],"genre_scores_gemma":[0.9182099,0.0009519185,0.05709566,0.0008534924,0.0004654061,0.000366483,0.004045395,0.0004085505,0.01760338],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0131512,"threshold_uncertainty_score":0.04399514,"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","authors":[{"name":"Hassan Masum","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433861,0.000831863,0.001242502,0.003500904,0.0008600209,0.004200911,0.001837497,0.001115286,0.01793121],"category_scores_gemma":[0.004533867,0.001025948,0.001023697,0.009584611,0.001287719,0.005394053,0.0009064884,0.003251358,0.02101092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001817119,"about_ca_system_score_gemma":0.002861942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004520331,"about_ca_topic_score_gemma":0.006522722,"domain_scores_codex":[0.998475,0.000110484,0.0001473431,0.0002196164,0.0009584558,0.00008915334],"domain_scores_gemma":[0.9967397,0.001125328,0.0001792918,0.0001666053,0.001586862,0.0002021978],"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.00002244538,0.00003611247,0.0001625677,0.001769296,0.00002143574,0.00004733216,0.00006985374,0.001127872,0.001200086,0.01603458,0.5115037,0.4680048],"study_design_scores_gemma":[0.000003948961,0.00002120831,0.0004614279,0.0005225824,0.000008592935,0.0002588288,0.00002905179,0.0007157829,0.0003615445,0.005874012,0.9917257,0.00001734649],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.001425399,0.7443246,0.127493,0.01906897,0.03008274,0.000131911,0.001681621,0.002586463,0.07320522],"genre_scores_gemma":[0.007645756,0.6672813,0.1172514,0.0117805,0.01565681,0.0002455969,0.004563474,0.002937963,0.1726373],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01793121,"threshold_uncertainty_score":0.05998594,"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","authors":[{"name":"K. Alagarsamy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008415806,0.0007756433,0.0007607308,0.002326892,0.003248343,0.003841969,0.002545337,0.003911887,0.0038785],"category_scores_gemma":[0.02152486,0.0006339532,0.0008711648,0.002581703,0.01625266,0.02038206,0.002484619,0.01039017,0.001753647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002315626,"about_ca_system_score_gemma":0.001053548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008421354,"about_ca_topic_score_gemma":0.0003717705,"domain_scores_codex":[0.9960205,0.001762532,0.0002332614,0.0005943333,0.001171855,0.0002173949],"domain_scores_gemma":[0.9852244,0.01124826,0.0004587651,0.001137342,0.001639615,0.0002916955],"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.00003619117,0.00003775167,0.0001764595,0.0001617793,0.00001248478,0.00005049911,0.0007155777,0.001243704,0.0001074485,0.9545797,0.01813684,0.02474149],"study_design_scores_gemma":[0.00001392965,0.00002046999,0.00009129012,0.0001292117,0.000005954334,0.0001208186,0.0001883103,0.001430453,0.0001519686,0.9362398,0.06159037,0.00001744674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.02230985,0.2190485,0.2085492,0.3465156,0.01379246,0.0001202749,0.0003777349,0.0004955177,0.188791],"genre_scores_gemma":[0.5127792,0.200861,0.1122243,0.07411799,0.05538606,0.0006163145,0.0004241777,0.0006594227,0.04293162],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.008415806,"threshold_uncertainty_score":0.04450756,"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","authors":[{"name":"Alejandro López-Ortíz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562844,0.0004217753,0.0005197803,0.002572409,0.002108918,0.004760867,0.001041317,0.001947369,0.009862914],"category_scores_gemma":[0.005815632,0.0004283389,0.0008320779,0.002422692,0.004161797,0.01003169,0.002857595,0.003126979,0.001774816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001451402,"about_ca_system_score_gemma":0.001338131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001415594,"about_ca_topic_score_gemma":0.001049407,"domain_scores_codex":[0.9982966,0.0005595646,0.00009369776,0.0002654968,0.0006037859,0.0001808823],"domain_scores_gemma":[0.996986,0.001827856,0.0001808694,0.0004565582,0.0004041778,0.0001445201],"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.000002072402,0.000004264028,0.00005194273,0.00001777639,0.000002487971,0.0000112418,0.00002601801,0.0010909,0.00002830551,0.994578,0.001029099,0.003157781],"study_design_scores_gemma":[0.00000282333,0.000002461047,0.00004201327,0.00001824198,0.000002078226,0.00002701485,0.00002487927,0.003527605,0.00003463394,0.9857734,0.01054155,0.000003251918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04365284,0.01641467,0.5919115,0.02319989,0.001057617,0.0001182221,0.0007280644,0.0004518285,0.3224653],"genre_scores_gemma":[0.7874504,0.02608642,0.1427733,0.003508498,0.004128627,0.000475479,0.00141821,0.0002471536,0.03391193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009862914,"threshold_uncertainty_score":0.03299469,"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","authors":[{"name":"Wojciech Golab","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01093919,0.00178611,0.001399426,0.002364075,0.003176633,0.007067823,0.004343834,0.003304569,0.02097677],"category_scores_gemma":[0.05751134,0.001841011,0.004934195,0.002210734,0.007265264,0.01826978,0.01369297,0.01027028,0.005868962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004051532,"about_ca_system_score_gemma":0.005661902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003644255,"about_ca_topic_score_gemma":0.003035996,"domain_scores_codex":[0.9852216,0.002552173,0.0009710331,0.002892285,0.005967677,0.002395333],"domain_scores_gemma":[0.9375768,0.03967018,0.002656097,0.006962692,0.0116192,0.00151513],"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.0001062058,0.000130728,0.00130364,0.0005304095,0.0000752966,0.0005111224,0.0006045226,0.01145422,0.002812467,0.9307562,0.02310061,0.02861446],"study_design_scores_gemma":[0.00008721765,0.00006506616,0.0002076224,0.0001283936,0.00005274482,0.0002930121,0.0002458718,0.03248467,0.004475319,0.9249135,0.03700491,0.00004172256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01342789,0.0007144301,0.8992668,0.008405701,0.0008912777,0.0003410527,0.001731099,0.005275622,0.06994613],"genre_scores_gemma":[0.5160457,0.002408867,0.4284417,0.01416951,0.003115745,0.002163863,0.006330343,0.003400212,0.023924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02097677,"threshold_uncertainty_score":0.07017434,"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","authors":[{"name":"Susanna F. de Rezende","is_ca":false},{"name":"Mika Göös","is_ca":false},{"name":"Robert Robere","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001323557,0.000978495,0.0011187,0.002515263,0.001649705,0.007458034,0.001800395,0.001757779,0.7896928],"category_scores_gemma":[0.01011669,0.0004927123,0.0007291312,0.002869099,0.0006048653,0.00424625,0.002477906,0.003244669,0.7245606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255254,"about_ca_system_score_gemma":0.002189207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001374488,"about_ca_topic_score_gemma":0.002892392,"domain_scores_codex":[0.9986745,0.000113551,0.00007700307,0.0002964872,0.0006489514,0.000189495],"domain_scores_gemma":[0.9924964,0.001050365,0.0004632967,0.0007301487,0.002545484,0.002714237],"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.00001564251,0.000009840548,0.00004042643,0.00004743619,0.000001126769,0.00001071344,0.00000356188,0.00001749623,0.00008262145,0.0009658806,0.9837177,0.0150876],"study_design_scores_gemma":[0.000007111857,0.000008353461,0.0001498336,0.00005573912,0.000001395547,0.0000383561,0.00001243823,0.00004695912,0.0001024528,0.0009748227,0.9985984,0.000004187062],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.0008128294,0.008820985,0.003101353,0.03783147,0.202196,0.0002490616,0.02153503,0.003449158,0.7220041],"genre_scores_gemma":[0.002506721,0.003582747,0.0006951373,0.008594166,0.02936878,0.00009543906,0.007826141,0.001634325,0.9456966],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.7896928,"threshold_uncertainty_score":0.2999777,"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","authors":[{"name":"Hassan Masum","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712109,0.0009146071,0.001101299,0.001394944,0.0007016647,0.002970709,0.001494785,0.001645138,0.01238874],"category_scores_gemma":[0.003441272,0.0006317632,0.0007858097,0.003407635,0.001456461,0.004440672,0.0006581735,0.003428597,0.01300189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001792905,"about_ca_system_score_gemma":0.002123468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003562174,"about_ca_topic_score_gemma":0.00471415,"domain_scores_codex":[0.9993494,0.0001257931,0.00005657151,0.0001006931,0.00031492,0.00005262636],"domain_scores_gemma":[0.9983765,0.0007309507,0.0001072989,0.00006884996,0.0006144705,0.0001018269],"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.00002695226,0.00004662724,0.0001064184,0.003117374,0.00005593097,0.000046036,0.00008904206,0.003705461,0.0005233053,0.03509418,0.5867714,0.3704174],"study_design_scores_gemma":[0.000004187153,0.00002523311,0.0002175353,0.0008086936,0.00001189225,0.0001374754,0.0000497063,0.000836792,0.0001739818,0.01606004,0.981655,0.0000194679],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0004856495,0.912636,0.0223774,0.0168027,0.01166777,0.00004430107,0.0001655913,0.0002262344,0.03559431],"genre_scores_gemma":[0.007531764,0.8855262,0.02530751,0.01310171,0.0135986,0.00008458697,0.0004629553,0.0003320198,0.05405472],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01238874,"threshold_uncertainty_score":0.04144448,"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)","authors":[{"name":"Adrian Dumitrescu","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005702214,0.001479211,0.001747166,0.00356471,0.001356277,0.005939492,0.001281313,0.001180041,0.6872373],"category_scores_gemma":[0.003671232,0.0006669152,0.001143423,0.005233189,0.0009052029,0.003136478,0.002176392,0.003012761,0.552609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002419345,"about_ca_system_score_gemma":0.00204724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002691819,"about_ca_topic_score_gemma":0.006879499,"domain_scores_codex":[0.9988548,0.00008658574,0.0000652389,0.0002983207,0.0005953707,0.00009974952],"domain_scores_gemma":[0.9971294,0.0005036839,0.0001120312,0.0004419578,0.001182858,0.0006301941],"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.000006846884,0.000008470058,0.00003795582,0.00008091429,0.000002941213,0.00001131901,0.000005061471,0.00007015523,0.0001679718,0.004097367,0.9646705,0.0308404],"study_design_scores_gemma":[0.00000267637,0.000007067694,0.0001567432,0.00007556906,0.00000194749,0.000046412,0.000008333563,0.00005409497,0.00008455806,0.001415862,0.9981427,0.000003992082],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0004932935,0.01427198,0.00603459,0.01601164,0.0651021,0.0001143307,0.01041211,0.003086918,0.884473],"genre_scores_gemma":[0.002883776,0.01102385,0.002585975,0.003808137,0.01888182,0.00009715435,0.01035691,0.002717237,0.9476451],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6872373,"threshold_uncertainty_score":0.4461181,"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","authors":[{"name":"Borzoo Bonakdarpour","is_ca":true},{"name":"Sandeep S. Kulkarni","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001964506,0.0009424983,0.0007939356,0.001099709,0.00106801,0.001890888,0.001456759,0.00121242,0.00359481],"category_scores_gemma":[0.01143937,0.0006811377,0.001871013,0.0007230717,0.001939385,0.003341182,0.002695961,0.00206807,0.0007442712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002236451,"about_ca_system_score_gemma":0.001929008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002758586,"about_ca_topic_score_gemma":0.00303062,"domain_scores_codex":[0.9974921,0.0008613474,0.0001618669,0.0003766333,0.000927413,0.0001807551],"domain_scores_gemma":[0.993436,0.004304772,0.0004675813,0.001218128,0.0004998266,0.00007373019],"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.0001797102,0.0001454329,0.00156905,0.0005142762,0.00009015061,0.0005353784,0.0007576569,0.4588496,0.01578221,0.3467245,0.006554795,0.1682971],"study_design_scores_gemma":[0.00004947312,0.00002925081,0.000101153,0.00004329876,0.0000247323,0.0001142633,0.00006852646,0.7871644,0.008205045,0.1952697,0.008911403,0.00001869549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006696342,0.0001099658,0.9882783,0.0003155696,0.00001964076,0.00006219727,0.00007513377,0.003145878,0.00129695],"genre_scores_gemma":[0.297235,0.0003832367,0.6962972,0.0001849084,0.00004950027,0.0003821586,0.0006096722,0.0009649462,0.003893307],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00359481,"threshold_uncertainty_score":0.01622671,"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Pooya Hatami","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001617591,0.0008036033,0.001197448,0.002031204,0.001720575,0.008449832,0.001449314,0.001926218,0.0658062],"category_scores_gemma":[0.01389991,0.000628044,0.0008407043,0.002962739,0.003449533,0.009978368,0.002311876,0.008712237,0.01169902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003300615,"about_ca_system_score_gemma":0.001619255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001660606,"about_ca_topic_score_gemma":0.001394315,"domain_scores_codex":[0.9984371,0.0003353023,0.00007137903,0.0004891946,0.0004548148,0.0002122239],"domain_scores_gemma":[0.9804965,0.01270356,0.001093686,0.00165777,0.002127506,0.001921031],"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.0001850132,0.00006073362,0.001400174,0.0002598732,0.00002873239,0.0000971351,0.0001848529,0.002607021,0.000632062,0.6237206,0.3438712,0.02695255],"study_design_scores_gemma":[0.00004993163,0.00005397106,0.001874287,0.0002536153,0.00003333977,0.0002794674,0.0001799703,0.01449901,0.001533495,0.8513771,0.1297946,0.00007106402],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"commentary","genre_scores_codex":[0.05230857,0.02796792,0.1924372,0.3189347,0.05964383,0.0001189759,0.008357851,0.002551386,0.3376795],"genre_scores_gemma":[0.6748016,0.01961057,0.0417081,0.02561105,0.09034359,0.0004004218,0.005763272,0.002579492,0.1391819],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.0658062,"threshold_uncertainty_score":0.2201437,"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","authors":[{"name":"Jonathan F. Buss","is_ca":true},{"name":"Tarique Islam","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005960337,0.001141832,0.001558793,0.001967003,0.001941639,0.009423194,0.006188314,0.003555135,0.01035602],"category_scores_gemma":[0.04886815,0.001260937,0.002620664,0.002774469,0.008167988,0.02716626,0.005976649,0.01095126,0.001377127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00545745,"about_ca_system_score_gemma":0.002007487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456695,"about_ca_topic_score_gemma":0.0006923513,"domain_scores_codex":[0.9882401,0.003892783,0.0006296597,0.00243219,0.003527942,0.001277208],"domain_scores_gemma":[0.9482599,0.03838626,0.001729627,0.008741604,0.001996959,0.000885594],"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.0000829648,0.00005241714,0.0005764544,0.0002305189,0.00005391162,0.0000776988,0.0002576841,0.03012159,0.0006847795,0.9502895,0.00336287,0.01420953],"study_design_scores_gemma":[0.00001390823,0.00001230656,0.0001590041,0.00003300077,0.00001290329,0.00005394016,0.00005141315,0.0223024,0.0005517681,0.9737709,0.00301958,0.00001882441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09504716,0.003929635,0.7986341,0.01124715,0.0004018203,0.0003075459,0.001465827,0.0008645703,0.08810213],"genre_scores_gemma":[0.875819,0.003785977,0.1003118,0.001138855,0.001091694,0.0009789155,0.00226019,0.0006802934,0.01393332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01035602,"threshold_uncertainty_score":0.03959674,"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","authors":[{"name":"Lane A. Hemaspaandra","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002813165,0.002256779,0.001456173,0.002857397,0.003686658,0.01193384,0.00170084,0.003793733,0.3335015],"category_scores_gemma":[0.009213739,0.001013995,0.001224007,0.003387225,0.001357588,0.005869917,0.002114251,0.006943341,0.1883954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006281151,"about_ca_system_score_gemma":0.004439464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01838673,"about_ca_topic_score_gemma":0.03430089,"domain_scores_codex":[0.997253,0.0003728592,0.0001364912,0.0003686993,0.00158054,0.0002884321],"domain_scores_gemma":[0.9926461,0.001712558,0.0002890574,0.0009894399,0.003152112,0.001210666],"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.000005790417,0.000007451376,0.00001945018,0.00001925341,0.000001725979,0.00000572018,0.000002796532,0.00002819467,0.00001465767,0.001574278,0.9941161,0.004204613],"study_design_scores_gemma":[0.00001387995,0.000009599271,0.0002132626,0.00006232897,0.00000464314,0.00002279169,0.00002052639,0.0002192984,0.00008996837,0.002807506,0.9965292,0.000007103214],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0008156893,0.01097331,0.004527991,0.1463824,0.09526317,0.0001454379,0.01313192,0.002617185,0.7261429],"genre_scores_gemma":[0.00738422,0.007976718,0.002084985,0.01824621,0.03519519,0.0002342725,0.009665887,0.001649877,0.9175625],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3335015,"threshold_uncertainty_score":0.9506793,"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","authors":[{"name":"Eowyn Čenek","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304438,0.001052648,0.001281569,0.004102358,0.001356087,0.003322802,0.001684168,0.002577281,0.01732131],"category_scores_gemma":[0.006006624,0.0006633425,0.0006331058,0.004945676,0.002597939,0.005602412,0.001468589,0.007119433,0.01868851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003670533,"about_ca_system_score_gemma":0.002257763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004153693,"about_ca_topic_score_gemma":0.004103734,"domain_scores_codex":[0.9991781,0.0001930261,0.00004809903,0.0002117652,0.0003065806,0.00006238722],"domain_scores_gemma":[0.9954903,0.00253581,0.0001816897,0.0001729738,0.001187619,0.0004316523],"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.0000199348,0.00001788407,0.0001051577,0.0009549824,0.00001393697,0.00004060487,0.00007775697,0.0002032834,0.00007666448,0.02059602,0.903189,0.07470472],"study_design_scores_gemma":[0.000003826784,0.000005088536,0.0001888605,0.0007476552,0.000006208037,0.0001376094,0.00003017431,0.00006094727,0.00002565605,0.007049497,0.9917356,0.000008891389],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0002047822,0.9111924,0.001299796,0.05185863,0.0222382,0.000008765788,0.0001657109,0.00007616056,0.01295555],"genre_scores_gemma":[0.004649647,0.8912576,0.001407582,0.02968626,0.04827143,0.00003018867,0.0004330939,0.0002113123,0.02405288],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01732131,"threshold_uncertainty_score":0.05794561,"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","authors":[{"name":"Reza Dorrigiv","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01327874,0.002746006,0.001885557,0.004768992,0.002313443,0.01140124,0.008309741,0.006566255,0.01464246],"category_scores_gemma":[0.04180233,0.001498624,0.003397502,0.006324686,0.01093225,0.02740899,0.006358724,0.01163984,0.003790543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006688314,"about_ca_system_score_gemma":0.003414461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004928293,"about_ca_topic_score_gemma":0.004563726,"domain_scores_codex":[0.985198,0.007737561,0.0009387156,0.001962542,0.0032025,0.0009607027],"domain_scores_gemma":[0.9657722,0.02339149,0.002255453,0.004339658,0.00327338,0.0009679107],"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.00001455515,0.0000376584,0.0002769918,0.0001424587,0.00001482316,0.00004611092,0.0001725546,0.01319798,0.0000908212,0.9743397,0.003788978,0.007877285],"study_design_scores_gemma":[0.00001272639,0.00004823013,0.0001421392,0.0001480935,0.00002312536,0.0001195639,0.00017342,0.08797617,0.0002177584,0.8849065,0.02619936,0.00003303243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004204426,0.004096457,0.9421282,0.01109589,0.0006275953,0.0001742463,0.0003088259,0.0003027129,0.0370616],"genre_scores_gemma":[0.2292544,0.01444023,0.7144022,0.005886181,0.004429859,0.001590063,0.000777038,0.0009421474,0.02827787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01464246,"threshold_uncertainty_score":0.07022554,"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","authors":[{"name":"Lila Kari","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002189747,0.0005724023,0.0007513368,0.001950622,0.002406363,0.005883224,0.000965892,0.002203895,0.05969157],"category_scores_gemma":[0.007920522,0.0004780338,0.0009565149,0.001645733,0.006486391,0.01312406,0.003751724,0.004258255,0.01523806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003306122,"about_ca_system_score_gemma":0.001874283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002180487,"about_ca_topic_score_gemma":0.001686679,"domain_scores_codex":[0.9976434,0.000763129,0.0001114932,0.0004968077,0.0007943278,0.0001908377],"domain_scores_gemma":[0.9948511,0.002251774,0.0001095813,0.001255549,0.001043319,0.0004887934],"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.00003533692,0.00001489433,0.0001564748,0.0001083257,0.00001302541,0.00005107819,0.0005105289,0.000386231,0.0003729144,0.7948702,0.1549027,0.04857828],"study_design_scores_gemma":[0.000006264517,0.00001103601,0.000143749,0.0001074097,0.000004731105,0.00008227397,0.0001555418,0.0007039576,0.0001493491,0.4657035,0.5329199,0.00001213201],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"review","genre_scores_codex":[0.008617339,0.08062619,0.06641965,0.1490327,0.0253208,0.00005474111,0.001105346,0.001468082,0.6673551],"genre_scores_gemma":[0.2819215,0.06809297,0.01827818,0.02626322,0.02900573,0.0001968382,0.001109881,0.001781296,0.5733504],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.05969157,"threshold_uncertainty_score":0.1996882,"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","authors":[{"name":"Ben Lee Volk","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002332581,0.001557703,0.001199744,0.001934151,0.00317898,0.0117839,0.001677856,0.003956044,0.1833019],"category_scores_gemma":[0.007870903,0.0009061361,0.00115929,0.002152656,0.002318568,0.005272954,0.00183967,0.009552484,0.07983409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006646135,"about_ca_system_score_gemma":0.002670804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009185853,"about_ca_topic_score_gemma":0.01555479,"domain_scores_codex":[0.9976259,0.0004161466,0.0001315357,0.0004135036,0.001166272,0.0002465928],"domain_scores_gemma":[0.9943263,0.001935384,0.0002475565,0.0008856375,0.001900378,0.0007046969],"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.00002483518,0.00002331989,0.00008320589,0.00007402307,0.0000115003,0.0000235961,0.000009458132,0.000175953,0.00006329433,0.01982222,0.9667374,0.01295113],"study_design_scores_gemma":[0.00002821278,0.00001712601,0.0003097639,0.0001153288,0.00001346616,0.00005007815,0.00002906455,0.0008767596,0.0002954356,0.01943573,0.9788114,0.00001760665],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.00168197,0.01727975,0.01054368,0.2289719,0.1029942,0.00012829,0.005789849,0.001778861,0.6308317],"genre_scores_gemma":[0.03983611,0.01887322,0.008774146,0.03899147,0.07755193,0.0004071771,0.005923181,0.001987806,0.807655],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.1833019,"threshold_uncertainty_score":0.613206,"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","authors":[{"name":"George Grätzer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007208484,0.0004099139,0.0009904141,0.007420231,0.0007743263,0.003969607,0.001091107,0.001616909,0.009135957],"category_scores_gemma":[0.02392715,0.0003839497,0.0007009532,0.005653956,0.00274847,0.005883244,0.001929002,0.002050002,0.003074462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004295201,"about_ca_system_score_gemma":0.00806697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003892594,"about_ca_topic_score_gemma":0.006018162,"domain_scores_codex":[0.994242,0.001424787,0.0005011862,0.0003739683,0.003197911,0.0002601189],"domain_scores_gemma":[0.9760274,0.006654956,0.001331597,0.001344998,0.01364547,0.0009955078],"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.00004026162,0.00001210583,0.0003002986,0.00313951,0.00007292532,0.0001191465,0.0002326883,0.0002563849,0.0005122916,0.06196437,0.7636375,0.1697125],"study_design_scores_gemma":[0.000007671511,0.00001290515,0.0003977092,0.001546051,0.00003405474,0.000177223,0.0001127604,0.0001073554,0.0001369573,0.01791249,0.9795415,0.00001331869],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0009912312,0.838633,0.006684819,0.06840263,0.05011874,0.00006519655,0.0002365489,0.0001412554,0.03472658],"genre_scores_gemma":[0.02956083,0.8561459,0.005159858,0.02050373,0.04573009,0.0001603203,0.0006525664,0.0002331806,0.04185356],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.009135957,"threshold_uncertainty_score":0.03812253,"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","authors":[{"name":"Marek Chrobák","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005720941,0.001014041,0.0008051298,0.001418721,0.001177711,0.00556081,0.001404732,0.001918875,0.660831],"category_scores_gemma":[0.002192655,0.0004065714,0.0005570854,0.001848744,0.0004482126,0.002821656,0.001299047,0.001603156,0.6595793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001975552,"about_ca_system_score_gemma":0.001586428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005250327,"about_ca_topic_score_gemma":0.009047839,"domain_scores_codex":[0.9994676,0.00004012279,0.00003848934,0.000161066,0.0002307172,0.00006210937],"domain_scores_gemma":[0.9987877,0.0001090235,0.00005190138,0.0002465449,0.0005867318,0.0002181265],"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.0000299207,0.00001843037,0.0001410544,0.00006776784,0.000003707598,0.00002968078,0.00001664861,0.00006680245,0.0001810415,0.004899545,0.9269802,0.06756522],"study_design_scores_gemma":[0.000003752485,0.00000692552,0.0001878949,0.00004774136,0.000001737439,0.00003704711,0.00001785556,0.00007972604,0.00009545472,0.001144788,0.9983737,0.000003284094],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001029559,0.005896254,0.004917401,0.01138946,0.01553428,0.0001250875,0.01835719,0.002772524,0.9399783],"genre_scores_gemma":[0.002706037,0.003101059,0.001515026,0.002393104,0.001095665,0.00005193468,0.01097681,0.0004403704,0.97772],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.339169,"threshold_uncertainty_score":0,"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","authors":[{"name":"Elena Grigorescu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002552921,0.001426392,0.001327929,0.001876451,0.00232691,0.006481255,0.001864938,0.00346461,0.03791168],"category_scores_gemma":[0.008579062,0.0009542929,0.0009780402,0.002290373,0.002829919,0.00556996,0.001945927,0.01017618,0.0161949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003939576,"about_ca_system_score_gemma":0.002498002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006558517,"about_ca_topic_score_gemma":0.00866218,"domain_scores_codex":[0.9977925,0.0005116626,0.0001454573,0.0002837511,0.001008331,0.0002583376],"domain_scores_gemma":[0.9919741,0.004416055,0.0003893377,0.001087749,0.001554717,0.0005781187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001085641,0.00005750886,0.0002348729,0.0003482732,0.00004800716,0.00009161266,0.00003605122,0.002059446,0.0008900799,0.1329339,0.808911,0.05428069],"study_design_scores_gemma":[0.0000795716,0.00009717367,0.0007823459,0.0002581436,0.00004776348,0.000307117,0.00005950347,0.01673257,0.002609458,0.1484343,0.8305097,0.00008238948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.007824214,0.05696055,0.1626272,0.2283227,0.08916197,0.000332173,0.008453229,0.003703054,0.4426149],"genre_scores_gemma":[0.2508235,0.08503436,0.1036349,0.06033181,0.09849565,0.001476342,0.01465079,0.003408371,0.3821444],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.03791168,"threshold_uncertainty_score":0.1268272,"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","authors":[{"name":"George Grätzer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07635216,0.002437926,0.005997791,0.006520136,0.007498296,0.01219093,0.007849481,0.05380642,0.01251488],"category_scores_gemma":[0.3003857,0.002392439,0.0038751,0.006042577,0.007202403,0.007354994,0.005211162,0.0471211,0.01620228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01422389,"about_ca_system_score_gemma":0.02451792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007006545,"about_ca_topic_score_gemma":0.0107457,"domain_scores_codex":[0.9399335,0.01550836,0.009806954,0.005618388,0.02672195,0.002410776],"domain_scores_gemma":[0.6846128,0.1246446,0.02495445,0.009011714,0.1418021,0.01497431],"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.00002403633,0.000004994877,0.00004919833,0.0002219797,0.00002300632,0.00005020558,0.00003122659,0.00001112516,0.00003695561,0.0004058153,0.9970445,0.002096842],"study_design_scores_gemma":[0.00007024655,0.00003848647,0.0006172099,0.001155136,0.00006959069,0.0002814145,0.0001814237,0.0001077953,0.0001143335,0.001740202,0.9955375,0.00008660232],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.0000554449,0.005248022,0.000419554,0.7464367,0.2466227,0.00008978396,0.0001446384,0.00008242372,0.0009008093],"genre_scores_gemma":[0.0007892159,0.002648126,0.0007384325,0.9128062,0.07834084,0.0003562823,0.00006578847,0.0001270648,0.004127967],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.07635216,"threshold_uncertainty_score":0.4037937,"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","authors":[{"name":"Naama Ben-David","is_ca":false},{"name":"Yi‐Jun Chang","is_ca":false},{"name":"Michal Dory","is_ca":false},{"name":"Dean Leitersdorf","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002364082,0.001129168,0.001056085,0.003949082,0.00195528,0.007654525,0.002717423,0.003147722,0.336486],"category_scores_gemma":[0.01073052,0.0005329199,0.0009262684,0.004403252,0.000696758,0.005362861,0.003292235,0.003633528,0.3398212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003997013,"about_ca_system_score_gemma":0.007088786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006013629,"about_ca_topic_score_gemma":0.00931791,"domain_scores_codex":[0.9980745,0.0001973035,0.0001728265,0.0002548118,0.001026412,0.0002739852],"domain_scores_gemma":[0.9909746,0.0006582846,0.0003414805,0.0004967344,0.005715701,0.001813155],"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.00002565609,0.00001734923,0.00004642817,0.0004532656,0.000004672468,0.00003317413,0.00001076029,0.00004899556,0.0001164508,0.001868598,0.919633,0.07774157],"study_design_scores_gemma":[0.000002415968,0.000005952648,0.0000801265,0.0001976014,0.000002275035,0.00003251082,0.000009661502,0.00001046447,0.00002719268,0.0002237219,0.9994051,0.000002903475],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"review","genre_scores_codex":[0.0008966479,0.140262,0.004982183,0.05660413,0.212381,0.0006154829,0.008551351,0.003392418,0.5723149],"genre_scores_gemma":[0.004916273,0.1520656,0.002852122,0.03122395,0.03312748,0.0004590627,0.01446069,0.001705794,0.759189],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.336486,"threshold_uncertainty_score":0.9464223,"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","authors":[{"name":"Marek Chrobák","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002742911,0.001691664,0.001642468,0.002618275,0.002527097,0.01153761,0.002099844,0.002957544,0.2452688],"category_scores_gemma":[0.0108216,0.0007071074,0.001179113,0.003620868,0.001133823,0.006499067,0.001516328,0.005995537,0.1960862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002660491,"about_ca_system_score_gemma":0.002730254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005010864,"about_ca_topic_score_gemma":0.01400203,"domain_scores_codex":[0.9978254,0.0003455853,0.0001364892,0.0002915557,0.001195799,0.0002052795],"domain_scores_gemma":[0.9882059,0.003112361,0.0006575742,0.001109575,0.004753969,0.002160599],"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.00001462323,0.00001649648,0.00002979179,0.00002183898,0.000002844066,0.000006113498,0.000001908083,0.00005222108,0.00002944602,0.0008845613,0.988381,0.01055923],"study_design_scores_gemma":[0.00001619169,0.00002505066,0.0002510892,0.00007119351,0.000007136913,0.00004229685,0.00002458557,0.000563334,0.000131323,0.001925276,0.9969292,0.00001332237],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00137028,0.02460225,0.01783669,0.1721745,0.3839515,0.0004092378,0.01346028,0.004935957,0.3812593],"genre_scores_gemma":[0.006366319,0.01435988,0.01130491,0.03677741,0.1555179,0.0003030987,0.00847276,0.003256558,0.7636412],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.2452688,"threshold_uncertainty_score":0.820506,"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","authors":[{"name":"Dan Alistarh","is_ca":false},{"name":"Alkida Balliu","is_ca":false},{"name":"Dimitrios Los","is_ca":false},{"name":"Sean Ovens","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006232443,0.00139243,0.0009664789,0.006075362,0.002570446,0.01252445,0.002443919,0.003462221,0.229031],"category_scores_gemma":[0.01262059,0.0007735957,0.00106961,0.006406346,0.0005055052,0.004070776,0.003815666,0.003762857,0.2249581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004060232,"about_ca_system_score_gemma":0.009572497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009632142,"about_ca_topic_score_gemma":0.01457769,"domain_scores_codex":[0.9958474,0.0004552488,0.0003346248,0.0003408176,0.002390123,0.0006317715],"domain_scores_gemma":[0.9870646,0.0008379348,0.0004555308,0.0006742081,0.007445106,0.00352266],"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.00004872102,0.00004917855,0.00009205997,0.0003182787,0.000003304317,0.00003888021,0.000008130964,0.00008726584,0.0002013163,0.0008950077,0.9560763,0.0421815],"study_design_scores_gemma":[0.000006968318,0.00001881956,0.0003259737,0.0001215495,0.000002138265,0.00003510883,0.00001186989,0.00003850777,0.00008704863,0.0001924634,0.9991529,0.000006624019],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"commentary","genre_scores_codex":[0.001559281,0.03222093,0.01089841,0.03886758,0.2526366,0.002872691,0.03016364,0.006571076,0.6242098],"genre_scores_gemma":[0.006993618,0.02784006,0.007904029,0.03296315,0.05092555,0.00252336,0.05611938,0.003508667,0.8112222],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.229031,"threshold_uncertainty_score":0.7661849,"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","authors":[{"name":"Jeffrey Shallit","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002223744,0.0009951328,0.001344638,0.004115337,0.0008297501,0.002529336,0.001115401,0.001397303,0.007008914],"category_scores_gemma":[0.006522932,0.0006790228,0.000614597,0.006944288,0.002963586,0.005719086,0.001272691,0.005266705,0.005699156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002863928,"about_ca_system_score_gemma":0.002567905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003663824,"about_ca_topic_score_gemma":0.004455995,"domain_scores_codex":[0.9988261,0.000296812,0.00007533424,0.000207112,0.0005157926,0.00007881435],"domain_scores_gemma":[0.9944652,0.002927804,0.0002741086,0.0001769461,0.001762538,0.0003933956],"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.00005591506,0.00003043359,0.0002181596,0.002699433,0.00005414498,0.00004435897,0.0001426432,0.0005855762,0.0003240799,0.06241736,0.779479,0.1539489],"study_design_scores_gemma":[0.000009908676,0.00002066251,0.0004117441,0.001142023,0.00001799877,0.0001283265,0.00006577586,0.0002062902,0.0001397103,0.03101586,0.9668254,0.0000163935],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0001572799,0.9577714,0.001025612,0.03085065,0.005365298,0.000005707428,0.00004759069,0.00001629047,0.004760236],"genre_scores_gemma":[0.004260176,0.9658486,0.0007379684,0.0056705,0.01605632,0.00001570776,0.0001255006,0.00003943616,0.007245854],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.007008914,"threshold_uncertainty_score":0.02344716,"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","authors":[{"name":"Avery Miller","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662804,0.0008237212,0.001312391,0.004856224,0.0008167124,0.003369062,0.001535308,0.002030133,0.05279494],"category_scores_gemma":[0.007085585,0.0003968223,0.0007280948,0.004207331,0.0006909592,0.002459992,0.001585348,0.002007632,0.02509248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00260565,"about_ca_system_score_gemma":0.006424473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003549826,"about_ca_topic_score_gemma":0.005007287,"domain_scores_codex":[0.9991243,0.0001452525,0.0001323311,0.0001655549,0.0003313901,0.0001011663],"domain_scores_gemma":[0.9961969,0.001115487,0.0004663288,0.0001502705,0.001606269,0.0004647429],"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.0001209136,0.00003230397,0.0002895731,0.01266733,0.00007223979,0.0003026421,0.0001010464,0.000125602,0.0005406178,0.004046166,0.5096422,0.4720595],"study_design_scores_gemma":[0.000005105641,0.0000127106,0.0003292372,0.002854229,0.00002384645,0.0002869878,0.00002207271,0.000007941789,0.00005388008,0.0003609016,0.9960377,0.000005287714],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00021179,0.970443,0.0002570984,0.007812502,0.007924308,0.00003837785,0.0006206715,0.00006520279,0.01262701],"genre_scores_gemma":[0.002232836,0.9667197,0.0004553099,0.009006259,0.007250266,0.00006257846,0.001143736,0.00004218949,0.01308711],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.05279494,"threshold_uncertainty_score":0.1766167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}