{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16768448,0.0017855256,0.79183626,0.004055237,0.00010747691,0.00014316068,0.0010023005,0.0010792649,0.032306366],"genre_scores_gemma":[0.9303669,0.0011301265,0.060957722,0.001178211,0.00039838886,0.00019669563,0.00047927862,0.00024245694,0.0050501823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949479,0.00069462357,0.00020003764,0.0012095863,0.0017663803,0.0011813946],"domain_scores_gemma":[0.98408,0.010483067,0.0009719752,0.0023762293,0.0011491878,0.0009395973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029599722,0.0008417054,0.0013627198,0.0016760366,0.0017791231,0.003856182,0.0030145596,0.0014765693,0.0071170665],"category_scores_gemma":[0.01796636,0.00092794275,0.002485832,0.0017092174,0.003711142,0.013503395,0.0044964603,0.0051883543,0.00083111075],"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.00037090917,0.00012908013,0.0035030295,0.00030438168,0.00010103769,0.00029641,0.0006944785,0.035574976,0.011697986,0.90604687,0.0053064534,0.035974413],"study_design_scores_gemma":[0.00007050685,0.0000822865,0.0011062968,0.000037930036,0.00009890572,0.00043861385,0.00008158434,0.17724183,0.0068214983,0.8085996,0.0053656413,0.000055312015],"about_ca_topic_score_codex":0.003255289,"about_ca_topic_score_gemma":0.0028796499,"teacher_disagreement_score":0.0071170665,"about_ca_system_score_codex":0.004447208,"about_ca_system_score_gemma":0.0014827754,"threshold_uncertainty_score":0.032266915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1188696,0.0024227533,0.80717605,0.005609913,0.00035967302,0.00015677058,0.00023960922,0.00061231764,0.06455326],"genre_scores_gemma":[0.897713,0.0026498104,0.08968253,0.0007727709,0.0006253723,0.00053145865,0.00015589716,0.0003027216,0.007566395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99390584,0.0019886438,0.00034130222,0.0009598238,0.0018102853,0.0009940906],"domain_scores_gemma":[0.91635615,0.0707278,0.0031120854,0.0065525244,0.0021419625,0.0011095413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008175037,0.0014732785,0.0015408399,0.0015553894,0.0020294085,0.006230766,0.004407336,0.003450779,0.010082327],"category_scores_gemma":[0.050812613,0.0010698441,0.001138348,0.0015482708,0.009112164,0.020896316,0.0064444314,0.006596027,0.0014629039],"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.00019128027,0.0000899673,0.00016724957,0.00018481493,0.000024345103,0.00008123583,0.00026077405,0.033814397,0.0044380296,0.946009,0.0011258044,0.013613106],"study_design_scores_gemma":[0.000040165683,0.0001149125,0.000112740185,0.00006555808,0.000027577868,0.00016014934,0.00009291372,0.20895524,0.0060338806,0.7820369,0.0023135094,0.00004643447],"about_ca_topic_score_codex":0.00054258073,"about_ca_topic_score_gemma":0.00030172442,"teacher_disagreement_score":0.010082327,"about_ca_system_score_codex":0.0024824184,"about_ca_system_score_gemma":0.0013044786,"threshold_uncertainty_score":0.04323423},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025920669,0.0008149419,0.9394845,0.0016813958,0.0001585314,0.00013143092,0.00032462322,0.0009415688,0.030542348],"genre_scores_gemma":[0.43729764,0.0013000469,0.5461806,0.0017450186,0.0007502301,0.0003418438,0.0006140641,0.00025237506,0.011518159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958884,0.0011259172,0.00040805835,0.0008175395,0.0013036827,0.00045647577],"domain_scores_gemma":[0.9938075,0.0036623885,0.00067407225,0.0009211595,0.00057022274,0.00036463118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039052314,0.0010156177,0.0007517916,0.0018730351,0.0021095523,0.004282627,0.002292642,0.0012470025,0.004313672],"category_scores_gemma":[0.008460006,0.0008420833,0.00299367,0.0029226453,0.0045084674,0.013112376,0.0048596053,0.003951532,0.0007612943],"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.00003540987,0.00003409162,0.00033009046,0.00010473845,0.00003010762,0.00014578109,0.000379855,0.0049909884,0.001344933,0.973257,0.0012151044,0.018131811],"study_design_scores_gemma":[0.000026253409,0.000044331893,0.00014542094,0.000033780132,0.000071898365,0.00021417857,0.00011287988,0.024153672,0.0022160262,0.95274955,0.020207051,0.000025018277],"about_ca_topic_score_codex":0.002966114,"about_ca_topic_score_gemma":0.002415497,"teacher_disagreement_score":0.004313672,"about_ca_system_score_codex":0.002341091,"about_ca_system_score_gemma":0.0012542928,"threshold_uncertainty_score":0.020653129},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028208105,0.00046759035,0.96191293,0.0005607992,0.00009299698,0.00016167937,0.00017967794,0.001669955,0.0067462367],"genre_scores_gemma":[0.34962517,0.0004038781,0.6454604,0.0004008299,0.00012324884,0.0005189707,0.00054672465,0.00032933344,0.002591488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593383,0.0016109779,0.00020059347,0.00060856604,0.0010054881,0.0006405159],"domain_scores_gemma":[0.9933723,0.0043050665,0.0005126798,0.0011672352,0.00048541542,0.00015730303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028378586,0.0015074183,0.0021047986,0.0010952741,0.0009169897,0.0018268758,0.0025180492,0.0015030927,0.0038092684],"category_scores_gemma":[0.011709624,0.0008173664,0.0017664495,0.0018605528,0.0012033908,0.0026376245,0.0023161827,0.0032845594,0.0011190936],"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.0007310292,0.0003268339,0.001066172,0.00027807427,0.00013633342,0.00022447911,0.00019776348,0.81059724,0.0066366023,0.06754618,0.009339406,0.10291981],"study_design_scores_gemma":[0.000077943805,0.00005162478,0.00008015446,0.000015203008,0.000020639447,0.000048442264,0.000023240349,0.97234297,0.0010823237,0.02526216,0.000985727,0.00000955365],"about_ca_topic_score_codex":0.0028099527,"about_ca_topic_score_gemma":0.0028127802,"teacher_disagreement_score":0.0038092684,"about_ca_system_score_codex":0.0017985002,"about_ca_system_score_gemma":0.0023383496,"threshold_uncertainty_score":0.0150081515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004115123,0.0005296201,0.9867404,0.0007311742,0.0001291427,0.00018032853,0.00027675822,0.0012456448,0.0060517327],"genre_scores_gemma":[0.13369352,0.0015229608,0.8480343,0.0015733389,0.00039950578,0.0014919523,0.0012952526,0.0011989443,0.010790258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989934,0.00377768,0.0012071957,0.0012453268,0.0027120824,0.0011236323],"domain_scores_gemma":[0.9899691,0.0036902954,0.0009069736,0.0033590687,0.0017072917,0.00036728175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010314295,0.0018045075,0.0014621406,0.0015227927,0.0026436914,0.0059083826,0.0042754533,0.0035920406,0.004417403],"category_scores_gemma":[0.012945034,0.0016354191,0.0023416549,0.0021678982,0.007604876,0.01068202,0.0058043175,0.0063579436,0.0017728296],"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.000065405235,0.000034327215,0.00037799389,0.00013710487,0.000014293604,0.00030886778,0.00085200527,0.0071458146,0.0017774833,0.9761287,0.0023001917,0.0108578],"study_design_scores_gemma":[0.00011494154,0.00012706136,0.0001830914,0.00030690068,0.000064688975,0.0005697629,0.00041202153,0.047298398,0.010735905,0.8143895,0.12570345,0.0000941817],"about_ca_topic_score_codex":0.0039229207,"about_ca_topic_score_gemma":0.004331292,"teacher_disagreement_score":0.010314295,"about_ca_system_score_codex":0.001969549,"about_ca_system_score_gemma":0.00418581,"threshold_uncertainty_score":0.054547906},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026283678,0.001544959,0.9488677,0.0059935935,0.00020325648,0.0003540715,0.00079942174,0.00045253432,0.015500824],"genre_scores_gemma":[0.34577468,0.004590786,0.6335754,0.0017991335,0.0007950734,0.00090810185,0.0022117894,0.0005062023,0.009838897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9844358,0.007217756,0.0013927424,0.0021302993,0.0037524514,0.0010707997],"domain_scores_gemma":[0.8988146,0.08855272,0.0039684926,0.00428781,0.0035736808,0.00080266385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009825457,0.0016266234,0.0018243636,0.0021777807,0.0030714076,0.006614729,0.002854351,0.0030758407,0.006121113],"category_scores_gemma":[0.055076636,0.001943924,0.002345143,0.0056263,0.005850296,0.021089496,0.0051499032,0.0070961127,0.0010454875],"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.00016710575,0.00011081268,0.00071058056,0.00052115205,0.000058755322,0.00094392383,0.00061548274,0.16103682,0.0021593778,0.79088753,0.0038596564,0.03892882],"study_design_scores_gemma":[0.00009012471,0.00007219196,0.0002242516,0.00020317723,0.000053768777,0.0005661089,0.00029325945,0.24417333,0.004473339,0.73110414,0.018690027,0.00005634661],"about_ca_topic_score_codex":0.011298701,"about_ca_topic_score_gemma":0.00974946,"teacher_disagreement_score":0.011298701,"about_ca_system_score_codex":0.0048763086,"about_ca_system_score_gemma":0.0039324104,"threshold_uncertainty_score":0.051962554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16597918,0.003831578,0.6793945,0.042421736,0.002012386,0.000300667,0.00417055,0.0018185325,0.100070864],"genre_scores_gemma":[0.8017211,0.0031557044,0.16030444,0.008029058,0.0023103221,0.000741778,0.004742306,0.0011268768,0.017868534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953542,0.0014057204,0.00018005699,0.0014931242,0.00072060584,0.00084643584],"domain_scores_gemma":[0.9715774,0.020868683,0.0013820345,0.0035606057,0.0015975373,0.0010138568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036884067,0.001737255,0.0026282507,0.00075847557,0.0022748767,0.0033353055,0.0035946749,0.00512144,0.021328202],"category_scores_gemma":[0.035549644,0.0013016434,0.0022481873,0.0017262348,0.0035592725,0.017949408,0.0035055666,0.0066883448,0.0029167149],"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.0008356993,0.00024148583,0.0024595174,0.0013672967,0.0002292628,0.00046020528,0.00062984147,0.13783865,0.0024738754,0.7338157,0.07392701,0.045721415],"study_design_scores_gemma":[0.00012178421,0.00008318937,0.00029921468,0.000092028604,0.00003360991,0.00028804268,0.00016840026,0.10476111,0.0006333541,0.8830005,0.01049221,0.000026673519],"about_ca_topic_score_codex":0.0020586299,"about_ca_topic_score_gemma":0.0019943528,"teacher_disagreement_score":0.021328202,"about_ca_system_score_codex":0.0022951236,"about_ca_system_score_gemma":0.0015608646,"threshold_uncertainty_score":0.07134998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092229255,0.0026027134,0.8675771,0.0020189735,0.00017697504,0.0002472666,0.00066282117,0.00079096673,0.03369396],"genre_scores_gemma":[0.72117656,0.0040044617,0.2628692,0.00096900953,0.0006625405,0.0006690917,0.001256968,0.0004863846,0.007905684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661094,0.0006880189,0.00016715447,0.00086573215,0.000951443,0.00071673555],"domain_scores_gemma":[0.9806671,0.014063457,0.0012742819,0.0015721541,0.0015101662,0.00091276626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272271,0.0022230495,0.0016389264,0.0023999389,0.0020214894,0.004107007,0.002652502,0.0016066885,0.007916282],"category_scores_gemma":[0.024755916,0.0012076625,0.0021707965,0.0024048875,0.0039593354,0.012109236,0.005508597,0.006537986,0.0014562919],"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.00064458326,0.00045366978,0.0028400426,0.0012656812,0.00015793752,0.00046360737,0.001452223,0.24119017,0.013529845,0.65784883,0.010621505,0.06953188],"study_design_scores_gemma":[0.000071741015,0.00017013185,0.00086210034,0.00014775194,0.00009532234,0.00031047632,0.0003570277,0.41492102,0.0064490703,0.56841147,0.008147313,0.000056570792],"about_ca_topic_score_codex":0.0017439914,"about_ca_topic_score_gemma":0.0015533987,"teacher_disagreement_score":0.007916282,"about_ca_system_score_codex":0.0026088855,"about_ca_system_score_gemma":0.0018165506,"threshold_uncertainty_score":0.026482582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062707074,0.00022534029,0.921627,0.0006205223,0.000099211626,0.00024214637,0.00018765,0.0039844075,0.010306668],"genre_scores_gemma":[0.5850619,0.00022518347,0.4004987,0.00054266653,0.00009483475,0.00050460425,0.0005120398,0.0006164001,0.011943637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980544,0.0005246471,0.00011442311,0.00039201207,0.0005929112,0.00032165885],"domain_scores_gemma":[0.9957481,0.001387144,0.0003445467,0.0016694376,0.0006142578,0.00023648234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019651393,0.0005702214,0.0007308599,0.0009978171,0.0013165935,0.0019561397,0.002635094,0.0010609814,0.005010111],"category_scores_gemma":[0.008058168,0.0005052942,0.00067597907,0.0019106313,0.0015631976,0.003986348,0.0027186715,0.0015917715,0.0013204424],"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.0013203213,0.00035741372,0.0032332256,0.00024049023,0.00005506257,0.00012556522,0.00034970473,0.26887935,0.017459111,0.4443592,0.010978126,0.25264245],"study_design_scores_gemma":[0.00021650652,0.0002707581,0.00030596758,0.000021481252,0.000028358334,0.00019948253,0.00007506458,0.7837684,0.01889759,0.17991394,0.016259486,0.00004302628],"about_ca_topic_score_codex":0.0026702336,"about_ca_topic_score_gemma":0.00274465,"teacher_disagreement_score":0.005010111,"about_ca_system_score_codex":0.0020978474,"about_ca_system_score_gemma":0.003678902,"threshold_uncertainty_score":0.016760468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052746743,0.0018300748,0.8615219,0.010607106,0.00021295108,0.0003497005,0.0011702869,0.0005590213,0.07100215],"genre_scores_gemma":[0.6085934,0.0040215165,0.35760576,0.004983801,0.0014308437,0.0020321764,0.0031766247,0.00042307057,0.01773291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946779,0.0010976718,0.00028244514,0.0011223684,0.0021540115,0.0006655491],"domain_scores_gemma":[0.9804007,0.016995426,0.00067462213,0.0008134098,0.0007067856,0.00040915114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039638,0.0010620751,0.0017266276,0.0020603724,0.002463088,0.006370883,0.0023564815,0.0023415333,0.01302575],"category_scores_gemma":[0.015063456,0.00076158525,0.0034274275,0.0028847437,0.0060543357,0.012755861,0.0049244566,0.010788444,0.0017938653],"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.00013945297,0.00011501585,0.0005150461,0.00030750321,0.00005596739,0.00011970917,0.0003747119,0.014752746,0.0013452641,0.9472016,0.007054168,0.028018748],"study_design_scores_gemma":[0.00004267443,0.000040228246,0.0002859077,0.00005424004,0.000018036142,0.000101103615,0.00006563434,0.049521506,0.0008195988,0.9435154,0.0055182967,0.000017279246],"about_ca_topic_score_codex":0.0017394677,"about_ca_topic_score_gemma":0.0012540036,"teacher_disagreement_score":0.01302575,"about_ca_system_score_codex":0.0035235004,"about_ca_system_score_gemma":0.0018812875,"threshold_uncertainty_score":0.043575525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053754296,0.0004539896,0.9241758,0.0024947757,0.00030521292,0.0004940758,0.00017897185,0.0039336653,0.014209201],"genre_scores_gemma":[0.5928252,0.00047563427,0.39146847,0.00066661986,0.0001848067,0.00083538773,0.00030576455,0.0014260458,0.0118121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939178,0.0014436,0.00041631382,0.00081640563,0.0023298825,0.0010759431],"domain_scores_gemma":[0.9836426,0.0056150206,0.0021460028,0.006553615,0.0015459806,0.00049687695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941848,0.0014313135,0.0022196833,0.0010984108,0.0033450525,0.0034272792,0.003895966,0.0023055212,0.0073129577],"category_scores_gemma":[0.01936636,0.0006657959,0.0014961296,0.001030408,0.0038207378,0.010434692,0.008190532,0.006539042,0.0038300012],"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.0030421636,0.0006460231,0.0038220247,0.0011210834,0.00034957964,0.0007057488,0.0027029205,0.053615555,0.14716236,0.4894794,0.021024024,0.27632907],"study_design_scores_gemma":[0.00058145623,0.0010751332,0.0009813249,0.00031855007,0.00019552799,0.001131266,0.00077575166,0.3462787,0.1824556,0.39560908,0.070350096,0.0002474748],"about_ca_topic_score_codex":0.0010390299,"about_ca_topic_score_gemma":0.0007958755,"teacher_disagreement_score":0.0073129577,"about_ca_system_score_codex":0.0017249263,"about_ca_system_score_gemma":0.003355883,"threshold_uncertainty_score":0.026135325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007757349,0.0038881502,0.7955721,0.005770702,0.0010757843,0.0002653022,0.0013311747,0.0010577653,0.1832816],"genre_scores_gemma":[0.48127484,0.00690391,0.40401098,0.0050802673,0.002008001,0.0010797009,0.0022688825,0.0009223826,0.096451014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596316,0.000983765,0.0004434553,0.0009165315,0.0012383104,0.00045479622],"domain_scores_gemma":[0.9978356,0.00086047297,0.00014839019,0.00051438453,0.000507561,0.00013364054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030893409,0.0009592418,0.0010353122,0.0016630001,0.0036727812,0.0057998346,0.0022676953,0.0021885347,0.012797348],"category_scores_gemma":[0.0053059,0.0007828499,0.0019662862,0.002387449,0.0056581614,0.012033762,0.005588052,0.005106103,0.004129234],"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.0000024923336,0.0000033813114,0.000024259825,0.000016055777,0.0000026496514,0.000019879306,0.00007587464,0.0001570485,0.00008688822,0.9958062,0.0012697144,0.0025356114],"study_design_scores_gemma":[0.0000068088902,0.0000048599773,0.000031729345,0.00001965526,0.0000071935833,0.000068872956,0.00004268421,0.001718039,0.00027463978,0.95341015,0.04440681,0.000008501112],"about_ca_topic_score_codex":0.0038677976,"about_ca_topic_score_gemma":0.0023277735,"teacher_disagreement_score":0.012797348,"about_ca_system_score_codex":0.0029722247,"about_ca_system_score_gemma":0.002931227,"threshold_uncertainty_score":0.042811394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025459727,0.00032872448,0.9617592,0.00078569166,0.000053644937,0.000107035456,0.00022245645,0.0020610227,0.00922256],"genre_scores_gemma":[0.532428,0.00043733907,0.45519727,0.0006478455,0.0002827524,0.00082679145,0.0007962642,0.0007809419,0.008602746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916672,0.0031475227,0.0004053403,0.0018519157,0.0021216653,0.00080632535],"domain_scores_gemma":[0.96112096,0.026627177,0.0023311889,0.0073278914,0.0018567786,0.0007359929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051399986,0.0013999689,0.0015367585,0.0016541572,0.0017615367,0.003309875,0.005314791,0.0015670075,0.011354604],"category_scores_gemma":[0.027912838,0.0009093415,0.0021037003,0.0027445913,0.0036371478,0.008699419,0.0061801695,0.005770674,0.0018773815],"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.0005877318,0.00049977785,0.005716462,0.0014610456,0.0003466892,0.0005457805,0.0011487197,0.087576695,0.011814689,0.625686,0.014101275,0.25051513],"study_design_scores_gemma":[0.00019977007,0.00014443025,0.00053428166,0.00012215834,0.00017158272,0.00019339644,0.00021726805,0.48248124,0.01301857,0.49568242,0.007172257,0.0000626502],"about_ca_topic_score_codex":0.0019798242,"about_ca_topic_score_gemma":0.0029834132,"teacher_disagreement_score":0.011354604,"about_ca_system_score_codex":0.0013377138,"about_ca_system_score_gemma":0.0018016419,"threshold_uncertainty_score":0.037984908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12652853,0.0013982407,0.83992684,0.0034193953,0.00012922705,0.00018489819,0.0005415824,0.0011703436,0.026701007],"genre_scores_gemma":[0.76479554,0.0013916746,0.22167177,0.0010766707,0.00040996028,0.00034266044,0.00077280495,0.00025969648,0.009279211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472696,0.0014280765,0.0004018471,0.0011054891,0.0017315078,0.0006060692],"domain_scores_gemma":[0.98482406,0.011009343,0.0012640741,0.0015129043,0.0009208349,0.0004687291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036869508,0.00070110254,0.0008069732,0.0015739774,0.001483144,0.0060557653,0.0023575379,0.0018476634,0.006157507],"category_scores_gemma":[0.014452416,0.00066128327,0.0021167053,0.002482676,0.005977697,0.017450454,0.0023889053,0.0037798116,0.00072712713],"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.000018223158,0.000026995594,0.00015049498,0.00003871531,0.000005399083,0.000054848984,0.0002709059,0.0028151928,0.0007319785,0.99257153,0.00024225908,0.0030734001],"study_design_scores_gemma":[0.000012916267,0.000024385494,0.0000877371,0.000011892045,0.000008849748,0.000093543094,0.00008419974,0.020950686,0.0011264259,0.97447157,0.0031146393,0.000013132011],"about_ca_topic_score_codex":0.0031117024,"about_ca_topic_score_gemma":0.0016024848,"teacher_disagreement_score":0.006157507,"about_ca_system_score_codex":0.0036784057,"about_ca_system_score_gemma":0.0016240684,"threshold_uncertainty_score":0.026688874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051629166,0.00074003695,0.9712147,0.00078711566,0.00023298824,0.00031403854,0.0003194156,0.0017042933,0.019524405],"genre_scores_gemma":[0.1925534,0.0012374363,0.78889585,0.00077968696,0.00044831718,0.00090262713,0.0012670911,0.00080202584,0.013113574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951184,0.0016136558,0.00031412757,0.0012586726,0.0010066692,0.00068845437],"domain_scores_gemma":[0.9912731,0.005488941,0.00058214355,0.0018277545,0.0005597833,0.0002683061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003245012,0.0020950912,0.0026321746,0.0013213124,0.0020002907,0.00509732,0.0041225236,0.003365085,0.02848087],"category_scores_gemma":[0.015772268,0.0011719436,0.0018285078,0.00298974,0.0020984034,0.008345268,0.003700582,0.004165512,0.0059919376],"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.00038391282,0.00076378835,0.00065068906,0.0008008813,0.00013470324,0.0001747248,0.00023565737,0.2518408,0.00247332,0.5032596,0.025930658,0.21335135],"study_design_scores_gemma":[0.00021459423,0.0000883234,0.000105734674,0.000049534305,0.000033811175,0.0001575442,0.00006161793,0.55424666,0.0011574156,0.4265428,0.01730982,0.000032114305],"about_ca_topic_score_codex":0.0020673375,"about_ca_topic_score_gemma":0.0026741452,"teacher_disagreement_score":0.02848087,"about_ca_system_score_codex":0.0026762928,"about_ca_system_score_gemma":0.0035895908,"threshold_uncertainty_score":0.095277965},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05695695,0.00020306832,0.9405017,0.00011152883,0.00002823324,0.00008649098,0.00023137117,0.0007257094,0.0011550144],"genre_scores_gemma":[0.34829003,0.00031318213,0.647987,0.00004522495,0.000030292662,0.00027787706,0.0013080741,0.0002793608,0.001468925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848855,0.00031952173,0.000085507105,0.00034545257,0.00061082223,0.00015013463],"domain_scores_gemma":[0.99749583,0.001453674,0.00023871443,0.00040894,0.00030166752,0.000101056554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088790385,0.0013261498,0.001695771,0.0018894764,0.0007914501,0.0013972677,0.0020477478,0.0014163143,0.0029247997],"category_scores_gemma":[0.007690911,0.00089656975,0.0011365777,0.0023490197,0.0010793051,0.003242007,0.002277142,0.0013733546,0.0006858253],"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.00011826815,0.00003780038,0.000968413,0.00013358702,0.000040747374,0.000110555055,0.0001363805,0.9023156,0.0027962814,0.019492742,0.0013275112,0.072522186],"study_design_scores_gemma":[0.000011728432,0.000020396174,0.000083807856,0.0000074386257,0.000004161147,0.000030451542,0.00005557055,0.9665436,0.0007984279,0.031686325,0.00075244653,0.0000056287645],"about_ca_topic_score_codex":0.0039835735,"about_ca_topic_score_gemma":0.0045135557,"teacher_disagreement_score":0.0039835735,"about_ca_system_score_codex":0.0011524541,"about_ca_system_score_gemma":0.0011080992,"threshold_uncertainty_score":0.00978446},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057546017,0.0004963841,0.99025214,0.00032455206,0.000058707763,0.0000826612,0.000029015371,0.00028952584,0.002712403],"genre_scores_gemma":[0.12982607,0.0006841094,0.86510026,0.00034249324,0.00015937655,0.00036768944,0.00018722551,0.0003585848,0.0029742625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943504,0.002783767,0.00029491333,0.0008053196,0.0014359428,0.00032973496],"domain_scores_gemma":[0.98251927,0.012685323,0.0008956263,0.0017143651,0.001682381,0.00050295214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010329079,0.0020699115,0.0024521437,0.002573962,0.0021657506,0.0039461697,0.004857445,0.004114964,0.003192442],"category_scores_gemma":[0.04864528,0.0015001183,0.001993753,0.002356225,0.0034054369,0.00596827,0.0041668676,0.003744483,0.001633201],"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.00031596163,0.0002196324,0.0018424125,0.0003823439,0.00015786583,0.000094485426,0.0004428424,0.6936516,0.0020592061,0.17239138,0.006618295,0.121823944],"study_design_scores_gemma":[0.00004710043,0.000071582646,0.00013996007,0.000047110225,0.000014313403,0.000041120806,0.000038699887,0.93569076,0.0011128739,0.06030454,0.002467051,0.000024844172],"about_ca_topic_score_codex":0.0065538962,"about_ca_topic_score_gemma":0.0051600346,"teacher_disagreement_score":0.010329079,"about_ca_system_score_codex":0.0029445565,"about_ca_system_score_gemma":0.0034216826,"threshold_uncertainty_score":0.054626048},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021932818,0.00013493576,0.97548485,0.00011240048,0.000023387018,0.000019426107,0.00003344749,0.00022343466,0.002035301],"genre_scores_gemma":[0.734889,0.00043524263,0.25981963,0.00012248164,0.000091739676,0.00014780434,0.0002105826,0.00022852074,0.004054966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975878,0.00086963474,0.00015808163,0.00040590824,0.000759731,0.00021896929],"domain_scores_gemma":[0.9949275,0.0034178263,0.0004412423,0.00066013745,0.0003736338,0.00017968072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003943745,0.00072811247,0.0011186625,0.0015542256,0.0007003389,0.0019286805,0.0014896868,0.0009910346,0.0022195808],"category_scores_gemma":[0.014199239,0.0005113946,0.0016555295,0.0009098788,0.0022755198,0.0033807873,0.0022339392,0.0018840822,0.00037005925],"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.000072603194,0.000030214986,0.0015224814,0.000066133325,0.000058978316,0.000109667184,0.00025903282,0.40635476,0.0019416453,0.57611275,0.00037963162,0.01309204],"study_design_scores_gemma":[0.0000043022956,0.000014817511,0.000104234394,0.0000079421425,0.000008487536,0.000017264843,0.000012985887,0.8623143,0.00046448296,0.13663264,0.0004105342,0.000007987048],"about_ca_topic_score_codex":0.006513045,"about_ca_topic_score_gemma":0.0043339888,"teacher_disagreement_score":0.006513045,"about_ca_system_score_codex":0.0025831244,"about_ca_system_score_gemma":0.001242628,"threshold_uncertainty_score":0.020856738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06035361,0.0009793486,0.9222658,0.0009906254,0.00013141897,0.000114103335,0.00044438115,0.0006528841,0.014067835],"genre_scores_gemma":[0.78687143,0.0010580925,0.20319329,0.00045449412,0.00018865011,0.0003628355,0.00053357735,0.0001436152,0.0071941125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652404,0.0007813794,0.00016969898,0.0006128481,0.0014285276,0.0004834403],"domain_scores_gemma":[0.9887427,0.005109531,0.001395744,0.00337606,0.0010112989,0.00036454631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017767966,0.00058501784,0.0008228034,0.0013434938,0.00090386876,0.0013981368,0.0016025001,0.0018933996,0.004036122],"category_scores_gemma":[0.017731372,0.00060761854,0.00067721325,0.0013568553,0.0019556065,0.0034286054,0.00275741,0.0019367314,0.0011670536],"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.0003862248,0.000117397816,0.0017463531,0.00021421888,0.000047969028,0.0000895976,0.00019345996,0.18841055,0.009549839,0.6794097,0.0041293544,0.11570544],"study_design_scores_gemma":[0.00013780924,0.00019825046,0.00066457386,0.00008231572,0.000038878927,0.0003280909,0.000048524835,0.63358384,0.009367535,0.34635612,0.009115036,0.000079049234],"about_ca_topic_score_codex":0.0010736703,"about_ca_topic_score_gemma":0.00082746666,"teacher_disagreement_score":0.004036122,"about_ca_system_score_codex":0.0017160664,"about_ca_system_score_gemma":0.0017083846,"threshold_uncertainty_score":0.013502181},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041519687,0.0004431873,0.94292086,0.0002330655,0.000090195084,0.00011971124,0.00014573729,0.009865175,0.0046622553],"genre_scores_gemma":[0.4458427,0.0002828758,0.5443604,0.00014243869,0.00007060573,0.0003017838,0.0004429395,0.00069125,0.007865008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981822,0.0002863134,0.00015415504,0.00023303549,0.00090641016,0.00023797258],"domain_scores_gemma":[0.9939865,0.0014814442,0.0003666779,0.0031984705,0.0007404753,0.00022638506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010436927,0.00072198274,0.00084463117,0.000637997,0.0008519158,0.002483896,0.0033833557,0.0008685448,0.0064739613],"category_scores_gemma":[0.0056040464,0.000704259,0.0005227634,0.0011815458,0.0011822258,0.0057115555,0.0031819465,0.0015495782,0.0019463643],"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.0038208093,0.00049942813,0.0055148667,0.00070777023,0.00014710505,0.00045543196,0.00063892576,0.06440877,0.07717191,0.17570506,0.014230645,0.65669924],"study_design_scores_gemma":[0.00043067074,0.00066878693,0.001452663,0.00011068438,0.0001899509,0.000614031,0.0002565011,0.67052925,0.18416426,0.10464807,0.036784284,0.00015082014],"about_ca_topic_score_codex":0.001260179,"about_ca_topic_score_gemma":0.0023024026,"teacher_disagreement_score":0.0064739613,"about_ca_system_score_codex":0.0012072576,"about_ca_system_score_gemma":0.001551471,"threshold_uncertainty_score":0.021657526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09474459,0.0019892652,0.837627,0.003806828,0.0002850405,0.00045789912,0.0038192903,0.033073116,0.024196994],"genre_scores_gemma":[0.440813,0.001088911,0.5254131,0.0006821676,0.00025719422,0.0005703285,0.007798114,0.0029763978,0.02040084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964818,0.0003656994,0.00024720965,0.00067978736,0.0015348418,0.0006906064],"domain_scores_gemma":[0.99386626,0.0019169954,0.00043517182,0.003126733,0.00040449755,0.0002503058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009830114,0.0019396105,0.0020181139,0.001391309,0.0014592619,0.003379012,0.0050878082,0.0017713087,0.019773511],"category_scores_gemma":[0.0058071553,0.0010362072,0.0016574875,0.0046669166,0.0015948003,0.013450358,0.0052760663,0.0026244048,0.0061852206],"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.0039647627,0.00072496553,0.003173765,0.00094721344,0.00027486208,0.00050766923,0.0008632924,0.14514442,0.050968315,0.06766508,0.06606752,0.659698],"study_design_scores_gemma":[0.0011623125,0.00050289603,0.0017032055,0.00009367649,0.00028715402,0.0010213129,0.0006533336,0.6829229,0.061846655,0.20274493,0.04691023,0.00015142073],"about_ca_topic_score_codex":0.0059376066,"about_ca_topic_score_gemma":0.010061242,"teacher_disagreement_score":0.019773511,"about_ca_system_score_codex":0.002308747,"about_ca_system_score_gemma":0.0017833564,"threshold_uncertainty_score":0.066149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024149385,0.0032291575,0.88555795,0.0009014135,0.0005652936,0.0001473375,0.0007513836,0.0006125877,0.10581989],"genre_scores_gemma":[0.117225155,0.008198501,0.83643824,0.0011284535,0.0011016802,0.00062054995,0.0019007346,0.00050022436,0.03288654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976802,0.00043953216,0.00025670123,0.00044968145,0.0010256805,0.00014828503],"domain_scores_gemma":[0.99832064,0.0005811781,0.00018912157,0.00041300504,0.0004236225,0.000072427865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015239858,0.0011538513,0.00076946453,0.0014869453,0.0010614197,0.0045737447,0.0024944975,0.00090599793,0.018707218],"category_scores_gemma":[0.006281598,0.00046771666,0.0010221803,0.0032600097,0.002681909,0.005901007,0.0027683843,0.0029765577,0.0066960696],"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.000014177537,0.000007990341,0.00005135633,0.00011546648,0.0000069794028,0.00002654602,0.00009342916,0.0023708784,0.0003830274,0.96276796,0.0058536916,0.028308515],"study_design_scores_gemma":[0.000015552596,0.0000317546,0.000113178685,0.00014008128,0.000014178003,0.00019437475,0.000085131964,0.011393107,0.0012743549,0.760539,0.22617765,0.000021711476],"about_ca_topic_score_codex":0.0012535589,"about_ca_topic_score_gemma":0.0011332575,"teacher_disagreement_score":0.018707218,"about_ca_system_score_codex":0.0014452809,"about_ca_system_score_gemma":0.0011539585,"threshold_uncertainty_score":0.0625819},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47118795,0.0009104712,0.5128376,0.00072763715,0.000075148804,0.00013938826,0.00018868693,0.0020348215,0.011898336],"genre_scores_gemma":[0.901697,0.00022429506,0.09183276,0.00016672963,0.00007884129,0.00025028508,0.00024472844,0.000090162626,0.005415263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989705,0.00017024315,0.00008993842,0.00030593105,0.00026140155,0.00020202245],"domain_scores_gemma":[0.9966983,0.0014818708,0.00041518002,0.0011383198,0.00017778168,0.00008858326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067268836,0.00034313835,0.00051491096,0.00046768034,0.0008579632,0.0015178625,0.0014955784,0.00061331724,0.0021926675],"category_scores_gemma":[0.004464695,0.00043756253,0.0005583022,0.0007353678,0.001847208,0.0041554486,0.0016675554,0.0012120543,0.00045991488],"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.0010007223,0.00031868814,0.0048969947,0.000325067,0.000061949606,0.0012483061,0.00107539,0.22702727,0.04211754,0.5928267,0.004033849,0.1250676],"study_design_scores_gemma":[0.00009737224,0.00021402998,0.00078110147,0.000024871408,0.000046839406,0.00066556386,0.0001915837,0.5890542,0.032832608,0.3682566,0.007786616,0.000048615806],"about_ca_topic_score_codex":0.0013636579,"about_ca_topic_score_gemma":0.0014395919,"teacher_disagreement_score":0.0021926675,"about_ca_system_score_codex":0.0006884781,"about_ca_system_score_gemma":0.00075870147,"threshold_uncertainty_score":0.0073352456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021924026,0.011496695,0.93403953,0.008127998,0.00090290286,0.00024021388,0.00083628716,0.0012164611,0.021215798],"genre_scores_gemma":[0.21318358,0.014104618,0.7360367,0.003697814,0.0034759918,0.00074462855,0.0041102404,0.001135226,0.023511307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310726,0.0022629993,0.00047226486,0.001631538,0.001937905,0.0005881224],"domain_scores_gemma":[0.9790701,0.016278144,0.0008306561,0.0022885227,0.0010032045,0.0005293948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047053564,0.0027353547,0.0038589528,0.0034850454,0.0031161918,0.0044207955,0.005137142,0.0053223763,0.012278624],"category_scores_gemma":[0.033386707,0.0010953309,0.0025088142,0.010043811,0.005448339,0.019935723,0.006539696,0.008332925,0.004292056],"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.00079089304,0.00038683662,0.0013096266,0.000806519,0.00015532006,0.0003299323,0.00059898203,0.16604382,0.0012500525,0.544903,0.04592346,0.2375017],"study_design_scores_gemma":[0.000105860985,0.00009279431,0.00017860475,0.00010490282,0.000036017114,0.00025327786,0.00014293654,0.15310808,0.00092277216,0.8295049,0.015510294,0.00003963572],"about_ca_topic_score_codex":0.003003068,"about_ca_topic_score_gemma":0.0017705846,"teacher_disagreement_score":0.012278624,"about_ca_system_score_codex":0.0027906427,"about_ca_system_score_gemma":0.002128113,"threshold_uncertainty_score":0.041076064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13724047,0.00023887045,0.85826236,0.00056864053,0.000041969888,0.000047002253,0.00018710466,0.0006980248,0.002715655],"genre_scores_gemma":[0.8409901,0.00019549034,0.15441172,0.00019200746,0.000082105966,0.00013449545,0.0003152884,0.000080385464,0.0035983843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898595,0.00023209931,0.00006571834,0.0003434066,0.00022119125,0.00015160599],"domain_scores_gemma":[0.99313664,0.0048860027,0.00057041825,0.00086686906,0.00036684898,0.00017314909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014067957,0.0005548053,0.0010209603,0.0009084996,0.00076362916,0.0011957455,0.002143541,0.0011820693,0.0032991907],"category_scores_gemma":[0.0131483255,0.0003638208,0.0009472074,0.00097313384,0.0014969897,0.0065098093,0.001685351,0.0019752043,0.00043070054],"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.00038464362,0.00014583362,0.0054414817,0.0001846381,0.00005703388,0.00030656657,0.00033638653,0.34113213,0.006280007,0.52306604,0.0018788382,0.12078629],"study_design_scores_gemma":[0.000011873391,0.00003702882,0.0001366054,0.000006837374,0.000008553747,0.00005161167,0.000016488815,0.82872295,0.0015402384,0.16895968,0.00049810694,0.000010052657],"about_ca_topic_score_codex":0.0021388382,"about_ca_topic_score_gemma":0.002217648,"teacher_disagreement_score":0.0032991907,"about_ca_system_score_codex":0.0018539618,"about_ca_system_score_gemma":0.00078227796,"threshold_uncertainty_score":0.013451457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035623834,0.00021858422,0.993697,0.0002841484,0.00005935083,0.00004588132,0.00004483498,0.0002514855,0.0018364241],"genre_scores_gemma":[0.19661848,0.0006609377,0.7986049,0.00026671513,0.00015133279,0.00035403535,0.00019978062,0.00012611233,0.0030176605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759966,0.0011160023,0.00012970167,0.00024438847,0.000686542,0.00022366541],"domain_scores_gemma":[0.9956813,0.0030180197,0.00026820728,0.000538823,0.00036423418,0.0001293872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047831037,0.0012942553,0.0013379654,0.0009363604,0.0007883624,0.002018912,0.0018921384,0.0015236629,0.0036456352],"category_scores_gemma":[0.013722184,0.0006298666,0.0014170706,0.0018994594,0.001284239,0.0024790154,0.0024649655,0.0040386585,0.0008697639],"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.00013622807,0.00006327338,0.0003134472,0.00008581772,0.000031458894,0.00006501467,0.00014071845,0.738718,0.0012833228,0.19490504,0.00200027,0.062257443],"study_design_scores_gemma":[0.000014814077,0.00002386084,0.000023079636,0.0000126741015,0.000005362623,0.000015674084,0.00000710931,0.9650584,0.00025648248,0.033513233,0.0010637175,0.0000056224253],"about_ca_topic_score_codex":0.0034916508,"about_ca_topic_score_gemma":0.003059454,"teacher_disagreement_score":0.0047831037,"about_ca_system_score_codex":0.0019922566,"about_ca_system_score_gemma":0.0019367113,"threshold_uncertainty_score":0.025295794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032780323,0.0054467185,0.91966134,0.0043155686,0.00041260401,0.0002687158,0.00076012046,0.0030857862,0.03326886],"genre_scores_gemma":[0.64228594,0.0041619646,0.32759663,0.002750118,0.0013441176,0.0016850949,0.0021088049,0.003251741,0.014815642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98282695,0.0040107304,0.0009972241,0.0047281915,0.0045395377,0.0028974263],"domain_scores_gemma":[0.93694025,0.04133091,0.0025961648,0.014046839,0.0033180446,0.0017678273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096310135,0.003753762,0.0046548937,0.0028202853,0.0032803565,0.007433627,0.0079622585,0.0044305567,0.016560297],"category_scores_gemma":[0.060494915,0.0013180012,0.0049738325,0.004655046,0.0050193924,0.019695304,0.0097666,0.012307862,0.0053992667],"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.0022598798,0.0006660101,0.0059082196,0.0020964984,0.0005190447,0.00040136426,0.0013485495,0.37316316,0.011422246,0.4381051,0.020525375,0.14358467],"study_design_scores_gemma":[0.00013752504,0.00033465738,0.0007394127,0.00023063837,0.00023160444,0.00041322288,0.00021559639,0.71719474,0.0060069417,0.26296052,0.011465947,0.000069197056],"about_ca_topic_score_codex":0.001881217,"about_ca_topic_score_gemma":0.0022192239,"teacher_disagreement_score":0.016560297,"about_ca_system_score_codex":0.0069364375,"about_ca_system_score_gemma":0.00349001,"threshold_uncertainty_score":0.055399656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49751198,0.00045152652,0.4695644,0.001785301,0.00010275657,0.00010906131,0.00024439284,0.00091213477,0.029318519],"genre_scores_gemma":[0.9539161,0.000094755545,0.04272992,0.0001851789,0.000031529424,0.00009040215,0.00008230055,0.000055226214,0.0028146722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985738,0.00059012935,0.000074312076,0.00022783582,0.0003256378,0.00020829176],"domain_scores_gemma":[0.99647564,0.0016036644,0.00024101659,0.0012511382,0.00024611922,0.0001823581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017616289,0.00041849873,0.00079783954,0.0005940755,0.0012359022,0.0033016629,0.0010458764,0.0010821043,0.00362114],"category_scores_gemma":[0.0068527,0.00051958585,0.0005915823,0.0006040688,0.0035860008,0.0064330227,0.0036142578,0.0019128214,0.00082406186],"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.00066988444,0.000110213216,0.0013973754,0.000108415355,0.000066568035,0.00022129728,0.00031187214,0.049443375,0.01142397,0.9206588,0.0010715575,0.014516712],"study_design_scores_gemma":[0.00005173351,0.00008185746,0.0003042424,0.000023269868,0.000023519211,0.000090417874,0.000076390046,0.40745267,0.010414734,0.5792388,0.0022105342,0.000031882428],"about_ca_topic_score_codex":0.00042414502,"about_ca_topic_score_gemma":0.00068460836,"teacher_disagreement_score":0.00362114,"about_ca_system_score_codex":0.0010787526,"about_ca_system_score_gemma":0.0008124262,"threshold_uncertainty_score":0.012113869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68114793,0.0028991466,0.28485572,0.0035060446,0.0002390943,0.00011591356,0.0021959106,0.0010408653,0.023999315],"genre_scores_gemma":[0.9622296,0.00071039214,0.03211674,0.000300273,0.000099156176,0.0000716391,0.00070497906,0.00013191056,0.0036353888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990163,0.000246831,0.000036274698,0.00017884838,0.0002953572,0.00022632563],"domain_scores_gemma":[0.9939693,0.0039592055,0.0005176853,0.0006426409,0.00048054344,0.00043054053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012768096,0.00018832873,0.0004930252,0.00079281174,0.00050691224,0.0012139266,0.00085552677,0.00076868915,0.0037348736],"category_scores_gemma":[0.015139066,0.00036150627,0.00022858163,0.0008379942,0.00076605444,0.002322009,0.0010539447,0.0006897877,0.00084180414],"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.0015918071,0.00018827917,0.031965498,0.0006123677,0.00019226491,0.00052934187,0.0005745748,0.3476055,0.046138886,0.35968602,0.027470695,0.18344484],"study_design_scores_gemma":[0.0001299445,0.00028179452,0.01065106,0.000089147274,0.00007075324,0.0007613657,0.00023070663,0.758586,0.008502944,0.21135181,0.009274228,0.00007031875],"about_ca_topic_score_codex":0.0012072163,"about_ca_topic_score_gemma":0.0016663229,"teacher_disagreement_score":0.0037348736,"about_ca_system_score_codex":0.0010762613,"about_ca_system_score_gemma":0.0008490996,"threshold_uncertainty_score":0.012494445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10064655,0.0023236938,0.84426445,0.0076413294,0.00036916274,0.0004483114,0.0048353723,0.0019805618,0.037490606],"genre_scores_gemma":[0.86491764,0.0018309894,0.10831606,0.0018655538,0.00094819913,0.0016100447,0.0066486564,0.00073230383,0.013130475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917671,0.003030064,0.0004864,0.0021756177,0.0016700322,0.0008707102],"domain_scores_gemma":[0.90321165,0.07423607,0.0061551575,0.011242553,0.0037110273,0.0014436279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010568094,0.002053768,0.0023559078,0.0036577226,0.0012939724,0.0048106383,0.00563639,0.0035210655,0.014997023],"category_scores_gemma":[0.08689384,0.0011942374,0.002693808,0.0026313823,0.0039287996,0.011491243,0.002391045,0.0069184443,0.0025928298],"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.0002749367,0.00031505027,0.014771554,0.0004659286,0.00026295736,0.00017073147,0.00036942886,0.556791,0.00041706188,0.36170095,0.022898888,0.041561536],"study_design_scores_gemma":[0.000043471042,0.00007389132,0.0020348048,0.000064438704,0.000038374,0.00012919768,0.00006297457,0.7289229,0.00019273433,0.26415893,0.004243835,0.00003440768],"about_ca_topic_score_codex":0.0024360002,"about_ca_topic_score_gemma":0.0028883298,"teacher_disagreement_score":0.014997023,"about_ca_system_score_codex":0.0035866566,"about_ca_system_score_gemma":0.0017001162,"threshold_uncertainty_score":0.055890083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13572969,0.0015276147,0.83041877,0.0047598765,0.000091123824,0.00011773556,0.00048473818,0.00047750212,0.026392965],"genre_scores_gemma":[0.77035147,0.0019505898,0.21566276,0.000720183,0.00046313126,0.0004401215,0.00073280203,0.00020269262,0.009476233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967043,0.0012534838,0.00023211134,0.0005808622,0.0009617326,0.00026748047],"domain_scores_gemma":[0.9809022,0.015657857,0.00090302643,0.0012334724,0.00090015936,0.00040328587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033556407,0.0010813758,0.00107528,0.0023622462,0.0013882145,0.0044748075,0.0020539109,0.0014003216,0.0036667087],"category_scores_gemma":[0.024038859,0.0005701437,0.002079555,0.005418752,0.0041282536,0.0125226,0.0035663245,0.005383845,0.0004094607],"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.00003303633,0.000031683558,0.0004641,0.000059709633,0.000009868231,0.00007140162,0.00020870882,0.018174533,0.0009019515,0.9637756,0.0007305163,0.01553906],"study_design_scores_gemma":[0.000014197354,0.000018798468,0.00018586717,0.000022021653,0.000013153969,0.000086348686,0.00007216657,0.12092348,0.0009125451,0.87525004,0.0024858296,0.000015557482],"about_ca_topic_score_codex":0.0034756337,"about_ca_topic_score_gemma":0.0019895923,"teacher_disagreement_score":0.0044748075,"about_ca_system_score_codex":0.0040328894,"about_ca_system_score_gemma":0.0012115205,"threshold_uncertainty_score":0.029260814},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25110924,0.0029822113,0.62858325,0.008169143,0.0007443528,0.00027794958,0.002112726,0.006279151,0.09974202],"genre_scores_gemma":[0.8455578,0.0018465816,0.12788248,0.0018320602,0.0011126072,0.00058360613,0.0019691281,0.0032708007,0.015944874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99040514,0.0014342817,0.00059054646,0.002132989,0.0029549454,0.002481996],"domain_scores_gemma":[0.9576651,0.02611803,0.0021700964,0.009269569,0.0023212763,0.0024559593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044984673,0.0025231794,0.0025919606,0.0023396604,0.0027561528,0.008153888,0.007047123,0.0032918812,0.027055608],"category_scores_gemma":[0.04173655,0.0013746702,0.0035243863,0.0032179186,0.0039651017,0.019886801,0.007335639,0.007116184,0.0041340683],"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.002799406,0.0009883357,0.00911434,0.0013986388,0.0004550608,0.000874507,0.0009032406,0.26292017,0.057152215,0.4918139,0.039258018,0.13232213],"study_design_scores_gemma":[0.00010288273,0.00023638252,0.0016393276,0.00012546233,0.0001744946,0.000883203,0.00014311697,0.65552735,0.01588533,0.3163457,0.008831108,0.00010560152],"about_ca_topic_score_codex":0.0030157506,"about_ca_topic_score_gemma":0.0038068064,"teacher_disagreement_score":0.027055608,"about_ca_system_score_codex":0.00551085,"about_ca_system_score_gemma":0.0038493157,"threshold_uncertainty_score":0.09051007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012964553,0.0016624725,0.89813685,0.0034313586,0.0006600666,0.00017388714,0.00043693298,0.0011837729,0.081350096],"genre_scores_gemma":[0.4710459,0.0029936894,0.48155323,0.0036982787,0.001340128,0.00062801794,0.0009277047,0.0009562234,0.036856763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974287,0.0007497127,0.00010435431,0.00046406966,0.0009269655,0.0003260971],"domain_scores_gemma":[0.99513936,0.0027024925,0.00023418703,0.0006999753,0.0009432478,0.0002807346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886405,0.0013356495,0.0011799717,0.0020487148,0.0024842636,0.003575466,0.0025932328,0.0012864941,0.016971493],"category_scores_gemma":[0.008677586,0.0009939995,0.002068537,0.0019142184,0.0054966416,0.0046117455,0.006580953,0.0047306474,0.0047153765],"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.00004108459,0.000060816852,0.00019289934,0.0002048728,0.000026633099,0.00021302955,0.0003889145,0.0031753948,0.0032056621,0.9642188,0.0072699036,0.021002097],"study_design_scores_gemma":[0.00008719756,0.000064800275,0.00026865833,0.000109679306,0.00006998073,0.0004260482,0.00018477246,0.013097571,0.0055674575,0.92458487,0.055472214,0.00006673629],"about_ca_topic_score_codex":0.0011535402,"about_ca_topic_score_gemma":0.0021246246,"teacher_disagreement_score":0.016971493,"about_ca_system_score_codex":0.0019017129,"about_ca_system_score_gemma":0.002116103,"threshold_uncertainty_score":0.05677533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081257135,0.009339121,0.7545679,0.019720737,0.0011623312,0.00022287003,0.0011131861,0.0015447623,0.131072],"genre_scores_gemma":[0.853158,0.0063309437,0.108504325,0.0034263623,0.0024794438,0.00067805464,0.0008033321,0.0012056241,0.023413887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991247,0.0018650491,0.00025853323,0.0016425006,0.002780796,0.0022061733],"domain_scores_gemma":[0.95853966,0.03158835,0.0012933029,0.0054797283,0.0021537861,0.0009451932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062325844,0.0018573172,0.002334885,0.0026948263,0.003415331,0.0065909736,0.0031201818,0.002903652,0.016929954],"category_scores_gemma":[0.037055723,0.0010596036,0.0031684435,0.0031680535,0.007065006,0.01766459,0.006174786,0.009852874,0.0030483569],"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.00015172319,0.00006909026,0.00031360728,0.0001519656,0.000030179788,0.000054971886,0.00014341895,0.01957009,0.0009871871,0.9623296,0.005445418,0.010752821],"study_design_scores_gemma":[0.00003546177,0.000034590186,0.00015209366,0.0000429433,0.000024726245,0.000044329157,0.00002946362,0.08612014,0.0008685666,0.9080648,0.004560357,0.00002245944],"about_ca_topic_score_codex":0.003401101,"about_ca_topic_score_gemma":0.0027892722,"teacher_disagreement_score":0.016929954,"about_ca_system_score_codex":0.006327237,"about_ca_system_score_gemma":0.0032096514,"threshold_uncertainty_score":0.056636333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030786695,0.0009617466,0.95291877,0.0034962932,0.00008488116,0.00006706033,0.00031163578,0.00038485514,0.010988018],"genre_scores_gemma":[0.80737644,0.0014559763,0.18430668,0.0009384222,0.00050353294,0.0004133646,0.00065570563,0.00040130905,0.003948506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864444,0.006351691,0.00063122396,0.002928984,0.002765951,0.00087772775],"domain_scores_gemma":[0.8625879,0.12141084,0.0029809384,0.009423663,0.0025728487,0.0010238341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013748391,0.0012349884,0.0016617791,0.003041105,0.0022169119,0.0062078782,0.003305896,0.002312545,0.0039006728],"category_scores_gemma":[0.097687274,0.0012669434,0.0028474256,0.002521435,0.018693646,0.018456588,0.007349228,0.00999931,0.0006188614],"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.000024121093,0.000011191703,0.00036010912,0.000045052526,0.000014710431,0.000055249544,0.00018015134,0.011956064,0.000159435,0.98355377,0.00026364948,0.0033766655],"study_design_scores_gemma":[0.0000073297615,0.0000058755927,0.000109276116,0.000018965162,0.0000061557657,0.000027690527,0.000015381529,0.036999993,0.00021308217,0.9620566,0.000530026,0.000009786236],"about_ca_topic_score_codex":0.003642422,"about_ca_topic_score_gemma":0.001657983,"teacher_disagreement_score":0.013748391,"about_ca_system_score_codex":0.0046518017,"about_ca_system_score_gemma":0.0022793154,"threshold_uncertainty_score":0.07270932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015389464,0.0025145223,0.9656025,0.0019145081,0.00024700683,0.00018943874,0.00036132903,0.0016828901,0.012098323],"genre_scores_gemma":[0.3532241,0.0023851614,0.6267462,0.0015183132,0.0005915547,0.0010600403,0.0013991214,0.0029723046,0.010103172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98016125,0.0057250476,0.00080103957,0.0037346405,0.0072073424,0.0023707189],"domain_scores_gemma":[0.8831693,0.09419667,0.0044198423,0.0082597155,0.007949891,0.0020045666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01617758,0.0048511657,0.003367379,0.0049572797,0.003154161,0.006185596,0.0064082122,0.0036281578,0.011267615],"category_scores_gemma":[0.10073802,0.002116377,0.005662606,0.0031700854,0.008509299,0.013763956,0.008157456,0.014751154,0.0024209288],"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.0011066549,0.00027255906,0.004096344,0.0011642469,0.0003104041,0.00042433766,0.00080533436,0.43801716,0.010260507,0.46596384,0.0066742343,0.07090441],"study_design_scores_gemma":[0.000026674834,0.000058773607,0.00018024491,0.00013695554,0.000049122365,0.00007007684,0.000034367025,0.8510823,0.0028150554,0.14420673,0.001302668,0.000037060345],"about_ca_topic_score_codex":0.005331166,"about_ca_topic_score_gemma":0.0066006095,"teacher_disagreement_score":0.01617758,"about_ca_system_score_codex":0.0068935542,"about_ca_system_score_gemma":0.00576643,"threshold_uncertainty_score":0.08555627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13809729,0.0058414233,0.80893433,0.0052520386,0.0005753134,0.00036333763,0.0006340408,0.005322319,0.034979876],"genre_scores_gemma":[0.6567725,0.00241732,0.31412834,0.0017206289,0.0007804503,0.0010592534,0.0013920184,0.0031476063,0.018581834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98220384,0.0030910715,0.0013556381,0.002336835,0.0066012857,0.004411391],"domain_scores_gemma":[0.9383332,0.039399948,0.004321219,0.011608169,0.004462809,0.0018747225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077471016,0.0025620598,0.0025416478,0.0022905162,0.0026651705,0.01013252,0.0050066486,0.0031468465,0.012775192],"category_scores_gemma":[0.040986788,0.0017915819,0.0028725266,0.0027052371,0.003264531,0.016789928,0.007670552,0.0066188592,0.0025987297],"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.005639164,0.0010800107,0.0069960197,0.0018072007,0.00036385847,0.0007406537,0.0016298267,0.19332018,0.07900585,0.47600102,0.021513877,0.21190234],"study_design_scores_gemma":[0.00041092443,0.0007576026,0.0012612424,0.00033032376,0.0004684422,0.000569306,0.00040503137,0.66650194,0.060032938,0.25307855,0.016026972,0.00015671781],"about_ca_topic_score_codex":0.0019761652,"about_ca_topic_score_gemma":0.0025669911,"teacher_disagreement_score":0.012775192,"about_ca_system_score_codex":0.005828605,"about_ca_system_score_gemma":0.0046664514,"threshold_uncertainty_score":0.042737246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7428551,0.000360698,0.19933695,0.000804747,0.0005068375,0.000088248344,0.00027112942,0.00066291506,0.055113368],"genre_scores_gemma":[0.8897981,0.0002476094,0.08476414,0.00026933916,0.000059457885,0.00020579013,0.00033806675,0.00037479098,0.023942724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992736,0.00013670501,0.000080226746,0.00018393478,0.00014429499,0.00018130812],"domain_scores_gemma":[0.996837,0.0013086782,0.0005309782,0.00061815814,0.00038606508,0.00031908392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703098,0.0005456055,0.00080354855,0.00041476364,0.0023572193,0.0015929366,0.0012439566,0.0011219911,0.010047558],"category_scores_gemma":[0.0031090216,0.00048118734,0.00086860853,0.0005607591,0.0017863418,0.0031626201,0.0020582527,0.0010767786,0.0025561384],"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.0016295222,0.00028605317,0.0037987002,0.0009024257,0.00010624947,0.0038405599,0.0031447476,0.010948011,0.17112933,0.7495317,0.005740033,0.048942763],"study_design_scores_gemma":[0.00017587005,0.0004704409,0.0015507318,0.00018546762,0.00022331507,0.0025258777,0.0010901619,0.04007656,0.11545174,0.7921139,0.045966305,0.00016963981],"about_ca_topic_score_codex":0.0009613685,"about_ca_topic_score_gemma":0.0014463547,"teacher_disagreement_score":0.010047558,"about_ca_system_score_codex":0.0005040265,"about_ca_system_score_gemma":0.00097237667,"threshold_uncertainty_score":0.03361243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45843,0.0012698539,0.5238885,0.0020925612,0.0001270746,0.0002920672,0.00060323835,0.0030561555,0.010240569],"genre_scores_gemma":[0.8612788,0.00040667105,0.13177858,0.00023814208,0.00006392841,0.0003345191,0.00056713785,0.00032069275,0.0050114957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99142295,0.0021893724,0.0009248178,0.0013956797,0.0023160311,0.0017512223],"domain_scores_gemma":[0.9768644,0.014114328,0.0017679037,0.005324091,0.0012672989,0.00066205347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038149124,0.0009250878,0.0013946759,0.00068024214,0.0014083091,0.0049673403,0.003995446,0.002256479,0.007353243],"category_scores_gemma":[0.022306934,0.00087858684,0.0014344744,0.0019528219,0.0024120673,0.014553759,0.0041958317,0.0032159125,0.0009489729],"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.0035360728,0.00059825473,0.0065000076,0.0012002712,0.00024411305,0.00043052918,0.0021632675,0.34938675,0.031791493,0.38798407,0.007260339,0.2089049],"study_design_scores_gemma":[0.00040445037,0.000633555,0.0012715198,0.00012875845,0.00018981071,0.00033086474,0.00066437194,0.6589398,0.024063313,0.3085051,0.004759699,0.000108787375],"about_ca_topic_score_codex":0.002309281,"about_ca_topic_score_gemma":0.0025274316,"teacher_disagreement_score":0.007353243,"about_ca_system_score_codex":0.0030111535,"about_ca_system_score_gemma":0.0044474145,"threshold_uncertainty_score":0.024599075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030045325,0.000529638,0.9891867,0.0015669357,0.00015004385,0.00013210194,0.00017655999,0.00021848518,0.0050349473],"genre_scores_gemma":[0.09155771,0.00115669,0.8997121,0.0009830679,0.0008205055,0.0009064594,0.0005006398,0.0002863459,0.0040763975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95724297,0.017404156,0.005860485,0.00521352,0.013300194,0.0009787322],"domain_scores_gemma":[0.9400191,0.034249604,0.0038681268,0.013484219,0.0075639146,0.0008150239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028701248,0.0014308222,0.0016835356,0.006453341,0.0022667407,0.010780143,0.00417277,0.0035028625,0.0050606565],"category_scores_gemma":[0.08525213,0.001340145,0.0030287115,0.009620923,0.018874427,0.026575439,0.005448991,0.00829809,0.0017446663],"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.000013563545,0.00001493412,0.00014739406,0.000052197036,0.000008794408,0.000033458004,0.00023184382,0.0021573529,0.00029169055,0.98400766,0.0007571616,0.012284057],"study_design_scores_gemma":[0.0000081629805,0.000023093762,0.000052622727,0.000041204396,0.0000070917413,0.000104456856,0.00006213294,0.01048081,0.00078314706,0.9794612,0.008956778,0.000019330555],"about_ca_topic_score_codex":0.0014480064,"about_ca_topic_score_gemma":0.0010264791,"teacher_disagreement_score":0.028701248,"about_ca_system_score_codex":0.005306572,"about_ca_system_score_gemma":0.0029255215,"threshold_uncertainty_score":0.15178853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080778245,0.0006804004,0.97527266,0.0013584571,0.00029220822,0.00004800205,0.00013667066,0.000103913786,0.014029821],"genre_scores_gemma":[0.87749773,0.003921445,0.09194903,0.0012283546,0.0015081796,0.00032432613,0.00025515395,0.0000873979,0.023228345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808383,0.00066297356,0.00006923823,0.0003258961,0.0005748646,0.00028314022],"domain_scores_gemma":[0.9954118,0.0029295932,0.0005896238,0.0004010744,0.00041854312,0.00024939544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020675834,0.0011332387,0.0009769757,0.0009800751,0.0010263562,0.0021642272,0.0022234332,0.0020680644,0.004368764],"category_scores_gemma":[0.008233792,0.00044295428,0.00091284025,0.0010466235,0.0031316902,0.0037927006,0.00222125,0.0028387317,0.0007820104],"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.00001700411,0.000018530098,0.00031157705,0.000041046336,0.00003259057,0.000086195025,0.00007914696,0.20393172,0.0005058268,0.7880323,0.0018320103,0.005112081],"study_design_scores_gemma":[0.0000070593564,0.00003321754,0.00010829808,0.000012031984,0.000012121739,0.000048257956,0.000023172954,0.5855978,0.00019193647,0.4098574,0.004092102,0.00001662182],"about_ca_topic_score_codex":0.0027978679,"about_ca_topic_score_gemma":0.0011474561,"teacher_disagreement_score":0.004368764,"about_ca_system_score_codex":0.0019078662,"about_ca_system_score_gemma":0.0011819842,"threshold_uncertainty_score":0.01461494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029233338,0.0010378713,0.9446054,0.0020834894,0.00012157889,0.0001957331,0.000764616,0.00070291624,0.021255104],"genre_scores_gemma":[0.6700697,0.0015650901,0.31016943,0.00082093553,0.00023963915,0.0005707657,0.00084517087,0.0001420419,0.015577313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800426,0.00047367095,0.00015606282,0.00030798203,0.00080129085,0.00025676185],"domain_scores_gemma":[0.9974619,0.0011215134,0.0001721173,0.00092562137,0.00023822986,0.00008056396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012596373,0.00048772924,0.00071954535,0.0006508668,0.0010470604,0.0028095066,0.0011922126,0.0009936321,0.0048257266],"category_scores_gemma":[0.004854007,0.00030244642,0.0009344678,0.0015944784,0.0015865685,0.006071779,0.00232892,0.0033816933,0.0010255631],"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.000059011887,0.000024078661,0.00010965699,0.00006683817,0.0000065465792,0.000039060797,0.00012118607,0.007029821,0.001830083,0.9706035,0.002043895,0.018066231],"study_design_scores_gemma":[0.00004546968,0.000051513183,0.00015496128,0.000039466748,0.000017551969,0.00016927774,0.000034711433,0.080976844,0.0046500624,0.89320767,0.020629043,0.00002340266],"about_ca_topic_score_codex":0.00082408194,"about_ca_topic_score_gemma":0.00075984903,"teacher_disagreement_score":0.0048257266,"about_ca_system_score_codex":0.0029730024,"about_ca_system_score_gemma":0.0011817805,"threshold_uncertainty_score":0.021570742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086470805,0.0007090764,0.8973249,0.0011759452,0.000080306665,0.0002662141,0.0011621801,0.008069834,0.004740736],"genre_scores_gemma":[0.4655534,0.00035976616,0.52720845,0.00036353065,0.00014224258,0.0003487698,0.0033428462,0.00062800664,0.0020529819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960173,0.0006076543,0.00039197752,0.0013405834,0.0010855466,0.0005569334],"domain_scores_gemma":[0.98938155,0.007185249,0.0005965419,0.001860823,0.0006791736,0.00029668858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021336256,0.0012433343,0.0017246275,0.0015464504,0.0014693618,0.0034361961,0.0029875026,0.0023701198,0.0053029535],"category_scores_gemma":[0.014647198,0.0009691359,0.002013971,0.0029260737,0.0017462665,0.008758543,0.0040101926,0.0022347397,0.0017610062],"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.0022658845,0.00055620295,0.0072467695,0.0012297076,0.0002778887,0.00026162228,0.00082423026,0.18560466,0.025752483,0.11348061,0.027351866,0.6351481],"study_design_scores_gemma":[0.00031154946,0.0003349827,0.0015806293,0.000046963443,0.000110992194,0.00042560312,0.0002771898,0.75305057,0.010828843,0.22703075,0.005913952,0.00008801852],"about_ca_topic_score_codex":0.0038313821,"about_ca_topic_score_gemma":0.0056691472,"teacher_disagreement_score":0.0053029535,"about_ca_system_score_codex":0.0024365252,"about_ca_system_score_gemma":0.004649623,"threshold_uncertainty_score":0.01774019},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04903954,0.0005594891,0.801716,0.007727723,0.00029623558,0.0003382536,0.0020577342,0.0020243304,0.13624068],"genre_scores_gemma":[0.73926026,0.00085822144,0.21326722,0.002968216,0.0005383861,0.00059467426,0.0029058908,0.00084060244,0.03876661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966307,0.00073350774,0.00017476238,0.00094203936,0.0010750592,0.00044384887],"domain_scores_gemma":[0.99316216,0.0038665137,0.00033664305,0.0015898556,0.0007454016,0.00029945368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019057618,0.0005557892,0.0007787235,0.0004886143,0.0016210953,0.0032589112,0.0020097157,0.0011553091,0.016091976],"category_scores_gemma":[0.008176011,0.00041835877,0.0012457827,0.0008595044,0.0028431718,0.008644913,0.003737742,0.004898279,0.002226532],"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.00007962015,0.00005070743,0.00026235776,0.00025403232,0.000024550416,0.000055227796,0.00016898867,0.006837224,0.0013132164,0.9700272,0.0060756025,0.014851218],"study_design_scores_gemma":[0.000026076339,0.000019790064,0.00009894843,0.000011385511,0.000011844333,0.000071022696,0.000030344172,0.023759535,0.002389333,0.9630796,0.010491242,0.000010889451],"about_ca_topic_score_codex":0.0020512275,"about_ca_topic_score_gemma":0.002169448,"teacher_disagreement_score":0.016091976,"about_ca_system_score_codex":0.0018781743,"about_ca_system_score_gemma":0.0025051034,"threshold_uncertainty_score":0.053833008},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030804815,0.00022540583,0.9581211,0.0014325447,0.00012797497,0.0002148568,0.00014083048,0.0017063265,0.007226223],"genre_scores_gemma":[0.63291043,0.00028926093,0.3518996,0.0005591652,0.00021238947,0.00058229774,0.0004292411,0.000627632,0.012490007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98887306,0.0035642637,0.000497766,0.0021165486,0.0027026548,0.0022455915],"domain_scores_gemma":[0.9757416,0.015322311,0.0017943816,0.0046741953,0.0016240428,0.00084334734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007255043,0.0016594644,0.0026450003,0.0010804145,0.0026800781,0.004094701,0.0036408873,0.0023826484,0.005990475],"category_scores_gemma":[0.02415221,0.0007712866,0.0014484774,0.0021372186,0.0040862183,0.010399644,0.0048408615,0.0047094678,0.001862353],"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.0009816501,0.00036765568,0.0012215005,0.00042663413,0.00016973261,0.00028711406,0.0009914859,0.21730053,0.009075728,0.679177,0.009580135,0.0804208],"study_design_scores_gemma":[0.00017065188,0.00011094443,0.00008606478,0.000022540027,0.000038619386,0.000104981686,0.00007508694,0.44704983,0.0044540055,0.543695,0.004167071,0.00002518878],"about_ca_topic_score_codex":0.0014704956,"about_ca_topic_score_gemma":0.0022727286,"teacher_disagreement_score":0.007255043,"about_ca_system_score_codex":0.0032298139,"about_ca_system_score_gemma":0.0046817027,"threshold_uncertainty_score":0.03836882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07731169,0.00014401658,0.9123975,0.00027423014,0.000042736458,0.000112435475,0.00018681139,0.0055355295,0.003994984],"genre_scores_gemma":[0.8952396,0.000077090896,0.101902805,0.00012884146,0.000031615447,0.00015933227,0.000269997,0.00019713015,0.0019936764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967938,0.0008207854,0.00020745264,0.00077210984,0.0010429986,0.0003628716],"domain_scores_gemma":[0.9932967,0.0026277627,0.0007090255,0.0022950836,0.0008667463,0.00020472523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024656772,0.00047668876,0.0006743531,0.0005713563,0.0006666607,0.001424005,0.0020721585,0.0006166709,0.0020977806],"category_scores_gemma":[0.008415205,0.00044130217,0.00078700867,0.00045920914,0.0012115055,0.0020832513,0.0022532297,0.0011814395,0.00045037526],"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.0012818441,0.00023684202,0.007223605,0.00049444,0.00018946032,0.0012373445,0.0008438933,0.5140866,0.09555169,0.2459769,0.0039892267,0.12888817],"study_design_scores_gemma":[0.00009961051,0.000091691574,0.00040361885,0.000021445327,0.000053062005,0.00012591516,0.0000409174,0.9184502,0.021822494,0.05530057,0.0035684027,0.000022072543],"about_ca_topic_score_codex":0.0018035476,"about_ca_topic_score_gemma":0.002065195,"teacher_disagreement_score":0.0024656772,"about_ca_system_score_codex":0.0014037163,"about_ca_system_score_gemma":0.0019807026,"threshold_uncertainty_score":0.013039947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1387766,0.0009584666,0.83610606,0.0009518984,0.00009959256,0.000099310295,0.0002797725,0.00035990917,0.022368327],"genre_scores_gemma":[0.8977415,0.0006004268,0.09337117,0.0002786227,0.00013661676,0.00018337883,0.00028462816,0.00017486437,0.0072288634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969267,0.0009738964,0.00021428378,0.00057898153,0.0009844032,0.0003216989],"domain_scores_gemma":[0.9944488,0.0028678754,0.00071762723,0.0011899966,0.0004630783,0.0003126989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018718543,0.0008394495,0.00081814796,0.0008310038,0.0008460053,0.0033690615,0.0011675279,0.0013846924,0.004896002],"category_scores_gemma":[0.010270352,0.0005580484,0.0008497673,0.000844,0.0033774455,0.007490501,0.0051976433,0.0035641904,0.00071126356],"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.00006294888,0.000020693187,0.00014907708,0.00004823448,0.000007801007,0.000057491932,0.00017587397,0.010416518,0.0022685898,0.97909915,0.00036026185,0.0073334486],"study_design_scores_gemma":[0.000026224434,0.00006874469,0.00016450767,0.000022002696,0.000007911774,0.00011411709,0.00008013205,0.061800037,0.0046716817,0.9304228,0.0025857966,0.00003600726],"about_ca_topic_score_codex":0.00051461457,"about_ca_topic_score_gemma":0.00033682035,"teacher_disagreement_score":0.004896002,"about_ca_system_score_codex":0.0016712467,"about_ca_system_score_gemma":0.00060440286,"threshold_uncertainty_score":0.01637882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050863937,0.0009345208,0.9165161,0.0020043182,0.00023047272,0.00037127145,0.0011275435,0.0042990134,0.023652822],"genre_scores_gemma":[0.40497315,0.00062810734,0.5809316,0.0011880151,0.00037285656,0.00050757016,0.002557785,0.0011350329,0.0077059376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906651,0.0017307987,0.00055013795,0.003464986,0.0020509646,0.0015380586],"domain_scores_gemma":[0.9827297,0.008788132,0.0012356709,0.005729986,0.00083698507,0.0006795179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036358656,0.001992124,0.0025429912,0.0014599201,0.0014577286,0.0050802035,0.0059209513,0.004080112,0.011226307],"category_scores_gemma":[0.022987908,0.0012256929,0.0030588736,0.0032188792,0.003013962,0.009832761,0.0057157627,0.0057859737,0.0028327466],"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.00087430346,0.00061118405,0.0034798372,0.0006933348,0.0002843555,0.0001239046,0.00034998392,0.49732608,0.006554353,0.3021393,0.020899722,0.16666365],"study_design_scores_gemma":[0.00020673365,0.00017282207,0.0004572048,0.00004173397,0.00008517068,0.00015334874,0.00006465616,0.6930882,0.003788431,0.29326367,0.00864506,0.000033033026],"about_ca_topic_score_codex":0.0016074292,"about_ca_topic_score_gemma":0.0022763796,"teacher_disagreement_score":0.011226307,"about_ca_system_score_codex":0.0046336753,"about_ca_system_score_gemma":0.0037605888,"threshold_uncertainty_score":0.037555695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00657013,0.00032644294,0.98906416,0.0005682474,0.000037874634,0.00007969225,0.000071303635,0.00028728435,0.0029948733],"genre_scores_gemma":[0.5267556,0.00089356105,0.4661659,0.00076661474,0.00020974547,0.0006414087,0.00027622315,0.00018735825,0.0041036024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890647,0.00584228,0.0005494989,0.0016381353,0.0020696223,0.0008358697],"domain_scores_gemma":[0.97724503,0.01636553,0.0013976243,0.003714467,0.0008659965,0.00041131538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010942889,0.0018081658,0.0023420558,0.0016537273,0.0009865786,0.005004787,0.0033991362,0.0037955751,0.0047823475],"category_scores_gemma":[0.041072395,0.0014066155,0.0027203513,0.0026661034,0.004123594,0.00833075,0.0035681976,0.005672557,0.00086479157],"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.00021027862,0.00016770951,0.000523499,0.0003121901,0.00012650796,0.000117810036,0.00023187687,0.43040478,0.002340372,0.5218276,0.0023495543,0.041387804],"study_design_scores_gemma":[0.00006896989,0.000097083364,0.00008578286,0.000052560277,0.000024339379,0.000078634825,0.000022448763,0.6033554,0.0013451404,0.39332193,0.0015236245,0.000024131323],"about_ca_topic_score_codex":0.00072177354,"about_ca_topic_score_gemma":0.00046664942,"teacher_disagreement_score":0.010942889,"about_ca_system_score_codex":0.0031584967,"about_ca_system_score_gemma":0.0024679431,"threshold_uncertainty_score":0.057872236},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013604485,0.0004472016,0.97505504,0.0008574957,0.00016516252,0.00023024355,0.0017201077,0.005632168,0.002288193],"genre_scores_gemma":[0.1924306,0.00039002008,0.79447913,0.0005208132,0.00023442028,0.0011377776,0.005799183,0.0007907459,0.004217348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965867,0.00042377732,0.00039960805,0.0006989636,0.0015586194,0.0003323311],"domain_scores_gemma":[0.99256355,0.0016732025,0.00064357097,0.003894929,0.00083315966,0.00039162263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015681402,0.0009614959,0.0023709103,0.0019835653,0.0020677722,0.002752073,0.005893496,0.0019611462,0.007327477],"category_scores_gemma":[0.010949663,0.0012498731,0.0015969047,0.0047608563,0.0018606491,0.008079945,0.007836561,0.0028948258,0.003411871],"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.0017987951,0.0008508137,0.003989939,0.0006661648,0.00017586423,0.00043604552,0.0006519273,0.19544786,0.028264185,0.20501238,0.06251624,0.50018984],"study_design_scores_gemma":[0.0003827981,0.0004453953,0.0005447753,0.000063739324,0.000060890186,0.00042957134,0.00015772808,0.8269182,0.014544475,0.11908743,0.037227243,0.00013771186],"about_ca_topic_score_codex":0.0029811547,"about_ca_topic_score_gemma":0.0038850745,"teacher_disagreement_score":0.007327477,"about_ca_system_score_codex":0.0019547634,"about_ca_system_score_gemma":0.0025789924,"threshold_uncertainty_score":0.024512827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075507864,0.00093158457,0.9056692,0.0024820503,0.00017201187,0.00038614578,0.00030697996,0.0020164046,0.0125278225],"genre_scores_gemma":[0.48466963,0.0006254312,0.50289935,0.0007303961,0.0002463975,0.00083803915,0.00076488627,0.0006209838,0.008604835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948691,0.0012142028,0.0003459483,0.0010443178,0.0018099501,0.0007164894],"domain_scores_gemma":[0.9880492,0.007940753,0.0006061398,0.0020419941,0.0010326672,0.00032928213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039709457,0.0013638987,0.0013817515,0.0009434355,0.002432597,0.0032728892,0.00300795,0.0016020614,0.0071942233],"category_scores_gemma":[0.017832838,0.00090856146,0.0014702834,0.002670432,0.0019793212,0.0086358255,0.0039646253,0.003019598,0.0018014155],"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.0014554948,0.00055771996,0.0023951288,0.0007964535,0.00019425456,0.00039519687,0.0011704172,0.49068952,0.015725864,0.28802726,0.016481923,0.18211077],"study_design_scores_gemma":[0.00009140948,0.00010825897,0.00018427224,0.000016290707,0.00003735415,0.00009255246,0.00016647356,0.80661213,0.0052834423,0.18265839,0.0047276556,0.000021752026],"about_ca_topic_score_codex":0.00342472,"about_ca_topic_score_gemma":0.0031346749,"teacher_disagreement_score":0.0071942233,"about_ca_system_score_codex":0.0020153162,"about_ca_system_score_gemma":0.0022386208,"threshold_uncertainty_score":0.024067044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415762,0.0005215485,0.14885074,0.00047231757,0.00004181731,0.00006214039,0.00021894745,0.00041952424,0.007836728],"genre_scores_gemma":[0.9882819,0.00017312494,0.010419538,0.000055062214,0.000013889589,0.000044855176,0.000092154274,0.000075590215,0.000843921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992748,0.00015243964,0.000036238784,0.00016929056,0.00010469242,0.0002625244],"domain_scores_gemma":[0.99230826,0.004612171,0.0010021607,0.00085601833,0.00037964288,0.00084177183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012153212,0.0004553921,0.0005319202,0.0012956582,0.0010031646,0.0012527191,0.0014533928,0.00084548903,0.002151198],"category_scores_gemma":[0.01031895,0.0005017828,0.0006918813,0.00043730479,0.0037534107,0.0023757468,0.0013893758,0.0016080713,0.0002769077],"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.0007866348,0.00019317023,0.010658106,0.00033762542,0.000097481185,0.00073552213,0.0012858857,0.29562458,0.056843136,0.599572,0.003253111,0.030612692],"study_design_scores_gemma":[0.0000417204,0.00015345786,0.0042217784,0.00007385754,0.000039937117,0.00041007146,0.00027095267,0.54686165,0.018891383,0.42781094,0.0011025787,0.000121638186],"about_ca_topic_score_codex":0.003086885,"about_ca_topic_score_gemma":0.0018607457,"teacher_disagreement_score":0.003086885,"about_ca_system_score_codex":0.0018838546,"about_ca_system_score_gemma":0.0006339333,"threshold_uncertainty_score":0.013668358},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120047696,0.0026886517,0.84359443,0.0017793889,0.00022457904,0.00017141837,0.0021344738,0.014049872,0.015309391],"genre_scores_gemma":[0.32933298,0.0009796878,0.6566136,0.0004936987,0.00027945155,0.00036406599,0.0039685057,0.0013879869,0.006580095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963297,0.00075645285,0.00042707848,0.0008924361,0.0011210503,0.0004732653],"domain_scores_gemma":[0.9916945,0.0041569686,0.0005669447,0.0025599292,0.0007775444,0.00024413144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017322147,0.0008935678,0.0015868292,0.0017172131,0.0011534387,0.0034066185,0.003032583,0.0017431107,0.004700832],"category_scores_gemma":[0.014327141,0.00072198827,0.001149789,0.0047832625,0.0021092542,0.010362448,0.0033331998,0.001988992,0.0031370958],"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.0019939935,0.0003571077,0.0025722045,0.0008752211,0.000106661886,0.0005653216,0.0013755877,0.16308166,0.0398444,0.29760966,0.023489714,0.4681285],"study_design_scores_gemma":[0.00018679418,0.00026940048,0.00054949266,0.0001042275,0.00005400207,0.00048411623,0.00023112539,0.5128637,0.012288331,0.45803377,0.014859993,0.00007506116],"about_ca_topic_score_codex":0.0026889506,"about_ca_topic_score_gemma":0.0033658175,"teacher_disagreement_score":0.004700832,"about_ca_system_score_codex":0.001715449,"about_ca_system_score_gemma":0.0022104143,"threshold_uncertainty_score":0.015725851},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010654315,0.020255722,0.7652341,0.02056924,0.0012765697,0.00034675057,0.0007635992,0.0005765192,0.18032312],"genre_scores_gemma":[0.7613434,0.012255311,0.1814862,0.0061738035,0.003402886,0.0010087641,0.00094915804,0.00016165219,0.033218805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927856,0.0034279213,0.0004526067,0.0013874108,0.001611326,0.00033526885],"domain_scores_gemma":[0.99365777,0.0035446563,0.0004006772,0.001198801,0.0009952438,0.00020283609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069968947,0.0013904487,0.0014152338,0.0017882216,0.0013849548,0.0042980225,0.0026832714,0.0034136872,0.007879599],"category_scores_gemma":[0.014430821,0.0005287323,0.001713001,0.0017093444,0.00656092,0.005819002,0.0032386573,0.0044144723,0.0016297571],"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.000012374989,0.0000087979815,0.00008828689,0.000121626596,0.0000351496,0.000045968798,0.00017689716,0.0020791206,0.000077298624,0.98431075,0.0024787986,0.010564932],"study_design_scores_gemma":[0.000013744878,0.000009364106,0.0000450157,0.00003049673,0.000008048794,0.00005159983,0.00002142897,0.0030519962,0.00003819329,0.9902762,0.0064472547,0.0000067012425],"about_ca_topic_score_codex":0.0019413291,"about_ca_topic_score_gemma":0.0013377437,"teacher_disagreement_score":0.007879599,"about_ca_system_score_codex":0.0042883446,"about_ca_system_score_gemma":0.0017055634,"threshold_uncertainty_score":0.037003577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033660892,0.0006239942,0.92359316,0.0029307962,0.00028901518,0.0001981676,0.0007188163,0.0009005016,0.037084594],"genre_scores_gemma":[0.61529577,0.0010067908,0.37130967,0.0015257141,0.0006265012,0.0004292675,0.000984091,0.00034180062,0.008480475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954331,0.0011982864,0.0003021326,0.0006509436,0.0017606154,0.00065495324],"domain_scores_gemma":[0.9805001,0.012664621,0.00094222155,0.0033746515,0.0019907153,0.00052769476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043368544,0.000791455,0.0005808876,0.0014015656,0.0019377179,0.0040570037,0.0030399011,0.0011269898,0.009787545],"category_scores_gemma":[0.023081703,0.00086525065,0.001502051,0.001434314,0.0038669307,0.010700404,0.006201048,0.005976485,0.001360803],"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.00006322955,0.0000598711,0.00026903884,0.00014113191,0.000015343301,0.00009311336,0.00026672453,0.001419135,0.0019169684,0.97714967,0.0027701575,0.015835637],"study_design_scores_gemma":[0.000041252704,0.000042311247,0.0002654707,0.000060663,0.000039315546,0.00022615519,0.0000988602,0.013410195,0.0075144744,0.9680858,0.010190678,0.000024697143],"about_ca_topic_score_codex":0.0007153616,"about_ca_topic_score_gemma":0.00092136645,"teacher_disagreement_score":0.009787545,"about_ca_system_score_codex":0.0025969332,"about_ca_system_score_gemma":0.0022499273,"threshold_uncertainty_score":0.03274256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33860987,0.0010086348,0.61401516,0.0017598604,0.00016266607,0.00017342485,0.0011827039,0.0012029911,0.041884772],"genre_scores_gemma":[0.9041152,0.00085473777,0.080339655,0.00044075446,0.00011150104,0.0001675477,0.00075449806,0.000358985,0.012857108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988632,0.000121684745,0.000049994687,0.000322864,0.0003226344,0.00031959408],"domain_scores_gemma":[0.99341244,0.0028106805,0.0011458343,0.0010572695,0.0009754362,0.00059832144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006562036,0.0009049817,0.00084198255,0.0009228029,0.0016094644,0.0029091518,0.0017494655,0.0008803269,0.00807234],"category_scores_gemma":[0.00604815,0.00054177095,0.0011969369,0.0012022412,0.0021522432,0.006989599,0.0033228463,0.0023075412,0.00092137745],"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.0004126276,0.000100589736,0.0038862212,0.00031443426,0.000053678665,0.00022062173,0.0006829223,0.028228212,0.015970467,0.9147733,0.003988394,0.03136857],"study_design_scores_gemma":[0.00006590276,0.00019520587,0.0019851995,0.0000458694,0.00009268552,0.00041748182,0.0002975033,0.069236085,0.010626975,0.8976608,0.019320667,0.000055737863],"about_ca_topic_score_codex":0.0030862833,"about_ca_topic_score_gemma":0.0035318397,"teacher_disagreement_score":0.00807234,"about_ca_system_score_codex":0.00230838,"about_ca_system_score_gemma":0.001065097,"threshold_uncertainty_score":0.027004719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012006359,0.00014359497,0.98524,0.00021081422,0.00002805318,0.00003492517,0.000049145776,0.00013879991,0.0021483055],"genre_scores_gemma":[0.7103977,0.0003091983,0.28193513,0.00015923423,0.000061718936,0.0002606569,0.00016350266,0.000102567246,0.0066102515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990682,0.0003330417,0.000043206972,0.00020433708,0.00019407336,0.00015712825],"domain_scores_gemma":[0.99740654,0.0018348155,0.0003134161,0.00012507511,0.0001786411,0.00014156762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017009776,0.00079753326,0.001299613,0.00061659503,0.0007362626,0.0014981669,0.0019282188,0.0013027063,0.0028634449],"category_scores_gemma":[0.004426892,0.00071985123,0.00077958783,0.0011128851,0.0016936888,0.001393641,0.0023622955,0.00189775,0.0003596113],"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.000028828474,0.000015452197,0.00021806172,0.000027268856,0.0000163396,0.000033445343,0.000026466103,0.9643102,0.00021321581,0.029038258,0.00023061999,0.0058418927],"study_design_scores_gemma":[0.0000071007003,0.000006195568,0.000028835555,0.0000026036907,0.0000020234254,0.000005814078,0.0000036053987,0.9881584,0.000072741066,0.01154043,0.00016926599,0.0000029995058],"about_ca_topic_score_codex":0.007945681,"about_ca_topic_score_gemma":0.007735048,"teacher_disagreement_score":0.007945681,"about_ca_system_score_codex":0.0019150678,"about_ca_system_score_gemma":0.0019264146,"threshold_uncertainty_score":0.015798867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026327735,0.002177528,0.9594924,0.00074731634,0.0002957739,0.000735456,0.008067493,0.006840693,0.019010475],"genre_scores_gemma":[0.06916197,0.0024848047,0.8647962,0.0011005558,0.0003414628,0.0010355965,0.03783154,0.00233954,0.020908352],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99246275,0.0016243635,0.00049319037,0.0024617729,0.0024201444,0.0005377101],"domain_scores_gemma":[0.99383014,0.0012165441,0.0003931941,0.0023481313,0.0019751978,0.00023679837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003429312,0.0026124462,0.0028753239,0.006708002,0.002982405,0.006115853,0.0060565146,0.0026949304,0.027587803],"category_scores_gemma":[0.012733254,0.0010737558,0.0039728587,0.008202929,0.0014567343,0.0050952816,0.0055894163,0.0023896464,0.023623632],"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.00029923566,0.00016739544,0.0042653447,0.0017765999,0.0008212059,0.00028669613,0.0007755331,0.07483504,0.004662727,0.13407712,0.23175183,0.54628134],"study_design_scores_gemma":[0.00008430688,0.00011906388,0.0028087837,0.0005067384,0.0002821847,0.00058651704,0.00073202566,0.31195626,0.00611871,0.2863572,0.3902747,0.00017354282],"about_ca_topic_score_codex":0.009738219,"about_ca_topic_score_gemma":0.016975138,"teacher_disagreement_score":0.027587803,"about_ca_system_score_codex":0.0033436823,"about_ca_system_score_gemma":0.0044331695,"threshold_uncertainty_score":0.0922904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32712913,0.0014612803,0.6143458,0.015135418,0.00032555062,0.0005161721,0.008263252,0.0033539368,0.029469462],"genre_scores_gemma":[0.8024409,0.001039634,0.17200717,0.0015949698,0.00057596934,0.0009142717,0.00800557,0.0012949737,0.012126517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917115,0.00243865,0.00045162294,0.002625091,0.0015300129,0.0012431506],"domain_scores_gemma":[0.96804774,0.022606317,0.0022587308,0.005132248,0.0010028622,0.000952134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031662574,0.0017385938,0.003089611,0.00091270206,0.0023144237,0.0070557,0.005142987,0.0027115417,0.012894889],"category_scores_gemma":[0.026800942,0.0010000265,0.0030737782,0.003184018,0.0036505784,0.01715843,0.0043887636,0.0081987595,0.0016045346],"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.001821713,0.00072732894,0.004288649,0.0009860252,0.0003719271,0.0004150856,0.0009886128,0.24480341,0.007322604,0.6250395,0.038025413,0.07520969],"study_design_scores_gemma":[0.00022535419,0.00008592414,0.0006696008,0.00006122022,0.000091420945,0.00025652748,0.00022548299,0.2643459,0.0045054965,0.7239191,0.005541414,0.00007247901],"about_ca_topic_score_codex":0.0035675126,"about_ca_topic_score_gemma":0.0036980305,"teacher_disagreement_score":0.012894889,"about_ca_system_score_codex":0.0051882705,"about_ca_system_score_gemma":0.004512896,"threshold_uncertainty_score":0.04313773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050632834,0.0016724363,0.90835977,0.0046658367,0.00022847223,0.00021775332,0.00073454826,0.002606232,0.030882105],"genre_scores_gemma":[0.6262766,0.0019217097,0.34549272,0.001351616,0.0006944245,0.0007331658,0.0010945756,0.0015544494,0.020880792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905319,0.002131623,0.00047908074,0.002684715,0.0029319183,0.001240741],"domain_scores_gemma":[0.9336608,0.045906115,0.0025874923,0.014039278,0.0024705264,0.001335724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005942049,0.0013012326,0.0013902334,0.0012067127,0.0016262819,0.005519009,0.004044384,0.0021174124,0.020213181],"category_scores_gemma":[0.03461989,0.0013769987,0.0025984563,0.0014023046,0.0044054408,0.019567367,0.011010356,0.0097548105,0.0035902713],"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.00067065103,0.00015462095,0.0013581396,0.0009189221,0.00016871648,0.0004094823,0.00090619014,0.052658364,0.015389269,0.84053546,0.010451841,0.07637831],"study_design_scores_gemma":[0.00012793946,0.00016117988,0.00032374723,0.00014163068,0.0001144265,0.00024099567,0.00014274272,0.14450191,0.012762557,0.8266282,0.014798924,0.00005569049],"about_ca_topic_score_codex":0.00094702566,"about_ca_topic_score_gemma":0.0012605637,"teacher_disagreement_score":0.020213181,"about_ca_system_score_codex":0.004147677,"about_ca_system_score_gemma":0.0031095732,"threshold_uncertainty_score":0.06761986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098385615,0.0008638729,0.97166675,0.0032704365,0.00021310503,0.00010270295,0.00023099947,0.00041070406,0.013402856],"genre_scores_gemma":[0.56576484,0.0023378942,0.39693084,0.0044216076,0.0020491532,0.0017315546,0.00060852885,0.001033998,0.02512161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902395,0.0033208681,0.00046275678,0.0023207087,0.0029579683,0.00069816236],"domain_scores_gemma":[0.9752993,0.019370621,0.0008948111,0.0025592078,0.0014422904,0.00043377292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010316803,0.0015676841,0.0023657582,0.001789511,0.0015577874,0.005157389,0.0034184682,0.0031218154,0.0062847957],"category_scores_gemma":[0.037633322,0.0010507156,0.002398315,0.0018507509,0.0069028214,0.012477725,0.0044886507,0.010922869,0.0013631625],"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.00005372411,0.00002958423,0.00026831668,0.0000833103,0.00004209244,0.00003262039,0.00008129881,0.022117773,0.000865053,0.96254694,0.0022006663,0.011678571],"study_design_scores_gemma":[0.00004874235,0.000060358165,0.000126432,0.000042086387,0.000016922724,0.000048111073,0.000014198813,0.14774354,0.0010006973,0.8468161,0.004062254,0.000020495918],"about_ca_topic_score_codex":0.0006913758,"about_ca_topic_score_gemma":0.0005233425,"teacher_disagreement_score":0.010316803,"about_ca_system_score_codex":0.0039299997,"about_ca_system_score_gemma":0.0025493684,"threshold_uncertainty_score":0.05456114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012857195,0.0013818338,0.97920245,0.0011574775,0.00007993784,0.0001442177,0.00018976683,0.00074006425,0.0042470624],"genre_scores_gemma":[0.48398092,0.0028897186,0.50070727,0.0016931382,0.0009300708,0.001262014,0.0014411458,0.0009778836,0.0061178147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99151915,0.0023355805,0.000432923,0.0012542459,0.0036728424,0.0007851595],"domain_scores_gemma":[0.94028395,0.048359275,0.002263736,0.005657926,0.0022574377,0.0011776729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010478422,0.0032145246,0.0032487742,0.0027815625,0.001214715,0.003760573,0.0043010353,0.0034393524,0.00525301],"category_scores_gemma":[0.08424353,0.0013775902,0.0020079797,0.0026802921,0.004930072,0.011319687,0.008592726,0.008715078,0.0014366179],"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.000886512,0.0003259648,0.0022093279,0.00047277077,0.00017293904,0.0002205142,0.00028504807,0.65492827,0.008278436,0.2288228,0.005548103,0.097849384],"study_design_scores_gemma":[0.00003093786,0.00007933752,0.00023568707,0.000044050932,0.000019338902,0.000079288584,0.00001889634,0.9194166,0.002427734,0.07667058,0.0009514858,0.000026109275],"about_ca_topic_score_codex":0.0015680015,"about_ca_topic_score_gemma":0.0016374369,"teacher_disagreement_score":0.010478422,"about_ca_system_score_codex":0.004284321,"about_ca_system_score_gemma":0.0028725965,"threshold_uncertainty_score":0.05541587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20448841,0.0010448534,0.7670898,0.0018400849,0.00015368598,0.0003799878,0.0018772668,0.012730601,0.010395281],"genre_scores_gemma":[0.6037959,0.00038486344,0.38575625,0.00034959434,0.00009940678,0.00035525986,0.0034033305,0.00082769734,0.005027739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754626,0.00031763347,0.00014285589,0.0006664221,0.0007400104,0.0005868749],"domain_scores_gemma":[0.9948139,0.0018748358,0.0004196036,0.0022347937,0.00037802718,0.00027878856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585611,0.0014883192,0.0015731765,0.0009949157,0.0013170865,0.0034600038,0.0040222737,0.0014620794,0.0057543125],"category_scores_gemma":[0.008584308,0.00063011615,0.0016875393,0.0019856328,0.0013356406,0.0063796253,0.0035011955,0.0030938867,0.0019551802],"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.0036343257,0.0006556169,0.008825307,0.0009734533,0.00022191959,0.00028327137,0.001315345,0.4539233,0.042924672,0.1553702,0.025084201,0.30678836],"study_design_scores_gemma":[0.00022915132,0.00013618846,0.0007629401,0.00004859053,0.000075644384,0.00014559785,0.0001517524,0.8860932,0.010038362,0.09721636,0.005062195,0.000040013685],"about_ca_topic_score_codex":0.005575371,"about_ca_topic_score_gemma":0.008349487,"teacher_disagreement_score":0.0057543125,"about_ca_system_score_codex":0.005128573,"about_ca_system_score_gemma":0.003566013,"threshold_uncertainty_score":0.037210584},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2728984,0.0002060497,0.7186985,0.0006945108,0.000042118143,0.00015921285,0.0005061695,0.00081465725,0.0059804097],"genre_scores_gemma":[0.88845354,0.00019703138,0.10539991,0.00014785593,0.00002696326,0.00026553095,0.00079578906,0.00009481125,0.004618544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987356,0.00026609458,0.00013095493,0.00036579845,0.00027579334,0.00022576026],"domain_scores_gemma":[0.99522746,0.0037718338,0.00037343576,0.00025999357,0.00021990518,0.00014728268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012192085,0.0006544464,0.0005454245,0.00048475622,0.00079623965,0.00211136,0.0012061077,0.0010799571,0.0037619094],"category_scores_gemma":[0.0048489515,0.00037218092,0.0011020136,0.0006438614,0.0022709689,0.00466979,0.0031288734,0.0019220472,0.000376793],"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.0007668614,0.00029898103,0.0017377244,0.00083581056,0.0000938037,0.0007486536,0.001104903,0.35810822,0.03112025,0.5555678,0.001122648,0.048494406],"study_design_scores_gemma":[0.00010341553,0.00016303577,0.00044150054,0.00006089698,0.00004307573,0.00018410194,0.00027825803,0.5007903,0.021563325,0.47429156,0.002019929,0.0000605546],"about_ca_topic_score_codex":0.0019154614,"about_ca_topic_score_gemma":0.0015975739,"teacher_disagreement_score":0.0037619094,"about_ca_system_score_codex":0.0012457597,"about_ca_system_score_gemma":0.0014813558,"threshold_uncertainty_score":0.012584865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1349722,0.00055043446,0.82029176,0.0012266601,0.000098232056,0.00007448517,0.00043160398,0.0014312137,0.040923383],"genre_scores_gemma":[0.6639266,0.0008098314,0.32214212,0.000374185,0.000089364934,0.0001241218,0.00068941404,0.00026670893,0.011577698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995598,0.00010719211,0.000016142092,0.00011183802,0.00012404866,0.00008101353],"domain_scores_gemma":[0.99822515,0.0008144338,0.0002270404,0.0004613103,0.00018254886,0.00008956115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032672784,0.00031381205,0.0002880539,0.00052514917,0.0010027182,0.0010646482,0.00083015306,0.0005412063,0.005771394],"category_scores_gemma":[0.003220163,0.00023343903,0.00030977506,0.0010313115,0.0011246143,0.0023261218,0.0014879671,0.0010361859,0.0010740606],"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.00011748351,0.000053387517,0.00074400153,0.00020853298,0.00001128561,0.000096827134,0.00027321102,0.043450776,0.018073946,0.82518065,0.0065676165,0.10522225],"study_design_scores_gemma":[0.000018512643,0.00008240071,0.0005746249,0.00003396797,0.000022123624,0.0002450578,0.0001453022,0.12142704,0.009774224,0.8412416,0.026403671,0.00003145187],"about_ca_topic_score_codex":0.0016710168,"about_ca_topic_score_gemma":0.0018846393,"teacher_disagreement_score":0.005771394,"about_ca_system_score_codex":0.0009083876,"about_ca_system_score_gemma":0.00063301256,"threshold_uncertainty_score":0.019307256},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022173362,0.00022990796,0.9528154,0.00029659178,0.00028461358,0.0001622541,0.00010568068,0.0073068575,0.016625334],"genre_scores_gemma":[0.26940313,0.00026895417,0.7075372,0.00027521662,0.000244503,0.00025135887,0.0006051562,0.0016617975,0.019752705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988631,0.00014198276,0.00006278517,0.0002635159,0.00045304286,0.0002156394],"domain_scores_gemma":[0.99902034,0.00025985145,0.00006546718,0.00033762655,0.00024937486,0.0000673071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009801128,0.0011615383,0.0011177416,0.001418173,0.0011625334,0.0014500328,0.0015875757,0.00060763996,0.028524457],"category_scores_gemma":[0.0028835847,0.00053506176,0.0011868095,0.00086067145,0.001004247,0.003047984,0.003538041,0.0013891013,0.00795351],"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.000644688,0.00025376494,0.0012881552,0.00030061044,0.000084623854,0.00035520218,0.00041526632,0.03326552,0.038507696,0.24753113,0.018070705,0.6592827],"study_design_scores_gemma":[0.00056176167,0.00051123044,0.0006420907,0.000112800255,0.000113940994,0.00091722794,0.0003350786,0.42989883,0.069814645,0.39019284,0.106794514,0.00010508355],"about_ca_topic_score_codex":0.0013311267,"about_ca_topic_score_gemma":0.0017051453,"teacher_disagreement_score":0.028524457,"about_ca_system_score_codex":0.00093162886,"about_ca_system_score_gemma":0.0012397658,"threshold_uncertainty_score":0.09542382},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17934711,0.00064825563,0.7746163,0.00901206,0.00011128175,0.00021160931,0.001280886,0.0006593936,0.034113057],"genre_scores_gemma":[0.951818,0.00048105518,0.040346712,0.0011146757,0.00024696093,0.00039493726,0.00075026875,0.00013217467,0.004715157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920677,0.002017798,0.000493898,0.0022384885,0.0020284348,0.0011536616],"domain_scores_gemma":[0.9427043,0.043689664,0.0026790346,0.0071859895,0.002282147,0.0014587978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005468748,0.0008720642,0.0014918908,0.0013452683,0.0015169638,0.0052538747,0.002495759,0.0029035334,0.007122457],"category_scores_gemma":[0.043744884,0.0007796019,0.0016236029,0.0012163422,0.008520776,0.016722256,0.006336492,0.0056582903,0.00064139586],"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.0002408215,0.00013839058,0.0017403759,0.0001823485,0.00007235629,0.0001158218,0.00040811286,0.022340853,0.0014097119,0.95117193,0.0014878482,0.020691516],"study_design_scores_gemma":[0.00004224156,0.00005437944,0.00042343908,0.000024085164,0.000017060673,0.00009347082,0.000081564416,0.05983963,0.0012460323,0.93736774,0.00079318776,0.000017256365],"about_ca_topic_score_codex":0.001334554,"about_ca_topic_score_gemma":0.0006775267,"teacher_disagreement_score":0.007122457,"about_ca_system_score_codex":0.0032441479,"about_ca_system_score_gemma":0.0017580765,"threshold_uncertainty_score":0.028921783},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050217385,0.0019460886,0.0067308764,0.07823841,0.8755384,0.00010771461,0.00388547,0.0015251169,0.031525724],"genre_scores_gemma":[0.019248003,0.009676376,0.016965982,0.1542845,0.14980042,0.0005376998,0.011610079,0.005234515,0.6326424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932769,0.00092245446,0.0010473633,0.0009151083,0.0034288953,0.0004093607],"domain_scores_gemma":[0.9648827,0.007937725,0.001618925,0.0034577854,0.02095974,0.001143167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037972252,0.0014789574,0.0011670336,0.0026961006,0.0043211905,0.0045990106,0.0022095176,0.004388739,0.16983469],"category_scores_gemma":[0.07248383,0.0007832223,0.0013232852,0.001961427,0.0020647056,0.0043293657,0.0029800409,0.007862017,0.10452777],"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.00004301719,0.000008799612,0.000068945265,0.0001140371,0.0000071255045,0.00009982452,0.000041418058,0.000060628972,0.000080283186,0.0043809316,0.98372644,0.011368649],"study_design_scores_gemma":[0.0000138101905,0.000013796579,0.0001289198,0.00017004937,0.0000109608045,0.00014378091,0.00005488112,0.00008722085,0.00027439123,0.0029784448,0.99610496,0.000018856123],"about_ca_topic_score_codex":0.0057117376,"about_ca_topic_score_gemma":0.0068406803,"teacher_disagreement_score":0.16983469,"about_ca_system_score_codex":0.0039981203,"about_ca_system_score_gemma":0.0045914375,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235186,0.0028230748,0.41278172,0.012871381,0.0006642513,0.0007279521,0.008265945,0.004905469,0.033441566],"genre_scores_gemma":[0.8899928,0.0010525385,0.08313656,0.0024527686,0.0005661776,0.0006395754,0.0062552076,0.0013216858,0.014582833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957417,0.00086527,0.0002779877,0.0013713158,0.000835629,0.00090810185],"domain_scores_gemma":[0.9441872,0.0473438,0.0023517092,0.0035714575,0.0014317888,0.0011139049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037044536,0.0013933185,0.0023517767,0.0012805144,0.0019512762,0.0037782122,0.003943408,0.0031540752,0.014348624],"category_scores_gemma":[0.04271818,0.0013274446,0.0028538923,0.0023812775,0.003369287,0.009816206,0.0023848156,0.0055566845,0.0017274414],"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.002270144,0.0007710591,0.006965221,0.0012249171,0.00036721816,0.0011792255,0.00040648857,0.4319607,0.005559067,0.42295337,0.04893082,0.077411726],"study_design_scores_gemma":[0.0003347788,0.00010936488,0.0013176143,0.000100857214,0.000062192405,0.0005400957,0.00013691565,0.41701385,0.002192932,0.57484806,0.0032821123,0.00006130667],"about_ca_topic_score_codex":0.0086994795,"about_ca_topic_score_gemma":0.012238987,"teacher_disagreement_score":0.014348624,"about_ca_system_score_codex":0.0037926373,"about_ca_system_score_gemma":0.0033142604,"threshold_uncertainty_score":0.04800093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092529245,0.0034072686,0.8811572,0.0024531959,0.00015622926,0.00014109157,0.0006524248,0.0008894586,0.018613907],"genre_scores_gemma":[0.7747181,0.0022686592,0.21207519,0.0007413092,0.00051422545,0.0004278529,0.0009619657,0.00023509079,0.0080576865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617565,0.0007977163,0.00044873985,0.001335368,0.00090080977,0.0003416119],"domain_scores_gemma":[0.9863783,0.0085468665,0.0016463563,0.0022327623,0.00087935216,0.00031648195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013340337,0.0007858175,0.00084134704,0.0016362929,0.001227481,0.0047510155,0.0012208767,0.0017971429,0.0037458318],"category_scores_gemma":[0.008667706,0.0008525586,0.0021486536,0.0021897368,0.006355742,0.008895815,0.0021020132,0.0039494075,0.0007184935],"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.00007266073,0.000048988546,0.0014079292,0.00018971314,0.000030389872,0.00014758862,0.0005600457,0.015279366,0.0038871411,0.9570241,0.00095023133,0.020401893],"study_design_scores_gemma":[0.000013053255,0.00006993027,0.0006925706,0.00006163913,0.000021651367,0.00028384302,0.00016753544,0.054608304,0.0041419417,0.9329744,0.006923662,0.000041487907],"about_ca_topic_score_codex":0.0025416524,"about_ca_topic_score_gemma":0.0016500163,"teacher_disagreement_score":0.0047510155,"about_ca_system_score_codex":0.0025585797,"about_ca_system_score_gemma":0.0012370321,"threshold_uncertainty_score":0.018563867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082137235,0.0021301596,0.89684457,0.0018260404,0.00015054694,0.00013732302,0.0003725522,0.00604703,0.010354492],"genre_scores_gemma":[0.635454,0.0010270387,0.35296905,0.0004902053,0.00025467557,0.00017965086,0.00057198375,0.00052895537,0.008524419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979971,0.00034639143,0.000119036005,0.00060762605,0.0005652539,0.00036457268],"domain_scores_gemma":[0.9947944,0.002676665,0.00037694824,0.0014190817,0.0004993768,0.00023346618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017959483,0.00091346627,0.0014977924,0.0011298761,0.0011048943,0.0021534192,0.0018971511,0.00087804074,0.0061088484],"category_scores_gemma":[0.008495785,0.0005328303,0.0013289017,0.0023135461,0.0018115409,0.008404231,0.0037249294,0.0027142856,0.0016752133],"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.001850671,0.00031638762,0.007652661,0.00080410263,0.00011885074,0.00049606716,0.0007515747,0.12469398,0.025781425,0.46018422,0.02237677,0.35497335],"study_design_scores_gemma":[0.00019396748,0.00026026982,0.0014825364,0.000099894394,0.00008336887,0.00066504837,0.00022473634,0.4199125,0.022603137,0.5302287,0.02415306,0.000092827824],"about_ca_topic_score_codex":0.0021922959,"about_ca_topic_score_gemma":0.002907328,"teacher_disagreement_score":0.0061088484,"about_ca_system_score_codex":0.0025407835,"about_ca_system_score_gemma":0.0017242425,"threshold_uncertainty_score":0.020436168},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.444351,0.0010485894,0.5048481,0.0035651799,0.00021842624,0.00043393532,0.0015411936,0.007297043,0.036696475],"genre_scores_gemma":[0.89402235,0.0003348805,0.09358407,0.00037441077,0.00011716986,0.0004859027,0.0023632413,0.00058128464,0.00813675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942061,0.0014699557,0.00047039724,0.0011448403,0.0017890886,0.00091962295],"domain_scores_gemma":[0.98695695,0.0076791993,0.0007376581,0.0031545756,0.0010144454,0.00045712906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023065798,0.0007971043,0.0012818255,0.00088522315,0.0016962917,0.0034593956,0.0021844597,0.001741147,0.009269659],"category_scores_gemma":[0.013633148,0.0006438724,0.0016166383,0.0018101705,0.0025326996,0.00918666,0.0047242665,0.0024079985,0.0018487769],"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.0025752096,0.00030891743,0.0030745817,0.0009718341,0.0001707337,0.00039261245,0.0016877261,0.5111321,0.02878493,0.24294874,0.015664894,0.19228764],"study_design_scores_gemma":[0.00024524704,0.00017425267,0.00076644344,0.00003678202,0.00006690463,0.00011273668,0.0002372346,0.715455,0.012971794,0.26509336,0.0047937017,0.000046577734],"about_ca_topic_score_codex":0.0032349883,"about_ca_topic_score_gemma":0.0023807848,"teacher_disagreement_score":0.009269659,"about_ca_system_score_codex":0.0024507362,"about_ca_system_score_gemma":0.0036456145,"threshold_uncertainty_score":0.031010091},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09143918,0.0007445538,0.8865502,0.0021564472,0.00009239036,0.00012816823,0.00021601563,0.0015741474,0.0170989],"genre_scores_gemma":[0.58880186,0.00056922704,0.40083292,0.0006625059,0.00032149768,0.00021483275,0.0005859016,0.00044235247,0.0075688986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979577,0.0004567599,0.00010530494,0.00056226813,0.00066666,0.00025131632],"domain_scores_gemma":[0.9924455,0.004407891,0.00061630004,0.0018431986,0.0003942402,0.0002928834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002239619,0.0006675078,0.000837131,0.0008197352,0.0012512255,0.002320719,0.0023108942,0.0011890891,0.0038481697],"category_scores_gemma":[0.0116097545,0.0005240843,0.00086962513,0.0017435107,0.0020850552,0.0068870676,0.0030745103,0.0031280632,0.00072860497],"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.0005853297,0.0003346479,0.0024791856,0.00033790554,0.000057151025,0.00012791221,0.00050871883,0.14497036,0.0075650876,0.721347,0.007034887,0.114651814],"study_design_scores_gemma":[0.000045628472,0.00006830577,0.0002306116,0.000017936693,0.000017811202,0.000120102144,0.00005678046,0.4878546,0.0047400836,0.5026817,0.004147908,0.000018559866],"about_ca_topic_score_codex":0.0012666218,"about_ca_topic_score_gemma":0.0015640946,"teacher_disagreement_score":0.0038481697,"about_ca_system_score_codex":0.001984468,"about_ca_system_score_gemma":0.0015832109,"threshold_uncertainty_score":0.014398336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1030743,0.0011744698,0.8813391,0.00082309206,0.00008820738,0.00013116954,0.00061770447,0.0065431898,0.0062087933],"genre_scores_gemma":[0.6754553,0.00043118082,0.3142348,0.0002695645,0.00016840569,0.00018672712,0.00082945044,0.00082587445,0.0075987657],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974016,0.00049725507,0.00014265889,0.00068213633,0.0008201416,0.000456189],"domain_scores_gemma":[0.9947878,0.002499837,0.00042122902,0.0016039578,0.00047752244,0.0002096263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022672508,0.0012610723,0.0019227562,0.0009988634,0.0009066992,0.0021537398,0.0019748379,0.0008310414,0.006701384],"category_scores_gemma":[0.008154328,0.00057635544,0.0014944837,0.0018166172,0.0013178437,0.006778151,0.0038869663,0.0024590571,0.0019938822],"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.0028043666,0.00024708814,0.008217995,0.00082020456,0.00025014792,0.00057845336,0.0006340308,0.18272538,0.032261115,0.1930268,0.019301675,0.55913264],"study_design_scores_gemma":[0.00020672518,0.00024759056,0.0013637248,0.00007694537,0.00008448241,0.00031038895,0.00013482817,0.70998126,0.027154392,0.2506267,0.009746817,0.000066128436],"about_ca_topic_score_codex":0.0020880795,"about_ca_topic_score_gemma":0.0032803442,"teacher_disagreement_score":0.006701384,"about_ca_system_score_codex":0.001869026,"about_ca_system_score_gemma":0.0015000862,"threshold_uncertainty_score":0.02241832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13427451,0.0031052146,0.7425483,0.010131288,0.00024708352,0.00014373532,0.00076028006,0.0016930427,0.10709655],"genre_scores_gemma":[0.86877334,0.0013720527,0.116724014,0.00074743305,0.00029838388,0.00023427521,0.00072534016,0.00031075638,0.0108143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941744,0.0020801716,0.00040391626,0.0012644812,0.0014354901,0.00064164196],"domain_scores_gemma":[0.97198886,0.02230297,0.0010774208,0.002772311,0.0012005257,0.0006578903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003421465,0.0005059145,0.0007063225,0.0013793587,0.0013409384,0.0045263856,0.0017212172,0.0014263394,0.013797376],"category_scores_gemma":[0.025165215,0.00068421796,0.0015709904,0.0016951753,0.006063657,0.0141537115,0.0037156756,0.0048755636,0.0011967061],"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.00006609811,0.000019640232,0.00040770497,0.0000994431,0.000012321655,0.00005899303,0.00020434601,0.0052359197,0.0003557759,0.97765267,0.0012209084,0.014666103],"study_design_scores_gemma":[0.000022248549,0.00001937716,0.00021165841,0.000027665588,0.000010758192,0.00011978904,0.000060586462,0.016057348,0.00070907,0.9770607,0.0056874156,0.000013567929],"about_ca_topic_score_codex":0.0026824726,"about_ca_topic_score_gemma":0.0012908352,"teacher_disagreement_score":0.013797376,"about_ca_system_score_codex":0.0041267974,"about_ca_system_score_gemma":0.0019368569,"threshold_uncertainty_score":0.046156824},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017136233,0.0005690796,0.99060655,0.00060593314,0.00019775439,0.000060023176,0.00020917067,0.0023908883,0.0036470117],"genre_scores_gemma":[0.08049955,0.0011493682,0.89402044,0.0008262617,0.000615621,0.00050767907,0.002365429,0.0020408472,0.01797487],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809355,0.0004088498,0.00010282404,0.0005224062,0.0005935902,0.00027879525],"domain_scores_gemma":[0.99678016,0.0017576318,0.00025288312,0.000524503,0.0005414383,0.00014330925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021622088,0.0024718023,0.0017398413,0.0011735986,0.0009517455,0.0027203797,0.0033596617,0.0023886429,0.018463999],"category_scores_gemma":[0.011234327,0.00088943023,0.0016585932,0.0019754234,0.0014641358,0.003294105,0.0035068963,0.00512942,0.015271558],"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.0003756258,0.00021760014,0.0014180038,0.0005109292,0.00013740921,0.00022141398,0.00014659001,0.19035408,0.0047103604,0.1142273,0.082692266,0.6049885],"study_design_scores_gemma":[0.000045553305,0.000044109398,0.0002315458,0.000046461333,0.000017148825,0.0001027202,0.000043884873,0.921212,0.0022419484,0.064576715,0.0114168115,0.000021149292],"about_ca_topic_score_codex":0.0050086416,"about_ca_topic_score_gemma":0.008237753,"teacher_disagreement_score":0.018463999,"about_ca_system_score_codex":0.0016657036,"about_ca_system_score_gemma":0.0027760882,"threshold_uncertainty_score":0.061768234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042394556,0.00023501045,0.94486344,0.00051381293,0.00006095308,0.00016121744,0.000623652,0.004620914,0.0065264646],"genre_scores_gemma":[0.29145688,0.00015187038,0.70192796,0.00017951128,0.00006781746,0.00022464366,0.0017968571,0.0007996465,0.0033948158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901533,0.00017566132,0.00006251939,0.000295905,0.0002881627,0.00016237327],"domain_scores_gemma":[0.9978009,0.0011377688,0.00020466083,0.00047576084,0.0002952723,0.00008565202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085275515,0.0014515138,0.000858074,0.0011219595,0.00076075655,0.0016016802,0.0016605692,0.0012780068,0.0060653016],"category_scores_gemma":[0.00734357,0.00059675495,0.00092579104,0.0015275715,0.0008578877,0.0039030025,0.0013965154,0.001656682,0.0015210913],"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.00052180677,0.00022087115,0.0021273184,0.0003125757,0.00009184873,0.0001324299,0.00023242524,0.6082665,0.0088901725,0.06833792,0.0135226175,0.29734355],"study_design_scores_gemma":[0.000037366557,0.000025679748,0.0002387086,0.000012560424,0.00001063953,0.00004999516,0.000036713744,0.9297438,0.0028540036,0.06524307,0.0017379053,0.0000095064115],"about_ca_topic_score_codex":0.0062708594,"about_ca_topic_score_gemma":0.007973064,"teacher_disagreement_score":0.0062708594,"about_ca_system_score_codex":0.0020312297,"about_ca_system_score_gemma":0.0026053467,"threshold_uncertainty_score":0.020290494},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020024773,0.000113639304,0.97384214,0.00029123056,0.00002677884,0.00009583737,0.0001888166,0.0008524111,0.004564449],"genre_scores_gemma":[0.16921502,0.00017347337,0.82376325,0.00016285392,0.000040508523,0.00022359614,0.0006565536,0.00031561012,0.0054490874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.00010291171,0.00002479685,0.00016137026,0.00019047421,0.000090919435],"domain_scores_gemma":[0.99903154,0.00056092953,0.00009394523,0.00017704227,0.00008385501,0.000052732783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007445357,0.0012288919,0.0009081128,0.0005463093,0.00052390475,0.0010071271,0.0012858834,0.0009021913,0.007970851],"category_scores_gemma":[0.0039599994,0.00064089336,0.0008340489,0.00087434566,0.0008335814,0.0029159593,0.00204367,0.0017065566,0.0013376169],"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.00043112907,0.00015062679,0.0008801426,0.0004272403,0.000054998633,0.00016637173,0.00029717095,0.55249983,0.0112248855,0.127169,0.010702487,0.29599613],"study_design_scores_gemma":[0.000049705905,0.0000862343,0.00012169037,0.000016384438,0.000010328038,0.00006706756,0.000036043028,0.9168012,0.003003065,0.075710334,0.004086116,0.000011760798],"about_ca_topic_score_codex":0.0032197544,"about_ca_topic_score_gemma":0.00446638,"teacher_disagreement_score":0.007970851,"about_ca_system_score_codex":0.0010052009,"about_ca_system_score_gemma":0.0014589264,"threshold_uncertainty_score":0.026665092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49887967,0.00074523955,0.429138,0.005445853,0.00012448717,0.00024276378,0.001322229,0.0021801232,0.061921507],"genre_scores_gemma":[0.9651106,0.00023852041,0.029824967,0.00043861373,0.00014944558,0.00019519877,0.00046065988,0.00030409076,0.003277969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994341,0.00089764834,0.00019639604,0.0014036362,0.001692545,0.0014687383],"domain_scores_gemma":[0.96770376,0.019904556,0.0017923419,0.0084231235,0.0009283396,0.0012478791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032436838,0.00082974177,0.0016779447,0.0011818745,0.0017757812,0.004620527,0.0034073698,0.0017081163,0.0087961955],"category_scores_gemma":[0.01779261,0.00069082715,0.0018952326,0.00092570984,0.0034377251,0.0104949325,0.006323278,0.007324522,0.00077955064],"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.0010051867,0.0001671521,0.0023434858,0.0004816713,0.00010519684,0.00018697363,0.00044507647,0.056864157,0.017792057,0.8786317,0.0036935597,0.038283803],"study_design_scores_gemma":[0.00009256583,0.00016636099,0.0018611763,0.000056274388,0.000064496264,0.00036963573,0.00007949611,0.30642095,0.018304657,0.6659427,0.0065862555,0.000055338038],"about_ca_topic_score_codex":0.0005533356,"about_ca_topic_score_gemma":0.00037905868,"teacher_disagreement_score":0.0087961955,"about_ca_system_score_codex":0.0023531648,"about_ca_system_score_gemma":0.0027937721,"threshold_uncertainty_score":0.029426157},"labels":[],"label_agreement":null}]}