{"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":"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.66276944,0.0011765524,0.30981284,0.012462848,0.000679332,0.0014518591,0.000011259313,0.00042763836,0.011208239],"genre_scores_gemma":[0.9591924,0.00012748575,0.03972342,0.00019825401,0.00003174845,0.000025638265,0.0000010093539,0.000010871344,0.0006891513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985317,0.00016661691,0.0002492833,0.0002771737,0.00039813897,0.00037706015],"domain_scores_gemma":[0.99679905,0.0010635938,0.000109711866,0.0018308643,0.000106222615,0.00009056891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547636,0.000115160256,0.00016673665,0.00006131647,0.00033122566,0.00004325036,0.0027815888,0.00003849102,0.000015516564],"category_scores_gemma":[0.000671607,0.0000752867,0.00009636463,0.0004882766,0.00088317547,0.00034036714,0.0007817542,0.00021021966,0.000071394235],"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.00012339054,0.0003994218,0.020787999,0.00006285164,0.00014370347,0.00006953738,0.0047333264,0.0004487387,0.029000271,0.7772392,0.015716465,0.15127507],"study_design_scores_gemma":[0.000543378,0.00030882546,0.013344874,0.00002027503,0.0000032775843,0.000071305294,0.000050890158,0.0036585573,0.027244745,0.9202768,0.034192815,0.00028424792],"about_ca_topic_score_codex":0.000058587466,"about_ca_topic_score_gemma":0.0000388647,"teacher_disagreement_score":0.296423,"about_ca_system_score_codex":0.000020498677,"about_ca_system_score_gemma":0.00006590082,"threshold_uncertainty_score":0.516893},"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":"methods","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.03654871,0.5120419,0.43068066,0.012602496,0.0016452961,0.0019107653,0.00032097969,0.00035995906,0.0038891877],"genre_scores_gemma":[0.036554452,0.36307427,0.59247255,0.0069726724,0.00043176842,0.000017741108,0.0002554609,0.000039556497,0.00018156199],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868554,0.00007499541,0.0003373525,0.00046851553,0.00022267099,0.00021095423],"domain_scores_gemma":[0.9972909,0.00016342016,0.0001355854,0.002286402,0.000038394104,0.00008527297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034722232,0.0001378363,0.00029249853,0.00007323057,0.000040497765,0.000053359894,0.0022995186,0.000052512973,0.000062872205],"category_scores_gemma":[0.00025811512,0.00010669354,0.000025396468,0.00032409147,0.00003965849,0.001013035,0.0021893997,0.00013401265,0.000007360633],"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.000004047424,0.00003483792,0.0018191922,0.00030513082,0.000006455383,0.000029886938,0.00008713329,0.0000013209199,0.00019573333,0.00043969924,0.037684083,0.9593925],"study_design_scores_gemma":[0.0014908296,0.00021956756,0.03360058,0.0053724824,0.000024686973,0.00023236703,0.00006481441,0.024362898,0.0007386042,0.015840644,0.9172823,0.0007702546],"about_ca_topic_score_codex":0.0005812189,"about_ca_topic_score_gemma":0.000039062936,"teacher_disagreement_score":0.9586222,"about_ca_system_score_codex":0.000010962488,"about_ca_system_score_gemma":0.000048630198,"threshold_uncertainty_score":0.43508363},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38847703,0.0000053370686,0.6040685,0.0032704328,0.00017003824,0.00044047507,1.8084029e-7,0.00021396921,0.003354026],"genre_scores_gemma":[0.8075356,0.0000027578126,0.1905315,0.0013374758,0.000038871778,0.000012805776,5.825175e-7,0.000012523598,0.0005278737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886775,0.000050807477,0.00015054522,0.00036727774,0.0002948007,0.00026881308],"domain_scores_gemma":[0.9986312,0.00014501724,0.000053660297,0.0009130354,0.00006899327,0.00018809075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020414733,0.00013493148,0.000120055374,0.0001140295,0.00018873897,0.0003197946,0.0008001079,0.00003633249,0.000030751187],"category_scores_gemma":[0.00011984773,0.0001031935,0.00002106268,0.00039036985,0.00001479716,0.0006277792,0.0002967789,0.00029287636,0.00007516445],"study_design_candidate":"simulation_or_modeling","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.00008995629,0.0010891334,0.0062820963,0.000033370292,0.00018480545,0.011663814,0.0676529,0.073688336,0.00094140443,0.38143092,0.008369338,0.44857392],"study_design_scores_gemma":[0.007706406,0.0031229812,0.00055884465,0.00015988841,0.000034714576,0.005412847,0.005625154,0.8457701,0.0017540773,0.11756541,0.010146157,0.002143381],"about_ca_topic_score_codex":0.0015043436,"about_ca_topic_score_gemma":0.0012983285,"teacher_disagreement_score":0.7720818,"about_ca_system_score_codex":0.000021403757,"about_ca_system_score_gemma":0.00035674075,"threshold_uncertainty_score":0.42081088},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594456,0.0010171717,0.008429578,0.0017431608,0.0008200498,0.00072578323,0.00006653209,0.00025647107,0.02749566],"genre_scores_gemma":[0.9994438,0.000010059235,0.00019638526,0.00006240668,0.000033760673,0.000007821525,0.0000026910918,0.000013511441,0.00022954964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992947,0.0000796231,0.00021466507,0.0000785558,0.00017144794,0.00016103503],"domain_scores_gemma":[0.999262,0.00022804615,0.000046718138,0.00040251546,0.000027535641,0.0000331836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014525403,0.000095657386,0.0001086785,0.000015680402,0.00014878315,0.000024518606,0.00043813806,0.000037484577,0.00009129697],"category_scores_gemma":[0.00002598248,0.00005572674,0.000082637045,0.00014725883,0.00020591449,0.000052672585,0.00005653636,0.0001336379,0.00004355424],"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.00005965727,0.00021648496,0.0118559785,0.00040233083,0.00046191856,0.000009161888,0.0077728,0.40176812,0.0072329375,0.45147258,0.06429909,0.054448932],"study_design_scores_gemma":[0.002188666,0.00023314891,0.05183016,0.0002583469,0.00008072595,0.000082008606,0.003787007,0.28621313,0.009070192,0.45655403,0.1886542,0.0010483826],"about_ca_topic_score_codex":0.00003135787,"about_ca_topic_score_gemma":0.000060659255,"teacher_disagreement_score":0.124355115,"about_ca_system_score_codex":0.000019742018,"about_ca_system_score_gemma":0.00000540838,"threshold_uncertainty_score":0.22724706},"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":"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.79983675,0.06533333,0.1122102,0.015654324,0.0005723505,0.0035696458,0.00005936237,0.0005268389,0.0022372105],"genre_scores_gemma":[0.9107381,0.0041921125,0.07968601,0.0051096263,0.00008628385,0.000052941377,0.000018436034,0.000028107967,0.00008834559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975521,0.0005588528,0.00054081803,0.00071550015,0.00028692413,0.00034580255],"domain_scores_gemma":[0.996726,0.0010378847,0.00021932296,0.0016008813,0.00017798203,0.00023794106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011119894,0.00027188618,0.0006270131,0.000052576455,0.00010408639,0.000113013964,0.001211673,0.000078285324,0.00013070404],"category_scores_gemma":[0.0004385732,0.00022424865,0.000085855165,0.00030645594,0.00043625914,0.0005065165,0.0016734916,0.00020994537,0.000023257746],"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.000013321921,0.00059875066,0.04843171,0.004580799,0.00011138795,0.000004065279,0.0014642803,0.0000035813339,0.0012668963,0.013490876,0.035272565,0.89476174],"study_design_scores_gemma":[0.0019009671,0.0009451715,0.411479,0.0016623158,0.00009443658,0.00012738882,0.00018693433,0.01858913,0.0011242608,0.525615,0.036605246,0.0016701675],"about_ca_topic_score_codex":0.00060001854,"about_ca_topic_score_gemma":0.000022694576,"teacher_disagreement_score":0.8930916,"about_ca_system_score_codex":0.00004148497,"about_ca_system_score_gemma":0.000046816614,"threshold_uncertainty_score":0.91445947},"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":"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.0043520494,0.00017977552,0.8513386,0.020204984,0.0003928934,0.00024955143,0.0000014810106,0.00053233485,0.122748315],"genre_scores_gemma":[0.49995518,0.000091110036,0.4566044,0.0050481865,0.0004581856,0.000029560933,0.000017124854,0.000025935367,0.037770323],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927247,0.00003147065,0.00011896558,0.00017928326,0.00016531268,0.0002324888],"domain_scores_gemma":[0.9992035,0.00005714845,0.000030580053,0.0006139924,0.000030528736,0.00006423726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111853835,0.000063695144,0.000065170476,0.00005471072,0.00006683692,0.00014627469,0.0008336579,0.00003066487,0.00015189458],"category_scores_gemma":[0.000048836475,0.00005582403,0.00003223862,0.00019574276,0.00001535015,0.00035744475,0.0002056512,0.00006746545,0.0005048985],"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.000004443715,0.00021921062,0.005146749,0.000011286971,0.0000126758805,0.000033682543,0.00031596352,0.0076397723,0.0042316155,0.23434164,0.6528672,0.09517579],"study_design_scores_gemma":[0.00061926356,0.00006195377,0.004647517,0.000009447052,0.0000022672389,0.000011631603,0.000013166755,0.056107737,0.0034103484,0.036908805,0.89788896,0.0003188783],"about_ca_topic_score_codex":0.0001596752,"about_ca_topic_score_gemma":0.000069168906,"teacher_disagreement_score":0.49560314,"about_ca_system_score_codex":0.000017185102,"about_ca_system_score_gemma":0.00004281545,"threshold_uncertainty_score":0.64896166},"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":"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.5374971,0.18853214,0.2113334,0.022643726,0.0018861106,0.0023448777,0.000056410296,0.00024772124,0.035458513],"genre_scores_gemma":[0.9000993,0.033202358,0.050104123,0.015213746,0.00026687668,0.00003959238,0.000005577801,0.000014457049,0.0010539741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885166,0.0002428916,0.00035819793,0.00020627935,0.00019369216,0.00014725371],"domain_scores_gemma":[0.99744016,0.001462193,0.0002853078,0.00066002336,0.00010398434,0.000048320864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055153767,0.000111698726,0.00032783145,0.0000343218,0.000095474585,0.000011797052,0.0006615368,0.000031954405,0.00012042853],"category_scores_gemma":[0.0010092856,0.000067220564,0.00008567322,0.00022696352,0.00041355717,0.00037009557,0.0002436996,0.00011359857,0.000010185825],"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.00005730861,0.0000993306,0.0005337755,0.0013872624,0.00009099463,0.000033755707,0.0023937891,0.000030819654,0.0012803721,0.95962924,0.004760839,0.029702533],"study_design_scores_gemma":[0.0033771906,0.0005289801,0.01519985,0.00240496,0.00015080895,0.0003282024,0.00022009607,0.0017675562,0.016300142,0.9280222,0.03098891,0.000711087],"about_ca_topic_score_codex":0.0000225014,"about_ca_topic_score_gemma":0.0000073841666,"teacher_disagreement_score":0.3626022,"about_ca_system_score_codex":0.000005241337,"about_ca_system_score_gemma":0.000059424,"threshold_uncertainty_score":0.2741175},"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":"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.031234693,0.000045275607,0.48271874,0.4765758,0.0056321505,0.0013895867,0.000018067862,0.00061072945,0.0017749819],"genre_scores_gemma":[0.12309209,0.00020183586,0.82062286,0.027807174,0.0122885965,0.00017196828,0.0001132293,0.000094204595,0.015608059],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981909,0.00011779646,0.00030023995,0.0005472816,0.00042375768,0.00042004968],"domain_scores_gemma":[0.9973291,0.00017330943,0.00009465657,0.0019628087,0.00018242376,0.0002576742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039953392,0.00017692645,0.00017281575,0.00012232686,0.0002757484,0.0004637927,0.0021781432,0.00009448152,0.00033287238],"category_scores_gemma":[0.0008771574,0.00012924206,0.00007879648,0.0008446472,0.000051749365,0.0006041939,0.0006229592,0.00052310276,0.0006850403],"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.000012351017,0.0002708884,0.0006501491,0.0000074115214,0.000029425344,0.0000075205903,0.0016214534,0.0039924723,0.013130919,0.004738631,0.39008123,0.58545756],"study_design_scores_gemma":[0.00032093647,0.00018320969,0.0010667472,0.000004653922,0.0000053816793,0.000021436292,0.00014597666,0.045286585,0.0016619256,0.0010229464,0.95002824,0.00025194162],"about_ca_topic_score_codex":0.000503077,"about_ca_topic_score_gemma":0.0021077306,"teacher_disagreement_score":0.5852056,"about_ca_system_score_codex":0.000033649867,"about_ca_system_score_gemma":0.00013106511,"threshold_uncertainty_score":0.88050354},"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":"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.03587414,0.095125034,0.85701066,0.0069073928,0.00016282189,0.0015963075,0.00021546149,0.00018519688,0.0029229785],"genre_scores_gemma":[0.10464491,0.13102342,0.741229,0.0175783,0.00070282596,0.00038110669,0.0010904669,0.00008031897,0.003269634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838805,0.00012503054,0.0004310691,0.00047384299,0.0003318622,0.0002501615],"domain_scores_gemma":[0.9985727,0.00047896805,0.00016114594,0.00047508735,0.00012517963,0.00018690022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046373054,0.00019798796,0.00028775365,0.00013516942,0.00017709285,0.00010407019,0.0004809977,0.00007451091,0.00028842],"category_scores_gemma":[0.00011463365,0.0002043865,0.000058629732,0.00071814866,0.00008017516,0.0004999367,0.0002100549,0.00013566118,0.000019909397],"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.0000127718595,0.000117399184,0.000745006,0.0005482108,0.000052244926,0.0000024815665,0.00007017872,0.00056080736,0.0003710411,0.00343665,0.07386138,0.9202218],"study_design_scores_gemma":[0.0013416306,0.00020641224,0.01581488,0.00082910206,0.000086711756,0.0002032442,0.000019322526,0.028221987,0.0006671468,0.041144475,0.91068274,0.0007823217],"about_ca_topic_score_codex":0.000055995326,"about_ca_topic_score_gemma":0.0000031725285,"teacher_disagreement_score":0.9194395,"about_ca_system_score_codex":0.000039669954,"about_ca_system_score_gemma":0.00013583506,"threshold_uncertainty_score":0.8334639},"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":"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.75799835,0.0078728385,0.000083741,0.17133574,0.0006892615,0.0011617985,0.000011849017,0.00030481128,0.06054161],"genre_scores_gemma":[0.8618297,0.041757505,0.0020050276,0.06996284,0.0007153986,0.00007371056,0.000005988965,0.00003402202,0.02361584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980766,0.0005468408,0.00024602606,0.00024949998,0.0005058556,0.0003751391],"domain_scores_gemma":[0.9986782,0.00029818097,0.00007359991,0.0005461047,0.000104704144,0.0002992187],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001603326,0.00010592365,0.00025820153,0.00003657182,0.0006958934,0.000055429533,0.0005369877,0.000096240765,0.0005710876],"category_scores_gemma":[0.007531549,0.00010743334,0.00019013316,0.0005226728,0.00018335138,0.00024612562,0.00014793788,0.00016093493,0.0010298538],"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.000016054839,0.00007393911,0.0033767193,0.000055689023,0.000022561368,0.00006677459,0.016417868,6.3421993e-7,0.00083359843,0.0019251776,0.97401357,0.003197444],"study_design_scores_gemma":[0.00014582017,0.00004448205,0.02137591,0.00018479706,0.000013681353,0.000004951942,0.0008905874,1.6336364e-7,0.00008451041,0.00046049265,0.9766329,0.00016169938],"about_ca_topic_score_codex":0.0052850116,"about_ca_topic_score_gemma":0.00095171446,"teacher_disagreement_score":0.10383132,"about_ca_system_score_codex":0.000150344,"about_ca_system_score_gemma":0.0004032306,"threshold_uncertainty_score":0.99974793},"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":"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.000043203203,0.0032086466,0.9593099,0.0320554,0.00021923464,0.0004556431,0.000005896361,0.00008059211,0.00462148],"genre_scores_gemma":[0.0038483879,0.024724793,0.95143193,0.016123518,0.00019082312,0.000057611538,0.000011587609,0.00003838111,0.0035729383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978288,0.00011078616,0.0004394979,0.00048816454,0.0007148282,0.0004179494],"domain_scores_gemma":[0.9965389,0.00037992472,0.00016230578,0.0021230506,0.000479267,0.00031659674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801263,0.00018240574,0.0003978837,0.00018328626,0.000068900714,0.00012196736,0.0024953051,0.000056579185,0.00026539873],"category_scores_gemma":[0.0051395493,0.00016422283,0.000107298154,0.0010872753,0.000039786344,0.00030351648,0.0009017064,0.0001768438,0.00027898376],"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.000014180671,0.00021315433,0.00021295933,0.0012217655,0.000049690247,0.00009289317,0.0005465127,0.00066957454,0.0007405476,0.004283772,0.38790908,0.60404587],"study_design_scores_gemma":[0.0007383928,0.00037446863,0.0002550153,0.0025030526,0.000039398878,0.00008922661,0.000030032405,0.22912137,0.0017323559,0.005582829,0.75878304,0.00075079454],"about_ca_topic_score_codex":0.000042439828,"about_ca_topic_score_gemma":0.000009348039,"teacher_disagreement_score":0.6032951,"about_ca_system_score_codex":0.000047292284,"about_ca_system_score_gemma":0.00017469829,"threshold_uncertainty_score":0.6696813},"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":"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.91523594,0.0015720841,0.018930595,0.0035360437,0.0008106833,0.00035740403,0.000014673437,0.0011652721,0.05837731],"genre_scores_gemma":[0.98467,0.00024633156,0.012474272,0.0014541687,0.00009707579,0.0000067998676,0.000004612078,0.000016636035,0.0010301385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874985,0.00013290472,0.00026981437,0.0003198178,0.00023943695,0.00028815755],"domain_scores_gemma":[0.9976091,0.0003480752,0.000087003296,0.001841734,0.000022917673,0.00009121189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884149,0.0001489776,0.00020908074,0.00006919215,0.00006498163,0.00006618565,0.0022201447,0.000068397516,0.00090928475],"category_scores_gemma":[0.000102162616,0.00012340954,0.000105981846,0.00029258645,0.00006677312,0.000478373,0.00030693185,0.00010780176,0.000414409],"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.000018710973,0.00012228334,0.00012915298,0.000015090018,0.000025420408,0.00001995826,0.0013402218,0.000027981816,0.0025953513,0.1116217,0.0034337165,0.8806504],"study_design_scores_gemma":[0.002278295,0.00047904096,0.012806086,0.00021732257,0.00004965119,0.00014503559,0.0005265187,0.018397728,0.041208297,0.4882295,0.43435755,0.0013049636],"about_ca_topic_score_codex":0.000079225814,"about_ca_topic_score_gemma":0.0000025757943,"teacher_disagreement_score":0.8793455,"about_ca_system_score_codex":0.0000160219,"about_ca_system_score_gemma":0.000046388068,"threshold_uncertainty_score":0.9956031},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022902228,0.47956112,0.4098484,0.008072531,0.0004213517,0.002105128,0.00006656643,0.0008399827,0.07618268],"genre_scores_gemma":[0.4075307,0.42813963,0.09862222,0.039898444,0.0002934581,0.0003398265,0.000066191475,0.00023027102,0.02487928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787724,0.00039130126,0.00036536145,0.0004799117,0.00043726637,0.00044891928],"domain_scores_gemma":[0.9968516,0.000537076,0.00010396438,0.002256341,0.00008346234,0.00016753332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895925,0.00019607262,0.00034153348,0.00010163783,0.0000951317,0.00003996959,0.0029814383,0.0000640206,0.000589693],"category_scores_gemma":[0.00037939003,0.00016601113,0.00018946768,0.00085393514,0.0001579519,0.0005765349,0.0003299183,0.00024926045,0.00021606554],"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.000030136956,0.00010349619,0.000074914125,0.0003723582,0.000031964406,0.000009354055,0.00019395689,0.000013770127,0.0039578457,0.036160376,0.02353183,0.93552],"study_design_scores_gemma":[0.00035354032,0.00013672169,0.00006155363,0.0009705072,0.000012450251,0.000017586672,0.000008088444,0.00023395054,0.006533263,0.88156796,0.10977844,0.00032595923],"about_ca_topic_score_codex":0.000013236728,"about_ca_topic_score_gemma":0.0000018194456,"teacher_disagreement_score":0.935194,"about_ca_system_score_codex":0.000020863872,"about_ca_system_score_gemma":0.00006562729,"threshold_uncertainty_score":0.6769737},"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":"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.98114526,0.0003221184,0.00008412789,0.0009881833,0.0015773405,0.00011045387,0.000035489873,0.00002466176,0.015712366],"genre_scores_gemma":[0.99673057,0.000021240729,0.00007007421,0.00006131839,0.00018356905,0.000008968446,0.000002790062,0.000014158483,0.0029073316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924725,0.000039564755,0.00034756717,0.00016557545,0.000023810564,0.00017623778],"domain_scores_gemma":[0.99829626,0.0005147078,0.0003133954,0.00081419246,0.000017079414,0.000044338256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014424762,0.00008489689,0.0002180658,0.000046562338,0.00016833165,0.00003341041,0.00053215044,0.000070843016,0.00015524539],"category_scores_gemma":[0.0012102646,0.000068412286,0.00009041687,0.00009300816,0.00010298367,0.000086535816,0.0000761037,0.00029504692,0.00044193634],"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.00003104681,0.00005324164,0.086726174,0.000040208044,0.000059207858,0.0000014853925,0.001896132,0.000008534506,0.0029091912,0.89477676,0.0071607283,0.006337276],"study_design_scores_gemma":[0.0005323118,0.00008524207,0.06878293,0.000018849882,0.000007173437,0.000008782574,0.0008478172,0.00009630274,0.0025872912,0.15589078,0.7708134,0.0003291373],"about_ca_topic_score_codex":0.00013326966,"about_ca_topic_score_gemma":0.00012304688,"teacher_disagreement_score":0.7636526,"about_ca_system_score_codex":0.000010010518,"about_ca_system_score_gemma":0.000011576482,"threshold_uncertainty_score":0.56803447},"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":"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.09737463,0.008035847,0.8420578,0.0035930765,0.009193246,0.0012466954,0.000077581884,0.001400869,0.037020225],"genre_scores_gemma":[0.9731738,0.00015025967,0.021270564,0.0017163276,0.0004982065,0.000036196143,0.000014476831,0.000028475648,0.0031117138],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979689,0.0001242357,0.00037772488,0.0005671378,0.00043733383,0.00052465673],"domain_scores_gemma":[0.99796486,0.00011702393,0.00014273789,0.0014858827,0.0000780445,0.00021146277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120243,0.00024080176,0.000293944,0.00007706319,0.0002259611,0.00026369918,0.0014891848,0.00013414446,0.00003480854],"category_scores_gemma":[0.00024432887,0.00021020013,0.00012342064,0.00041653856,0.000039758375,0.00081743055,0.00032226,0.0002056271,0.0006170844],"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.000026771551,0.0007195297,0.001963474,0.000093755676,0.00011377258,0.0006158747,0.0050203586,0.00032764624,0.017553508,0.19353941,0.15188658,0.6281393],"study_design_scores_gemma":[0.0016093854,0.00023823549,0.0028025538,0.00008923567,0.000012168314,0.00016989557,0.00024803134,0.009062391,0.008062806,0.0077450834,0.9690465,0.00091371423],"about_ca_topic_score_codex":0.00009551427,"about_ca_topic_score_gemma":0.000008965593,"teacher_disagreement_score":0.8757991,"about_ca_system_score_codex":0.00006634761,"about_ca_system_score_gemma":0.000109484354,"threshold_uncertainty_score":0.85717124},"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":"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.23154551,0.00041954778,0.761752,0.0019722101,0.0012899647,0.00016406953,0.000004253444,0.00020052482,0.0026519261],"genre_scores_gemma":[0.8575789,0.000006684609,0.13958019,0.0017180934,0.0005023242,0.000012280201,0.000037810565,0.000008053207,0.0005556801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987137,0.00006776692,0.0002325161,0.00024912268,0.00039646466,0.0003404806],"domain_scores_gemma":[0.9987461,0.0003907092,0.00009051285,0.0004741315,0.00010494026,0.00019359724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030691345,0.00013077848,0.00013078241,0.0001901315,0.00017554183,0.00014631292,0.000707855,0.000060155577,0.00012352757],"category_scores_gemma":[0.00023401072,0.00013407433,0.00007267266,0.0007815755,0.000023014803,0.0010671146,0.00031136489,0.00011501755,0.00058323226],"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.000022840872,0.00079467864,0.047304552,0.000038818966,0.00012681913,0.000013213906,0.0024322816,0.04495408,0.002534475,0.29435915,0.11559436,0.49182475],"study_design_scores_gemma":[0.0018360548,0.00029352462,0.3705725,0.00003109364,0.00003630585,0.00021739182,0.00009407303,0.16605644,0.005614698,0.07658845,0.3772944,0.0013650787],"about_ca_topic_score_codex":0.000026734679,"about_ca_topic_score_gemma":0.000004021654,"teacher_disagreement_score":0.62603337,"about_ca_system_score_codex":0.000052033654,"about_ca_system_score_gemma":0.00008833503,"threshold_uncertainty_score":0.7496465},"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":"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.93845624,0.0010282535,0.00080924947,0.00030569255,0.00252667,0.00066519366,0.00012770816,0.0011570097,0.054923974],"genre_scores_gemma":[0.99716586,0.000023249891,0.00016790503,0.00055498746,0.00024746306,0.0001470785,0.000051238236,0.000084269814,0.0015579714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979645,0.00044373545,0.00040645537,0.000327747,0.00033591528,0.0005216707],"domain_scores_gemma":[0.99817467,0.00040108562,0.000079695994,0.0011460411,0.000020797763,0.00017771157],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062108535,0.00029919966,0.00039326545,0.00013164335,0.00041502164,0.00007471431,0.00095207756,0.00008159363,0.0030908796],"category_scores_gemma":[0.00011190287,0.0003216308,0.00022553945,0.00044342005,0.00008897281,0.00018780066,0.00029857567,0.0005332197,0.00030537712],"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.0007861384,0.0008122534,0.025571732,0.0006703699,0.0014337982,0.00044787614,0.013692267,0.04231329,0.08927307,0.3904832,0.35339502,0.08112099],"study_design_scores_gemma":[0.0016301249,0.0003540925,0.004977931,0.000039743285,0.000101721205,0.00013791483,0.0073036454,0.0021311683,0.004365695,0.17719105,0.80035216,0.0014147526],"about_ca_topic_score_codex":0.00022244577,"about_ca_topic_score_gemma":0.00015370134,"teacher_disagreement_score":0.44695714,"about_ca_system_score_codex":0.00013476923,"about_ca_system_score_gemma":0.000031794123,"threshold_uncertainty_score":0.9999236},"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":"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.025159672,0.0002976007,0.9672276,0.0008922895,0.00070317526,0.00089458394,0.00012973062,0.0040665073,0.000628862],"genre_scores_gemma":[0.90791035,0.0000040984387,0.09082018,0.0002797223,0.00017712617,0.0002484715,0.00019216162,0.000019735375,0.00034818065],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824077,0.000040738283,0.00036771697,0.00037644772,0.00024663197,0.00072769384],"domain_scores_gemma":[0.9980281,0.00009077119,0.00014897955,0.0013447902,0.00012580528,0.00026154157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036237165,0.00021313225,0.0002725836,0.000039466006,0.00015786866,0.00016122057,0.0011583815,0.00012306675,0.0000026197265],"category_scores_gemma":[0.0002018496,0.00018243678,0.00020423626,0.0004000781,0.000028248856,0.0009099641,0.00025187098,0.00009937715,0.00006258075],"study_design_candidate":"simulation_or_modeling","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.00010011213,0.0021980037,0.025229352,0.00037427893,0.00035189188,0.000019331359,0.0036090636,0.004358905,0.004023709,0.14693862,0.6391909,0.17360583],"study_design_scores_gemma":[0.00056007376,0.000075951735,0.0012125339,0.00003231472,0.000012479803,0.000012661333,0.000030336938,0.85197014,0.00036790772,0.00088680396,0.14452566,0.0003131258],"about_ca_topic_score_codex":0.00004764237,"about_ca_topic_score_gemma":0.000007880971,"teacher_disagreement_score":0.88275063,"about_ca_system_score_codex":0.000067369256,"about_ca_system_score_gemma":0.000069241665,"threshold_uncertainty_score":0.74395555},"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":"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.28192228,0.00013158274,0.70979995,0.006138036,0.0009930431,0.00018029631,0.000019912291,0.0007282325,0.00008664132],"genre_scores_gemma":[0.9623569,0.000026584243,0.035914663,0.0012779533,0.00032747048,0.0000029179425,0.000025031113,0.000025512389,0.00004296257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977151,0.000119359065,0.00037903947,0.0006630799,0.0004445304,0.0006788737],"domain_scores_gemma":[0.99758613,0.00031277363,0.00017989862,0.0015612041,0.00009477981,0.00026518723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021454954,0.00031504245,0.00035101298,0.0001160563,0.000553062,0.00013209095,0.0024048032,0.00011453902,0.000010725096],"category_scores_gemma":[0.00026477248,0.0002782002,0.00016406081,0.000729657,0.00005199876,0.00014632622,0.0011152196,0.00032375354,0.00007213004],"study_design_candidate":"simulation_or_modeling","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.00007820101,0.0015609295,0.008845721,0.00017024031,0.00045988295,0.0036142922,0.019507375,0.06556434,0.011139355,0.24372797,0.12481074,0.5205209],"study_design_scores_gemma":[0.00055664225,0.0002340048,0.0026849436,0.000040432682,0.000008019204,0.00046594287,0.000042727013,0.95314026,0.0013328269,0.027197298,0.01372137,0.00057556323],"about_ca_topic_score_codex":0.00027619695,"about_ca_topic_score_gemma":0.000024967165,"teacher_disagreement_score":0.88757586,"about_ca_system_score_codex":0.0000579758,"about_ca_system_score_gemma":0.00016546776,"threshold_uncertainty_score":0.99996704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03897091,0.0001987523,0.94350743,0.010507637,0.0010701068,0.00029429817,0.00001627123,0.00013894502,0.00529567],"genre_scores_gemma":[0.8240703,0.0000202834,0.17318615,0.0008726891,0.0002487876,0.000009790894,0.0000066587636,0.00000793636,0.0015774426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929196,0.00003734064,0.0001771492,0.00018020936,0.00018376404,0.00012957962],"domain_scores_gemma":[0.99850374,0.00009281684,0.000096562864,0.001229853,0.000037940583,0.000039104132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008804439,0.00007571253,0.00008677624,0.000034001314,0.00006614744,0.00006662159,0.0020320313,0.00003117142,0.000069940135],"category_scores_gemma":[0.00008841026,0.00004821417,0.00006205435,0.00020477736,0.00003574298,0.00051174394,0.0010403144,0.00009569939,0.00009466536],"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.0000025378408,0.00011015003,0.0011683345,0.00000512992,0.00001816598,0.0000011770875,0.00086534314,0.00008606096,0.0026465498,0.01831538,0.053025313,0.9237559],"study_design_scores_gemma":[0.00058612553,0.00007621153,0.01573877,0.000063822416,0.0000121804405,0.00002374625,0.000041093183,0.14683181,0.024490727,0.008315963,0.80354667,0.00027286526],"about_ca_topic_score_codex":0.00016993382,"about_ca_topic_score_gemma":0.000046243586,"teacher_disagreement_score":0.923483,"about_ca_system_score_codex":0.000022427052,"about_ca_system_score_gemma":0.000047408143,"threshold_uncertainty_score":0.37760535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15462692,0.0046687364,0.7126225,0.0148276845,0.0066731824,0.063706614,0.00006797726,0.0019090648,0.040897302],"genre_scores_gemma":[0.95507234,0.0002569931,0.037113164,0.0009035137,0.0008913978,0.0053575477,0.000027655007,0.000024497775,0.00035288176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988318,0.0000626045,0.0002975037,0.00033552054,0.0002147491,0.000257824],"domain_scores_gemma":[0.9989384,0.000036166854,0.00011802748,0.00077123224,0.00007563573,0.000060536997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020884465,0.0001129904,0.0001625121,0.000064647094,0.00006722471,0.00011405806,0.0008726115,0.000055596996,0.000021839618],"category_scores_gemma":[0.00012570141,0.00009871793,0.000028538849,0.0005092294,0.000021274393,0.00095301756,0.0001418136,0.000086997024,0.0001297823],"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.000009544259,0.000055854765,0.011831086,0.000012131418,0.000002052269,0.0000066202606,0.00022568711,0.000018357778,0.00024575714,0.0025226974,0.0013419093,0.9837283],"study_design_scores_gemma":[0.0006420218,0.00018026083,0.04291657,0.0001403416,9.089796e-7,0.000008791265,0.00002064886,0.0075157178,0.0008798569,0.005527375,0.9419156,0.0002519311],"about_ca_topic_score_codex":0.00014197154,"about_ca_topic_score_gemma":0.00028988998,"teacher_disagreement_score":0.9834764,"about_ca_system_score_codex":0.000066187975,"about_ca_system_score_gemma":0.000033975677,"threshold_uncertainty_score":0.40256003},"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":"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.010648152,0.06074658,0.66166687,0.05317003,0.009135554,0.0020788491,0.00006255408,0.0018406586,0.20065077],"genre_scores_gemma":[0.8843875,0.0067908126,0.044196267,0.050614912,0.003007049,0.00011841259,0.000033046053,0.0000603312,0.010791647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987315,0.000055009372,0.0002887481,0.00037381632,0.00024514066,0.0003058211],"domain_scores_gemma":[0.9978651,0.000057858295,0.00011876767,0.001727402,0.00010745251,0.00012342847],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002484304,0.00014247102,0.0002430286,0.00002779905,0.000113563525,0.0001095662,0.0018145627,0.000052125095,0.00010855002],"category_scores_gemma":[0.0002157854,0.00011553302,0.00008419446,0.00041946836,0.00005135605,0.0004354299,0.0003399799,0.000091282855,0.0024249477],"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.0000020142104,0.00003955219,0.00031079346,0.00013083435,0.000014747297,0.000014647869,0.00012773144,2.710396e-7,0.0007687555,0.005984868,0.85508776,0.13751803],"study_design_scores_gemma":[0.0001464451,0.00008403251,0.00065573206,0.00046860502,0.0000055476276,0.000022678483,0.000004824821,0.00026845868,0.00058193645,0.00090743386,0.99666613,0.00018819794],"about_ca_topic_score_codex":0.000082763145,"about_ca_topic_score_gemma":0.000024160725,"teacher_disagreement_score":0.87373936,"about_ca_system_score_codex":0.000025940393,"about_ca_system_score_gemma":0.00005402728,"threshold_uncertainty_score":0.99835175},"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":"methods","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.077046506,0.19703415,0.19174862,0.1987347,0.024237907,0.006921761,0.000058739013,0.0042843944,0.29993322],"genre_scores_gemma":[0.18665567,0.06153664,0.54747194,0.15308161,0.0017804482,0.00012567012,0.000081230035,0.0001531284,0.049113687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988257,0.00005754957,0.00021291533,0.00037029077,0.00025894277,0.0002745512],"domain_scores_gemma":[0.99768376,0.00017100177,0.00008084876,0.0019311751,0.000042793246,0.000090439185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002312259,0.00013618813,0.00023552189,0.000058423542,0.000057713154,0.0000851486,0.0022239569,0.00004071176,0.0003992722],"category_scores_gemma":[0.00011364258,0.00011767642,0.00013444778,0.00044127862,0.0000217788,0.00044812067,0.00069577905,0.00016547258,0.0033345753],"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.000003518443,0.00011403931,0.002584472,0.0003701892,0.00003950017,0.000024420526,0.00019782419,0.000006102569,0.0007986772,0.08391059,0.3515088,0.56044185],"study_design_scores_gemma":[0.0003522239,0.00014085651,0.0037862477,0.0006306954,0.00001123302,0.000040127357,0.0000077551385,0.0011116893,0.0005065179,0.032816153,0.96016115,0.00043536242],"about_ca_topic_score_codex":0.00006925173,"about_ca_topic_score_gemma":0.0000061521305,"teacher_disagreement_score":0.60865235,"about_ca_system_score_codex":0.000017069338,"about_ca_system_score_gemma":0.000050188315,"threshold_uncertainty_score":0.9974415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14522594,0.00034911383,0.7659653,0.00745374,0.0031410605,0.0005459188,0.0000120853365,0.00091148226,0.07639541],"genre_scores_gemma":[0.9853931,0.0000033183037,0.012045633,0.00074339664,0.00042119194,0.0000113911865,0.0000017573121,0.000007730437,0.0013724818],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899155,0.000034462417,0.0001767347,0.00031733984,0.00019127471,0.00028863747],"domain_scores_gemma":[0.9985323,0.000052118554,0.00007857628,0.0011611795,0.00007972605,0.000096099444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015739433,0.00010897585,0.00013133703,0.000034385503,0.00013097834,0.00021294868,0.001285644,0.00005093209,0.000031040523],"category_scores_gemma":[0.00014800014,0.00009135954,0.000048259768,0.0002870509,0.000039833252,0.0004615646,0.00031669342,0.000080836726,0.0007139651],"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.000016431233,0.00017138766,0.010659192,0.000050151513,0.000052143954,0.00007869535,0.0036021154,0.000009263024,0.022391772,0.06391148,0.25387132,0.64518607],"study_design_scores_gemma":[0.00048999075,0.00023175964,0.006460761,0.00006714066,0.0000044040653,0.00003570665,0.00008987289,0.0066608135,0.009552594,0.0036676847,0.9723206,0.00041866564],"about_ca_topic_score_codex":0.00014374466,"about_ca_topic_score_gemma":0.000054493914,"teacher_disagreement_score":0.84016716,"about_ca_system_score_codex":0.00002471214,"about_ca_system_score_gemma":0.00005577147,"threshold_uncertainty_score":0.9176815},"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":"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.38522705,0.0028151511,0.30493256,0.08805671,0.047212478,0.002722662,0.00017315746,0.005728966,0.16313125],"genre_scores_gemma":[0.9165007,0.000027028907,0.072698355,0.0065797945,0.0007094094,0.0001310912,0.000016080448,0.000023684432,0.0033138727],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988455,0.00009156709,0.0001507023,0.00031880097,0.00033456294,0.00025884324],"domain_scores_gemma":[0.9984769,0.00016486493,0.00005751459,0.0011992988,0.000020622718,0.00008079254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002052309,0.00009614488,0.00011778028,0.000085270556,0.00048512948,0.00012468253,0.0025839747,0.000017810578,0.00033215474],"category_scores_gemma":[0.0000747308,0.00010640228,0.00008350766,0.00059308845,0.000034479344,0.0002451842,0.002240211,0.00023386517,0.00010649527],"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.000020230293,0.0006229029,0.0059971423,0.000018413935,0.00007186808,0.00030977873,0.0034103761,0.00032859857,0.002014665,0.24171026,0.4147172,0.33077857],"study_design_scores_gemma":[0.00030224744,0.00019442257,0.0019906152,0.000002695215,0.0000035618393,0.000060216415,0.00012112692,0.0046608546,0.0004986119,0.04506114,0.9468485,0.0002559679],"about_ca_topic_score_codex":0.00020386824,"about_ca_topic_score_gemma":0.000039215833,"teacher_disagreement_score":0.5321314,"about_ca_system_score_codex":0.000044660454,"about_ca_system_score_gemma":0.000059625563,"threshold_uncertainty_score":0.48017108},"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":"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.96784467,0.00023443285,0.00050931034,0.000027436165,0.0025121742,0.0001256116,0.0000024782312,0.0004662582,0.02827766],"genre_scores_gemma":[0.99930096,0.000038508806,0.00009575101,0.000039661445,0.0002977763,0.000013668741,0.0000032309576,0.000026104557,0.00018431531],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994244,0.000034469216,0.00014257494,0.00009846012,0.00010193481,0.00019819215],"domain_scores_gemma":[0.999407,0.000088652494,0.000014852035,0.00040083492,0.000011905858,0.00007674949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073860465,0.000113352864,0.00014100385,0.000043995136,0.00007947823,0.000011678348,0.00025293184,0.000074749354,0.00009847077],"category_scores_gemma":[0.000050891107,0.000109237786,0.00006550238,0.00013082221,0.000027681379,0.00009964913,0.000021227897,0.00011135366,0.00035819775],"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.00022740262,0.00041728053,0.049486857,0.00034946535,0.0007041059,0.00084606383,0.011995446,0.0064289714,0.29885358,0.25482294,0.35772148,0.01814641],"study_design_scores_gemma":[0.005506487,0.00051825366,0.014854921,0.00012359701,0.00008708408,0.00052884355,0.0007762448,0.0016329314,0.18184511,0.14901292,0.64272946,0.0023841383],"about_ca_topic_score_codex":0.000018192359,"about_ca_topic_score_gemma":0.0000028367128,"teacher_disagreement_score":0.28500795,"about_ca_system_score_codex":0.000019019877,"about_ca_system_score_gemma":0.000009722605,"threshold_uncertainty_score":0.4604027},"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":"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.9292223,0.00018193296,0.001444642,0.010498088,0.004283573,0.00034564338,0.00011808196,0.00035209378,0.053553678],"genre_scores_gemma":[0.92557704,0.000044657656,0.0012733324,0.00087568053,0.00019871256,0.000007915954,0.000066032975,0.000016303527,0.07194029],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99707496,0.00012486671,0.0005353556,0.00059788866,0.0013899441,0.00027696815],"domain_scores_gemma":[0.99515146,0.0018467321,0.00019192141,0.0026053775,0.000109220724,0.00009529344],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00421202,0.000095668125,0.00021597795,0.00045390477,0.00011536995,0.00021086837,0.0022702464,0.000032466156,0.0007963735],"category_scores_gemma":[0.008581762,0.00007264566,0.000120210185,0.0028194843,0.00007491873,0.00021811685,0.0018235351,0.00008108012,0.0022329148],"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.000007231474,0.000021068441,0.0056405575,0.000002670013,0.000007121537,0.000012381536,0.00018831374,0.00007832815,0.0005494014,0.0004954366,0.8118356,0.18116188],"study_design_scores_gemma":[0.00025796864,0.000040797386,0.04175724,0.000017033,0.000008104659,0.0000017481849,0.0012028441,0.0022782153,0.0005276844,0.022633284,0.93113726,0.00013781997],"about_ca_topic_score_codex":0.00026533616,"about_ca_topic_score_gemma":0.000078344434,"teacher_disagreement_score":0.18102406,"about_ca_system_score_codex":0.00001319216,"about_ca_system_score_gemma":0.000049468097,"threshold_uncertainty_score":0.9997694},"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":"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.882044,0.006511191,0.06494175,0.030554479,0.0035685566,0.0030204405,0.00033734145,0.00198879,0.007033442],"genre_scores_gemma":[0.9316935,0.00012296677,0.067456834,0.000494014,0.00012340209,0.000018689614,0.00004665321,0.000017169488,0.000026775511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975074,0.00041334654,0.0005053835,0.000789264,0.0003444255,0.0004401972],"domain_scores_gemma":[0.99631757,0.0012057349,0.000101861864,0.0021023375,0.00010394913,0.00016856893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048076635,0.00029927894,0.00042586273,0.00018818222,0.00022183341,0.0008191856,0.0020902306,0.00014625984,0.000070182745],"category_scores_gemma":[0.00031758565,0.00029049037,0.000072322626,0.00087152544,0.0006657591,0.00077728915,0.0019782777,0.0006045798,0.00003192954],"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.000064020714,0.00063475495,0.096450604,0.00056945626,0.00014368548,0.0002516914,0.0079866545,0.0001893465,0.0032004246,0.59349465,0.021425854,0.27558887],"study_design_scores_gemma":[0.001072264,0.00021473205,0.18376817,0.00023156266,0.000024350253,0.00023300255,0.000379505,0.16575475,0.0006706516,0.59098196,0.05568748,0.0009815654],"about_ca_topic_score_codex":0.0015344747,"about_ca_topic_score_gemma":0.00940636,"teacher_disagreement_score":0.2746073,"about_ca_system_score_codex":0.00021287445,"about_ca_system_score_gemma":0.00018665688,"threshold_uncertainty_score":0.9999547},"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":"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.26160967,0.0034327747,0.6851888,0.023743287,0.0066604274,0.00088107015,0.000044060613,0.0042518936,0.0141880475],"genre_scores_gemma":[0.9084678,0.0000622793,0.08438435,0.0037443957,0.0012899616,0.000022091388,0.000016799897,0.000073061216,0.0019392548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719924,0.0002957554,0.00041210515,0.00093852426,0.00046226766,0.00069213595],"domain_scores_gemma":[0.99664116,0.0011331755,0.000091801274,0.0018153265,0.00005200915,0.000266507],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005970743,0.00037233683,0.00037737205,0.00019639812,0.00032559363,0.0009701693,0.0026575213,0.00013137996,0.00011723308],"category_scores_gemma":[0.00027478646,0.00031050292,0.0002772344,0.0008639181,0.00015940331,0.00043307373,0.0012057531,0.0006529237,0.0008194895],"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.000018848707,0.00012705813,0.00032710665,0.000097534175,0.00012441985,0.00035798005,0.00279772,0.00086023123,0.001763612,0.11151941,0.038936,0.8430701],"study_design_scores_gemma":[0.0004395572,0.0003388651,0.0025437223,0.00021950397,0.00003207352,0.00019863117,0.00011219396,0.33751145,0.0013973756,0.3651136,0.29118276,0.0009102762],"about_ca_topic_score_codex":0.00032172503,"about_ca_topic_score_gemma":0.00009470701,"teacher_disagreement_score":0.8421598,"about_ca_system_score_codex":0.00006959362,"about_ca_system_score_gemma":0.00021382052,"threshold_uncertainty_score":0.9999585},"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":"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.94792205,0.00095691666,0.045425583,0.0017112994,0.00017551039,0.0005595532,0.000060884253,0.00005689834,0.0031312774],"genre_scores_gemma":[0.9860619,0.00021282831,0.008141644,0.0038082364,0.00015548259,0.00006257172,0.00021713048,0.000014523736,0.0013257032],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871504,0.00013481414,0.00029144334,0.00045626226,0.00006382035,0.0003386365],"domain_scores_gemma":[0.99894327,0.00029580266,0.000083861996,0.0004660973,0.00010990603,0.00010105647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002976882,0.00019776977,0.00024388643,0.000043769953,0.00036837245,0.00008017814,0.00035886635,0.00021318423,0.000024942325],"category_scores_gemma":[0.0010601006,0.00016660949,0.00013367027,0.00013643528,0.00019916824,0.0000068696354,0.00034706647,0.00011718808,0.0000060448624],"study_design_candidate":"bench_or_experimental","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.0009930336,0.00045819214,0.035700258,0.00012751334,0.0003007415,0.0000039986494,0.0000665634,0.000090994894,0.8184454,0.019846786,0.032833748,0.0911328],"study_design_scores_gemma":[0.003655486,0.0021619708,0.050035916,0.00014474826,0.00021973377,0.000024614921,0.00071179157,0.0011100951,0.1593337,0.1241583,0.6572345,0.0012091682],"about_ca_topic_score_codex":0.00012139821,"about_ca_topic_score_gemma":0.0006405098,"teacher_disagreement_score":0.6591117,"about_ca_system_score_codex":0.000018201885,"about_ca_system_score_gemma":0.00010624156,"threshold_uncertainty_score":0.6794138},"labels":[],"label_agreement":null}]}