{"meta":{"query_hash":"71a680768c21","filters":{"venue":"ACM SIGACT News"},"cohort_total":30,"direct_labels_cover":0,"predictions_cover":30,"exported":30,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/71a680768c21","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+SIGACT+News"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Completeness (order theory); Computer science; Mathematics; Theoretical computer science; Algorithm; Calculus (dental); Mathematical analysis","score_opus":0.11419205458326208,"score_gpt":0.3186488220123281,"score_spread":0.204456767429066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970277269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09504716,0.0039296346,0.79863405,0.011247152,0.00040182026,0.00030754585,0.0014658269,0.00086457026,0.08810213],"genre_scores_gemma":[0.87581897,0.0037859771,0.10031181,0.0011388551,0.0010916942,0.0009789155,0.0022601897,0.0006802934,0.013933319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882401,0.0038927826,0.0006296597,0.00243219,0.0035279419,0.0012772082],"domain_scores_gemma":[0.94825995,0.03838626,0.0017296273,0.008741604,0.0019969593,0.000885594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005960337,0.0011418322,0.0015587927,0.001967003,0.0019416385,0.009423194,0.006188314,0.003555135,0.010356025],"category_scores_gemma":[0.04886815,0.0012609372,0.0026206644,0.0027744689,0.008167988,0.02716626,0.005976649,0.010951264,0.0013771266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000829648,0.000052417137,0.0005764544,0.00023051888,0.000053911623,0.0000776988,0.00025768406,0.030121595,0.00068477954,0.95028955,0.0033628698,0.014209531],"study_design_scores_gemma":[0.000013908234,0.000012306557,0.00015900412,0.000033000768,0.000012903287,0.000053940163,0.000051413153,0.022302397,0.00055176805,0.9737709,0.0030195802,0.000018824407],"about_ca_topic_score_codex":0.0014566947,"about_ca_topic_score_gemma":0.00069235126,"teacher_disagreement_score":0.010356025,"about_ca_system_score_codex":0.0054574497,"about_ca_system_score_gemma":0.0020074865,"threshold_uncertainty_score":0.039596736},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05217211995221574,"score_gpt":0.3271956880794476,"score_spread":0.27502356812723183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973442596","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014253993,0.7443246,0.127493,0.019068966,0.03008274,0.00013191096,0.0016816208,0.0025864635,0.07320522],"genre_scores_gemma":[0.0076457555,0.66728127,0.11725136,0.011780504,0.01565681,0.00024559692,0.004563474,0.0029379628,0.17263731],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998475,0.00011048399,0.0001473431,0.0002196164,0.0009584558,0.00008915334],"domain_scores_gemma":[0.9967397,0.0011253285,0.00017929183,0.00016660533,0.0015868623,0.00020219781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014338605,0.000831863,0.001242502,0.003500904,0.00086002087,0.004200911,0.0018374972,0.0011152857,0.017931212],"category_scores_gemma":[0.004533867,0.0010259476,0.0010236966,0.009584611,0.0012877188,0.0053940527,0.0009064884,0.0032513584,0.021010917],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002244538,0.000036112473,0.00016256774,0.0017692964,0.000021435737,0.00004733216,0.00006985374,0.001127872,0.0012000863,0.016034583,0.5115037,0.46800476],"study_design_scores_gemma":[0.0000039489614,0.000021208312,0.00046142793,0.00052258244,0.000008592935,0.00025882883,0.000029051786,0.0007157829,0.00036154446,0.0058740117,0.9917257,0.000017346489],"about_ca_topic_score_codex":0.0045203306,"about_ca_topic_score_gemma":0.0065227216,"teacher_disagreement_score":0.017931212,"about_ca_system_score_codex":0.0018171187,"about_ca_system_score_gemma":0.002861942,"threshold_uncertainty_score":0.059985936},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.054009181967706786,"score_gpt":0.30892744113052567,"score_spread":0.2549182591628189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984231426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004204426,0.0040964573,0.94212824,0.011095885,0.0006275953,0.00017424634,0.00030882587,0.00030271287,0.0370616],"genre_scores_gemma":[0.22925441,0.014440233,0.7144022,0.005886181,0.0044298586,0.0015900625,0.00077703805,0.0009421474,0.028277868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98519796,0.007737561,0.00093871565,0.0019625423,0.0032024996,0.00096070266],"domain_scores_gemma":[0.96577215,0.023391485,0.0022554528,0.004339658,0.00327338,0.00096791075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013278741,0.0027460062,0.0018855571,0.0047689923,0.0023134428,0.011401235,0.008309741,0.0065662554,0.014642464],"category_scores_gemma":[0.04180233,0.0014986235,0.003397502,0.006324686,0.010932248,0.027408993,0.006358724,0.011639843,0.003790543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014555149,0.000037658396,0.0002769918,0.00014245865,0.000014823156,0.000046110916,0.00017255459,0.013197985,0.000090821195,0.9743397,0.0037889783,0.007877285],"study_design_scores_gemma":[0.000012726394,0.000048230133,0.00014213922,0.00014809347,0.000023125363,0.000119563854,0.00017342005,0.08797617,0.00021775844,0.8849065,0.026199356,0.00003303243],"about_ca_topic_score_codex":0.0049282927,"about_ca_topic_score_gemma":0.004563726,"teacher_disagreement_score":0.014642464,"about_ca_system_score_codex":0.0066883136,"about_ca_system_score_gemma":0.0034144612,"threshold_uncertainty_score":0.07022554},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027139177761183967,"score_gpt":0.2068266196016482,"score_spread":0.17968744184046423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003926749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61829156,0.0021086594,0.27053383,0.024094336,0.00038602442,0.00039345943,0.0063721403,0.0025401614,0.075279854],"genre_scores_gemma":[0.91820985,0.0009519185,0.057095658,0.0008534924,0.0004654061,0.00036648297,0.004045395,0.00040855052,0.01760338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739265,0.00076008815,0.0001314107,0.00066773675,0.00042958622,0.00061858556],"domain_scores_gemma":[0.98832804,0.009375589,0.00065990555,0.0009117515,0.00035790238,0.0003668193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278845,0.00087315345,0.0017360788,0.00060753105,0.0018584207,0.0064132274,0.0025033273,0.0023942832,0.013151196],"category_scores_gemma":[0.011158921,0.00075730233,0.0018526089,0.0017370211,0.002730907,0.011360574,0.0027064788,0.004146403,0.0016831525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002483499,0.00063391,0.0053419867,0.0014311482,0.00027580143,0.000725658,0.0011720874,0.39469153,0.007847982,0.40545008,0.055170316,0.12477601],"study_design_scores_gemma":[0.00021927948,0.00007732529,0.0010037073,0.000044957862,0.000093947914,0.00023099098,0.00043710903,0.37294084,0.0035900648,0.61503243,0.0062790904,0.000050235303],"about_ca_topic_score_codex":0.0049393163,"about_ca_topic_score_gemma":0.0039994763,"teacher_disagreement_score":0.013151196,"about_ca_system_score_codex":0.0027869933,"about_ca_system_score_gemma":0.0026522384,"threshold_uncertainty_score":0.043995142},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029992200508590493,"score_gpt":0.2634734976997031,"score_spread":0.23348129719111257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012638757","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015727988,0.95777136,0.0010256122,0.030850654,0.0053652977,0.000005707428,0.00004759069,0.000016290473,0.004760236],"genre_scores_gemma":[0.004260176,0.9658486,0.0007379684,0.0056705005,0.016056316,0.000015707757,0.00012550058,0.00003943616,0.0072458535],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988261,0.00029681204,0.00007533424,0.00020711198,0.0005157926,0.00007881435],"domain_scores_gemma":[0.9944652,0.0029278037,0.00027410858,0.00017694607,0.0017625381,0.0003933956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022237443,0.0009951328,0.0013446376,0.004115337,0.0008297501,0.0025293361,0.0011154006,0.001397303,0.0070089144],"category_scores_gemma":[0.0065229316,0.0006790228,0.000614597,0.0069442885,0.0029635855,0.0057190857,0.0012726907,0.005266705,0.0056991563],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055915058,0.00003043359,0.00021815956,0.0026994327,0.000054144984,0.000044358974,0.00014264324,0.00058557617,0.0003240799,0.062417362,0.779479,0.15394889],"study_design_scores_gemma":[0.0000099086765,0.000020662508,0.00041174405,0.0011420228,0.000017998766,0.00012832646,0.000065775865,0.00020629025,0.00013971029,0.031015856,0.96682537,0.000016393502],"about_ca_topic_score_codex":0.0036638237,"about_ca_topic_score_gemma":0.004455995,"teacher_disagreement_score":0.0070089144,"about_ca_system_score_codex":0.0028639284,"about_ca_system_score_gemma":0.0025679048,"threshold_uncertainty_score":0.023447156},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Computer science; Column (typography); Information retrieval; Library science; Telecommunications; Geography; Archaeology","score_opus":0.018760005216208242,"score_gpt":0.25688321969390127,"score_spread":0.23812321447769302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027982484","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010295594,0.0058962544,0.004917401,0.011389464,0.01553428,0.00012508748,0.018357186,0.0027725245,0.9399783],"genre_scores_gemma":[0.002706037,0.0031010592,0.0015150256,0.0023931041,0.0010956649,0.000051934676,0.010976814,0.0004403704,0.97772],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946755,0.000040122788,0.00003848934,0.00016106597,0.00023071724,0.00006210937],"domain_scores_gemma":[0.9987877,0.000109023495,0.00005190138,0.00024654492,0.00058673177,0.00021812653],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005720941,0.0010140409,0.0008051298,0.0014187214,0.0011777113,0.0055608097,0.001404732,0.0019188748,0.66083103],"category_scores_gemma":[0.0021926549,0.00040657137,0.0005570854,0.0018487435,0.0004482126,0.002821656,0.001299047,0.0016031563,0.65957934],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029920699,0.000018430372,0.0001410544,0.00006776784,0.000003707598,0.000029680778,0.000016648613,0.00006680245,0.00018104147,0.004899545,0.9269802,0.06756522],"study_design_scores_gemma":[0.000003752485,0.00000692552,0.00018789491,0.000047741356,0.0000017374389,0.000037047106,0.000017855557,0.00007972604,0.00009545472,0.0011447883,0.99837375,0.000003284094],"about_ca_topic_score_codex":0.0052503273,"about_ca_topic_score_gemma":0.009047839,"teacher_disagreement_score":0.33916897,"about_ca_system_score_codex":0.0019755522,"about_ca_system_score_gemma":0.001586428,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Congruence relation; Lattice (music); Mathematics; Pure mathematics; Physics","score_opus":0.0288947469895576,"score_gpt":0.25715995591052787,"score_spread":0.22826520892097027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030729535","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009912312,0.838633,0.006684819,0.06840263,0.05011874,0.000065196546,0.00023654895,0.00014125535,0.03472658],"genre_scores_gemma":[0.02956083,0.85614586,0.0051598577,0.02050373,0.04573009,0.00016032033,0.0006525664,0.00023318063,0.041853562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994242,0.0014247868,0.0005011862,0.0003739683,0.0031979107,0.00026011886],"domain_scores_gemma":[0.97602737,0.0066549564,0.0013315968,0.0013449978,0.01364547,0.0009955078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007208484,0.00040991392,0.0009904141,0.007420231,0.00077432627,0.003969607,0.0010911074,0.0016169093,0.009135957],"category_scores_gemma":[0.023927147,0.0003839497,0.00070095324,0.0056539564,0.00274847,0.005883244,0.0019290018,0.0020500019,0.003074462],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040261624,0.00001210583,0.00030029856,0.0031395103,0.000072925315,0.00011914652,0.00023268831,0.00025638493,0.00051229156,0.06196437,0.7636375,0.16971248],"study_design_scores_gemma":[0.000007671511,0.000012905152,0.0003977092,0.0015460508,0.000034054745,0.00017722303,0.00011276042,0.00010735537,0.00013695729,0.017912494,0.9795415,0.000013318692],"about_ca_topic_score_codex":0.003892594,"about_ca_topic_score_gemma":0.0060181622,"teacher_disagreement_score":0.009135957,"about_ca_system_score_codex":0.004295201,"about_ca_system_score_gemma":0.00806697,"threshold_uncertainty_score":0.038122535},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02205290292875095,"score_gpt":0.2866052760490196,"score_spread":0.26455237312026864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033427227","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013702803,0.02460225,0.017836694,0.17217447,0.38395151,0.00040923778,0.013460283,0.0049359575,0.38125932],"genre_scores_gemma":[0.006366319,0.01435988,0.011304907,0.036777414,0.15551794,0.0003030987,0.00847276,0.0032565582,0.7636412],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978254,0.00034558534,0.0001364892,0.00029155565,0.0011957989,0.00020527946],"domain_scores_gemma":[0.9882059,0.0031123608,0.00065757416,0.001109575,0.0047539687,0.002160599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027429108,0.0016916639,0.0016424677,0.0026182751,0.0025270972,0.011537609,0.002099844,0.0029575443,0.24526884],"category_scores_gemma":[0.010821603,0.0007071074,0.0011791127,0.0036208683,0.0011338228,0.0064990674,0.0015163284,0.0059955367,0.19608623],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014623231,0.000016496484,0.000029791787,0.00002183898,0.0000028440659,0.0000061134983,0.000001908083,0.000052221083,0.000029446022,0.00088456133,0.988381,0.010559225],"study_design_scores_gemma":[0.000016191687,0.000025050664,0.0002510892,0.000071193506,0.000007136913,0.00004229685,0.00002458557,0.000563334,0.00013132296,0.0019252758,0.9969292,0.000013322374],"about_ca_topic_score_codex":0.005010864,"about_ca_topic_score_gemma":0.014002028,"teacher_disagreement_score":0.24526884,"about_ca_system_score_codex":0.0026604913,"about_ca_system_score_gemma":0.0027302539,"threshold_uncertainty_score":0.820506},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Intuition; Algorithm; Presentation (obstetrics); Context (archaeology); Computational geometry; Artificial intelligence; Cognitive science","score_opus":0.009808366371430902,"score_gpt":0.25924742868575046,"score_spread":0.24943906231431956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050666081","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002936714,0.94473976,0.010943108,0.009952157,0.011002716,0.00003960573,0.00045033536,0.00024919384,0.022329327],"genre_scores_gemma":[0.0029243787,0.9343678,0.008987641,0.0030616769,0.01154446,0.000110648856,0.0010141769,0.00032036105,0.037669044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847203,0.00021996432,0.00011744582,0.00028304537,0.0008137481,0.00009372486],"domain_scores_gemma":[0.99792176,0.00087059493,0.00014356003,0.000112472095,0.00078823196,0.00016340264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001897228,0.0018319904,0.0022562686,0.0044441875,0.0011403217,0.0046407315,0.0018519344,0.001990382,0.026476614],"category_scores_gemma":[0.00479216,0.0013799301,0.0013956466,0.00766128,0.0024856545,0.006354757,0.002041895,0.005584049,0.029420733],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023508674,0.000024195106,0.0001642826,0.002936885,0.000037733393,0.00005871429,0.00017535202,0.0015474268,0.00026738524,0.041996684,0.6760308,0.27673703],"study_design_scores_gemma":[0.000004305541,0.000017741271,0.00030401826,0.0010859222,0.000008390635,0.00022535953,0.00005183378,0.00033130002,0.00006612025,0.013418554,0.98446864,0.000017725104],"about_ca_topic_score_codex":0.0031294804,"about_ca_topic_score_gemma":0.0034365912,"teacher_disagreement_score":0.026476614,"about_ca_system_score_codex":0.0025333224,"about_ca_system_score_gemma":0.00347028,"threshold_uncertainty_score":0.0885731},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07385197257358649,"score_gpt":0.3362033393574469,"score_spread":0.2623513667838604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050766540","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055444903,0.005248022,0.00041955395,0.74643666,0.24662273,0.00008978396,0.0001446384,0.00008242372,0.0009008093],"genre_scores_gemma":[0.0007892159,0.0026481259,0.0007384325,0.9128062,0.078340836,0.00035628225,0.000065788474,0.00012706482,0.004127967],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.93993354,0.015508362,0.009806954,0.005618388,0.026721945,0.002410776],"domain_scores_gemma":[0.68461275,0.12464462,0.024954453,0.009011714,0.14180213,0.014974311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.076352164,0.0024379257,0.005997791,0.0065201363,0.007498296,0.012190934,0.007849481,0.053806417,0.012514885],"category_scores_gemma":[0.30038574,0.0023924387,0.0038750998,0.006042577,0.0072024027,0.0073549943,0.0052111624,0.047121104,0.016202278],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002403633,0.0000049948767,0.000049198334,0.00022197972,0.000023006318,0.000050205585,0.000031226587,0.000011125161,0.000036955607,0.00040581526,0.9970445,0.002096842],"study_design_scores_gemma":[0.00007024655,0.00003848647,0.0006172099,0.0011551359,0.00006959069,0.00028141448,0.0001814237,0.00010779529,0.00011433349,0.0017402024,0.9955375,0.00008660232],"about_ca_topic_score_codex":0.007006545,"about_ca_topic_score_gemma":0.010745696,"teacher_disagreement_score":0.076352164,"about_ca_system_score_codex":0.014223889,"about_ca_system_score_gemma":0.024517922,"threshold_uncertainty_score":0.4037937},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06339484273346335,"score_gpt":0.34172868629628994,"score_spread":0.2783338435628266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058294560","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048564948,0.91263604,0.022377403,0.016802704,0.011667771,0.000044301072,0.00016559131,0.00022623438,0.035594314],"genre_scores_gemma":[0.0075317635,0.8855262,0.025307506,0.013101706,0.0135985995,0.00008458697,0.00046295527,0.00033201984,0.054054722],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993494,0.00012579314,0.000056571513,0.00010069308,0.00031492,0.000052626358],"domain_scores_gemma":[0.9983765,0.0007309507,0.000107298874,0.000068849964,0.0006144705,0.00010182695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712109,0.00091460714,0.0011012994,0.0013949436,0.0007016647,0.0029707092,0.0014947853,0.0016451378,0.012388736],"category_scores_gemma":[0.0034412718,0.0006317632,0.0007858097,0.003407635,0.001456461,0.004440672,0.00065817346,0.003428597,0.013001894],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002695226,0.00004662724,0.000106418374,0.0031173741,0.00005593097,0.000046036002,0.00008904206,0.003705461,0.0005233053,0.03509418,0.58677137,0.3704174],"study_design_scores_gemma":[0.000004187153,0.00002523311,0.00021753534,0.00080869364,0.0000118922535,0.00013747536,0.0000497063,0.000836792,0.0001739818,0.016060041,0.981655,0.000019467903],"about_ca_topic_score_codex":0.003562174,"about_ca_topic_score_gemma":0.00471415,"teacher_disagreement_score":0.012388736,"about_ca_system_score_codex":0.001792905,"about_ca_system_score_gemma":0.002123468,"threshold_uncertainty_score":0.04144448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Citation; Computer science; Automaton; World Wide Web; Information retrieval; Theoretical computer science","score_opus":0.01063045978310218,"score_gpt":0.23367709942396253,"score_spread":0.22304663964086036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077566826","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008617339,0.08062619,0.066419646,0.14903274,0.025320798,0.00005474111,0.0011053459,0.0014680823,0.6673551],"genre_scores_gemma":[0.28192154,0.06809297,0.018278176,0.026263224,0.02900573,0.0001968382,0.0011098813,0.0017812961,0.57335037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976434,0.000763129,0.000111493166,0.0004968077,0.00079432776,0.00019083775],"domain_scores_gemma":[0.99485105,0.0022517738,0.00010958127,0.0012555488,0.0010433189,0.0004887934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002189747,0.00057240226,0.0007513368,0.0019506216,0.0024063634,0.0058832243,0.00096589205,0.0022038952,0.059691567],"category_scores_gemma":[0.007920522,0.0004780338,0.0009565149,0.0016457333,0.006486391,0.013124063,0.0037517245,0.004258255,0.015238063],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003533692,0.000014894328,0.0001564748,0.00010832565,0.000013025414,0.00005107819,0.0005105289,0.00038623097,0.0003729144,0.7948702,0.15490265,0.04857828],"study_design_scores_gemma":[0.000006264517,0.000011036012,0.000143749,0.00010740972,0.000004731105,0.000082273975,0.00015554184,0.0007039576,0.00014934907,0.46570355,0.53291994,0.000012132011],"about_ca_topic_score_codex":0.002180487,"about_ca_topic_score_gemma":0.0016866785,"teacher_disagreement_score":0.059691567,"about_ca_system_score_codex":0.003306122,"about_ca_system_score_gemma":0.0018742826,"threshold_uncertainty_score":0.1996882},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021400278794100717,"score_gpt":0.30653905061984493,"score_spread":0.2851387718257442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086999408","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002047822,0.9111924,0.0012997962,0.05185863,0.022238197,0.000008765788,0.0001657109,0.000076160555,0.012955552],"genre_scores_gemma":[0.0046496466,0.89125764,0.0014075817,0.029686265,0.048271425,0.00003018867,0.00043309393,0.0002113123,0.024052883],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991781,0.00019302612,0.000048099027,0.00021176516,0.00030658056,0.00006238722],"domain_scores_gemma":[0.99549025,0.0025358102,0.0001816897,0.00017297381,0.0011876186,0.00043165233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013044378,0.0010526477,0.0012815687,0.0041023577,0.0013560866,0.0033228023,0.0016841679,0.0025772806,0.017321315],"category_scores_gemma":[0.006006624,0.00066334254,0.0006331058,0.0049456763,0.0025979385,0.0056024124,0.0014685888,0.0071194326,0.018688511],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019934801,0.000017884067,0.00010515772,0.0009549824,0.000013936975,0.00004060487,0.000077756966,0.00020328339,0.00007666448,0.020596024,0.903189,0.07470472],"study_design_scores_gemma":[0.0000038267835,0.0000050885365,0.00018886049,0.00074765517,0.0000062080367,0.00013760942,0.00003017431,0.000060947274,0.000025656052,0.0070494968,0.99173564,0.000008891389],"about_ca_topic_score_codex":0.0041536926,"about_ca_topic_score_gemma":0.0041037337,"teacher_disagreement_score":0.017321315,"about_ca_system_score_codex":0.003670533,"about_ca_system_score_gemma":0.0022577634,"threshold_uncertainty_score":0.05794561},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.036596624647452204,"score_gpt":0.24102023511922727,"score_spread":0.20442361047177507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095409339","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008721997,0.039148334,0.026933959,0.4641861,0.008859237,0.000022248918,0.000660705,0.00025045697,0.45121688],"genre_scores_gemma":[0.7291931,0.03148777,0.011252367,0.07796231,0.017503088,0.00021369026,0.0007400699,0.00094666675,0.13070098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939535,0.003007131,0.00015709874,0.00081757724,0.0015565567,0.00050803245],"domain_scores_gemma":[0.98617494,0.010026261,0.00038765042,0.001488312,0.001222206,0.0007006975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006126476,0.0004785554,0.00076701783,0.0011036278,0.0057611205,0.0083417995,0.0011794639,0.0032054042,0.014977699],"category_scores_gemma":[0.022242092,0.0005429369,0.0007929187,0.0017278625,0.020476088,0.01935698,0.005673678,0.010306418,0.0028450233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002303914,0.0000051479387,0.00008495343,0.000038616465,0.000008175936,0.000034200777,0.0007820066,0.00018221402,0.00003816577,0.8876374,0.10188659,0.009279506],"study_design_scores_gemma":[0.000011092734,0.000008305792,0.00011586265,0.00006637955,0.000004327776,0.00009561035,0.0004870685,0.00033022693,0.00010806715,0.6654398,0.33332297,0.0000102544645],"about_ca_topic_score_codex":0.004919573,"about_ca_topic_score_gemma":0.002894724,"teacher_disagreement_score":0.014977699,"about_ca_system_score_codex":0.0050513037,"about_ca_system_score_gemma":0.0020052618,"threshold_uncertainty_score":0.050105393},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01872739838913388,"score_gpt":0.2595506680645361,"score_spread":0.2408232696754022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100677024","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02230985,0.21904847,0.20854919,0.3465156,0.0137924645,0.000120274875,0.00037773492,0.00049551774,0.18879096],"genre_scores_gemma":[0.5127792,0.20086098,0.11222429,0.07411799,0.055386063,0.00061631453,0.00042417774,0.0006594227,0.042931624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960205,0.0017625324,0.00023326135,0.00059433334,0.0011718546,0.00021739487],"domain_scores_gemma":[0.98522437,0.011248256,0.0004587651,0.001137342,0.0016396148,0.00029169547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008415806,0.00077564333,0.00076073076,0.0023268922,0.0032483432,0.003841969,0.0025453374,0.003911887,0.0038784996],"category_scores_gemma":[0.021524861,0.0006339532,0.0008711648,0.0025817035,0.016252657,0.020382063,0.002484619,0.010390168,0.0017536466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036191173,0.00003775167,0.00017645952,0.00016177926,0.000012484776,0.000050499108,0.0007155777,0.001243704,0.00010744853,0.9545797,0.018136838,0.024741486],"study_design_scores_gemma":[0.000013929648,0.000020469986,0.000091290116,0.00012921165,0.0000059543336,0.0001208186,0.00018831031,0.0014304527,0.00015196856,0.9362398,0.061590374,0.000017446735],"about_ca_topic_score_codex":0.0008421354,"about_ca_topic_score_gemma":0.0003717705,"teacher_disagreement_score":0.008415806,"about_ca_system_score_codex":0.0023156262,"about_ca_system_score_gemma":0.0010535482,"threshold_uncertainty_score":0.044507563},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.02655385791581369,"score_gpt":0.2750105416370427,"score_spread":0.248456683721229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102047759","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049329345,0.014271979,0.00603459,0.01601164,0.0651021,0.000114330665,0.010412115,0.0030869176,0.88447297],"genre_scores_gemma":[0.002883776,0.011023849,0.0025859755,0.0038081366,0.018881822,0.00009715435,0.010356911,0.0027172372,0.9476451],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885476,0.00008658574,0.0000652389,0.00029832067,0.00059537066,0.000099749515],"domain_scores_gemma":[0.9971294,0.0005036839,0.00011203116,0.00044195785,0.0011828579,0.00063019415],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005702214,0.0014792109,0.0017471662,0.0035647103,0.0013562766,0.0059394925,0.0012813135,0.0011800409,0.68723726],"category_scores_gemma":[0.0036712321,0.0006669152,0.0011434229,0.0052331886,0.0009052029,0.0031364784,0.0021763917,0.0030127612,0.55260897],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006846884,0.000008470058,0.000037955822,0.000080914295,0.0000029412126,0.0000113190135,0.0000050614713,0.00007015523,0.00016797183,0.004097367,0.96467054,0.0308404],"study_design_scores_gemma":[0.0000026763696,0.0000070676942,0.00015674319,0.000075569056,0.0000019474903,0.000046412002,0.000008333563,0.00005409497,0.00008455806,0.0014158615,0.9981427,0.0000039920824],"about_ca_topic_score_codex":0.0026918193,"about_ca_topic_score_gemma":0.006879499,"teacher_disagreement_score":0.68723726,"about_ca_system_score_codex":0.0024193448,"about_ca_system_score_gemma":0.0020472403,"threshold_uncertainty_score":0.44611806},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027501235408923044,"score_gpt":0.2247213540626842,"score_spread":0.19722011865376116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116601704","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008156893,0.010973311,0.004527991,0.14638238,0.09526317,0.00014543791,0.013131918,0.0026171848,0.72614294],"genre_scores_gemma":[0.00738422,0.007976718,0.002084985,0.018246211,0.035195187,0.00023427246,0.009665887,0.0016498766,0.91756254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997253,0.00037285924,0.00013649119,0.00036869934,0.0015805397,0.00028843206],"domain_scores_gemma":[0.9926461,0.0017125575,0.00028905735,0.0009894399,0.0031521125,0.0012106657],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028131653,0.0022567788,0.0014561727,0.0028573968,0.0036866579,0.011933838,0.0017008398,0.003793733,0.33350146],"category_scores_gemma":[0.009213739,0.001013995,0.0012240065,0.0033872246,0.0013575876,0.0058699166,0.0021142513,0.0069433413,0.18839538],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005790417,0.0000074513764,0.000019450177,0.000019253408,0.0000017259786,0.0000057201796,0.0000027965323,0.000028194672,0.000014657672,0.001574278,0.99411607,0.004204613],"study_design_scores_gemma":[0.00001387995,0.000009599271,0.00021326255,0.00006232897,0.0000046431396,0.000022791692,0.000020526388,0.00021929837,0.00008996837,0.0028075061,0.99652916,0.0000071032136],"about_ca_topic_score_codex":0.01838673,"about_ca_topic_score_gemma":0.03430089,"teacher_disagreement_score":0.33350146,"about_ca_system_score_codex":0.0062811514,"about_ca_system_score_gemma":0.0044394643,"threshold_uncertainty_score":0.9506793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0418212947630007,"score_gpt":0.29590166991256667,"score_spread":0.25408037514956594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128257486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006696342,0.00010996582,0.9882783,0.00031556963,0.000019640756,0.00006219727,0.00007513377,0.003145878,0.0012969497],"genre_scores_gemma":[0.29723504,0.00038323668,0.6962972,0.00018490841,0.00004950027,0.00038215859,0.0006096722,0.0009649462,0.0038933067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974921,0.00086134736,0.00016186692,0.00037663334,0.000927413,0.00018075513],"domain_scores_gemma":[0.993436,0.004304772,0.00046758127,0.0012181277,0.0004998266,0.00007373019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019645062,0.00094249827,0.0007939356,0.0010997086,0.0010680096,0.001890888,0.0014567593,0.0012124198,0.00359481],"category_scores_gemma":[0.011439365,0.00068113767,0.0018710133,0.0007230717,0.0019393852,0.003341182,0.002695961,0.0020680695,0.00074427115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017971016,0.00014543292,0.0015690499,0.00051427615,0.00009015061,0.0005353784,0.0007576569,0.4588496,0.015782211,0.3467245,0.006554795,0.16829713],"study_design_scores_gemma":[0.000049473125,0.00002925081,0.00010115295,0.00004329876,0.000024732304,0.000114263334,0.00006852646,0.7871644,0.008205045,0.19526969,0.008911403,0.000018695488],"about_ca_topic_score_codex":0.0027585863,"about_ca_topic_score_gemma":0.00303062,"teacher_disagreement_score":0.00359481,"about_ca_system_score_codex":0.0022364513,"about_ca_system_score_gemma":0.0019290082,"threshold_uncertainty_score":0.016226709},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018880003593253408,"score_gpt":0.2381378307352617,"score_spread":0.2192578271420083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157209735","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01401799,0.17116949,0.21890238,0.39603943,0.013034432,0.000085976986,0.00023867583,0.0009279969,0.18558367],"genre_scores_gemma":[0.5649473,0.21074347,0.100436084,0.048541997,0.021916034,0.00039717153,0.00030317396,0.0007144248,0.052000377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978635,0.0009647749,0.00007071984,0.00023569458,0.0005608179,0.00030448133],"domain_scores_gemma":[0.99246925,0.0055069486,0.00021092723,0.0010160325,0.0005415435,0.0002553152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044173044,0.000736941,0.0012040569,0.0010150316,0.002288501,0.0039412994,0.0016512446,0.0038162468,0.014000079],"category_scores_gemma":[0.013847941,0.0007383019,0.0010142742,0.0015112198,0.00742114,0.021976186,0.002887819,0.00530357,0.0040612137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024263372,0.000034206987,0.00015037846,0.00022959363,0.000025028992,0.000044711047,0.0001529788,0.0015340343,0.00015875242,0.9424501,0.020083273,0.035112683],"study_design_scores_gemma":[0.000014416727,0.000012830992,0.00006696103,0.0000860389,0.000005856064,0.000036374295,0.000086687985,0.0021901557,0.00013957408,0.9536027,0.043748047,0.000010306471],"about_ca_topic_score_codex":0.0018719407,"about_ca_topic_score_gemma":0.0014557233,"teacher_disagreement_score":0.014000079,"about_ca_system_score_codex":0.0024004735,"about_ca_system_score_gemma":0.0015271839,"threshold_uncertainty_score":0.046834946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022439356031763835,"score_gpt":0.26995108654818956,"score_spread":0.24751173051642572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171906598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043652836,0.016414668,0.5919115,0.023199892,0.0010576175,0.00011822212,0.00072806445,0.00045182847,0.32246533],"genre_scores_gemma":[0.78745043,0.026086424,0.14277329,0.0035084977,0.0041286275,0.00047547897,0.0014182103,0.00024715363,0.033911932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829656,0.00055956456,0.00009369776,0.00026549684,0.0006037859,0.00018088229],"domain_scores_gemma":[0.996986,0.0018278562,0.00018086942,0.00045655825,0.00040417782,0.0001445201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015628441,0.0004217753,0.00051978027,0.0025724093,0.002108918,0.0047608675,0.001041317,0.0019473687,0.009862914],"category_scores_gemma":[0.005815632,0.00042833888,0.00083207793,0.0024226925,0.0041617975,0.010031692,0.002857595,0.0031269793,0.0017748163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020724017,0.0000042640277,0.00005194273,0.000017776394,0.0000024879707,0.000011241805,0.000026018008,0.0010908996,0.000028305512,0.994578,0.0010290995,0.0031577805],"study_design_scores_gemma":[0.00000282333,0.0000024610472,0.000042013267,0.000018241979,0.0000020782263,0.000027014847,0.000024879271,0.003527605,0.000034633937,0.9857734,0.010541546,0.0000032519176],"about_ca_topic_score_codex":0.0014155944,"about_ca_topic_score_gemma":0.0010494072,"teacher_disagreement_score":0.009862914,"about_ca_system_score_codex":0.001451402,"about_ca_system_score_gemma":0.001338131,"threshold_uncertainty_score":0.032994688},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025634826433566998,"score_gpt":0.3262800787899436,"score_spread":0.30064525235637657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898165178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006129992,0.049697485,0.82911676,0.015604863,0.0018762453,0.00014116114,0.00030935457,0.0003789619,0.096745156],"genre_scores_gemma":[0.28506923,0.11094963,0.5313735,0.007728835,0.010485334,0.0013349887,0.0013235473,0.00068468164,0.05105026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660695,0.0011664372,0.00016490984,0.00068902376,0.0011246266,0.0002480605],"domain_scores_gemma":[0.9926029,0.0050571803,0.00029575624,0.0010301728,0.00076942914,0.0002445488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038611786,0.0013797791,0.0013618837,0.0017488993,0.0016180234,0.003543909,0.003345049,0.0027484426,0.008053949],"category_scores_gemma":[0.014652291,0.0009252434,0.0017601722,0.0029907578,0.004325238,0.006510296,0.004534166,0.0068195225,0.0023367617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019933173,0.000027852448,0.00023574707,0.00022625737,0.000032214273,0.00004543859,0.00015267028,0.014278002,0.00016602624,0.93916285,0.0061853323,0.039467763],"study_design_scores_gemma":[0.000030306739,0.000026195077,0.00014135531,0.00010510747,0.000021116473,0.00009220913,0.00005194917,0.0479811,0.00016459421,0.8780268,0.07334056,0.000018825727],"about_ca_topic_score_codex":0.0021031168,"about_ca_topic_score_gemma":0.0012850306,"teacher_disagreement_score":0.008053949,"about_ca_system_score_codex":0.0026352182,"about_ca_system_score_gemma":0.0021079148,"threshold_uncertainty_score":0.026943147},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Milestone; Focus (optics); Library science; Computer science; Telecommunications; History; Archaeology","score_opus":0.02836137454252424,"score_gpt":0.2893704127327221,"score_spread":0.2610090381901979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904813721","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021179001,0.97044295,0.00025709844,0.007812502,0.007924308,0.000038377853,0.0006206715,0.00006520279,0.012627013],"genre_scores_gemma":[0.0022328363,0.96671975,0.0004553099,0.009006259,0.0072502657,0.00006257846,0.0011437356,0.000042189495,0.013087108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912435,0.00014525253,0.00013233114,0.00016555487,0.0003313901,0.00010116634],"domain_scores_gemma":[0.99619687,0.0011154868,0.00046632884,0.00015027051,0.0016062688,0.00046474295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016628038,0.00082372123,0.0013123914,0.0048562237,0.0008167124,0.0033690615,0.0015353076,0.002030133,0.052794944],"category_scores_gemma":[0.007085585,0.00039682232,0.00072809483,0.0042073308,0.00069095916,0.0024599922,0.0015853484,0.0020076318,0.025092483],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120913595,0.000032303968,0.0002895731,0.01266733,0.00007223979,0.0003026421,0.00010104637,0.000125602,0.0005406178,0.0040461663,0.5096422,0.47205946],"study_design_scores_gemma":[0.000005105641,0.0000127106005,0.00032923717,0.002854229,0.000023846449,0.0002869878,0.000022072709,0.000007941789,0.000053880078,0.00036090158,0.9960377,0.0000052877135],"about_ca_topic_score_codex":0.0035498263,"about_ca_topic_score_gemma":0.0050072875,"teacher_disagreement_score":0.052794944,"about_ca_system_score_codex":0.0026056503,"about_ca_system_score_gemma":0.006424473,"threshold_uncertainty_score":0.17661667},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Banquet; Operations research; Library science; Art history; Mathematics; History","score_opus":0.01974455852597813,"score_gpt":0.26767471253115865,"score_spread":0.24793015400518054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993653833","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089664786,0.14026202,0.0049821828,0.05660413,0.212381,0.0006154829,0.008551351,0.0033924184,0.57231486],"genre_scores_gemma":[0.0049162726,0.15206562,0.0028521218,0.031223947,0.033127483,0.00045906272,0.014460688,0.0017057942,0.759189],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807453,0.00019730348,0.0001728265,0.00025481178,0.0010264119,0.0002739852],"domain_scores_gemma":[0.9909746,0.0006582846,0.00034148048,0.0004967344,0.0057157013,0.0018131551],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023640818,0.0011291675,0.0010560845,0.0039490815,0.0019552798,0.007654525,0.0027174228,0.0031477218,0.33648595],"category_scores_gemma":[0.010730515,0.00053291995,0.0009262684,0.0044032517,0.00069675804,0.005362861,0.0032922346,0.0036335278,0.33982122],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025656087,0.000017349234,0.000046428166,0.0004532656,0.0000046724676,0.00003317413,0.000010760289,0.00004899556,0.00011645076,0.0018685977,0.919633,0.07774157],"study_design_scores_gemma":[0.0000024159676,0.0000059526483,0.0000801265,0.00019760139,0.0000022750353,0.00003251082,0.000009661502,0.000010464474,0.000027192678,0.00022372195,0.99940515,0.0000029034745],"about_ca_topic_score_codex":0.0060136286,"about_ca_topic_score_gemma":0.00931791,"teacher_disagreement_score":0.33648595,"about_ca_system_score_codex":0.0039970134,"about_ca_system_score_gemma":0.0070887855,"threshold_uncertainty_score":0.9464223},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019268048982181377,"score_gpt":0.2635805219920797,"score_spread":0.24431247300989833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127457110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013427892,0.00071443006,0.8992668,0.008405701,0.00089127774,0.0003410527,0.0017310987,0.005275622,0.06994613],"genre_scores_gemma":[0.5160457,0.002408867,0.42844167,0.0141695095,0.0031157453,0.0021638626,0.006330343,0.003400212,0.023924004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98522156,0.0025521733,0.00097103306,0.0028922851,0.005967677,0.0023953328],"domain_scores_gemma":[0.9375768,0.03967018,0.002656097,0.006962692,0.011619205,0.0015151299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01093919,0.0017861105,0.0013994257,0.002364075,0.003176633,0.007067823,0.004343834,0.0033045686,0.020976773],"category_scores_gemma":[0.05751134,0.0018410112,0.0049341954,0.0022107342,0.0072652637,0.018269785,0.013692968,0.010270284,0.005868962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010620579,0.00013072796,0.0013036398,0.00053040945,0.0000752966,0.0005111224,0.00060452265,0.011454218,0.0028124673,0.9307562,0.023100607,0.028614463],"study_design_scores_gemma":[0.000087217646,0.00006506616,0.00020762239,0.00012839361,0.000052744817,0.00029301213,0.0002458718,0.03248467,0.0044753193,0.92491347,0.037004914,0.000041722556],"about_ca_topic_score_codex":0.003644255,"about_ca_topic_score_gemma":0.0030359956,"teacher_disagreement_score":0.020976773,"about_ca_system_score_codex":0.0040515317,"about_ca_system_score_gemma":0.0056619025,"threshold_uncertainty_score":0.07017434},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02997993845767251,"score_gpt":0.2524561424002102,"score_spread":0.2224762039425377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224209627","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008128294,0.008820985,0.0031013526,0.037831467,0.20219599,0.00024906156,0.021535033,0.0034491578,0.7220041],"genre_scores_gemma":[0.002506721,0.0035827472,0.0006951373,0.008594166,0.029368784,0.000095439056,0.007826141,0.0016343247,0.9456966],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986745,0.000113550996,0.00007700307,0.00029648724,0.00064895145,0.00018949503],"domain_scores_gemma":[0.9924964,0.0010503648,0.00046329666,0.00073014875,0.0025454843,0.002714237],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013235568,0.000978495,0.0011186998,0.0025152627,0.0016497046,0.0074580344,0.0018003946,0.0017577794,0.7896928],"category_scores_gemma":[0.010116688,0.0004927123,0.00072913116,0.0028690994,0.0006048653,0.00424625,0.002477906,0.0032446694,0.72456056],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015642512,0.000009840548,0.000040426432,0.000047436188,0.0000011267689,0.000010713439,0.0000035618798,0.000017496226,0.00008262145,0.0009658806,0.9837177,0.015087595],"study_design_scores_gemma":[0.0000071118566,0.0000083534605,0.00014983359,0.000055739125,0.0000013955467,0.0000383561,0.000012438231,0.00004695912,0.00010245279,0.0009748227,0.9985984,0.0000041870617],"about_ca_topic_score_codex":0.0013744876,"about_ca_topic_score_gemma":0.0028923922,"teacher_disagreement_score":0.7896928,"about_ca_system_score_codex":0.0012552544,"about_ca_system_score_gemma":0.0021892074,"threshold_uncertainty_score":0.29997766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Citation; Computer science; World Wide Web; Information retrieval","score_opus":0.033454250736503946,"score_gpt":0.21741172163611278,"score_spread":0.18395747089960884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244155401","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001894351,0.60306484,0.031125605,0.0074974997,0.008341264,0.00024004471,0.0021692924,0.00057742716,0.34508958],"genre_scores_gemma":[0.03671516,0.7652435,0.01802815,0.005947661,0.007467559,0.00037966832,0.0045446656,0.00050549285,0.16116816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986206,0.0003017693,0.000085681524,0.00020713436,0.0006978422,0.00008689728],"domain_scores_gemma":[0.9971763,0.000991688,0.00019102472,0.00035410494,0.0011144219,0.0001724136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011831576,0.0010865233,0.0011581166,0.00398363,0.0005764359,0.002373936,0.0015095256,0.0011649416,0.08560733],"category_scores_gemma":[0.0059302207,0.0004232121,0.00088562554,0.0054319208,0.0009379033,0.0029356692,0.0009791235,0.0014362794,0.03344306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043607684,0.000034466786,0.0002608444,0.0041442667,0.000104713596,0.00006729824,0.000060746275,0.0008463904,0.0006417606,0.095289804,0.38398215,0.5145239],"study_design_scores_gemma":[0.000007651229,0.000023528904,0.00021398433,0.00080261123,0.000029550105,0.00020012907,0.000028117129,0.00010920519,0.00024548214,0.020929221,0.97740084,0.000009649625],"about_ca_topic_score_codex":0.0013538284,"about_ca_topic_score_gemma":0.002459908,"teacher_disagreement_score":0.08560733,"about_ca_system_score_codex":0.0021818557,"about_ca_system_score_gemma":0.0016281233,"threshold_uncertainty_score":0.286385},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Operations research; Artificial intelligence; Mathematics","score_opus":0.1689774629311761,"score_gpt":0.40006618518853676,"score_spread":0.23108872225736066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322723545","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015592806,0.032220934,0.0108984085,0.038867578,0.25263664,0.0028726913,0.030163642,0.0065710763,0.62420976],"genre_scores_gemma":[0.0069936183,0.027840057,0.007904029,0.032963146,0.05092555,0.0025233598,0.056119382,0.0035086675,0.8112222],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958474,0.00045524884,0.00033462484,0.00034081758,0.0023901234,0.00063177146],"domain_scores_gemma":[0.9870646,0.00083793484,0.00045553077,0.0006742081,0.0074451063,0.00352266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006232443,0.0013924297,0.0009664789,0.006075362,0.0025704463,0.012524446,0.0024439192,0.0034622205,0.22903098],"category_scores_gemma":[0.0126205925,0.0007735957,0.0010696102,0.006406346,0.00050550525,0.0040707756,0.0038156663,0.0037628568,0.22495809],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004872102,0.000049178547,0.00009205997,0.00031827867,0.0000033043168,0.000038880215,0.0000081309645,0.00008726584,0.00020131635,0.00089500775,0.9560763,0.042181496],"study_design_scores_gemma":[0.000006968318,0.000018819555,0.0003259737,0.00012154951,0.0000021382648,0.00003510883,0.000011869888,0.000038507766,0.00008704863,0.00019246338,0.9991529,0.000006624019],"about_ca_topic_score_codex":0.009632142,"about_ca_topic_score_gemma":0.014577686,"teacher_disagreement_score":0.22903098,"about_ca_system_score_codex":0.004060232,"about_ca_system_score_gemma":0.009572497,"threshold_uncertainty_score":0.7661849},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0740858890672719,"score_gpt":0.3144465188398266,"score_spread":0.2403606297725547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393185920","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052308574,0.027967922,0.19243723,0.31893474,0.059643835,0.000118975884,0.008357851,0.0025513857,0.33767948],"genre_scores_gemma":[0.6748016,0.019610574,0.041708097,0.025611049,0.090343595,0.00040042176,0.005763272,0.0025794916,0.13918191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984371,0.00033530235,0.00007137903,0.00048919464,0.0004548148,0.0002122239],"domain_scores_gemma":[0.98049647,0.01270356,0.0010936855,0.0016577701,0.0021275058,0.0019210307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016175915,0.0008036033,0.0011974479,0.0020312036,0.001720575,0.008449832,0.0014493142,0.0019262184,0.0658062],"category_scores_gemma":[0.013899909,0.000628044,0.0008407043,0.0029627387,0.003449533,0.009978368,0.002311876,0.008712237,0.011699024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001850132,0.00006073362,0.0014001735,0.00025987317,0.000028732393,0.000097135104,0.00018485288,0.002607021,0.00063206203,0.62372065,0.3438712,0.026952554],"study_design_scores_gemma":[0.000049931634,0.000053971056,0.0018742873,0.00025361535,0.000033339766,0.0002794674,0.00017997027,0.014499007,0.0015334954,0.8513771,0.12979457,0.000071064016],"about_ca_topic_score_codex":0.0016606062,"about_ca_topic_score_gemma":0.0013943147,"teacher_disagreement_score":0.0658062,"about_ca_system_score_codex":0.003300615,"about_ca_system_score_gemma":0.0016192549,"threshold_uncertainty_score":0.22014368},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Column (typography); Computer science; Telecommunications","score_opus":0.028776591691234487,"score_gpt":0.27605657984042287,"score_spread":0.2472799881491884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405845721","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016819696,0.017279753,0.010543681,0.22897185,0.10299417,0.00012829002,0.005789849,0.0017788612,0.63083166],"genre_scores_gemma":[0.039836112,0.018873217,0.0087741455,0.038991466,0.07755193,0.00040717714,0.005923181,0.0019878058,0.807655],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976259,0.00041614662,0.00013153572,0.00041350356,0.001166272,0.00024659283],"domain_scores_gemma":[0.9943263,0.0019353845,0.00024755654,0.00088563754,0.0019003777,0.0007046969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023325812,0.0015577029,0.0011997438,0.0019341506,0.0031789804,0.0117839,0.0016778557,0.003956044,0.18330193],"category_scores_gemma":[0.007870903,0.00090613606,0.00115929,0.002152656,0.0023185683,0.005272954,0.0018396702,0.009552484,0.07983409],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024835183,0.000023319886,0.000083205894,0.00007402307,0.000011500303,0.0000235961,0.000009458132,0.00017595297,0.000063294334,0.019822216,0.96673745,0.012951132],"study_design_scores_gemma":[0.000028212784,0.000017126009,0.0003097639,0.00011532885,0.0000134661595,0.000050078153,0.000029064553,0.0008767596,0.00029543563,0.019435728,0.97881144,0.000017606651],"about_ca_topic_score_codex":0.009185853,"about_ca_topic_score_gemma":0.015554793,"teacher_disagreement_score":0.18330193,"about_ca_system_score_codex":0.0066461354,"about_ca_system_score_gemma":0.002670804,"threshold_uncertainty_score":0.613206},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03030504865872188,"score_gpt":0.3013024295391453,"score_spread":0.27099738088042347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414234929","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007824214,0.056960545,0.16262716,0.22832274,0.08916197,0.00033217296,0.0084532285,0.003703054,0.4426149],"genre_scores_gemma":[0.2508235,0.085034356,0.10363486,0.06033181,0.098495655,0.0014763421,0.014650787,0.0034083712,0.3821444],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977925,0.0005116626,0.00014545729,0.0002837511,0.001008331,0.00025833762],"domain_scores_gemma":[0.99197406,0.0044160546,0.00038933766,0.0010877488,0.0015547173,0.0005781187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025529212,0.0014263918,0.0013279287,0.0018764506,0.00232691,0.0064812554,0.0018649377,0.0034646103,0.037911683],"category_scores_gemma":[0.008579062,0.00095429295,0.0009780402,0.0022903734,0.0028299193,0.0055699595,0.0019459272,0.010176179,0.0161949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010856408,0.000057508856,0.00023487286,0.0003482732,0.00004800716,0.00009161266,0.000036051224,0.0020594457,0.0008900799,0.13293391,0.80891097,0.054280695],"study_design_scores_gemma":[0.000079571604,0.000097173666,0.00078234595,0.0002581436,0.00004776348,0.00030711704,0.000059503465,0.01673257,0.002609458,0.14843427,0.8305097,0.00008238948],"about_ca_topic_score_codex":0.0065585175,"about_ca_topic_score_gemma":0.00866218,"teacher_disagreement_score":0.037911683,"about_ca_system_score_codex":0.0039395755,"about_ca_system_score_gemma":0.0024980025,"threshold_uncertainty_score":0.12682724},"labels":[],"label_agreement":null}]}