{"meta":{"query_hash":"5af15334142c","filters":{"venue":"Journal of the ACM"},"cohort_total":79,"direct_labels_cover":0,"predictions_cover":79,"exported":79,"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/5af15334142c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+the+ACM"},"results":[{"id":"W1558278838","doi":"10.1145/3095799","title":"An Average-Case Depth Hierarchy Theorem for Boolean Circuits","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Conjecture; Boolean function; Discrete mathematics; Combinatorics; Converse; Bounded function; Boolean circuit; Random variable; Polynomial; Statistics; Mathematical analysis","score_opus":0.05825755211603171,"score_gpt":0.31813863639199086,"score_spread":0.25988108427595913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558278838","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.34132877,0.00018102718,0.63710994,0.015265838,0.0040429197,0.00030589246,0.000010853754,0.000040966286,0.0017137957],"genre_scores_gemma":[0.94975805,0.000008617408,0.049213592,0.0003960354,0.00049015955,0.0000014163564,8.1228585e-8,0.000007368534,0.00012465294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907875,0.000085336236,0.00024615714,0.0001378202,0.00025059254,0.00020132145],"domain_scores_gemma":[0.9961566,0.0001786204,0.00050853775,0.0028824853,0.00015678465,0.000117021824],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000960427,0.00009619107,0.00016050723,0.00006896025,0.0009341972,0.00054553803,0.008680812,0.000036372297,0.000007224439],"category_scores_gemma":[0.0009464288,0.000060171235,0.0002527037,0.00006261044,0.00011682052,0.0008706469,0.000898214,0.00024282568,0.0000022559254],"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.00005063911,0.00035979654,0.00244571,0.000032882544,0.00016045633,0.0010146585,0.0025641574,0.0003635594,0.0014900618,0.16085063,0.0078765545,0.8227909],"study_design_scores_gemma":[0.0010755837,0.00041611804,0.013165278,0.000078899364,0.000028419838,0.006333132,0.000050185154,0.023096025,0.0032402356,0.9443263,0.007983472,0.000206363],"about_ca_topic_score_codex":0.0000062544045,"about_ca_topic_score_gemma":0.000016441065,"teacher_disagreement_score":0.8225845,"about_ca_system_score_codex":0.000023374314,"about_ca_system_score_gemma":0.00007257118,"threshold_uncertainty_score":0.9966827},"labels":[],"label_agreement":null},{"id":"W1972412225","doi":"10.1145/1120582.1120587","title":"Limits on the ability of quantum states to convey classical messages","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum entanglement; Bounded function; Quantum; Simple (philosophy); Quantum key distribution; Quantum information science; Task (project management); Upper and lower bounds; Theoretical computer science; Function (biology); Product (mathematics); Mathematics; Quantum mechanics; Physics","score_opus":0.018932439919043923,"score_gpt":0.25003419700470225,"score_spread":0.23110175708565833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972412225","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.9066734,0.000037108977,0.013577279,0.078278296,0.00042510798,0.000088941604,0.0000023763969,0.000010544912,0.00090696866],"genre_scores_gemma":[0.9969676,0.000007788966,0.0013790614,0.0015741822,0.000047159872,8.367806e-7,7.18233e-8,0.000002149306,0.000021125907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988748,0.00012853174,0.0004005541,0.000058273727,0.00042344007,0.00011440947],"domain_scores_gemma":[0.99811983,0.00043177875,0.00035673572,0.00086357625,0.000182172,0.00004590734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084229244,0.00006850475,0.00013238401,0.00007013167,0.00008091749,0.000070230075,0.002540561,0.000024936244,0.000013972881],"category_scores_gemma":[0.00049374613,0.00003061569,0.00017006898,0.00032843705,0.000075068936,0.0002104156,0.00024295856,0.0001815163,0.000012866844],"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.00010825151,0.00033607235,0.0067528198,0.000023987406,0.00006098295,0.0000033305323,0.0017891806,0.0022493908,0.006409008,0.71348333,0.26437688,0.0044067446],"study_design_scores_gemma":[0.0006289619,0.0006886924,0.47897467,0.00013154329,0.000021258202,0.000044853965,0.00038168902,0.015726548,0.042667374,0.4252503,0.035290256,0.000193884],"about_ca_topic_score_codex":0.0000066255757,"about_ca_topic_score_gemma":0.000002063732,"teacher_disagreement_score":0.47222182,"about_ca_system_score_codex":0.000016292166,"about_ca_system_score_gemma":0.000044543438,"threshold_uncertainty_score":0.47210366},"labels":[],"label_agreement":null},{"id":"W1975880448","doi":"10.1145/502090.502100","title":"Logics with aggregate operators","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":74,"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; Bell (Canada)","funders":"","keywords":"Aggregate (composite); Rotation formalisms in three dimensions; Computer science; Class (philosophy); Query language; Set (abstract data type); Theoretical computer science; Relation (database); Deductive database; Mathematics; Programming language; Database; Artificial intelligence","score_opus":0.018722680616357477,"score_gpt":0.2368956651088596,"score_spread":0.2181729844925021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975880448","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.94064665,0.0012012454,0.031271294,0.011808584,0.0015598295,0.000085785636,2.3582953e-7,0.000034475084,0.013391906],"genre_scores_gemma":[0.9821184,0.0001272515,0.015498317,0.00065419724,0.00026169102,3.5177337e-7,1.8690477e-8,0.0000049474766,0.0013348027],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932146,0.000057930625,0.00015783933,0.000081120175,0.00023076276,0.00015090381],"domain_scores_gemma":[0.998696,0.000049564936,0.00023427962,0.0007897169,0.00015688523,0.00007351813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033408374,0.00007655352,0.00012502534,0.000037753638,0.0001104625,0.000115206145,0.003336279,0.000029184845,0.000013472314],"category_scores_gemma":[0.0003472379,0.00003323522,0.0000831481,0.0002843112,0.00003813587,0.00029271012,0.0005295991,0.00019089141,0.000022902934],"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.0004284223,0.0012812694,0.44890365,0.00005325067,0.00075907924,0.0035188184,0.015049363,0.0048053707,0.0062023513,0.13167334,0.19490051,0.19242458],"study_design_scores_gemma":[0.006277125,0.0034770044,0.16486098,0.0008367259,0.00019863226,0.025143724,0.00048774516,0.008522926,0.025232984,0.19954783,0.5640287,0.0013856278],"about_ca_topic_score_codex":0.0000025863026,"about_ca_topic_score_gemma":0.0000065182453,"teacher_disagreement_score":0.3691282,"about_ca_system_score_codex":0.00003204584,"about_ca_system_score_gemma":0.00009512847,"threshold_uncertainty_score":0.6199692},"labels":[],"label_agreement":null},{"id":"W1976584101","doi":"10.1145/2432622.2432628","title":"Steiner Tree Approximation via Iterative Randomized Rounding","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":280,"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":"Office of Naval Research; European Research Council; Division of Computing and Communication Foundations; Alexander von Humboldt-Stiftung; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej; École Polytechnique Fédérale de Lausanne","keywords":"Steiner tree problem; Rounding; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Randomized rounding; Tree (set theory); Sequence (biology); k-minimum spanning tree; Relaxation (psychology); Discrete mathematics; Minimum spanning tree; Iterative method; Mathematical optimization; Tree structure; K-ary tree; Computer science; Linear programming; Binary tree","score_opus":0.01898129140375479,"score_gpt":0.24302492648471866,"score_spread":0.22404363508096387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976584101","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.0793126,0.00016030081,0.905296,0.012503243,0.0013818073,0.00026991265,1.8942995e-7,0.000017497854,0.0010584173],"genre_scores_gemma":[0.75149673,0.000010626351,0.2472713,0.0004447531,0.00030597308,0.000007410525,1.00226636e-7,0.000004994547,0.00045809767],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989119,0.00025265175,0.00034511325,0.00007721304,0.00030020918,0.00011286908],"domain_scores_gemma":[0.998292,0.00042611852,0.00042430634,0.00063292566,0.0001818218,0.000042787833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552676,0.000077140685,0.00024130673,0.00009078709,0.0001264342,0.00026474972,0.0022728236,0.000024332294,0.00002674883],"category_scores_gemma":[0.00074936013,0.000040538704,0.00024496584,0.00023371108,0.000057066645,0.000978619,0.0005068376,0.00019047168,0.000014248014],"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.003056344,0.0007519087,0.00096671714,0.000084831576,0.0011407268,0.00003747071,0.024037227,0.0019815762,0.03161206,0.23803706,0.04390084,0.65439326],"study_design_scores_gemma":[0.020753864,0.00006653215,0.0013941946,0.00009009647,0.00002788249,0.00018408238,0.000058252717,0.19123366,0.0028814082,0.7826443,0.0005344231,0.00013133226],"about_ca_topic_score_codex":0.000011210291,"about_ca_topic_score_gemma":0.000001442388,"teacher_disagreement_score":0.6721841,"about_ca_system_score_codex":0.0000369657,"about_ca_system_score_gemma":0.000025410465,"threshold_uncertainty_score":0.42235097},"labels":[],"label_agreement":null},{"id":"W1984249228","doi":"10.1145/1314690.1314695","title":"On specification of Read/Write shared variables","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Variable (mathematics); Inter-process communication; Consistency (knowledge bases); Abstraction; Value (mathematics); Programming language; Distributed computing; Mathematics","score_opus":0.022096016594193975,"score_gpt":0.2618276950884225,"score_spread":0.23973167849422855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984249228","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.1552009,0.0004113813,0.8239523,0.005114533,0.0026427347,0.00015249207,0.000014146087,0.000019091154,0.012492435],"genre_scores_gemma":[0.98216975,0.000008730205,0.017161757,0.00014274949,0.00018587541,1.431498e-7,2.8482037e-7,0.0000031560933,0.00032754228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99903154,0.000030307636,0.00041393837,0.00007067071,0.00034580863,0.000107749685],"domain_scores_gemma":[0.9981352,0.00015915027,0.000572176,0.00088660803,0.00020520891,0.00004164523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014292512,0.000051294395,0.00012508068,0.000062266045,0.00004065087,0.000039739196,0.0021773865,0.000035419143,0.000011260556],"category_scores_gemma":[0.0004482253,0.000031283158,0.00008435328,0.00027639978,0.000016902191,0.00019045876,0.00015191566,0.00012731919,0.0000063479297],"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.0004972499,0.00093587826,0.0065830457,0.0001257214,0.0002446873,0.00012180071,0.003306981,0.0023312478,0.114853375,0.49160615,0.24466097,0.1347329],"study_design_scores_gemma":[0.002788419,0.00079468015,0.5106371,0.0018608858,0.000053543812,0.0006903177,0.00035451332,0.0046336236,0.079106,0.13566472,0.26287603,0.0005401844],"about_ca_topic_score_codex":0.0000056138206,"about_ca_topic_score_gemma":0.0000018641161,"teacher_disagreement_score":0.82696885,"about_ca_system_score_codex":0.000036833888,"about_ca_system_score_gemma":0.00003000662,"threshold_uncertainty_score":0.40461624},"labels":[],"label_agreement":null},{"id":"W1988662949","doi":"10.1145/567112.567117","title":"On XML integrity constraints in the presence of DTDs","year":2002,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":175,"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":"Unary operation; Undecidable problem; Computer science; Data integrity; Consistency (knowledge bases); Theoretical computer science; XML validation; XML; Negation; Programming language; Decidability; Discrete mathematics; Mathematics; Database","score_opus":0.08962250952427965,"score_gpt":0.3285199342965478,"score_spread":0.23889742477226816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988662949","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.8698221,0.0001964267,0.099692285,0.020655055,0.0017662226,0.00022365247,0.0000015758512,0.000009255079,0.0076334197],"genre_scores_gemma":[0.87507194,0.000015660466,0.12457934,0.00027561185,0.00002990922,5.255905e-7,5.192045e-9,0.0000012294554,0.0000257694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886185,0.00037518571,0.00027267897,0.000056672765,0.0003511818,0.000082423096],"domain_scores_gemma":[0.9980668,0.00046929583,0.0003394675,0.0010283778,0.00007883684,0.000017263263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019445975,0.00004475884,0.00009103249,0.00005368803,0.000032080243,0.000028185423,0.0045968844,0.00002985252,0.00001759851],"category_scores_gemma":[0.0051014125,0.0000215072,0.00006532824,0.00027370013,0.00012098449,0.0002321239,0.0002467249,0.00042260016,0.0000051860384],"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.00008281986,0.0009917468,0.008569544,0.000055387536,0.000057627403,0.000043218097,0.022411803,0.0015622124,0.0090452535,0.56779873,0.033035062,0.35634658],"study_design_scores_gemma":[0.0016784172,0.0013517529,0.26938578,0.00089420966,0.000031841224,0.0013591988,0.00097266585,0.106743366,0.05432896,0.5590951,0.003805481,0.00035325295],"about_ca_topic_score_codex":0.000003563799,"about_ca_topic_score_gemma":9.309171e-7,"teacher_disagreement_score":0.3559933,"about_ca_system_score_codex":0.00002596719,"about_ca_system_score_gemma":0.000021300626,"threshold_uncertainty_score":0.8542232},"labels":[],"label_agreement":null},{"id":"W1989485302","doi":"10.1145/2487241.2487243","title":"The VPN Conjecture Is True","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Mathematics; Context (archaeology); Discrete mathematics; Matrix (chemical analysis); Path (computing); Shortest path problem; Graph; Computer science","score_opus":0.01333278377694644,"score_gpt":0.22806660800660872,"score_spread":0.21473382422966228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989485302","genre_codex":"commentary","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.27768105,0.002825593,0.037936803,0.66914546,0.00891644,0.00035291017,0.000002620414,0.000050797975,0.0030883192],"genre_scores_gemma":[0.93456095,0.00017784357,0.053717766,0.008238563,0.0009316406,0.000003265803,3.420038e-8,0.000010702387,0.0023592387],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992446,0.00006850798,0.00019772018,0.00006471806,0.00028409503,0.00014040321],"domain_scores_gemma":[0.99813867,0.000252663,0.00022011375,0.0012269235,0.00011350838,0.00004811904],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003339321,0.00006334917,0.00009109981,0.000026553735,0.00029239795,0.00027541054,0.0058825486,0.000026856056,0.00004568985],"category_scores_gemma":[0.00031856546,0.000026732845,0.00017474877,0.0001988232,0.000074510375,0.00026149227,0.00092079653,0.00029602987,0.000033367876],"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.000007775053,0.0000714489,0.0010110355,0.000006764539,0.00013939125,0.0000129574155,0.002483411,0.000081226804,0.0008939254,0.045679055,0.7305657,0.21904725],"study_design_scores_gemma":[0.00025842752,0.000084294516,0.014784074,0.000030593892,0.00000914833,0.00038322323,0.00006711498,0.0038261588,0.0022138942,0.8440758,0.13417844,0.00008879429],"about_ca_topic_score_codex":0.000011147049,"about_ca_topic_score_gemma":0.0000027178312,"teacher_disagreement_score":0.79839677,"about_ca_system_score_codex":0.0000150404985,"about_ca_system_score_gemma":0.00004696188,"threshold_uncertainty_score":0.9994961},"labels":[],"label_agreement":null},{"id":"W1995031698","doi":"10.1145/1255443.1255444","title":"(Almost) Tight bounds and existence theorems for single-commodity confluent flows","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Mathematics; Flow (mathematics); Maximum flow problem; Flow network; Sink (geography); Computer science; Combinatorics; Geometry","score_opus":0.0438101471097265,"score_gpt":0.276298589715113,"score_spread":0.2324884426053865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995031698","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.49758983,0.0009443056,0.48714086,0.009364105,0.003113888,0.0002391314,0.0000067056953,0.000029226549,0.001571953],"genre_scores_gemma":[0.8105734,0.000020951908,0.18795416,0.00090154813,0.0004214185,0.0000011010816,2.4515745e-7,0.000007770699,0.00011938539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989851,0.000048562935,0.00032926694,0.0001261881,0.0002958614,0.00021499499],"domain_scores_gemma":[0.9980867,0.0004890297,0.00029450963,0.00085809996,0.00017732907,0.00009432847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015430864,0.000097949196,0.00017189764,0.00006725118,0.00025734142,0.0001700108,0.0027775313,0.00004032373,0.0000039710494],"category_scores_gemma":[0.0005574126,0.00006037315,0.00016306514,0.00018074343,0.00013833397,0.00030336852,0.00075512775,0.0002053704,9.4918784e-7],"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.00047287135,0.0011226378,0.006046903,0.00014169121,0.00034761147,0.00015083633,0.007613789,0.00016406966,0.055017907,0.61659145,0.012998518,0.29933172],"study_design_scores_gemma":[0.0010786284,0.00050819723,0.01074925,0.00013876334,0.000033315962,0.0012119791,0.000093355025,0.0066889026,0.014444751,0.87694055,0.0878667,0.00024560347],"about_ca_topic_score_codex":0.0000036973365,"about_ca_topic_score_gemma":0.000009936301,"teacher_disagreement_score":0.31298357,"about_ca_system_score_codex":0.000041998108,"about_ca_system_score_gemma":0.0000430761,"threshold_uncertainty_score":0.51613903},"labels":[],"label_agreement":null},{"id":"W1997068591","doi":"10.1145/1162349.1162352","title":"Distribution sort with randomized cycling","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":22,"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; Randomized algorithm; sort; Probabilistic logic; Out-of-core algorithm; Merge sort; Algorithm; Merge (version control); Computation; Task (project management); Parallel computing; Sorting algorithm","score_opus":0.008534024332847286,"score_gpt":0.23201901844973358,"score_spread":0.2234849941168863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997068591","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.08967423,0.00018280378,0.9036688,0.0060651097,0.00021310705,0.00006888396,0.000002291486,0.00004790721,0.000076857286],"genre_scores_gemma":[0.8211565,0.000015261809,0.17865002,0.00005204229,0.00007260143,0.000001219226,6.985801e-7,0.0000029935568,0.00004864263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931145,0.00004661211,0.00023504914,0.00006966488,0.00023392272,0.000103330174],"domain_scores_gemma":[0.9983364,0.00018387752,0.0004281438,0.00095594424,0.00008272479,0.000012927964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048524892,0.00005968131,0.00018762077,0.00003078084,0.00007474666,0.00005126161,0.0027018772,0.000025027939,9.788057e-7],"category_scores_gemma":[0.0013045886,0.000028371502,0.00008692349,0.000200464,0.000095022064,0.0004702571,0.0006254545,0.00017682048,0.0000020152365],"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.02220543,0.00073329266,0.011323986,0.00006358552,0.0006057521,0.0007990823,0.00055887876,0.068012595,0.027598474,0.6211489,0.137304,0.10964604],"study_design_scores_gemma":[0.053737786,0.00013284017,0.00450615,0.00016878912,0.00008258067,0.0011451477,0.0000465521,0.004340949,0.041048016,0.88502717,0.00948866,0.0002753539],"about_ca_topic_score_codex":0.0000050378594,"about_ca_topic_score_gemma":0.0000020276882,"teacher_disagreement_score":0.73148227,"about_ca_system_score_codex":0.000050883005,"about_ca_system_score_gemma":0.000031594995,"threshold_uncertainty_score":0.5020805},"labels":[],"label_agreement":null},{"id":"W1997649256","doi":"10.1145/1120582.1120584","title":"A dichotomy theorem for constraint satisfaction problems on a 3-element set","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":372,"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":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Element (criminal law); Set (abstract data type); Mathematics; Domain (mathematical analysis); Class (philosophy); Local consistency; Time complexity; Constraint satisfaction dual problem; Maximal element; Mathematical optimization; Algebraic number; Computer science; Discrete mathematics; Artificial intelligence","score_opus":0.018661322335568324,"score_gpt":0.2543906495361,"score_spread":0.2357293272005317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997649256","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.065025456,0.00002557919,0.9127021,0.019267054,0.0012732117,0.00056892686,0.000009192897,0.00003617836,0.001092315],"genre_scores_gemma":[0.95752954,0.000007039313,0.041830532,0.00040100559,0.00013528868,0.0000076529495,5.613283e-7,0.000004915047,0.000083446284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991379,0.0000577072,0.00032542087,0.00009776814,0.0002606063,0.00012063808],"domain_scores_gemma":[0.99883145,0.00013527407,0.00041094716,0.00044576987,0.00014186921,0.000034672663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039662112,0.000080338476,0.00010717969,0.00008159974,0.000121585515,0.00010093907,0.00064184767,0.00003178303,0.00002825206],"category_scores_gemma":[0.00018917667,0.00005011807,0.00013667259,0.00013512539,0.000038121914,0.00020543704,0.00009313627,0.00012506302,0.0000032441137],"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.00017715173,0.00028597462,0.033347845,0.00006902106,0.00021379728,0.000012174524,0.0014410649,0.10536935,0.0095921345,0.43128294,0.0646893,0.35351926],"study_design_scores_gemma":[0.006776102,0.0012944392,0.24752308,0.00048839016,0.000119223754,0.0010216936,0.00029909448,0.072747536,0.013737904,0.606491,0.048845794,0.00065567554],"about_ca_topic_score_codex":0.000011529434,"about_ca_topic_score_gemma":0.000029060966,"teacher_disagreement_score":0.8925041,"about_ca_system_score_codex":0.000093079616,"about_ca_system_score_gemma":0.00008531069,"threshold_uncertainty_score":0.20437557},"labels":[],"label_agreement":null},{"id":"W2001271834","doi":"10.1145/1989727.1989732","title":"Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":101,"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 Victoria","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Adversary; Computer science; Scalability; Latency (audio); Adversary model; Cryptography; Theoretical computer science; Parallel computing; Algorithm; Discrete mathematics; Mathematics; Computer security","score_opus":0.02488932264454965,"score_gpt":0.22436284946677215,"score_spread":0.1994735268222225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001271834","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.5970131,0.0060285535,0.26538128,0.05884486,0.010688249,0.0010076339,0.000053453598,0.00021483257,0.060768016],"genre_scores_gemma":[0.99289185,0.00001569528,0.00436479,0.0019468919,0.00033815112,0.0000016960381,5.57579e-8,0.000008108875,0.00043274378],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986627,0.0001399517,0.00041226993,0.000120903474,0.00043518716,0.00022900314],"domain_scores_gemma":[0.9974392,0.00009439413,0.00045189806,0.0017597851,0.00017128122,0.00008341295],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009443681,0.0001130056,0.00018223167,0.000032868546,0.00022718556,0.00015061429,0.006892935,0.000047077105,0.000022313425],"category_scores_gemma":[0.00030999674,0.00005182539,0.00024058227,0.00032607705,0.000060803373,0.00046279113,0.0008889864,0.00033300565,0.000030720264],"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.00015804093,0.0005399784,0.025824951,0.00008392108,0.0007138806,0.00040862148,0.04034558,0.0048559196,0.004766014,0.063620046,0.758585,0.10009807],"study_design_scores_gemma":[0.001704709,0.00028640512,0.018703911,0.00059512164,0.000108914144,0.004242992,0.0008509836,0.017616415,0.008481612,0.047105696,0.8996963,0.00060693704],"about_ca_topic_score_codex":0.000028539733,"about_ca_topic_score_gemma":0.0000022790557,"teacher_disagreement_score":0.39587873,"about_ca_system_score_codex":0.000027252963,"about_ca_system_score_gemma":0.00008638518,"threshold_uncertainty_score":0.99848026},"labels":[],"label_agreement":null},{"id":"W2007542733","doi":"10.1145/1219092.1219096","title":"The measurement calculus","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Mitacs","keywords":"Quantum computer; Computer science; Theoretical computer science; Computation; Semantics (computer science); Operational semantics; Quantum information; Model of computation; Algebra over a field; Quantum; Algorithm; Programming language; Mathematics; Pure mathematics; Quantum mechanics","score_opus":0.019684467330251736,"score_gpt":0.24958123157068898,"score_spread":0.22989676424043726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007542733","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.30061078,0.002735866,0.5939498,0.09259576,0.008531728,0.0001497825,2.4171135e-7,0.000044733017,0.0013813301],"genre_scores_gemma":[0.9702111,0.000014372881,0.028383149,0.00072531204,0.0005904661,1.2435423e-7,3.4374654e-9,0.0000046210253,0.000070861366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883515,0.000048081598,0.00023991951,0.000060664028,0.00063319056,0.00018299808],"domain_scores_gemma":[0.9984528,0.00016534099,0.00024241484,0.0009069949,0.00017671289,0.00005573079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00302167,0.000057173078,0.000072514056,0.000026676764,0.00030238074,0.000103894534,0.0042383717,0.000017432429,5.9450826e-7],"category_scores_gemma":[0.00069854833,0.000023060102,0.00013214479,0.0001844629,0.000032993365,0.000054359698,0.000766014,0.00027036172,0.000003311796],"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.00003957563,0.00008287586,0.0003670432,0.0000061810047,0.00011781541,0.00008019151,0.0019714355,0.005982604,0.0035412333,0.010190663,0.035592563,0.9420278],"study_design_scores_gemma":[0.0014820683,0.00058205356,0.079182446,0.000325368,0.000052914085,0.0023548563,0.00019702653,0.15409105,0.029221194,0.2255019,0.50654334,0.00046577805],"about_ca_topic_score_codex":0.0000032461137,"about_ca_topic_score_gemma":0.0000070633914,"teacher_disagreement_score":0.94156206,"about_ca_system_score_codex":0.000052766965,"about_ca_system_score_gemma":0.00007793046,"threshold_uncertainty_score":0.78760195},"labels":[],"label_agreement":null},{"id":"W2020154454","doi":"10.1145/2556646","title":"Constraint Satisfaction Problems Solvable by Local Consistency Methods","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Narodowe Centrum Nauki; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Constraint satisfaction problem; Local consistency; Consistency (knowledge bases); Constraint (computer-aided design); Constraint satisfaction; Mathematics; Computer science; Weak consistency; Mathematical optimization; Discrete mathematics; Strong consistency; Statistics","score_opus":0.029095741414015133,"score_gpt":0.33548799274915386,"score_spread":0.30639225133513875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020154454","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.0054383986,0.0002531302,0.98800546,0.004762745,0.000528846,0.0000883239,6.5606736e-7,0.000015455747,0.00090696034],"genre_scores_gemma":[0.59150404,0.00002501192,0.40787837,0.0003214006,0.00005709752,0.0000019958602,5.287373e-8,0.000007551525,0.00020450776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982439,0.0006671699,0.00034046415,0.00013034663,0.00038840543,0.00022966102],"domain_scores_gemma":[0.9976086,0.00063257746,0.00035220615,0.0010830724,0.00021708911,0.00010644837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028995567,0.00008871441,0.00018718075,0.00007554572,0.00016184323,0.000082756844,0.0023836317,0.00004590506,0.000018364583],"category_scores_gemma":[0.0018042771,0.000054280223,0.00013603766,0.00026931768,0.0002588175,0.00040577597,0.0006297352,0.00041159213,0.0000090615895],"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.00003249483,0.00007454421,0.002178103,0.000032154298,0.00009928394,0.00000553669,0.00042422645,0.0024152582,0.09695037,0.10810015,0.012497092,0.7771908],"study_design_scores_gemma":[0.00061028876,0.00029841956,0.0015923466,0.000076975375,0.0000149411335,0.0005760389,0.00008436924,0.01050576,0.032032155,0.9358866,0.018174924,0.00014714718],"about_ca_topic_score_codex":0.000009181124,"about_ca_topic_score_gemma":0.0000037421537,"teacher_disagreement_score":0.8277865,"about_ca_system_score_codex":0.00006822354,"about_ca_system_score_gemma":0.00010203654,"threshold_uncertainty_score":0.44294205},"labels":[],"label_agreement":null},{"id":"W2020437202","doi":"10.1145/876638.876642","title":"Definable relations and first-order query languages over strings","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":53,"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; String (physics); First-order logic; Mathematics; Query language; Predicate (mathematical logic); Regular language; Theoretical computer science; Discrete mathematics; Programming language; Database; Automaton","score_opus":0.007487091163718904,"score_gpt":0.22484196362902464,"score_spread":0.21735487246530574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020437202","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.9742234,0.0022282857,0.013326408,0.0066721323,0.00037168743,0.00004564207,6.587838e-7,0.000019275663,0.0031125138],"genre_scores_gemma":[0.9663825,0.000058477413,0.03179639,0.00050381647,0.000044375785,4.096021e-7,2.8644571e-8,0.0000045729944,0.0012094042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995526,0.00004387222,0.0001291241,0.00005803253,0.00012629687,0.000090039226],"domain_scores_gemma":[0.9991506,0.0001580687,0.0001387732,0.00047991754,0.00004073568,0.000031942523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675387,0.00004636405,0.00007324709,0.000038906364,0.00011120719,0.0000745787,0.00077651517,0.000024285471,0.000028079096],"category_scores_gemma":[0.0007961386,0.000028039147,0.00004409561,0.0001555717,0.000020500838,0.0003306373,0.0002451471,0.00012345618,0.0000048855145],"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.000016996477,0.00021377251,0.10056128,0.000044409942,0.00016529374,0.00011067875,0.0046041477,0.0014522834,0.0041895816,0.7407504,0.13895409,0.008937067],"study_design_scores_gemma":[0.001710286,0.00018277421,0.23403938,0.00029845792,0.000074216776,0.0017578081,0.00072399905,0.0030969498,0.0063255765,0.5952015,0.15616126,0.0004278215],"about_ca_topic_score_codex":0.000009127526,"about_ca_topic_score_gemma":0.0000032064263,"teacher_disagreement_score":0.14554892,"about_ca_system_score_codex":0.000017527575,"about_ca_system_score_gemma":0.000036790894,"threshold_uncertainty_score":0.14429712},"labels":[],"label_agreement":null},{"id":"W2022427910","doi":"10.1145/1183907.1183913","title":"Online algorithms for market clearing","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":82,"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 Alberta","funders":"","keywords":"Competitive analysis; Online algorithm; Market clearing; Clearing; Profit (economics); Incentive compatibility; Computer science; Matching (statistics); Economics; Algorithm; Microeconomics; Subsidy; Incentive; Mathematics; Finance; Upper and lower bounds","score_opus":0.12735450957039895,"score_gpt":0.41239719845196815,"score_spread":0.2850426888815692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022427910","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.7860488,0.0002694074,0.12329017,0.079715036,0.002402271,0.0003306762,0.000059198905,0.000020908765,0.007863501],"genre_scores_gemma":[0.9138771,0.000006859027,0.050708976,0.0005612837,0.0017788465,0.0000027167298,4.173978e-7,0.000009799005,0.033053987],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990368,0.00006192074,0.00040410578,0.00006684647,0.00035752298,0.00007281128],"domain_scores_gemma":[0.9978839,0.0008066581,0.00045416647,0.00059937354,0.00022949258,0.000026422285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019315736,0.000038061673,0.000097814205,0.000056518573,0.00016322102,0.000062459476,0.0016680143,0.00002271853,0.00019045806],"category_scores_gemma":[0.0034007318,0.00001947642,0.00017283762,0.00022187337,0.000040336963,0.0001275866,0.00017130862,0.00009934793,0.000015079548],"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.00009110543,0.00026078717,0.0026864002,0.0000019956399,0.000025143787,0.0000013699798,0.00008623562,0.0019416924,0.002116358,0.012116171,0.8834758,0.09719695],"study_design_scores_gemma":[0.00018603475,0.0000206168,0.022305347,0.000006064442,0.000010411114,0.00005175503,0.00019008097,0.0007063443,0.00091312634,0.6821185,0.2934617,0.00003000671],"about_ca_topic_score_codex":0.0000020194998,"about_ca_topic_score_gemma":0.0000033642248,"teacher_disagreement_score":0.67000234,"about_ca_system_score_codex":0.000015161752,"about_ca_system_score_gemma":0.000025009294,"threshold_uncertainty_score":0.40712392},"labels":[],"label_agreement":null},{"id":"W2028769163","doi":"10.1145/1044731.1044733","title":"Determining approximate shortest paths on weighted polyhedral surfaces","year":2005,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":115,"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":"Discretization; Combinatorics; Face (sociological concept); Mathematics; Shortest path problem; Surface (topology); Euclidean geometry; Polyhedron; Computational geometry; Discrete mathematics; Algorithm; Geometry; Graph; Mathematical analysis","score_opus":0.02130323145929961,"score_gpt":0.2520038338114481,"score_spread":0.23070060235214848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028769163","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.9505292,0.00019175305,0.018647091,0.026031546,0.0019472763,0.00013686906,0.0000042803476,0.00006228362,0.0024497018],"genre_scores_gemma":[0.8871483,0.000029308965,0.111003846,0.00086336443,0.00041851064,5.500274e-7,3.2959943e-7,0.0000075079715,0.00052826153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990523,0.000045601315,0.00025737888,0.000112077236,0.0003534268,0.00017922942],"domain_scores_gemma":[0.9986002,0.00006623324,0.00027412668,0.00096780556,0.000038605765,0.000053069434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044391587,0.00009198208,0.0001270387,0.00007778984,0.00010470511,0.00023216229,0.004236207,0.000020633117,0.000010792944],"category_scores_gemma":[0.000116231786,0.000052857824,0.000094811025,0.00018442865,0.000021767202,0.00088280154,0.0010470221,0.00017039737,0.000024091984],"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.000034680892,0.000399767,0.010949422,0.000017158249,0.00016716622,0.00017607555,0.0011647812,0.0014879941,0.0028506636,0.0065408144,0.04739069,0.9288208],"study_design_scores_gemma":[0.0028842587,0.0011066716,0.094874725,0.00057704543,0.00013772257,0.0006029592,0.00021579082,0.7346602,0.027318269,0.025940735,0.11066653,0.001015081],"about_ca_topic_score_codex":0.000001059641,"about_ca_topic_score_gemma":0.0000014646632,"teacher_disagreement_score":0.9278057,"about_ca_system_score_codex":0.00002704311,"about_ca_system_score_gemma":0.000022185925,"threshold_uncertainty_score":0.7871997},"labels":[],"label_agreement":null},{"id":"W2029698681","doi":"10.1145/2395116.2395117","title":"The effectiveness of lloyd-type methods for the k-means problem","year":2012,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; Israel Science Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Computer science; Cluster analysis; Heuristic; Probabilistic logic; Popularity; Process (computing); Algorithm; Type (biology); Quality (philosophy); Data mining; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.05066538846456285,"score_gpt":0.4219683914484055,"score_spread":0.3713030029838426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029698681","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.002811858,0.0016304307,0.9904679,0.0033287122,0.00133549,0.00033299637,4.655925e-7,0.00000654514,0.0000856203],"genre_scores_gemma":[0.120699234,0.0001136707,0.87848526,0.000058487654,0.00032209893,0.000016527152,2.7152486e-8,0.000015488118,0.0002891894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981109,0.0009366471,0.0002548131,0.000073104704,0.0003402152,0.00028430554],"domain_scores_gemma":[0.9890963,0.008793597,0.000314201,0.0013411945,0.00039829538,0.000056448367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010052808,0.00007751206,0.00015593415,0.000032870375,0.00028964516,0.0000621501,0.0053722076,0.000029423343,9.3540393e-7],"category_scores_gemma":[0.004780509,0.000029692992,0.00016655042,0.00034549957,0.00010633255,0.0003077902,0.0014105159,0.0002876012,0.0000013554102],"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.00070035725,0.0002141064,0.0018188172,0.00022529894,0.00061953696,0.0000018500242,0.0022174628,0.016072106,0.06833603,0.017498428,0.0016321943,0.8906638],"study_design_scores_gemma":[0.0027390881,0.001598482,0.06103181,0.0006116288,0.00019236859,0.00080686196,0.00041847536,0.113977276,0.2942013,0.37314925,0.15080237,0.00047105955],"about_ca_topic_score_codex":0.0000038075905,"about_ca_topic_score_gemma":5.9375657e-7,"teacher_disagreement_score":0.89019275,"about_ca_system_score_codex":0.00006615232,"about_ca_system_score_gemma":0.00009080346,"threshold_uncertainty_score":0.99829876},"labels":[],"label_agreement":null},{"id":"W2029839940","doi":"10.1145/2537948","title":"Approximating Markov Processes by Averaging","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Mathematics; Probabilistic logic; Markov process; Probability measure; Bounded function; Equivalence (formal languages); Markov kernel; Probability distribution; Markov chain; Discrete mathematics; Applied mathematics; Markov model; Variable-order Markov model; Mathematical analysis","score_opus":0.014670643517577537,"score_gpt":0.259922977932267,"score_spread":0.24525233441468944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029839940","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.03210431,0.0001144352,0.9627748,0.003171921,0.00057155226,0.000039076716,1.3061964e-7,0.000015849846,0.0012079203],"genre_scores_gemma":[0.19753978,0.000006294475,0.8019437,0.00032066798,0.000104619365,7.0806414e-7,2.4692987e-8,0.0000036330039,0.00008056246],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991679,0.00013795686,0.00026116156,0.0000677961,0.00026324284,0.00010191703],"domain_scores_gemma":[0.99840754,0.00016373773,0.0005093456,0.00074766716,0.00014014551,0.000031534844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016652404,0.00005127704,0.00009062824,0.00003342482,0.00009775411,0.00010295118,0.0032932716,0.000019704858,0.0000021595324],"category_scores_gemma":[0.006562289,0.00003101582,0.000042016905,0.00023261913,0.000019004827,0.000522577,0.00047312176,0.00016296649,0.0000033093606],"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.000036939018,0.0002086925,0.008065536,0.00048545192,0.00009068408,0.0000034724305,0.006401401,0.0012595387,0.05067177,0.025184132,0.063027635,0.84456474],"study_design_scores_gemma":[0.0012371613,0.00035985903,0.008436452,0.0007856135,0.00005226356,0.0010264849,0.00021962756,0.32876217,0.33801138,0.23663947,0.0838578,0.00061172777],"about_ca_topic_score_codex":8.043358e-7,"about_ca_topic_score_gemma":8.03036e-8,"teacher_disagreement_score":0.843953,"about_ca_system_score_codex":0.000026223142,"about_ca_system_score_gemma":0.00004029194,"threshold_uncertainty_score":0.78561467},"labels":[],"label_agreement":null},{"id":"W2031722321","doi":"10.1145/1346330.1346335","title":"Optimal probabilistic fingerprint codes","year":2008,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":217,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Traitor tracing; Alphabet; Upper and lower bounds; Binary number; Code (set theory); Computer science; Fingerprint (computing); Probabilistic logic; Combinatorics; Discrete mathematics; Constant (computer programming); Binary code; Mathematics; Algorithm; Arithmetic; Statistics; Encryption; Public-key cryptography; Set (abstract data type); Computer security","score_opus":0.02532286824823652,"score_gpt":0.2555608767257372,"score_spread":0.23023800847750067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031722321","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.6200101,0.00017562436,0.37500829,0.0038441252,0.0004907324,0.00008412937,4.547067e-7,0.00006728411,0.00031929443],"genre_scores_gemma":[0.69838744,0.000031744425,0.30136892,0.00011760379,0.000052337313,7.83334e-7,1.2768346e-8,0.0000024249357,0.000038718892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934614,0.000051056126,0.00020838183,0.00007333243,0.00020528788,0.00011581538],"domain_scores_gemma":[0.9987279,0.00007753237,0.00022442699,0.00084046973,0.000092940056,0.00003669307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025492988,0.00006360778,0.00011255877,0.000055311728,0.00014334677,0.000027968963,0.003171228,0.000024563427,0.0000013833978],"category_scores_gemma":[0.00035058844,0.000035804696,0.00014193103,0.00017057222,0.00007771234,0.0002599813,0.00072447344,0.00018914798,0.0000011706153],"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.0010788379,0.0030642152,0.18148671,0.00038876117,0.0011354942,0.003602019,0.040102094,0.10454749,0.08494537,0.2073472,0.19786644,0.17443536],"study_design_scores_gemma":[0.0009719165,0.0010352242,0.08104868,0.0005029615,0.00004747592,0.009602202,0.000036003094,0.0062633557,0.11237385,0.7565939,0.030876916,0.0006475067],"about_ca_topic_score_codex":9.379046e-7,"about_ca_topic_score_gemma":1.9971274e-7,"teacher_disagreement_score":0.5492467,"about_ca_system_score_codex":0.000021586062,"about_ca_system_score_gemma":0.00004837617,"threshold_uncertainty_score":0.58929837},"labels":[],"label_agreement":null},{"id":"W2034956448","doi":"10.1145/2732263","title":"Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Snapshot (computer storage); Computer science; Time complexity; Computational complexity theory; Worst-case complexity; Binary logarithm; Upper and lower bounds; Algorithm; Theoretical computer science; Average-case complexity; Combinatorics; Mathematics; Database","score_opus":0.07412263790797627,"score_gpt":0.26414357091242885,"score_spread":0.19002093300445258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034956448","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.8700023,0.00037545373,0.11497895,0.011901199,0.0018628637,0.00019087624,0.0000164529,0.00004081539,0.000631036],"genre_scores_gemma":[0.9700554,0.000003926184,0.029100548,0.00047198875,0.00015698798,7.939309e-7,4.393269e-7,0.0000067304286,0.00020317042],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871284,0.00012024801,0.00032874898,0.00012580743,0.0005111603,0.00020119129],"domain_scores_gemma":[0.9975743,0.00006604038,0.0004718573,0.0013651081,0.0003509024,0.00017176106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368216,0.000113468566,0.00023445733,0.00005483421,0.000084168074,0.00023417469,0.003620784,0.00004288147,0.0000026765954],"category_scores_gemma":[0.00031542388,0.000060867213,0.000100918725,0.00032659786,0.00007453975,0.0006507066,0.00058974104,0.00027099528,0.000014199302],"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.00084162917,0.0010489408,0.121806554,0.000081247264,0.0007818836,0.00085710996,0.0045768344,0.0028814748,0.0023426116,0.07280719,0.7654657,0.026508871],"study_design_scores_gemma":[0.0126633365,0.002199722,0.33143258,0.0013154547,0.00017675631,0.013879709,0.00073470897,0.070028916,0.0027542885,0.052482236,0.51085365,0.0014786269],"about_ca_topic_score_codex":0.000056681718,"about_ca_topic_score_gemma":0.000028449613,"teacher_disagreement_score":0.25461197,"about_ca_system_score_codex":0.00009468482,"about_ca_system_score_gemma":0.00020416483,"threshold_uncertainty_score":0.6728378},"labels":[],"label_agreement":null},{"id":"W2037537665","doi":"10.1145/363647.363652","title":"Dynamic planar convex hull operations in near-logarithmic amortized time","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":81,"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":"Convex hull; Amortized analysis; Combinatorics; Binary logarithm; Logarithm; Mathematics; Regular polygon; Tangent; Constant (computer programming); Planar; Set (abstract data type); Time complexity; Computational geometry; Hull; Data structure; Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.01096369959703388,"score_gpt":0.2529968227406693,"score_spread":0.24203312314363543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037537665","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.9145103,0.0001331577,0.06740082,0.017039774,0.0005993637,0.00009792042,0.0000010242567,0.000011528145,0.00020610513],"genre_scores_gemma":[0.93193793,0.000028273855,0.06587866,0.00085278077,0.00008705327,0.0000015900001,0.0000014733806,0.0000043091213,0.0012079128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.000094867224,0.0003035704,0.000089376765,0.0002447159,0.000109545734],"domain_scores_gemma":[0.99920166,0.00008527985,0.00012497303,0.00043038605,0.00011436544,0.000043312426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043191283,0.000062316336,0.00012138808,0.00011315932,0.0001201848,0.00013192261,0.0014123342,0.000030828414,0.000036060123],"category_scores_gemma":[0.00034265057,0.00004358725,0.00007278801,0.0004771765,0.000023987322,0.00037051708,0.00019228642,0.00017020034,0.00004133901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015032655,0.00057194574,0.0074148816,0.000013286671,0.00014361824,0.00029842943,0.0024371617,0.86455864,0.062165134,0.008178102,0.01823115,0.035837352],"study_design_scores_gemma":[0.0013046152,0.00013121303,0.06978435,0.000046345347,0.000014029385,0.0009298539,0.00001730937,0.89822936,0.00059031753,0.021662557,0.0071396255,0.0001504395],"about_ca_topic_score_codex":0.000009641689,"about_ca_topic_score_gemma":0.000034992452,"teacher_disagreement_score":0.06236947,"about_ca_system_score_codex":0.00006333552,"about_ca_system_score_gemma":0.00017402445,"threshold_uncertainty_score":0.26244918},"labels":[],"label_agreement":null},{"id":"W2041091076","doi":"10.1145/502102.502106","title":"Interval arithmetic","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":339,"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 Victoria","funders":"","keywords":"Interval arithmetic; Interval (graph theory); Arithmetic; Multiplication (music); Affine arithmetic; Division (mathematics); Subtraction; Arbitrary-precision arithmetic; Saturation arithmetic; Mathematics; Real number; Second-order arithmetic; Set (abstract data type); Floating point; Algorithm; Computer science; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.018257081431443906,"score_gpt":0.25007981886063524,"score_spread":0.23182273742919132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041091076","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.09331795,0.00006873457,0.8532039,0.048932936,0.002094164,0.00003966565,1.322286e-7,0.000017827393,0.0023246715],"genre_scores_gemma":[0.93484324,0.00003104404,0.06388153,0.0007341535,0.00009774676,1.2681623e-7,1.4089547e-8,0.0000018251062,0.0004103368],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996086,0.00003300158,0.00013884222,0.000033941178,0.00013464974,0.000050987324],"domain_scores_gemma":[0.99935055,0.00003394886,0.0001367453,0.00038375388,0.0000675328,0.000027479122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001782736,0.000028337921,0.0000501896,0.000042928383,0.0000380855,0.000054357803,0.0012007977,0.000012743511,0.000045709505],"category_scores_gemma":[0.0003320935,0.000016860888,0.00006969013,0.00014979982,0.000014471137,0.00021954419,0.00023589827,0.000096709744,0.000009786433],"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.000035753234,0.00013971834,0.060057417,0.000007143003,0.00009831308,0.000099204924,0.0015572575,0.0075784023,0.0020843663,0.015263396,0.037191346,0.8758877],"study_design_scores_gemma":[0.0023273495,0.00039366964,0.62239486,0.00023014171,0.00006312824,0.012060542,0.00021939594,0.10391854,0.003392344,0.12819314,0.12639828,0.0004086067],"about_ca_topic_score_codex":0.0000011448018,"about_ca_topic_score_gemma":0.000002297674,"teacher_disagreement_score":0.8754791,"about_ca_system_score_codex":0.00002141729,"about_ca_system_score_gemma":0.000031891886,"threshold_uncertainty_score":0.22314009},"labels":[],"label_agreement":null},{"id":"W2041178136","doi":"10.1145/331605.331607","title":"Parallel RAMs with owned global memory and deterministic context-free language recognition","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Algorithms and Data Compression","field":"Computer Science","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":"York University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Context-free language; Computer science; Context (archaeology); Parallel computing; Class (philosophy); Binary logarithm; Programming language; Time complexity; Context switch; Crew; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Rule-based machine translation; Artificial intelligence","score_opus":0.013753264301839065,"score_gpt":0.23691720106431194,"score_spread":0.22316393676247287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041178136","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.96559995,0.0008078182,0.027730517,0.0043691033,0.00035325138,0.00012507374,0.000020202424,0.000024991312,0.00096908025],"genre_scores_gemma":[0.86368835,0.00008588972,0.13450035,0.0011644069,0.00024378236,0.0000014907603,0.0000011171529,0.000006569325,0.00030803183],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993668,0.000058117024,0.00016155186,0.00009421251,0.00021709086,0.00010220104],"domain_scores_gemma":[0.99883944,0.000056225254,0.00016106019,0.0008331672,0.00004532205,0.00006479872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001749147,0.00007093465,0.00011611218,0.000014278169,0.000087588975,0.000100720186,0.001774822,0.000025981515,0.000033448006],"category_scores_gemma":[0.00015232479,0.000035722394,0.00003858434,0.00008473575,0.000041011983,0.0003543908,0.00043667972,0.00010772843,0.000007959896],"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.00015049394,0.000048253958,0.0002871803,0.000007182055,0.000025675185,0.00013523769,0.00046086745,0.00004089419,0.00011105732,0.000047951104,0.005995589,0.9926896],"study_design_scores_gemma":[0.041816384,0.0075028506,0.33767626,0.004410013,0.00074456516,0.04578808,0.0029194157,0.09814362,0.005182896,0.4105578,0.04231301,0.0029450993],"about_ca_topic_score_codex":0.000020025198,"about_ca_topic_score_gemma":0.000013254085,"teacher_disagreement_score":0.98974454,"about_ca_system_score_codex":0.000019261532,"about_ca_system_score_gemma":0.000037399717,"threshold_uncertainty_score":0.32980904},"labels":[],"label_agreement":null},{"id":"W2047386086","doi":"10.1145/506147.506150","title":"On the closest string and substring problems","year":2002,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":237,"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; University of Waterloo","funders":"","keywords":"Substring; Hamming distance; Combinatorics; String (physics); Approximate string matching; Mathematics; String searching algorithm; String metric; Edit distance; Discrete mathematics; Set (abstract data type); Computer science; Algorithm; Pattern matching; Artificial intelligence","score_opus":0.039501308139665584,"score_gpt":0.21813544475435692,"score_spread":0.17863413661469135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047386086","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.95466065,0.0012101803,0.01802999,0.02440606,0.0008676545,0.00011373911,9.613982e-7,0.00001600886,0.0006947476],"genre_scores_gemma":[0.99479336,0.000097330034,0.004653426,0.00024851042,0.00011237491,3.4005012e-7,1.244884e-8,0.0000026853438,0.00009197501],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944407,0.000039518687,0.00013565537,0.00006282618,0.00021652385,0.00010139965],"domain_scores_gemma":[0.9988925,0.0001835498,0.00016528771,0.00069204107,0.00002903083,0.000037584225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033627555,0.000048019545,0.000063036554,0.00002447455,0.00015680546,0.00013156547,0.0020298276,0.000014988772,0.000010136174],"category_scores_gemma":[0.00028740463,0.000020258185,0.000038010232,0.00010084793,0.00001782529,0.00025832246,0.00081725005,0.00020265853,0.000004395015],"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.00003772558,0.00054590986,0.013673783,0.00006278468,0.00020136304,0.00014209229,0.0062699225,0.006943602,0.011183478,0.11550132,0.20713733,0.63830066],"study_design_scores_gemma":[0.0036426343,0.0012967996,0.14150292,0.0027533772,0.00008861007,0.0028519952,0.0003020833,0.30285588,0.02184817,0.41325542,0.108654544,0.00094756065],"about_ca_topic_score_codex":0.0000032785485,"about_ca_topic_score_gemma":5.497822e-7,"teacher_disagreement_score":0.6373531,"about_ca_system_score_codex":0.00001385439,"about_ca_system_score_gemma":0.0000068276586,"threshold_uncertainty_score":0.37719584},"labels":[],"label_agreement":null},{"id":"W2050570613","doi":"10.1145/337244.337257","title":"Learning functions represented as multiplicity automata","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":124,"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":"Learnability; Mathematics; Discrete mathematics; Multiplicity (mathematics); Disjoint sets; Combinatorics; Computer science; Artificial intelligence","score_opus":0.008940393291089208,"score_gpt":0.2585674569749757,"score_spread":0.24962706368388649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050570613","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.95126325,0.00008056659,0.018442132,0.017496929,0.0010483701,0.00006746977,4.3364167e-7,0.00014462743,0.011456242],"genre_scores_gemma":[0.9471633,0.000022314776,0.033420574,0.00034873374,0.00031698062,7.0250627e-7,1.4901634e-7,0.00000814426,0.018719133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990674,0.00018223381,0.00021667528,0.000104756204,0.00030059283,0.00012828893],"domain_scores_gemma":[0.998597,0.000106179694,0.00020471725,0.0009616336,0.00006710487,0.00006332965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046542488,0.000065697226,0.00010656694,0.00004867202,0.00023831331,0.00007788704,0.002446723,0.000027840362,0.00019094079],"category_scores_gemma":[0.001256596,0.000040010593,0.0001401174,0.00026566206,0.000021891608,0.00023657187,0.00045237166,0.00054871035,0.000113692404],"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.000082367675,0.00038355577,0.035218075,0.000011688124,0.00018912261,0.00014283751,0.0043395706,0.061401516,0.0015535305,0.00035353686,0.03706713,0.85925704],"study_design_scores_gemma":[0.0017213518,0.0006832404,0.20888728,0.00015867036,0.000052641826,0.002650516,0.00021645713,0.6010357,0.0013667572,0.009028387,0.1738675,0.00033151382],"about_ca_topic_score_codex":0.00007064925,"about_ca_topic_score_gemma":9.83056e-7,"teacher_disagreement_score":0.8589256,"about_ca_system_score_codex":0.000019513092,"about_ca_system_score_gemma":0.000041536652,"threshold_uncertainty_score":0.45466605},"labels":[],"label_agreement":null},{"id":"W2057974767","doi":"10.1145/1217856.1217860","title":"An approximation scheme for stochastic linear programming and its application to stochastic integer programs","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":112,"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":"Rounding; Vertex cover; Stochastic programming; Mathematical optimization; Mathematics; Linear programming; Generalization; Stochastic optimization; Integer (computer science); Integer programming; Approximation algorithm; Computer science","score_opus":0.054539277359258856,"score_gpt":0.3689163897992989,"score_spread":0.3143771124400401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057974767","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.25882685,0.00007144934,0.73890394,0.001317996,0.00014764325,0.0007132705,0.0000017395406,0.000009542479,0.0000075662133],"genre_scores_gemma":[0.9134849,0.0000015326103,0.08594635,0.00005097684,0.00035672908,0.000041594627,0.0000034466582,0.000010901836,0.00010358786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998414,0.00005649333,0.0006019808,0.00017212931,0.00060734694,0.0001480835],"domain_scores_gemma":[0.99775857,0.00020181817,0.0006536659,0.00050539157,0.00079066306,0.00008987386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00178838,0.00009399635,0.00017460741,0.00017103975,0.00015223942,0.0001939151,0.0009258733,0.00005452027,0.0000023548598],"category_scores_gemma":[0.0024988025,0.000054766755,0.00008148338,0.00049377745,0.000025706113,0.00041209484,0.00010264849,0.00010614313,0.000006590511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003649423,0.0004203784,0.00222155,0.000015051643,0.000028560535,6.400736e-7,0.001249176,0.5182161,0.0069373706,0.0029096238,0.0015344853,0.46610218],"study_design_scores_gemma":[0.0008356272,0.00065871177,0.0034711836,0.000077473014,0.000070918235,0.00008013507,0.00052007026,0.93401384,0.00079656387,0.054904412,0.0043536383,0.00021744407],"about_ca_topic_score_codex":0.000005147539,"about_ca_topic_score_gemma":0.000008154629,"teacher_disagreement_score":0.654658,"about_ca_system_score_codex":0.000029479568,"about_ca_system_score_gemma":0.0000476184,"threshold_uncertainty_score":0.29914805},"labels":[],"label_agreement":null},{"id":"W2062135503","doi":"10.1145/2528405","title":"Lower bounds for local approximation","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":46,"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":"Helsingin Yliopiston Tiedesäätiö; Suomen Kulttuurirahasto; Academy of Finland","keywords":"Mathematics; Combinatorics; Approximation algorithm; Dominating set; Upper and lower bounds; Discrete mathematics; Numbering; Bounded function; Independent set; Vertex (graph theory); Graph; Algorithm","score_opus":0.02291329635721146,"score_gpt":0.2504942880361266,"score_spread":0.22758099167891516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062135503","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.019674573,0.00007551608,0.9667267,0.0118168155,0.0013908513,0.000102768936,3.6469908e-7,0.000008946987,0.00020345017],"genre_scores_gemma":[0.64165884,0.0000064962096,0.3568637,0.0008604471,0.00034023888,0.000005502561,8.997006e-8,0.0000047911954,0.00025991476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994519,0.000024034905,0.00018001055,0.000056018118,0.00018742155,0.00010064911],"domain_scores_gemma":[0.99892455,0.000099935285,0.00017602081,0.00060118525,0.00016283727,0.00003549481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028504786,0.00004553326,0.00007930801,0.00004078185,0.00010415926,0.00014088255,0.0024167167,0.000022221855,0.00001529786],"category_scores_gemma":[0.00023108246,0.000026709942,0.000143985,0.00013409134,0.000043691936,0.00046324372,0.00039019165,0.000105192164,0.000009693603],"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.00003311623,0.00039152952,0.00039238995,0.00004758805,0.00011907605,0.0000047738886,0.0012227476,0.0013239636,0.0019542058,0.12318204,0.3059138,0.5654148],"study_design_scores_gemma":[0.00035416783,0.00015599692,0.0026419954,0.00003197163,0.0000076736405,0.000099682955,0.000030243478,0.1125162,0.0012536111,0.8653391,0.01749446,0.00007492598],"about_ca_topic_score_codex":0.000003684891,"about_ca_topic_score_gemma":7.6553005e-7,"teacher_disagreement_score":0.74215704,"about_ca_system_score_codex":0.000023245871,"about_ca_system_score_gemma":0.00003496651,"threshold_uncertainty_score":0.4490901},"labels":[],"label_agreement":null},{"id":"W2062374336","doi":"10.1145/1147954.1147962","title":"Computing with highly mixed states","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"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":"Initialization; Qubit; Ideal (ethics); Quantum computer; Computer science; State (computer science); Quantum circuit; Quantum gate; Quantum; Topology (electrical circuits); Quantum mechanics; Physics; Algorithm; Mathematics; Quantum error correction; Combinatorics","score_opus":0.005547299973036692,"score_gpt":0.20454736170077156,"score_spread":0.19900006172773488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062374336","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.85026896,0.00016606567,0.13917795,0.009619415,0.0006207433,0.00003180942,3.754223e-7,0.000027173042,0.00008750463],"genre_scores_gemma":[0.8207186,0.0000015805228,0.17866497,0.00021399486,0.0003412379,5.6630626e-8,8.019811e-8,0.00000560474,0.000053895226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990869,0.00006941583,0.00024563057,0.00009852635,0.00032103612,0.00017846149],"domain_scores_gemma":[0.99865067,0.00016162187,0.00036517545,0.00067428825,0.000109810266,0.0000384477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409562,0.00009000101,0.00014187013,0.000056382974,0.00015760947,0.00013462034,0.0027248564,0.000019145424,7.5911066e-7],"category_scores_gemma":[0.00006354008,0.000044072385,0.00008877856,0.00026646804,0.000037379505,0.000108165215,0.000652776,0.00025047155,0.0000022085762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004896257,0.00028046375,0.011812338,0.000036025576,0.0001469247,0.0002865374,0.0016477677,0.80672705,0.0030203245,0.008346925,0.05698063,0.110666044],"study_design_scores_gemma":[0.0016924505,0.00067990186,0.13399431,0.00044529364,0.000040444298,0.0028802715,0.000061003513,0.7045606,0.010421827,0.12868932,0.016088316,0.00044629342],"about_ca_topic_score_codex":0.000024514175,"about_ca_topic_score_gemma":0.000004712501,"teacher_disagreement_score":0.12218197,"about_ca_system_score_codex":0.000021493533,"about_ca_system_score_gemma":0.000064865206,"threshold_uncertainty_score":0.50635064},"labels":[],"label_agreement":null},{"id":"W2076172709","doi":"10.1145/765568.765571","title":"The height of a random binary search tree","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":100,"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":"Binary search tree; Combinatorics; Binary number; Random binary tree; Mathematics; Binary tree; Tree (set theory); Self-balancing binary search tree; Optimal binary search tree; Discrete mathematics; K-ary tree; Arithmetic; Tree structure","score_opus":0.022067085861600267,"score_gpt":0.2553730957915877,"score_spread":0.2333060099299874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076172709","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.5000078,0.011488503,0.2049857,0.2108533,0.013352646,0.0012423215,0.000010236262,0.000069836395,0.057989687],"genre_scores_gemma":[0.92641675,0.00089575903,0.06336858,0.00063124025,0.0003536248,0.0000020750067,2.1372115e-7,0.000014107703,0.00831763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907464,0.00016830221,0.00021542124,0.000056523055,0.00036464125,0.00012047698],"domain_scores_gemma":[0.9984182,0.0002177744,0.00018284026,0.001079906,0.00007186519,0.000029400862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478314,0.00004746895,0.00010081954,0.000044506538,0.00012414905,0.000098746794,0.0045019025,0.000011642787,0.0000071257095],"category_scores_gemma":[0.00042643963,0.000020354702,0.00011949679,0.0002579943,0.000047245056,0.00032422485,0.00080859783,0.00013517604,0.0000061268715],"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.00034457108,0.000575363,0.0043363743,0.000058222668,0.00070463907,0.00018737567,0.0020898678,0.0006688822,0.005586187,0.13886002,0.47256342,0.37402508],"study_design_scores_gemma":[0.011234428,0.0010064234,0.03005316,0.00028859687,0.00014701847,0.00048866216,0.0006552438,0.018181518,0.031759363,0.18649141,0.71924055,0.00045362586],"about_ca_topic_score_codex":0.0000017201455,"about_ca_topic_score_gemma":0.0000011168617,"teacher_disagreement_score":0.42640898,"about_ca_system_score_codex":0.000011042237,"about_ca_system_score_gemma":0.000045236717,"threshold_uncertainty_score":0.836573},"labels":[],"label_agreement":null},{"id":"W2086886584","doi":"10.1145/1538902.1538906","title":"Empirical hardness models","year":2009,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":110,"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 British Columbia","funders":"Division of Information and Intelligent Systems; Defense Advanced Research Projects Agency","keywords":"Computer science; Benchmark (surveying); Suite; Machine learning; Artificial intelligence; Algorithm","score_opus":0.30771221641620305,"score_gpt":0.47508981938245565,"score_spread":0.1673776029662526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086886584","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.7212672,0.0001421085,0.057015922,0.21126369,0.0011556899,0.00008151428,0.0000027152694,0.000011432544,0.009059698],"genre_scores_gemma":[0.9928832,0.000004318189,0.0016204611,0.0019536559,0.00022037976,2.5991247e-7,1.8339646e-8,0.0000016111898,0.0033160695],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987323,0.00012451498,0.00038872883,0.00006996024,0.00061455165,0.00006988814],"domain_scores_gemma":[0.9981325,0.00027932946,0.0003708779,0.0009244867,0.00023336362,0.000059386282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017320305,0.000040490446,0.00011393104,0.00005815766,0.00014344594,0.00007237842,0.0026284503,0.000027817034,0.00014616834],"category_scores_gemma":[0.0031850124,0.000018725948,0.00017003913,0.00036280605,0.000042847947,0.00028099155,0.00013150997,0.00015733835,0.0000823895],"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.00011035846,0.00023614387,0.0018208938,4.605019e-7,0.000021505006,0.000005407746,0.0012072304,0.011995869,0.0022763296,0.04650131,0.8667916,0.06903291],"study_design_scores_gemma":[0.000090823785,0.000024318591,0.009039691,0.0000037846842,0.00000646538,0.00009063736,0.00015386043,0.0003371691,0.00067493215,0.9453319,0.044220682,0.00002576515],"about_ca_topic_score_codex":1.4100036e-7,"about_ca_topic_score_gemma":1.4933777e-7,"teacher_disagreement_score":0.8988306,"about_ca_system_score_codex":0.000014911585,"about_ca_system_score_gemma":0.000045019697,"threshold_uncertainty_score":0.48843583},"labels":[],"label_agreement":null},{"id":"W2102573817","doi":"10.1145/2528401","title":"The expressibility of functions on the boolean domain, with applications to counting CSPs","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Unary operation; Counting problem; Boolean function; clone (Java method); Set (abstract data type); Complexity of constraint satisfaction; Bipartite graph; Function (biology); Binary number; Arity","score_opus":0.013455872453286045,"score_gpt":0.23035774983965002,"score_spread":0.21690187738636396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102573817","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.15536954,0.000025524132,0.75561816,0.08604601,0.00028734762,0.0005282789,0.0000015891469,0.000015889305,0.002107641],"genre_scores_gemma":[0.9808163,0.000004982014,0.018116754,0.0007633312,0.00006725054,0.000019929414,5.309023e-8,0.0000033428746,0.00020806157],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99927807,0.00007833797,0.00023106176,0.000071615636,0.0002596819,0.000081250415],"domain_scores_gemma":[0.997921,0.00039099794,0.00032301966,0.0010411338,0.00028738327,0.00003646356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005211174,0.000050194703,0.000062967316,0.000027689768,0.00038431623,0.0001247054,0.0013603056,0.000014375478,0.000027879214],"category_scores_gemma":[0.0003162163,0.000019558374,0.000057068173,0.00025479015,0.00007005919,0.00017910407,0.00019604727,0.00015066104,0.000013894028],"study_design_candidate":"observational","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.00020585158,0.0005933904,0.05528592,0.000038952563,0.0004627714,0.0000018497178,0.008595886,0.08006842,0.025659576,0.24195293,0.20910758,0.37802687],"study_design_scores_gemma":[0.0015011185,0.0007135222,0.6918157,0.0003778792,0.00010068212,0.0002720831,0.0065277596,0.01585762,0.009354864,0.1458454,0.12711367,0.00051973906],"about_ca_topic_score_codex":0.000009228548,"about_ca_topic_score_gemma":0.000018352805,"teacher_disagreement_score":0.8254467,"about_ca_system_score_codex":0.000030357798,"about_ca_system_score_gemma":0.00006218745,"threshold_uncertainty_score":0.29558885},"labels":[],"label_agreement":null},{"id":"W2105465869","doi":"10.1145/355483.355488","title":"A lower bound on the average-case complexity of shellsort","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Distribution (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.04482802075209594,"score_gpt":0.2642642397316009,"score_spread":0.21943621897950497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105465869","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.97408587,0.00004737271,0.0029013385,0.019979052,0.00015903717,0.000083206796,0.0000026174548,0.0000075859175,0.0027339517],"genre_scores_gemma":[0.995993,0.000010160317,0.0026114034,0.0006550203,0.000061378516,7.778907e-7,5.6441028e-8,0.0000029233308,0.0006652319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934375,0.0000593815,0.00021999868,0.000065550215,0.00022745048,0.00008389324],"domain_scores_gemma":[0.99826896,0.00013017154,0.00017981937,0.0013383742,0.00004918145,0.000033497123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034694176,0.000053536383,0.000094604104,0.00002077731,0.00014855439,0.000060315677,0.0024399844,0.00001685686,0.0002846571],"category_scores_gemma":[0.00007331957,0.000025980627,0.00014733209,0.0001771608,0.00009402216,0.000098355136,0.00023989977,0.00016128249,0.000047498568],"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.00028733074,0.004161117,0.0013855285,0.00007048207,0.0006412735,0.0018039697,0.008577428,0.0068058185,0.041806478,0.3823644,0.3731116,0.17898457],"study_design_scores_gemma":[0.0018828874,0.000737596,0.034299776,0.0002731161,0.0001325879,0.01695202,0.00013144444,0.05493379,0.049120624,0.52644867,0.31453815,0.00054937316],"about_ca_topic_score_codex":0.000010071748,"about_ca_topic_score_gemma":0.000003290299,"teacher_disagreement_score":0.17843519,"about_ca_system_score_codex":0.00001645384,"about_ca_system_score_gemma":0.00004080795,"threshold_uncertainty_score":0.45341384},"labels":[],"label_agreement":null},{"id":"W2109693504","doi":"10.1145/1667053.1667060","title":"A constructive proof of the general lovász local lemma","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":468,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Stavros Niarchos Foundation; Hungarian Scientific Research Fund","keywords":"Lemma (botany); Constructive; Constructive proof; Computer science; Mathematics; Discrete mathematics; Calculus (dental); Programming language; Process (computing)","score_opus":0.016981778734048606,"score_gpt":0.29607084622685104,"score_spread":0.27908906749280243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109693504","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.914277,0.00006850725,0.07502752,0.007964049,0.001921086,0.00016973246,0.0000022810377,0.0000055714436,0.00056421285],"genre_scores_gemma":[0.96753436,0.0000015880106,0.031942632,0.00013323741,0.00016812205,8.784744e-7,9.789734e-9,0.000005308511,0.00021387232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987387,0.00017933095,0.00026806927,0.00009749457,0.0005348636,0.00018154134],"domain_scores_gemma":[0.99751115,0.00017747315,0.00039822623,0.0015256981,0.0003240962,0.00006334382],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00073796965,0.0000756113,0.00014966547,0.00006312849,0.000106429135,0.000033061195,0.0063847313,0.000043086737,0.000014360495],"category_scores_gemma":[0.0010245044,0.000035425794,0.00019679639,0.0003771666,0.0005789885,0.0002847195,0.0017961172,0.0007293674,0.0000019286442],"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.000293342,0.0003192146,0.020634407,0.00004137553,0.000298094,0.00005324373,0.002593189,0.003528089,0.29918495,0.5160586,0.0070691593,0.14992629],"study_design_scores_gemma":[0.00058590976,0.00013887485,0.010404656,0.000044293152,0.000012312882,0.0010295977,0.00007138727,0.0025626998,0.2600961,0.7228092,0.0021528255,0.000092162874],"about_ca_topic_score_codex":0.0000032506002,"about_ca_topic_score_gemma":0.00000944618,"teacher_disagreement_score":0.20675054,"about_ca_system_score_codex":0.000025760899,"about_ca_system_score_gemma":0.00022483541,"threshold_uncertainty_score":0.9989912},"labels":[],"label_agreement":null},{"id":"W2122780600","doi":"10.1145/502090.502097","title":"Quantum lower bounds by polynomials","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":659,"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; University of Calgary","funders":"","keywords":"Boolean function; Quantum algorithm; Mathematics; Bounded function; Discrete mathematics; Quantum; Polynomial; Quantum complexity theory; Extension (predicate logic); Function (biology); Combinatorics; Computer science; Quantum mechanics","score_opus":0.010425034580195384,"score_gpt":0.2404386584872687,"score_spread":0.2300136239070733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122780600","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.9143634,0.00095767074,0.041089933,0.039706938,0.003533971,0.000045970413,0.0000011189097,0.000029011664,0.0002719854],"genre_scores_gemma":[0.97957873,0.000052550033,0.017362416,0.0016835019,0.00070402125,2.5158485e-7,6.127608e-8,0.000009956258,0.0006085008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895257,0.00008395904,0.0003010666,0.00011151875,0.0003358761,0.00021502558],"domain_scores_gemma":[0.9983372,0.0001254771,0.00033393776,0.0010450098,0.000073520976,0.00008484174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052233675,0.00009823159,0.00016776295,0.000055425866,0.00016337435,0.0001737505,0.0043819244,0.000038781494,0.000011956002],"category_scores_gemma":[0.00034879483,0.000055087683,0.00019173858,0.0002676714,0.000039632705,0.00017555205,0.00085200457,0.00030634302,0.000011557557],"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.00007834798,0.000415811,0.0029344657,0.000011265081,0.00016563224,0.0002626215,0.0013588732,0.0039419164,0.022067724,0.0030204298,0.82448757,0.14125533],"study_design_scores_gemma":[0.0016383528,0.0009090273,0.010898804,0.00024613753,0.00004333776,0.005443011,0.00003791764,0.13095486,0.005583571,0.1344619,0.70919937,0.0005837017],"about_ca_topic_score_codex":0.000009425167,"about_ca_topic_score_gemma":6.9570325e-7,"teacher_disagreement_score":0.14067163,"about_ca_system_score_codex":0.000031361407,"about_ca_system_score_gemma":0.00008179367,"threshold_uncertainty_score":0.8142779},"labels":[],"label_agreement":null},{"id":"W2139032973","doi":"10.1145/3321699","title":"On the Computability of Conditional Probability","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":32,"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":"Office of Naval Research Global; Army Research Office; Office of Naval Research; Defense Advanced Research Projects Agency; John Templeton Foundation; National Science Foundation","keywords":"Conditional probability distribution; Inference; Computability; Joint probability distribution; Regular conditional probability; Conditional probability; Probabilistic logic; Computer science; Conditional variance; Probability distribution; Mathematics; Fiducial inference; Bayesian network; Frequentist inference; Theoretical computer science; Artificial intelligence; Bayesian inference; Posterior probability; Bayesian probability; Econometrics; Statistics; Autoregressive conditional heteroskedasticity","score_opus":0.024525860751700435,"score_gpt":0.2397436997901926,"score_spread":0.21521783903849218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139032973","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.95923847,0.000031493397,0.018841455,0.019852087,0.0012054761,0.0003565767,0.0000051847683,0.0000145004815,0.000454772],"genre_scores_gemma":[0.9833047,7.6589896e-7,0.016072216,0.0004994948,0.00008965466,0.0000013549055,1.4193961e-7,0.000003923995,0.000027778866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773157,0.00049143983,0.00058884046,0.00021292758,0.00079934247,0.00017590425],"domain_scores_gemma":[0.9938651,0.0022330773,0.000641035,0.002733657,0.00046791023,0.000059239064],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002580513,0.00012522539,0.00029452884,0.000044910063,0.00009048981,0.000055180124,0.005999052,0.00004893986,0.000117158124],"category_scores_gemma":[0.0024813712,0.000060020695,0.0003438161,0.0003374401,0.00020841269,0.00021750297,0.001749228,0.00043230967,0.000025916092],"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.0003207915,0.0042248596,0.20313498,0.0002915794,0.00043471216,0.000014280624,0.002963485,0.0869167,0.004472645,0.65212876,0.025033766,0.02006346],"study_design_scores_gemma":[0.0003016799,0.00028100732,0.20157726,0.000030835512,0.0000075430744,0.00006335497,0.000013548105,0.011370163,0.0012798936,0.7846275,0.0003729443,0.00007425504],"about_ca_topic_score_codex":0.000005971735,"about_ca_topic_score_gemma":0.000001718934,"teacher_disagreement_score":0.13249879,"about_ca_system_score_codex":0.00013010591,"about_ca_system_score_gemma":0.00021631335,"threshold_uncertainty_score":0.999379},"labels":[],"label_agreement":null},{"id":"W2143473941","doi":"10.1145/2789208","title":"Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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":"Royal Society of Canada; National Science Foundation","keywords":"Mathematics; Monotone polygon; Upper and lower bounds; Combinatorics; Rounding; Discrete mathematics; Rate of convergence; Function (biology); Newton's method; Probabilistic logic; Markov chain; Context (archaeology); Applied mathematics; Computer science; Nonlinear system","score_opus":0.09159530198170775,"score_gpt":0.34461930435817323,"score_spread":0.2530240023764655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143473941","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.10691053,0.00015760821,0.88870364,0.002606126,0.0009576111,0.00041782606,0.000007431855,0.00002020773,0.00021903672],"genre_scores_gemma":[0.13697718,0.0000038170456,0.862493,0.00010344548,0.00015224077,0.000008451542,1.7390629e-7,0.000011602154,0.0002501037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858135,0.0002056093,0.00051167095,0.00014630496,0.00040000264,0.00015505361],"domain_scores_gemma":[0.9975663,0.0002278343,0.0007222104,0.0010891944,0.00031261088,0.000081840044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003377798,0.000106218,0.00029253023,0.00010108271,0.000064420514,0.00011960034,0.0019863793,0.00006766677,4.758036e-7],"category_scores_gemma":[0.0024109185,0.00007059712,0.000095629,0.00011911796,0.000047419388,0.0005000293,0.00047021027,0.00015775672,0.0000014390556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003454219,0.0015820733,0.0010035046,0.001309439,0.0009161289,0.000007866576,0.021208962,0.43789715,0.1409991,0.25580564,0.09014291,0.045673035],"study_design_scores_gemma":[0.0006877196,0.0002831919,0.0003814858,0.00014906496,0.000039895556,0.000084244384,0.000026520462,0.97518784,0.004774246,0.017594578,0.00070264237,0.00008859651],"about_ca_topic_score_codex":0.000011519993,"about_ca_topic_score_gemma":2.1682207e-7,"teacher_disagreement_score":0.5372907,"about_ca_system_score_codex":0.00015744062,"about_ca_system_score_gemma":0.00022099743,"threshold_uncertainty_score":0.36912197},"labels":[],"label_agreement":null},{"id":"W2146013153","doi":"10.1145/1314690.1314694","title":"Time lower bounds for implementations of multi-writer snapshots","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","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":"York University; University of Toronto","funders":"","keywords":"Snapshot (computer storage); Implementation; Computer science; Swap (finance); Parallel computing; Upper and lower bounds; Shared memory; Theoretical computer science; Arithmetic; Algorithm; Programming language; Mathematics; Operating system","score_opus":0.029246185940400588,"score_gpt":0.32575873090437923,"score_spread":0.29651254496397866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146013153","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.20445684,0.00026711944,0.7862973,0.0060591926,0.0021603233,0.00028957796,0.00006125793,0.000010862537,0.00039748385],"genre_scores_gemma":[0.937017,0.000002118254,0.061896376,0.0002829199,0.0001611843,0.0000012959724,9.0235153e-7,0.0000049212117,0.00063324],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912894,0.000020095598,0.00043264564,0.00006456374,0.00020955015,0.00014420834],"domain_scores_gemma":[0.99856824,0.000115129194,0.0004168944,0.000598215,0.0002563473,0.000045152534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084383215,0.000055774235,0.0001350146,0.0000477382,0.00007336475,0.000047646998,0.0017688398,0.000025305731,0.000016940763],"category_scores_gemma":[0.00020066912,0.000034895944,0.0001712776,0.00016277467,0.000027141255,0.00024054889,0.00019123498,0.00007155233,0.0000037954626],"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.00030776463,0.001511227,0.010029204,0.00016055339,0.000665778,0.000058645906,0.006752077,0.0011851182,0.13388155,0.012402586,0.77776855,0.055276908],"study_design_scores_gemma":[0.010694247,0.0014242694,0.16880113,0.0006529665,0.00016819708,0.0007584433,0.00066478545,0.030603748,0.04791854,0.017138027,0.7203968,0.0007788637],"about_ca_topic_score_codex":0.0000036453253,"about_ca_topic_score_gemma":0.0000061479655,"teacher_disagreement_score":0.7325602,"about_ca_system_score_codex":0.0000291714,"about_ca_system_score_gemma":0.000047739428,"threshold_uncertainty_score":0.32869738},"labels":[],"label_agreement":null},{"id":"W2146748072","doi":"10.1145/2590775","title":"Avoiding Three Consecutive Blocks of the Same Size and Same Sum","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","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":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Alphabet; Combinatorics; Block size; Mathematics; Word (group theory); Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.01285349044668734,"score_gpt":0.22524436285073757,"score_spread":0.21239087240405022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146748072","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.98221487,0.00033317163,0.005750253,0.010729552,0.0006476604,0.000052641335,0.000001286413,0.000008008999,0.0002625655],"genre_scores_gemma":[0.99431443,0.00001378685,0.004469624,0.0009884224,0.00010875995,2.5076275e-7,6.802421e-9,0.0000042496963,0.00010046064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990443,0.00023251206,0.00025071827,0.000087418644,0.00025653615,0.00012849532],"domain_scores_gemma":[0.99715114,0.0013838571,0.00046325766,0.00087574584,0.00008288219,0.00004313109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014276784,0.00007925224,0.00018008889,0.000025674763,0.0001694058,0.000059913902,0.002843084,0.000034997705,0.0000075572807],"category_scores_gemma":[0.0029383537,0.00003795587,0.0001291352,0.00013715257,0.00013613857,0.00015762159,0.0012590421,0.00032039697,0.0000011216524],"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.0002381446,0.000420999,0.0897375,0.00014018132,0.00078027963,0.00004441841,0.026346859,0.0005204708,0.37554485,0.3904763,0.034764104,0.080985926],"study_design_scores_gemma":[0.0008360317,0.00015794764,0.10221147,0.00039742055,0.000055133358,0.0007276332,0.00040684847,0.004241477,0.043245997,0.8457233,0.0018313414,0.00016541674],"about_ca_topic_score_codex":0.000013497354,"about_ca_topic_score_gemma":0.0000066723483,"teacher_disagreement_score":0.455247,"about_ca_system_score_codex":0.000016765283,"about_ca_system_score_gemma":0.00004670043,"threshold_uncertainty_score":0.5283205},"labels":[],"label_agreement":null},{"id":"W2157550063","doi":"10.1145/2559904","title":"The Space Complexity of Long-Lived and One-Shot Timestamp Implementations","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timestamp; Timestamp-based concurrency control; Computer science; Upper and lower bounds; Identifier; Time complexity; Asynchronous communication; Spacetime; Theoretical computer science; Algorithm; Mathematics; Programming language; Real-time computing; Concurrency control; Physics","score_opus":0.09217044298558189,"score_gpt":0.32247571661505103,"score_spread":0.23030527362946915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157550063","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.7017355,0.000610541,0.22834079,0.06628012,0.0013775667,0.00026488723,0.000020541092,0.000015166707,0.0013548861],"genre_scores_gemma":[0.9924615,0.000021322834,0.0072354013,0.00010470909,0.00006830248,5.864125e-7,2.0706274e-7,0.0000022873562,0.00010566229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991558,0.00013066707,0.000294621,0.00006584547,0.00024353141,0.00010952143],"domain_scores_gemma":[0.99839264,0.0001982701,0.0004622524,0.0007414649,0.00015952818,0.00004581865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008016029,0.000054009844,0.00013504483,0.000018134817,0.00019358298,0.0000974664,0.0017683478,0.000015302889,0.000003919402],"category_scores_gemma":[0.00028764526,0.000028524302,0.00006872282,0.00012654626,0.000111986075,0.00015295336,0.00041780536,0.00010553954,0.000001629359],"study_design_candidate":"observational","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.00017551407,0.00065908884,0.07581697,0.00019734903,0.0007714577,0.000018792924,0.009994085,0.001131888,0.033602774,0.60294807,0.17908098,0.09560302],"study_design_scores_gemma":[0.0019373633,0.0004286503,0.8077593,0.00027324425,0.000066232584,0.00031790778,0.00051304616,0.012367259,0.0074714865,0.13037522,0.038237993,0.00025228295],"about_ca_topic_score_codex":0.000025698184,"about_ca_topic_score_gemma":0.000039767066,"teacher_disagreement_score":0.73194236,"about_ca_system_score_codex":0.000014962146,"about_ca_system_score_gemma":0.00004865038,"threshold_uncertainty_score":0.32860598},"labels":[],"label_agreement":null},{"id":"W2158763191","doi":"10.1145/1059513.1059519","title":"An information-theoretic approach to normal forms for relational and XML data","year":2005,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":100,"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; Relational database; Normalization (sociology); XML; Relational model; Database normalization; Information retrieval; Data mining; Measure (data warehouse); Theoretical computer science; Set (abstract data type); Programming language; Artificial intelligence; Cluster analysis","score_opus":0.030487403835780105,"score_gpt":0.2772800273680918,"score_spread":0.2467926235323117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158763191","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.010295921,0.00003979861,0.9856798,0.0033708953,0.00012957344,0.000112274494,0.00004010795,0.0000056707663,0.00032594526],"genre_scores_gemma":[0.13347512,0.000004381615,0.86570364,0.0005710383,0.00019860223,0.0000023506952,0.000010436781,0.0000024503593,0.00003198127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940026,0.000016050806,0.00025176044,0.0000632058,0.0001810676,0.00008764749],"domain_scores_gemma":[0.9985266,0.000059798338,0.00019979019,0.0010588308,0.00009106402,0.00006394755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005795221,0.000048607286,0.00007745829,0.000045602508,0.00011910364,0.000057773625,0.0016268155,0.000016995496,0.0000012167852],"category_scores_gemma":[0.00042427474,0.000027431415,0.000022842623,0.00008039321,0.000021593612,0.005095755,0.00072502904,0.000071072565,0.000002422553],"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.000046522062,0.000041869363,0.00043325187,0.000028506876,0.00002066758,2.2873975e-7,0.0017552528,0.00666752,0.00009495239,0.9414344,0.0110543985,0.038422477],"study_design_scores_gemma":[0.0010235701,0.00024165497,0.006798297,0.00006467461,0.000019845103,0.0006249865,0.00035595996,0.17687064,0.0003766293,0.02875652,0.7846454,0.00022182713],"about_ca_topic_score_codex":9.744011e-7,"about_ca_topic_score_gemma":0.000001687261,"teacher_disagreement_score":0.9126778,"about_ca_system_score_codex":0.000015468335,"about_ca_system_score_gemma":0.0000520093,"threshold_uncertainty_score":0.36942995},"labels":[],"label_agreement":null},{"id":"W2168550848","doi":"10.1145/363647.363659","title":"Adversarial queuing theory","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":274,"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":"Queueing theory; Probabilistic logic; Computer science; Adversarial system; Fair queuing; Network packet; Routing (electronic design automation); Mathematical optimization; Distributed computing; Computer network; Artificial intelligence; Quality of service; Mathematics","score_opus":0.014641885972481403,"score_gpt":0.23815020435338854,"score_spread":0.22350831838090715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168550848","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.9622473,0.00028416823,0.0046085585,0.01146436,0.0026010864,0.00009544369,3.3056904e-7,0.00004642184,0.018652294],"genre_scores_gemma":[0.9927213,0.00001265965,0.0005650842,0.0021961234,0.0036612223,4.1171302e-7,2.1037725e-7,0.00001623685,0.0008267566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917597,0.00004135603,0.00029632737,0.00007668137,0.00025633926,0.00015331806],"domain_scores_gemma":[0.9983898,0.00015049442,0.00065693056,0.00063264056,0.00016122163,0.000008925922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309818,0.00009391169,0.00017261785,0.00014909405,0.00017267028,0.000089917805,0.0015127327,0.000034204037,0.00032897553],"category_scores_gemma":[0.003965608,0.000057367517,0.00026082745,0.0004139896,0.000050984025,0.0009463358,0.00053656934,0.00022980473,0.00007608703],"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.0050000018,0.0006414268,0.07323597,0.00016310884,0.0025504935,0.000646126,0.0008750372,0.08804347,0.021604253,0.62654716,0.077295125,0.1033978],"study_design_scores_gemma":[0.0006818887,0.000008431133,0.0016958436,0.00009168023,0.00035824731,0.000070750495,0.0003912318,0.0005969699,0.00016921539,0.85315925,0.14262849,0.00014801354],"about_ca_topic_score_codex":0.000010412826,"about_ca_topic_score_gemma":0.0000070367805,"teacher_disagreement_score":0.22661206,"about_ca_system_score_codex":0.000037893842,"about_ca_system_score_gemma":0.0000152576595,"threshold_uncertainty_score":0.47474894},"labels":[],"label_agreement":null},{"id":"W2238904460","doi":"10.1145/2824233","title":"Attribute-Based Encryption for Circuits","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"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":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Ciphertext; Attribute-based encryption; Encryption; Learning with errors; Theoretical computer science; Computer science; Ciphertext indistinguishability; Semantic security; Mathematics; Key (lock); Boolean circuit; Public-key cryptography; Malleability; Boolean function; Algorithm; Computer security","score_opus":0.07897727703077558,"score_gpt":0.2889504031054084,"score_spread":0.20997312607463287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238904460","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.07802316,0.00021821832,0.9106597,0.009533767,0.0013951677,0.00009462491,0.000011151722,0.00001396596,0.0000502787],"genre_scores_gemma":[0.9433931,0.00000405281,0.055681612,0.00065194,0.00025985495,0.0000015500099,9.369517e-7,0.0000030220006,0.0000039351157],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934196,0.000048941947,0.00017847876,0.00006816899,0.00025614907,0.00010630473],"domain_scores_gemma":[0.998499,0.00012006538,0.00023067194,0.000817195,0.00024838222,0.00008472279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512335,0.000049065875,0.00009044555,0.000059376867,0.00006247117,0.0000748842,0.002620029,0.00002956667,0.0000016557899],"category_scores_gemma":[0.0011168943,0.000030299925,0.00015860844,0.00022570549,0.000019583333,0.00037733917,0.00024699248,0.00010333202,0.0000030744116],"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.00020208636,0.00078115694,0.029579157,0.000082398474,0.00016917537,0.00003107044,0.002727402,0.0013608795,0.009369564,0.15897456,0.7295909,0.067131646],"study_design_scores_gemma":[0.0042039566,0.0008518373,0.03223532,0.00012214085,0.00006599839,0.00020246503,0.000099085395,0.00702972,0.01742309,0.76850474,0.16895984,0.00030181307],"about_ca_topic_score_codex":0.0000020622415,"about_ca_topic_score_gemma":0.0000018453519,"teacher_disagreement_score":0.8653699,"about_ca_system_score_codex":0.000029047702,"about_ca_system_score_gemma":0.0001391917,"threshold_uncertainty_score":0.4868709},"labels":[],"label_agreement":null},{"id":"W2279788372","doi":"10.1145/2996450","title":"A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Bounded function; Intersection (aeronautics); Dimension (graph theory); Time complexity; Algorithm; Algebraic number; Set (abstract data type); Real algebraic geometry; Polynomial; Mathematics; Running time; Computer science; Discrete mathematics; Combinatorics","score_opus":0.024758507011176947,"score_gpt":0.28851647264012326,"score_spread":0.2637579656289463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279788372","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.9059348,0.00006453147,0.088005215,0.005304867,0.0005600155,0.00008761662,0.0000014744741,0.000006834914,0.000034618297],"genre_scores_gemma":[0.8792531,0.00001390898,0.12048914,0.00008302084,0.00013319864,0.0000017428074,6.147899e-8,0.000004028878,0.000021797592],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993204,0.000052725194,0.0002091991,0.000117899246,0.00014774944,0.00015206379],"domain_scores_gemma":[0.99867564,0.0002636309,0.00040710391,0.000533851,0.00006558171,0.00005417565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064869074,0.00007720906,0.00016945157,0.000056103036,0.00036060088,0.0004772676,0.0016164548,0.00003289864,5.5933816e-7],"category_scores_gemma":[0.00086153,0.000052937252,0.000078852194,0.000051208728,0.00007231632,0.00087748823,0.00074727373,0.0001321308,3.5022197e-7],"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.00008061954,0.00007694381,0.00648704,0.000014902729,0.00005203704,0.00003270654,0.0025047828,0.00010121753,0.0015670841,0.010317053,0.00078197493,0.97798365],"study_design_scores_gemma":[0.0022288763,0.0003602656,0.53593165,0.00013756852,0.000019374635,0.00025000356,0.00006955702,0.13633767,0.0033275986,0.32042247,0.00070050365,0.00021445347],"about_ca_topic_score_codex":0.000107334796,"about_ca_topic_score_gemma":0.0000656771,"teacher_disagreement_score":0.9777692,"about_ca_system_score_codex":0.00004627977,"about_ca_system_score_gemma":0.00012099551,"threshold_uncertainty_score":0.46023026},"labels":[],"label_agreement":null},{"id":"W2295995314","doi":"10.1145/2049697.2049704","title":"QIP = PSPACE","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"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; Perimeter Institute","funders":"National Natural Science Foundation of China","keywords":"PSPACE; Quantum complexity theory; Turing machine; Complexity class; Quantum computer; Computer science; Computational complexity theory; Context (archaeology); Model of computation; Mathematics; Theoretical computer science; Quantum; Discrete mathematics; Computation; Algorithm; Quantum mechanics","score_opus":0.026207498746455875,"score_gpt":0.22904413157097595,"score_spread":0.20283663282452008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295995314","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.801998,0.00049912196,0.16964483,0.021325143,0.0039780918,0.00006355729,3.459447e-7,0.000046539088,0.0024443285],"genre_scores_gemma":[0.7415545,0.000006566635,0.25743604,0.00055522803,0.00026283978,9.949533e-8,4.452771e-9,0.0000042708334,0.00018046716],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944085,0.00004992838,0.00014560562,0.00006186147,0.00018981818,0.00011192216],"domain_scores_gemma":[0.99875635,0.000047178914,0.0002120175,0.00087626633,0.000059713333,0.00004849713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031071907,0.00005315947,0.000085579144,0.00003873231,0.00007444368,0.000035716115,0.0040728822,0.000019123816,0.000007026169],"category_scores_gemma":[0.00024854668,0.00002744817,0.000115988965,0.00015887506,0.000021921822,0.00010464686,0.000916094,0.00022012697,0.000008917281],"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.000092083515,0.0007376834,0.015556764,0.000051126408,0.0004042003,0.0005663557,0.049028505,0.005815134,0.008674812,0.056729425,0.20198259,0.66036135],"study_design_scores_gemma":[0.0012249697,0.0008131933,0.13566165,0.00030832234,0.00004720515,0.0044932244,0.000111256195,0.08555689,0.023723494,0.7019159,0.04564432,0.0004995424],"about_ca_topic_score_codex":0.0000051935685,"about_ca_topic_score_gemma":5.95071e-7,"teacher_disagreement_score":0.6598618,"about_ca_system_score_codex":0.000010328248,"about_ca_system_score_gemma":0.000046447538,"threshold_uncertainty_score":0.7568496},"labels":[],"label_agreement":null},{"id":"W2311002194","doi":"10.1145/2837019","title":"Byzantine Agreement in Expected Polynomial Time","year":2016,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Asynchronous communication; Adversary; Scheduling (production processes); Time complexity; Computation; Fraction (chemistry); Constant (computer programming); Adversary model; Quantum Byzantine agreement; State (computer science); Polynomial; Theoretical computer science; Byzantine fault tolerance; Algorithm; Distributed computing; Mathematics; Mathematical optimization; Computer network; Fault tolerance; Computer security","score_opus":0.008841307731756204,"score_gpt":0.22041813575760638,"score_spread":0.21157682802585018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311002194","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.92224,0.00037195173,0.022418737,0.05116952,0.0020759508,0.00013890138,0.000006918746,0.000018048215,0.0015599689],"genre_scores_gemma":[0.9964904,0.000006614415,0.0019823667,0.00013364547,0.00019935284,6.4193256e-7,3.6440564e-8,0.000002547273,0.001184363],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99913687,0.000066178945,0.00033041358,0.00007864789,0.00024949192,0.00013842023],"domain_scores_gemma":[0.99880594,0.000054765824,0.0002844056,0.00074282393,0.000069995804,0.00004209327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037646815,0.000059433867,0.00014150463,0.00004972004,0.000028105223,0.00003796775,0.0025022132,0.00002478559,0.000027989854],"category_scores_gemma":[0.0002933529,0.000026752252,0.00008394693,0.00018880535,0.00001625961,0.00024318817,0.0004312232,0.00007641063,0.000054216933],"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.00016028468,0.00047385553,0.025285967,0.000015571843,0.00012877163,0.00021723608,0.0014260677,0.0001022519,0.3314344,0.0021669783,0.53710747,0.10148112],"study_design_scores_gemma":[0.012560792,0.0006817709,0.48183137,0.0021841966,0.000031366802,0.0012205046,0.00009842794,0.0030525425,0.05279157,0.0049631326,0.43975815,0.00082617014],"about_ca_topic_score_codex":0.000006998934,"about_ca_topic_score_gemma":0.0000029887553,"teacher_disagreement_score":0.4565454,"about_ca_system_score_codex":0.000036273632,"about_ca_system_score_gemma":0.000051894185,"threshold_uncertainty_score":0.46497765},"labels":[],"label_agreement":null},{"id":"W2546991541","doi":"10.1145/3550483","title":"Decentralized Asynchronous Crash-resilient Runtime Verification","year":2022,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Natural Sciences and Engineering Research Council of Canada; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Agence Nationale de la Recherche","keywords":"Computer science; Crash; Asynchronous communication; Runtime verification; Distributed computing; Model checking; Formal verification; Programming language; Computer network","score_opus":0.020888571723054545,"score_gpt":0.2768892200078629,"score_spread":0.2560006482848084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546991541","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.46551803,0.00072454376,0.5127182,0.0135994945,0.006415405,0.00032629346,0.000003124165,0.000055190114,0.0006397575],"genre_scores_gemma":[0.5424455,0.000026219168,0.45689416,0.0004230505,0.00008119469,0.00000682499,2.7090277e-7,0.000007196393,0.00011563792],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99839145,0.0004058469,0.00036812716,0.00011268178,0.0005711223,0.00015079243],"domain_scores_gemma":[0.9976276,0.000075619704,0.0006035639,0.0015381195,0.00010445701,0.000050612663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014183838,0.00006929879,0.0001183608,0.00007833684,0.00029488924,0.00006796772,0.005230499,0.00001913455,0.00007468041],"category_scores_gemma":[0.0009466217,0.000049834347,0.00012830949,0.0003944399,0.00002966896,0.00033874347,0.0011778764,0.0002830608,0.000013686345],"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.0005791661,0.002069807,0.0203495,0.00007812175,0.00044516358,0.00007868339,0.012610091,0.075505994,0.18280658,0.2340283,0.13069494,0.34075364],"study_design_scores_gemma":[0.0033315385,0.0011953467,0.36051244,0.00007414359,0.00013736452,0.0022178062,0.00050703937,0.08780332,0.12063684,0.10630656,0.3165395,0.00073809444],"about_ca_topic_score_codex":0.0000033623023,"about_ca_topic_score_gemma":2.2583751e-7,"teacher_disagreement_score":0.34016293,"about_ca_system_score_codex":0.00025662922,"about_ca_system_score_gemma":0.00013321101,"threshold_uncertainty_score":0.97196555},"labels":[],"label_agreement":null},{"id":"W2568356985","doi":"10.1145/2518131","title":"From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Fonds Québécois de la Recherche sur la Nature et les Technologies; Mitacs; Canada Research Chairs","keywords":"Mathematical proof; Uncertainty principle; Mathematics; Norm (philosophy); Discrete mathematics; Cryptography; Relation (database); Key (lock); Entropic uncertainty; Euclidean geometry; Quantum cryptography; Theoretical computer science; Quantum; Quantum information; Computer science; Algorithm; Law","score_opus":0.0047677070574981655,"score_gpt":0.20825070281678557,"score_spread":0.2034829957592874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568356985","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.81195205,0.000023537683,0.17936966,0.008104609,0.00043179846,0.000072943796,7.498128e-7,0.0000125223605,0.000032123302],"genre_scores_gemma":[0.96419555,0.0000010839185,0.035188776,0.00045171447,0.00014432287,0.0000011136784,2.750959e-7,0.0000023129262,0.0000148637755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992759,0.000028258755,0.00027746565,0.00006894533,0.00024195922,0.00010744486],"domain_scores_gemma":[0.9989773,0.0001032979,0.00028791386,0.0004179633,0.00013916047,0.000074358446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144163,0.000065964494,0.00008983468,0.000112362126,0.00017221957,0.00020019671,0.0009381938,0.000026462183,0.000005969546],"category_scores_gemma":[0.00037276337,0.000040946597,0.000055147695,0.00025330513,0.000010690961,0.00038665324,0.0005550277,0.0001782973,0.000021111537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009147276,0.000039760507,0.0012660741,0.00000921737,0.000030223908,0.0000016174312,0.01990028,0.8239239,0.002148097,0.00079777086,0.010157686,0.14171623],"study_design_scores_gemma":[0.00023007796,0.00006228262,0.048909634,0.000155821,0.000008178742,0.000042802723,0.00015260233,0.9364645,0.00048373072,0.011813637,0.0015741142,0.000102617385],"about_ca_topic_score_codex":0.00009044018,"about_ca_topic_score_gemma":0.0000014623741,"teacher_disagreement_score":0.15224348,"about_ca_system_score_codex":0.00006515986,"about_ca_system_score_gemma":0.000032549186,"threshold_uncertainty_score":0.19305015},"labels":[],"label_agreement":null},{"id":"W2603442307","doi":"10.1145/3046673","title":"Instance-Optimal Geometric Algorithms","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","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":"University of Waterloo","funders":"Center for Massive Data Algorithmics; Danmarks Grundforskningsfond","keywords":"Computer science; Algorithm","score_opus":0.03309770124052353,"score_gpt":0.28907929181376957,"score_spread":0.25598159057324604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603442307","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.36017033,0.00042615735,0.618719,0.015671127,0.0038845588,0.000058421123,9.0789376e-7,0.000010348729,0.0010591771],"genre_scores_gemma":[0.86365527,0.000030044674,0.13493149,0.00023509414,0.0004978344,3.8513213e-7,6.8905365e-8,0.0000025536222,0.00064724137],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992464,0.000030041223,0.00019521722,0.00007586263,0.00035643834,0.0000959966],"domain_scores_gemma":[0.9980302,0.0000697301,0.00050298194,0.0011460512,0.00020304298,0.000047979185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048621182,0.000052915344,0.00009209201,0.00013518454,0.0003707811,0.00029558418,0.004554467,0.00002320867,0.000006836852],"category_scores_gemma":[0.0014346105,0.000033206463,0.00010572616,0.00025048357,0.000026631109,0.00073015393,0.000891745,0.00014070788,0.000010742596],"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.000033125474,0.00019685597,0.005196697,0.000012782044,0.00012990319,0.000068741494,0.00053185434,0.03156241,0.0025239568,0.016380314,0.039762884,0.90360045],"study_design_scores_gemma":[0.002602162,0.00054593297,0.6320558,0.00013372501,0.000058385787,0.0013887079,0.00003923371,0.063833185,0.028627913,0.12107483,0.14914969,0.0004904429],"about_ca_topic_score_codex":0.0000019115967,"about_ca_topic_score_gemma":6.72211e-7,"teacher_disagreement_score":0.90311,"about_ca_system_score_codex":0.00003288925,"about_ca_system_score_gemma":0.000096503165,"threshold_uncertainty_score":0.8463408},"labels":[],"label_agreement":null},{"id":"W2621304102","doi":"10.1145/2049697.2049699","title":"Truthful and Near-Optimal Mechanism Design via Linear Programming","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":122,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Combinatorial auction; Approximation algorithm; Mathematical optimization; Relaxation (psychology); Mathematics; Maximization; Common value auction; Computer science","score_opus":0.19522161902309265,"score_gpt":0.3618107105756824,"score_spread":0.16658909155258977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621304102","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.36781558,0.0000713177,0.62883365,0.002449851,0.00041371267,0.00015369807,8.8246446e-7,0.000011010897,0.0002502749],"genre_scores_gemma":[0.7836381,0.000004453667,0.21563253,0.00012027787,0.00011471534,0.0000020613024,1.6726185e-8,0.000005033699,0.00048281573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988415,0.00018386834,0.00038226467,0.000098787925,0.00039393693,0.0000996275],"domain_scores_gemma":[0.9982791,0.00037176654,0.0004766809,0.00060987327,0.00018314803,0.00007943108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028138114,0.000060404298,0.00012615028,0.00005146918,0.00026440303,0.00008217016,0.0014040994,0.000038852337,0.00020187498],"category_scores_gemma":[0.002326732,0.000031225023,0.00009997094,0.00024847573,0.00011132913,0.00021961113,0.00026480437,0.00016873643,0.000053982134],"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.001274402,0.0008491106,0.0035588457,0.0000108580825,0.00031025946,0.00005323194,0.025705257,0.001880984,0.028435564,0.103242844,0.01748443,0.8171942],"study_design_scores_gemma":[0.0002784527,0.00019850503,0.0017144041,0.000011900987,0.000040102263,0.00048029187,0.0009571498,0.0016837281,0.020363634,0.9608679,0.013317973,0.000085951295],"about_ca_topic_score_codex":0.0000016438107,"about_ca_topic_score_gemma":3.0266037e-7,"teacher_disagreement_score":0.85762507,"about_ca_system_score_codex":0.0000085679885,"about_ca_system_score_gemma":0.00003934191,"threshold_uncertainty_score":0.27854836},"labels":[],"label_agreement":null},{"id":"W2624483937","doi":"10.1145/1706591.1706596","title":"A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":66,"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":"Combinatorics; Convex hull; Amortized analysis; Mathematics; Regular polygon; Euclidean geometry; Set (abstract data type); Data structure; Point (geometry); k-nearest neighbors algorithm; Computational geometry; Plane (geometry); Extreme point; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.018289579272460672,"score_gpt":0.28568177336151285,"score_spread":0.2673921940890522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624483937","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.8325286,0.00017144287,0.14760603,0.01726277,0.0022639746,0.00011729767,0.000027156038,0.0000074973414,0.000015218957],"genre_scores_gemma":[0.83741266,0.000007431706,0.16195224,0.0003507477,0.00018585418,3.7252715e-7,0.0000031047566,0.0000028574161,0.00008474027],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995185,0.00002068532,0.00015029786,0.000096429634,0.00014390984,0.000070153794],"domain_scores_gemma":[0.99867266,0.00016574559,0.00018025166,0.00080982293,0.00013214482,0.000039353814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025519272,0.00005115158,0.00008396037,0.000040005474,0.00011485945,0.0001468141,0.002035632,0.000030514886,0.0000078687135],"category_scores_gemma":[0.0008625677,0.000031570104,0.000029530638,0.00010694484,0.00003350797,0.0004696629,0.00074239017,0.00015461215,5.529747e-7],"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.00021434388,0.00016523819,0.005571071,0.00013403413,0.0003087397,0.000020419036,0.0024604306,0.0049640853,0.44133055,0.12519456,0.049622495,0.370014],"study_design_scores_gemma":[0.001730828,0.00032598292,0.111799434,0.00005455023,0.000073688636,0.0013379372,0.00006734934,0.36664942,0.0093735885,0.39449584,0.113768905,0.00032246328],"about_ca_topic_score_codex":0.0000014351098,"about_ca_topic_score_gemma":0.00003391606,"teacher_disagreement_score":0.43195698,"about_ca_system_score_codex":0.0000057066623,"about_ca_system_score_gemma":0.00010397978,"threshold_uncertainty_score":0.37827447},"labels":[],"label_agreement":null},{"id":"W2765269579","doi":"10.1145/3125644","title":"Communication Steps for Parallel Query Processing","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":106,"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":"Alberta Innovates - Technology Futures; Wisconsin Alumni Research Foundation; National Science Foundation","keywords":"Computer science; Skew; Joins; Upper and lower bounds; Parallel computing; Matching (statistics); Binary logarithm; Communication complexity; Simple (philosophy); Graph; Algorithm; Theoretical computer science; Combinatorics; Mathematics","score_opus":0.037609609778980244,"score_gpt":0.3058304111590551,"score_spread":0.26822080138007487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765269579","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.11801729,0.0013533386,0.8148931,0.06307626,0.0013457884,0.00023765347,0.000001310479,0.000019275392,0.0010559701],"genre_scores_gemma":[0.8377529,0.00001994161,0.16176395,0.00020402907,0.00008343023,0.0000014864706,3.5332263e-8,0.0000027516564,0.00017148658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995686,0.000051436447,0.0001486013,0.00004451535,0.00011029805,0.00007658151],"domain_scores_gemma":[0.9975039,0.00008132352,0.0005688457,0.0016995929,0.00012094326,0.000025430205],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007938588,0.000039668797,0.00007815321,0.000022010374,0.0006218582,0.00026597598,0.0069751837,0.000019697723,6.3539306e-7],"category_scores_gemma":[0.00061774626,0.000023185396,0.000098137185,0.00002832853,0.00005196342,0.00068648654,0.0007119059,0.000116490824,9.931789e-7],"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.00019272095,0.00042941666,0.0070456187,0.00012639171,0.00018272207,0.000013513354,0.006832731,0.0010717453,0.005712233,0.22132349,0.020370508,0.7366989],"study_design_scores_gemma":[0.00061177363,0.00006597264,0.018201446,0.00017627544,0.000016494843,0.00009024875,0.00006617589,0.008426005,0.0018263505,0.96530706,0.005127762,0.00008443273],"about_ca_topic_score_codex":0.0000010796194,"about_ca_topic_score_gemma":0.0000010729777,"teacher_disagreement_score":0.74398357,"about_ca_system_score_codex":0.000009407018,"about_ca_system_score_gemma":0.000042430715,"threshold_uncertainty_score":0.9983975},"labels":[],"label_agreement":null},{"id":"W2786920798","doi":"10.1145/3034781","title":"The Freezing Threshold for <i>k</i> -Colourings of a Random Graph","year":2018,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","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 Toronto","funders":"","keywords":"Combinatorics; Random graph; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.049280890116096834,"score_gpt":0.3290467252830249,"score_spread":0.2797658351669281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786920798","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.16873218,0.0006216614,0.8202275,0.007132598,0.002008456,0.00057568424,0.000023579525,0.000012488971,0.00066582276],"genre_scores_gemma":[0.9390686,0.000036430363,0.05995697,0.00022606326,0.00051139976,0.0000071580366,4.2105206e-8,0.000020154732,0.00017316826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908555,0.000019972,0.00042852203,0.00005217517,0.00026084593,0.00015291233],"domain_scores_gemma":[0.99595124,0.0025609073,0.0005711058,0.00048016876,0.000396903,0.000039659622],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0010099265,0.0000732292,0.0002221843,0.0000228661,0.00019916419,0.000025502382,0.0012096287,0.000036950165,0.0000071540057],"category_scores_gemma":[0.014981977,0.000032806245,0.00019899587,0.00010160564,0.000101564234,0.00003832777,0.00020339682,0.00013654357,7.7096786e-7],"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.0020600029,0.00016656065,0.000050899525,0.0002754131,0.00038093264,0.00000368033,0.0013398433,0.000008140108,0.0134278685,0.89814687,0.079516746,0.004623058],"study_design_scores_gemma":[0.0011580252,0.00027935073,0.000011717721,0.00013620745,0.00012218127,0.00003712296,0.00011836346,0.00052515505,0.0124141695,0.9840318,0.0011234147,0.000042497217],"about_ca_topic_score_codex":0.0000010034414,"about_ca_topic_score_gemma":0.0000067742094,"teacher_disagreement_score":0.77033645,"about_ca_system_score_codex":0.000014264833,"about_ca_system_score_gemma":0.000050631254,"threshold_uncertainty_score":0.9933152},"labels":[],"label_agreement":null},{"id":"W2889833303","doi":"10.1145/3375890","title":"Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Log-log plot; Binary logarithm; Bounded function; Search engine indexing; Space (punctuation); Suffix; Generalized suffix tree; Suffix tree; Suffix array","score_opus":0.03092524817749018,"score_gpt":0.24822707174398864,"score_spread":0.21730182356649846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889833303","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.74798626,0.00059187744,0.17989895,0.070661895,0.0005517759,0.000079117846,0.000003507935,0.000016565285,0.00021007961],"genre_scores_gemma":[0.8901476,0.000050240516,0.10845753,0.00082053506,0.00042291576,4.676845e-7,3.8553048e-7,0.00000627086,0.00009403843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914944,0.00007854384,0.00018784178,0.00011928531,0.0003348818,0.0001299995],"domain_scores_gemma":[0.9992245,0.0001200368,0.00014226632,0.00036514908,0.000046540332,0.00010152445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033527432,0.00006840314,0.00012061289,0.00005145335,0.00011286898,0.00018693844,0.0014489722,0.00002463515,0.000015514215],"category_scores_gemma":[0.0003793036,0.000041517425,0.00005540095,0.00019021815,0.000033095803,0.00057490164,0.0015036342,0.0003283125,0.0000043009195],"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.0017723251,0.0010499859,0.07432687,0.00016748189,0.00042796665,0.0010838414,0.030312262,0.07202894,0.09296934,0.042309914,0.30250746,0.3810436],"study_design_scores_gemma":[0.003600553,0.0009568328,0.42650452,0.00037270377,0.000031448784,0.0011238493,0.0006977285,0.46586493,0.002579557,0.02350995,0.074268885,0.00048903015],"about_ca_topic_score_codex":0.00001382551,"about_ca_topic_score_gemma":0.0000076083315,"teacher_disagreement_score":0.393836,"about_ca_system_score_codex":0.000024032357,"about_ca_system_score_gemma":0.00010057339,"threshold_uncertainty_score":0.2692575},"labels":[],"label_agreement":null},{"id":"W2890178860","doi":"10.1145/3203409","title":"General Belief Revision","year":2018,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Belief revision; Iterated function; Possible world; Propositional calculus; Classical logic; Computer science; Representation (politics); Literal (mathematical logic); Mathematics; Artificial intelligence; Algorithm; Programming language; Epistemology; Philosophy","score_opus":0.02115725974050229,"score_gpt":0.2720268880641111,"score_spread":0.2508696283236088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890178860","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.85451216,0.0026015618,0.074514136,0.02677074,0.010572339,0.00013951055,5.1650005e-7,0.00005369839,0.030835345],"genre_scores_gemma":[0.92909825,0.000078650555,0.06387637,0.0011805735,0.0028129166,1.5425817e-7,2.6375734e-8,0.000005490389,0.0029475763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934345,0.00006638168,0.00018054932,0.000074088595,0.00021512085,0.00012042857],"domain_scores_gemma":[0.99858904,0.000040672854,0.00022646485,0.00088944664,0.00019797553,0.0000564034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050244114,0.000054727087,0.000101646045,0.000034370787,0.0001265078,0.000077276636,0.0034710395,0.000028746485,0.000026319285],"category_scores_gemma":[0.0007213285,0.000027343802,0.00011931751,0.00016081898,0.00004087528,0.00022153414,0.0009857694,0.00012975659,0.00007903373],"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.000034699402,0.00018562714,0.006448724,0.000015416494,0.00007627418,0.00004543101,0.0037443414,0.00002412161,0.012556184,0.05363305,0.74191666,0.18131945],"study_design_scores_gemma":[0.0011216778,0.0011063769,0.051934272,0.00027201246,0.00004188706,0.0012513666,0.000026977254,0.0049989065,0.029257579,0.16067807,0.74899596,0.00031492137],"about_ca_topic_score_codex":0.00000194138,"about_ca_topic_score_gemma":0.0000014811084,"teacher_disagreement_score":0.18100452,"about_ca_system_score_codex":0.000027137505,"about_ca_system_score_gemma":0.000057031557,"threshold_uncertainty_score":0.64501125},"labels":[],"label_agreement":null},{"id":"W2900444034","doi":"10.1145/3431922","title":"Uniform, Integral, and Feasible Proofs for the Determinant Identities","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"National Natural Science Foundation of China","keywords":"Mathematical proof; Mathematics; Axiom; Bounded function; Discrete mathematics; Polynomial; Class (philosophy); Proof complexity; Algebra over a field; Pure mathematics; Computer science","score_opus":0.03872084732340131,"score_gpt":0.27971918533816037,"score_spread":0.24099833801475906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900444034","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.39622873,0.012022463,0.46266046,0.11931792,0.008488669,0.0005932155,0.000012417261,0.000042123254,0.0006339923],"genre_scores_gemma":[0.69537264,0.001064587,0.2964652,0.0020258273,0.00077599246,0.000012148676,2.3053649e-7,0.000016684082,0.0042667086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994312,0.000037522525,0.00017610822,0.000069572925,0.0001748563,0.00011071762],"domain_scores_gemma":[0.9987018,0.0002884033,0.00015737141,0.0006579488,0.00016574151,0.000028719307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041810502,0.000056523397,0.00010129162,0.000032381406,0.00025760013,0.00026294493,0.002114569,0.000017589275,0.000003971973],"category_scores_gemma":[0.00055856,0.00002654857,0.00013900663,0.00016720554,0.00007291853,0.00030635815,0.0010029539,0.00015026788,4.9327855e-7],"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.00009128705,0.000364184,0.005799604,0.0002387755,0.0004893479,0.00020374006,0.0068674674,0.00023026801,0.003813523,0.2804457,0.08966103,0.61179507],"study_design_scores_gemma":[0.0005727462,0.00018109294,0.0104761375,0.00018161756,0.00005363383,0.0023382045,0.00057511247,0.012683702,0.0138140675,0.9251754,0.03381696,0.00013131334],"about_ca_topic_score_codex":0.0000030808021,"about_ca_topic_score_gemma":0.000018511744,"teacher_disagreement_score":0.64472973,"about_ca_system_score_codex":0.000013960245,"about_ca_system_score_gemma":0.000094507595,"threshold_uncertainty_score":0.39294308},"labels":[],"label_agreement":null},{"id":"W2938191358","doi":"10.1145/3385731","title":"Planar Graphs Have Bounded Queue-Number","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Planar graph; 1-planar graph; Bounded function; Pathwidth; Book embedding; Tree-depth; Indifference graph; Clique-sum; Graph product","score_opus":0.04225608643793,"score_gpt":0.310918355023021,"score_spread":0.268662268585091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938191358","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.4770671,0.0008543763,0.20655519,0.30496043,0.0021802608,0.00045380942,0.000007884128,0.00013078601,0.0077901375],"genre_scores_gemma":[0.94324803,0.00003688238,0.05237113,0.0037808092,0.00022347154,0.0000011048828,8.46091e-8,0.00001364031,0.0003248226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864906,0.00017610608,0.00026162143,0.00013016464,0.0005607199,0.00022235535],"domain_scores_gemma":[0.99821526,0.0001899978,0.00024586933,0.0010232489,0.00014718334,0.00017845597],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00048397054,0.00008848297,0.00016409738,0.00005183033,0.00013101724,0.00011390383,0.006112409,0.00003440814,0.00002931754],"category_scores_gemma":[0.0012385565,0.000054011947,0.00020382443,0.00042049115,0.00009030557,0.00045769656,0.00091862446,0.0004703138,0.000051122563],"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.0005920231,0.00024666902,0.045986824,0.00006840062,0.000506855,0.0007750353,0.008129219,0.0006934658,0.026214622,0.6948159,0.20314892,0.018822111],"study_design_scores_gemma":[0.00045791728,0.00011929017,0.0025875117,0.000025762525,0.000008323411,0.00028817687,0.000076758,0.00063053175,0.004249568,0.9772812,0.014173673,0.00010126433],"about_ca_topic_score_codex":0.000002516266,"about_ca_topic_score_gemma":0.0000022745498,"teacher_disagreement_score":0.46618092,"about_ca_system_score_codex":0.000030050282,"about_ca_system_score_gemma":0.00009341114,"threshold_uncertainty_score":0.999265},"labels":[],"label_agreement":null},{"id":"W2950407838","doi":"10.1145/3312741","title":"Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD, and Optimisation","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"FP7 Ideas: European Research Council; Science Foundation Ireland","keywords":"Markov chain; Constraint (computer-aided design); Mathematical optimization; Convergence (economics); Computer science; Markov process; Resource (disambiguation); Key (lock); Class (philosophy); Mathematics; Artificial intelligence; Machine learning; Computer network","score_opus":0.007230562928702009,"score_gpt":0.20966830750040452,"score_spread":0.20243774457170252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950407838","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.99370855,0.00023366985,0.00036828805,0.0036681225,0.0005155738,0.00011522408,5.64689e-7,0.00001479037,0.0013752332],"genre_scores_gemma":[0.99588686,0.000036962818,0.00089310005,0.00092559116,0.00065463025,7.345092e-7,6.9464693e-7,0.000017827535,0.001583606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.000027340087,0.00027172704,0.000109810564,0.00027915437,0.00013734202],"domain_scores_gemma":[0.99860275,0.00008599541,0.00062824914,0.00054717046,0.00012399176,0.000011834906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994247,0.00010864431,0.00019169276,0.00013344659,0.00011440568,0.00011673609,0.00074000744,0.000041062227,0.00020818252],"category_scores_gemma":[0.00059317285,0.00007222503,0.00011914245,0.00017225483,0.000031023756,0.00056048646,0.0004544716,0.00017009597,0.000058397494],"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.0037188628,0.0006890948,0.13492809,0.0010629204,0.0021347883,0.00028267043,0.0010462151,0.6039093,0.11067046,0.01799066,0.024707243,0.0988597],"study_design_scores_gemma":[0.026891878,0.00056686613,0.061021984,0.0025821922,0.0054989615,0.0017074742,0.0060354983,0.28688034,0.017702209,0.35122502,0.23563641,0.0042511676],"about_ca_topic_score_codex":0.000011218312,"about_ca_topic_score_gemma":0.000010008502,"teacher_disagreement_score":0.33323437,"about_ca_system_score_codex":0.000060385704,"about_ca_system_score_gemma":0.000019919877,"threshold_uncertainty_score":0.29452512},"labels":[],"label_agreement":null},{"id":"W2951747536","doi":"10.1145/3321386","title":"Hierarchical Clustering","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":207,"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":"Engineering and Physical Sciences Research Council; Alan Turing Institute; National Science Foundation","keywords":"Cluster analysis; Hierarchical clustering; Granularity; Constrained clustering; Computer science; Correlation clustering; Data mining; Similarity (geometry); Hierarchy; Fuzzy clustering; Set (abstract data type); Function (biology); Canopy clustering algorithm; Mathematics; Artificial intelligence","score_opus":0.020996761164785226,"score_gpt":0.29897148618925345,"score_spread":0.27797472502446824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951747536","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.34279487,0.00017251434,0.625608,0.026574442,0.0030733165,0.00015802715,4.2810714e-7,0.000033595577,0.0015847917],"genre_scores_gemma":[0.69528407,0.00001602953,0.3021037,0.00041753554,0.0002760451,6.433836e-7,1.7226872e-8,0.000010719092,0.0018912571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989683,0.00007333234,0.00020204415,0.00009282117,0.0004773493,0.00018617418],"domain_scores_gemma":[0.99819446,0.00016122483,0.00014219909,0.0013403699,0.00009110627,0.000070633476],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00045158726,0.000056966095,0.00011647356,0.00006657489,0.000051806703,0.00007850627,0.0055552125,0.000025590387,0.000014839713],"category_scores_gemma":[0.00057122455,0.00003355165,0.00010241548,0.00021638443,0.000025363766,0.0003552454,0.0033453512,0.00041258297,0.00005258473],"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.00026054637,0.0003397878,0.013953663,0.00019566616,0.00029855582,0.00039905251,0.004266337,0.104861386,0.114968956,0.008268516,0.012287892,0.73989964],"study_design_scores_gemma":[0.004037344,0.0012833405,0.06833528,0.00065900496,0.000019512003,0.006002082,0.00014906988,0.6501594,0.022148332,0.17329308,0.07318375,0.0007297871],"about_ca_topic_score_codex":0.0000011440685,"about_ca_topic_score_gemma":4.5252233e-7,"teacher_disagreement_score":0.73916984,"about_ca_system_score_codex":0.00006266297,"about_ca_system_score_gemma":0.00006907001,"threshold_uncertainty_score":0.9998252},"labels":[],"label_agreement":null},{"id":"W2971886964","doi":"10.1145/3444942","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","year":2021,"lang":"en","type":"preprint","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Exploratory Research for Advanced Technology; National University of Singapore; Japan Society for the Promotion of Science; Indian Institute of Science","keywords":"Parameterized complexity; Combinatorics; Mathematics; Norm (philosophy); Integer (computer science); Discrete mathematics; Lattice problem; Algorithm; Computer science","score_opus":0.041255141436941915,"score_gpt":0.28014397014508674,"score_spread":0.23888882870814482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971886964","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.9787478,0.0007198859,0.012548312,0.0061446405,0.0015593001,0.00020964773,0.000017099255,0.000012123955,0.000041207317],"genre_scores_gemma":[0.7843086,0.000104166276,0.21538948,0.00006768022,0.00011264232,0.0000023305352,6.835394e-7,0.0000056425993,0.000008760292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823356,0.0002865103,0.0006593584,0.00024340134,0.0004284812,0.00014870161],"domain_scores_gemma":[0.9961891,0.00040162986,0.0009490786,0.002074699,0.00030631933,0.000079169695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011177108,0.00016239373,0.00051729527,0.00007602086,0.00006125718,0.00018894621,0.0044568595,0.000118695876,0.000013741948],"category_scores_gemma":[0.0012053447,0.000108522065,0.0003465359,0.00020450554,0.00013977182,0.00019990501,0.007295216,0.000905686,2.1584293e-7],"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.0010022526,0.007628332,0.14255062,0.00792205,0.007855835,0.00090439373,0.06259004,0.010455668,0.10621963,0.016566763,0.016220177,0.6200842],"study_design_scores_gemma":[0.0011398094,0.00046930683,0.2958778,0.002158125,0.0002539462,0.0011652786,0.00020257903,0.014964115,0.011047311,0.6707721,0.001269555,0.0006800817],"about_ca_topic_score_codex":0.000028210467,"about_ca_topic_score_gemma":0.000010071308,"teacher_disagreement_score":0.6542053,"about_ca_system_score_codex":0.0000425473,"about_ca_system_score_gemma":0.0003056786,"threshold_uncertainty_score":0.9092965},"labels":[],"label_agreement":null},{"id":"W2982415261","doi":"10.1145/3661483","title":"Local Proofs Approaching the Witness Length","year":2024,"lang":"en","type":"preprint","venue":"Journal of the ACM","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":5,"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":"Environment and Climate Change Canada; University of Haifa; Israel Science Foundation; European Commission","keywords":"Witness; Mathematical proof; Computer science; Mathematics; Programming language; Geometry","score_opus":0.019833053702891814,"score_gpt":0.26639898387271,"score_spread":0.24656593016981818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982415261","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.004683658,0.0018509721,0.9618555,0.024996607,0.004667995,0.00029611617,0.0000011771787,0.00014164626,0.0015063629],"genre_scores_gemma":[0.97516036,0.000057967372,0.02280098,0.00063990464,0.0007463074,0.000011928641,7.4609346e-8,0.000019650292,0.0005628458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849033,0.00022016332,0.00040770162,0.00020197562,0.00051485887,0.0001649526],"domain_scores_gemma":[0.9969537,0.00010144237,0.0005069198,0.002245539,0.00015436985,0.000037995727],"candidate_categories":["open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015802397,0.00017091841,0.00023029294,0.00012548658,0.0001729881,0.00052478956,0.008892656,0.00012923022,0.0000026685836],"category_scores_gemma":[0.0003703434,0.00007662512,0.00039894244,0.00024228558,0.000098513716,0.00016804117,0.010873235,0.0025235007,0.000008584477],"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.000039863997,0.00013948495,0.000027812332,0.0004889701,0.0005066014,0.00019149247,0.006128475,0.0033439645,0.0007112564,0.008251544,0.055297196,0.92487335],"study_design_scores_gemma":[0.00010673148,0.00009193891,0.00017735756,0.0006902234,0.00009849601,0.001224785,0.000121950645,0.012262457,0.101307265,0.8754243,0.008257407,0.00023704841],"about_ca_topic_score_codex":0.000019181845,"about_ca_topic_score_gemma":0.0000029149728,"teacher_disagreement_score":0.9704767,"about_ca_system_score_codex":0.00013019041,"about_ca_system_score_gemma":0.000299279,"threshold_uncertainty_score":0.99977773},"labels":[],"label_agreement":null},{"id":"W3008901784","doi":"10.1145/3626514","title":"A New Minimax Theorem for Randomized Algorithms","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Minimax; Mathematics; Randomized algorithm; Discrete mathematics; Algorithm; Bounded function; Computer science; Mathematical optimization","score_opus":0.034693137456230955,"score_gpt":0.2916385897286021,"score_spread":0.2569454522723712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008901784","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.0039397976,0.000364327,0.9420024,0.04828059,0.004471095,0.0004334807,0.0000033994197,0.000077489494,0.00042738643],"genre_scores_gemma":[0.014455123,0.00012679808,0.97953296,0.0010513085,0.0014248211,0.000011943964,3.884073e-7,0.000018503868,0.003378139],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988493,0.00013162923,0.00037408757,0.000111105386,0.00033293816,0.00020097494],"domain_scores_gemma":[0.9971985,0.0013137546,0.00033476102,0.0009438921,0.0001240576,0.00008498694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019554778,0.000092510614,0.00033096896,0.00013617192,0.0001423397,0.00012402917,0.00468275,0.000034065404,0.000012321706],"category_scores_gemma":[0.002166603,0.000051090123,0.00061831466,0.0005763993,0.00006413827,0.0002221558,0.0009270383,0.00016231142,0.000013050658],"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.00405268,0.00008742767,0.000039292867,0.000028764385,0.00041894542,0.000039427723,0.003079365,0.00032716148,0.0005891382,0.23117566,0.36918533,0.3909768],"study_design_scores_gemma":[0.026879886,0.00006589701,0.00016429542,0.00004711061,0.000031146235,0.00010760424,0.0000345293,0.028321384,0.0009203627,0.9292282,0.014110679,0.00008891014],"about_ca_topic_score_codex":0.000004660043,"about_ca_topic_score_gemma":9.419235e-7,"teacher_disagreement_score":0.6980525,"about_ca_system_score_codex":0.000017458793,"about_ca_system_score_gemma":0.00013256016,"threshold_uncertainty_score":0.87017924},"labels":[],"label_agreement":null},{"id":"W3091802565","doi":"10.1145/3417994","title":"Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of British Columbia; University of Waterloo; McMaster University; Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mixture model; Upper and lower bounds; Compression (physics); Gaussian; Sample complexity; Matching (statistics); Mathematics; Scheme (mathematics); Data compression; Algorithm; Class (philosophy); Computer science; Distribution (mathematics); Artificial intelligence; Statistics; Mathematical analysis; Physics","score_opus":0.04636202812958371,"score_gpt":0.28564379071210755,"score_spread":0.23928176258252384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091802565","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.07360693,0.00015817283,0.91456413,0.011240153,0.00029114826,0.00006783254,0.0000027452775,0.000023619341,0.000045296016],"genre_scores_gemma":[0.46280637,0.0000026477444,0.5367565,0.00022104458,0.00018151377,4.440623e-7,5.580909e-7,0.000006517113,0.00002435902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988822,0.00014759293,0.00034169352,0.00012973521,0.00033060415,0.00016817288],"domain_scores_gemma":[0.9984907,0.00024985615,0.00060284446,0.00042089095,0.0001316914,0.00010403532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039820807,0.000105018065,0.00025661528,0.000031740812,0.00028760242,0.00010401585,0.0024351408,0.00004094409,0.000022421802],"category_scores_gemma":[0.0014647337,0.0000652084,0.00021867955,0.00018764702,0.00009093715,0.00018961425,0.0007811951,0.00047944768,0.0000011162773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011889575,0.00081567175,0.09101736,0.000747303,0.0007767118,0.000051798717,0.027628005,0.54785323,0.049291007,0.009384706,0.042389974,0.22885525],"study_design_scores_gemma":[0.00067060126,0.00050409115,0.0077418177,0.00009389814,0.000023494138,0.000045948378,0.000060917126,0.96770716,0.0050592143,0.0030398162,0.01493329,0.00011977351],"about_ca_topic_score_codex":0.00003023809,"about_ca_topic_score_gemma":6.2101157e-7,"teacher_disagreement_score":0.4198539,"about_ca_system_score_codex":0.000013802626,"about_ca_system_score_gemma":0.000066052475,"threshold_uncertainty_score":0.45251378},"labels":[],"label_agreement":null},{"id":"W3098440765","doi":"10.1145/3690821","title":"Efficient polynomial-time approximation scheme for the genus of dense graphs","year":2024,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","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":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genus; Scheme (mathematics); Mathematics; Polynomial-time approximation scheme; Polynomial; Time complexity; Computer science; Combinatorics; Biology; Zoology; Mathematical analysis","score_opus":0.023569144577436082,"score_gpt":0.29851744322742635,"score_spread":0.27494829864999026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098440765","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.5589879,0.0053432896,0.41810694,0.015283549,0.0015448956,0.00057645945,0.000007123864,0.00003277585,0.00011708053],"genre_scores_gemma":[0.92125916,0.00003379813,0.07809833,0.00009616578,0.00016084148,0.000008138197,8.236246e-8,0.000013836154,0.00032963435],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989293,0.000094687544,0.0002962744,0.00010395719,0.00041185375,0.00016392622],"domain_scores_gemma":[0.9976965,0.00089574873,0.00020626851,0.00097154255,0.00018994685,0.000039993534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016498961,0.000070883034,0.00012741088,0.00015121169,0.00012193607,0.00008865543,0.0031647186,0.000027559603,0.000005560695],"category_scores_gemma":[0.001051458,0.000034711116,0.00027741166,0.0005324807,0.00009954483,0.00012787904,0.0005847013,0.00020950669,0.000007445074],"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.00072936283,0.00040599518,0.00024496025,0.00042429354,0.00097118807,0.00004603759,0.006168453,0.050420824,0.44849542,0.1949753,0.046049926,0.25106823],"study_design_scores_gemma":[0.00073988806,0.00033283414,0.0008748113,0.00031755533,0.000068827234,0.00037047302,0.000106423184,0.68225425,0.06357845,0.24362849,0.007552125,0.00017590672],"about_ca_topic_score_codex":9.734966e-7,"about_ca_topic_score_gemma":2.0557286e-7,"teacher_disagreement_score":0.6318334,"about_ca_system_score_codex":0.000038048598,"about_ca_system_score_gemma":0.0001067859,"threshold_uncertainty_score":0.58808875},"labels":[],"label_agreement":null},{"id":"W3174155805","doi":"10.1145/3464794","title":"The Reachability Problem for Two-Dimensional Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Technische Universität München; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Reachability; Unary operation; Bounded function; Mathematics; Reachability problem; Sequence (biology); Discrete mathematics; Path (computing); Combinatorics; Binary number; Computer science; Arithmetic","score_opus":0.024238930255484625,"score_gpt":0.28678470539047834,"score_spread":0.2625457751349937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174155805","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.23625268,0.001548801,0.7102529,0.04441089,0.005907762,0.0012188571,0.000037949758,0.0000628133,0.00030734873],"genre_scores_gemma":[0.13211839,0.000007888131,0.8671897,0.00014055941,0.00025869522,0.00002406404,0.0000014040197,0.000008014844,0.0002512869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885535,0.00029665264,0.00028735265,0.0001010344,0.00034071482,0.00011890968],"domain_scores_gemma":[0.9972925,0.0006329605,0.00044371642,0.0009772425,0.00061811396,0.000035423964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018725013,0.0000600523,0.000102546706,0.000015566136,0.00023451711,0.00014181544,0.0013649373,0.000019858222,0.0000016214276],"category_scores_gemma":[0.0013168423,0.00002711166,0.00007517273,0.00017053458,0.000050040322,0.00031311912,0.0002477887,0.00014661699,0.0000012240076],"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.0017075205,0.0011085948,0.0023828126,0.00065077294,0.0010001914,0.000051730047,0.0055461978,0.18056798,0.07318074,0.45298538,0.13884385,0.14197423],"study_design_scores_gemma":[0.0037482374,0.0020398418,0.027072318,0.001168007,0.00017760413,0.003711649,0.00076740474,0.382921,0.11611104,0.37635148,0.0852822,0.00064922887],"about_ca_topic_score_codex":0.000004843662,"about_ca_topic_score_gemma":0.0000043529794,"teacher_disagreement_score":0.20235303,"about_ca_system_score_codex":0.00008336805,"about_ca_system_score_gemma":0.00018400086,"threshold_uncertainty_score":0.25364158},"labels":[],"label_agreement":null},{"id":"W3204812806","doi":"10.1145/3477542","title":"Adjacency Labelling for Planar Graphs (and Beyond)","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Adjacency list; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Pathwidth; Bounded function; Chordal graph; Graph; Line graph","score_opus":0.02032145312571858,"score_gpt":0.2416427083824907,"score_spread":0.2213212552567721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204812806","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.8731633,0.015172836,0.030899435,0.07596566,0.00403836,0.00016349347,0.000004684497,0.00004705456,0.00054521515],"genre_scores_gemma":[0.53613585,0.00058864534,0.45905724,0.0035948616,0.000043251937,0.0000017412649,3.2902312e-7,0.000012606765,0.0005654777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935424,0.000039070186,0.0002172661,0.00009720707,0.00017448088,0.00011771438],"domain_scores_gemma":[0.99880946,0.00015968939,0.00018296529,0.00058074883,0.00020788715,0.000059273927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044285101,0.00005614756,0.00011424429,0.000050214738,0.00013552193,0.00007327971,0.0010447602,0.000028587778,0.0000018671765],"category_scores_gemma":[0.00047979178,0.000034563436,0.00011306903,0.00020674772,0.000021627407,0.00014353225,0.000252805,0.00012480188,0.000001046018],"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.000041814394,0.00022184802,0.004984572,0.00008767762,0.00023447993,0.00009197432,0.0022705237,0.0006005298,0.10395192,0.78657216,0.07722705,0.023715446],"study_design_scores_gemma":[0.00045513993,0.00006762652,0.00037705537,0.00006148644,0.000021209351,0.00027403524,0.00003863789,0.0007378879,0.014752107,0.9798019,0.0033493869,0.00006351408],"about_ca_topic_score_codex":0.0000011273021,"about_ca_topic_score_gemma":0.0000013068735,"teacher_disagreement_score":0.4281578,"about_ca_system_score_codex":0.0000053893273,"about_ca_system_score_gemma":0.0000647468,"threshold_uncertainty_score":0.19414417},"labels":[],"label_agreement":null},{"id":"W3205617095","doi":"10.1145/3638349","title":"Faster Modular Composition","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","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":"Composition (language); Modular design; Computer science; Programming language; Art; Literature","score_opus":0.023844893689522986,"score_gpt":0.2608103621926193,"score_spread":0.23696546850309635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205617095","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.7626821,0.000048580096,0.21549007,0.020128932,0.0014582827,0.000035437493,4.0240073e-7,0.000019915682,0.00013628935],"genre_scores_gemma":[0.98362476,0.000006256735,0.015405038,0.00044241495,0.00022974463,3.264031e-7,4.2431654e-7,0.0000018288349,0.00028919487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947846,0.000046220368,0.00013555257,0.000045576864,0.00023448285,0.000059732803],"domain_scores_gemma":[0.99936527,0.000052874115,0.00011555755,0.00034484483,0.00009767058,0.000023767407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029653538,0.0000311583,0.000049759605,0.00008754057,0.00007190075,0.00005698634,0.0011059776,0.000013388613,0.000003839922],"category_scores_gemma":[0.000097274664,0.000019792384,0.00006833869,0.0004279692,0.0000067629835,0.00025120634,0.00034813967,0.00006962813,0.000039333845],"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.00003350118,0.00013949456,0.0015579343,0.000023543578,0.00012119009,0.00007122051,0.0017732938,0.5094684,0.23107983,0.03622077,0.12689099,0.09261982],"study_design_scores_gemma":[0.0011002391,0.00024352231,0.18949926,0.00010874755,0.000030969582,0.00073892757,0.00004576349,0.33316538,0.05717807,0.38536802,0.032272097,0.00024901956],"about_ca_topic_score_codex":2.7644612e-7,"about_ca_topic_score_gemma":1.2066101e-7,"teacher_disagreement_score":0.34914726,"about_ca_system_score_codex":0.000015691721,"about_ca_system_score_gemma":0.000027633869,"threshold_uncertainty_score":0.20552},"labels":[],"label_agreement":null},{"id":"W4226427252","doi":"10.1145/3526074","title":"Private and Online Learnability Are Equivalent","year":2022,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Tel Aviv University; Azrieli Foundation; Israel Science Foundation; National Science Foundation","keywords":"Learnability; Equivalence (formal languages); Discrete mathematics; Binary number; Class (philosophy); Mathematics; VC dimension; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence; Arithmetic","score_opus":0.019819827565847433,"score_gpt":0.27069484088327556,"score_spread":0.2508750133174281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226427252","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.96901655,0.00023523842,0.0031645761,0.026863165,0.0006347521,0.000032748874,0.0000016682401,0.0000116919755,0.000039598635],"genre_scores_gemma":[0.96724164,0.000012000092,0.031799488,0.0005157079,0.00012280526,4.7307927e-7,6.0177165e-8,0.000003601771,0.00030421466],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99915254,0.00020227097,0.00016691083,0.00008126019,0.00030779274,0.000089243396],"domain_scores_gemma":[0.9989254,0.000057043617,0.00030129356,0.0006400247,0.00003400936,0.00004225979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071407744,0.000046564364,0.00009658682,0.000032121734,0.00018891958,0.000032754306,0.0022228896,0.000007960963,0.000025268173],"category_scores_gemma":[0.0005696246,0.000028315391,0.00007099168,0.0001348081,0.000021597612,0.000089206216,0.0028919156,0.00046054932,5.494567e-7],"study_design_candidate":"observational","study_design_consensus":"observational","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.0001370709,0.0015097156,0.6324989,0.00010184326,0.00021888695,0.00034102885,0.009343373,0.020003896,0.0022491447,0.0043882965,0.01624092,0.3129669],"study_design_scores_gemma":[0.00080386206,0.0005791727,0.86145186,0.000041943214,0.000022776452,0.0011948991,0.00036389026,0.034146626,0.0002724291,0.05345588,0.047486223,0.00018041242],"about_ca_topic_score_codex":0.0000059033882,"about_ca_topic_score_gemma":5.253149e-7,"teacher_disagreement_score":0.3127865,"about_ca_system_score_codex":0.000035140954,"about_ca_system_score_gemma":0.000028950668,"threshold_uncertainty_score":0.41307187},"labels":[],"label_agreement":null},{"id":"W4233027224","doi":"10.1145/3231592","title":"Erratum","year":2018,"lang":"en","type":"erratum","venue":"Journal of the ACM","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"Correctness; Linearizability; Computer science; Simple (philosophy); Object (grammar); Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence; Philosophy","score_opus":0.06442944623475393,"score_gpt":0.3516095221746244,"score_spread":0.28718007593987044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233027224","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013905145,0.0050057913,0.0020085443,0.016203864,0.32897896,0.0007883033,0.00004981597,0.00012905448,0.64544517],"genre_scores_gemma":[0.000066339926,0.00020633721,0.03196652,0.00017283024,0.008078322,0.0000022420902,7.9064205e-7,0.000097355696,0.95940924],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766713,0.00010860484,0.00091457687,0.00012619405,0.00091045187,0.00027301622],"domain_scores_gemma":[0.9943351,0.00055071304,0.0020879302,0.002414591,0.00051896414,0.000092680464],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0007071531,0.0002770321,0.00075072027,0.00012484039,0.000120336466,0.00008607094,0.004571624,0.00035498143,0.00035952832],"category_scores_gemma":[0.026280764,0.00015423591,0.0006225061,0.0001552916,0.0002257002,0.00018887056,0.001463814,0.0016571803,0.00009401211],"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.000008587997,0.00005345382,0.0000016256652,0.00030458305,0.00014052549,0.000017794138,0.00019213806,1.879661e-7,0.000020934911,0.0051816897,0.99405444,0.000024064262],"study_design_scores_gemma":[0.00010848346,0.000050459752,0.000008355857,0.0010108651,0.00021387124,0.0002083419,0.00006866355,0.0000023911687,0.00008107856,0.69117105,0.30696002,0.00011643025],"about_ca_topic_score_codex":8.3873863e-7,"about_ca_topic_score_gemma":0.0000085388365,"teacher_disagreement_score":0.6870944,"about_ca_system_score_codex":0.00015495597,"about_ca_system_score_gemma":0.00027797656,"threshold_uncertainty_score":0.98192126},"labels":[],"label_agreement":null},{"id":"W4280555761","doi":"10.1145/3486680","title":"Random \\( \\Theta (\\log n) \\) -CNFs are Hard for Cutting Planes","year":2022,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University; McGill University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisfiability; Combinatorics; Exponential function; Benchmark (surveying); Mathematics; Binary logarithm; Discrete mathematics; Mathematical analysis","score_opus":0.02479693373973376,"score_gpt":0.24360324796330304,"score_spread":0.21880631422356928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280555761","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.09541703,0.00039451892,0.7831964,0.11181299,0.0077648647,0.0005186841,0.000021870246,0.00007007436,0.00080355915],"genre_scores_gemma":[0.90893406,0.000020957594,0.08790362,0.0016721813,0.00031844043,0.000008977612,7.3693496e-7,0.000009539388,0.0011314743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993411,0.00008466149,0.00020594207,0.00006666432,0.00021589598,0.00008576347],"domain_scores_gemma":[0.9989153,0.00019665726,0.00041427647,0.00037461924,0.00007098698,0.000028124634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541955,0.000046393237,0.000104835075,0.0000567043,0.00030475104,0.000065904336,0.001344097,0.000011798094,0.000056675723],"category_scores_gemma":[0.0005446789,0.000031368465,0.00013118605,0.00012088811,0.000012106107,0.00017086946,0.00041487435,0.00014852005,0.0000013144866],"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.0009011222,0.0002889648,0.06762769,0.00007847887,0.0004538304,0.000077297314,0.0068107997,0.43714184,0.0046752836,0.011906198,0.23954473,0.23049377],"study_design_scores_gemma":[0.019902328,0.00081821857,0.10769353,0.00022505883,0.00022747811,0.006203121,0.0030325572,0.36744723,0.004345319,0.10131148,0.38788572,0.00090797053],"about_ca_topic_score_codex":0.0000013150736,"about_ca_topic_score_gemma":0.0000015879052,"teacher_disagreement_score":0.81351703,"about_ca_system_score_codex":0.000039166505,"about_ca_system_score_gemma":0.000056553174,"threshold_uncertainty_score":0.24976888},"labels":[],"label_agreement":null},{"id":"W4383554657","doi":"10.1145/3607471","title":"Co-lexicographically Ordering Automata and Regular Languages - Part I","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","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":"Dalhousie University","funders":"European Commission","keywords":"Lexicographical order; Regular language; Mathematics; Automaton; Discrete mathematics; Constant (computer programming); Nondeterministic finite automaton; ω-automaton; Combinatorics; Prefix; Deterministic automaton; Regular expression; Order (exchange); State (computer science); Nested word; Closure (psychology); Finite-state machine; Quantum finite automata; Automata theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.015142524035447458,"score_gpt":0.27059090535303626,"score_spread":0.2554483813175888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383554657","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.9768587,0.00045698695,0.0013408889,0.020240672,0.0006172688,0.00004590226,0.0000015697508,0.00013242268,0.0003055863],"genre_scores_gemma":[0.986607,0.00035949948,0.011075303,0.0011165064,0.00039666655,0.0000013740645,3.8610517e-7,0.000014736574,0.00042850646],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992619,0.00006722197,0.00018714926,0.00009137485,0.00024908799,0.00014325419],"domain_scores_gemma":[0.9987378,0.00014300113,0.00015956818,0.00087046705,0.000033200384,0.00005596504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007870161,0.000065265995,0.00011796538,0.00009718695,0.00010111748,0.00011366855,0.0021832143,0.000030481546,0.0000062560857],"category_scores_gemma":[0.00044811884,0.00003887921,0.000080418795,0.00038332827,0.000051166462,0.00024226688,0.00067329,0.00014033302,0.000009385803],"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.00006900587,0.00024442002,0.025264805,0.00019106257,0.00055973855,0.0012450883,0.005887133,0.0004940793,0.12720767,0.094694644,0.4800383,0.26410407],"study_design_scores_gemma":[0.00264077,0.0005438337,0.33024958,0.0010086838,0.00009608623,0.0035033845,0.0012895843,0.02223606,0.033582136,0.4320403,0.17197695,0.00083261717],"about_ca_topic_score_codex":0.0000017158447,"about_ca_topic_score_gemma":6.5331375e-7,"teacher_disagreement_score":0.33734566,"about_ca_system_score_codex":0.000006563412,"about_ca_system_score_gemma":0.000023715244,"threshold_uncertainty_score":0.40569916},"labels":[],"label_agreement":null},{"id":"W4386958456","doi":"10.1145/3625226","title":"Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Polynomial and algebraic computation","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":"National Science Foundation","keywords":"Polynomial; Univariate; Mathematics; Finite field; Algebraic number; Variable (mathematics); Factorization; Degree (music); Gröbner basis; Field (mathematics); Discrete mathematics; Factorization of polynomials; Symbolic computation; Time complexity; Combinatorics; Multivariate statistics; Algorithm; Pure mathematics; Matrix polynomial; Statistics","score_opus":0.03426032844672085,"score_gpt":0.27967895762957273,"score_spread":0.2454186291828519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386958456","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.9401506,0.00006853742,0.051823672,0.007220339,0.00040389743,0.0002805107,0.0000010967046,0.000022379243,0.000028975921],"genre_scores_gemma":[0.994682,0.000012071979,0.004962781,0.0001336455,0.00015047524,0.00001454667,6.328056e-7,0.000003686704,0.000040155443],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99924093,0.00011013015,0.00027067453,0.00010355684,0.00016879723,0.00010589725],"domain_scores_gemma":[0.9990596,0.00018548996,0.00024345034,0.00038323583,0.00008744621,0.000040779716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009015847,0.000058694804,0.000099988654,0.00013998128,0.00006589868,0.00006460393,0.00094801997,0.000022168286,0.0000020823202],"category_scores_gemma":[0.0005295429,0.000039860843,0.000044216205,0.00042425963,0.000017268674,0.00018481535,0.0005112759,0.00012592052,0.0000142401905],"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.000020520829,0.000101747515,0.0032954172,0.000024577,0.0000332954,0.000009211119,0.0025286237,0.0043946537,0.018370042,0.004570151,0.00041689334,0.96623486],"study_design_scores_gemma":[0.00070793746,0.000031660005,0.6488708,0.000052942516,0.000012860858,0.000045319084,0.00002867045,0.2504481,0.0004486758,0.09883337,0.00044354965,0.00007605987],"about_ca_topic_score_codex":0.000014775521,"about_ca_topic_score_gemma":0.000011501229,"teacher_disagreement_score":0.9661588,"about_ca_system_score_codex":0.00004391368,"about_ca_system_score_gemma":0.000072924035,"threshold_uncertainty_score":0.17616728},"labels":[],"label_agreement":null},{"id":"W4388210282","doi":"10.1145/3631390","title":"The Space Complexity of Consensus from Swap","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swap (finance); Computer science; Consensus algorithm; Algorithm; Business","score_opus":0.05574133848827686,"score_gpt":0.28104195653586306,"score_spread":0.2253006180475862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388210282","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.8896994,0.00078139844,0.0066910577,0.09688614,0.0048608324,0.00012182018,0.00005072241,0.00003367969,0.00087496475],"genre_scores_gemma":[0.9965717,0.000023426643,0.002860043,0.00008902613,0.00014534479,3.5761076e-7,2.0083445e-7,0.000003020657,0.0003068507],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9990085,0.00011960335,0.0003241227,0.00006844982,0.000349067,0.00013028669],"domain_scores_gemma":[0.99774975,0.00041540537,0.0004933455,0.0011375719,0.00016279316,0.000041160107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068417174,0.000057192865,0.000159833,0.000020733572,0.00014517631,0.000072186966,0.0034279553,0.0000241651,0.0000026219273],"category_scores_gemma":[0.000669977,0.000027524871,0.00013664282,0.00033902618,0.00012742686,0.000059499114,0.0006576889,0.00015589519,0.000019420628],"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.0000786095,0.000090138106,0.008501743,0.000024773744,0.0002868604,0.00009225604,0.0019510569,0.00142664,0.011303534,0.06545427,0.89944065,0.01134949],"study_design_scores_gemma":[0.0014906413,0.00015581338,0.40632161,0.00038455092,0.000038431634,0.00023006911,0.0007516188,0.027754253,0.007217023,0.35183313,0.20356956,0.00025325874],"about_ca_topic_score_codex":0.00006634912,"about_ca_topic_score_gemma":0.000018391205,"teacher_disagreement_score":0.69587106,"about_ca_system_score_codex":0.000017958422,"about_ca_system_score_gemma":0.00006797592,"threshold_uncertainty_score":0.6370051},"labels":[],"label_agreement":null},{"id":"W4389224840","doi":"10.1145/3633512","title":"Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Join (topology); Tuple; Class (philosophy); Upper and lower bounds; Combinatorics; Mathematics; Algorithm; Argument (complex analysis); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.04162814898446222,"score_gpt":0.3084241444342037,"score_spread":0.2667959954497415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389224840","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.8307535,0.00037770293,0.13844946,0.027830396,0.001987528,0.00015952066,0.0000032755263,0.00010040439,0.00033821253],"genre_scores_gemma":[0.55900633,0.0005526377,0.43733877,0.0012853397,0.00092990644,0.0000053887657,7.6071103e-7,0.000018406037,0.0008624298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899054,0.000086977045,0.00028101547,0.0001256982,0.00034054063,0.00017524004],"domain_scores_gemma":[0.99873465,0.00014933324,0.0002415037,0.0007294459,0.000072307674,0.00007272897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060766237,0.00008860016,0.00015531959,0.00012099464,0.00021334733,0.00015627599,0.0021952726,0.000039406,0.0000047854705],"category_scores_gemma":[0.00034724188,0.000058008554,0.00013190831,0.0005316533,0.00006350977,0.0004969601,0.0012488441,0.00021301403,0.00001628436],"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.000210797,0.0009176495,0.020816835,0.00014494253,0.00090557843,0.00056531955,0.015732132,0.04246071,0.015928015,0.09320372,0.39218894,0.41692537],"study_design_scores_gemma":[0.001470051,0.00036002882,0.22987548,0.00012519788,0.000043843607,0.0010490535,0.00017027088,0.3592163,0.0021024742,0.38589856,0.019305555,0.00038317646],"about_ca_topic_score_codex":0.000006035976,"about_ca_topic_score_gemma":0.0000034119162,"teacher_disagreement_score":0.4165422,"about_ca_system_score_codex":0.000019670886,"about_ca_system_score_gemma":0.00004006743,"threshold_uncertainty_score":0.4079399},"labels":[],"label_agreement":null},{"id":"W4393042598","doi":"10.1145/3652025","title":"Fast Multivariate Multipoint Evaluation over All Finite Fields","year":2024,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"University of Waterloo","funders":"Indian Institute of Technology Bombay; Department of Atomic Energy, Government of India","keywords":"Multivariate statistics; Computer science; Multivariate analysis; Algorithm; Machine learning","score_opus":0.024564626030071327,"score_gpt":0.31751539507081744,"score_spread":0.29295076904074613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393042598","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.29566345,0.00485226,0.6834801,0.009233495,0.0034407338,0.0005062698,0.0000118141,0.0005473838,0.0022644897],"genre_scores_gemma":[0.9813684,0.000081337574,0.018140862,0.00012248856,0.00018792537,0.0000033098027,4.257276e-7,0.000015824022,0.0000793959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992803,0.000039319588,0.0002585596,0.000056719495,0.00027236197,0.00009276316],"domain_scores_gemma":[0.99932885,0.00016485811,0.000060635608,0.00035537573,0.000057617606,0.00003263911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034703256,0.00007837384,0.00012328313,0.00007395337,0.000018164958,0.000032908174,0.0004566416,0.00004625845,0.00010797363],"category_scores_gemma":[0.0007513356,0.000046732897,0.00017898479,0.0001664112,0.000011095854,0.00014845864,0.00011085632,0.0003140792,0.000013093878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021629165,0.00003757929,0.00018300417,0.00006381953,0.00053126673,0.000025175468,0.0008174646,0.79483765,0.043497417,0.000086982305,0.0210042,0.13889378],"study_design_scores_gemma":[0.00019127228,0.000035943587,0.0018441832,0.00016543937,0.00018532648,0.000021187243,0.00001676364,0.9439413,0.012840522,0.020997696,0.019648535,0.0001118312],"about_ca_topic_score_codex":0.000005413897,"about_ca_topic_score_gemma":0.000003193975,"teacher_disagreement_score":0.685705,"about_ca_system_score_codex":0.000100563535,"about_ca_system_score_gemma":0.000011787291,"threshold_uncertainty_score":0.19057122},"labels":[],"label_agreement":null},{"id":"W4396773622","doi":"10.1145/3663758","title":"Separations in Proof Complexity and TFNP","year":2024,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Burden of proof; Proof complexity; Proof of concept; Computer science; Mathematics; Mathematical proof; Political science; Geometry; Law","score_opus":0.06437713282790664,"score_gpt":0.3118255689888662,"score_spread":0.24744843616095957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396773622","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.46276394,0.016753344,0.3874902,0.10726759,0.01067335,0.00088825996,0.000001870772,0.00013700862,0.014024425],"genre_scores_gemma":[0.9962231,0.000007243205,0.0033268605,0.000067844776,0.00010154191,7.812925e-7,2.72364e-8,0.0000015875844,0.00027103824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995474,0.00005177,0.00015389503,0.000058146416,0.00012065153,0.00006810356],"domain_scores_gemma":[0.999535,0.00004662921,0.00006171619,0.00030205806,0.000029740102,0.00002481422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041684753,0.000034857723,0.00007352953,0.000047279093,0.00004119856,0.00016453394,0.00082216295,0.00001716872,0.0000025199824],"category_scores_gemma":[0.00011055701,0.000018722583,0.000040794817,0.00018015433,0.000028065479,0.00021171823,0.0002814484,0.00012741842,0.0000049503897],"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.0000076057718,0.000104512175,0.011665835,0.00009973975,0.000066061286,0.00011678533,0.0065691425,0.000124287,0.00078882294,0.9158774,0.025290491,0.039289307],"study_design_scores_gemma":[0.00021216163,0.000115723495,0.020413807,0.000043209915,0.000009880455,0.0006498475,0.000057408124,0.010204367,0.0005151451,0.8968295,0.070865974,0.00008299129],"about_ca_topic_score_codex":0.000012190187,"about_ca_topic_score_gemma":0.000036602254,"teacher_disagreement_score":0.5334591,"about_ca_system_score_codex":0.000020448353,"about_ca_system_score_gemma":0.00005213535,"threshold_uncertainty_score":0.15866046},"labels":[],"label_agreement":null},{"id":"W4401396978","doi":"10.1145/3686794","title":"Fast Algorithms for <i> ℓ <sub>p</sub> </i> -Regression","year":2024,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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; University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Georgia Institute of Technology","keywords":"Star (game theory); Combinatorics; Algorithm; Inverse; Omega; Physics; Mathematics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.021637927470085843,"score_gpt":0.26180285410958687,"score_spread":0.24016492663950104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401396978","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.8840863,0.011328148,0.088972375,0.0047006104,0.008915097,0.00031820478,0.000017332504,0.00063306483,0.0010288513],"genre_scores_gemma":[0.9895595,0.00029095786,0.009170672,0.000105777006,0.00078982254,0.0000021665844,3.2244048e-7,0.000034580797,0.000046219495],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952954,0.000011664071,0.00017155675,0.00004943877,0.00013019123,0.00010763054],"domain_scores_gemma":[0.9994587,0.00007888105,0.00004340873,0.00033484693,0.0000533794,0.00003081185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013135165,0.00008246,0.000115788906,0.000057891106,0.000038213075,0.000053754477,0.0005079861,0.00004543857,0.0000018157202],"category_scores_gemma":[0.00008983337,0.000046677815,0.00017614552,0.00009091745,0.000014241021,0.00009545508,0.000100172445,0.00020015532,0.000004066484],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000009548761,0.000007806835,0.000009727683,0.000031763502,0.00007055767,0.000021567523,0.000098787794,0.0020143092,0.6195954,0.000053569896,0.27388108,0.10420586],"study_design_scores_gemma":[0.00009965278,0.0000401547,0.00007585778,0.0006719574,0.000044674653,0.0001787966,0.00001547306,0.019098647,0.9416198,0.010326883,0.027750228,0.00007788564],"about_ca_topic_score_codex":3.3687934e-7,"about_ca_topic_score_gemma":3.4716555e-7,"teacher_disagreement_score":0.32202438,"about_ca_system_score_codex":0.00003368629,"about_ca_system_score_gemma":0.00001538045,"threshold_uncertainty_score":0.1903466},"labels":[],"label_agreement":null},{"id":"W4409280356","doi":"10.1145/3728631","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Minimum-cost flow problem; Flow (mathematics); Maximum flow problem; Mathematics; Computer science; Mathematical optimization; Geometry","score_opus":0.015960487311521922,"score_gpt":0.2604227304612225,"score_spread":0.24446224314970058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409280356","genre_codex":"empirical","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.64097935,0.0041109296,0.16448894,0.17546774,0.008691997,0.00079211337,0.000023492805,0.00009285166,0.005352586],"genre_scores_gemma":[0.13391711,0.00024348931,0.8575792,0.004700272,0.00056513574,0.0000046449745,6.828243e-7,0.000017874549,0.0029715984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991648,0.00007888943,0.0002841079,0.000117488176,0.00020090469,0.00015376644],"domain_scores_gemma":[0.9988182,0.00018586435,0.00011956392,0.00076116744,0.00006888203,0.00004632705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305946,0.00008475202,0.00017569562,0.00015832702,0.00008973436,0.00008171546,0.0025189898,0.00004019053,0.000015282874],"category_scores_gemma":[0.0004320732,0.000056917448,0.00010080324,0.0004820671,0.00005612855,0.00023387786,0.0011895887,0.00028876046,0.00000906357],"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.00017027017,0.00061873766,0.008494408,0.00008813999,0.00024199778,0.0003052851,0.0030031963,0.005879948,0.0035082663,0.004275502,0.10410435,0.8693099],"study_design_scores_gemma":[0.0015548551,0.00012957813,0.022163922,0.00037166858,0.000025009196,0.0003248423,0.000045535053,0.64718735,0.0016811723,0.293845,0.03246053,0.000210559],"about_ca_topic_score_codex":0.000004471284,"about_ca_topic_score_gemma":0.000005975858,"teacher_disagreement_score":0.8690993,"about_ca_system_score_codex":0.00002898966,"about_ca_system_score_gemma":0.00008041239,"threshold_uncertainty_score":0.46809518},"labels":[],"label_agreement":null},{"id":"W4411309355","doi":"10.1145/3744639","title":"Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Stochastic Gradient Optimization Techniques","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 Toronto","funders":"","keywords":"Planar; Flow (mathematics); Computer science; Mathematics; Algorithm; Mathematical optimization; Combinatorics; Geometry; Computer graphics (images)","score_opus":0.011028140869351813,"score_gpt":0.2602603873843488,"score_spread":0.249232246514997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411309355","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.03142957,0.00012331578,0.94939876,0.016792692,0.0013535612,0.00027899054,0.0000016316278,0.00007070404,0.00055076205],"genre_scores_gemma":[0.26041952,0.00003302156,0.7364272,0.0012848766,0.00022630667,0.000012812507,0.0000015067895,0.000019830022,0.0015749282],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910814,0.00008014029,0.00034230232,0.000112111105,0.00022758562,0.00012971631],"domain_scores_gemma":[0.998745,0.00014509763,0.0002248584,0.00072189444,0.00012564984,0.000037502035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041213926,0.00008359359,0.0001511918,0.00025374905,0.0000669664,0.00006837371,0.0021023303,0.000052662752,0.000007833707],"category_scores_gemma":[0.0010214616,0.000057705063,0.000083052495,0.00071566354,0.000024367846,0.000302817,0.0002969453,0.0002009932,0.0000073331344],"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.0008400519,0.002141864,0.03976709,0.00019113702,0.00068310165,0.0004710309,0.011371726,0.2606066,0.061577123,0.037828475,0.4570701,0.12745169],"study_design_scores_gemma":[0.0017060045,0.00031724834,0.037445735,0.00083331874,0.000057014204,0.0004574128,0.000061886865,0.88432765,0.023204198,0.046727005,0.004517911,0.00034461103],"about_ca_topic_score_codex":0.0000074742575,"about_ca_topic_score_gemma":0.0000049194127,"teacher_disagreement_score":0.62372106,"about_ca_system_score_codex":0.00009917287,"about_ca_system_score_gemma":0.000086857326,"threshold_uncertainty_score":0.39066878},"labels":[],"label_agreement":null},{"id":"W4413456051","doi":"10.1145/3760771","title":"The Computational Advantage of MIP* Vanishes in the Presence of Noise","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","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":"Concordia University","funders":"Beijing Nova Program; Nanjing University; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Quantum entanglement; Class (philosophy); Nondeterministic algorithm; Noise (video); Quantum; Mathematics; Discrete mathematics; Gas meter prover; Computer science; Upper and lower bounds; State (computer science); Theoretical computer science; Algorithm; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.007256635957413665,"score_gpt":0.26129563607023243,"score_spread":0.25403900011281877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413456051","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.90546745,0.0012471708,0.055405095,0.03634703,0.0009200999,0.00016210206,0.0000026508776,0.0000061269557,0.00044227112],"genre_scores_gemma":[0.97755384,0.00002557347,0.022101957,0.00023458357,0.000042965956,4.1763164e-7,3.1295546e-8,0.0000017635176,0.000038874336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885696,0.00021196817,0.00037641288,0.00007147201,0.00037798184,0.00010522578],"domain_scores_gemma":[0.99724096,0.0016137204,0.00039589335,0.0006103008,0.000125915,0.00001321586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010350362,0.00006184285,0.0001336447,0.000055560857,0.00011579044,0.00004708267,0.0048131105,0.000018442217,6.6370114e-7],"category_scores_gemma":[0.00067219755,0.000025821051,0.00012141545,0.00040570032,0.000107789005,0.00008273834,0.0007461102,0.00025921848,2.447104e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819289,0.0005865761,0.019220272,0.00014961092,0.00022352676,0.00005844394,0.013520711,0.73691845,0.004931796,0.06105335,0.02132361,0.14186546],"study_design_scores_gemma":[0.0007755273,0.00020169349,0.20807931,0.000546623,0.000024417008,0.00021401662,0.00052541436,0.4392929,0.0028489095,0.34432772,0.0030525953,0.00011086867],"about_ca_topic_score_codex":0.0000074496716,"about_ca_topic_score_gemma":0.000002730906,"teacher_disagreement_score":0.29762554,"about_ca_system_score_codex":0.000010286683,"about_ca_system_score_gemma":0.000116142335,"threshold_uncertainty_score":0.89440364},"labels":[],"label_agreement":null}]}