{"meta":{"query_hash":"b369cf7e8dec","filters":{"venue":"ACM SIGLOG News"},"cohort_total":23,"direct_labels_cover":0,"predictions_cover":23,"exported":23,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/b369cf7e8dec","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+SIGLOG+News"},"results":[{"id":"W2336283925","doi":"10.1145/2815493.2815501","title":"Probabilistic bisimulation","year":2015,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Formal Methods in Verification","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":"McGill University","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Computer science; Artificial intelligence; Discrete mathematics","score_opus":0.12191699494823618,"score_gpt":0.34182679035582164,"score_spread":0.21990979540758546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336283925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031681344,0.000056258465,0.95794344,0.0009965764,0.000870523,0.00024221736,4.9335983e-7,0.0002997945,0.007909335],"genre_scores_gemma":[0.33841303,0.0000016035691,0.6610193,0.0002966967,0.000078793666,0.000015501757,0.0000022389413,0.0000052476703,0.0001675506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999086,0.000115642375,0.00017822802,0.00024302764,0.00021902926,0.00015805165],"domain_scores_gemma":[0.9984841,0.00010631033,0.00007782626,0.0011175532,0.000114918344,0.00009930484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051205885,0.00007832982,0.000085370186,0.000058839014,0.000040282288,0.00007793074,0.0010094516,0.00005332959,0.000005025974],"category_scores_gemma":[0.0025721367,0.00007033693,0.000023899865,0.00034598194,0.000028460685,0.000570579,0.00026260197,0.00007135297,0.0002788366],"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.000020020456,0.00011196319,0.0044566966,0.000020959353,0.000010557449,0.0000068713975,0.0020966632,0.0075944937,0.00089708104,0.60199016,0.010571806,0.37222275],"study_design_scores_gemma":[0.000746932,0.00029591177,0.010743046,0.000014972188,0.0000095727155,0.000023575942,0.00006442981,0.49555042,0.0025315948,0.41423753,0.075369686,0.00041232575],"about_ca_topic_score_codex":0.000033947003,"about_ca_topic_score_gemma":0.000005866753,"teacher_disagreement_score":0.48795593,"about_ca_system_score_codex":0.0000695129,"about_ca_system_score_gemma":0.00007054663,"threshold_uncertainty_score":0.35839736},"labels":[],"label_agreement":null},{"id":"W2562647514","doi":"10.1145/3026744.3026746","title":"An improved homomorphism preservation theorem from lower bounds in circuit complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Advanced Graph Theory 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":"University of Toronto","funders":"","keywords":"Homomorphism; Quantifier elimination; Rank (graph theory); Mathematics; Isomorphism (crystallography); Sentence; Quantifier (linguistics); Discrete mathematics; Upper and lower bounds; Function (biology); Combinatorics; Computer science","score_opus":0.06368496125477932,"score_gpt":0.30681698521299294,"score_spread":0.24313202395821362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562647514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252822,0.00007179305,0.46951038,0.0027958383,0.0003535875,0.0004285387,0.000032070846,0.00023996305,0.0012856534],"genre_scores_gemma":[0.9794418,0.000018704086,0.019619307,0.00046554365,0.00009209056,0.000051656873,0.000013289581,0.000021355323,0.00027623016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763,0.0003660937,0.00032753177,0.00075253064,0.00036585887,0.0005579957],"domain_scores_gemma":[0.99615026,0.00071563135,0.000114895876,0.0027184777,0.00012140667,0.00017933366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061991165,0.0002018487,0.0002517623,0.00017822652,0.00012770381,0.00016186792,0.0033734636,0.00011887133,0.00018358314],"category_scores_gemma":[0.0006278562,0.00014924855,0.00006701777,0.000570303,0.00031781182,0.0022244982,0.0007095621,0.00021429757,0.0001151994],"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.00014915351,0.0003861666,0.026756192,0.000006631422,0.000025736794,0.000054271575,0.0010306024,0.000012420003,0.29136413,0.51952505,0.0005978914,0.16009171],"study_design_scores_gemma":[0.0009975608,0.00021955074,0.034722026,0.000022671526,0.0000018639164,0.0000024756948,0.00002148936,0.003267331,0.0030934406,0.9556391,0.0017654175,0.00024707118],"about_ca_topic_score_codex":0.00060990086,"about_ca_topic_score_gemma":0.0008905889,"teacher_disagreement_score":0.45415965,"about_ca_system_score_codex":0.00012712307,"about_ca_system_score_gemma":0.000093162824,"threshold_uncertainty_score":0.6268791},"labels":[],"label_agreement":null},{"id":"W2740496174","doi":"10.1145/3129173.3129174","title":"The 2017 Alonzo Church award","year":2017,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Semantics (computer science); Order (exchange); Field (mathematics); Computer science; Citation; Sociology; Classics; Linguistics; Programming language; Philosophy; Library science; History; Mathematics; Business","score_opus":0.051308121143838516,"score_gpt":0.2996879251411176,"score_spread":0.24837980399727907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740496174","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02091247,0.0049418015,0.31873685,0.078969486,0.024198448,0.0020425334,0.0000030680783,0.0013999378,0.5487954],"genre_scores_gemma":[0.9871008,0.0000993387,0.0017179217,0.00032693543,0.00047164725,0.00003233385,9.607522e-7,0.000009124989,0.010240947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867326,0.00007326183,0.00019477487,0.00036444867,0.0002692611,0.00042500423],"domain_scores_gemma":[0.995501,0.00017491533,0.00022514362,0.003927371,0.00006796446,0.00010359894],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005628501,0.00014095989,0.00016138052,0.000022975168,0.0015049913,0.0013329163,0.005824818,0.000087924636,0.000007049303],"category_scores_gemma":[0.0005832634,0.000085297615,0.00009645091,0.000055126835,0.00015362132,0.000412752,0.0012033365,0.0001554827,0.00085403037],"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.000006352424,0.000041965937,0.018591275,0.000011380505,0.000044635985,0.0000738978,0.0007787872,0.0000017847358,0.00031836124,0.4222891,0.1790994,0.37874305],"study_design_scores_gemma":[0.00026362366,0.000074810676,0.01899001,0.0000022812696,0.0000049484897,0.00003137198,0.000033376913,0.00027171284,0.00023406709,0.0648238,0.91508925,0.00018076257],"about_ca_topic_score_codex":0.00082242413,"about_ca_topic_score_gemma":0.0003025584,"teacher_disagreement_score":0.9661883,"about_ca_system_score_codex":0.000022889742,"about_ca_system_score_gemma":0.00006499646,"threshold_uncertainty_score":0.99992394},"labels":[],"label_agreement":null},{"id":"W2740891638","doi":"10.1145/3129173.3129175","title":"2017 LICS test-of-time award","year":2017,"lang":"en","type":"article","venue":"ACM SIGLOG 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":"McGill University","funders":"","keywords":"Honor; Test (biology); Library science; History; Computer science; Operations research; Engineering; Biology","score_opus":0.039603647257364934,"score_gpt":0.29486232597567014,"score_spread":0.2552586787183052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740891638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35132715,0.00095399504,0.50118077,0.04914661,0.008980114,0.0022368208,0.000061837614,0.0019160269,0.084196694],"genre_scores_gemma":[0.6921117,0.00007373546,0.30383784,0.0006632433,0.0006425879,0.000027029924,0.000004225686,0.000033352015,0.0026062895],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980762,0.000068763824,0.00037925228,0.0006516755,0.00037898213,0.00044511657],"domain_scores_gemma":[0.99231756,0.0010708593,0.00038457662,0.0058786264,0.00018045034,0.00016794108],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00046519894,0.00023186405,0.00039303172,0.000079538324,0.0003691415,0.0003645729,0.007250283,0.00013581978,0.00003825814],"category_scores_gemma":[0.004727244,0.00021135808,0.00016456084,0.00013659406,0.00023495448,0.00066973764,0.0037515785,0.00020083372,0.00052356505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014419653,0.0007931165,0.16468148,0.00007547732,0.00007832874,0.00016039163,0.0012661088,0.00017464507,0.011952315,0.0069312733,0.07058895,0.7432835],"study_design_scores_gemma":[0.0023031607,0.0013977246,0.55307823,0.00010209298,0.000059451413,0.00016302585,0.000030473664,0.13360229,0.013119214,0.19120152,0.10312485,0.001817965],"about_ca_topic_score_codex":0.00034899224,"about_ca_topic_score_gemma":0.000050719755,"teacher_disagreement_score":0.7414655,"about_ca_system_score_codex":0.000050318424,"about_ca_system_score_gemma":0.00014542826,"threshold_uncertainty_score":0.99812096},"labels":[],"label_agreement":null},{"id":"W2741584520","doi":"10.1145/3129173.3129176","title":"2017 Kleene award","year":2017,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Constructive; Presentation (obstetrics); Completeness (order theory); Computer science; Kleene's recursion theorem; Kleene algebra; Calculus (dental); Mathematics; Programming language; Discrete mathematics; Algorithm; Medicine","score_opus":0.06795900448942767,"score_gpt":0.35323624604111287,"score_spread":0.2852772415516852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741584520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047800895,0.0001761135,0.95411086,0.018550241,0.0024441166,0.00012970057,0.0000024747324,0.00019529942,0.01961108],"genre_scores_gemma":[0.048404854,0.00007240759,0.9472455,0.0012668855,0.00044522193,0.0000118401695,5.8777175e-7,0.000010159856,0.0025425581],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893,0.00005927997,0.00014730846,0.00037387758,0.00018391803,0.0003056288],"domain_scores_gemma":[0.9965285,0.00014303239,0.00014509371,0.002997645,0.000038641916,0.00014710684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025447705,0.00012121578,0.00018812208,0.00002900246,0.00043526982,0.0004375071,0.004005498,0.000057985642,0.000021590991],"category_scores_gemma":[0.0008471555,0.00009613189,0.000081405495,0.000059765032,0.000079229976,0.00052385073,0.0013326238,0.00013059699,0.00037705136],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015962503,0.000027859653,0.002164273,0.0000027541046,0.000009023936,0.000047456022,0.000051491177,0.0000012781213,0.0019584463,0.00783674,0.011836857,0.97606224],"study_design_scores_gemma":[0.0008869726,0.00026470912,0.09783301,0.00003091528,0.0000135826285,0.000049403963,0.000017181797,0.006575669,0.0073832767,0.20548671,0.68074626,0.00071230764],"about_ca_topic_score_codex":0.00025396535,"about_ca_topic_score_gemma":0.000007675787,"teacher_disagreement_score":0.9753499,"about_ca_system_score_codex":0.000014036496,"about_ca_system_score_gemma":0.00003130892,"threshold_uncertainty_score":0.74432784},"labels":[],"label_agreement":null},{"id":"W2768930898","doi":"10.1145/3157831.3157837","title":"Probabilistic bisimilarity distances","year":2017,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Statistical model; Computer science; Probabilistic relevance model; Probabilistic argumentation; Column (typography); Mathematics; Theoretical computer science; Probabilistic analysis of algorithms; Artificial intelligence; Geometry; Connection (principal bundle)","score_opus":0.06332600992454658,"score_gpt":0.35332706860654245,"score_spread":0.2900010586819959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768930898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12892717,0.00020324672,0.8253629,0.017946862,0.0019728253,0.00040090035,0.000013667789,0.00030134787,0.024871053],"genre_scores_gemma":[0.830479,0.00001079873,0.16851927,0.0004886405,0.00015478823,0.000021691923,0.0000026365137,0.000008126704,0.0003149953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867475,0.00012256885,0.00019675384,0.00046022973,0.00029611491,0.0002495584],"domain_scores_gemma":[0.9965878,0.00055552204,0.0001758626,0.0025109667,0.000076400866,0.0000934634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181317,0.00013510122,0.00017024149,0.000040780014,0.00048339725,0.00068821176,0.0038869062,0.00004584144,0.000016764658],"category_scores_gemma":[0.0029456294,0.00011936823,0.0000748271,0.00009753794,0.0001429422,0.0009768982,0.0013923612,0.00012662972,0.00007481288],"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.000017723734,0.00017382482,0.019342382,0.000047720358,0.000035115754,0.00006530629,0.00052188634,0.0027791942,0.0001796679,0.54173136,0.009085094,0.42602074],"study_design_scores_gemma":[0.00030814818,0.000051199182,0.14704847,0.00002134461,0.0000076252577,0.000011145893,0.000010466135,0.038970083,0.00026635543,0.77621394,0.036789693,0.0003015255],"about_ca_topic_score_codex":0.00012907504,"about_ca_topic_score_gemma":0.00016364755,"teacher_disagreement_score":0.70155185,"about_ca_system_score_codex":0.000045343597,"about_ca_system_score_gemma":0.000120138706,"threshold_uncertainty_score":0.72229034},"labels":[],"label_agreement":null},{"id":"W2902878758","doi":"10.1145/3292048.3292050","title":"Constraint satisfaction problems","year":2018,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Conjecture; Constraint satisfaction problem; Constraint (computer-aided design); Constraint satisfaction dual problem; Complexity of constraint satisfaction; Constraint satisfaction; Backtracking; Mathematics; Combinatorics; Computer science; Mathematical economics; Local consistency; Mathematical optimization; Statistics; Geometry","score_opus":0.03928523442880928,"score_gpt":0.31140997275033805,"score_spread":0.2721247383215288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902878758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084311165,0.00006276434,0.8949433,0.0024074132,0.00071672135,0.00046030132,0.0000028634956,0.00046722952,0.016628264],"genre_scores_gemma":[0.9334118,0.000015573183,0.065623455,0.00043424597,0.00014594791,0.00002322839,8.7372655e-7,0.000008808219,0.0003361059],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879587,0.000092125076,0.00015789215,0.00036334057,0.00024277908,0.00034802427],"domain_scores_gemma":[0.9984637,0.00017686037,0.00005628331,0.0010768194,0.00011805773,0.00010831399],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027658802,0.000103945844,0.0001057197,0.000102479346,0.00016031267,0.00009105139,0.0009956501,0.0000545143,0.00018202442],"category_scores_gemma":[0.00031707025,0.000092088514,0.000040641964,0.00041942412,0.00029511037,0.0004673741,0.0004500354,0.00014978743,0.0010173853],"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.000011320794,0.000030470881,0.0126712965,0.000009951042,0.00001951879,0.000012412491,0.00071850704,0.000020679658,0.026729813,0.29677945,0.0038892683,0.6591073],"study_design_scores_gemma":[0.00065523176,0.00059533026,0.019212903,0.000028291017,0.000003863312,0.000089668494,0.00009684753,0.002309977,0.014909553,0.9072732,0.054429553,0.00039559108],"about_ca_topic_score_codex":0.00007495879,"about_ca_topic_score_gemma":0.00017074817,"teacher_disagreement_score":0.8491006,"about_ca_system_score_codex":0.00004029851,"about_ca_system_score_gemma":0.000059255348,"threshold_uncertainty_score":0.99976045},"labels":[],"label_agreement":null},{"id":"W2925744740","doi":"10.1145/3313909.3313915","title":"Women in Logic 2018 workshop report","year":2019,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, programming, and type systems","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 Ottawa","funders":"","keywords":"Event (particle physics); Logic model; Computer science; Library science; Political science; Public administration","score_opus":0.03896293176793796,"score_gpt":0.2720167680281156,"score_spread":0.23305383626017762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925744740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6329436,0.0014824125,0.13405034,0.0071521197,0.010854659,0.0023859513,7.50573e-7,0.0012905443,0.20983964],"genre_scores_gemma":[0.982551,0.000012424858,0.0030329097,0.00066077313,0.00013641248,0.00004754917,0.0000027182089,0.0000095790465,0.01354663],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820536,0.000081226535,0.00035329454,0.00053592597,0.00023531787,0.0005888907],"domain_scores_gemma":[0.99787146,0.00013640939,0.00015525041,0.00168183,0.000035407036,0.00011961763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00076503685,0.00014957499,0.00027402907,0.00010191707,0.000037455433,0.00013862802,0.0013974378,0.00012687198,0.00009601646],"category_scores_gemma":[0.00030052374,0.00011955767,0.000058368394,0.00046827598,0.00002892725,0.0003161505,0.00054677314,0.00016592036,0.00140746],"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.00003315678,0.00043595413,0.52021885,0.00010463049,0.000072844494,0.0023765264,0.009276999,0.00014116566,0.0013238373,0.26251376,0.042021263,0.16148104],"study_design_scores_gemma":[0.0014398318,0.0004404458,0.02897813,0.000019677072,0.000004962328,0.000527151,0.00092368526,0.00096095813,0.00023026235,0.3223929,0.64316624,0.00091572903],"about_ca_topic_score_codex":0.00027106632,"about_ca_topic_score_gemma":0.00010730785,"teacher_disagreement_score":0.601145,"about_ca_system_score_codex":0.00012466405,"about_ca_system_score_gemma":0.00008315783,"threshold_uncertainty_score":0.99937004},"labels":[],"label_agreement":null},{"id":"W2962731772","doi":"10.1145/2984450.2984455","title":"Algebraic proof complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"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":"Mathematical proof; Proof complexity; Algebraic number; Mathematics; Circuit complexity; Upper and lower bounds; Connection (principal bundle); Discrete mathematics; Algebraic number theory; Polynomial; Computer science; Algebra over a field; Pure mathematics; Electronic circuit","score_opus":0.057058056298150514,"score_gpt":0.2720437758751473,"score_spread":0.21498571957699675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962731772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026791489,0.00023271589,0.92784226,0.03141686,0.0013301241,0.00040887008,0.000015761298,0.00073751825,0.011224412],"genre_scores_gemma":[0.7996475,0.000035179,0.19554926,0.002635543,0.00035623755,0.00004318518,0.0000030893282,0.000020607325,0.0017093667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984026,0.000090514564,0.00025218408,0.0005234629,0.00029514794,0.00043606682],"domain_scores_gemma":[0.99760026,0.00032284632,0.00008813331,0.0017731246,0.00006660753,0.00014904518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021403813,0.00018107775,0.00020841675,0.00010251591,0.00017972192,0.00010094082,0.002688618,0.00006773772,0.00020271912],"category_scores_gemma":[0.0002781397,0.00012134632,0.00011894014,0.00041814742,0.00022937998,0.0005361457,0.0011574378,0.00011048956,0.00041803543],"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.0000052906466,0.000095252675,0.00202492,0.000007761511,0.000020077636,0.000020376374,0.00017040962,5.754468e-7,0.0020424495,0.46271622,0.01571061,0.51718605],"study_design_scores_gemma":[0.00064684736,0.00014156605,0.009464577,0.00003574492,0.0000045880156,0.000039084614,0.000009266736,0.00059300486,0.0055411183,0.89455986,0.08860291,0.00036141605],"about_ca_topic_score_codex":0.00006351264,"about_ca_topic_score_gemma":0.000095940915,"teacher_disagreement_score":0.77285606,"about_ca_system_score_codex":0.00003812105,"about_ca_system_score_gemma":0.000058842754,"threshold_uncertainty_score":0.53731394},"labels":[],"label_agreement":null},{"id":"W3108284226","doi":"10.1145/3436980.3436984","title":"The ABCs of petri net reachability relaxations","year":2020,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":8,"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 Sherbrooke","funders":"","keywords":"Reachability; Petri net; Concurrency; Computer science; Branching (polymer chemistry); Stochastic Petri net; Process architecture; Reachability problem; Theoretical computer science; Programming language; Distributed computing; Algorithm","score_opus":0.04943174827778196,"score_gpt":0.27105766434396694,"score_spread":0.22162591606618498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108284226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080010325,0.0014206057,0.84669745,0.054588743,0.0012293905,0.0006192659,0.000012191837,0.00047119547,0.014950827],"genre_scores_gemma":[0.96445334,0.000049095215,0.03456067,0.000647539,0.00013085573,0.000013652665,0.000001378672,0.000007703472,0.00013574593],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984963,0.00017157459,0.00043336887,0.0003490671,0.0003272978,0.00022240641],"domain_scores_gemma":[0.9968349,0.0010354543,0.00022320522,0.0016865783,0.00011736589,0.000102494676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055108086,0.00010501749,0.00017639706,0.0000311571,0.00017574152,0.00007724358,0.0025018193,0.00005983885,0.000005657834],"category_scores_gemma":[0.003280884,0.000075957025,0.000083775994,0.00072237855,0.000074154115,0.00023684467,0.00076730497,0.00016896677,0.00005672195],"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.00008174167,0.00026040888,0.049112443,0.00020347093,0.00018260298,0.000032637232,0.022482848,0.010903559,0.01568986,0.28211132,0.14141558,0.47752354],"study_design_scores_gemma":[0.0016294828,0.0007111566,0.015295764,0.00009809032,0.00004742879,0.0000445361,0.00104467,0.4414795,0.0049849236,0.060002696,0.47366914,0.0009926191],"about_ca_topic_score_codex":0.00012479763,"about_ca_topic_score_gemma":0.00003889431,"teacher_disagreement_score":0.88444304,"about_ca_system_score_codex":0.000037003112,"about_ca_system_score_gemma":0.00010132105,"threshold_uncertainty_score":0.46490443},"labels":[],"label_agreement":null},{"id":"W3137835047","doi":"10.1145/3262168","title":"Session details: Semantics","year":2015,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, Reasoning, and Knowledge","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":"Column (typography); Session (web analytics); Semantics (computer science); Component (thermodynamics); Foundation (evidence); Connection (principal bundle); Subject (documents); Computer science; Quarter (Canadian coin); Mathematics education; Mathematics; Theoretical computer science; Algebra over a field; Pure mathematics; Programming language; World Wide Web; Political science; History; Geometry","score_opus":0.055970368079020186,"score_gpt":0.28608301915795786,"score_spread":0.2301126510789377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137835047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16332446,0.0027031072,0.63344157,0.008275857,0.0055831335,0.0005086427,0.0000021591472,0.0014159454,0.18474512],"genre_scores_gemma":[0.9516199,0.000044416316,0.044007648,0.00088699954,0.00033482784,0.000008242878,0.0000029341425,0.000012791784,0.0030822025],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988193,0.00008428409,0.00017666393,0.0003464186,0.00024776894,0.0003255961],"domain_scores_gemma":[0.9983247,0.00012307499,0.000080694605,0.0011112882,0.00012451268,0.00023573876],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029409802,0.00014443525,0.00017457429,0.000058675305,0.00009084067,0.0001481506,0.0015528854,0.00009884435,0.000016108334],"category_scores_gemma":[0.00072649,0.00010971225,0.00006162659,0.00030091344,0.00003747797,0.0004102502,0.0008515476,0.00013181569,0.0009643966],"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.000025125524,0.0004430294,0.08464901,0.000047448073,0.00005577632,0.00037962894,0.009862758,0.00009176569,0.0026308578,0.16988197,0.45516133,0.27677128],"study_design_scores_gemma":[0.002859524,0.00074335287,0.0102758445,0.0001037388,0.000046847144,0.00028555212,0.0007340852,0.02942294,0.010543386,0.21084897,0.732722,0.001413796],"about_ca_topic_score_codex":0.000049786657,"about_ca_topic_score_gemma":0.000059961072,"teacher_disagreement_score":0.78829545,"about_ca_system_score_codex":0.000044076784,"about_ca_system_score_gemma":0.00013849341,"threshold_uncertainty_score":0.9998135},"labels":[],"label_agreement":null},{"id":"W4206460673","doi":"10.1145/3458593.3458594","title":"Verification column","year":2020,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Parallel Computing and Optimization Techniques","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":"Column (typography); Relevance (law); Quarter (Canadian coin); Computer science; Political science; History; Telecommunications; Law; Archaeology","score_opus":0.040735937642871825,"score_gpt":0.2665553533010225,"score_spread":0.22581941565815067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206460673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012903615,0.000059781578,0.9794042,0.013172842,0.00008994532,0.00009553176,4.6407465e-7,0.00090241595,0.0049844454],"genre_scores_gemma":[0.51991194,0.00003555929,0.47352222,0.0062600835,0.0001008293,0.000010008481,0.0000046148225,0.000006570184,0.00014818394],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993284,0.00004272185,0.00013576147,0.00025891373,0.00011165472,0.00012259938],"domain_scores_gemma":[0.9992233,0.00005015476,0.000060178318,0.0005392516,0.000044766635,0.00008236864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006998131,0.00006835053,0.0000847381,0.000024301791,0.00007174168,0.000095730764,0.0011147271,0.0000410988,0.000014160469],"category_scores_gemma":[0.00024155584,0.00007028719,0.000030716867,0.00031708396,0.000014980557,0.00018460245,0.00026289787,0.000071832255,0.0001677268],"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.000015922229,0.000115243725,0.0054223756,0.00003128449,0.000029564875,0.000022556509,0.0035668197,0.0069642565,0.0076582674,0.088221796,0.61271036,0.27524152],"study_design_scores_gemma":[0.0005632182,0.00032369883,0.0040028566,0.00001517623,0.000007478231,0.000009680199,0.000035246998,0.619166,0.015264423,0.011955075,0.3481511,0.00050607143],"about_ca_topic_score_codex":0.000017149408,"about_ca_topic_score_gemma":0.0000010733565,"teacher_disagreement_score":0.61220175,"about_ca_system_score_codex":0.0000121581315,"about_ca_system_score_gemma":0.00003160142,"threshold_uncertainty_score":0.28662285},"labels":[],"label_agreement":null},{"id":"W4233050175","doi":"10.1145/2984450.2984456","title":"Semantics column","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Soundness; Column (typography); Semantics (computer science); Component (thermodynamics); Computer science; Programming language; Philosophy; Epistemology; Physics","score_opus":0.03022646206520492,"score_gpt":0.25549612915197967,"score_spread":0.22526966708677476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233050175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007279693,0.00025341974,0.9647201,0.0077383486,0.0019917274,0.00030441696,8.505455e-7,0.0005390315,0.01717247],"genre_scores_gemma":[0.98706645,0.00002804615,0.0066800835,0.0005099229,0.00022477502,0.000013657515,5.1805466e-7,0.000008450044,0.005468124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894273,0.000055959663,0.0001811087,0.00031331045,0.00019275925,0.0003141185],"domain_scores_gemma":[0.99848497,0.00015703418,0.00008128319,0.0011242685,0.000055785018,0.000096678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019499652,0.000108803986,0.00014724473,0.000040923504,0.00008231203,0.00011799581,0.0013493218,0.000075696196,0.00003297088],"category_scores_gemma":[0.00021476019,0.000067452114,0.00006151494,0.00018313184,0.000046573663,0.0002590575,0.00043028672,0.000049497645,0.0011357808],"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.000003223595,0.00006736429,0.024978673,0.000016880758,0.000027116535,0.000059517213,0.00045945827,5.6430156e-7,0.0032758417,0.57351255,0.0506514,0.34694737],"study_design_scores_gemma":[0.00064068387,0.00019600643,0.002884643,0.00000844325,0.000007629793,0.000048901125,0.000030517016,0.00013962227,0.0024111075,0.13517553,0.8581209,0.00033602398],"about_ca_topic_score_codex":0.00011571436,"about_ca_topic_score_gemma":0.00009817462,"teacher_disagreement_score":0.97978675,"about_ca_system_score_codex":0.000027294464,"about_ca_system_score_gemma":0.000044678516,"threshold_uncertainty_score":0.99964195},"labels":[],"label_agreement":null},{"id":"W4235412025","doi":"10.1145/3397619.3397620","title":"Verification column","year":2020,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Formal Methods in Verification","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":"Column (typography); Computer science; Focus (optics); Quarter (Canadian coin); Automaton; Artificial intelligence; Telecommunications","score_opus":0.07760133858126825,"score_gpt":0.2978954237337485,"score_spread":0.22029408515248025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235412025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075385636,0.00006556097,0.9750484,0.010577934,0.00039734546,0.00019296618,0.0000012958983,0.0003721223,0.005805787],"genre_scores_gemma":[0.21862534,0.000020238962,0.7771962,0.0038970949,0.00013842164,0.000023856455,0.00000400358,0.0000077672075,0.00008706462],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990331,0.000097316035,0.00019343405,0.00033199755,0.00017970339,0.00016446802],"domain_scores_gemma":[0.998695,0.00006801381,0.00009260544,0.0009816614,0.000051713836,0.00011100274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018776534,0.000084092804,0.00009976955,0.000026766184,0.000073929696,0.00009543051,0.0016049005,0.000057711874,0.000030068888],"category_scores_gemma":[0.0009937162,0.00008733316,0.000036806912,0.0004520997,0.000029881096,0.0005114443,0.00027741233,0.000107131615,0.00065946294],"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.000024635588,0.000068158595,0.0028559742,0.000036365946,0.000018496987,0.000008564106,0.003411357,0.00012661252,0.05084654,0.36461213,0.04474605,0.5332451],"study_design_scores_gemma":[0.0008558157,0.0005086463,0.033090565,0.000015195157,0.00001702325,0.000018896071,0.00017975627,0.17349726,0.07281586,0.020622743,0.6976135,0.0007647358],"about_ca_topic_score_codex":0.00002033749,"about_ca_topic_score_gemma":0.0000018728933,"teacher_disagreement_score":0.65286744,"about_ca_system_score_codex":0.000027408325,"about_ca_system_score_gemma":0.000040535906,"threshold_uncertainty_score":0.8476282},"labels":[],"label_agreement":null},{"id":"W4255700447","doi":"10.1145/3467001.3467002","title":"Verification column","year":2021,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Duration (music); Column (typography); Computer science; Quarter (Canadian coin); Field (mathematics); State (computer science); Work (physics); Mathematics; Engineering; Algorithm; Telecommunications; Mechanical engineering; Art; Geography","score_opus":0.23004888814771898,"score_gpt":0.45732981026799424,"score_spread":0.22728092212027526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255700447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5475341,0.00054960145,0.20577827,0.05322624,0.0008115682,0.00086552434,0.000061266976,0.00077522575,0.19039822],"genre_scores_gemma":[0.9708925,0.000027716826,0.015612543,0.0015070997,0.00009701326,0.00004408943,0.00002279252,0.000007433406,0.011788823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986529,0.000076427794,0.00035203897,0.000353291,0.0004504126,0.00011496624],"domain_scores_gemma":[0.99723136,0.00074123853,0.00010857522,0.0014938313,0.00036077778,0.00006419185],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042174952,0.00006199679,0.00011502033,0.00005820499,0.00013234142,0.00017341085,0.0006147339,0.00006256489,0.001951297],"category_scores_gemma":[0.0036319292,0.0000545184,0.000068751164,0.0008411663,0.000034817487,0.00013972912,0.00014843648,0.000065391505,0.0013931262],"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.000006971266,0.00012544199,0.028649697,0.000001517875,0.000008313163,0.000006496624,0.00023481641,0.0001327401,0.028409509,0.061269406,0.4215512,0.45960388],"study_design_scores_gemma":[0.0001059763,0.000010078505,0.025388272,0.0000017573899,0.0000036881463,0.0000046021123,0.0002326215,0.00046753275,0.012964989,0.14810403,0.81263226,0.00008420801],"about_ca_topic_score_codex":0.00003076531,"about_ca_topic_score_gemma":0.000047264217,"teacher_disagreement_score":0.45951968,"about_ca_system_score_codex":0.000020770358,"about_ca_system_score_gemma":0.00007046073,"threshold_uncertainty_score":0.9993844},"labels":[],"label_agreement":null},{"id":"W4293248785","doi":"10.1145/3559736.3559739","title":"Complexity column","year":2022,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Constraint Satisfaction and Optimization","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":"Simon Fraser University","funders":"","keywords":"Column (typography); Constraint satisfaction problem; Generalization; Constraint (computer-aided design); Computer science; Quarter (Canadian coin); Theoretical computer science; Mathematics; Artificial intelligence; Geography; Telecommunications","score_opus":0.04491169681758451,"score_gpt":0.260486389094718,"score_spread":0.2155746922771335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293248785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02052529,0.000057821904,0.9256755,0.020031128,0.001813411,0.00036897234,0.000017591277,0.00067065866,0.03083961],"genre_scores_gemma":[0.90733516,0.0000063666325,0.0876517,0.0038642667,0.000043363434,0.00003680197,0.0000144265,0.0000060195184,0.0010418933],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992663,0.00008512787,0.00011892833,0.00020685354,0.0001891912,0.00013358989],"domain_scores_gemma":[0.99926686,0.00006429245,0.00005227419,0.000543241,0.000022892364,0.000050454928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001165722,0.0000579371,0.00007356167,0.00005351978,0.00032519028,0.00006467655,0.0007205642,0.000014008324,0.0013749931],"category_scores_gemma":[0.000061765044,0.00006646523,0.000036552272,0.00031751188,0.000034162967,0.0001694545,0.00068758824,0.000115321636,0.00006978307],"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.000014533993,0.00016676536,0.03367389,0.000007015933,0.000028392044,0.00004166594,0.0015089326,0.007336902,0.00084718404,0.37183297,0.13189295,0.45264882],"study_design_scores_gemma":[0.0014608507,0.00029668375,0.09496084,0.0000034896286,0.0000104815235,0.00020178322,0.0005047158,0.14407933,0.000270844,0.075097516,0.68244094,0.0006725103],"about_ca_topic_score_codex":0.00011951453,"about_ca_topic_score_gemma":0.00010874641,"teacher_disagreement_score":0.8868099,"about_ca_system_score_codex":0.000059646285,"about_ca_system_score_gemma":0.000057934496,"threshold_uncertainty_score":0.9995379},"labels":[],"label_agreement":null},{"id":"W4389314516","doi":"10.1145/3636362.3636364","title":"Complexity Column","year":2023,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"semigroups and automata theory","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":"Simon Fraser University","funders":"","keywords":"Undecidable problem; Word problem (mathematics education); Decidability; Semigroup; Intersection (aeronautics); Mathematics; Group (periodic table); Column (typography); Decision problem; Computational complexity theory; Word (group theory); Discrete mathematics; Computer science; Theoretical computer science; Algebra over a field; Algorithm; Arithmetic; Pure mathematics","score_opus":0.06774780822632265,"score_gpt":0.28834727794661924,"score_spread":0.2205994697202966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389314516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80089116,0.00028373866,0.11418723,0.031143295,0.0036528497,0.0006419007,0.000028734987,0.007697579,0.04147351],"genre_scores_gemma":[0.96517843,0.000038009646,0.027804442,0.003915319,0.00022495196,0.00002656465,0.000018886672,0.000018158475,0.0027752167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900633,0.000058275444,0.00014434301,0.000303457,0.00017827842,0.00030929066],"domain_scores_gemma":[0.99843735,0.00023509676,0.00004409602,0.0011788419,0.000022643033,0.00008196068],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002568048,0.000095931675,0.00013204926,0.000072816634,0.00012854117,0.00012156821,0.0017609877,0.00004503014,0.000083160514],"category_scores_gemma":[0.00016543717,0.00008939292,0.00005823435,0.0006704933,0.00006451898,0.0002449986,0.0009538431,0.00008630574,0.0024481546],"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.0000043823497,0.000058015245,0.0041301576,0.000016022354,0.000022310845,0.00011466054,0.0008383735,0.000029984529,0.0038361012,0.46658507,0.3721539,0.15221104],"study_design_scores_gemma":[0.00055881223,0.00010546459,0.06249384,0.000019928793,0.0000056532062,0.00003103154,0.00015861438,0.03549786,0.0018098328,0.71532047,0.18354154,0.00045695243],"about_ca_topic_score_codex":0.00012629952,"about_ca_topic_score_gemma":0.00004541925,"teacher_disagreement_score":0.24873541,"about_ca_system_score_codex":0.000017736591,"about_ca_system_score_gemma":0.000029030807,"threshold_uncertainty_score":0.99832857},"labels":[],"label_agreement":null},{"id":"W4396981000","doi":"10.1145/3665453.3665456","title":"Semantics Column","year":2024,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Column (typography); Computer science; Semantics (computer science); Programming language; Natural language processing; Computer network","score_opus":0.030720587013988346,"score_gpt":0.2712612910600725,"score_spread":0.24054070404608419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396981000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003965175,0.0039629466,0.93378335,0.0069732675,0.007069553,0.00045061955,0.0000012456761,0.0018372162,0.04195662],"genre_scores_gemma":[0.987414,0.0000388119,0.0064396434,0.00045250065,0.00035394795,0.000015741914,0.0000022887102,0.000011633064,0.005271408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989585,0.00004352357,0.0001730218,0.00035398352,0.00019487295,0.00027609966],"domain_scores_gemma":[0.99888635,0.00012729221,0.00002961986,0.00084500015,0.00003240655,0.000079320176],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021067652,0.00011092518,0.0001338469,0.00006262714,0.000075791984,0.00051278505,0.00109686,0.000076046505,0.000026796382],"category_scores_gemma":[0.00009062559,0.00009035859,0.00007627557,0.00038196312,0.000031557636,0.0002588038,0.0003888019,0.00012195896,0.0013338958],"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":[8.715009e-7,0.000029784196,0.0016267131,0.00007296701,0.00003261543,0.00020714731,0.0009860607,0.0000047125623,0.00036075668,0.7823043,0.07452676,0.13984734],"study_design_scores_gemma":[0.00009725677,0.00009076751,0.0002656616,0.000007956848,0.00000884001,0.00006359226,0.000040873732,0.0047812425,0.00035979162,0.0934955,0.9005964,0.00019210443],"about_ca_topic_score_codex":0.00017686222,"about_ca_topic_score_gemma":0.000085231324,"teacher_disagreement_score":0.98344886,"about_ca_system_score_codex":0.00002677701,"about_ca_system_score_gemma":0.00006926065,"threshold_uncertainty_score":0.9994437},"labels":[],"label_agreement":null},{"id":"W4396981003","doi":"10.1145/3665453.3665457","title":"A Brief Survey on the Categorical Semantics for Geometry of Interaction In Memory of Phil Scott","year":2024,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, programming, and type systems","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":"Categorical variable; Semantics (computer science); Cognitive science; Psychology; Mathematics; Geometry; Algebra over a field; Computer science; Pure mathematics; Programming language; Statistics","score_opus":0.06361505629553076,"score_gpt":0.30586267434246445,"score_spread":0.24224761804693368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396981003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38201618,0.001941975,0.5986143,0.0055504576,0.0064135855,0.001770294,0.000015943131,0.00022461035,0.0034526421],"genre_scores_gemma":[0.9992754,0.00001836349,0.00037637446,0.000097359894,0.00007598056,0.000016022635,0.000005009042,0.000007231961,0.00012829989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899065,0.0001409196,0.00030042563,0.00023616645,0.00017420396,0.00015764768],"domain_scores_gemma":[0.9978982,0.0013814863,0.00009839913,0.00054156117,0.00005549631,0.000024849229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083431846,0.00008977682,0.00019494568,0.0001436375,0.000024297007,0.000058158723,0.0006591592,0.00006778549,0.0000051119873],"category_scores_gemma":[0.00069438474,0.000058133523,0.00007893876,0.00059674063,0.000040359264,0.00012282463,0.00015648229,0.00013335713,0.000010505762],"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.00012912857,0.00064990524,0.02666618,0.00079059135,0.00018487226,0.00004413044,0.0056150397,0.00025344125,0.0050207125,0.7289271,0.027333263,0.20438568],"study_design_scores_gemma":[0.0046972064,0.007021089,0.17123127,0.0005715511,0.00017346033,0.00018623527,0.0026644561,0.13754761,0.136496,0.42333677,0.113674805,0.0023995123],"about_ca_topic_score_codex":0.0020177301,"about_ca_topic_score_gemma":0.00055749103,"teacher_disagreement_score":0.61725914,"about_ca_system_score_codex":0.000026238424,"about_ca_system_score_gemma":0.000060576534,"threshold_uncertainty_score":0.30502176},"labels":[],"label_agreement":null},{"id":"W4396981007","doi":"10.1145/3665453.3665458","title":"Complexity Column","year":2024,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Column (typography); Computer science; Telecommunications","score_opus":0.06455749615922264,"score_gpt":0.29774494069782637,"score_spread":0.23318744453860374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396981007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01670816,0.0032792261,0.890777,0.026726497,0.0069525703,0.00049998553,0.000034728506,0.0034404423,0.0515814],"genre_scores_gemma":[0.6440212,0.000121392244,0.34829167,0.0035963217,0.0007771952,0.000045241,0.000016407756,0.00003288128,0.0030977034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986479,0.00005999328,0.00020434972,0.0004991279,0.00025597887,0.0003326222],"domain_scores_gemma":[0.99834025,0.00028471462,0.000024993293,0.0012021642,0.00003505487,0.00011282731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020296515,0.00014801338,0.0001648084,0.00012152502,0.0001692215,0.0005070706,0.0020026919,0.00006033671,0.00018231128],"category_scores_gemma":[0.000095957475,0.00014030114,0.00012934694,0.0007615176,0.00014392665,0.00045164753,0.0009422669,0.00023372531,0.00071979495],"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.0000016521466,0.000043469325,0.00027787077,0.000029422701,0.00002727614,0.00010672084,0.00040306555,0.00000627739,0.00023372273,0.7261569,0.06667213,0.2060415],"study_design_scores_gemma":[0.00012645472,0.000074875934,0.0019363388,0.00003609841,0.00000634296,0.00006242481,0.00002194954,0.036504403,0.00030374055,0.5631568,0.39751056,0.0002600322],"about_ca_topic_score_codex":0.00021333034,"about_ca_topic_score_gemma":0.00014800107,"teacher_disagreement_score":0.627313,"about_ca_system_score_codex":0.000036293754,"about_ca_system_score_gemma":0.00007669826,"threshold_uncertainty_score":0.92517483},"labels":[],"label_agreement":null},{"id":"W4401359032","doi":"10.1145/3687256.3687259","title":"Semantics Column","year":2024,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Column (typography); Semantics (computer science); Computer science; Programming language; Computer network","score_opus":0.030720587013988346,"score_gpt":0.2712612910600725,"score_spread":0.24054070404608419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401359032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003965175,0.0039629466,0.93378335,0.0069732675,0.007069553,0.00045061955,0.0000012456761,0.0018372162,0.04195662],"genre_scores_gemma":[0.987414,0.0000388119,0.0064396434,0.00045250065,0.00035394795,0.000015741914,0.0000022887102,0.000011633064,0.005271408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989585,0.00004352357,0.0001730218,0.00035398352,0.00019487295,0.00027609966],"domain_scores_gemma":[0.99888635,0.00012729221,0.00002961986,0.00084500015,0.00003240655,0.000079320176],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021067652,0.00011092518,0.0001338469,0.00006262714,0.000075791984,0.00051278505,0.00109686,0.000076046505,0.000026796382],"category_scores_gemma":[0.00009062559,0.00009035859,0.00007627557,0.00038196312,0.000031557636,0.0002588038,0.0003888019,0.00012195896,0.0013338958],"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":[8.715009e-7,0.000029784196,0.0016267131,0.00007296701,0.00003261543,0.00020714731,0.0009860607,0.0000047125623,0.00036075668,0.7823043,0.07452676,0.13984734],"study_design_scores_gemma":[0.00009725677,0.00009076751,0.0002656616,0.000007956848,0.00000884001,0.00006359226,0.000040873732,0.0047812425,0.00035979162,0.0934955,0.9005964,0.00019210443],"about_ca_topic_score_codex":0.00017686222,"about_ca_topic_score_gemma":0.000085231324,"teacher_disagreement_score":0.98344886,"about_ca_system_score_codex":0.00002677701,"about_ca_system_score_gemma":0.00006926065,"threshold_uncertainty_score":0.9994437},"labels":[],"label_agreement":null},{"id":"W4408293789","doi":"10.1145/3723141.3723144","title":"Complexity Column","year":2025,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Column (typography); Computer science; Computer network","score_opus":0.04422964664292883,"score_gpt":0.2960666793611475,"score_spread":0.25183703271821867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408293789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014531628,0.0005133917,0.85195076,0.022831641,0.00279725,0.00042538496,0.0000111868685,0.00092383963,0.106014915],"genre_scores_gemma":[0.49572995,0.00006805813,0.4840949,0.01332321,0.00022762075,0.00005535507,0.000012211822,0.000014469516,0.006474236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877703,0.00007464701,0.00022539082,0.00042094942,0.00018354483,0.000318441],"domain_scores_gemma":[0.99799484,0.00025596534,0.00005149356,0.0015586301,0.000064192216,0.00007485259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017778919,0.00013839111,0.00019907736,0.00013669208,0.0002618036,0.0001886359,0.0026247508,0.00006464693,0.000074063995],"category_scores_gemma":[0.0002043104,0.00014073684,0.00010496022,0.0008761007,0.00016314206,0.00025619997,0.0013720033,0.00018351643,0.00013416292],"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.000003778362,0.00008542638,0.0028980367,0.000013150066,0.000024310686,0.000012788511,0.00012759535,0.0000072762355,0.00016254527,0.8147264,0.059341427,0.12259724],"study_design_scores_gemma":[0.00041075234,0.00004952966,0.017293183,0.000024198409,0.000006632229,0.00000776039,0.000029943438,0.0075189318,0.00059952994,0.7505542,0.22328219,0.0002231174],"about_ca_topic_score_codex":0.00030028852,"about_ca_topic_score_gemma":0.00027733852,"teacher_disagreement_score":0.4811983,"about_ca_system_score_codex":0.000036423666,"about_ca_system_score_gemma":0.00008993181,"threshold_uncertainty_score":0.5739082},"labels":[],"label_agreement":null},{"id":"W4410161521","doi":"10.1145/3734192.3734194","title":"Semantics Column","year":2025,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Column (typography); Semantics (computer science); Computer science; Programming language; Computer network","score_opus":0.02335366936589616,"score_gpt":0.2695427972365912,"score_spread":0.24618912787069502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410161521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034946885,0.000707969,0.9023756,0.0061136116,0.0030453892,0.00039662054,4.4281222e-7,0.0005499153,0.083315775],"genre_scores_gemma":[0.97977036,0.000021817463,0.00868551,0.001467694,0.00010659183,0.000018051423,0.000001677439,0.000005088187,0.009923202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990474,0.000053819196,0.00018960575,0.00030145815,0.00014271429,0.00026503162],"domain_scores_gemma":[0.9986355,0.00011690987,0.000058337348,0.0010779261,0.00005732853,0.000054053642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018613187,0.00010405876,0.00015993639,0.000069899164,0.00011466179,0.00020248159,0.0014160204,0.00008116792,0.000011529487],"category_scores_gemma":[0.00018541179,0.00009062559,0.00006270553,0.00043450395,0.00003531957,0.00015336457,0.0005491592,0.00009676584,0.00027053375],"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.0000017901409,0.000053046773,0.01392716,0.00003239445,0.00002752448,0.000026604876,0.00031613745,0.000005135044,0.00024077088,0.84124297,0.06214293,0.08198356],"study_design_scores_gemma":[0.0003722036,0.00007784612,0.002696578,0.000006942399,0.000011544226,0.0000112132775,0.00006799756,0.0013591914,0.00086047646,0.17268442,0.82164115,0.0002104602],"about_ca_topic_score_codex":0.0002471646,"about_ca_topic_score_gemma":0.00015440662,"teacher_disagreement_score":0.9762757,"about_ca_system_score_codex":0.000026817166,"about_ca_system_score_gemma":0.00008140978,"threshold_uncertainty_score":0.36956042},"labels":[],"label_agreement":null}]}