{"meta":{"query_hash":"c43675f49fc6","filters":{"venue":"Theory of Computing Systems"},"cohort_total":83,"direct_labels_cover":0,"predictions_cover":83,"exported":83,"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/c43675f49fc6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Theory+of+Computing+Systems"},"results":[{"id":"W1533036729","doi":"10.1007/s00224-013-9515-7","title":"Quotient Complexity of Closed Languages","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Suffix; Concatenation (mathematics); Prefix; Closure (psychology); Regular language; Complement (music); Subsequence; Formal language; Abstract family of languages; Mathematics; Quotient; Computer science; Discrete mathematics; Transitive closure; Word (group theory); Combinatorics; Theoretical computer science; Algorithm; Automaton; Linguistics; Programming language","score_opus":0.024427312795081518,"score_gpt":0.2479190127007407,"score_spread":0.2234916999056592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533036729","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.55083513,0.0029606828,0.30514854,0.008036699,0.00030662856,0.00009697003,0.0009273144,0.0005535056,0.13113444],"genre_scores_gemma":[0.97707987,0.0005510002,0.010390798,0.00024829357,0.00031571934,0.00008974211,0.00046166655,0.00008979776,0.010772927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976497,0.0006245903,0.0001432817,0.0004355269,0.0008154596,0.0003313573],"domain_scores_gemma":[0.99259925,0.0050413627,0.00035339428,0.0006538259,0.0007293176,0.00062281825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016991955,0.00067491375,0.0014345427,0.0021885755,0.0017807982,0.00602391,0.0019240481,0.0011450105,0.00910635],"category_scores_gemma":[0.008268035,0.00049489044,0.0013882754,0.0018953598,0.004562197,0.016307471,0.0033234102,0.003919006,0.0005316997],"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.00003711844,0.000014903803,0.0002420385,0.000024002842,0.000006457863,0.00003075361,0.00026067428,0.0009822876,0.00025551004,0.99559844,0.00043241412,0.0021153998],"study_design_scores_gemma":[0.000007987701,0.000004875739,0.00010152792,0.0000031709915,0.0000047261783,0.000021279988,0.000035100766,0.0048117638,0.00016020151,0.9942075,0.00063673494,0.0000050802846],"about_ca_topic_score_codex":0.00224263,"about_ca_topic_score_gemma":0.0013391434,"teacher_disagreement_score":0.00910635,"about_ca_system_score_codex":0.0036026186,"about_ca_system_score_gemma":0.0011497955,"threshold_uncertainty_score":0.030463755},"labels":[],"label_agreement":null},{"id":"W1602585208","doi":"10.1007/s00224-003-1126-2","title":"Asymmetric Communication Protocols via Hotlink Assignments","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Computer science; Protocol (science); Communications protocol; Theoretical computer science; Computer network; Distributed computing","score_opus":0.03579338451336043,"score_gpt":0.28659772980480025,"score_spread":0.2508043452914398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602585208","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.08163315,0.0004194348,0.8784667,0.0020248422,0.00035672076,0.0002697949,0.000260152,0.0012704632,0.03529869],"genre_scores_gemma":[0.85452086,0.00062565034,0.113704234,0.0009032237,0.00062414084,0.0006576888,0.0004200863,0.00045754013,0.028086638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941855,0.00256895,0.0002504755,0.0007673334,0.0013468174,0.00088098383],"domain_scores_gemma":[0.97234964,0.015311142,0.001964613,0.00727717,0.0016003676,0.0014970081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004124307,0.0009258536,0.0015363912,0.0019869825,0.0034825208,0.0059738597,0.003654625,0.0023370641,0.015894163],"category_scores_gemma":[0.02018959,0.0011136709,0.0008627249,0.002813976,0.0038921617,0.01712411,0.009587073,0.0048609637,0.00237498],"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.00037421103,0.00014743314,0.00025644223,0.0001000453,0.000026958613,0.0000699444,0.00038421777,0.019024033,0.0015311063,0.94337964,0.0049505974,0.029755384],"study_design_scores_gemma":[0.000060722887,0.000042130403,0.000088832516,0.000017448474,0.000028006745,0.000062546555,0.000113724534,0.09627722,0.0019144268,0.89666486,0.0047013336,0.00002879479],"about_ca_topic_score_codex":0.00040849633,"about_ca_topic_score_gemma":0.0005962853,"teacher_disagreement_score":0.015894163,"about_ca_system_score_codex":0.0016372879,"about_ca_system_score_gemma":0.0012601682,"threshold_uncertainty_score":0.053171337},"labels":[],"label_agreement":null},{"id":"W1965378629","doi":"10.1007/s00224-011-9349-0","title":"Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Speedup; Multiprocessing; Competitive analysis; Scaling; Parallel computing; Computer science; Upper and lower bounds; Constant (computer programming); Omega; Randomized algorithm; Mathematics; Algorithm; Physics; Mathematical analysis; Geometry","score_opus":0.05319425553936011,"score_gpt":0.25109109421144404,"score_spread":0.19789683867208394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965378629","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.9198286,0.00096679275,0.060840912,0.0009898494,0.00015507228,0.000047971258,0.00014418489,0.0015781164,0.015448435],"genre_scores_gemma":[0.9862488,0.00022181326,0.011719825,0.000044266715,0.00003761327,0.000029299335,0.0000670593,0.00014202873,0.0014893934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999691,0.00007825029,0.000013232963,0.00004981957,0.00007774025,0.00008998448],"domain_scores_gemma":[0.9972275,0.0015968987,0.00014154924,0.0004536354,0.00038433398,0.00019604995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005257269,0.00047038184,0.00040570932,0.0009074088,0.00053861237,0.0009294757,0.00070090685,0.0006662882,0.0048363106],"category_scores_gemma":[0.0073108296,0.0003139922,0.00025722192,0.0009414168,0.00078574044,0.0017425142,0.00068038254,0.00078207866,0.00044394616],"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.0030479385,0.00043902136,0.0074512055,0.00035236144,0.000086071326,0.00046202686,0.0007816049,0.647944,0.08355566,0.12743726,0.010139835,0.11830307],"study_design_scores_gemma":[0.00007873023,0.00016386798,0.0021481249,0.000014898107,0.000019451893,0.000081576865,0.00010862647,0.95064116,0.014963985,0.030089615,0.001669721,0.000020193598],"about_ca_topic_score_codex":0.000968451,"about_ca_topic_score_gemma":0.000630558,"teacher_disagreement_score":0.0048363106,"about_ca_system_score_codex":0.0005597995,"about_ca_system_score_gemma":0.00046773872,"threshold_uncertainty_score":0.016179085},"labels":[],"label_agreement":null},{"id":"W1971393213","doi":"10.1007/s00224-007-1345-z","title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parameterized complexity; Feedback vertex set; Combinatorics; Undirected graph; Mathematics; Vertex (graph theory); Algorithm; Bounded function; Running time; Exponential function; Vertex cover; Function (biology); Time complexity; Binary logarithm; Graph; Exponential time hypothesis; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.02914474183978229,"score_gpt":0.31721327122112886,"score_spread":0.2880685293813466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971393213","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.047406815,0.0013975232,0.89251876,0.004169851,0.0008341281,0.0008919765,0.002239704,0.013040856,0.037500292],"genre_scores_gemma":[0.22729482,0.00040574695,0.7500528,0.0010914758,0.00033816358,0.00103231,0.0033438678,0.0012380455,0.015202668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977512,0.0003905673,0.00010600503,0.0007564813,0.0006009813,0.00039473182],"domain_scores_gemma":[0.995402,0.0029236432,0.00023188279,0.00085821556,0.00033407717,0.00025025354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012498528,0.0020862988,0.0022264484,0.0013384771,0.0016818861,0.002987751,0.0036602656,0.0033703474,0.024281813],"category_scores_gemma":[0.008026271,0.00074622873,0.0018037442,0.0022329458,0.0011015591,0.0054625818,0.0027995051,0.00333856,0.0054651704],"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.0017859368,0.0009778644,0.0012405835,0.0010204406,0.00023230136,0.00032492034,0.00028674697,0.13394554,0.011664667,0.045029063,0.07401678,0.7294751],"study_design_scores_gemma":[0.0011914849,0.00028455452,0.0010396072,0.00012306432,0.00020048062,0.000508047,0.0002415227,0.8070819,0.0056341505,0.16874234,0.014874009,0.00007891982],"about_ca_topic_score_codex":0.0064449445,"about_ca_topic_score_gemma":0.009393606,"teacher_disagreement_score":0.024281813,"about_ca_system_score_codex":0.0030319141,"about_ca_system_score_gemma":0.003377664,"threshold_uncertainty_score":0.0812307},"labels":[],"label_agreement":null},{"id":"W1973664142","doi":"10.1007/s00224-012-9382-7","title":"(Approximate) Uncertain Skylines","year":2012,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Skyline; Point (geometry); Probability distribution; Set (abstract data type); Simple (philosophy); Computer science; Lying; Construct (python library); Mathematical optimization; Algorithm; Mathematics; Data mining; Statistics; Geometry","score_opus":0.031101281482397936,"score_gpt":0.2640454652165077,"score_spread":0.23294418373410974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973664142","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.034893367,0.0011139951,0.95764476,0.00082273653,0.00012416809,0.000031488467,0.0009452645,0.0003627452,0.004061527],"genre_scores_gemma":[0.7780836,0.001966416,0.20988701,0.00026581384,0.00043519028,0.000118595824,0.0022039118,0.00018361544,0.006855916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985159,0.00041142825,0.000090605325,0.00038528146,0.00046897537,0.00012782372],"domain_scores_gemma":[0.99328095,0.0040418976,0.0006774959,0.0009672609,0.00083580386,0.00019656458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018302902,0.00078741676,0.0013530537,0.0020933582,0.0006880626,0.002805951,0.0019581593,0.0020575644,0.0066347746],"category_scores_gemma":[0.020258032,0.0008924336,0.000833068,0.0031199756,0.0015251167,0.0068449997,0.0018110581,0.002036271,0.00074145786],"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.0003326747,0.00002924564,0.0033661544,0.00034521444,0.000088272674,0.00018385643,0.00017147702,0.7182695,0.0014026753,0.21757548,0.0063118376,0.051923636],"study_design_scores_gemma":[0.0000126235855,0.000015667141,0.00047611183,0.000020790278,0.000012458954,0.000095971955,0.00003515693,0.87619305,0.00036111104,0.12037065,0.0023937088,0.000012758169],"about_ca_topic_score_codex":0.0039116303,"about_ca_topic_score_gemma":0.0037285767,"teacher_disagreement_score":0.0066347746,"about_ca_system_score_codex":0.0015434875,"about_ca_system_score_gemma":0.0006945921,"threshold_uncertainty_score":0.022195518},"labels":[],"label_agreement":null},{"id":"W1975859913","doi":"10.1007/s00224-013-9455-2","title":"Linear-Space Data Structures for Range Mode Query in Arrays","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Range (aeronautics); Mode (computer interface); Space (punctuation); Range query (database); Computer science; Information retrieval; Web search query; Sargable; Engineering; Aerospace engineering; Search engine","score_opus":0.0389336755502249,"score_gpt":0.29434127082161676,"score_spread":0.25540759527139184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975859913","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.02962,0.001697306,0.95172447,0.00133195,0.00019862251,0.0001872978,0.0013099345,0.006959034,0.0069713825],"genre_scores_gemma":[0.39484206,0.0010216206,0.5876059,0.0010522058,0.00037271803,0.0006714187,0.00288458,0.0012001822,0.0103493165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976279,0.00045563112,0.00028675847,0.00026924777,0.0010872582,0.00027322714],"domain_scores_gemma":[0.99296606,0.0026574223,0.00040872808,0.002745682,0.0010576445,0.00016443609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563429,0.00062719587,0.0010693856,0.0016471604,0.0010490417,0.0031085338,0.001900144,0.0010656299,0.011503442],"category_scores_gemma":[0.010749016,0.00051758834,0.0006905168,0.00412854,0.0014475542,0.0067440188,0.0033083807,0.001996042,0.0030240389],"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.0018693528,0.00045883044,0.0032201377,0.0007805437,0.00011160835,0.00018567602,0.0011424738,0.037148446,0.022458006,0.33996257,0.06224879,0.53041357],"study_design_scores_gemma":[0.0003048484,0.00050270924,0.0009500705,0.00019755079,0.000107074935,0.0004859223,0.00063347636,0.3464732,0.045812663,0.57041055,0.033984672,0.00013730886],"about_ca_topic_score_codex":0.0016589897,"about_ca_topic_score_gemma":0.0023895327,"teacher_disagreement_score":0.011503442,"about_ca_system_score_codex":0.0013416512,"about_ca_system_score_gemma":0.001660068,"threshold_uncertainty_score":0.038482785},"labels":[],"label_agreement":null},{"id":"W1976011284","doi":"10.1007/s00224-007-9085-7","title":"A Randomized Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Online algorithm; Randomized algorithm; Cluster analysis; Partition (number theory); Upper and lower bounds; Extension (predicate logic); Computer science; Set (abstract data type); Mathematics; Combinatorics; Unit (ring theory); Algorithm; Artificial intelligence","score_opus":0.04092833779722757,"score_gpt":0.3136730632364606,"score_spread":0.272744725439233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976011284","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.010135339,0.00031881785,0.9832882,0.0005108789,0.00018323399,0.0002738194,0.00024418026,0.0022249222,0.0028205547],"genre_scores_gemma":[0.13441776,0.00017920848,0.856681,0.00035601392,0.0001776903,0.00073167525,0.00085092697,0.0004617096,0.006144099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964185,0.0012892835,0.00020289706,0.0009005191,0.00073145935,0.00045735686],"domain_scores_gemma":[0.9924453,0.003962278,0.00045237888,0.0017373933,0.00089170184,0.00051099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031166405,0.0016781458,0.0037821915,0.002057724,0.0023733838,0.0023854533,0.007577334,0.003874513,0.012301389],"category_scores_gemma":[0.014582922,0.001351229,0.0017753815,0.0039107497,0.0018112195,0.004698691,0.004733569,0.0031716905,0.003653806],"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.0020751753,0.0008811692,0.0009051385,0.000424417,0.00021383831,0.0001028334,0.0002492089,0.43420208,0.004632124,0.08764973,0.035209678,0.43345454],"study_design_scores_gemma":[0.00027888926,0.00010963045,0.00013663039,0.000015384852,0.000031116306,0.000051777657,0.000034534707,0.9602669,0.0010361528,0.03614939,0.0018626044,0.000027119606],"about_ca_topic_score_codex":0.007180906,"about_ca_topic_score_gemma":0.009716865,"teacher_disagreement_score":0.012301389,"about_ca_system_score_codex":0.003366675,"about_ca_system_score_gemma":0.005099775,"threshold_uncertainty_score":0.04115224},"labels":[],"label_agreement":null},{"id":"W1978605527","doi":"10.1007/s00224-003-1109-3","title":"Nesting Until and Since in Linear Temporal Logic","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Linear temporal logic; Nesting (process); Characterization (materials science); Temporal logic; Hierarchy; Property (philosophy); Interval temporal logic; Class (philosophy); Mathematics; Computation tree logic; Algebraic number; Semigroup; Discrete mathematics; Substitution (logic); Computer science; Algebra over a field; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.021368154774561464,"score_gpt":0.24649091455748412,"score_spread":0.22512275978292265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978605527","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.05003611,0.0042864876,0.8929422,0.004173083,0.00081563304,0.00010065223,0.0003855676,0.0015488266,0.04571149],"genre_scores_gemma":[0.74287647,0.0022679255,0.22599189,0.0013909995,0.00087134686,0.00017774255,0.00046865825,0.0006993565,0.025255585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659437,0.001522722,0.00029305555,0.0006871937,0.0005502396,0.00035228734],"domain_scores_gemma":[0.9913224,0.00580027,0.0006195341,0.0011739017,0.00066772895,0.00041612264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042757555,0.0008174595,0.0013460059,0.00146068,0.003878002,0.006537159,0.0022375858,0.0016200528,0.0055911047],"category_scores_gemma":[0.010536814,0.0016946847,0.0017370064,0.0023619304,0.007977165,0.02039082,0.0034035651,0.004566599,0.0012164592],"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.000042766816,0.000013390937,0.00013126568,0.000036182715,0.0000052293935,0.00005271321,0.0005957673,0.0007672935,0.0002583088,0.99022686,0.000716261,0.0071538487],"study_design_scores_gemma":[0.000009368611,0.000008701232,0.000022724524,0.000013173638,0.000015504245,0.000041322062,0.0000567212,0.003624971,0.00024921627,0.99297184,0.002975048,0.000011392627],"about_ca_topic_score_codex":0.00439486,"about_ca_topic_score_gemma":0.0054382407,"teacher_disagreement_score":0.006537159,"about_ca_system_score_codex":0.0026113421,"about_ca_system_score_gemma":0.0022840078,"threshold_uncertainty_score":0.022612631},"labels":[],"label_agreement":null},{"id":"W1981571357","doi":"10.1007/s00224-010-9249-8","title":"TCP is Competitive with Resource Augmentation","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; TCP tuning; TCP Friendly Rate Control; TCP Westwood plus; Computer network; TCP global synchronization; Competitive analysis; CUBIC TCP; Zeta-TCP; TCP acceleration; Network congestion; Distributed computing; H-TCP; HSTCP; Compound TCP; Algorithm; Upper and lower bounds; Mathematics","score_opus":0.006263938891815592,"score_gpt":0.20935521562677786,"score_spread":0.20309127673496227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981571357","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.1709359,0.0071845404,0.54880714,0.034394544,0.004699336,0.00038698208,0.0010855116,0.0049035493,0.22760245],"genre_scores_gemma":[0.95532024,0.0012676977,0.025624854,0.00230866,0.0018303326,0.0002446242,0.00020238404,0.00063992204,0.012561308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911062,0.0025229098,0.00027395968,0.0011071687,0.0031968514,0.0017928383],"domain_scores_gemma":[0.9539473,0.028680703,0.0017328208,0.0077889715,0.0055577853,0.0022923592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007708216,0.0018617591,0.0040124515,0.0021240837,0.0044038347,0.01096319,0.0053001773,0.005687333,0.01801483],"category_scores_gemma":[0.057305127,0.0014070421,0.0013952439,0.0029174874,0.004784611,0.016866738,0.006277828,0.007146723,0.0027795976],"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.0012241795,0.0002502291,0.0011364161,0.00033052673,0.00012261419,0.00019053025,0.00018085241,0.059839565,0.003487995,0.8535193,0.02942275,0.05029511],"study_design_scores_gemma":[0.00011327487,0.00014679115,0.00028484172,0.00004471364,0.000076130134,0.00026797986,0.00009071717,0.3346487,0.0010514248,0.65304387,0.010179826,0.000051728734],"about_ca_topic_score_codex":0.0042591747,"about_ca_topic_score_gemma":0.0035046807,"teacher_disagreement_score":0.01801483,"about_ca_system_score_codex":0.004711835,"about_ca_system_score_gemma":0.0058528343,"threshold_uncertainty_score":0.0602656},"labels":[],"label_agreement":null},{"id":"W1985257126","doi":"10.1007/s00224-008-9110-5","title":"Structural Recursion as a Query Language on Lists and Ordered Trees","year":2008,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Recursion (computer science); Computer science; Query language; Query optimization; Programming language; Theoretical computer science; Information retrieval","score_opus":0.021331400591311594,"score_gpt":0.2570534105745805,"score_spread":0.2357220099832689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985257126","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.016633803,0.0012081895,0.9672867,0.0026430727,0.00014860262,0.00009068912,0.00051797763,0.0014441337,0.0100267995],"genre_scores_gemma":[0.43293375,0.002117697,0.54741514,0.0013605591,0.0005043762,0.00047848403,0.0014707715,0.0011066005,0.01261264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923201,0.0031660723,0.00089718984,0.0009931887,0.0020114323,0.00061201764],"domain_scores_gemma":[0.9847644,0.0103360545,0.00083473854,0.0018668632,0.0017430943,0.00045488117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007715653,0.00077905826,0.0021602055,0.003971736,0.0030445897,0.010393993,0.0039222795,0.0033067523,0.007434961],"category_scores_gemma":[0.021767868,0.0016763749,0.0027088765,0.008337765,0.008862937,0.03264302,0.0054977178,0.0045384704,0.0015396563],"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.000020469366,0.000008152671,0.000078742276,0.00003465055,0.0000053418257,0.000024221727,0.00038871804,0.0014136772,0.0002546112,0.9934282,0.0007490472,0.0035941668],"study_design_scores_gemma":[0.000016661841,0.000010393852,0.000035900382,0.000022984395,0.000018759407,0.000050611146,0.00009650849,0.01563833,0.00041491026,0.97779936,0.0058758743,0.000019810821],"about_ca_topic_score_codex":0.009158516,"about_ca_topic_score_gemma":0.007981608,"teacher_disagreement_score":0.010393993,"about_ca_system_score_codex":0.00504132,"about_ca_system_score_gemma":0.0035771076,"threshold_uncertainty_score":0.040804803},"labels":[],"label_agreement":null},{"id":"W199219868","doi":"10.1007/s00224-016-9687-z","title":"Stable Marriage with General Preferences","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Stable marriage problem; Generalization; Mathematics; Transitive relation; Matching (statistics); Combinatorics; Partition (number theory); Class (philosophy); Time complexity; Linear programming; Mathematical economics; Mathematical optimization; Computer science","score_opus":0.03372601474166294,"score_gpt":0.20648129487590292,"score_spread":0.17275528013423996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199219868","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.36533695,0.0013321816,0.5153518,0.007393514,0.0002348115,0.00014758097,0.0006680467,0.00025829903,0.10927675],"genre_scores_gemma":[0.9618019,0.0004783476,0.016290061,0.00039518933,0.00021783078,0.000109617045,0.00026124044,0.000045495075,0.02040029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751794,0.0012897905,0.000082997125,0.00041145392,0.00034416182,0.00035371297],"domain_scores_gemma":[0.9902929,0.0060581295,0.0008365901,0.0011633738,0.0009458388,0.0007031535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021019413,0.0004994303,0.001596267,0.0012251636,0.0025485174,0.0042144894,0.0018205375,0.0024446188,0.012960995],"category_scores_gemma":[0.015341199,0.0005980879,0.0011048297,0.00203731,0.0034233045,0.006786116,0.0021557298,0.0026211592,0.0011161136],"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.000019358396,0.000015083322,0.00019238591,0.000013943474,0.0000090910435,0.000038961192,0.0001436412,0.0022447426,0.000077348035,0.9941902,0.0007295164,0.0023258103],"study_design_scores_gemma":[0.000011109082,0.0000049082296,0.000079302874,0.0000027482724,0.0000028150296,0.000021377467,0.00004332272,0.011185824,0.00002046565,0.9881374,0.00048678907,0.0000040091522],"about_ca_topic_score_codex":0.002833458,"about_ca_topic_score_gemma":0.002156692,"teacher_disagreement_score":0.012960995,"about_ca_system_score_codex":0.0015334988,"about_ca_system_score_gemma":0.001226025,"threshold_uncertainty_score":0.043358862},"labels":[],"label_agreement":null},{"id":"W1993150073","doi":"10.1007/s00224-001-0008-8","title":"A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Row; Combinatorics; Time complexity; Grid; Vertex (graph theory); Partition (number theory); Mathematics; Minimum weight; Dynamic programming; Running time; Graph; Algorithm; Discrete mathematics; Computer science","score_opus":0.015498261918100999,"score_gpt":0.24527259525212397,"score_spread":0.22977433333402297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993150073","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.028679797,0.00036833208,0.9597318,0.0003494949,0.00006956494,0.00024233545,0.0006428284,0.00308266,0.006833078],"genre_scores_gemma":[0.115151174,0.00018872514,0.87726283,0.00012123058,0.000030658794,0.00016638901,0.0015269449,0.0004139647,0.0051381188],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993654,0.000115110946,0.00005208903,0.00013012394,0.00019279387,0.00014451648],"domain_scores_gemma":[0.99859935,0.00057207845,0.00010122761,0.000369942,0.00021009923,0.00014733433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006863761,0.0010228378,0.0012958414,0.0014228995,0.0010238258,0.0016817973,0.0021352933,0.0009001164,0.0109538],"category_scores_gemma":[0.0029631741,0.0009078005,0.0008496613,0.0021808199,0.0007507213,0.002729017,0.0025308272,0.0014039121,0.0029425118],"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.0009703039,0.00026693795,0.0009888608,0.0006865377,0.000080796264,0.00010417613,0.00043601534,0.0768435,0.028497929,0.058370173,0.027187938,0.8055669],"study_design_scores_gemma":[0.00037283116,0.00034881278,0.0010900914,0.00013719917,0.00010221362,0.00037366335,0.00047732785,0.68312705,0.024989545,0.2640815,0.024823306,0.00007652541],"about_ca_topic_score_codex":0.0023506964,"about_ca_topic_score_gemma":0.004642892,"teacher_disagreement_score":0.0109538,"about_ca_system_score_codex":0.0013155888,"about_ca_system_score_gemma":0.0014672462,"threshold_uncertainty_score":0.03664416},"labels":[],"label_agreement":null},{"id":"W1996317753","doi":"10.1007/s00224-005-1252-0","title":"Efficient Exploration of Faulty Trees","year":2006,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Overhead (engineering); Node (physics); Competitive analysis; Tree (set theory); Computation; Algorithm; Situated; Enhanced Data Rates for GSM Evolution; Fault tree analysis; Mathematics; Artificial intelligence; Combinatorics; Engineering; Upper and lower bounds","score_opus":0.028762374305972335,"score_gpt":0.2608479320143923,"score_spread":0.23208555770842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996317753","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.39095372,0.0012914744,0.59237885,0.0012933776,0.00013350937,0.000068042,0.0003526485,0.001807951,0.011720439],"genre_scores_gemma":[0.9078127,0.0001849895,0.08847482,0.000102004655,0.00002717815,0.000050836712,0.00028788217,0.00020715807,0.0028524662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934644,0.00021325018,0.000027597505,0.000076076874,0.00020683902,0.00012973043],"domain_scores_gemma":[0.99548954,0.002919775,0.00023716275,0.0008290133,0.00039709522,0.00012744409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007858359,0.0004044651,0.00097207236,0.00068943866,0.00068097573,0.00087184366,0.0012281535,0.001092551,0.0029444543],"category_scores_gemma":[0.0075077587,0.00041669863,0.000504074,0.00083799136,0.0010326555,0.0021239219,0.0021665744,0.0009726065,0.0003904581],"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.0010316952,0.00010991579,0.0038222903,0.00031910554,0.0000796805,0.00053115597,0.00048759655,0.72790354,0.013694857,0.082182996,0.008569195,0.1612679],"study_design_scores_gemma":[0.00002221315,0.00003875106,0.0001657653,0.000011129068,0.000011425062,0.000076184406,0.000049419075,0.9331792,0.001860812,0.063516065,0.0010638554,0.0000052700207],"about_ca_topic_score_codex":0.0011850066,"about_ca_topic_score_gemma":0.0020571945,"teacher_disagreement_score":0.0029444543,"about_ca_system_score_codex":0.0005773335,"about_ca_system_score_gemma":0.0007583466,"threshold_uncertainty_score":0.009850144},"labels":[],"label_agreement":null},{"id":"W2004793105","doi":"10.1007/s00224-010-9264-9","title":"Tilings and Submonoids of Metabelian Groups","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Undecidable problem; Mathematics; Rank (graph theory); Group (periodic table); Combinatorics; Wreath product; Free product; Pure mathematics; Discrete mathematics; Product (mathematics); Physics; Decidability","score_opus":0.008176804284704712,"score_gpt":0.22122718702054084,"score_spread":0.21305038273583612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004793105","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.6268089,0.004945254,0.29051027,0.0014405134,0.00069568685,0.00009528604,0.00040444505,0.00050306885,0.07459658],"genre_scores_gemma":[0.94617236,0.0010874895,0.03468605,0.00028645262,0.0004331258,0.00012357935,0.00027333474,0.000101012694,0.016836671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.000111665366,0.000038543516,0.00011733239,0.00010463703,0.00007378442],"domain_scores_gemma":[0.9991099,0.00036323068,0.00014698923,0.000120942335,0.000098203025,0.00016063014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045627044,0.00047153406,0.00077720266,0.0014548405,0.0011897717,0.002238181,0.0007498122,0.00075210613,0.0056709647],"category_scores_gemma":[0.0016009795,0.0003447541,0.0007453919,0.00086360826,0.0023492766,0.0027133902,0.0015422822,0.0008288772,0.0005719278],"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.000017223974,0.000006591202,0.00016430145,0.00002407267,0.000005428687,0.0000623916,0.00035227902,0.0005640061,0.001197792,0.9921238,0.0003747504,0.0051073725],"study_design_scores_gemma":[0.000009669686,0.000013674287,0.0001556331,0.000008809422,0.0000048468855,0.00007627778,0.00010997365,0.0025416268,0.0004836423,0.9930339,0.0035551204,0.0000068246004],"about_ca_topic_score_codex":0.0007614441,"about_ca_topic_score_gemma":0.00075804855,"teacher_disagreement_score":0.0056709647,"about_ca_system_score_codex":0.0007274346,"about_ca_system_score_gemma":0.00035120314,"threshold_uncertainty_score":0.018971264},"labels":[],"label_agreement":null},{"id":"W2005304136","doi":"10.1007/s00224-013-9448-1","title":"Tight Bounds for Adopt-Commit Objects","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"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":"Commit; Upper and lower bounds; Binary logarithm; Combinatorics; Log-log plot; Matching (statistics); Mathematics; Deterministic algorithm; Discrete mathematics; Class (philosophy); Computer science; Statistics; Database","score_opus":0.013099220252770974,"score_gpt":0.22893660315291445,"score_spread":0.21583738290014348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005304136","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.08127271,0.008339074,0.8253571,0.01152322,0.0013316127,0.00042634996,0.0015608455,0.0050467253,0.065142415],"genre_scores_gemma":[0.80365247,0.004203445,0.14546135,0.0034088902,0.00242387,0.0011279869,0.0024253726,0.004396099,0.032900523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97240686,0.005137572,0.0013992024,0.00297157,0.010439905,0.007645009],"domain_scores_gemma":[0.7899123,0.13080902,0.007236492,0.048981182,0.014460532,0.008600454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019171009,0.004010202,0.0062525403,0.0057884185,0.007660802,0.018140418,0.01242842,0.0061973496,0.02218757],"category_scores_gemma":[0.13407616,0.0036401418,0.0029099511,0.008608595,0.008486587,0.045543082,0.02019237,0.018491087,0.0047419197],"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.0025517293,0.00054830656,0.002933694,0.00069879455,0.0001726304,0.00022390968,0.0013681368,0.060704015,0.0032316986,0.83684677,0.025867019,0.064853415],"study_design_scores_gemma":[0.00013652728,0.00015266506,0.00053359533,0.00014189321,0.00018599146,0.00014011751,0.0002869155,0.12707862,0.0025486546,0.86014026,0.008586924,0.000067881556],"about_ca_topic_score_codex":0.004453254,"about_ca_topic_score_gemma":0.005820249,"teacher_disagreement_score":0.02218757,"about_ca_system_score_codex":0.0076337783,"about_ca_system_score_gemma":0.008747517,"threshold_uncertainty_score":0.1013872},"labels":[],"label_agreement":null},{"id":"W2006913132","doi":"10.1007/s00224-013-9486-8","title":"The Coolest Way to Generate Binary Strings","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Binary number; Mathematics; Order (exchange); String (physics); Discrete mathematics; Type (biology); Arithmetic","score_opus":0.012509218171598212,"score_gpt":0.2153810577082891,"score_spread":0.20287183953669088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006913132","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.037998497,0.0020264662,0.88763905,0.0058561466,0.002326572,0.00025353825,0.0008073543,0.0027589551,0.060333356],"genre_scores_gemma":[0.4689147,0.0015980025,0.43870538,0.0041897926,0.0013326228,0.0008748176,0.0013235807,0.0032317224,0.07982937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971777,0.0009555341,0.00013901647,0.00046230105,0.0009709094,0.00029455058],"domain_scores_gemma":[0.99574274,0.0014291839,0.00017264026,0.0017821635,0.0006602734,0.0002130542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015278471,0.0010436971,0.0010219251,0.0014007745,0.0019948275,0.0042830375,0.00160044,0.0020420775,0.016960884],"category_scores_gemma":[0.011776771,0.00075498567,0.0011645849,0.0009416384,0.0029700228,0.006777338,0.004402344,0.0041174483,0.0076235253],"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.00043435872,0.000076563876,0.000521063,0.00036914487,0.000078901285,0.00011917807,0.0005260593,0.004168249,0.012734892,0.84012353,0.023912765,0.11693543],"study_design_scores_gemma":[0.00005826642,0.00009508744,0.00017996975,0.00015003802,0.000050012175,0.00027665176,0.000088373556,0.014678692,0.01139692,0.9296115,0.043352302,0.00006226941],"about_ca_topic_score_codex":0.00030285848,"about_ca_topic_score_gemma":0.00041380204,"teacher_disagreement_score":0.016960884,"about_ca_system_score_codex":0.0008718744,"about_ca_system_score_gemma":0.0010654791,"threshold_uncertainty_score":0.056739807},"labels":[],"label_agreement":null},{"id":"W2016687122","doi":"10.1007/s00224-013-9488-6","title":"Learning Read-Constant Polynomials of Constant Degree Modulo Composites","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Constant (computer programming); Mathematics; Monomial; Degree (music); Modulo; Polynomial; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.016115388889490833,"score_gpt":0.2364751190193163,"score_spread":0.2203597301298255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016687122","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.32346547,0.00094276713,0.6376744,0.002422075,0.00037784877,0.00010086302,0.00053655636,0.0026648415,0.031815253],"genre_scores_gemma":[0.9159581,0.00037278922,0.070646554,0.0003177596,0.00036562173,0.000043621025,0.00064121047,0.00032065768,0.011333814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988507,0.00020216935,0.00004506244,0.00040939002,0.00028803144,0.00020466662],"domain_scores_gemma":[0.9942919,0.003160003,0.00038892284,0.0011862778,0.0006360915,0.0003368181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063828,0.0006801614,0.00077586295,0.0008085169,0.00090685557,0.0023411592,0.0011128904,0.00086743245,0.010332306],"category_scores_gemma":[0.01274592,0.00040478908,0.0007367584,0.000905654,0.002176112,0.0053250375,0.0021005294,0.0031397392,0.0021166832],"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.00073591626,0.00020469772,0.0044092154,0.00036698004,0.000056274162,0.0003106778,0.0008544059,0.02856538,0.009699298,0.754206,0.0103042945,0.19028682],"study_design_scores_gemma":[0.000054844128,0.00008263371,0.0006299981,0.000042237825,0.000030248517,0.00014638217,0.00020708975,0.065974444,0.0047268975,0.9224113,0.005670167,0.00002380357],"about_ca_topic_score_codex":0.0008203627,"about_ca_topic_score_gemma":0.0012886635,"teacher_disagreement_score":0.010332306,"about_ca_system_score_codex":0.0010301184,"about_ca_system_score_gemma":0.000945975,"threshold_uncertainty_score":0.03456503},"labels":[],"label_agreement":null},{"id":"W2024243717","doi":"10.1007/s00224-013-9485-9","title":"Computational Aspects of M.C. Escher’s Ribbon Patterns","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Escher; Ribbon; Equilateral triangle; Cork; Mathematics; Motif (music); Set (abstract data type); Combinatorics; Computer science; Geometry; Art; Programming language","score_opus":0.013431341548140682,"score_gpt":0.2318013323387935,"score_spread":0.2183699907906528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024243717","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.24235396,0.00280724,0.3892631,0.006169888,0.0006651194,0.00005573298,0.00026956032,0.00034406045,0.3580714],"genre_scores_gemma":[0.92801315,0.001045912,0.044388935,0.0004314087,0.00022076057,0.000054438548,0.00017114819,0.000111106965,0.025563138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996854,0.00009219365,0.000016143196,0.00006076897,0.00009677876,0.000048778835],"domain_scores_gemma":[0.9991278,0.00047774706,0.00005592158,0.00015558887,0.00011711905,0.00006583727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038511908,0.00026271632,0.0004537593,0.00097343157,0.0011108562,0.0018426365,0.00063477154,0.0013376042,0.0081433365],"category_scores_gemma":[0.0038245055,0.0003430257,0.00062058197,0.00096590683,0.0019827075,0.0029962016,0.001247078,0.0011382721,0.0011312362],"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.000014242074,0.0000052851037,0.00011184752,0.000016787924,0.000002587404,0.000041604115,0.00006398786,0.004665176,0.00037976398,0.9882322,0.0011552016,0.0053113657],"study_design_scores_gemma":[0.0000054891543,0.0000068426175,0.00009943979,0.0000070962283,0.0000018979437,0.000060855695,0.000031297997,0.016806068,0.00033370062,0.9791196,0.0035221754,0.0000055132928],"about_ca_topic_score_codex":0.0010944777,"about_ca_topic_score_gemma":0.0011609553,"teacher_disagreement_score":0.0081433365,"about_ca_system_score_codex":0.00064470107,"about_ca_system_score_gemma":0.00033727533,"threshold_uncertainty_score":0.027242184},"labels":[],"label_agreement":null},{"id":"W2028556486","doi":"10.1007/s00224-011-9333-8","title":"The Complexity of the List Homomorphism Problem for Graphs","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University; McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Homomorphism; Combinatorics; Mathematics; Algebraic number; Discrete mathematics; Computational complexity theory; Graph; Computer science; Algorithm","score_opus":0.09207204870786918,"score_gpt":0.28761644459718155,"score_spread":0.19554439588931238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028556486","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.56505114,0.0052973717,0.28721857,0.049279455,0.00085116335,0.00035000083,0.006727438,0.0020325615,0.08319226],"genre_scores_gemma":[0.9281599,0.0024700805,0.043677866,0.0015956238,0.0015700496,0.00032336987,0.004295817,0.00071259076,0.017194746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99431133,0.0019678269,0.00026258064,0.0010990624,0.0013112221,0.0010480927],"domain_scores_gemma":[0.94017786,0.051180977,0.0020679245,0.003156691,0.0015319274,0.0018846695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032773411,0.0011743719,0.0027820824,0.0019825369,0.0033450015,0.011169691,0.0056403736,0.00473228,0.021550337],"category_scores_gemma":[0.035728917,0.0014219494,0.0020941205,0.004488461,0.0046464326,0.032872356,0.004825827,0.0076513276,0.002158305],"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.0018316942,0.0007348203,0.005048492,0.0012566223,0.00021924586,0.0004312247,0.0016826934,0.092438884,0.0029897366,0.78068304,0.05098648,0.061697032],"study_design_scores_gemma":[0.00012792744,0.00003601535,0.00057714013,0.000034832647,0.00005519955,0.00014684812,0.0002545954,0.08144329,0.00070045935,0.91454506,0.0020392588,0.000039340874],"about_ca_topic_score_codex":0.0054267636,"about_ca_topic_score_gemma":0.004683965,"teacher_disagreement_score":0.021550337,"about_ca_system_score_codex":0.0053049135,"about_ca_system_score_gemma":0.0040263827,"threshold_uncertainty_score":0.07209301},"labels":[],"label_agreement":null},{"id":"W2028604424","doi":"10.1007/s00224-010-9290-7","title":"Generalized Semimagic Squares for Digital Halftoning","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matrix (chemical analysis); Heuristic; Integer (computer science); Digital filter; Matrix algebra","score_opus":0.04266926589020154,"score_gpt":0.3182622519953293,"score_spread":0.2755929861051278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028604424","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.017733337,0.00025110177,0.9700245,0.00019128976,0.00012310813,0.00002413237,0.000043600918,0.00022924865,0.011379643],"genre_scores_gemma":[0.5072557,0.0005442766,0.46418995,0.0003599278,0.00016858395,0.00008159343,0.00013672854,0.0003363515,0.026926935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962795,0.00009860595,0.000017543669,0.000082816274,0.00014722499,0.000025949928],"domain_scores_gemma":[0.9994204,0.00018740149,0.000033076463,0.00017653345,0.00014937116,0.000033153778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003912389,0.00045733555,0.00055656635,0.00047842425,0.0004116758,0.0010054661,0.0007082104,0.0006597642,0.00507521],"category_scores_gemma":[0.0019609455,0.00022129607,0.00034994233,0.00052835577,0.0012076227,0.0013850735,0.001307292,0.0011077315,0.0009790601],"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.00009108262,0.000018288902,0.00015640307,0.00009643694,0.000016434438,0.0000755077,0.000121089215,0.025336575,0.0143330805,0.8446678,0.0031718975,0.111915365],"study_design_scores_gemma":[0.000015598702,0.00004501812,0.00017581206,0.000020182679,0.000010096841,0.0002859956,0.00006282957,0.35490316,0.012313248,0.6157194,0.016422266,0.000026407106],"about_ca_topic_score_codex":0.00042014287,"about_ca_topic_score_gemma":0.00065732154,"teacher_disagreement_score":0.00507521,"about_ca_system_score_codex":0.00040667484,"about_ca_system_score_gemma":0.00033033942,"threshold_uncertainty_score":0.016978264},"labels":[],"label_agreement":null},{"id":"W2030552895","doi":"10.1007/s00224-007-1325-3","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Intersection (aeronautics); Mathematical proof; Extension (predicate logic); Set (abstract data type); Mathematics; Upper and lower bounds; Algorithm; Computer science; State (computer science); Discrete mathematics; Finite-state machine; Combinatorics; Theoretical computer science; Programming language; Engineering","score_opus":0.0302898493409319,"score_gpt":0.31553094789313363,"score_spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030552895","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.1013794,0.00585195,0.77856165,0.008783959,0.00042752252,0.00015767638,0.00064325175,0.0013886814,0.10280586],"genre_scores_gemma":[0.6354263,0.004186235,0.31174973,0.0020760077,0.000823997,0.00031400443,0.001025518,0.0007030076,0.043695264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974855,0.00073890615,0.00016885341,0.0004709523,0.00064550224,0.00049017667],"domain_scores_gemma":[0.99389535,0.0034728067,0.00036746447,0.0011680882,0.0006246234,0.00047169873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023772244,0.0007417723,0.0017362937,0.0026832686,0.0026498868,0.0055093365,0.0026677332,0.0018169198,0.011161799],"category_scores_gemma":[0.0116255125,0.000851863,0.0014478914,0.0044082776,0.0032622046,0.015132419,0.003715116,0.0039419415,0.0020423206],"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.00003856732,0.000026968013,0.00021939303,0.00008048942,0.000015306005,0.000024393934,0.00015235048,0.0021423807,0.00026417655,0.9721657,0.0035350325,0.021335278],"study_design_scores_gemma":[0.000014151799,0.0000073298024,0.000078190154,0.000015825866,0.0000072476005,0.000024241219,0.00003820046,0.009977609,0.00012570513,0.98681706,0.0028889403,0.0000055090163],"about_ca_topic_score_codex":0.005127763,"about_ca_topic_score_gemma":0.005264961,"teacher_disagreement_score":0.011161799,"about_ca_system_score_codex":0.0032371508,"about_ca_system_score_gemma":0.0020191965,"threshold_uncertainty_score":0.037339926},"labels":[],"label_agreement":null},{"id":"W2031025945","doi":"10.1007/s00224-007-9065-y","title":"Fault-Tolerant Sequential Scan","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Algorithm; Point (geometry); Line (geometry); Adversary; Construct (python library); Head (geology); Matching (statistics); Fault (geology); Order (exchange); Mathematics","score_opus":0.0263441281532681,"score_gpt":0.2829132204927016,"score_spread":0.25656909233943354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031025945","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.10677041,0.0018630859,0.8705024,0.0012111948,0.00029984204,0.00017143569,0.00050542183,0.003509849,0.015166251],"genre_scores_gemma":[0.8749121,0.00052044936,0.11618522,0.00026177548,0.000121752484,0.00011808174,0.00040426242,0.0001979748,0.007278369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998968,0.00020860722,0.00007402319,0.00021592298,0.0003896631,0.00014373864],"domain_scores_gemma":[0.99670285,0.0015320365,0.0002646065,0.0009089268,0.0004955083,0.000096175914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737867,0.000565966,0.0012241628,0.0010203122,0.0006829307,0.0012357379,0.0015904943,0.0008914856,0.005107268],"category_scores_gemma":[0.0050210785,0.0004196957,0.00041778845,0.0018382401,0.000980365,0.0021868495,0.0012411263,0.0007884826,0.0005770463],"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.0028277312,0.0002102983,0.0031248534,0.00057418767,0.0001617099,0.0005065256,0.00022592365,0.4498382,0.022035426,0.1327499,0.019134676,0.36861044],"study_design_scores_gemma":[0.00009986347,0.00019721105,0.00037534133,0.000020990254,0.000057448855,0.00035494604,0.000058844147,0.88100904,0.009644481,0.10396,0.004200764,0.000020993497],"about_ca_topic_score_codex":0.00158288,"about_ca_topic_score_gemma":0.0025474182,"teacher_disagreement_score":0.005107268,"about_ca_system_score_codex":0.0008269914,"about_ca_system_score_gemma":0.0014641121,"threshold_uncertainty_score":0.017085493},"labels":[],"label_agreement":null},{"id":"W2032278054","doi":"10.1007/s00224-014-9557-5","title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Combinatorics; Vertex (graph theory); Partition (number theory); Vertex cover; Mathematics; Neighbourhood (mathematics); Time complexity; Feedback vertex set; Graph partition; Constant (computer programming); Graph; Bisection; Computer science; Geometry","score_opus":0.057347222567492515,"score_gpt":0.30228049710186444,"score_spread":0.24493327453437191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032278054","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.5070193,0.0035463576,0.4347922,0.013380993,0.00057197304,0.0004178734,0.0042223767,0.0030374853,0.033011496],"genre_scores_gemma":[0.8444405,0.0017553677,0.13468419,0.0011850202,0.00077495043,0.00046939444,0.005368936,0.0015310276,0.009790576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99269694,0.0025455714,0.00047548962,0.0014388433,0.0017073232,0.0011358808],"domain_scores_gemma":[0.9278957,0.05943539,0.0022819263,0.0068723992,0.0018844315,0.0016300371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004428702,0.0021537554,0.0029218853,0.002055075,0.002536935,0.010100155,0.005693849,0.0034022243,0.019805899],"category_scores_gemma":[0.052035145,0.0015225064,0.0026324138,0.005740599,0.0043525263,0.029300563,0.005832007,0.006050079,0.0017591765],"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.003451172,0.0008964982,0.010424595,0.0014483347,0.00042202757,0.00033306328,0.0015496246,0.47063866,0.009396576,0.3376935,0.02786715,0.13587885],"study_design_scores_gemma":[0.00021746701,0.00011061135,0.0012179891,0.000069870104,0.0001234797,0.00011779773,0.00033178198,0.48532295,0.001820855,0.508618,0.002006975,0.0000422309],"about_ca_topic_score_codex":0.0072074775,"about_ca_topic_score_gemma":0.011931054,"teacher_disagreement_score":0.019805899,"about_ca_system_score_codex":0.0074202553,"about_ca_system_score_gemma":0.0054807556,"threshold_uncertainty_score":0.06625736},"labels":[],"label_agreement":null},{"id":"W2032630728","doi":"10.1007/s00224-011-9338-3","title":"Maintaining Privacy on a Line","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Variety (cybernetics); Task (project management); Computer science; Position (finance); Sequence (biology); Line (geometry); Internet privacy; Computer security; Artificial intelligence; Mathematics; Business; Economics","score_opus":0.07770176045766537,"score_gpt":0.2857083316337838,"score_spread":0.20800657117611843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032630728","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.022088334,0.0002980116,0.9463834,0.0051280037,0.0002729492,0.00010327745,0.00025400886,0.0010841985,0.024387904],"genre_scores_gemma":[0.7081501,0.00078131485,0.24933782,0.0023132823,0.0007750225,0.00032112608,0.0006382218,0.0005344621,0.037148584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899479,0.003366286,0.00071333937,0.0020147543,0.0030003265,0.00095732085],"domain_scores_gemma":[0.9734072,0.007139762,0.001572604,0.0143549135,0.0028208846,0.0007046413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046697967,0.0008777221,0.0013125858,0.0017440593,0.0033152418,0.012039699,0.0028748522,0.0036800124,0.010196467],"category_scores_gemma":[0.019381724,0.0009039212,0.00127095,0.0024321284,0.004699137,0.020694522,0.0059751337,0.005936287,0.004782881],"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.00021415214,0.00012363434,0.0008418816,0.00008217683,0.00006816429,0.00022317708,0.00064390065,0.011894465,0.004161002,0.932412,0.006464523,0.04287097],"study_design_scores_gemma":[0.00004200521,0.000083956795,0.00012546539,0.00003824614,0.00005903297,0.00026866634,0.00019917473,0.08746193,0.0064557022,0.8762524,0.028978499,0.00003481328],"about_ca_topic_score_codex":0.00063427567,"about_ca_topic_score_gemma":0.00036517184,"teacher_disagreement_score":0.012039699,"about_ca_system_score_codex":0.0018367559,"about_ca_system_score_gemma":0.0019732078,"threshold_uncertainty_score":0.034110606},"labels":[],"label_agreement":null},{"id":"W2032976034","doi":"10.1007/s00224-010-9302-7","title":"On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isomorphism (crystallography); Equivalence (formal languages); Mathematics; Complexity class; Expression (computer science); Class (philosophy); Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Time complexity; Computer science; Crystal structure; Crystallography","score_opus":0.02611519222703439,"score_gpt":0.24483667776386567,"score_spread":0.21872148553683127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032976034","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.60507715,0.0032203048,0.30054346,0.014248477,0.000283104,0.00019858225,0.0012945696,0.0005471433,0.07458728],"genre_scores_gemma":[0.9665468,0.0009911099,0.022582134,0.0005431774,0.0004688461,0.00018646137,0.0008416853,0.00020944892,0.007630465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908336,0.00298972,0.00056931755,0.0014702129,0.0028855419,0.0012515379],"domain_scores_gemma":[0.88639647,0.10320483,0.002452642,0.0037934156,0.002544914,0.001607801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005602633,0.0010390374,0.0030377484,0.0031364483,0.0029403944,0.009340002,0.004627585,0.0035117622,0.011683987],"category_scores_gemma":[0.04730951,0.0013494625,0.0027982367,0.0045782193,0.0073574623,0.03936738,0.006572003,0.009437012,0.0007147681],"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.00037321224,0.00018641482,0.002502746,0.00020188624,0.00007320759,0.00021970962,0.000993809,0.015598715,0.0010588984,0.9584355,0.0026087817,0.017747123],"study_design_scores_gemma":[0.000035372716,0.00002407526,0.0005523039,0.000017068105,0.000038241848,0.00008676129,0.00012075805,0.038432747,0.0005283766,0.9593852,0.0007561564,0.000022875924],"about_ca_topic_score_codex":0.0034355023,"about_ca_topic_score_gemma":0.002684235,"teacher_disagreement_score":0.011683987,"about_ca_system_score_codex":0.0054098167,"about_ca_system_score_gemma":0.0023626552,"threshold_uncertainty_score":0.03925121},"labels":[],"label_agreement":null},{"id":"W2036493899","doi":"10.1007/s00224-014-9591-3","title":"On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba; Dalhousie University","funders":"","keywords":"Minimum spanning tree; Spanning tree; Mathematics; Parameterized complexity; Disjoint sets; Euclidean minimum spanning tree; Minimum weight; Combinatorics; Connected dominating set; Euclidean geometry; Steiner tree problem; Approximation algorithm; Set (abstract data type); Point (geometry); Mathematical proof; Kruskal's algorithm; Mathematical optimization; Computer science","score_opus":0.010340620752888371,"score_gpt":0.2233376238070862,"score_spread":0.21299700305419783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036493899","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.09481899,0.0029567746,0.87678564,0.0016476448,0.0002192251,0.00009571218,0.0003175888,0.00019098465,0.022967285],"genre_scores_gemma":[0.63716817,0.003966077,0.3433277,0.00041232517,0.0004678632,0.00021916558,0.0007413537,0.00029404624,0.013403255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993699,0.00023313217,0.0000344247,0.000113774826,0.00018141813,0.00006727635],"domain_scores_gemma":[0.99586654,0.002944653,0.0002744294,0.00027936208,0.0004406759,0.00019427342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011604114,0.0007371742,0.0013127563,0.001501986,0.0011105409,0.0016100629,0.002130556,0.0014007417,0.0048855306],"category_scores_gemma":[0.013111434,0.00067158946,0.0007630185,0.0021693944,0.0013241097,0.0047650016,0.0024179698,0.0015419908,0.0005161852],"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.0002292361,0.000083874154,0.0008624844,0.0002722685,0.00003976929,0.00012739966,0.000323263,0.15863162,0.0021077837,0.7551854,0.0075401952,0.07459666],"study_design_scores_gemma":[0.000023749255,0.000042923217,0.00031186073,0.00005074598,0.000021958416,0.00012510964,0.00010837697,0.3477725,0.00049933325,0.64729923,0.0037312955,0.000012910891],"about_ca_topic_score_codex":0.0011522329,"about_ca_topic_score_gemma":0.002028908,"teacher_disagreement_score":0.0048855306,"about_ca_system_score_codex":0.0010445063,"about_ca_system_score_gemma":0.00063782226,"threshold_uncertainty_score":0.016343713},"labels":[],"label_agreement":null},{"id":"W2041354954","doi":"10.1007/s00224-005-1263-x","title":"Algebraic Results on Quantum Automata","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Sherbrooke; University of Waterloo","funders":"","keywords":"Class (philosophy); Automaton; Construct (python library); Quantum finite automata; Algebraic number; Computer science; Algebraic theory; Quantum; Algebra over a field; Cellular automaton; Quantum cellular automaton; Regular language; Theoretical computer science; Boolean function; Discrete mathematics; Mathematics; Automata theory; Pure mathematics; Programming language; Algorithm; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.018560839364263417,"score_gpt":0.2465511724309238,"score_spread":0.2279903330666604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041354954","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.13575166,0.010358496,0.43035024,0.015882457,0.0029474853,0.00013477003,0.00092348555,0.00059485505,0.40305662],"genre_scores_gemma":[0.90168166,0.0056073642,0.04250741,0.0022612424,0.0040860362,0.00025941955,0.0005695635,0.00024508304,0.0427822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980965,0.00046539743,0.00012204465,0.00037064592,0.0007258297,0.00021956518],"domain_scores_gemma":[0.99521255,0.0029066692,0.00023794213,0.0005047807,0.0007763768,0.00036161178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018648622,0.0010322867,0.0017051558,0.0035796764,0.0040832134,0.004912531,0.0017990873,0.0015089895,0.0109402435],"category_scores_gemma":[0.005104671,0.00086132606,0.0017562547,0.0035188743,0.0074540186,0.0137935495,0.004033673,0.0053750174,0.0011526012],"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.000004384145,0.000006192289,0.000020385458,0.000014163401,0.0000021747244,0.000007173672,0.00005871865,0.00017089253,0.00006059859,0.99851626,0.00040424115,0.0007348131],"study_design_scores_gemma":[0.000005752952,0.0000032468954,0.000034110333,0.0000044213184,0.000003955915,0.00001001672,0.000019030704,0.00095624436,0.00005894923,0.9968887,0.002011306,0.000004250736],"about_ca_topic_score_codex":0.0021507998,"about_ca_topic_score_gemma":0.0015505899,"teacher_disagreement_score":0.0109402435,"about_ca_system_score_codex":0.003594064,"about_ca_system_score_gemma":0.0013593523,"threshold_uncertainty_score":0.0365988},"labels":[],"label_agreement":null},{"id":"W2045637260","doi":"10.1007/s002240010006","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Mobile ad hoc network; Wireless; Ad hoc wireless distribution service; Vehicular ad hoc network; Telecommunications; Optimized Link State Routing Protocol","score_opus":0.013253143771549783,"score_gpt":0.24216040358342936,"score_spread":0.22890725981187957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045637260","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.016121648,0.0036274125,0.96452636,0.00069233944,0.00020056627,0.00014841204,0.00007276461,0.00019652778,0.014413996],"genre_scores_gemma":[0.7266725,0.007969845,0.2378691,0.00037131997,0.0004489002,0.0007095652,0.00025795234,0.00016497295,0.025535928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991622,0.00034486593,0.000043828437,0.0000716582,0.0002670741,0.00011036114],"domain_scores_gemma":[0.99811316,0.0013275272,0.00010288737,0.00015318672,0.00023436885,0.00006883568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009256741,0.0011758126,0.0008484461,0.0010833503,0.0007169928,0.0017914737,0.001448687,0.0010901105,0.003937468],"category_scores_gemma":[0.0045987875,0.0004686746,0.00032219835,0.0012474991,0.0008318508,0.0027826778,0.0011449526,0.00097385404,0.0007764702],"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.00014300672,0.00011513861,0.00025791215,0.0004219515,0.000065517466,0.00012687322,0.00023579238,0.28028876,0.0058183516,0.5147197,0.010744004,0.18706292],"study_design_scores_gemma":[0.000045557183,0.00010749097,0.00012072056,0.000050996765,0.000038235743,0.00013442498,0.00011935009,0.5889863,0.0016103077,0.39769578,0.011071583,0.0000193061],"about_ca_topic_score_codex":0.0006805048,"about_ca_topic_score_gemma":0.000776522,"teacher_disagreement_score":0.003937468,"about_ca_system_score_codex":0.00074012816,"about_ca_system_score_gemma":0.0007680857,"threshold_uncertainty_score":0.01317209},"labels":[],"label_agreement":null},{"id":"W2046773087","doi":"10.1007/s00224-011-9341-8","title":"Searching for Black Holes in Subways","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Government of Canada; University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.07450081417601022,"score_gpt":0.26264191948336135,"score_spread":0.18814110530735112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046773087","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.40331468,0.0013577373,0.56046355,0.0040062442,0.0002720672,0.00018847773,0.000409668,0.00043522308,0.02955234],"genre_scores_gemma":[0.9128241,0.00073607685,0.074285954,0.0003483164,0.00008987156,0.00010196659,0.00023430707,0.00012970058,0.011249706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989009,0.0004457995,0.00004050522,0.00019782704,0.00016649035,0.00024854444],"domain_scores_gemma":[0.9894924,0.007067375,0.0008900506,0.0012197637,0.0005760854,0.0007542366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015068257,0.00054453313,0.0015722691,0.0014653682,0.0025467398,0.0036806993,0.0025874549,0.0025546728,0.008570745],"category_scores_gemma":[0.01618391,0.0010413879,0.0010363725,0.0017052322,0.0031693971,0.008643508,0.003927844,0.0019833078,0.0005107448],"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.00043942404,0.00010006029,0.0027270634,0.00017112608,0.000070876675,0.00023658092,0.00069072517,0.10319806,0.0010238466,0.86370975,0.0064347773,0.02119767],"study_design_scores_gemma":[0.00004578122,0.00002992649,0.00022938404,0.000030186931,0.000025234734,0.000080561,0.0005246651,0.25117126,0.0005581509,0.74385643,0.0034308014,0.000017590124],"about_ca_topic_score_codex":0.0033191894,"about_ca_topic_score_gemma":0.0039594634,"teacher_disagreement_score":0.008570745,"about_ca_system_score_codex":0.00121904,"about_ca_system_score_gemma":0.001291176,"threshold_uncertainty_score":0.02867198},"labels":[],"label_agreement":null},{"id":"W2049954052","doi":"10.1007/s00224-005-1223-5","title":"Rendezvous and Election of Mobile Agents: Impact of Sense of Direction","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Leader election; Correctness; Computer science; Constructive proof; Node (physics); Context (archaeology); Asynchronous communication; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Protocol (science); Theoretical computer science; Computer network; Distributed computing; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.015085414672775604,"score_gpt":0.2905820463513931,"score_spread":0.2754966316786175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049954052","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.9226852,0.0014674045,0.049881667,0.0017726411,0.0002327059,0.000034055254,0.00011381563,0.00014882954,0.023663558],"genre_scores_gemma":[0.9972926,0.00022781968,0.0014108772,0.000023184039,0.00001881826,0.000006390531,0.000028141005,0.00001888143,0.0009733557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912757,0.0003362665,0.000026718291,0.00017057173,0.00013471038,0.00020419044],"domain_scores_gemma":[0.9881109,0.00781979,0.0012491449,0.0009775521,0.00084160274,0.0010009431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016226232,0.00044738498,0.00080933975,0.00084839883,0.0011220094,0.002897526,0.00086627394,0.0011898007,0.0049691955],"category_scores_gemma":[0.027027879,0.00046012097,0.00046860587,0.0008057077,0.0016335844,0.0038219846,0.0017347803,0.0010939544,0.00054887746],"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.0042257365,0.00046082502,0.025568457,0.00036366342,0.0003092044,0.00045409007,0.0011066516,0.60176826,0.018326981,0.26325622,0.004661586,0.07949835],"study_design_scores_gemma":[0.0003196949,0.00055170676,0.01003099,0.00003511126,0.00014414424,0.00040539177,0.0015076633,0.82748574,0.0042269416,0.15163837,0.0035869328,0.000067300156],"about_ca_topic_score_codex":0.0033885788,"about_ca_topic_score_gemma":0.0039281202,"teacher_disagreement_score":0.0049691955,"about_ca_system_score_codex":0.0007353461,"about_ca_system_score_gemma":0.0013884943,"threshold_uncertainty_score":0.016623676},"labels":[],"label_agreement":null},{"id":"W2051951103","doi":"10.1007/s002240010007","title":"On Recognizing a String on an Anonymous Ring","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Science Council","keywords":"String (physics); Kolmogorov complexity; Upper and lower bounds; Combinatorics; Mathematics; Ring (chemistry); Discrete mathematics; Binary number; Arithmetic","score_opus":0.021096749255133402,"score_gpt":0.2541077647803881,"score_spread":0.2330110155252547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051951103","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.13069627,0.00162244,0.82026297,0.004431249,0.0006540616,0.00015093807,0.0002521715,0.001414861,0.040515136],"genre_scores_gemma":[0.70324445,0.0033168276,0.24226497,0.001318546,0.0012983236,0.00029753946,0.0010426282,0.00051652145,0.046700176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742836,0.0006598885,0.0002131474,0.0004446277,0.00079550163,0.00045840078],"domain_scores_gemma":[0.98815095,0.007996704,0.0005423154,0.0021688603,0.00082377123,0.0003173804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021524797,0.0009707323,0.0016348105,0.001937803,0.0021310344,0.0037317078,0.0022480728,0.0031663568,0.006553909],"category_scores_gemma":[0.011524824,0.00062882504,0.0011757829,0.0038910913,0.0050607906,0.014961866,0.0047197356,0.0029850407,0.0013791536],"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.0003699146,0.00012774912,0.0011257678,0.0002004185,0.000038278235,0.0002057334,0.0008174353,0.04159377,0.0036408307,0.82373357,0.008862508,0.119284056],"study_design_scores_gemma":[0.000018378802,0.00006563399,0.00025277422,0.000035564655,0.00003085782,0.0001494399,0.00018796019,0.10741346,0.0034751159,0.8831549,0.005177184,0.000038893755],"about_ca_topic_score_codex":0.0018175902,"about_ca_topic_score_gemma":0.0014482663,"teacher_disagreement_score":0.006553909,"about_ca_system_score_codex":0.0018567472,"about_ca_system_score_gemma":0.0010862568,"threshold_uncertainty_score":0.021925032},"labels":[],"label_agreement":null},{"id":"W2056660045","doi":"10.1007/s00224-005-1243-1","title":"More Fun with Symmetric Venn Diagrams","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Mathematics; Symmetry (geometry); Diagram; Discrete mathematics; Combinatorics; Geometry; Statistics","score_opus":0.006633079933243651,"score_gpt":0.1863290065497682,"score_spread":0.17969592661652453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056660045","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.02993217,0.0014023985,0.7223989,0.0044168155,0.0021945878,0.00007341381,0.00053955684,0.001739139,0.23730308],"genre_scores_gemma":[0.544727,0.001981444,0.3101873,0.0028847137,0.0014549906,0.00016488263,0.00083653734,0.0016133061,0.13614982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990441,0.00039265404,0.0000332632,0.00017592657,0.00026079456,0.000093271694],"domain_scores_gemma":[0.9987191,0.00042554273,0.00006511233,0.00042051045,0.00023295014,0.00013681393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010174864,0.00069992227,0.00078413746,0.0017021057,0.0016458734,0.0033511226,0.001013417,0.0012452026,0.039469972],"category_scores_gemma":[0.004606744,0.00040651925,0.0009145278,0.001273195,0.0019634762,0.010011387,0.002163144,0.0018582101,0.004384403],"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.000020351848,0.000013108513,0.000074929594,0.00003895382,0.000006717814,0.000029755147,0.0001596295,0.0014186631,0.00042136162,0.97737724,0.0060196514,0.014419689],"study_design_scores_gemma":[0.0000068644463,0.0000043766017,0.0000274375,0.000014530453,0.000005231886,0.00004161173,0.00004516066,0.003053393,0.00023810791,0.96833825,0.028216222,0.000008827162],"about_ca_topic_score_codex":0.0016624611,"about_ca_topic_score_gemma":0.0026831413,"teacher_disagreement_score":0.039469972,"about_ca_system_score_codex":0.0010090345,"about_ca_system_score_gemma":0.00045586354,"threshold_uncertainty_score":0.13204026},"labels":[],"label_agreement":null},{"id":"W2057272165","doi":"10.1007/s00224-014-9555-7","title":"Special Issue on Approximation and Online Algorithms","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.019501056301076253,"score_gpt":0.2620512783076757,"score_spread":0.24255022200659945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057272165","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001923089,0.096706025,0.057807446,0.047672153,0.6194295,0.00023122747,0.0018074401,0.00096845266,0.1734546],"genre_scores_gemma":[0.017738365,0.05589989,0.016175905,0.008054255,0.6681786,0.00040059313,0.0025505016,0.0016981174,0.22930382],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953629,0.0010699739,0.0002856968,0.0011391605,0.0018103078,0.0003318866],"domain_scores_gemma":[0.98635036,0.0072681406,0.00051547465,0.0021149416,0.0023614129,0.0013896673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003862468,0.00395028,0.0067269993,0.006263153,0.0024214033,0.009782222,0.0036889045,0.004914445,0.12914932],"category_scores_gemma":[0.014895422,0.0013461546,0.0031390244,0.008359568,0.0026269362,0.0087608285,0.003219629,0.008352713,0.041686457],"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.00012593679,0.00016458728,0.00030948478,0.0008188523,0.000105053055,0.00008534321,0.000028293985,0.0018086595,0.00027677583,0.049359772,0.8699975,0.076919734],"study_design_scores_gemma":[0.00008318404,0.00012512639,0.0010314219,0.00064573914,0.00014484825,0.00045034286,0.000051959367,0.0121394005,0.00040407843,0.1323416,0.85252184,0.000060440616],"about_ca_topic_score_codex":0.0012004096,"about_ca_topic_score_gemma":0.0019640995,"teacher_disagreement_score":0.12914932,"about_ca_system_score_codex":0.004592403,"about_ca_system_score_gemma":0.0032868097,"threshold_uncertainty_score":0.4320475},"labels":[],"label_agreement":null},{"id":"W2062214685","doi":"10.1007/s00224-007-1329-z","title":"A Faster FPT Algorithm for the Maximum Agreement Forest Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Partition (number theory); Combinatorics; Cardinality (data modeling); Phylogenetic tree; Mathematics; Time complexity; Order (exchange); Binary number; Running time; Set (abstract data type); Algorithm; Pairwise comparison; Computer science; Statistics; Chemistry; Data mining","score_opus":0.01855616429137116,"score_gpt":0.25570376843143866,"score_spread":0.2371476041400675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062214685","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.01945277,0.0011222651,0.9571615,0.0021468932,0.0006410961,0.00031715227,0.0010579146,0.005038374,0.0130620245],"genre_scores_gemma":[0.12494232,0.00038152284,0.86212337,0.0006085573,0.00049851084,0.00041835025,0.0025031331,0.0009397857,0.0075843628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798524,0.00034838382,0.0001285736,0.00048294282,0.0007682714,0.00028648772],"domain_scores_gemma":[0.9943141,0.0031336434,0.0001914639,0.0013974422,0.00071378174,0.00024965242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017295231,0.0012223992,0.0019295657,0.0017206651,0.0014647446,0.002718903,0.002967382,0.0023702865,0.019944822],"category_scores_gemma":[0.011171876,0.0006384304,0.001541752,0.0031031673,0.0009874564,0.005887378,0.0028804482,0.0042506214,0.005304136],"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.0008908182,0.00043435756,0.0007187941,0.00046959068,0.00008878247,0.00020373681,0.00020085725,0.051560264,0.009205783,0.07323705,0.054854378,0.80813557],"study_design_scores_gemma":[0.00053317857,0.00016941603,0.00054357096,0.00008711022,0.000101566904,0.000562217,0.00015800165,0.64311236,0.0072219567,0.32435396,0.02310523,0.000051404884],"about_ca_topic_score_codex":0.0034449939,"about_ca_topic_score_gemma":0.0044300896,"teacher_disagreement_score":0.019944822,"about_ca_system_score_codex":0.0015296742,"about_ca_system_score_gemma":0.0024434577,"threshold_uncertainty_score":0.066722035},"labels":[],"label_agreement":null},{"id":"W2064923761","doi":"10.1007/s00224-001-1037-z","title":"Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Integer (computer science); Ring (chemistry); Computer science; Computation; Parallel computing; Memory hierarchy; Execution time; Real number; Algorithm; Discrete mathematics; Mathematics; Programming language","score_opus":0.051753409585569246,"score_gpt":0.3125254380226435,"score_spread":0.26077202843707425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064923761","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.19552323,0.0017456708,0.72546166,0.003250349,0.0001363897,0.00017508042,0.00022712038,0.0006999798,0.072780535],"genre_scores_gemma":[0.8922987,0.0009846368,0.091115534,0.00019402817,0.00017210988,0.00016663878,0.00016038152,0.00013134477,0.014776641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969254,0.0008246983,0.00021586221,0.0005276094,0.0009274026,0.00057902635],"domain_scores_gemma":[0.98908895,0.00599852,0.00076177623,0.0020008173,0.0010397353,0.0011102053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002860798,0.00068810163,0.0016758307,0.0017323573,0.002919226,0.0059409854,0.0025932156,0.0018780257,0.007093694],"category_scores_gemma":[0.011677459,0.0007952588,0.0014223421,0.0014093213,0.006194836,0.010382292,0.0040853024,0.0035214366,0.00074857706],"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.00007640344,0.000034866505,0.00031025245,0.000080519,0.00001605545,0.00007918551,0.0004256162,0.010928039,0.0009169454,0.97814286,0.0005739896,0.008415238],"study_design_scores_gemma":[0.00003415857,0.00004229028,0.00012313943,0.000022118567,0.000022677887,0.000073682655,0.00012769451,0.1024956,0.00051963597,0.89399546,0.0025217065,0.000021810005],"about_ca_topic_score_codex":0.0027029559,"about_ca_topic_score_gemma":0.0022537326,"teacher_disagreement_score":0.007093694,"about_ca_system_score_codex":0.0026054198,"about_ca_system_score_gemma":0.002276177,"threshold_uncertainty_score":0.023730755},"labels":[],"label_agreement":null},{"id":"W2065138042","doi":"10.1007/s00224-008-9153-7","title":"The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete","year":2008,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quadratic equation; Mathematics; NP-complete; Combinatorics; Group (periodic table); Applied mathematics; Time complexity; Physics; Geometry","score_opus":0.08172012897673582,"score_gpt":0.302626261127527,"score_spread":0.2209061321507912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065138042","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.5612833,0.0032867342,0.3081833,0.057473905,0.0009813068,0.0006847311,0.010340649,0.0022586077,0.05550739],"genre_scores_gemma":[0.90495527,0.0017190743,0.06261037,0.0023043465,0.0014137395,0.0003661847,0.0063738343,0.0004469421,0.019810118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974456,0.0004434336,0.00016420662,0.0008085497,0.000625276,0.0005128705],"domain_scores_gemma":[0.97404724,0.022854645,0.0009229654,0.0009104683,0.0007382097,0.00052639865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014916401,0.0012390569,0.0025869198,0.00096486736,0.0034826745,0.0062932735,0.0030130593,0.0032012765,0.013403199],"category_scores_gemma":[0.0108787315,0.0012432163,0.0030203164,0.0022970124,0.0043409574,0.014323277,0.00337842,0.00925469,0.0013133972],"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.0015670793,0.0010563652,0.006870938,0.0032524504,0.00067758316,0.0014417508,0.0031667196,0.09599845,0.0063377083,0.71554023,0.06620884,0.0978819],"study_design_scores_gemma":[0.0003417358,0.000045615467,0.0005397218,0.000048206606,0.0000922117,0.00025979226,0.00038587762,0.04933795,0.001750899,0.9423467,0.0048077754,0.000043473938],"about_ca_topic_score_codex":0.0065204385,"about_ca_topic_score_gemma":0.007382953,"teacher_disagreement_score":0.013403199,"about_ca_system_score_codex":0.0030551578,"about_ca_system_score_gemma":0.0033113603,"threshold_uncertainty_score":0.04483819},"labels":[],"label_agreement":null},{"id":"W2068006581","doi":"10.1007/s00224-005-1269-4","title":"A Simple 3-Edge-Connected Component Algorithm","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Simple (philosophy); Component (thermodynamics); Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Mathematics; Artificial intelligence; Physics","score_opus":0.014381375958604416,"score_gpt":0.238066302380063,"score_spread":0.22368492642145857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068006581","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.015991217,0.00027658787,0.9709132,0.000263293,0.00022356962,0.00021075558,0.0001924185,0.0023815336,0.009547544],"genre_scores_gemma":[0.09815446,0.00018444861,0.8917364,0.00015451259,0.00007709881,0.00023869764,0.00048037778,0.00039764526,0.008576305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.000084680745,0.000031962736,0.00010365155,0.00014547746,0.000056602457],"domain_scores_gemma":[0.999446,0.00013577653,0.0000254224,0.0001690506,0.00017554592,0.000048345617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044189402,0.0009880385,0.0012018249,0.0009969805,0.0008268893,0.0012966131,0.0022193096,0.0014738834,0.017022515],"category_scores_gemma":[0.0023424816,0.00046767274,0.0006606867,0.0016219205,0.000473067,0.0021263366,0.0015545343,0.0008879149,0.004810193],"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.0007771446,0.00031888232,0.0006545711,0.00035201953,0.00010314642,0.00014478479,0.00009993337,0.10420443,0.011671568,0.067913786,0.0241256,0.78963405],"study_design_scores_gemma":[0.00033558562,0.00016119458,0.00046044512,0.000037490212,0.00007709913,0.00022151788,0.000037062127,0.89678276,0.0068716067,0.07532586,0.019648131,0.00004119167],"about_ca_topic_score_codex":0.0020555377,"about_ca_topic_score_gemma":0.0031635857,"teacher_disagreement_score":0.017022515,"about_ca_system_score_codex":0.0005658179,"about_ca_system_score_gemma":0.0012681367,"threshold_uncertainty_score":0.05694598},"labels":[],"label_agreement":null},{"id":"W2068458312","doi":"10.1007/s00224-010-9263-x","title":"Randomness on Computable Probability Spaces—A Dynamical Point of View","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Randomness; Ergodic theory; Mathematics; Pointwise; Point (geometry); Mixing (physics); Computable analysis; Discrete mathematics; Pure mathematics; Computable function; Mathematical analysis","score_opus":0.015557387784364229,"score_gpt":0.24657308649536594,"score_spread":0.23101569871100172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068458312","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.079340085,0.0052147694,0.84450966,0.016291207,0.0008202509,0.00008787474,0.00053156214,0.00024877657,0.052955862],"genre_scores_gemma":[0.9279361,0.0037516588,0.047767963,0.0013039919,0.0028647317,0.00029456295,0.00039416802,0.00019852171,0.01548832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722654,0.0011303304,0.0001481403,0.00044194525,0.0008009283,0.0002521502],"domain_scores_gemma":[0.9902773,0.0065215994,0.00058705534,0.0012237675,0.0008807837,0.0005095665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031964886,0.00094384403,0.0018293521,0.0024927347,0.0020104875,0.005719862,0.0031097338,0.0031231216,0.004502142],"category_scores_gemma":[0.010570962,0.0008909051,0.0024755076,0.0013579561,0.009231799,0.013791278,0.0035882536,0.0044283634,0.0004342905],"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.000003670829,0.000004480153,0.000050273742,0.000015282465,0.0000067270976,0.000016819196,0.00003749784,0.0024895975,0.00012237819,0.99668854,0.0001286701,0.00043605213],"study_design_scores_gemma":[0.000007586554,0.000009451088,0.00007533401,0.000007560906,0.000004472551,0.000023695586,0.000016581229,0.012952592,0.0000777084,0.9859877,0.00082764466,0.00000964221],"about_ca_topic_score_codex":0.0013942795,"about_ca_topic_score_gemma":0.0007266174,"teacher_disagreement_score":0.005719862,"about_ca_system_score_codex":0.0031710153,"about_ca_system_score_gemma":0.0013567171,"threshold_uncertainty_score":0.023007393},"labels":[],"label_agreement":null},{"id":"W2071784365","doi":"10.1007/s00224-004-1190-2","title":"Complete Classifications for the Communication Complexity of Regular Languages","year":2004,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Linguistics; Philosophy","score_opus":0.0637492406813639,"score_gpt":0.2897090998430529,"score_spread":0.22595985916168898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071784365","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.21820791,0.0053272964,0.65292823,0.010591998,0.0007595194,0.0002569432,0.00400098,0.0011218324,0.10680533],"genre_scores_gemma":[0.8860229,0.0028462012,0.07046929,0.0014725939,0.0024335135,0.0011573153,0.004736301,0.00069879694,0.030163042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99355537,0.0015529579,0.00050050864,0.0012017915,0.0023115615,0.00087765977],"domain_scores_gemma":[0.94605714,0.041303143,0.002352277,0.005250106,0.0033275664,0.0017099263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005276739,0.0016900735,0.0026487894,0.00545179,0.0038155068,0.010681844,0.0045987545,0.00417109,0.018959519],"category_scores_gemma":[0.029261613,0.0012122968,0.0025194497,0.0046977075,0.006186601,0.030812738,0.005119076,0.008994316,0.0022922636],"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.000056689834,0.000030086647,0.00034387648,0.000079230645,0.000010875587,0.000020767953,0.00029896514,0.0021787588,0.0002248724,0.9862889,0.003525697,0.006941205],"study_design_scores_gemma":[0.000011247481,0.000008308208,0.00019013969,0.000021376827,0.000009871351,0.000032339853,0.000065866996,0.009814542,0.00017844535,0.98787606,0.0017763105,0.000015425252],"about_ca_topic_score_codex":0.0010741799,"about_ca_topic_score_gemma":0.0007878926,"teacher_disagreement_score":0.018959519,"about_ca_system_score_codex":0.0045255376,"about_ca_system_score_gemma":0.0016737778,"threshold_uncertainty_score":0.0634259},"labels":[],"label_agreement":null},{"id":"W2076003965","doi":"10.1007/s00224-003-1082-x","title":"Automatable Verification of Sequential Consistency","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Undecidable problem; Consistency model; Sequential consistency; Computer science; Consistency (knowledge bases); Decidability; Class (philosophy); Protocol (science); Task (project management); Theoretical computer science; State (computer science); Multiprocessing; Programming language; Finite-state machine; Model checking; Parallel computing; Artificial intelligence; Correctness","score_opus":0.020711842044976784,"score_gpt":0.24722852933840578,"score_spread":0.226516687293429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076003965","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.065239355,0.0001918661,0.9167036,0.001631638,0.00040726777,0.00021105634,0.00039182004,0.00501517,0.010208291],"genre_scores_gemma":[0.8666423,0.00014065325,0.12605909,0.00054870086,0.00020264735,0.00025938873,0.00052434055,0.00052227866,0.0051004677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99019533,0.0032572898,0.00072370685,0.001671584,0.0029792995,0.0011727719],"domain_scores_gemma":[0.93359333,0.04880038,0.0019973908,0.009373754,0.005480037,0.0007550719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005677766,0.0010909021,0.0014727259,0.0015218091,0.002030646,0.004294088,0.0035212748,0.0023461538,0.0068746004],"category_scores_gemma":[0.038113188,0.0014180831,0.002633989,0.0011012496,0.006176226,0.00880583,0.0052544754,0.005925876,0.0010566622],"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.0011889976,0.00032520626,0.002154763,0.000484978,0.0001822588,0.00058079127,0.0009679937,0.0908497,0.01552686,0.82962215,0.005936623,0.052179612],"study_design_scores_gemma":[0.00018994082,0.000077995355,0.0002230845,0.000045314933,0.00007801975,0.00008371064,0.00008792987,0.2913494,0.015308187,0.68966424,0.002848379,0.000043813725],"about_ca_topic_score_codex":0.0053265635,"about_ca_topic_score_gemma":0.0062771137,"teacher_disagreement_score":0.0068746004,"about_ca_system_score_codex":0.0031477055,"about_ca_system_score_gemma":0.0052042454,"threshold_uncertainty_score":0.03002721},"labels":[],"label_agreement":null},{"id":"W2076983944","doi":"10.1007/s00224-002-1033-y","title":"Routing in Series Parallel Networks","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Series (stratigraphy); Computer science; Routing (electronic design automation); Parallel computing; Computer network; Geology","score_opus":0.014618892094267057,"score_gpt":0.22344835629857523,"score_spread":0.20882946420430817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076983944","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.08610388,0.0048447675,0.8560532,0.0020663505,0.0009252579,0.00009216256,0.00024110865,0.00089883833,0.04877447],"genre_scores_gemma":[0.82138443,0.007894067,0.11622857,0.0005344949,0.0009901065,0.00023105796,0.00059449713,0.000336843,0.051805798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996848,0.00009239956,0.000022550195,0.00007225945,0.00009154054,0.000036517995],"domain_scores_gemma":[0.9991252,0.00041346933,0.00012511009,0.0001290105,0.00014854016,0.000058793812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051237975,0.00045200036,0.0006435862,0.0008338419,0.00063967897,0.0016922115,0.0007394052,0.0007159314,0.0049871034],"category_scores_gemma":[0.0026541776,0.000418169,0.0004182864,0.0011952348,0.0007580442,0.001986197,0.00066247163,0.00081315427,0.00067230285],"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.000121813384,0.000053171276,0.0004894658,0.0001674784,0.000037946094,0.000107606604,0.000112033245,0.20980398,0.0037999982,0.701299,0.008378066,0.07562946],"study_design_scores_gemma":[0.000023155844,0.000035483135,0.0001609652,0.000018771498,0.000026022877,0.000097451266,0.00003020028,0.36707157,0.0010161566,0.61972404,0.011784879,0.000011319253],"about_ca_topic_score_codex":0.0010065454,"about_ca_topic_score_gemma":0.00094532844,"teacher_disagreement_score":0.0049871034,"about_ca_system_score_codex":0.0008290913,"about_ca_system_score_gemma":0.0005385289,"threshold_uncertainty_score":0.01668346},"labels":[],"label_agreement":null},{"id":"W2086421997","doi":"10.1007/s00224-005-1206-6","title":"Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Template; Recombination; Biology; Materials science; Genetics; Nanotechnology; Gene","score_opus":0.018003127341171224,"score_gpt":0.24286196700790172,"score_spread":0.22485883966673048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086421997","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.59261405,0.0023952608,0.38551208,0.0013546873,0.00016734608,0.000055552344,0.0001154553,0.0005779673,0.017207582],"genre_scores_gemma":[0.9705692,0.00051527703,0.026126822,0.00008534648,0.00003223393,0.000055241526,0.00007016769,0.00009946643,0.0024462952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994524,0.00014283149,0.000037315473,0.00008849371,0.00019686416,0.00008214201],"domain_scores_gemma":[0.9977736,0.0013256152,0.00023275336,0.0003765586,0.00014538312,0.00014615062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008824508,0.00027895923,0.0006017723,0.0005632363,0.0009611616,0.0016838977,0.0015879081,0.0019006305,0.001142109],"category_scores_gemma":[0.0045679887,0.0005133518,0.0007363187,0.00043396585,0.0021545342,0.001730232,0.0010593019,0.0012246514,0.00031837024],"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.00010155876,0.000039256873,0.0007888986,0.000103601444,0.000020622861,0.00036506838,0.0005689636,0.0665705,0.033625167,0.88024426,0.0006168049,0.01695535],"study_design_scores_gemma":[0.000036273643,0.00006901881,0.0004206222,0.000024228204,0.000018388866,0.00028104073,0.00013905374,0.30107063,0.018890256,0.6766697,0.0023441277,0.000036689118],"about_ca_topic_score_codex":0.0006558951,"about_ca_topic_score_gemma":0.00064109615,"teacher_disagreement_score":0.0019006305,"about_ca_system_score_codex":0.0010281355,"about_ca_system_score_gemma":0.0005673873,"threshold_uncertainty_score":0.0074597},"labels":[],"label_agreement":null},{"id":"W2092863347","doi":"10.1007/s00224-011-9379-7","title":"Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Terrain; Asynchronous communication; Polygon (computer graphics); Computer science; Bounded function; Trajectory; Point (geometry); Algorithm; Mathematics; Geometry; Geography; Frame (networking); Mathematical analysis; Engineering","score_opus":0.06548969616562526,"score_gpt":0.28180400628514773,"score_spread":0.21631431011952246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092863347","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.6649819,0.0005435252,0.32078478,0.00061316026,0.000112804366,0.00006205658,0.00017927542,0.00038720833,0.012335296],"genre_scores_gemma":[0.98834026,0.000083507235,0.0094132405,0.000021218333,0.000012650957,0.000023152923,0.000053455733,0.000030100442,0.0020224801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994935,0.00011659023,0.000027028185,0.00010160185,0.00012317226,0.00013802704],"domain_scores_gemma":[0.99771833,0.0013082923,0.00028079937,0.0002526904,0.00018045196,0.0002594675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492535,0.0005013783,0.0012484916,0.0006747906,0.0013044532,0.0014944708,0.0018941036,0.0010915353,0.0025050223],"category_scores_gemma":[0.0054201656,0.00062946574,0.0005526082,0.00067171047,0.0017924247,0.0017557081,0.0027127208,0.0007464891,0.00026203587],"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.00036119018,0.000035814686,0.0009006448,0.000053268745,0.000031882595,0.00023197461,0.00016480616,0.952221,0.0020756316,0.03731753,0.00055541727,0.0060508195],"study_design_scores_gemma":[0.000026334914,0.000019557889,0.00013937893,0.0000033361976,0.0000061461333,0.000019195817,0.000050415183,0.9862818,0.0004066639,0.012791777,0.00024890027,0.0000065392187],"about_ca_topic_score_codex":0.008524616,"about_ca_topic_score_gemma":0.007246266,"teacher_disagreement_score":0.008524616,"about_ca_system_score_codex":0.0009145153,"about_ca_system_score_gemma":0.0006342681,"threshold_uncertainty_score":0.016950011},"labels":[],"label_agreement":null},{"id":"W2096141465","doi":"10.1007/s00224-014-9601-5","title":"Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Copula (linguistics); Upper and lower bounds; Computer science; Scheduling (production processes); Randomized algorithm; Mathematical optimization; Mathematics; Algorithm; Econometrics","score_opus":0.13482231107322407,"score_gpt":0.4017495056858833,"score_spread":0.26692719461265924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096141465","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.049190328,0.0003767331,0.9435964,0.0009824774,0.00020834971,0.00032944058,0.0001534766,0.0007804331,0.0043824087],"genre_scores_gemma":[0.8112393,0.00035639232,0.18093169,0.00040015028,0.0002761238,0.0006961837,0.00020371299,0.00028610788,0.00561039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98693967,0.0077347797,0.0006483711,0.0016646403,0.0013037047,0.0017088471],"domain_scores_gemma":[0.94872785,0.036469545,0.004433316,0.0061014784,0.0021132003,0.002154565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017793644,0.0020317547,0.006148949,0.0017124612,0.0022776297,0.0061613317,0.008103325,0.004209801,0.008596208],"category_scores_gemma":[0.057947744,0.0023645037,0.002526751,0.0028116393,0.0042643617,0.008325658,0.0046516825,0.005105383,0.0011442973],"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.0016013773,0.0007060548,0.00046574496,0.00038717955,0.000216202,0.0001807908,0.00033647823,0.5258795,0.0021285012,0.43542454,0.004959347,0.027714299],"study_design_scores_gemma":[0.00017834743,0.00012358301,0.000086505446,0.000024816984,0.000039688377,0.000035585184,0.000021930506,0.8093188,0.00035236494,0.18941005,0.00037677697,0.0000316315],"about_ca_topic_score_codex":0.0016883542,"about_ca_topic_score_gemma":0.0018111134,"teacher_disagreement_score":0.017793644,"about_ca_system_score_codex":0.0043936106,"about_ca_system_score_gemma":0.005620002,"threshold_uncertainty_score":0.09410292},"labels":[],"label_agreement":null},{"id":"W2096830858","doi":"10.1007/s00224-014-9539-7","title":"Probabilistic k-Median Clustering in Data Streams","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Probabilistic logic; Mathematics; Cluster analysis; Representation (politics); Metric (unit); Probability distribution; Euclidean geometry; Point (geometry); Probabilistic analysis of algorithms; Combinatorics; Statistics","score_opus":0.03428720038795635,"score_gpt":0.25713929499946075,"score_spread":0.2228520946115044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096830858","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.015937317,0.00037361626,0.9826132,0.0002474271,0.000053881686,0.000037167458,0.000118688295,0.00023999944,0.00037875428],"genre_scores_gemma":[0.62828666,0.0012173016,0.3640312,0.00015621557,0.00039989353,0.0002812068,0.0010717507,0.00025525448,0.004300567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964414,0.0011288924,0.00031544102,0.00075461157,0.0010686835,0.00029081607],"domain_scores_gemma":[0.98837435,0.0074186553,0.00095698214,0.0011208782,0.0017960314,0.00033310914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005619589,0.00072395353,0.002510605,0.0025975555,0.0013947337,0.0029370289,0.0033535012,0.0022514914,0.0015715461],"category_scores_gemma":[0.024687503,0.0011543673,0.0013943837,0.004352227,0.0015614413,0.0044815037,0.002188617,0.0018748741,0.0005373481],"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.0005072544,0.00009071727,0.0028812794,0.00022281265,0.00011710291,0.00010999331,0.0002718801,0.8565718,0.0013718596,0.06582125,0.002330668,0.06970332],"study_design_scores_gemma":[0.000007724105,0.000011987983,0.00021682866,0.000007941034,0.000006783321,0.000023200939,0.000028075625,0.96792555,0.0003042706,0.031069512,0.00038912575,0.000008908764],"about_ca_topic_score_codex":0.004731608,"about_ca_topic_score_gemma":0.0037739181,"teacher_disagreement_score":0.005619589,"about_ca_system_score_codex":0.002183562,"about_ca_system_score_gemma":0.0015475368,"threshold_uncertainty_score":0.029719591},"labels":[],"label_agreement":null},{"id":"W2107000858","doi":"10.1007/s00224-007-9049-y","title":"Incremental Branching Programs","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"McGill University","keywords":"Branching (polymer chemistry); Nondeterministic algorithm; Computation; Computer science; Exponential function; Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.0161668605177624,"score_gpt":0.24632149893553537,"score_spread":0.23015463841777298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107000858","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.06041007,0.0017535156,0.6896561,0.0031981405,0.00041697038,0.00016519077,0.0007661605,0.0020405916,0.24159332],"genre_scores_gemma":[0.7881413,0.0013165046,0.13479617,0.00077166973,0.00051659375,0.0002472384,0.0011388122,0.00054277567,0.07252906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.00017605061,0.00003674769,0.00018264986,0.00027435887,0.000099459394],"domain_scores_gemma":[0.9979875,0.001166519,0.00006895375,0.00030906696,0.00031872425,0.00014912173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007118579,0.00060134596,0.0006487404,0.0012592047,0.0014888629,0.002937755,0.0013676345,0.00096270314,0.015349954],"category_scores_gemma":[0.0035703105,0.00047442853,0.00086790696,0.0017092932,0.0022853613,0.0061293687,0.0023082572,0.0032233251,0.0016948413],"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.0000214367,0.000018462415,0.00010241342,0.000027975448,0.0000044408234,0.000026975818,0.00011946492,0.0009197171,0.0004639227,0.98439145,0.0020183485,0.011885457],"study_design_scores_gemma":[0.00000871098,0.0000071296236,0.00008733719,0.000009091254,0.000011950421,0.000037267808,0.000030818763,0.007599052,0.000563389,0.9839197,0.0077199014,0.0000056298986],"about_ca_topic_score_codex":0.0012917639,"about_ca_topic_score_gemma":0.0014324875,"teacher_disagreement_score":0.015349954,"about_ca_system_score_codex":0.001715917,"about_ca_system_score_gemma":0.0009692102,"threshold_uncertainty_score":0.051350713},"labels":[],"label_agreement":null},{"id":"W2114282507","doi":"10.1007/s00224-013-9462-3","title":"Braess’s Paradox for Flows over Time","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transpose; Conjecture; Flow (mathematics); Network topology; Context (archaeology); Mathematics; Computer science; Flow network; Mathematical economics; Topology (electrical circuits); Mathematical optimization; Discrete mathematics; Combinatorics; Physics; Geometry; Geology; Quantum mechanics","score_opus":0.06699727172578591,"score_gpt":0.35278108489692356,"score_spread":0.28578381317113766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114282507","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.13260224,0.0055099055,0.6859211,0.03359161,0.0010176902,0.0001830419,0.0006646637,0.00024375475,0.14026605],"genre_scores_gemma":[0.9152,0.0020060912,0.060701836,0.0018880498,0.000593786,0.00026266027,0.00016506416,0.00010861614,0.019073872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549145,0.0021789735,0.00028865167,0.00070280663,0.0008976184,0.00044058432],"domain_scores_gemma":[0.97122395,0.022209184,0.0011113234,0.0025066948,0.0016259688,0.0013227583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009517485,0.0007123458,0.0019798526,0.0022524635,0.0029495487,0.008172478,0.0023126176,0.004909772,0.011231204],"category_scores_gemma":[0.050613478,0.00065269525,0.0015256782,0.0023354525,0.010512175,0.02295928,0.0039744666,0.0062079546,0.0006980773],"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.000010535032,0.0000052890778,0.000038177943,0.000016109892,0.0000053589,0.000014337251,0.000075318516,0.0012381999,0.000034842622,0.99711597,0.00046860176,0.0009772948],"study_design_scores_gemma":[0.0000062546874,0.000001928755,0.000015128169,0.000005179639,0.0000020707228,0.000009785045,0.000015931955,0.0034540861,0.000013257448,0.9959592,0.0005137848,0.0000034294437],"about_ca_topic_score_codex":0.0025942617,"about_ca_topic_score_gemma":0.0014838115,"teacher_disagreement_score":0.011231204,"about_ca_system_score_codex":0.0034078152,"about_ca_system_score_gemma":0.0030497136,"threshold_uncertainty_score":0.050333917},"labels":[],"label_agreement":null},{"id":"W2124257703","doi":"10.1007/s00224-004-1210-2","title":"A Note on MODp - MODm Circuits","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Electronic circuit; Constant (computer programming); Prime (order theory); Mathematics; Layer (electronics); Prime power; Computer science; Discrete mathematics; Arithmetic; Combinatorics; Physics; Nanotechnology; Materials science; Quantum mechanics","score_opus":0.02779862653046497,"score_gpt":0.26227526526526934,"score_spread":0.23447663873480437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124257703","genre_codex":"other","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.024326691,0.035324227,0.20052208,0.10217873,0.025127228,0.0001343081,0.0010933953,0.00086850935,0.6104248],"genre_scores_gemma":[0.56274265,0.03240059,0.1386903,0.030778656,0.042517733,0.00052978855,0.0010705515,0.0010981244,0.19017154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864703,0.00036305236,0.00005331686,0.0003269257,0.00044933343,0.00016043251],"domain_scores_gemma":[0.9963565,0.0025429279,0.00009121498,0.0006066023,0.00027277353,0.00012997736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016642341,0.001083308,0.0013926857,0.0021117528,0.003111711,0.003619255,0.0024387364,0.0024295452,0.015044529],"category_scores_gemma":[0.0062609543,0.0006156024,0.0013614207,0.0030008415,0.0052232933,0.013205139,0.004012515,0.008613964,0.0028347664],"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.000016380129,0.0000072811886,0.000054212065,0.000060283583,0.000004637112,0.0000353111,0.000040593903,0.00029434802,0.00016327827,0.9681829,0.019850045,0.011290693],"study_design_scores_gemma":[0.000004909682,0.00000784315,0.00006346954,0.000017270859,0.000004846992,0.00007651479,0.0000133970225,0.00083386386,0.00021568441,0.9565008,0.04225472,0.000006682824],"about_ca_topic_score_codex":0.0008870723,"about_ca_topic_score_gemma":0.0012142637,"teacher_disagreement_score":0.015044529,"about_ca_system_score_codex":0.0026477505,"about_ca_system_score_gemma":0.00085935695,"threshold_uncertainty_score":0.05032903},"labels":[],"label_agreement":null},{"id":"W2152951955","doi":"10.1007/s00224-002-1066-2","title":"Bulk Synchronous Parallel Algorithms for the External Memory Model","year":2002,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parallel computing; Algorithm","score_opus":0.038564986612626403,"score_gpt":0.26619390324245,"score_spread":0.2276289166298236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152951955","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.03449458,0.0007877256,0.9431067,0.00080218504,0.00025482362,0.000037323338,0.00013683464,0.0007131142,0.01966667],"genre_scores_gemma":[0.72461206,0.0011000527,0.24360177,0.00045507489,0.00042888886,0.00021651738,0.00037504514,0.00068518927,0.028525416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997365,0.000082766834,0.000013841346,0.00004334135,0.00007780106,0.00004572676],"domain_scores_gemma":[0.9992281,0.0003558322,0.000049881055,0.00020230208,0.00010999078,0.00005394565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831032,0.0005461195,0.00081594696,0.00039530487,0.00045842034,0.0011719442,0.0014085606,0.0007912597,0.0074625215],"category_scores_gemma":[0.0025728864,0.0003114871,0.00044916212,0.0006406787,0.00075851206,0.0032307506,0.0014311629,0.0017335205,0.00111434],"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.0003539885,0.00008939372,0.0002607055,0.00015126601,0.000033623564,0.00009723874,0.000086746375,0.17519985,0.00318636,0.77326506,0.008804151,0.038471594],"study_design_scores_gemma":[0.000056141544,0.000017828199,0.000046733832,0.0000059620133,0.000011161933,0.000017952234,0.00001039172,0.69501656,0.0008350779,0.301999,0.0019763983,0.0000067994374],"about_ca_topic_score_codex":0.00087470136,"about_ca_topic_score_gemma":0.0011873585,"teacher_disagreement_score":0.0074625215,"about_ca_system_score_codex":0.000651191,"about_ca_system_score_gemma":0.0006356821,"threshold_uncertainty_score":0.02496463},"labels":[],"label_agreement":null},{"id":"W2168635355","doi":"10.1007/s00224-010-9254-y","title":"On the Complexity of Computing Winning Strategies for Finite Poset Games","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Partially ordered set; Infimum and supremum; Combinatorial game theory; PSPACE; Argument (complex analysis); Mathematics; Combinatorics; Game theory; Simple (philosophy); Theoretical computer science; Computer science; Discrete mathematics; Computational complexity theory; Mathematical economics; Sequential game; Algorithm; Epistemology","score_opus":0.08009168828994542,"score_gpt":0.31178092937789276,"score_spread":0.23168924108794733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168635355","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.3831392,0.0023788095,0.54578507,0.011845431,0.0003923346,0.0006158431,0.0022365842,0.0014710702,0.05213572],"genre_scores_gemma":[0.8772387,0.0013640978,0.106198095,0.0009493255,0.0005730742,0.0005254118,0.0028257866,0.0005785375,0.009746979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98694694,0.0041955756,0.0011604436,0.0022401074,0.003582067,0.0018748643],"domain_scores_gemma":[0.8783607,0.10868179,0.0028033825,0.0052633802,0.0025292125,0.0023615696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069830595,0.0020696446,0.0041960827,0.0036263878,0.003924009,0.017384907,0.0057774,0.0046276334,0.017565746],"category_scores_gemma":[0.07100796,0.0022814819,0.0052325386,0.0050617605,0.007896888,0.03678782,0.009071345,0.009839365,0.0014520274],"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.0014433985,0.0006289858,0.005645386,0.0007725141,0.000330577,0.00031626623,0.0018363394,0.11304087,0.0020678341,0.81762916,0.00873681,0.04755175],"study_design_scores_gemma":[0.00009260918,0.00004938935,0.00041403153,0.000034523677,0.00006739113,0.00007291696,0.00018096376,0.115603834,0.000518312,0.8820969,0.00082927255,0.000039965027],"about_ca_topic_score_codex":0.007706684,"about_ca_topic_score_gemma":0.009402787,"teacher_disagreement_score":0.017565746,"about_ca_system_score_codex":0.007131466,"about_ca_system_score_gemma":0.0056949374,"threshold_uncertainty_score":0.058763325},"labels":[],"label_agreement":null},{"id":"W2179209375","doi":"10.1007/s00224-011-9343-6","title":"The Feline Josephus Problem","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fibonacci number; Element (criminal law); Sequence (biology); Value (mathematics); Combinatorics; Mathematics; Order (exchange); Position (finance); Arithmetic; Constant (computer programming); Computer science; Statistics; Law","score_opus":0.077392365069908,"score_gpt":0.2993293293321627,"score_spread":0.22193696426225473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179209375","genre_codex":"other","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.14456776,0.0047142087,0.09228978,0.06578783,0.0019906552,0.000065933324,0.00062936667,0.0003910205,0.6895634],"genre_scores_gemma":[0.8749222,0.0024043832,0.018204695,0.0033317548,0.0013669791,0.00007919662,0.00037865268,0.00016555794,0.09914658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992594,0.00021848694,0.000023094817,0.00016097806,0.00019191384,0.00014610217],"domain_scores_gemma":[0.99817884,0.001127101,0.00008742528,0.00021398097,0.0002066478,0.00018591537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011115607,0.00033764014,0.0009431815,0.0010302828,0.0042433054,0.003245109,0.0012358133,0.0031043417,0.015739866],"category_scores_gemma":[0.007137448,0.0003311075,0.0005345645,0.0012144356,0.0038270568,0.0070539024,0.0023832584,0.0038568198,0.0013506331],"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.000015087073,0.00000737233,0.00005029585,0.000017194734,0.0000025692566,0.00001907032,0.00006400028,0.0004424136,0.000053755513,0.9893917,0.006211841,0.0037245604],"study_design_scores_gemma":[0.00000867739,0.0000027450415,0.000046223504,0.000008185877,0.0000025033269,0.00003141063,0.00006491443,0.0018953768,0.000114993854,0.98815197,0.009668524,0.000004443548],"about_ca_topic_score_codex":0.0025014803,"about_ca_topic_score_gemma":0.0022939174,"teacher_disagreement_score":0.015739866,"about_ca_system_score_codex":0.0021998032,"about_ca_system_score_gemma":0.0014412998,"threshold_uncertainty_score":0.0526551},"labels":[],"label_agreement":null},{"id":"W2179929754","doi":"10.1007/s00224-013-9483-y","title":"Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Plane (geometry); Beam (structure); Wireless sensor network; Sensor array; Computer science; Real-time computing; Acoustics; Physics; Optics; Mathematics; Geometry; Computer network","score_opus":0.023005740920201377,"score_gpt":0.24186194201146807,"score_spread":0.2188562010912667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179929754","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.012840598,0.0012371839,0.9835526,0.00034771347,0.00009571323,0.000030402503,0.000048536753,0.00008454076,0.0017626263],"genre_scores_gemma":[0.7042545,0.0028620574,0.28744116,0.00020138596,0.0002462458,0.000186123,0.00013188284,0.000058515227,0.0046180845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902344,0.0004325577,0.00004386738,0.0002000053,0.00021573078,0.000084480664],"domain_scores_gemma":[0.99856395,0.00089996686,0.00017591835,0.00012643775,0.00019212936,0.000041657306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332621,0.0007388294,0.0012081676,0.00064316683,0.00052658323,0.00093639124,0.0012113929,0.00082458195,0.0015494219],"category_scores_gemma":[0.0043221675,0.00053720595,0.00040484004,0.0009906292,0.0011285293,0.002298231,0.0009419314,0.0008082291,0.00021885219],"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.00024521182,0.00007449652,0.0005536753,0.00014847623,0.000048520305,0.000038764414,0.00006861331,0.8195182,0.0063117174,0.10312,0.0020884012,0.067784],"study_design_scores_gemma":[0.000012306521,0.00003382804,0.0001647364,0.000008549375,0.00001268115,0.000018216953,0.000013623026,0.96228015,0.0008667795,0.03572572,0.0008541453,0.000009207556],"about_ca_topic_score_codex":0.001687145,"about_ca_topic_score_gemma":0.003026573,"teacher_disagreement_score":0.001687145,"about_ca_system_score_codex":0.0012598609,"about_ca_system_score_gemma":0.00082657306,"threshold_uncertainty_score":0.009140968},"labels":[],"label_agreement":null},{"id":"W2402414534","doi":"10.1007/s00224-017-9817-2","title":"The Algebraic Theory of Parikh Automata","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Unary operation; Automaton; Regular language; Affine transformation; Closure (psychology); Mathematics; Discrete mathematics; Algebraic theory; Automata theory; Set (abstract data type); Quantum finite automata; Algebraic number; Algebra over a field; Computer science; Pure mathematics; Theoretical computer science; Programming language","score_opus":0.021471962263549357,"score_gpt":0.2563282494109741,"score_spread":0.23485628714742474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402414534","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.06381039,0.009231018,0.70322764,0.008164525,0.0014356817,0.00009384118,0.00061819283,0.0006821608,0.21273659],"genre_scores_gemma":[0.8853626,0.005049791,0.07387745,0.001300158,0.002598147,0.00024472023,0.0005002572,0.00020105061,0.03086577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789006,0.0006694697,0.00013899602,0.00046913238,0.00062486203,0.00020756497],"domain_scores_gemma":[0.996754,0.0018151596,0.0002097954,0.0005639148,0.00046187505,0.00019522938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017499377,0.0007751084,0.0014753325,0.0022499368,0.0031703855,0.0062777237,0.001819188,0.0015689826,0.008035589],"category_scores_gemma":[0.0053801388,0.0007637328,0.0016744694,0.0027832561,0.009452407,0.015851282,0.00328969,0.0047545005,0.0020119862],"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.000005467446,0.0000033955073,0.000020279609,0.000017534698,0.00000192062,0.0000100967445,0.000072798124,0.00024782008,0.00006601572,0.99795014,0.00032574186,0.0012786336],"study_design_scores_gemma":[0.0000038339067,0.0000034542743,0.0000129222935,0.00000459292,0.0000018629331,0.000015631178,0.000015609607,0.00094296347,0.000056058543,0.9963875,0.0025524292,0.000003100357],"about_ca_topic_score_codex":0.0011642211,"about_ca_topic_score_gemma":0.00058271637,"teacher_disagreement_score":0.008035589,"about_ca_system_score_codex":0.00284922,"about_ca_system_score_gemma":0.0013764205,"threshold_uncertainty_score":0.026881754},"labels":[],"label_agreement":null},{"id":"W2467644617","doi":"10.1007/s00224-015-9649-x","title":"On the Advice Complexity of the k-server Problem Under Sparse Metrics","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Advice (programming); Combinatorics; Binary logarithm; Competitive analysis; Mathematics; Online algorithm; Metric space; Discrete mathematics; Upper and lower bounds; Sequence (biology); Metric (unit); Tree (set theory); Deterministic algorithm; Path (computing); Time complexity; Graph; Algorithm; Computer science; Pathwidth; Line graph","score_opus":0.12073271240766795,"score_gpt":0.2864676065370435,"score_spread":0.16573489412937556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467644617","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.31414837,0.006309311,0.58498913,0.03573401,0.0008123221,0.0004250627,0.003091337,0.0011918347,0.05329864],"genre_scores_gemma":[0.8930582,0.00393094,0.07613857,0.0018669915,0.0017796989,0.000577081,0.002030386,0.0007918868,0.019826174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934783,0.0027484137,0.00031007503,0.0008764483,0.0015355223,0.0010512561],"domain_scores_gemma":[0.8734667,0.11209063,0.0034549467,0.0040918333,0.0036139209,0.003282044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063918117,0.0020249565,0.0048185545,0.0022478567,0.0021614332,0.0060332534,0.005597012,0.0058062826,0.019089915],"category_scores_gemma":[0.08712261,0.0014570722,0.0014566053,0.0039053925,0.0053131804,0.017245056,0.0055116443,0.007830597,0.0015189325],"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.001206994,0.0003769221,0.003075483,0.0007630459,0.00015153535,0.00026435088,0.00074979995,0.24396513,0.0017989305,0.68873376,0.024891311,0.03402265],"study_design_scores_gemma":[0.0001094889,0.00004868996,0.0005422097,0.00004585524,0.000029751569,0.00007066924,0.00010217427,0.47733825,0.00021155662,0.52066714,0.00080119,0.000033033804],"about_ca_topic_score_codex":0.0073581454,"about_ca_topic_score_gemma":0.0067596273,"teacher_disagreement_score":0.019089915,"about_ca_system_score_codex":0.005153745,"about_ca_system_score_gemma":0.0051329494,"threshold_uncertainty_score":0.063862085},"labels":[],"label_agreement":null},{"id":"W2472280164","doi":"10.1007/s00224-016-9691-3","title":"Multi-processor Search and Scheduling Problems with Setup Cost","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Schedule; Scheduling (production processes); Mathematical optimization; Set (abstract data type); Multiprocessing; Dynamic programming; Computation; Multiprocessor scheduling; Job shop scheduling; Parallel computing; Algorithm; Mathematics; Flow shop scheduling","score_opus":0.03973861380122752,"score_gpt":0.273707058850325,"score_spread":0.23396844504909747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472280164","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.050144415,0.004331075,0.9240896,0.0041803033,0.00070962723,0.0004184745,0.0008542568,0.00048539124,0.014786862],"genre_scores_gemma":[0.67352235,0.0031473115,0.29302862,0.00064697885,0.00117887,0.0011601269,0.00097498234,0.00065816706,0.025682587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572766,0.0022851466,0.00017730711,0.00073144777,0.0005695551,0.0005088902],"domain_scores_gemma":[0.9822161,0.015135199,0.0009936353,0.00061239244,0.00043998373,0.00060268404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055874633,0.0024063783,0.0048552416,0.001940699,0.0015975587,0.0045157946,0.0044181915,0.005663723,0.015477228],"category_scores_gemma":[0.02505484,0.002375938,0.0020119117,0.0063190125,0.0025388992,0.0062841526,0.0024398537,0.0047044526,0.0011150886],"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.00048966956,0.00024880742,0.0004503802,0.00050784746,0.00013945349,0.00017643106,0.00006365999,0.91152406,0.00049329974,0.058825422,0.0065678083,0.020513142],"study_design_scores_gemma":[0.00012667282,0.00006644563,0.00020175538,0.00002052458,0.000039704886,0.00004680726,0.0000320934,0.9392606,0.0001995169,0.05894977,0.001038124,0.000017973463],"about_ca_topic_score_codex":0.0042067138,"about_ca_topic_score_gemma":0.004603142,"teacher_disagreement_score":0.015477228,"about_ca_system_score_codex":0.0038734695,"about_ca_system_score_gemma":0.003291568,"threshold_uncertainty_score":0.05177653},"labels":[],"label_agreement":null},{"id":"W2560956831","doi":"10.1007/s00224-002-1035-9","title":"Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounded function; Computer science; Upper and lower bounds; Order (exchange); Discrete mathematics; Mathematics","score_opus":0.01443799533799026,"score_gpt":0.23404393133087817,"score_spread":0.2196059359928879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560956831","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.11126429,0.0010406019,0.86126435,0.0020244787,0.00020815748,0.00014553202,0.00059017364,0.0011768803,0.022285495],"genre_scores_gemma":[0.74352944,0.00061791536,0.23992456,0.000912918,0.00023761713,0.00033257712,0.00075253594,0.0004720018,0.013220423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946526,0.001660474,0.00048752615,0.0010596971,0.0012043235,0.00093523064],"domain_scores_gemma":[0.99144685,0.0048566507,0.0006592499,0.0015270301,0.0010891493,0.00042113985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002898295,0.0010973723,0.001761546,0.0017632808,0.0019982012,0.0075572548,0.003447891,0.0020345082,0.0035174855],"category_scores_gemma":[0.00929779,0.0016854656,0.002275393,0.002313042,0.0059387465,0.013639197,0.0033599173,0.005928107,0.00073323736],"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.00005097981,0.000016000775,0.0001273921,0.000046616515,0.000017824705,0.00008427857,0.00046263117,0.0021963897,0.00085977453,0.9918584,0.00045148467,0.0038281833],"study_design_scores_gemma":[0.000026577225,0.000010328973,0.000047432917,0.00001934115,0.000022609811,0.00005881897,0.00012365846,0.012868372,0.001020113,0.98326993,0.0025162823,0.000016640342],"about_ca_topic_score_codex":0.0029281252,"about_ca_topic_score_gemma":0.0031989007,"teacher_disagreement_score":0.0075572548,"about_ca_system_score_codex":0.0033847578,"about_ca_system_score_gemma":0.0020214347,"threshold_uncertainty_score":0.024558246},"labels":[],"label_agreement":null},{"id":"W2592641503","doi":"10.1007/s00224-018-9859-0","title":"Primitivity, Uniform Minimality, and State Complexity of Boolean Operations","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Product term; Discrete mathematics; Permutation (music); Boolean circuit; Combinatorics; Boolean network; Direct product; Permutation group; Boolean expression; State (computer science); Boolean function; Two-element Boolean algebra; Parity function; Complete Boolean algebra; Algorithm; Algebra over a field; Pure mathematics","score_opus":0.041126256274553526,"score_gpt":0.2732903883261544,"score_spread":0.23216413205160086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592641503","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.6644106,0.0011451396,0.30022025,0.00292716,0.00009041593,0.000096853684,0.00074656913,0.00039857253,0.029964535],"genre_scores_gemma":[0.98663867,0.00025759672,0.010166204,0.00012327913,0.00010462004,0.000096058975,0.0002855072,0.000053546923,0.002274505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955651,0.0014147949,0.00038823127,0.0009345187,0.0009521266,0.00074518623],"domain_scores_gemma":[0.9537563,0.03849731,0.0020476682,0.0031722272,0.0013101003,0.0012163243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003793457,0.0008037423,0.0017596579,0.0023885246,0.0025124752,0.0071590324,0.0023855632,0.0013737514,0.0048540053],"category_scores_gemma":[0.024006527,0.0011394352,0.0023166565,0.0019321735,0.006567587,0.014265926,0.0038361223,0.003915352,0.00037260415],"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.00027264009,0.000107483655,0.001794491,0.0001141114,0.000047056594,0.000080604244,0.00067949126,0.009177622,0.0012526143,0.9775894,0.0005547015,0.008329748],"study_design_scores_gemma":[0.000017054384,0.000022905779,0.00046032417,0.000013179198,0.000033423552,0.00005025328,0.00006771449,0.02202745,0.0011563249,0.97577447,0.00035872002,0.000018201868],"about_ca_topic_score_codex":0.0014673314,"about_ca_topic_score_gemma":0.0015756816,"teacher_disagreement_score":0.0071590324,"about_ca_system_score_codex":0.0024402018,"about_ca_system_score_gemma":0.0014924144,"threshold_uncertainty_score":0.02006197},"labels":[],"label_agreement":null},{"id":"W2613137572","doi":"10.1007/s00224-016-9713-1","title":"Separation Logic with One Quantified Variable","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Heap (data structure); Separation logic; Satisfiability; Boolean satisfiability problem; Fragment (logic); PSPACE; Mathematics; MAGIC (telescope); True quantified Boolean formula; Variable (mathematics); Discrete mathematics; Algorithm; Computer science; Theoretical computer science; Computational complexity theory","score_opus":0.04982199439789516,"score_gpt":0.28712776281217833,"score_spread":0.23730576841428316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613137572","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.009581872,0.0015636234,0.9539895,0.0028608819,0.00051550736,0.000038227412,0.0003234175,0.00081066205,0.030316288],"genre_scores_gemma":[0.5028682,0.0022235846,0.46094117,0.0022761612,0.0012551153,0.00015889901,0.00073401036,0.00044429596,0.02909853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749905,0.00068962737,0.00017427458,0.00056637597,0.0007869369,0.0002836452],"domain_scores_gemma":[0.99763036,0.0011118294,0.00015557528,0.0005792714,0.000331071,0.00019184836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001995968,0.0007798772,0.0010558602,0.0016486823,0.0020059769,0.005082151,0.0020726249,0.001401162,0.0067314454],"category_scores_gemma":[0.0037304244,0.0007209043,0.0016258925,0.0020597146,0.005339935,0.009779876,0.0041314308,0.0067527858,0.0018980788],"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.0000291982,0.000013259857,0.00006223219,0.000050080227,0.000009385678,0.000019396328,0.000074284755,0.000536735,0.00035696797,0.9883562,0.0014061237,0.009086118],"study_design_scores_gemma":[0.000015680545,0.000007580208,0.000030794206,0.000015463314,0.0000158761,0.000044906177,0.000017487424,0.0039000635,0.00063728564,0.9894075,0.0058965324,0.000010868477],"about_ca_topic_score_codex":0.0010257106,"about_ca_topic_score_gemma":0.0010047365,"teacher_disagreement_score":0.0067314454,"about_ca_system_score_codex":0.0021721448,"about_ca_system_score_gemma":0.0023549618,"threshold_uncertainty_score":0.022518933},"labels":[],"label_agreement":null},{"id":"W2771131742","doi":"10.1007/s00224-018-9871-4","title":"Better Complexity Bounds for Cost Register Automata","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Register (sociolinguistics); Computer science; Automaton; Register allocation; Theoretical computer science; Arithmetic; Parallel computing; Mathematics; Programming language","score_opus":0.05901425934316849,"score_gpt":0.2955452278681961,"score_spread":0.23653096852502759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771131742","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.14316913,0.007983903,0.7440227,0.01601336,0.0021468524,0.000297751,0.0017663527,0.0035706596,0.08102931],"genre_scores_gemma":[0.80706394,0.0027721291,0.14708193,0.0035023652,0.002955152,0.0007031556,0.0016675062,0.002724499,0.031529337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906935,0.0022478276,0.0005077424,0.0018854694,0.0030778062,0.0015877456],"domain_scores_gemma":[0.9424414,0.041726183,0.0015052946,0.0100079635,0.00269611,0.0016229259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005360552,0.0025972545,0.0034272887,0.0038377065,0.0025031916,0.00831675,0.0057768244,0.0036797097,0.037266996],"category_scores_gemma":[0.04138692,0.0013949104,0.0044856113,0.0034141645,0.004452425,0.031061048,0.0065603363,0.011854327,0.0039070235],"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.0006840379,0.000329976,0.00090265035,0.00047398958,0.00010274311,0.00013505327,0.0004638737,0.04744369,0.004998535,0.8920113,0.0148253115,0.037628938],"study_design_scores_gemma":[0.00006309387,0.00006265143,0.00031273148,0.000053045766,0.00008013461,0.000054036824,0.000075507785,0.12350946,0.0019313113,0.86948574,0.0043141083,0.00005829072],"about_ca_topic_score_codex":0.0032911492,"about_ca_topic_score_gemma":0.005636986,"teacher_disagreement_score":0.037266996,"about_ca_system_score_codex":0.0069181067,"about_ca_system_score_gemma":0.002914917,"threshold_uncertainty_score":0.124670506},"labels":[],"label_agreement":null},{"id":"W2807933378","doi":"10.1007/s00224-019-09955-7","title":"Advice Complexity of Priority Algorithms","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Advice (programming); Oracle; Computer science; Reduction (mathematics); Mathematical proof; Function (biology); Algorithm; Matching (statistics); Adversary; Greedy algorithm; Upper and lower bounds; Theoretical computer science; Mathematics; Programming language; Computer security","score_opus":0.03455034673156813,"score_gpt":0.27869131579602946,"score_spread":0.24414096906446134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807933378","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.25536928,0.0024789113,0.62234455,0.018124353,0.000736533,0.00027150474,0.0012387808,0.0015923108,0.09784368],"genre_scores_gemma":[0.8961949,0.0012110935,0.071883306,0.0013256873,0.0010727658,0.00029422695,0.0010657994,0.0006767888,0.026275434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910759,0.0029219564,0.00039675628,0.001085122,0.0030213767,0.0014989484],"domain_scores_gemma":[0.91389096,0.07249784,0.001983098,0.005207081,0.0038723575,0.0025487181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005736406,0.0010619811,0.0024885244,0.0019397967,0.0023296038,0.008472776,0.004384428,0.003982607,0.023823114],"category_scores_gemma":[0.080116734,0.0011102326,0.0016112,0.0027904701,0.003750682,0.015470567,0.0035485143,0.0071131526,0.0020172622],"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.0010028452,0.0002855203,0.0021415139,0.00034444794,0.00007844108,0.00010630956,0.00048820834,0.059057653,0.0014083039,0.8804688,0.013928461,0.04068965],"study_design_scores_gemma":[0.00012968341,0.000046146608,0.00046276988,0.000023254303,0.000041418603,0.00005532087,0.00005903361,0.21497172,0.00049283117,0.7822586,0.0014407742,0.000018432862],"about_ca_topic_score_codex":0.004591542,"about_ca_topic_score_gemma":0.0047110994,"teacher_disagreement_score":0.023823114,"about_ca_system_score_codex":0.0053356965,"about_ca_system_score_gemma":0.005805817,"threshold_uncertainty_score":0.07969624},"labels":[],"label_agreement":null},{"id":"W2885021324","doi":"10.1007/s00224-018-9876-z","title":"Computing Parameters of Sequence-Based Dynamic Graphs","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Agence Nationale de la Recherche","keywords":"Sequence (biology); Bounded function; Amortized analysis; Computer science; Maximization; Algorithm; Minification; Graph; Combinatorics; Mathematics; Discrete mathematics; Mathematical optimization; Data structure","score_opus":0.034709636403287086,"score_gpt":0.2690888536117062,"score_spread":0.23437921720841912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885021324","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.23984069,0.00025543402,0.7537508,0.00034256885,0.000059856528,0.00009548258,0.0004941,0.0007604583,0.0044006053],"genre_scores_gemma":[0.9449167,0.00019781844,0.052546505,0.000045423887,0.000034572393,0.00008966721,0.0004535422,0.00016896524,0.00154682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911004,0.00022444713,0.0000610315,0.00026890024,0.00022577384,0.00010979691],"domain_scores_gemma":[0.9911192,0.0056526517,0.0008067148,0.0011162234,0.0008573171,0.00044788135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012950383,0.0007552901,0.0009685161,0.0027453143,0.0007112026,0.0028817975,0.0023004375,0.0013516647,0.0035627817],"category_scores_gemma":[0.020546084,0.0006237235,0.00047216823,0.0025910323,0.0013934964,0.006922144,0.0016807601,0.0014264365,0.00046879658],"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.00027770005,0.000084321786,0.0029787652,0.00010537279,0.000045703608,0.0001014508,0.00027523274,0.77314454,0.004527148,0.18038958,0.0010854965,0.036984682],"study_design_scores_gemma":[0.0000098264845,0.000019257735,0.00024614052,0.0000122330375,0.000009240394,0.000032298896,0.000053059503,0.85218835,0.0011819833,0.14568256,0.0005520858,0.000012936099],"about_ca_topic_score_codex":0.0025287792,"about_ca_topic_score_gemma":0.0026031258,"teacher_disagreement_score":0.0035627817,"about_ca_system_score_codex":0.0022319888,"about_ca_system_score_gemma":0.00096640846,"threshold_uncertainty_score":0.016194284},"labels":[],"label_agreement":null},{"id":"W2925765780","doi":"10.1007/s00224-020-09993-6","title":"Space Lower Bounds for the Signal Detection Problem","year":2020,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Object (grammar); Upper and lower bounds; Blackboard (design pattern); Value (mathematics); Conjecture; SIGNAL (programming language); Process (computing); Theoretical computer science; Space (punctuation); Sequence (biology); Discrete mathematics; Combinatorics; Mathematics; Algorithm; Artificial intelligence; Machine learning; Programming language","score_opus":0.019015541732518664,"score_gpt":0.23634104685697363,"score_spread":0.21732550512445498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925765780","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.20312826,0.008824759,0.67682314,0.026519783,0.0011923746,0.00095894095,0.0043540196,0.0081628105,0.07003597],"genre_scores_gemma":[0.8137238,0.0023831981,0.15729415,0.0037080518,0.0018281781,0.0013466623,0.003396893,0.0017827069,0.01453623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97516745,0.006694178,0.0013626999,0.0044186693,0.006499231,0.0058577647],"domain_scores_gemma":[0.8601319,0.11351941,0.0051383497,0.012770807,0.004995879,0.0034436572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010210008,0.0037890917,0.004372202,0.0038420074,0.0052855387,0.011151225,0.009090262,0.005544162,0.024181796],"category_scores_gemma":[0.06391566,0.0018835416,0.003782211,0.005820145,0.00808118,0.030653216,0.0124663245,0.009745124,0.004518083],"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.0047948984,0.0015568346,0.008158063,0.003396571,0.0005317873,0.0009281339,0.0021010304,0.23435345,0.017146066,0.5325271,0.056466088,0.13804002],"study_design_scores_gemma":[0.00034161366,0.00035937122,0.00062224164,0.00018115096,0.00017634004,0.00039915802,0.00025550264,0.4119045,0.0063762893,0.5715127,0.0077759298,0.00009508579],"about_ca_topic_score_codex":0.0024406943,"about_ca_topic_score_gemma":0.0021571715,"teacher_disagreement_score":0.024181796,"about_ca_system_score_codex":0.0065036872,"about_ca_system_score_gemma":0.005627916,"threshold_uncertainty_score":0.08089614},"labels":[],"label_agreement":null},{"id":"W2942711255","doi":"10.1007/s00224-021-10059-4","title":"The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)","year":2022,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Common value auction; Monotonic function; Anomaly (physics); Economics; Mathematical economics; Econometrics; Microeconomics; Computer science; Mathematics","score_opus":0.15297559913969638,"score_gpt":0.38465206025683446,"score_spread":0.23167646111713808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942711255","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.5132348,0.0015008847,0.40776047,0.012295872,0.00064029894,0.00007084415,0.00070277357,0.0020850918,0.061708927],"genre_scores_gemma":[0.98190236,0.00033582063,0.012194527,0.0008144056,0.00026858016,0.000032500597,0.00017132926,0.00019830618,0.0040822215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705964,0.00063129695,0.00022284681,0.0008401341,0.0008512347,0.0003948045],"domain_scores_gemma":[0.9700095,0.013345633,0.0048542325,0.007308843,0.003255871,0.0012259207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049390444,0.00047818213,0.002312315,0.0010617939,0.001366475,0.0030300613,0.0030303132,0.0021190513,0.008547349],"category_scores_gemma":[0.054317597,0.0006626952,0.0010837115,0.002362854,0.004010253,0.011844015,0.0019305483,0.0040368196,0.000845838],"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.00040866245,0.00015947933,0.009094943,0.000308791,0.0001078699,0.00046965978,0.00041109062,0.008197749,0.003313863,0.926549,0.007155791,0.043823153],"study_design_scores_gemma":[0.00002576324,0.00006150299,0.0026880307,0.000016325464,0.00001946656,0.0005849363,0.0001064686,0.03389666,0.0006668194,0.96023244,0.0016777216,0.000023864945],"about_ca_topic_score_codex":0.0016788258,"about_ca_topic_score_gemma":0.001138038,"teacher_disagreement_score":0.008547349,"about_ca_system_score_codex":0.0012951548,"about_ca_system_score_gemma":0.0013569775,"threshold_uncertainty_score":0.02859366},"labels":[],"label_agreement":null},{"id":"W2943463427","doi":"10.1007/s00224-005-1139-0","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Independent set; Mathematics; Bounded function; Maximal independent set; Degree (music); Planar graph; Discrete mathematics; Graph; Set (abstract data type); Planar; Planar straight-line graph; 1-planar graph; Chordal graph; Computer science; Physics","score_opus":0.02799329073985854,"score_gpt":0.2603683244860735,"score_spread":0.23237503374621496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943463427","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.44430384,0.0024840676,0.50910693,0.0029818565,0.0001752545,0.00014807146,0.00092197367,0.0004782411,0.039399855],"genre_scores_gemma":[0.9247966,0.0019950406,0.056707703,0.00037303256,0.00024182587,0.000272,0.0010176362,0.00019924005,0.014396802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987645,0.00033353668,0.00005619137,0.00020707848,0.00045198793,0.0001867105],"domain_scores_gemma":[0.98793274,0.009300286,0.00083638023,0.0006609848,0.00058933586,0.0006802447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095047,0.00080859585,0.0015949013,0.0026508172,0.0021331485,0.004129577,0.0030719973,0.0018583321,0.0055442434],"category_scores_gemma":[0.010944908,0.0015700317,0.0010276464,0.0034654501,0.0031109685,0.0053474237,0.0030987714,0.003511423,0.00061593927],"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.00009697223,0.00005910943,0.0006234733,0.00013723734,0.000028380005,0.00009687656,0.00038620038,0.03828539,0.0010475453,0.9440096,0.002729021,0.012500215],"study_design_scores_gemma":[0.000023354547,0.000009974599,0.0002858973,0.000020065292,0.000016995347,0.000059811708,0.00009774787,0.050736554,0.00048673386,0.9468314,0.0014210448,0.000010407622],"about_ca_topic_score_codex":0.0020920676,"about_ca_topic_score_gemma":0.002867449,"teacher_disagreement_score":0.0055442434,"about_ca_system_score_codex":0.0019268427,"about_ca_system_score_gemma":0.00088858476,"threshold_uncertainty_score":0.018547356},"labels":[],"label_agreement":null},{"id":"W2947749495","doi":"10.1007/s00224-019-09929-9","title":"Additive Number Theory via Automata Theory","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"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":"Fibonacci number; Natural number; Palindrome; Mathematics; Base (topology); Basis (linear algebra); Automaton; Mathematical proof; Discrete mathematics; Representation (politics); Combinatorics; Computer science; Theoretical computer science","score_opus":0.0077621033940630585,"score_gpt":0.2280083916079614,"score_spread":0.22024628821389836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947749495","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.026205448,0.010554055,0.8280747,0.0048032715,0.001375322,0.00006933333,0.0003403609,0.0005072518,0.12807013],"genre_scores_gemma":[0.73466146,0.008468191,0.20783491,0.0018966445,0.0036653595,0.0004025548,0.00051481364,0.00032114465,0.0422349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790704,0.0006842556,0.0001292325,0.00042638674,0.0006845392,0.00016862634],"domain_scores_gemma":[0.99763155,0.0015151,0.0001038491,0.00025656048,0.00034707767,0.00014592678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102447,0.0013743967,0.001798804,0.0038255884,0.0019865485,0.006126656,0.0017999457,0.0013174352,0.0069768527],"category_scores_gemma":[0.0034410835,0.0007632563,0.0017466631,0.003294598,0.0066827373,0.011695237,0.003713482,0.004906516,0.0014126195],"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.000004081063,0.0000045321603,0.00002226612,0.000022949185,0.0000037683637,0.000009140254,0.000058836536,0.00034090967,0.00008829816,0.9969035,0.00036890138,0.0021728016],"study_design_scores_gemma":[0.0000041272547,0.0000044441726,0.00002619846,0.0000077587465,0.0000055679557,0.000015647369,0.000012238696,0.0014396511,0.00008879035,0.99553406,0.0028564937,0.000005116426],"about_ca_topic_score_codex":0.0010964058,"about_ca_topic_score_gemma":0.000846671,"teacher_disagreement_score":0.0069768527,"about_ca_system_score_codex":0.002564547,"about_ca_system_score_gemma":0.0010086813,"threshold_uncertainty_score":0.023339868},"labels":[],"label_agreement":null},{"id":"W2962904359","doi":"10.1007/s00224-017-9803-8","title":"Syntactic Complexity of Regular Ideals","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"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":"European Social Fund; Uniwersytet Wrocławski; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Narodowe Centrum Nauki; University of Toronto; Narodowym Centrum Nauki","keywords":"Regular language; Cardinality (data modeling); Suffix; Mathematics; Prefix; Discrete mathematics; Nondeterministic finite automaton; Descriptive complexity theory; Combinatorics; Computer science; Time complexity; Automaton; Automata theory; Linguistics; Theoretical computer science","score_opus":0.05201520097610158,"score_gpt":0.2847825039784081,"score_spread":0.23276730300230652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962904359","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.82631797,0.0002793368,0.13655572,0.0013602731,0.00005765806,0.000121818724,0.0007678297,0.00056450773,0.033974946],"genre_scores_gemma":[0.97766894,0.00011070264,0.017918078,0.00009460134,0.0000773154,0.00010631132,0.0005011044,0.000081162194,0.0034417405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726486,0.000391741,0.00027124808,0.0005787293,0.00094125804,0.00055209384],"domain_scores_gemma":[0.9877735,0.007551041,0.0012898057,0.0014304842,0.0013107521,0.00064445013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015124638,0.00031097495,0.0007296733,0.0011099719,0.0018346921,0.003266437,0.0010847372,0.00057987554,0.0056990264],"category_scores_gemma":[0.00766384,0.0005835329,0.001610799,0.00054161885,0.0032186941,0.0057241344,0.0025410203,0.0018416694,0.0005141885],"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.0004622758,0.00013944865,0.007289138,0.00025104516,0.000050351537,0.00040454336,0.0019534857,0.03203704,0.024225835,0.91427207,0.0019825387,0.016932242],"study_design_scores_gemma":[0.000027530175,0.00007749991,0.002520562,0.000025092675,0.00004734557,0.00031948436,0.0003488684,0.07103628,0.014685737,0.9072887,0.003566654,0.000056220237],"about_ca_topic_score_codex":0.0012363943,"about_ca_topic_score_gemma":0.0011985343,"teacher_disagreement_score":0.0056990264,"about_ca_system_score_codex":0.001941206,"about_ca_system_score_gemma":0.0016442187,"threshold_uncertainty_score":0.019065201},"labels":[],"label_agreement":null},{"id":"W2963052257","doi":"10.1007/s00224-016-9718-9","title":"From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Consistency (knowledge bases); Database; Causality (physics); Database theory; Representation (politics); Information retrieval; Database design; Artificial intelligence","score_opus":0.13685372318300434,"score_gpt":0.3660417987277245,"score_spread":0.22918807554472018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963052257","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.14902285,0.002875354,0.81500894,0.012546891,0.00079123455,0.00037020884,0.0025024547,0.0038123159,0.01306976],"genre_scores_gemma":[0.9298996,0.00094439316,0.062125187,0.00064031937,0.00036822207,0.0001398208,0.00096898567,0.00041387673,0.004499647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913373,0.0019636254,0.0006345873,0.0015753907,0.0035026416,0.0009864374],"domain_scores_gemma":[0.9141699,0.060052987,0.0058046384,0.0111072585,0.0072923354,0.0015727308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068183825,0.0015074931,0.001919656,0.005109684,0.0019276519,0.005993974,0.0030890398,0.0030443335,0.00972133],"category_scores_gemma":[0.07469455,0.0016199471,0.0034878417,0.0022708317,0.0034957328,0.00891729,0.0033972678,0.0045058085,0.00080341916],"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.001850118,0.0005611446,0.04443633,0.001100957,0.00046471792,0.0031772987,0.0024037529,0.19020094,0.0029451228,0.5959363,0.024824934,0.13209835],"study_design_scores_gemma":[0.00011180517,0.000076243625,0.003872178,0.00015307158,0.00023447475,0.0009333822,0.00080906285,0.40044233,0.003189098,0.58667356,0.0034053645,0.000099382996],"about_ca_topic_score_codex":0.008765169,"about_ca_topic_score_gemma":0.006807606,"teacher_disagreement_score":0.00972133,"about_ca_system_score_codex":0.0028948628,"about_ca_system_score_gemma":0.004867907,"threshold_uncertainty_score":0.0360595},"labels":[],"label_agreement":null},{"id":"W2964019617","doi":"10.1007/s00224-018-9849-2","title":"The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC0","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Champlain Regional College","funders":"","keywords":"Conjugacy problem; Mathematics; Wreath product; Abelian group; Iterated function; Conjugacy class; Combinatorics; Group (periodic table); Discrete mathematics; Product (mathematics); Mathematical analysis","score_opus":0.011805493781271256,"score_gpt":0.22795040116212653,"score_spread":0.2161449073808553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964019617","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.62527126,0.0015394305,0.23904757,0.011164037,0.0013880882,0.00017302694,0.0003824554,0.0005476522,0.1204864],"genre_scores_gemma":[0.94479555,0.0007063434,0.018783445,0.0007065364,0.0010262255,0.00014712855,0.0004223104,0.0001997764,0.033212617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981263,0.00036954347,0.00014069781,0.0005221808,0.0004033502,0.00043796177],"domain_scores_gemma":[0.99498934,0.0030592952,0.00037665447,0.0007490497,0.00044080286,0.00038481914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017102234,0.0007700004,0.0016076152,0.0018377501,0.0052068257,0.0082992045,0.0019315254,0.0034532596,0.008171503],"category_scores_gemma":[0.008023341,0.0007151514,0.002295791,0.0023515867,0.0076612076,0.014411809,0.004141861,0.0054412205,0.0010461705],"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.000055987177,0.000025154088,0.00026608416,0.0000345629,0.000008635453,0.000085200096,0.0003893078,0.0005344602,0.00027276826,0.9928998,0.00088312547,0.0045448462],"study_design_scores_gemma":[0.00001589605,0.000014209298,0.00006717373,0.0000068375944,0.000007065611,0.000060373593,0.00011994523,0.0021148636,0.00052146724,0.99542856,0.0016347645,0.000008829159],"about_ca_topic_score_codex":0.0022352685,"about_ca_topic_score_gemma":0.0013023807,"teacher_disagreement_score":0.0082992045,"about_ca_system_score_codex":0.002752979,"about_ca_system_score_gemma":0.0022431638,"threshold_uncertainty_score":0.027336359},"labels":[],"label_agreement":null},{"id":"W2981655024","doi":"10.1007/s00224-019-09952-w","title":"Guest Editorial: Special Issue on Approximation and Online Algorithms","year":2019,"lang":"en","type":"editorial","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.013594254467402532,"score_gpt":0.2748879037506026,"score_spread":0.2612936492832001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981655024","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024532099,0.003833609,0.00023606997,0.018909713,0.9751364,0.000014195368,0.00004907068,0.00004419886,0.001752122],"genre_scores_gemma":[0.0003182731,0.0021230048,0.00015259498,0.004869439,0.9841033,0.00001463964,0.000033668588,0.000052492553,0.008332452],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927797,0.0011961207,0.0007313929,0.0009615235,0.0037960345,0.0005352598],"domain_scores_gemma":[0.9692359,0.0121743195,0.0020596937,0.0010451949,0.011472387,0.004012471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072601,0.004619987,0.0060087997,0.006251337,0.0032060272,0.011884874,0.0038070143,0.0136271985,0.039811846],"category_scores_gemma":[0.031769432,0.0014824487,0.0032692715,0.002531864,0.0023674155,0.0051374733,0.0020713618,0.015551019,0.021267522],"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.000042855278,0.000013645244,0.000015839405,0.00014404466,0.000022683447,0.000055103203,0.000002993968,0.000048418824,0.000041776788,0.0003916774,0.99428517,0.0049358197],"study_design_scores_gemma":[0.00015728507,0.000043921387,0.00024900987,0.0003992,0.00009185835,0.0002446871,0.000018853007,0.00073569175,0.00018295899,0.0040208474,0.9938293,0.000026372603],"about_ca_topic_score_codex":0.0009598759,"about_ca_topic_score_gemma":0.0031420353,"teacher_disagreement_score":0.039811846,"about_ca_system_score_codex":0.0041375975,"about_ca_system_score_gemma":0.0029006714,"threshold_uncertainty_score":0.1331839},"labels":[],"label_agreement":null},{"id":"W3161660208","doi":"10.1007/s002249910005","title":"The Characterization of Data-Accumulating Algorithms","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Algorithm; Computer science; Parallelism (grammar); Computation; Characterization (materials science); Class (philosophy); Geodetic datum; Unitary state; Parallel algorithm; Parallel computing; Artificial intelligence","score_opus":0.04788059028256705,"score_gpt":0.2927200907847261,"score_spread":0.24483950050215905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161660208","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.04467928,0.0016041845,0.9427801,0.0014676971,0.00016354313,0.00014691682,0.0002693741,0.00059187715,0.008297112],"genre_scores_gemma":[0.51148224,0.0023318236,0.46897027,0.0009407044,0.00080956786,0.0004444014,0.001339387,0.0008691768,0.01281243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99375993,0.0019278107,0.00076680677,0.0013657976,0.0016402309,0.00053929834],"domain_scores_gemma":[0.9269058,0.04848177,0.004616203,0.009827108,0.008214624,0.0019545504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010004352,0.0014008958,0.0017548108,0.0038426935,0.0021344968,0.008473361,0.0056021786,0.0035171157,0.0060737557],"category_scores_gemma":[0.08555424,0.0011135553,0.0017898038,0.0041758204,0.0048197075,0.014773443,0.004532212,0.004561556,0.0014765476],"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.00030623234,0.0001188788,0.0025287576,0.00028965776,0.000053028663,0.000089162386,0.00029389415,0.034668438,0.002355405,0.891954,0.0032530979,0.06408935],"study_design_scores_gemma":[0.000042466887,0.00013697932,0.0005511903,0.0001027708,0.00004095549,0.0002590367,0.000072167546,0.3691851,0.0050481395,0.6194402,0.005084153,0.00003688292],"about_ca_topic_score_codex":0.0010440686,"about_ca_topic_score_gemma":0.00068652624,"teacher_disagreement_score":0.010004352,"about_ca_system_score_codex":0.0025548392,"about_ca_system_score_gemma":0.0036024835,"threshold_uncertainty_score":0.05290872},"labels":[],"label_agreement":null},{"id":"W320568238","doi":"10.1007/s00224-005-1279-2","title":"Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Semigroup; Mathematics; Monoid; Commutative property; Constraint satisfaction problem; Dichotomy; Polynomial; Domain (mathematical analysis); Finite set; Special classes of semigroups; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.060242600002026164,"score_gpt":0.3048558017418451,"score_spread":0.24461320173981896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W320568238","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.56311893,0.0031308406,0.35135746,0.020930016,0.0003330667,0.00016628092,0.0010096926,0.00057909766,0.05937456],"genre_scores_gemma":[0.9615524,0.00094383804,0.029091021,0.0005700862,0.0005893275,0.00023780267,0.0006220201,0.00013400699,0.0062596467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935348,0.0022689344,0.00037398914,0.00079295115,0.0024868466,0.0005424823],"domain_scores_gemma":[0.91787624,0.074252486,0.002105483,0.0023782307,0.0017003646,0.0016872241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004487166,0.0008229017,0.0018590904,0.002077388,0.001957615,0.006781885,0.0020711322,0.0025901305,0.00971865],"category_scores_gemma":[0.04003581,0.0009846268,0.0017505167,0.0015899091,0.0055510723,0.016545866,0.004211955,0.0064308015,0.0005443432],"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.00021682912,0.00011407169,0.0011227945,0.00017787975,0.00003554214,0.00010257601,0.0006080059,0.020549498,0.0006281121,0.9665403,0.002011696,0.007892749],"study_design_scores_gemma":[0.000032907366,0.000015186021,0.00029713867,0.000013188963,0.000007742308,0.000032078187,0.00006854914,0.06894277,0.00014750338,0.9300138,0.00041825554,0.000010992627],"about_ca_topic_score_codex":0.0015390248,"about_ca_topic_score_gemma":0.001214513,"teacher_disagreement_score":0.00971865,"about_ca_system_score_codex":0.0033957553,"about_ca_system_score_gemma":0.0020812072,"threshold_uncertainty_score":0.03251213},"labels":[],"label_agreement":null},{"id":"W4206007017","doi":"10.1007/s00224-021-10067-4","title":"Computing Colourful Simplicial Depth and Median in ℝ2","year":2022,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Point (geometry); Monochromatic color; Mathematics; Regular polygon; Convex hull; Geometry; Botany","score_opus":0.01638002623891829,"score_gpt":0.2502388252253005,"score_spread":0.2338587989863822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206007017","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.20432432,0.0004735623,0.78199637,0.000621055,0.00015547863,0.00006215697,0.0008243862,0.001511578,0.010031148],"genre_scores_gemma":[0.7220511,0.00027752307,0.26814523,0.00019310466,0.000095371004,0.00005267907,0.0009463523,0.0005772687,0.0076613836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933666,0.000095222946,0.00003166363,0.00015822698,0.00025303464,0.00012519887],"domain_scores_gemma":[0.997292,0.0014061106,0.00020743662,0.00040289178,0.00036734302,0.0003242146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010523434,0.0008330211,0.001359285,0.0019804507,0.0007704099,0.0033823554,0.0018293095,0.001437032,0.008172613],"category_scores_gemma":[0.0073378407,0.0008361401,0.0009465967,0.0013530182,0.0019964457,0.0048373574,0.003201984,0.0020856487,0.001064777],"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.0006540989,0.00014559331,0.0042572124,0.00041091238,0.000106995634,0.00019884131,0.0006542917,0.2663979,0.009118946,0.5909673,0.00852413,0.11856379],"study_design_scores_gemma":[0.000020149586,0.00003591329,0.0004305054,0.000032137315,0.000016359141,0.00005830843,0.00011772158,0.47943938,0.0029856635,0.5142719,0.0025690026,0.000022873794],"about_ca_topic_score_codex":0.0027216272,"about_ca_topic_score_gemma":0.0059119267,"teacher_disagreement_score":0.008172613,"about_ca_system_score_codex":0.0017693352,"about_ca_system_score_gemma":0.0006496716,"threshold_uncertainty_score":0.027340055},"labels":[],"label_agreement":null},{"id":"W4244017030","doi":"10.1007/s00224-016-9696-y","title":"Preface","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Soviet and Russian History","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Philosophy","score_opus":0.024084976479241255,"score_gpt":0.2801760267009855,"score_spread":0.2560910502217443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244017030","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014918976,0.012779723,0.009135278,0.036078595,0.19293877,0.00035716564,0.0063791336,0.0007815777,0.7400578],"genre_scores_gemma":[0.009654233,0.005440441,0.0023384646,0.005564326,0.026717836,0.00021398027,0.0037559848,0.00051616406,0.94579846],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994618,0.00010051519,0.000029922345,0.000101321806,0.00025751552,0.000048932652],"domain_scores_gemma":[0.99731356,0.00053668243,0.00009646309,0.000286532,0.0014370814,0.0003297051],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010633235,0.00076063804,0.0004843966,0.002642094,0.002902683,0.0027724933,0.00096419745,0.0009256887,0.2993334],"category_scores_gemma":[0.007692946,0.00021479945,0.00041851273,0.0018113443,0.000809612,0.0022862093,0.001547242,0.0028400386,0.15797456],"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.000021540356,0.000017016408,0.000083823295,0.00008214393,0.0000019281372,0.00003059097,0.000109225206,0.000074504016,0.000111794296,0.023882408,0.9430128,0.032572214],"study_design_scores_gemma":[0.0000029871392,0.0000076256506,0.00017077863,0.000076895616,0.0000012579258,0.000023653112,0.00006900929,0.000031925232,0.00007521074,0.0066532763,0.9928843,0.000003132699],"about_ca_topic_score_codex":0.004800242,"about_ca_topic_score_gemma":0.005708968,"teacher_disagreement_score":0.7006666,"about_ca_system_score_codex":0.002330692,"about_ca_system_score_gemma":0.0020228445,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4252973786","doi":"10.1007/s00224-017-9754-0","title":"Preface","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Political science","score_opus":0.050463706590936026,"score_gpt":0.3230457224523427,"score_spread":0.2725820158614067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252973786","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012591726,0.019171884,0.025105003,0.060298774,0.27950662,0.00034099634,0.006352048,0.0012837761,0.6066817],"genre_scores_gemma":[0.01159997,0.008757231,0.0064366795,0.008818117,0.05218668,0.00027731125,0.0051544607,0.0010159987,0.9057536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989833,0.0001844024,0.000055995453,0.00018203065,0.0005184953,0.000075689706],"domain_scores_gemma":[0.99511564,0.0010465116,0.00017955092,0.0005304931,0.0025064652,0.0006212785],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016351397,0.0009636066,0.0006429998,0.0031781434,0.00245263,0.0038099973,0.0012712732,0.0011873653,0.26904082],"category_scores_gemma":[0.012528404,0.00028762198,0.0005972181,0.001929718,0.0009658318,0.0032834713,0.0020095014,0.0038237786,0.15943159],"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.000022711454,0.00002068783,0.0000823342,0.0001226088,0.0000029820023,0.0000328386,0.000093429444,0.00013746618,0.00013576764,0.03732649,0.91661704,0.0454056],"study_design_scores_gemma":[0.0000037419488,0.000008733578,0.00013221957,0.0001115621,0.0000020719865,0.00003456283,0.00005514277,0.00006391831,0.00010421862,0.015861722,0.9836172,0.0000049335163],"about_ca_topic_score_codex":0.0028535258,"about_ca_topic_score_gemma":0.0033882617,"teacher_disagreement_score":0.7309592,"about_ca_system_score_codex":0.0027516598,"about_ca_system_score_gemma":0.0024599626,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4254576424","doi":"10.1007/s00224-007-9040-7","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Mathematical proof; Intersection (aeronautics); Extension (predicate logic); Set (abstract data type); Upper and lower bounds; Mathematics; State (computer science); Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Engineering","score_opus":0.0302898493409319,"score_gpt":0.31553094789313363,"score_spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254576424","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.1013794,0.00585195,0.77856165,0.008783959,0.00042752252,0.00015767638,0.00064325175,0.0013886814,0.10280586],"genre_scores_gemma":[0.6354263,0.004186235,0.31174973,0.0020760077,0.000823997,0.00031400443,0.001025518,0.0007030076,0.043695264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974855,0.00073890615,0.00016885341,0.0004709523,0.00064550224,0.00049017667],"domain_scores_gemma":[0.99389535,0.0034728067,0.00036746447,0.0011680882,0.0006246234,0.00047169873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023772244,0.0007417723,0.0017362937,0.0026832686,0.0026498868,0.0055093365,0.0026677332,0.0018169198,0.011161799],"category_scores_gemma":[0.0116255125,0.000851863,0.0014478914,0.0044082776,0.0032622046,0.015132419,0.003715116,0.0039419415,0.0020423206],"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.00003856732,0.000026968013,0.00021939303,0.00008048942,0.000015306005,0.000024393934,0.00015235048,0.0021423807,0.00026417655,0.9721657,0.0035350325,0.021335278],"study_design_scores_gemma":[0.000014151799,0.0000073298024,0.000078190154,0.000015825866,0.0000072476005,0.000024241219,0.00003820046,0.009977609,0.00012570513,0.98681706,0.0028889403,0.0000055090163],"about_ca_topic_score_codex":0.005127763,"about_ca_topic_score_gemma":0.005264961,"teacher_disagreement_score":0.011161799,"about_ca_system_score_codex":0.0032371508,"about_ca_system_score_gemma":0.0020191965,"threshold_uncertainty_score":0.037339926},"labels":[],"label_agreement":null},{"id":"W4385173070","doi":"10.1007/s00224-023-10124-0","title":"Visit-Bounded Stack Automata","year":2023,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stack (abstract data type); Bounded function; Automaton; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.022901813855657052,"score_gpt":0.26026232340574407,"score_spread":0.23736050955008703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385173070","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.17129855,0.0011905594,0.72539324,0.003948105,0.0003421435,0.00011616958,0.0012076979,0.0027334555,0.093770064],"genre_scores_gemma":[0.9139836,0.00061841705,0.049846414,0.00050720235,0.00022348294,0.00021752002,0.0006981092,0.00045839723,0.03344689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983387,0.00036356814,0.00011592244,0.00037951407,0.0004687446,0.00033349052],"domain_scores_gemma":[0.99407166,0.0031066085,0.00030835086,0.0011521884,0.00082601095,0.0005352681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011615072,0.0007624864,0.0012943551,0.0016843075,0.0028838988,0.0050137965,0.0022780988,0.0018347122,0.012526327],"category_scores_gemma":[0.006343284,0.00089324557,0.0017704042,0.0020409683,0.0044828677,0.011074249,0.004865166,0.00418196,0.0019519522],"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.000031784908,0.000011619735,0.00015459287,0.00002446187,0.0000058378077,0.00004194176,0.00022173821,0.0015474495,0.00044515167,0.99389416,0.00083904166,0.0027821132],"study_design_scores_gemma":[0.000010405069,0.0000082103115,0.000056458495,0.0000076102897,0.000013438412,0.000038872247,0.000062196625,0.011040941,0.000428417,0.9862816,0.0020414807,0.000010354446],"about_ca_topic_score_codex":0.0028423949,"about_ca_topic_score_gemma":0.0026175154,"teacher_disagreement_score":0.012526327,"about_ca_system_score_codex":0.0023252966,"about_ca_system_score_gemma":0.0020600334,"threshold_uncertainty_score":0.041904747},"labels":[],"label_agreement":null},{"id":"W4389559334","doi":"10.1007/s00224-023-10154-8","title":"A Closer Look at the Expressive Power of Logics Based on Word Equations","year":2023,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Natural Language Processing Techniques","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":"Deutsche Forschungsgemeinschaft","keywords":"Recursively enumerable language; Undecidable problem; Algorithm; Computer science; Word (group theory); Recursively enumerable set; Set (abstract data type); Mathematics; Artificial intelligence; Discrete mathematics; Decidability; Programming language; Geometry","score_opus":0.02294902408483427,"score_gpt":0.27999414746681406,"score_spread":0.25704512338197977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389559334","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.03454218,0.007792087,0.854416,0.01988398,0.0008606819,0.00011763814,0.0008262732,0.0020176787,0.07954351],"genre_scores_gemma":[0.56918716,0.0070965965,0.38477436,0.009295818,0.0017143139,0.00024814298,0.0014948796,0.001295105,0.02489352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875754,0.0062176744,0.001013355,0.0017508328,0.0027171248,0.00072550244],"domain_scores_gemma":[0.9727003,0.021283321,0.00086491834,0.0030401098,0.0015924374,0.0005189295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013203257,0.0011002666,0.001175121,0.002730093,0.002054336,0.010485643,0.0033599841,0.0020071445,0.010547323],"category_scores_gemma":[0.022415861,0.0015107939,0.0046477164,0.0029711244,0.008626266,0.026934585,0.006992228,0.009984249,0.0015786919],"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.00007690156,0.00002952334,0.00019510806,0.00013349725,0.00004261363,0.00012138103,0.00058503874,0.0040427623,0.0012235708,0.9781728,0.0030587958,0.012318104],"study_design_scores_gemma":[0.000035635614,0.000025906136,0.00008945961,0.00008464754,0.00003706468,0.00009050291,0.0001674288,0.021275632,0.0013801948,0.95588046,0.020895666,0.00003745331],"about_ca_topic_score_codex":0.004664819,"about_ca_topic_score_gemma":0.0043436023,"teacher_disagreement_score":0.013203257,"about_ca_system_score_codex":0.0053939577,"about_ca_system_score_gemma":0.0018558159,"threshold_uncertainty_score":0.069826365},"labels":[],"label_agreement":null},{"id":"W4400591932","doi":"10.1007/s00224-024-10184-w","title":"Lower Bounds on the Amortized Time Complexity of Shared Objects","year":2024,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Amortized analysis; Computer science; Mathematics; Combinatorics; Data structure; Programming language","score_opus":0.03001749341853861,"score_gpt":0.25481502861153876,"score_spread":0.22479753519300016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400591932","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.22334899,0.017796624,0.6107262,0.02447578,0.0024358402,0.000423039,0.004505029,0.004936563,0.11135194],"genre_scores_gemma":[0.8123615,0.005793619,0.13891128,0.003209099,0.0040205503,0.0010902027,0.003410448,0.003748371,0.02745489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98759705,0.0025849054,0.0005972164,0.0016664475,0.0040687397,0.00348551],"domain_scores_gemma":[0.8841413,0.09188444,0.0029015555,0.012681634,0.004369714,0.0040212944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008401525,0.004280659,0.0034986576,0.0050250962,0.003585592,0.011226429,0.009267488,0.0046945116,0.02135277],"category_scores_gemma":[0.05842335,0.001734668,0.0033587054,0.0065746526,0.005534931,0.023216965,0.008297666,0.011017108,0.0030094904],"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.004240251,0.0010057313,0.005305075,0.0015667393,0.0005740141,0.00045547515,0.0011092001,0.28447026,0.018951809,0.5336893,0.044027843,0.1046044],"study_design_scores_gemma":[0.00018350317,0.00019021191,0.0016497168,0.00018057744,0.0002046427,0.00025410912,0.00019118797,0.5481767,0.0041952613,0.43799734,0.006689549,0.00008720103],"about_ca_topic_score_codex":0.0043655955,"about_ca_topic_score_gemma":0.005058138,"teacher_disagreement_score":0.02135277,"about_ca_system_score_codex":0.010392026,"about_ca_system_score_gemma":0.0061659203,"threshold_uncertainty_score":0.07539976},"labels":[],"label_agreement":null},{"id":"W4406779735","doi":"10.1007/s00224-025-10214-1","title":"Rudin-Shapiro Sums Via Automata Theory and Logic","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"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; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automaton; Computer science; Discrete mathematics; Algebra over a field; Calculus (dental); Pure mathematics; Theoretical computer science","score_opus":0.012222276497982786,"score_gpt":0.2517760887789627,"score_spread":0.23955381228097988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406779735","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.04362912,0.0021446163,0.8636955,0.0020143287,0.00041005283,0.00006141654,0.00019618127,0.00088278577,0.08696608],"genre_scores_gemma":[0.7180628,0.002905655,0.24905656,0.0012312061,0.0011226506,0.00034920184,0.00031841558,0.00034571957,0.026607724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875605,0.00037704228,0.000099003126,0.000265538,0.0003630631,0.00013925828],"domain_scores_gemma":[0.99868613,0.0007465278,0.000096793,0.00017671035,0.0001906541,0.00010324887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013824372,0.0007861441,0.0009596774,0.0020109515,0.0019816095,0.003155791,0.0013280901,0.0008018367,0.0045243944],"category_scores_gemma":[0.0029325192,0.00042997487,0.0014283778,0.0014657583,0.0040239473,0.0073723337,0.0038128474,0.0025611082,0.001397162],"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.000010840592,0.000007824735,0.00006928918,0.000024867382,0.0000067442493,0.000050104118,0.00012756667,0.0012617111,0.0003159842,0.9923523,0.00061230717,0.0051603694],"study_design_scores_gemma":[0.000004908685,0.000007917408,0.000038405356,0.000007817767,0.000011331292,0.000040783376,0.000025463967,0.005569756,0.0004945219,0.9900477,0.0037414155,0.000009811954],"about_ca_topic_score_codex":0.0010069505,"about_ca_topic_score_gemma":0.0013873251,"teacher_disagreement_score":0.0045243944,"about_ca_system_score_codex":0.0013915217,"about_ca_system_score_gemma":0.0010279503,"threshold_uncertainty_score":0.015135586},"labels":[],"label_agreement":null},{"id":"W4409146310","doi":"10.1007/s00224-025-10217-y","title":"High Multiplicity Strip Packing with Three Rectangle Types","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Multiplicity (mathematics); Computer science; Combinatorics; Geometry; Mathematics","score_opus":0.008371699592135235,"score_gpt":0.20127421025370054,"score_spread":0.1929025106615653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409146310","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.18701182,0.00096284325,0.7636961,0.00056729635,0.00036036357,0.00008263248,0.00028212284,0.001357259,0.045679573],"genre_scores_gemma":[0.75483936,0.0003958252,0.2280563,0.0002652454,0.00015653703,0.00012239239,0.000414933,0.00040050843,0.01534886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843866,0.000450933,0.000099124125,0.00027000185,0.00043792796,0.00030337504],"domain_scores_gemma":[0.99739,0.0009796039,0.00024778114,0.00089276145,0.00023587295,0.00025400473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011168763,0.0008397276,0.0012270713,0.001291932,0.001044997,0.0033255732,0.0019365085,0.0014084359,0.011139092],"category_scores_gemma":[0.0034683214,0.000903709,0.0008300206,0.0027504445,0.001312437,0.0029699083,0.002730467,0.0016662253,0.0020023354],"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.0016011542,0.00028230427,0.0032070014,0.00037118053,0.0001280786,0.0012351363,0.0005406331,0.15211663,0.03347663,0.7185505,0.011810902,0.07667992],"study_design_scores_gemma":[0.00020488599,0.00042804534,0.0022526728,0.00006567826,0.00007171552,0.0016102059,0.00036038086,0.6290159,0.031949125,0.31888497,0.015027514,0.00012893439],"about_ca_topic_score_codex":0.00043353852,"about_ca_topic_score_gemma":0.00036347035,"teacher_disagreement_score":0.011139092,"about_ca_system_score_codex":0.00085540744,"about_ca_system_score_gemma":0.00046380368,"threshold_uncertainty_score":0.03726399},"labels":[],"label_agreement":null},{"id":"W4411505518","doi":"10.1007/s00224-025-10227-w","title":"Normality, Relativization, and Randomness","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Gobierno de Aragón; Ministerio de Ciencia e Innovación","keywords":"Normality; Randomness; Mathematics; Statistics; Psychology; Econometrics; Linguistics; Philosophy","score_opus":0.009406357427320907,"score_gpt":0.24446849095528275,"score_spread":0.23506213352796185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411505518","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.15571633,0.016249763,0.6166957,0.042410553,0.0016675675,0.00012079243,0.0007843396,0.0008238675,0.16553102],"genre_scores_gemma":[0.9604969,0.0025121996,0.023506166,0.0013791145,0.0016933165,0.0001527227,0.00028643102,0.000102280916,0.009870954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938299,0.0029810057,0.0003615819,0.0011627432,0.0011177685,0.0005469422],"domain_scores_gemma":[0.9839569,0.010932033,0.0008057744,0.0026937257,0.0010702809,0.0005412461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004642915,0.0006302975,0.0016832632,0.0021642798,0.0029247107,0.0068506976,0.0013871106,0.0021703814,0.0039359024],"category_scores_gemma":[0.016472671,0.00060470303,0.0016112837,0.0019287209,0.021421032,0.014322401,0.00454805,0.006079475,0.0005434955],"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.000008500812,0.0000041819385,0.00010465581,0.000010964064,0.0000040787345,0.00000753938,0.000081852035,0.0004429908,0.000033286313,0.9979189,0.00036827888,0.0010148567],"study_design_scores_gemma":[0.0000043105124,0.0000029970909,0.000046212226,0.0000035885123,0.0000027817441,0.000011395571,0.00001931915,0.0007764845,0.000035600176,0.99803585,0.0010572665,0.0000042266843],"about_ca_topic_score_codex":0.0037647055,"about_ca_topic_score_gemma":0.0016135682,"teacher_disagreement_score":0.0068506976,"about_ca_system_score_codex":0.0038553819,"about_ca_system_score_gemma":0.0022047302,"threshold_uncertainty_score":0.027972877},"labels":[],"label_agreement":null},{"id":"W4413333548","doi":"10.1007/s00224-025-10234-x","title":"The Reflection Complexity of Sequences Over Finite Alphabets","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Fonds De La Recherche Scientifique - FNRS","keywords":"Reflection (computer programming); Computer science; Mathematics; Theoretical computer science; Programming language","score_opus":0.03375936000535939,"score_gpt":0.29392277937979244,"score_spread":0.26016341937443305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413333548","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.7187889,0.0017777142,0.21339686,0.006485556,0.00022573314,0.000067053326,0.00065488263,0.0004841099,0.058119252],"genre_scores_gemma":[0.9805895,0.00075366127,0.0107388375,0.00023830151,0.0003414081,0.0000964932,0.00042623995,0.00013934259,0.00667625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686986,0.0010113218,0.00018961514,0.0005572756,0.0008592787,0.00051261013],"domain_scores_gemma":[0.9632167,0.030147562,0.0020220822,0.0022745125,0.0011192112,0.0012199985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002491233,0.0007788479,0.0018136089,0.0021196797,0.0014003824,0.0070140637,0.0026455126,0.0019647211,0.009325194],"category_scores_gemma":[0.021469008,0.00080543675,0.0012415661,0.002150982,0.0054878066,0.017776243,0.0029775894,0.004786578,0.001006066],"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.00017902085,0.000055983885,0.00071942376,0.000092394024,0.000017759694,0.00010019152,0.0005270343,0.0124396235,0.0015467894,0.97597706,0.0012255772,0.0071192496],"study_design_scores_gemma":[0.000020922484,0.00002723944,0.0002587148,0.000016079197,0.000010128302,0.000065578875,0.00008074028,0.027451776,0.0006188843,0.97081393,0.0006173466,0.00001871013],"about_ca_topic_score_codex":0.0010280797,"about_ca_topic_score_gemma":0.0005414271,"teacher_disagreement_score":0.009325194,"about_ca_system_score_codex":0.002679051,"about_ca_system_score_gemma":0.001468203,"threshold_uncertainty_score":0.031195939},"labels":[],"label_agreement":null},{"id":"W4416096748","doi":"10.1007/s00224-025-10247-6","title":"Improved Parameterized Algorithms for Cluster Vertex Deletion","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Natural Science Foundation of China","keywords":"Vertex (graph theory); Parameterized complexity; Graph; Neighbourhood (mathematics); Degree (music); Feedback vertex set; Connected component","score_opus":0.02599159056114206,"score_gpt":0.3157768604298239,"score_spread":0.2897852698686818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416096748","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.043527517,0.000600626,0.93459356,0.001012483,0.00034742872,0.00049781584,0.001384726,0.0071653523,0.010870436],"genre_scores_gemma":[0.21950522,0.00049688475,0.75678253,0.00044006182,0.00027737772,0.0007707065,0.0045884103,0.0024525842,0.014686246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948001,0.0011311711,0.00032524607,0.0014289812,0.0014740425,0.00084045465],"domain_scores_gemma":[0.9821346,0.005428957,0.00082091516,0.00891727,0.0018663541,0.00083188794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026933237,0.0022097477,0.0031194687,0.0021881943,0.0029693889,0.005024441,0.0094508,0.0023477706,0.02012319],"category_scores_gemma":[0.017793369,0.0014345153,0.0022999605,0.0060641575,0.0018836035,0.010146557,0.007193907,0.0046941396,0.0053588236],"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.002318626,0.0011237449,0.0023972995,0.00073801295,0.00024378036,0.00021269979,0.00067762996,0.28409547,0.01447008,0.13957193,0.047305882,0.50684476],"study_design_scores_gemma":[0.0003844885,0.00015684571,0.00076808827,0.00006370691,0.00014129226,0.00021456511,0.0002600101,0.7952627,0.008899046,0.1799098,0.013862036,0.00007750022],"about_ca_topic_score_codex":0.0065886104,"about_ca_topic_score_gemma":0.01236687,"teacher_disagreement_score":0.02012319,"about_ca_system_score_codex":0.0050943824,"about_ca_system_score_gemma":0.006795166,"threshold_uncertainty_score":0.06731874},"labels":[],"label_agreement":null}]}