{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030852,0.0004334663,0.2908066,0.000047958514,0.00045125044,0.00025006902,0.0000029454877,0.00017434043,0.0047481707],"genre_scores_gemma":[0.9942707,0.0000010772957,0.005493982,0.000041105424,0.000070916045,0.0000028130974,0.0000017209227,0.000009510618,0.00010820086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832714,0.0004232484,0.00050987676,0.00022648192,0.00027883693,0.00023443539],"domain_scores_gemma":[0.9982559,0.0004547449,0.0004147523,0.0006716794,0.00014406606,0.000058864633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012326852,0.00013685756,0.00039146992,0.000105814914,0.000059994727,0.00005091294,0.0009703396,0.000047701582,0.000022950675],"category_scores_gemma":[0.000046615958,0.0001137163,0.00009377233,0.00021084947,0.00023104504,0.00015524638,0.0002733566,0.00007964016,0.00004332475],"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.0000035520632,0.00006781546,0.00022396079,0.00017014075,0.00003275048,0.0000013773391,0.0023449166,0.00059474655,0.006275971,0.98096883,0.00027054056,0.009045415],"study_design_scores_gemma":[0.0014481233,0.00047712083,0.052628513,0.0013430656,0.000030994797,0.00008765712,0.005548912,0.64318794,0.02868062,0.2654893,0.00024467325,0.00083304226],"about_ca_topic_score_codex":0.00021554672,"about_ca_topic_score_gemma":3.999223e-7,"teacher_disagreement_score":0.7154795,"about_ca_system_score_codex":0.00001802623,"about_ca_system_score_gemma":0.00002483318,"threshold_uncertainty_score":0.4637216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029384808,0.00037222455,0.97941005,0.000021577527,0.00038818232,0.003095622,0.0000010396462,0.00021058467,0.013562234],"genre_scores_gemma":[0.95694375,0.000002020736,0.04267002,0.00003533689,0.000034236666,0.0001860168,0.0000013032936,0.000012226036,0.00011509719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709094,0.0013719494,0.0005580249,0.00028932607,0.00041049687,0.0002792396],"domain_scores_gemma":[0.9974017,0.0007306637,0.0004438887,0.0012030144,0.00014798141,0.000072751594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035680488,0.00016395684,0.00032791906,0.0002516061,0.00025157476,0.00013370671,0.0014762604,0.000070038855,0.000004446054],"category_scores_gemma":[0.00013217858,0.00015755623,0.00009484983,0.00089800317,0.000116079114,0.0001961624,0.00024213952,0.00018424954,0.000025281352],"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.000004244987,0.00013061606,0.00030307096,0.00009146794,0.00003591205,0.0000013930021,0.0005954177,0.00062429457,0.0001667503,0.9700501,0.00012226476,0.027874444],"study_design_scores_gemma":[0.002449493,0.0006036303,0.004350185,0.0016635244,0.000030869378,0.0001995218,0.00036356927,0.42308688,0.008983536,0.54338366,0.013742746,0.0011423619],"about_ca_topic_score_codex":0.000015248143,"about_ca_topic_score_gemma":2.092298e-7,"teacher_disagreement_score":0.95400524,"about_ca_system_score_codex":0.000049452996,"about_ca_system_score_gemma":0.000048500566,"threshold_uncertainty_score":0.64249563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23818547,0.001071224,0.7371658,0.000040348747,0.00024390151,0.00073063344,0.0000037694906,0.00028368135,0.022275168],"genre_scores_gemma":[0.980138,0.000022708482,0.019602215,0.000073196905,0.000030892126,0.0000020928023,0.0000012993747,0.000014832801,0.0001147698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983804,0.00022977343,0.00045891755,0.0002868623,0.00040923347,0.00023476637],"domain_scores_gemma":[0.99824864,0.00042182955,0.00043499743,0.00039332933,0.0004266429,0.00007458926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284251,0.00015503704,0.00035447034,0.0001651812,0.00007033991,0.000031591077,0.0007683503,0.000040802952,0.0000069013536],"category_scores_gemma":[0.00015781262,0.000116789415,0.000039319562,0.00062923296,0.00014144297,0.00021205432,0.00009717804,0.000113223854,0.0000070043657],"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.0006696766,0.0018172804,0.0058003515,0.031184055,0.00041222834,0.00003905256,0.073504195,0.08222129,0.0018712207,0.7933862,0.00020173925,0.008892682],"study_design_scores_gemma":[0.0045104288,0.003492009,0.0041048015,0.04756336,0.00007918215,0.00019182221,0.004608482,0.82636565,0.09448975,0.01277137,0.00009304844,0.0017300842],"about_ca_topic_score_codex":0.0000348302,"about_ca_topic_score_gemma":9.581643e-7,"teacher_disagreement_score":0.78061485,"about_ca_system_score_codex":0.000010551511,"about_ca_system_score_gemma":0.00018079825,"threshold_uncertainty_score":0.47625342},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016083773,0.0004943199,0.97977823,0.000058940605,0.0009438896,0.0012551972,0.000013301486,0.00038425124,0.000988084],"genre_scores_gemma":[0.9232524,0.0000037595714,0.07604267,0.000057867033,0.00023964462,0.00001970741,0.0000069618163,0.00004085786,0.00033611734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664986,0.00072770106,0.00066098943,0.0005618755,0.00059853046,0.00080105854],"domain_scores_gemma":[0.99353343,0.0041911686,0.00036286205,0.0012882062,0.0004511951,0.00017311107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010497464,0.0002610569,0.00042185455,0.00023499322,0.00048803247,0.00017396994,0.0024889526,0.00010764956,0.0000034242782],"category_scores_gemma":[0.000118102165,0.00019356204,0.00014107162,0.0008785975,0.00029719013,0.00030986857,0.00028099053,0.00026692465,0.000018040648],"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.00007016467,0.00009142618,0.000058642563,0.00012103496,0.0001097842,0.0000063417206,0.0030657852,0.004583657,0.0017254454,0.6826939,0.00021681367,0.307257],"study_design_scores_gemma":[0.001061015,0.00050662336,0.0009361132,0.0002630476,0.00002333496,0.00006573248,0.0015157054,0.86561847,0.003055497,0.124765374,0.0017411028,0.00044799002],"about_ca_topic_score_codex":0.000032541808,"about_ca_topic_score_gemma":0.000003886331,"teacher_disagreement_score":0.9071686,"about_ca_system_score_codex":0.00008161678,"about_ca_system_score_gemma":0.00009238631,"threshold_uncertainty_score":0.7893231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029343149,0.00071269704,0.958398,0.000049235623,0.0018815979,0.00018240137,0.0000023455304,0.00025424414,0.009176353],"genre_scores_gemma":[0.9837589,0.0000026836246,0.015146183,0.000041229443,0.00039196733,0.0000023234522,0.0000046102564,0.000008886873,0.0006432006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867374,0.00022843629,0.00032097966,0.00018387144,0.0002454989,0.00034747034],"domain_scores_gemma":[0.99889946,0.00020426739,0.00020427609,0.000570498,0.00005186538,0.00006964965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025121483,0.00012627238,0.00022710567,0.0001038895,0.00008563853,0.00009809863,0.0009796381,0.000031382882,0.000004251803],"category_scores_gemma":[0.000035510115,0.000105877894,0.000051497864,0.0002646908,0.000050031667,0.00050628727,0.00040543103,0.000061187544,0.00005019784],"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.000002402384,0.000055827528,0.00066607515,0.000121831654,0.000029003842,0.0000013609908,0.0011013288,0.00042516048,0.00009995124,0.974532,0.00072160526,0.022243427],"study_design_scores_gemma":[0.0010579242,0.00014891538,0.0046469225,0.00061974983,0.000050489438,0.00007551385,0.001596823,0.9436138,0.0018886449,0.024334896,0.020957159,0.0010091547],"about_ca_topic_score_codex":0.000017537037,"about_ca_topic_score_gemma":6.5847125e-8,"teacher_disagreement_score":0.95441574,"about_ca_system_score_codex":0.000016246782,"about_ca_system_score_gemma":0.000010797293,"threshold_uncertainty_score":0.4317575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05022053,0.0004913533,0.9474423,0.00009289877,0.00079885643,0.0005591408,0.000036303984,0.00010163095,0.00025699384],"genre_scores_gemma":[0.9060241,0.0000033131269,0.0935621,0.00003485138,0.00025168376,0.000009542418,0.000031396274,0.00001326418,0.0000697413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983643,0.000245875,0.00042633235,0.00044344718,0.00022981515,0.0002901995],"domain_scores_gemma":[0.99748725,0.0006392183,0.00024948482,0.0014565098,0.00010504345,0.000062499625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053126,0.00015647881,0.00034730806,0.000107846376,0.00009052629,0.00011281882,0.0020628937,0.00007220943,0.0000033638116],"category_scores_gemma":[0.000096736985,0.00012682771,0.000039580704,0.00017170764,0.000050183484,0.0005519494,0.00080272905,0.0001180921,0.000008746792],"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.000057018315,0.00014407153,0.001051667,0.0007350829,0.00006983699,0.0000060620587,0.004487226,0.06751255,0.0033722236,0.85370797,0.0097753415,0.05908095],"study_design_scores_gemma":[0.00041956498,0.000036348523,0.0009234732,0.00021193956,0.0000034092718,0.000008597105,0.00014634244,0.97522604,0.00020045904,0.022055153,0.0006109291,0.00015773991],"about_ca_topic_score_codex":0.00055179524,"about_ca_topic_score_gemma":0.000004585577,"teacher_disagreement_score":0.9077135,"about_ca_system_score_codex":0.000021102365,"about_ca_system_score_gemma":0.000050878145,"threshold_uncertainty_score":0.5171884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022373458,0.00019179356,0.9945263,0.0000464123,0.00069769955,0.0008611016,0.0000037742132,0.00019410634,0.0012414233],"genre_scores_gemma":[0.4292733,0.000005109,0.5697158,0.000088848254,0.0002034775,0.0000069665007,0.0000084746325,0.000017265193,0.00068073766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814636,0.00044448636,0.00063197326,0.00022197753,0.00023787143,0.0003173499],"domain_scores_gemma":[0.99681747,0.002218103,0.00028709942,0.00032534517,0.00026784258,0.000084112005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009720013,0.00012254524,0.0004702277,0.00018739636,0.00011512143,0.00007713279,0.00060150016,0.00005411366,0.0000021601375],"category_scores_gemma":[0.00017167864,0.000104834864,0.00012403201,0.0003077662,0.0000900528,0.00011170184,0.00016791119,0.00008661789,0.0000032868436],"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.0018041787,0.00014896494,0.000007124111,0.00029364348,0.00013678084,0.0000046594664,0.003795879,0.070012055,0.00017850309,0.5505238,0.00006368354,0.37303072],"study_design_scores_gemma":[0.025968688,0.00004934861,0.000008433529,0.00014476058,0.0000066544762,0.000013865027,0.00014001741,0.96996236,0.0001040875,0.0031096172,0.00037744522,0.000114747825],"about_ca_topic_score_codex":0.00001563032,"about_ca_topic_score_gemma":0.0000014233067,"teacher_disagreement_score":0.89995027,"about_ca_system_score_codex":0.000020449628,"about_ca_system_score_gemma":0.000041121846,"threshold_uncertainty_score":0.42750418},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.631668,0.0010363739,0.36428162,0.000034872905,0.0005461259,0.00014149354,4.58818e-7,0.00014420055,0.00214691],"genre_scores_gemma":[0.9872039,0.0000022984177,0.012610087,0.000057937006,0.000044614124,0.0000011318504,4.032869e-7,0.000009375307,0.0000702282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822605,0.0006073053,0.0004283913,0.00030241915,0.00016348618,0.00027234224],"domain_scores_gemma":[0.9986304,0.000676189,0.00022996681,0.00036557633,0.000044138702,0.00005372175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033275147,0.00014196479,0.00030978865,0.00012456045,0.00008129835,0.00006451952,0.00042383565,0.000057635574,0.0000012671737],"category_scores_gemma":[0.00018939245,0.0001265154,0.00003316206,0.00033209962,0.00009558298,0.00015253155,0.00013623603,0.00012139107,0.0000060108277],"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.0000034704992,0.000029236488,0.0045721107,0.00010070952,0.000005662133,0.000015901389,0.0011047256,0.0022216411,0.00048019463,0.9886429,0.000007871395,0.0028156242],"study_design_scores_gemma":[0.0011935526,0.00019266606,0.00718502,0.0013459835,0.000009707592,0.0003970311,0.0014562112,0.81273633,0.0013655099,0.17289007,0.00057405524,0.0006538462],"about_ca_topic_score_codex":0.000043161563,"about_ca_topic_score_gemma":0.0000010161104,"teacher_disagreement_score":0.8157528,"about_ca_system_score_codex":0.000021142809,"about_ca_system_score_gemma":0.000040544088,"threshold_uncertainty_score":0.5159148},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18849124,0.000099080484,0.7978086,0.0002936733,0.0006530835,0.0002410266,0.0000016114918,0.0002209527,0.012190765],"genre_scores_gemma":[0.99562466,5.593208e-7,0.0035526974,0.00018741781,0.00019147334,0.0000036663605,0.0000014816588,0.0000089067025,0.00042912186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988134,0.00021902322,0.0002641559,0.00025100596,0.0002670549,0.00018539779],"domain_scores_gemma":[0.9987069,0.00044576175,0.000252333,0.0003973182,0.00013456323,0.00006316391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091075274,0.0001203001,0.00021472354,0.00006660877,0.000118955664,0.00008258766,0.0005065354,0.000047592774,0.0000094387815],"category_scores_gemma":[0.000012363003,0.00009851885,0.000039164923,0.00019739998,0.00010984212,0.000106979016,0.00006348541,0.00017290546,0.000023188542],"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.000033811208,0.000029498278,0.00020755471,0.000023633947,0.000039479513,0.000003525364,0.0025127989,0.0023034161,0.00051004766,0.937445,0.00046926003,0.056421984],"study_design_scores_gemma":[0.0033239413,0.0005757025,0.0033278414,0.000687336,0.00005963089,0.00022286868,0.0025130974,0.95554394,0.0021685523,0.003929163,0.02688068,0.0007672578],"about_ca_topic_score_codex":0.000008297722,"about_ca_topic_score_gemma":0.000002170578,"teacher_disagreement_score":0.9532405,"about_ca_system_score_codex":0.000011292148,"about_ca_system_score_gemma":0.00004393372,"threshold_uncertainty_score":0.4017482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98665845,0.0010640101,0.009118714,0.00009513007,0.00056661584,0.000121045814,7.237651e-7,0.00017982537,0.0021954742],"genre_scores_gemma":[0.9983461,0.0000075426105,0.0011719521,0.0000664242,0.000082102015,7.065942e-7,6.8971787e-7,0.000005959742,0.0003185119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988969,0.00026174355,0.00022847608,0.00023790033,0.0001966538,0.00017830926],"domain_scores_gemma":[0.9989235,0.00048397348,0.00015430438,0.00035500215,0.000041038435,0.00004219563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004534439,0.00012097363,0.00026015678,0.00008769771,0.00014237172,0.000039088343,0.00038840683,0.00005255143,0.000001716542],"category_scores_gemma":[0.000116180934,0.00009330646,0.000037955535,0.0001187937,0.0001180647,0.00008648142,0.0001268639,0.0000795306,0.000008175226],"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.00015527102,0.000069786016,0.0039101685,0.00030154624,0.00008616797,0.0002446056,0.058161516,0.0015061372,0.004361245,0.88093626,0.00081698585,0.049450323],"study_design_scores_gemma":[0.0068436507,0.0035103625,0.3260588,0.004934083,0.000072758616,0.007581449,0.022016717,0.52571434,0.027845554,0.07098679,0.0013967176,0.0030387659],"about_ca_topic_score_codex":0.00016020353,"about_ca_topic_score_gemma":0.000003883896,"teacher_disagreement_score":0.80994946,"about_ca_system_score_codex":0.000014242447,"about_ca_system_score_gemma":0.000028245659,"threshold_uncertainty_score":0.38049272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8810998,0.00075512467,0.06444113,0.000028006163,0.00072760007,0.00022992553,0.00004872319,0.00009394731,0.0525757],"genre_scores_gemma":[0.9915713,0.0000053199615,0.0002671123,0.0000129140635,0.00025561708,0.000006036813,0.000001541619,0.0000260852,0.007854095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838483,0.00019369372,0.000714465,0.00032974966,0.000059676437,0.00031755448],"domain_scores_gemma":[0.9983804,0.0003783489,0.000721078,0.00040585635,0.000049783583,0.00006452061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003107989,0.00016906748,0.00056712254,0.00013795265,0.00009158495,0.000044750293,0.0003330268,0.000071567694,0.000111726265],"category_scores_gemma":[0.000080269485,0.00011554387,0.00006607006,0.00014003966,0.00013752635,0.00012453961,0.000049306276,0.00006442845,0.0002077012],"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.00005845621,0.00002911019,0.021633161,0.00012693519,0.000081632454,0.0000015335634,0.00066085154,0.0003067262,0.00034999414,0.97597045,0.000106018764,0.00067510974],"study_design_scores_gemma":[0.007944112,0.0020981932,0.055442516,0.0061361287,0.00008221033,0.00022130339,0.002944506,0.006932072,0.0064950376,0.8801038,0.028521203,0.0030789194],"about_ca_topic_score_codex":0.00009984011,"about_ca_topic_score_gemma":0.0000018928714,"teacher_disagreement_score":0.110471435,"about_ca_system_score_codex":0.000042283515,"about_ca_system_score_gemma":0.000017728828,"threshold_uncertainty_score":0.47117424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022919537,0.00033289805,0.9746537,0.000034469915,0.0006013167,0.00030276738,0.000021007141,0.00011251418,0.0010217876],"genre_scores_gemma":[0.8655738,0.0000051248267,0.13359155,0.000023352635,0.00028030403,0.000009242574,0.000015510906,0.00001789994,0.00048319742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984594,0.00019689693,0.0005346631,0.0002874968,0.00024178611,0.00027977664],"domain_scores_gemma":[0.99839705,0.0004608965,0.00043216278,0.00051143946,0.00013195019,0.00006650134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014137987,0.00014255378,0.00038782356,0.000121210316,0.00013904074,0.000059269023,0.00069913745,0.000062943036,0.0000092568835],"category_scores_gemma":[0.000042223994,0.00013059459,0.00010707364,0.00023168302,0.00008096457,0.00021762827,0.00021883947,0.00006474085,0.000009719426],"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.00010782108,0.00038782574,0.00023430277,0.00042539858,0.00024999958,0.000019264326,0.00510811,0.0154172145,0.012833751,0.074158825,0.01422433,0.87683314],"study_design_scores_gemma":[0.0006137718,0.00016016509,0.000251516,0.0004038638,0.000013518804,0.000044803095,0.0001555818,0.99256,0.0018222483,0.0013509421,0.002441616,0.00018195072],"about_ca_topic_score_codex":0.00006963706,"about_ca_topic_score_gemma":2.1638877e-7,"teacher_disagreement_score":0.9771428,"about_ca_system_score_codex":0.000020932406,"about_ca_system_score_gemma":0.000050370876,"threshold_uncertainty_score":0.53254926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08660263,0.00013184892,0.9078715,0.0000405742,0.0002604809,0.00018092903,0.000001171137,0.000092743496,0.004818152],"genre_scores_gemma":[0.9915378,8.458861e-7,0.008192117,0.0000060268458,0.000047412494,0.0000018619667,0.000002352858,0.0000052083055,0.00020635249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866414,0.0003094674,0.00043275874,0.00015816932,0.00029388483,0.00014159257],"domain_scores_gemma":[0.9990001,0.00020223322,0.00027867727,0.0003042863,0.00018873517,0.000026017546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925083,0.000077752054,0.00019438386,0.00012151228,0.000060644543,0.00003912418,0.00038266333,0.00003213549,0.0000022404756],"category_scores_gemma":[0.000027271684,0.00006801562,0.000047589416,0.0003333351,0.000061418395,0.00009747769,0.00008679322,0.00004470427,0.000006791165],"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.000002594298,0.00004224242,0.00004403478,0.00003561952,0.0000037842121,2.680334e-7,0.00078949507,0.563172,0.0008416718,0.43375236,0.00004306941,0.0012728801],"study_design_scores_gemma":[0.00023392068,0.000057390756,0.00050201896,0.000109251254,0.0000022051465,0.0000024412386,0.0001626777,0.99217707,0.0017456373,0.0048582214,0.00007316447,0.00007601627],"about_ca_topic_score_codex":0.00004638445,"about_ca_topic_score_gemma":0.0000010561863,"teacher_disagreement_score":0.9049352,"about_ca_system_score_codex":0.000016442003,"about_ca_system_score_gemma":0.00003078896,"threshold_uncertainty_score":0.27735963},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6711665,0.00019684806,0.3273683,0.000027196393,0.00023267149,0.00009854068,0.0000012226415,0.000066458946,0.00084228755],"genre_scores_gemma":[0.99256027,0.0000016853347,0.0073142494,0.000008387967,0.00004409359,0.000001832656,8.9163814e-7,0.000005843448,0.00006274239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991933,0.000076288,0.0003009457,0.00017958017,0.00013050789,0.000119362434],"domain_scores_gemma":[0.99896336,0.00022830101,0.00021042513,0.00048295633,0.00006853751,0.00004644534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551697,0.00007947396,0.00021721034,0.00007574777,0.000062833125,0.000035574754,0.00049702177,0.00004290809,0.0000016001662],"category_scores_gemma":[0.000023735456,0.000071133974,0.000040536645,0.000186892,0.0001146136,0.00007806355,0.00015920971,0.000095165786,0.0000041963635],"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.0000011953725,0.00002406258,0.00035952684,0.00007162706,0.000013491504,3.451392e-7,0.0010548634,0.000031778774,0.10178609,0.8894638,0.000017827673,0.0071754223],"study_design_scores_gemma":[0.0011302282,0.0001953032,0.026799694,0.00031280535,0.00008162685,0.00024877887,0.00066958985,0.76577395,0.11691478,0.08387728,0.0032736144,0.00072236307],"about_ca_topic_score_codex":0.000031039333,"about_ca_topic_score_gemma":0.000001085608,"teacher_disagreement_score":0.8055865,"about_ca_system_score_codex":0.0000026440061,"about_ca_system_score_gemma":0.000019243233,"threshold_uncertainty_score":0.29007593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05570958,0.00081857695,0.93037707,0.00009128001,0.002067753,0.0008637592,0.000011683594,0.00026785978,0.0097924555],"genre_scores_gemma":[0.99372476,0.000001078387,0.004917585,0.000066500346,0.00025839655,0.00004179386,0.0000053766717,0.000016867634,0.00096761005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980788,0.00022766982,0.0006223055,0.00036462868,0.00028824885,0.00041833014],"domain_scores_gemma":[0.99787587,0.0005189391,0.00039990497,0.0007634353,0.00033561068,0.00010622641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013768442,0.0002009867,0.00047475786,0.00009291845,0.00019514105,0.00030223155,0.0011552693,0.00009254999,0.0000058101896],"category_scores_gemma":[0.00006181602,0.00017421757,0.00013988656,0.00027554383,0.00007448367,0.00030241988,0.00014931076,0.00009809137,0.00007734901],"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.000009035865,0.00007989014,0.0002586751,0.0004762822,0.00007558805,0.0000019721551,0.0021577794,0.0012324974,0.0012024973,0.9719194,0.008593715,0.013992669],"study_design_scores_gemma":[0.0027945116,0.00064311025,0.0067049162,0.0020235695,0.000041069874,0.00014087519,0.0014650781,0.8858272,0.0022635069,0.04977811,0.04689555,0.001422532],"about_ca_topic_score_codex":0.00008232385,"about_ca_topic_score_gemma":0.0000011134786,"teacher_disagreement_score":0.9380152,"about_ca_system_score_codex":0.00004072948,"about_ca_system_score_gemma":0.00006164124,"threshold_uncertainty_score":0.7104386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6608177,0.0003917171,0.33453983,0.00026273122,0.0010955763,0.00034903674,7.812557e-7,0.00021150958,0.0023311467],"genre_scores_gemma":[0.99785954,0.000003272086,0.001498717,0.00012592555,0.0001589839,0.000013695368,3.7665077e-7,0.000012121258,0.00032734495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811614,0.0005512384,0.00041027842,0.00029643415,0.00025528303,0.000370653],"domain_scores_gemma":[0.99782336,0.0008652864,0.00020135414,0.0008204146,0.00017097338,0.000118632204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024349608,0.00016505235,0.00023311576,0.00012282832,0.00044604237,0.00034120955,0.0015911497,0.00004401572,0.0000048909774],"category_scores_gemma":[0.000055552824,0.00011534688,0.00009762104,0.0005411806,0.00011589229,0.00016053997,0.000438377,0.00012294344,0.0001452707],"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.000010391614,0.000022113907,0.00010673303,0.000027021317,0.000032071803,0.0000016487031,0.0013050425,0.0030343856,0.0037448693,0.9580069,0.0011599198,0.03254886],"study_design_scores_gemma":[0.0019817569,0.0021892232,0.03550705,0.0020453536,0.00007392517,0.00022647,0.0046749623,0.4891239,0.019803675,0.41133693,0.030291442,0.0027452877],"about_ca_topic_score_codex":0.000039400253,"about_ca_topic_score_gemma":4.9973846e-7,"teacher_disagreement_score":0.54667,"about_ca_system_score_codex":0.00001878281,"about_ca_system_score_gemma":0.000021882854,"threshold_uncertainty_score":0.47037092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4767176,0.0007492143,0.50516224,0.00009403825,0.00067657983,0.00036225322,0.0000029577643,0.00028595186,0.01594919],"genre_scores_gemma":[0.9850758,0.000004472899,0.014278698,0.00002276384,0.00011220495,0.000003711999,0.000002247074,0.00001869092,0.00048142724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968604,0.0010780145,0.0008983824,0.0003802193,0.000393625,0.00038938178],"domain_scores_gemma":[0.9967847,0.0013490428,0.00087383616,0.0006031908,0.0002788337,0.00011041681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023579053,0.0002396525,0.00070091616,0.00020695172,0.00018808052,0.00012651281,0.00096718775,0.00008408211,0.00002544666],"category_scores_gemma":[0.00018810216,0.00020558429,0.00013233437,0.0003131956,0.0002461608,0.00018150642,0.00032135175,0.00030603097,0.000041434985],"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.000031185515,0.00017537897,0.0082381265,0.0005878919,0.0002448915,0.00001382935,0.0076379403,0.06127238,0.0484496,0.7353088,0.00030725016,0.1377327],"study_design_scores_gemma":[0.000782638,0.0004770652,0.0028327436,0.0011067089,0.000024836792,0.00012641093,0.001240655,0.9818898,0.0047096284,0.006107326,0.0002240716,0.00047810387],"about_ca_topic_score_codex":0.00046817824,"about_ca_topic_score_gemma":5.015592e-7,"teacher_disagreement_score":0.92061746,"about_ca_system_score_codex":0.000030109702,"about_ca_system_score_gemma":0.00007377479,"threshold_uncertainty_score":0.8383484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33177862,0.00009237148,0.66398567,0.000051621773,0.00015693578,0.00023629927,0.0000029616097,0.00009767739,0.0035978642],"genre_scores_gemma":[0.9936395,5.958349e-7,0.0061996803,0.000021734479,0.000048675676,0.000007993629,0.0000064566625,0.000008522893,0.00006680604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.00017914451,0.00046865086,0.00021583134,0.00027094057,0.00016495209],"domain_scores_gemma":[0.9985418,0.00040113067,0.0003542669,0.00046527013,0.00018425027,0.00005329892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058832753,0.00010805059,0.00025351447,0.00009202026,0.000063991305,0.000056726032,0.0006914674,0.000041043975,0.00001746807],"category_scores_gemma":[0.000017351485,0.00010131668,0.00007116895,0.00021575225,0.0000615894,0.00013591438,0.00016674669,0.00007034585,0.0000611828],"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":[8.200008e-7,0.00006679925,0.0005464165,0.00011768218,0.000027000426,6.2861426e-7,0.000863071,0.012128198,0.002511106,0.9781485,0.000118622345,0.005471154],"study_design_scores_gemma":[0.00031609103,0.000058788984,0.019632058,0.00022034289,0.0000091916,0.000028540193,0.00020883467,0.89261436,0.0033643472,0.08323378,0.00011978074,0.00019390638],"about_ca_topic_score_codex":0.00012179452,"about_ca_topic_score_gemma":4.009867e-7,"teacher_disagreement_score":0.89491475,"about_ca_system_score_codex":0.000017825623,"about_ca_system_score_gemma":0.000044785716,"threshold_uncertainty_score":0.41315743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06958145,0.00073625555,0.91928387,0.00021400079,0.0012023143,0.0018840205,0.000017622524,0.00014589219,0.0069345944],"genre_scores_gemma":[0.98975664,0.0000034211632,0.009908312,0.000016651733,0.000035270383,0.000023259083,4.6772755e-7,0.000016427424,0.00023955523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728173,0.0009608248,0.0006117445,0.00029867253,0.0004257379,0.00042130233],"domain_scores_gemma":[0.9960842,0.0014855936,0.0006193394,0.0013541459,0.00039705695,0.00005968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049214377,0.00016686905,0.0003412216,0.000087608336,0.0005902821,0.000049782186,0.0032398652,0.00005264356,0.0000017731414],"category_scores_gemma":[0.0001584688,0.00009624876,0.00022688342,0.0005636332,0.0019240538,0.000115966075,0.0006105463,0.00018198075,0.0000020969433],"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.000049913626,0.00004872679,0.0002382908,0.00013374501,0.000047778874,3.5527268e-7,0.0025581438,0.000119953336,0.00069794763,0.993498,0.00009142636,0.002515671],"study_design_scores_gemma":[0.0003238625,0.00014427384,0.0012376107,0.00018723097,0.000009399439,0.000018143894,0.00034478944,0.012293944,0.004669146,0.9803484,0.0002952607,0.00012790214],"about_ca_topic_score_codex":0.000053865144,"about_ca_topic_score_gemma":0.0000064824903,"teacher_disagreement_score":0.9201752,"about_ca_system_score_codex":0.000023611243,"about_ca_system_score_gemma":0.00007207795,"threshold_uncertainty_score":0.70892566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53353614,0.000014455056,0.45526195,0.000033160144,0.00032939896,0.0004139544,0.000008533415,0.00011681487,0.010285605],"genre_scores_gemma":[0.95235246,1.1967009e-7,0.046377726,0.0000138442,0.00019674076,0.000014083684,0.000010326971,0.000022526297,0.0010121441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989207,0.00006891074,0.00053587055,0.0001400052,0.00017617346,0.0001583806],"domain_scores_gemma":[0.9977582,0.0014489461,0.00031505787,0.00024582655,0.00018729756,0.00004467785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012791824,0.00012524796,0.0003222377,0.000062062965,0.00008417091,0.00010001796,0.00016887722,0.00007043163,0.000043933673],"category_scores_gemma":[0.0012169521,0.0000959582,0.00010968793,0.00006761995,0.000068014946,0.00010074842,0.000026832826,0.00011002955,0.000011208792],"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.00001555353,0.000053830678,0.000013654838,0.0004947682,0.000020227597,1.1487276e-7,0.0010541863,0.000013153472,0.0038777764,0.99269986,0.0005606364,0.0011962331],"study_design_scores_gemma":[0.00044248567,0.000046511628,0.000007468,0.00022767071,0.000020339201,0.000015828606,0.0005180218,0.13830195,0.0046010544,0.85487616,0.00079684396,0.00014563538],"about_ca_topic_score_codex":0.0000021457463,"about_ca_topic_score_gemma":5.0108457e-7,"teacher_disagreement_score":0.41881636,"about_ca_system_score_codex":0.000010639703,"about_ca_system_score_gemma":0.000018010736,"threshold_uncertainty_score":0.3913062},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113554046,0.0004779067,0.8770537,0.00007344604,0.00039130574,0.0003174102,5.864129e-7,0.00008309704,0.008048524],"genre_scores_gemma":[0.9920801,0.0000022292938,0.007611573,0.00007377514,0.00011510114,0.000002898566,4.664228e-7,0.000009789998,0.00010406279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970555,0.0010333585,0.0005058944,0.0003007109,0.00058576814,0.00051876745],"domain_scores_gemma":[0.99595094,0.0028701033,0.00016960964,0.00085435004,0.00009783893,0.000057174333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016545834,0.00013336093,0.0002459705,0.00033075718,0.00012558427,0.00007114197,0.0022120979,0.00005271568,0.0000014852823],"category_scores_gemma":[0.00015203586,0.00009459269,0.000069478956,0.0010895835,0.00021120433,0.00017101472,0.00025812842,0.00029926907,0.000017052329],"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.000017678989,0.00004590408,0.00034622976,0.000034864093,0.000009150084,0.000033485525,0.005394362,0.0011714284,0.00033405988,0.95781535,0.000022735861,0.034774777],"study_design_scores_gemma":[0.0017206545,0.00052341074,0.02229135,0.0005994526,0.000008610391,0.00047189943,0.0074990625,0.14929405,0.0033893462,0.81064457,0.0027845707,0.00077304756],"about_ca_topic_score_codex":0.000019863217,"about_ca_topic_score_gemma":0.0000020992788,"teacher_disagreement_score":0.87852603,"about_ca_system_score_codex":0.000038480695,"about_ca_system_score_gemma":0.000036592082,"threshold_uncertainty_score":0.57344884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038481843,0.00015758518,0.9460511,0.00004785699,0.00094129896,0.0002089125,7.9966054e-7,0.00021626826,0.013894288],"genre_scores_gemma":[0.98656803,0.0000015763802,0.012727251,0.000060324895,0.00013625457,7.4469375e-7,0.0000014671365,0.000009713027,0.00049462233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998269,0.0002927866,0.00047768813,0.00024047946,0.00037747517,0.00034254146],"domain_scores_gemma":[0.9988,0.0002831073,0.0002089036,0.00042353835,0.0001765846,0.00010789968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042556073,0.000113302995,0.00022566508,0.00016326467,0.00013146493,0.00010481502,0.00075186486,0.000054169144,0.000008640684],"category_scores_gemma":[0.000038396276,0.000102577855,0.00006497642,0.00038569185,0.00008309708,0.00014600388,0.00018378494,0.000114262264,0.000030260066],"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.000014939124,0.000051083665,0.00014206208,0.00008630655,0.000030101097,0.000011668649,0.0033084713,0.055928618,0.001530301,0.91920525,0.00017836677,0.01951285],"study_design_scores_gemma":[0.00070987473,0.0001319421,0.0006801126,0.00026534696,0.000006103971,0.00007438334,0.00040999116,0.98798096,0.0026786972,0.004852584,0.0019089226,0.00030105023],"about_ca_topic_score_codex":0.000034618348,"about_ca_topic_score_gemma":0.0000013817057,"teacher_disagreement_score":0.9480862,"about_ca_system_score_codex":0.00003973158,"about_ca_system_score_gemma":0.000060851104,"threshold_uncertainty_score":0.41830036},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54710186,0.00003179609,0.4505613,0.000088613604,0.00021006826,0.00032567116,0.0000031956588,0.00007843596,0.0015990571],"genre_scores_gemma":[0.99481386,0.00000137427,0.0050415536,0.00007262536,0.000029455481,0.000007389266,0.000001918646,0.000015346572,0.000016470494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487233,0.002894902,0.0008223386,0.00041524222,0.00051612227,0.0004790729],"domain_scores_gemma":[0.99167436,0.0063728923,0.0005439658,0.0011620997,0.00017270895,0.00007399282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067347735,0.00021265038,0.00061396265,0.00030638464,0.00020890878,0.000057323137,0.0016265012,0.00006337881,0.000006870931],"category_scores_gemma":[0.0006644717,0.00016104034,0.00014872485,0.0009959762,0.0007758318,0.00010986494,0.00036226303,0.0003242563,0.000010724726],"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.00004347043,0.00008999281,0.00047112262,0.00008569577,0.000024149549,0.0000011569604,0.001232768,0.018638972,0.002368505,0.97528064,0.000015820717,0.0017477077],"study_design_scores_gemma":[0.0006330578,0.00020961427,0.005121348,0.00053602003,0.000003947829,0.00000814514,0.00022109617,0.33961025,0.002095231,0.65136725,0.000015758458,0.00017829896],"about_ca_topic_score_codex":0.00003341072,"about_ca_topic_score_gemma":0.0000026562527,"teacher_disagreement_score":0.44771203,"about_ca_system_score_codex":0.000034757108,"about_ca_system_score_gemma":0.000034334967,"threshold_uncertainty_score":0.6567035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102134526,0.00014330306,0.8811264,0.0003942356,0.00090560206,0.00023181962,0.0000030293436,0.0012476734,0.013813426],"genre_scores_gemma":[0.8852811,0.000002695194,0.11451943,0.000059401667,0.00008001071,0.0000033902104,0.0000012048671,0.000015698077,0.00003709397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798054,0.00035095296,0.000500295,0.00045647618,0.00032140187,0.00039032096],"domain_scores_gemma":[0.9919866,0.0006267349,0.00038743025,0.0068531763,0.00008810211,0.00005800256],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0026850249,0.00019271202,0.00034340937,0.0002335754,0.00011165503,0.000057241014,0.02133298,0.00010462238,0.0000074536542],"category_scores_gemma":[0.0064704153,0.00017282205,0.00006709567,0.0003754419,0.00014382528,0.00020258472,0.029294735,0.0002625276,0.00005733283],"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.000029149272,0.00010399359,0.00029658395,0.00007570926,0.000053170737,0.000026495198,0.001839949,0.00026174154,0.00027399507,0.9704302,0.0031320537,0.02347696],"study_design_scores_gemma":[0.0004392791,0.00057362654,0.0007750663,0.000811947,0.000009616679,0.00006770088,0.00031920968,0.3376102,0.0074763973,0.6511022,0.00043511734,0.00037967289],"about_ca_topic_score_codex":0.000028769795,"about_ca_topic_score_gemma":1.5023502e-7,"teacher_disagreement_score":0.78314656,"about_ca_system_score_codex":0.000054322903,"about_ca_system_score_gemma":0.000041404986,"threshold_uncertainty_score":0.98396206},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83550316,0.00008902168,0.16213939,0.000058514015,0.00031789212,0.00025259584,0.000012900376,0.000036945967,0.0015895795],"genre_scores_gemma":[0.99772024,0.0000017239937,0.0021823603,0.000036142443,0.000033204073,0.0000017885386,8.349019e-7,0.000007551663,0.000016155675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984314,0.00042658884,0.00043074889,0.00023436817,0.00030172872,0.00017519058],"domain_scores_gemma":[0.9961195,0.0024708589,0.00061523,0.0005902889,0.00016221254,0.000041920393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020994756,0.00014062408,0.00036000556,0.00007692471,0.00011370328,0.00002322398,0.0007947605,0.00006100388,0.0000051284555],"category_scores_gemma":[0.00015542805,0.00009292871,0.00006864349,0.00014081229,0.0007059678,0.00011624164,0.00037529864,0.0001835003,0.0000014450193],"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.00002675638,0.00005023857,0.00004978733,0.00008507204,0.000015679314,7.723444e-7,0.003216624,0.000055413304,0.15181714,0.8433841,0.000018260838,0.0012801861],"study_design_scores_gemma":[0.0006827368,0.0005443803,0.010924595,0.002288007,0.000020501026,0.000059234928,0.0012850957,0.087690726,0.52888876,0.36731133,0.000009287915,0.00029535088],"about_ca_topic_score_codex":0.000027579494,"about_ca_topic_score_gemma":3.717084e-7,"teacher_disagreement_score":0.47607276,"about_ca_system_score_codex":0.000008092299,"about_ca_system_score_gemma":0.000028323835,"threshold_uncertainty_score":0.3789523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36277756,0.00019131745,0.63302034,0.00006906904,0.00036803243,0.00011763205,6.722325e-7,0.00008336267,0.0033720185],"genre_scores_gemma":[0.98998433,0.0000015542963,0.009478426,0.00010427899,0.00024160711,0.0000028159757,0.0000031694888,0.000012761128,0.00017104072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998306,0.00038012484,0.00034927862,0.00038901667,0.0003448438,0.00023077613],"domain_scores_gemma":[0.99801606,0.0011296181,0.00026775734,0.00037818844,0.00011881277,0.00008953879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012954565,0.00019076937,0.00031277828,0.00021087285,0.00017064073,0.00012696776,0.00037402188,0.000055187997,0.0000022533486],"category_scores_gemma":[0.000069481175,0.00015390676,0.000040595864,0.00033097598,0.0000776884,0.00015496743,0.000103664126,0.00009951801,0.000008240789],"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.000059682912,0.000062832936,0.0003853079,0.000089425404,0.000048346923,0.000003685261,0.0016356874,0.050236575,0.0008455735,0.9002172,0.00017616921,0.046239562],"study_design_scores_gemma":[0.001104659,0.0010010669,0.0061057084,0.00050708535,0.0000216457,0.0000916009,0.00013615192,0.95076287,0.0013953096,0.037802618,0.0006827927,0.00038849268],"about_ca_topic_score_codex":0.0000063573793,"about_ca_topic_score_gemma":6.939941e-7,"teacher_disagreement_score":0.9005263,"about_ca_system_score_codex":0.000017573979,"about_ca_system_score_gemma":0.00003686078,"threshold_uncertainty_score":0.62761354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5343831,0.0006139514,0.43589327,0.00085926306,0.0022158336,0.00041536984,0.000015401076,0.0016361941,0.023967614],"genre_scores_gemma":[0.99616414,0.000003171245,0.0028432459,0.00023190965,0.00036892932,0.000002314441,0.0000034869215,0.00001937619,0.00036340026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974395,0.00054240634,0.00071440125,0.00047384325,0.00043888346,0.00039095012],"domain_scores_gemma":[0.99699736,0.0011307725,0.00043446055,0.0012687542,0.00007329636,0.00009534602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035084821,0.00022297763,0.00039206742,0.00018866871,0.0001485586,0.00012309437,0.0015290765,0.00008326391,0.0000039430147],"category_scores_gemma":[0.00014235567,0.0001908805,0.00010896716,0.00031649854,0.00009295484,0.00022901883,0.00027974116,0.00016168824,0.0002360228],"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.00003634782,0.00009206709,0.000005319902,0.000042722902,0.00002575907,0.000005658167,0.0015421937,0.0046121525,0.00047236463,0.9538585,0.0015296516,0.037777256],"study_design_scores_gemma":[0.0012370938,0.00031572906,0.00083579414,0.0006718183,0.000009837233,0.000082599654,0.00022084899,0.95599717,0.0027365081,0.032142926,0.0053288243,0.0004208511],"about_ca_topic_score_codex":0.0000141075625,"about_ca_topic_score_gemma":3.327004e-7,"teacher_disagreement_score":0.951385,"about_ca_system_score_codex":0.00005271844,"about_ca_system_score_gemma":0.000045697725,"threshold_uncertainty_score":0.7783881},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17790803,0.0037993302,0.8140125,0.000028329952,0.00040517614,0.0005712346,0.0000013273612,0.00023238806,0.0030416462],"genre_scores_gemma":[0.99312127,0.00003477458,0.0064278627,0.000040230287,0.00012491443,0.00002782585,0.000004996548,0.000019429706,0.00019869504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979827,0.0005488781,0.0005549241,0.00032087753,0.00022598678,0.00036662442],"domain_scores_gemma":[0.99727035,0.0010598322,0.00031016849,0.0011531591,0.00014188486,0.00006461698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021954698,0.00018079537,0.00036394826,0.000055750865,0.00024068738,0.00019843952,0.001491798,0.000099496865,0.000007482318],"category_scores_gemma":[0.000008058631,0.00017293982,0.00010211679,0.00028331406,0.00012786922,0.000102133316,0.00015196386,0.00015399019,0.0000103009315],"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.000019171726,0.000032090044,0.00000249798,0.000041518615,0.000017130309,6.040476e-7,0.0010352858,0.58521223,0.000015499652,0.32885036,0.000114797105,0.084658824],"study_design_scores_gemma":[0.00034795696,0.00009158481,0.00008187633,0.00032112197,0.000009102512,0.000020790714,0.00030854493,0.9928686,0.0000143668,0.0048131524,0.00094636256,0.00017650999],"about_ca_topic_score_codex":0.00001030281,"about_ca_topic_score_gemma":0.0000016348936,"teacher_disagreement_score":0.81521326,"about_ca_system_score_codex":0.0000438431,"about_ca_system_score_gemma":0.000060769133,"threshold_uncertainty_score":0.7052281},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110690586,0.00013716587,0.8771511,0.000010323564,0.0004898667,0.0002644303,0.0000014018168,0.00008621001,0.011168937],"genre_scores_gemma":[0.98925275,0.0000022514641,0.010480167,0.000030185545,0.00011241049,0.0000034177685,0.0000012337302,0.000011300547,0.00010628728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985488,0.00025716427,0.00043878797,0.00025906332,0.00016898495,0.00032719277],"domain_scores_gemma":[0.99865043,0.0006179065,0.00019664482,0.00039199257,0.00007362738,0.00006937338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026780071,0.000120974735,0.0003035624,0.0001278353,0.0000706352,0.000044946068,0.00070954795,0.000060022525,0.000001777329],"category_scores_gemma":[0.000013783885,0.00011098401,0.00006803585,0.00017569847,0.0001732026,0.00010983871,0.00015613859,0.00011487518,0.000008123251],"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.000027200798,0.000047375357,0.00042292467,0.00014096005,0.000014760868,0.000009538708,0.007926973,0.0012719966,0.000053418247,0.95966583,0.0000793443,0.030339668],"study_design_scores_gemma":[0.00036011208,0.00008070198,0.0004841004,0.00033696982,0.000004425731,0.000013388309,0.00044483694,0.93255323,0.00009021908,0.06540983,0.0000722837,0.0001498867],"about_ca_topic_score_codex":0.000038587033,"about_ca_topic_score_gemma":0.0000010938877,"teacher_disagreement_score":0.93128127,"about_ca_system_score_codex":0.000018990077,"about_ca_system_score_gemma":0.000055361645,"threshold_uncertainty_score":0.45257965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6903936,0.00026755416,0.30777445,0.000005080551,0.00011793511,0.00020513442,0.0000022642887,0.000035897217,0.0011980861],"genre_scores_gemma":[0.9972191,0.000023003264,0.0026343085,0.0000018734064,0.000028000517,0.0000012668262,8.813063e-7,0.000005475968,0.00008607895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987155,0.00034711158,0.00048451568,0.00013640692,0.00020227394,0.00011418732],"domain_scores_gemma":[0.99880356,0.00018771618,0.0005032063,0.00023308123,0.00023691333,0.000035498633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013243702,0.00007725947,0.000283701,0.0001693187,0.00003290799,0.000011139181,0.0001363683,0.00004135877,0.0000041906733],"category_scores_gemma":[0.00004382272,0.00006709342,0.000068644054,0.00033148253,0.000074257994,0.00012495634,0.00006282636,0.000052202624,5.320526e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008647148,0.00032391492,0.0017307795,0.00068035384,0.00018074115,5.8331545e-7,0.010776562,0.8300089,0.05382067,0.03805307,0.00018166067,0.06415626],"study_design_scores_gemma":[0.0005038901,0.0006826978,0.0037337868,0.00030864569,0.000011044376,0.000038171678,0.00018580603,0.97690386,0.017008474,0.0004769669,0.00004331809,0.00010334941],"about_ca_topic_score_codex":0.00013592477,"about_ca_topic_score_gemma":0.0000013561921,"teacher_disagreement_score":0.30682552,"about_ca_system_score_codex":0.000032979224,"about_ca_system_score_gemma":0.000041175066,"threshold_uncertainty_score":0.27359903},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7087312,0.0000947939,0.27936375,0.000009257968,0.0005854965,0.00016451081,0.000003249713,0.00028788752,0.01075987],"genre_scores_gemma":[0.99457026,0.0000028188358,0.0049088285,0.0000662012,0.00020883082,0.0000017271165,0.0000030259857,0.00001619369,0.00022213171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981143,0.0004006562,0.00038545142,0.0004467733,0.00034789668,0.00030495602],"domain_scores_gemma":[0.9983616,0.00049243344,0.00018061866,0.0008217104,0.00004585474,0.00009781841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013791346,0.00017960322,0.00028612686,0.00013540343,0.00023000778,0.00015544838,0.00091218983,0.000058937,0.000018146064],"category_scores_gemma":[0.000030761315,0.00015621731,0.00005500992,0.00021371256,0.000031068095,0.00028167435,0.00012876767,0.00018221172,0.0000699222],"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.00007095475,0.00016034493,0.000031342133,0.000060812694,0.000022525042,0.000022254924,0.0016843317,0.06218693,0.0005961428,0.3792171,0.00008221248,0.55586505],"study_design_scores_gemma":[0.0007736492,0.00083955354,0.0007137855,0.0019298241,0.000008001699,0.000060412523,0.00017627614,0.9803766,0.0019046004,0.012022042,0.0007301478,0.00046510136],"about_ca_topic_score_codex":0.000041306033,"about_ca_topic_score_gemma":4.0178952e-7,"teacher_disagreement_score":0.91818964,"about_ca_system_score_codex":0.000036335594,"about_ca_system_score_gemma":0.000022888737,"threshold_uncertainty_score":0.6370357},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9544331,0.0032943457,0.02611985,0.000009120869,0.00071985135,0.0003000915,0.0000057022103,0.0005607421,0.01455723],"genre_scores_gemma":[0.99915636,0.0000057399548,0.00016544186,0.000011745374,0.00040841522,0.000008052143,0.0000038846074,0.000054057473,0.00018633164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860567,0.00018696445,0.0004396189,0.0001813887,0.00025042085,0.0003359565],"domain_scores_gemma":[0.9990236,0.0003065263,0.00012533912,0.000397587,0.000058621194,0.00008833646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010888883,0.00022714259,0.00042847014,0.00022890342,0.00007684463,0.000035504952,0.00028660067,0.00008688405,0.0000087126655],"category_scores_gemma":[0.000017330862,0.00018789114,0.00008499871,0.00052336167,0.000093325085,0.000084858926,0.00002406812,0.0001619924,0.000053310298],"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.000079158795,0.000091163325,0.0022902358,0.0013602184,0.00043464443,0.000016720973,0.0055928705,0.5332212,0.0016777483,0.4243163,0.00044633364,0.030473454],"study_design_scores_gemma":[0.0064484105,0.0012535725,0.019600792,0.0073067388,0.0005380378,0.0012906202,0.017517386,0.8858586,0.017065559,0.0082319,0.03051765,0.0043707397],"about_ca_topic_score_codex":0.000007769428,"about_ca_topic_score_gemma":0.0000012092321,"teacher_disagreement_score":0.41608438,"about_ca_system_score_codex":0.000046441768,"about_ca_system_score_gemma":0.000010043829,"threshold_uncertainty_score":0.76619786},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062257834,0.000025343668,0.9751028,0.00017355593,0.0009512045,0.00020551604,0.0000014129546,0.00011237882,0.017202016],"genre_scores_gemma":[0.92860025,0.0000075401585,0.06412532,0.00021176231,0.0060052886,0.0000024445555,0.000008894349,0.000016566923,0.0010219247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987473,0.0003955396,0.0002661553,0.00020832832,0.00023624163,0.00014642107],"domain_scores_gemma":[0.99913186,0.00030348625,0.00015026185,0.00027023713,0.000087324355,0.000056802794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015120757,0.00009030339,0.00018598142,0.00010520573,0.00008977509,0.00008838959,0.0003116328,0.00003973852,0.000006462338],"category_scores_gemma":[0.00007715617,0.00007891633,0.000022844128,0.00017004312,0.000054003915,0.000102487036,0.00010167255,0.000082202045,0.000019086783],"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.0000056475924,0.00006628522,0.000025506406,0.000088598616,0.000009994091,4.3326747e-7,0.0019251596,0.02219502,0.000042916126,0.7274282,0.0007166665,0.24749556],"study_design_scores_gemma":[0.0002965413,0.00015272846,0.00022555448,0.000113964394,0.0000017832616,0.00000691653,0.000086731,0.98679644,0.00008857485,0.0041681426,0.007966601,0.00009599763],"about_ca_topic_score_codex":0.000005382012,"about_ca_topic_score_gemma":2.35096e-7,"teacher_disagreement_score":0.96460146,"about_ca_system_score_codex":0.000013162633,"about_ca_system_score_gemma":0.0000131802135,"threshold_uncertainty_score":0.32181147},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017334579,0.0006182146,0.99398786,0.0000802282,0.0012767224,0.00089152297,0.000009399927,0.000103035,0.0012995865],"genre_scores_gemma":[0.7694824,0.0000039015704,0.2292921,0.00011765461,0.0005902268,0.000021135422,0.0000074807044,0.000021107942,0.00046404882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981308,0.00012507424,0.00056963554,0.00034677974,0.00039402832,0.00043370295],"domain_scores_gemma":[0.9974259,0.0011619799,0.00036311545,0.00079977687,0.00017482275,0.000074383664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044414825,0.00018235293,0.00027256084,0.00008884665,0.00029722077,0.00014170345,0.001326722,0.000060776572,0.0000024420754],"category_scores_gemma":[0.000017999997,0.00011633568,0.00010965068,0.00020547675,0.000081994935,0.00017732408,0.00048646453,0.00011098747,0.000012345793],"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.000019743047,0.00007396864,0.000075751705,0.00011240265,0.00006900489,0.000004496803,0.0016257056,0.002407191,0.00012396633,0.19193877,0.00091026485,0.8026387],"study_design_scores_gemma":[0.00070688926,0.00021319288,0.0010666625,0.0003220066,0.00001976189,0.000045784444,0.00056081894,0.96766067,0.00029403338,0.015465504,0.01340186,0.00024280294],"about_ca_topic_score_codex":0.000049932336,"about_ca_topic_score_gemma":0.0000031206737,"teacher_disagreement_score":0.9652535,"about_ca_system_score_codex":0.000036521047,"about_ca_system_score_gemma":0.00003637314,"threshold_uncertainty_score":0.47440314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29901466,0.00015830174,0.6961587,0.000021259835,0.0007055865,0.0007324801,0.0000026837015,0.0002430542,0.0029632535],"genre_scores_gemma":[0.9016922,0.000018790592,0.09766049,0.000021827651,0.0002253275,0.000030027766,0.000004666506,0.000024162046,0.00032247652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972215,0.00097649643,0.0006102229,0.00046485325,0.0003801684,0.0003467484],"domain_scores_gemma":[0.9973917,0.000987938,0.00047505947,0.0008475737,0.00017292588,0.0001248027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00596936,0.00020613238,0.00042064063,0.00023128411,0.00021632672,0.00021961845,0.0008774323,0.000108904234,7.6825654e-7],"category_scores_gemma":[0.00019242075,0.00018827761,0.00005877592,0.00027135535,0.000096937256,0.00033756066,0.00015377367,0.00011442382,0.000012557457],"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.00014448824,0.00007085984,0.00012440699,0.00027728977,0.000026924765,0.000002634843,0.0020550666,0.017052228,0.0034298957,0.95946157,0.000040484745,0.017314153],"study_design_scores_gemma":[0.00064702454,0.0007757295,0.0014438995,0.00054446066,0.000012151822,0.000095674404,0.00018308127,0.9881377,0.00022290427,0.006757879,0.0009161635,0.000263338],"about_ca_topic_score_codex":0.000045382018,"about_ca_topic_score_gemma":2.0349567e-7,"teacher_disagreement_score":0.9710855,"about_ca_system_score_codex":0.000058501817,"about_ca_system_score_gemma":0.00003693512,"threshold_uncertainty_score":0.7677738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122903,0.00032960213,0.4835481,0.0002981714,0.0005073218,0.0010756884,0.000029946266,0.00010907947,0.0018117959],"genre_scores_gemma":[0.9948999,0.0000020776745,0.003975936,0.000050526596,0.00019399256,0.000031215553,0.0000026372545,0.000022915197,0.0008207667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979672,0.00042152012,0.00076884084,0.00023218512,0.0002648228,0.00034545903],"domain_scores_gemma":[0.98659307,0.011947488,0.0004916881,0.00073897693,0.00017988858,0.000048875885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030595534,0.00016400375,0.00044355795,0.00008732308,0.0006240328,0.000023576273,0.00051681715,0.000082809274,0.000021333524],"category_scores_gemma":[0.0019244647,0.00011453087,0.00016853893,0.0002614857,0.00035939264,0.000040716586,0.00011646158,0.00012082763,0.000010703768],"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.000020864953,0.0000744559,0.00039680646,0.0003222687,0.00008607128,4.5441274e-7,0.0037167699,0.00009287638,0.000055582714,0.9907061,0.004231166,0.00029658191],"study_design_scores_gemma":[0.00067774154,0.00013535668,0.00082526135,0.00007062336,0.000046816884,0.000029787238,0.00088029425,0.012045611,0.000045043646,0.98418283,0.00089840277,0.00016220789],"about_ca_topic_score_codex":0.00004135193,"about_ca_topic_score_gemma":0.000005767032,"teacher_disagreement_score":0.48260963,"about_ca_system_score_codex":0.000041535488,"about_ca_system_score_gemma":0.00006095827,"threshold_uncertainty_score":0.4799619},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09164189,0.0005173364,0.9013248,0.00007570471,0.0020177267,0.00030909147,0.0000032738456,0.00040749475,0.003702694],"genre_scores_gemma":[0.99106383,0.0000019585439,0.007592904,0.00010827504,0.0009208221,0.0000064261894,0.0000041567723,0.000019335323,0.00028226472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727935,0.00069139345,0.0008366154,0.00041228806,0.00036144754,0.00041889356],"domain_scores_gemma":[0.9978924,0.0005774929,0.00044379506,0.00072647975,0.00024623508,0.000113590824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021617066,0.00022647345,0.0005171042,0.0001797712,0.0001993752,0.00015255429,0.00096551346,0.00009956098,0.000020517626],"category_scores_gemma":[0.000036441306,0.00020440195,0.0001539803,0.00036895816,0.00006647685,0.00022475039,0.00022884588,0.00017214364,0.000097044125],"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.00001365801,0.00018403897,0.000119345175,0.00012441355,0.0001663879,0.000011596577,0.0045201397,0.03406023,0.0015356244,0.704784,0.0040352237,0.25044537],"study_design_scores_gemma":[0.00046594476,0.000097007374,0.00035461245,0.00018807345,0.0000075551834,0.00012697474,0.00026045006,0.9856399,0.00057442597,0.0014764925,0.010553547,0.0002549877],"about_ca_topic_score_codex":0.000070765826,"about_ca_topic_score_gemma":0.000002582566,"teacher_disagreement_score":0.9515797,"about_ca_system_score_codex":0.000090435366,"about_ca_system_score_gemma":0.00004132627,"threshold_uncertainty_score":0.83352697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5077227,0.00009392373,0.48754838,0.000111439665,0.0020568983,0.0007673673,0.0000043306572,0.0002334153,0.0014615607],"genre_scores_gemma":[0.97305304,8.786462e-7,0.026664523,0.000032978096,0.00018163162,0.000009024814,0.0000022983616,0.000022775934,0.00003282134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951428,0.0013815516,0.0013098725,0.00084126013,0.0007736141,0.0005508782],"domain_scores_gemma":[0.9937348,0.002892331,0.00078468525,0.0019012933,0.0005056312,0.0001812671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007861274,0.00038818835,0.0012591936,0.00020414754,0.00014927522,0.00012943654,0.0020877915,0.0001872035,0.0000141890305],"category_scores_gemma":[0.00047131852,0.00032739868,0.00028832952,0.0006582173,0.00049051165,0.00019702104,0.0008170923,0.00055951683,0.000021216048],"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.00012015839,0.0009295724,0.001150646,0.001135318,0.00008658071,0.0000063277653,0.0019099723,0.04166989,0.0022474031,0.9180165,0.00004865502,0.03267901],"study_design_scores_gemma":[0.0019450221,0.00048269724,0.0042387233,0.00048853323,0.00002424902,0.00009997301,0.00008763972,0.8944809,0.0016440963,0.09583446,0.00017559626,0.00049814145],"about_ca_topic_score_codex":0.00008449632,"about_ca_topic_score_gemma":0.00000593202,"teacher_disagreement_score":0.852811,"about_ca_system_score_codex":0.00008153674,"about_ca_system_score_gemma":0.00015933462,"threshold_uncertainty_score":0.9999178},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032452885,0.001654883,0.9636715,0.00070798706,0.0001847493,0.0004661553,0.00002537531,0.00012879907,0.000707642],"genre_scores_gemma":[0.97386926,0.0000075534736,0.025961516,0.000046023553,0.000044628272,0.000011724545,0.000011571287,0.000009631177,0.000038100134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864316,0.0003398659,0.00047726984,0.00017637831,0.00019813182,0.00016521201],"domain_scores_gemma":[0.9964063,0.0015582953,0.0005058712,0.0013112477,0.00019004675,0.00002824622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002386243,0.00010978935,0.00027689262,0.00007031137,0.00027606156,0.000049650473,0.0016663821,0.00004169313,0.0000015132838],"category_scores_gemma":[0.00009135563,0.00008122697,0.00010796416,0.00024176571,0.0004810205,0.00009832564,0.00020814856,0.00008251884,0.0000032934652],"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.000006701514,0.000044342458,0.000012939759,0.000085242486,0.000039355862,1.0793508e-7,0.0023865516,0.004291133,0.0028498573,0.9868461,0.00006758969,0.0033700643],"study_design_scores_gemma":[0.0013534141,0.00016013483,0.0064277095,0.0007643943,0.000060768234,0.000040789837,0.005934454,0.2886851,0.005566822,0.6891312,0.0015385594,0.00033660725],"about_ca_topic_score_codex":0.00011244074,"about_ca_topic_score_gemma":0.000003428082,"teacher_disagreement_score":0.9414164,"about_ca_system_score_codex":0.00003121764,"about_ca_system_score_gemma":0.00003883582,"threshold_uncertainty_score":0.33123398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09486375,0.00085721037,0.8867367,0.000008711401,0.0012444941,0.00021437669,0.000009617768,0.00012287014,0.01594229],"genre_scores_gemma":[0.99620014,0.0000016878266,0.0035730628,0.0000067410197,0.000029509729,0.0000026850962,0.00000280176,0.0000068128325,0.00017655274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813443,0.00049816805,0.0006568186,0.00023994557,0.0002711407,0.00019951412],"domain_scores_gemma":[0.998368,0.00017621354,0.0005387008,0.0006475132,0.00022311568,0.000046448313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019989212,0.000114990995,0.0003628657,0.000073576266,0.0000812692,0.000045841243,0.0005237822,0.000058854377,0.000004199201],"category_scores_gemma":[0.00008634188,0.00010913377,0.000076798555,0.00032010765,0.00009022845,0.0001499888,0.000047232377,0.00006139487,0.00001253756],"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.000003304399,0.000044972334,0.00017057126,0.00020206207,0.000027229065,0.0000013797195,0.00061557844,0.0021905324,0.004696435,0.99079025,0.00014990104,0.0011077627],"study_design_scores_gemma":[0.004657522,0.0007076941,0.007923165,0.0041916952,0.00012377629,0.00066874776,0.0033440385,0.8003544,0.100477315,0.046967372,0.028595941,0.0019883192],"about_ca_topic_score_codex":0.000039631417,"about_ca_topic_score_gemma":2.289098e-7,"teacher_disagreement_score":0.9438229,"about_ca_system_score_codex":0.000026207637,"about_ca_system_score_gemma":0.00010654117,"threshold_uncertainty_score":0.4450346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042432886,0.000513264,0.9398423,0.000019842606,0.0026774586,0.00021745448,1.7759743e-7,0.0001349241,0.014161696],"genre_scores_gemma":[0.99716777,0.000004059284,0.0021643124,0.000033591587,0.00016209799,0.0000049527375,4.2380822e-7,0.000012597908,0.00045017272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728805,0.0010997271,0.0007257478,0.00030889892,0.00019222451,0.00038533015],"domain_scores_gemma":[0.9986465,0.00041219697,0.00033214007,0.0004658961,0.00009033874,0.00005292884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003908052,0.0001662339,0.0004120493,0.00012734294,0.00011582052,0.000120295525,0.00052811054,0.000095536445,0.0000035611165],"category_scores_gemma":[0.00008314275,0.00015320517,0.00008289255,0.00042816883,0.000048367805,0.0002316417,0.000086876644,0.00018095538,0.000008095203],"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.000005896603,0.00001631905,0.0010657131,0.000026732157,0.000012800013,0.0000056967556,0.0012342522,0.20274694,0.000015908023,0.7941701,0.000073229865,0.00062641234],"study_design_scores_gemma":[0.00048830896,0.00009731521,0.00076495984,0.00060718594,0.000003558629,0.00021384656,0.0011971726,0.9874273,0.000060054095,0.007966427,0.0008712379,0.00030266802],"about_ca_topic_score_codex":0.00004645254,"about_ca_topic_score_gemma":0.000006767198,"teacher_disagreement_score":0.9547349,"about_ca_system_score_codex":0.000050055416,"about_ca_system_score_gemma":0.000034818313,"threshold_uncertainty_score":0.6247525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997864,0.0006745691,0.00046068654,0.000029822771,0.00011120905,0.0001778142,0.000008185854,0.000013266702,0.000660423],"genre_scores_gemma":[0.999538,0.000015353784,0.00012822705,0.000029943625,0.00006755875,9.958133e-7,0.00003432782,0.00000725442,0.00017833637],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920106,0.0001876699,0.00023843863,0.00018114755,0.00006245957,0.00012920356],"domain_scores_gemma":[0.99961615,0.000048757818,0.000115819654,0.00012855242,0.00006165414,0.000029074941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070482574,0.000094179515,0.00015691834,0.00006278337,0.000054849457,0.000019609097,0.000109430504,0.000095772026,0.0000037002408],"category_scores_gemma":[0.00004860995,0.00009588632,0.000025175521,0.0000714916,0.00005314027,0.0000052721048,0.000068738795,0.000050099068,0.000004263046],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004154373,0.00027875646,0.31389531,0.0005610789,0.00022765284,0.000009561226,0.0036673497,0.0072044423,0.6512977,0.014233472,0.00140872,0.006800531],"study_design_scores_gemma":[0.00591206,0.00092082337,0.30719936,0.0010182778,0.000064350075,0.00022698799,0.001420279,0.015292623,0.6572731,0.0048307334,0.0046214885,0.0012199199],"about_ca_topic_score_codex":0.000026445805,"about_ca_topic_score_gemma":0.0000065744557,"teacher_disagreement_score":0.009402739,"about_ca_system_score_codex":0.000012223084,"about_ca_system_score_gemma":0.000015284118,"threshold_uncertainty_score":0.39101303},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23103444,0.00017991112,0.73643994,0.000012964273,0.0006412656,0.00037366318,0.0000038361763,0.00010866157,0.031205311],"genre_scores_gemma":[0.9872465,0.0000026030068,0.012499042,0.000029387693,0.000031056596,0.00000317235,0.0000013672656,0.000011872327,0.00017495689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979378,0.00050152617,0.00066935096,0.00027179823,0.00031519416,0.00030431213],"domain_scores_gemma":[0.9987611,0.00021431899,0.0003636722,0.000481952,0.000099331315,0.00007961873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016702639,0.0001393138,0.00035051588,0.000269358,0.00006250358,0.000033368975,0.0008898957,0.0000658962,0.000019517993],"category_scores_gemma":[0.00005826415,0.00013485645,0.00006694516,0.00033737684,0.00017657202,0.00013071657,0.00024001233,0.00012293202,0.000011787048],"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.000104325234,0.0008810199,0.0050072363,0.0009909216,0.00013010883,0.000100885634,0.070863955,0.021147951,0.00084082095,0.84294575,0.00014116189,0.05684585],"study_design_scores_gemma":[0.0018813807,0.00077617436,0.021958565,0.0011219092,0.000016232909,0.00016227024,0.0011723838,0.94599044,0.0012080185,0.025053464,0.000073440264,0.0005857204],"about_ca_topic_score_codex":0.00012645668,"about_ca_topic_score_gemma":0.000004993771,"teacher_disagreement_score":0.9248425,"about_ca_system_score_codex":0.00005021862,"about_ca_system_score_gemma":0.00013251463,"threshold_uncertainty_score":0.54992867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15489757,0.00009684656,0.8401757,0.00014555217,0.0012008602,0.0009851761,0.000015590202,0.0001372607,0.0023454556],"genre_scores_gemma":[0.99145913,1.4952145e-7,0.0074590133,0.00010407079,0.00017848816,0.000046285237,0.00000997401,0.000022273083,0.00072063156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952646,0.0021541636,0.0012110405,0.0004089135,0.0007361177,0.0002251473],"domain_scores_gemma":[0.9852989,0.012382532,0.000983822,0.00059660815,0.0006014048,0.00013677818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027592119,0.00019632683,0.00085800077,0.00028041948,0.0002566263,0.00011177231,0.0006260304,0.00008775127,0.000026457437],"category_scores_gemma":[0.0056098313,0.00013744347,0.00028011453,0.0004862464,0.00021347932,0.00007118127,0.000046014127,0.00012644845,0.00011517771],"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.006567535,0.000047714988,0.000006672192,0.000011143174,0.000032906108,2.7898062e-7,0.0004239656,0.2230498,0.00029624786,0.76767445,0.0001000123,0.0017892749],"study_design_scores_gemma":[0.024990235,0.00007184668,0.000002285098,0.00009080739,0.000031973403,0.00000442828,0.0008637966,0.42102167,0.0014427454,0.5512062,0.00015286692,0.00012120744],"about_ca_topic_score_codex":0.000013663601,"about_ca_topic_score_gemma":4.0837602e-7,"teacher_disagreement_score":0.83656156,"about_ca_system_score_codex":0.000036951296,"about_ca_system_score_gemma":0.000089432724,"threshold_uncertainty_score":0.9562933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020853536,0.00005840977,0.9734326,0.000084150444,0.0010123755,0.00025243187,0.000006073004,0.00013786329,0.0041625774],"genre_scores_gemma":[0.98992723,0.0000011734728,0.009720277,0.000024395518,0.00016955972,0.00000180098,0.000023528397,0.000008742255,0.00012329375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833673,0.00034323428,0.00040953825,0.00041560188,0.00023436568,0.00026055233],"domain_scores_gemma":[0.99777794,0.00040161514,0.00018547292,0.0015584228,0.00002840549,0.00004813332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036084612,0.00012197632,0.00026129468,0.00014494125,0.000047719463,0.00014317685,0.0026567501,0.000030395793,0.0000014698014],"category_scores_gemma":[0.00015940846,0.0001119992,0.000019803965,0.0002815224,0.000055566576,0.00040898685,0.0015612146,0.000088604924,0.000019906101],"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.0000073904653,0.00010080892,0.0006238252,0.0005880188,0.000029771649,0.000010358577,0.0014482519,0.018479984,0.000042972926,0.61158854,0.0004452058,0.36663485],"study_design_scores_gemma":[0.00024822127,0.0000299359,0.00061530556,0.00027128402,0.0000039694423,0.0000046415694,0.00009383167,0.9917703,0.0000066742346,0.006044809,0.00078319816,0.00012778913],"about_ca_topic_score_codex":0.0000675007,"about_ca_topic_score_gemma":0.000018622208,"teacher_disagreement_score":0.9732904,"about_ca_system_score_codex":0.000021304339,"about_ca_system_score_gemma":0.000017643773,"threshold_uncertainty_score":0.49369466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44522122,0.00024968834,0.54941255,0.000008242777,0.00064878195,0.00014963133,2.776744e-7,0.0002675007,0.0040421262],"genre_scores_gemma":[0.9913541,6.087948e-7,0.00832228,0.00005392043,0.00019480291,0.0000010953229,0.0000013565681,0.000012805017,0.000059004695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828196,0.00022621137,0.00050515763,0.00027396777,0.0003326663,0.00038006756],"domain_scores_gemma":[0.9986639,0.0004161691,0.00028364765,0.00050068623,0.000056602166,0.000079000434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058563943,0.00014759315,0.0002661666,0.0001250242,0.00013462422,0.00011043805,0.0009376023,0.000053797885,0.000002781981],"category_scores_gemma":[0.00002981814,0.00013149828,0.00008309248,0.000301298,0.0000834101,0.00020334321,0.00027428978,0.00011877393,0.00001951748],"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.000011805546,0.000069330265,0.00088821753,0.00008340345,0.000031202744,0.000011385925,0.002548819,0.00014237683,0.0049103354,0.8191488,0.0000318494,0.17212252],"study_design_scores_gemma":[0.0062596677,0.0018574917,0.04637728,0.0059200088,0.00010316494,0.001558831,0.013452378,0.57751554,0.0842743,0.25320756,0.005634184,0.0038395943],"about_ca_topic_score_codex":0.000035036202,"about_ca_topic_score_gemma":8.5301593e-7,"teacher_disagreement_score":0.57737315,"about_ca_system_score_codex":0.000038392816,"about_ca_system_score_gemma":0.000021157828,"threshold_uncertainty_score":0.5362344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83976614,0.00011014423,0.15011881,0.0001143752,0.00037199628,0.00082043814,0.000015844227,0.00008011683,0.008602131],"genre_scores_gemma":[0.9925364,2.3566322e-7,0.00083430315,0.00006526922,0.0002060927,0.000037698937,0.0000028465254,0.000014402868,0.006302713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977383,0.00047899282,0.0007697273,0.00031652008,0.00045519244,0.00024127329],"domain_scores_gemma":[0.99302447,0.005446091,0.00043486,0.0007048006,0.00030814874,0.00008165709],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005869091,0.00012940736,0.0004005496,0.000119975084,0.00017308186,0.00015377671,0.00082164793,0.000064916174,0.00044655846],"category_scores_gemma":[0.00067374646,0.00009498246,0.00014575651,0.00029075364,0.00012102744,0.00013964686,0.000091411435,0.00006617502,0.0018011195],"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.000042301002,0.00008829107,0.00029589926,0.000040967036,0.000044124583,2.3258038e-7,0.0015234861,0.0056151273,0.012048214,0.9339414,0.017127145,0.029232794],"study_design_scores_gemma":[0.00052621344,0.00008749913,0.003457667,0.000098826626,0.000019725721,0.000011466751,0.00078004913,0.17460054,0.0009141671,0.80883694,0.010411493,0.00025541132],"about_ca_topic_score_codex":0.000014837721,"about_ca_topic_score_gemma":2.554672e-7,"teacher_disagreement_score":0.16898541,"about_ca_system_score_codex":0.000013406237,"about_ca_system_score_gemma":0.000026255191,"threshold_uncertainty_score":0.9989761},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06543226,0.0002551851,0.9178536,0.00016616224,0.0009993205,0.0001980942,0.0000029744638,0.00031494506,0.014777491],"genre_scores_gemma":[0.99084437,0.0000016842548,0.008376911,0.00015906309,0.00038025944,0.0000024348446,7.3462076e-7,0.000011921453,0.00022263471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981897,0.0003027254,0.0004248972,0.00036196457,0.00039818362,0.00032253377],"domain_scores_gemma":[0.9982503,0.0005796927,0.000227381,0.00077250664,0.000087675224,0.000082430975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013723677,0.00017666077,0.00032400686,0.00018847751,0.00016850467,0.000094699244,0.0011971063,0.000064106775,0.0000049792566],"category_scores_gemma":[0.00004499402,0.00016687594,0.000118225114,0.00034730876,0.00009454283,0.00016647328,0.00021635223,0.0001793758,0.00008010895],"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.0000041569306,0.00007358834,0.000010335241,0.000038393304,0.000017589608,0.0000031288776,0.0017179155,0.030318808,0.00026003874,0.80677384,0.00008705251,0.16069517],"study_design_scores_gemma":[0.00041537744,0.00015343,0.00043139275,0.00033678452,0.0000062334816,0.000047599504,0.000052743417,0.96181184,0.0010581097,0.03311513,0.002285397,0.0002859861],"about_ca_topic_score_codex":0.0000147367655,"about_ca_topic_score_gemma":7.190436e-7,"teacher_disagreement_score":0.931493,"about_ca_system_score_codex":0.000049020484,"about_ca_system_score_gemma":0.00003978353,"threshold_uncertainty_score":0.6805003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091321114,0.0035538287,0.9919,0.00017436696,0.0007097262,0.0005893577,0.0000028741217,0.00056968606,0.0015869318],"genre_scores_gemma":[0.7395255,0.000027129514,0.2589427,0.000084771076,0.00022297793,0.000022509537,6.4531685e-7,0.000018776753,0.0011550208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981161,0.00023330137,0.0005691702,0.00037877812,0.00032606657,0.00037662778],"domain_scores_gemma":[0.9974566,0.0010480459,0.0004090526,0.0008174005,0.00020002847,0.000068835376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019415977,0.00021649545,0.0003543798,0.00010651513,0.00037076452,0.00015643673,0.0016823448,0.00008313618,0.000003600909],"category_scores_gemma":[0.00006968733,0.00016288778,0.0001610549,0.00020146638,0.00016725951,0.00014017419,0.00024679533,0.00014765804,0.000010555395],"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.0000057724337,0.00004703852,0.0000036137958,0.000046922312,0.000030424542,0.0000010944201,0.0013803198,0.7877758,0.000030557832,0.18319973,0.00095825206,0.026520465],"study_design_scores_gemma":[0.00034402005,0.00008137126,0.000012482776,0.00013221946,0.000013095908,0.00004205446,0.000059235444,0.9905988,0.00014502248,0.008242803,0.00013272645,0.00019615599],"about_ca_topic_score_codex":0.000022350758,"about_ca_topic_score_gemma":1.9299152e-7,"teacher_disagreement_score":0.7386123,"about_ca_system_score_codex":0.000043519027,"about_ca_system_score_gemma":0.000032242548,"threshold_uncertainty_score":0.6642371},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42888418,0.000035017507,0.568016,0.00014726247,0.0010409697,0.0003410451,0.0000066148577,0.00010451417,0.0014244074],"genre_scores_gemma":[0.9878174,3.7616994e-7,0.011837106,0.00008839512,0.00020445554,0.0000039822994,0.0000018318079,0.000018176173,0.000028261677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759066,0.0004291073,0.0008425465,0.0003663342,0.0003846214,0.0003867207],"domain_scores_gemma":[0.99080086,0.0071042166,0.000802862,0.000883725,0.00035492983,0.000053430613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039954074,0.00022928716,0.000483417,0.00013449839,0.00032225583,0.00019900176,0.0017760998,0.00009192723,0.000006437869],"category_scores_gemma":[0.0006242791,0.00017019939,0.00016320487,0.00030226653,0.0009254852,0.00017526197,0.00029714245,0.00032636494,0.000009621539],"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.00001968976,0.00004476697,0.00008636283,0.000109322726,0.00003503162,7.7870425e-7,0.0072503346,0.02819847,0.0044739284,0.9557217,0.000114182876,0.00394545],"study_design_scores_gemma":[0.000095998475,0.00019136701,0.00036564798,0.00036834655,0.000009323182,0.000010174599,0.0033118061,0.6517985,0.010565123,0.3330075,0.00007958615,0.00019661731],"about_ca_topic_score_codex":0.00007568489,"about_ca_topic_score_gemma":0.0000073681144,"teacher_disagreement_score":0.62360007,"about_ca_system_score_codex":0.000016188656,"about_ca_system_score_gemma":0.00010961323,"threshold_uncertainty_score":0.694053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35484537,0.0010561293,0.53693086,0.00004062291,0.0042969403,0.0019319335,0.0000047783324,0.00075150194,0.10014187],"genre_scores_gemma":[0.97707576,0.0000036351257,0.021927554,0.0000052159953,0.00020659964,0.000009215922,3.0513763e-7,0.00004241532,0.0007293022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981353,0.00036494574,0.0007591707,0.00015767619,0.00029265287,0.0002902432],"domain_scores_gemma":[0.9959743,0.002473379,0.0006527424,0.0006459598,0.00020249837,0.00005113501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029861203,0.00017346138,0.00038530785,0.000040630854,0.00020805065,0.000023584624,0.00054483564,0.000065736276,0.000006142828],"category_scores_gemma":[0.0006408875,0.000114750015,0.00008790534,0.0001478832,0.00015491988,0.00004507121,0.00013619858,0.00015187985,0.000021561602],"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.000028448618,0.000079145364,0.000014876169,0.0002762265,0.000052917196,0.0000017197456,0.0041130623,0.000025784668,0.000119803015,0.99373937,0.00022725153,0.0013214153],"study_design_scores_gemma":[0.0002775636,0.00008543954,0.00001477135,0.00031560942,0.000032113203,0.000022631053,0.0010931992,0.0011601495,0.00086974906,0.9955631,0.00043022088,0.0001354849],"about_ca_topic_score_codex":0.0000065101285,"about_ca_topic_score_gemma":7.059897e-7,"teacher_disagreement_score":0.6222304,"about_ca_system_score_codex":0.00003545279,"about_ca_system_score_gemma":0.000030015268,"threshold_uncertainty_score":0.467937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50549203,0.00029338713,0.4929769,0.0000063855864,0.000736471,0.00030775805,4.6112794e-7,0.00013063918,0.000055948545],"genre_scores_gemma":[0.8615286,0.000003228383,0.13790621,0.000009009273,0.00046031436,0.000009198791,9.3311405e-7,0.00003390967,0.00004864728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771357,0.00028570718,0.0006346034,0.0005035829,0.0002658134,0.00059672026],"domain_scores_gemma":[0.9969405,0.0016568523,0.00050471793,0.0004917693,0.00027514415,0.00013104314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001287965,0.0002758475,0.0004898225,0.00014159072,0.00033008485,0.00027676838,0.00051084696,0.0001294948,7.0719324e-7],"category_scores_gemma":[0.00008495166,0.00026820393,0.000095798896,0.00028304334,0.00011209778,0.00023854215,0.00026728094,0.00018012173,0.0000013757508],"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.0000069207344,0.000017291577,0.0013562293,0.0000815549,0.000039924318,0.0000021023409,0.0008720102,0.9852954,0.001743594,0.006891003,0.0000086213295,0.0036853342],"study_design_scores_gemma":[0.00031725926,0.00006587128,0.0005748832,0.00055014365,0.000015082877,0.00006199773,0.0005695781,0.9964496,0.0010480834,0.000068270696,0.0000070029528,0.0002722506],"about_ca_topic_score_codex":0.00006045329,"about_ca_topic_score_gemma":1.1946669e-7,"teacher_disagreement_score":0.3560365,"about_ca_system_score_codex":0.000043067437,"about_ca_system_score_gemma":0.000021200354,"threshold_uncertainty_score":0.999977},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42081234,0.002429339,0.5528135,0.0003013546,0.0035596564,0.0004920109,0.000008341691,0.00045661544,0.019126851],"genre_scores_gemma":[0.99832517,0.000015879808,0.00092881225,0.000034322067,0.00015953727,0.0000040996556,8.0204103e-7,0.000019836465,0.0005115366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970922,0.0009677758,0.0007250637,0.0003585623,0.00044743548,0.00040895102],"domain_scores_gemma":[0.9927852,0.002551842,0.0013200663,0.003120389,0.00014748213,0.000075010554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008677979,0.00022074694,0.00048699917,0.00007849071,0.0009590829,0.00038223862,0.0049165427,0.000087452216,0.000003956756],"category_scores_gemma":[0.00048607623,0.00014935854,0.00017028395,0.000113208014,0.0006835613,0.00030476088,0.0010598815,0.00016389045,0.000025440046],"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.000020699881,0.00003604922,0.00018283939,0.00008886897,0.000074275216,0.0000035684875,0.0012458618,0.00012610026,0.00057937746,0.9465926,0.00021404024,0.05083571],"study_design_scores_gemma":[0.0011145842,0.00023779947,0.018601637,0.0011292221,0.000051092113,0.00010709834,0.0013251969,0.1713261,0.005219043,0.7983644,0.0019441664,0.00057969365],"about_ca_topic_score_codex":0.00003473247,"about_ca_topic_score_gemma":8.879416e-7,"teacher_disagreement_score":0.5775128,"about_ca_system_score_codex":0.000022223518,"about_ca_system_score_gemma":0.00008046977,"threshold_uncertainty_score":0.9136241},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072680704,0.00022931915,0.89254093,0.0017679544,0.0010982202,0.001039974,0.0000043587142,0.0001946433,0.030443912],"genre_scores_gemma":[0.99504334,0.000001114534,0.0041814144,0.0002503586,0.00003345194,0.000002990459,5.720328e-7,0.000009691045,0.0004770835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695647,0.0014188524,0.00046400065,0.00021241045,0.00072104303,0.00022723788],"domain_scores_gemma":[0.99709815,0.0010349861,0.00044692986,0.0009122823,0.0004322305,0.000075428856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052017425,0.00012919748,0.00025463625,0.00010033923,0.00014991066,0.00007741629,0.0016980786,0.000048645925,0.0000055420883],"category_scores_gemma":[0.00025416855,0.00007089526,0.00008743115,0.0010941825,0.00029205752,0.0001013075,0.00047873877,0.00018431233,0.000017950551],"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.0000072756316,0.000054037024,0.00009663063,0.000045333607,0.000021522457,1.8779275e-7,0.0014591124,0.13475934,0.000017210172,0.8624151,0.0009310208,0.00019322835],"study_design_scores_gemma":[0.00056089094,0.00015744928,0.0007733759,0.0003131739,0.000010461126,0.000010250635,0.00077705,0.7714335,0.0003530453,0.22501306,0.0004299005,0.00016784198],"about_ca_topic_score_codex":0.00008796351,"about_ca_topic_score_gemma":0.0000033462948,"teacher_disagreement_score":0.9223626,"about_ca_system_score_codex":0.000049903894,"about_ca_system_score_gemma":0.0001356371,"threshold_uncertainty_score":0.31554806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06403606,0.0002600367,0.93433553,0.00019796555,0.000106180974,0.00050691876,0.0000022850902,0.00017157906,0.0003834177],"genre_scores_gemma":[0.93776333,0.00001822837,0.061713006,0.000026411451,0.000034869936,0.000008799926,6.6247264e-7,0.000015561425,0.0004191322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982808,0.00033959473,0.000325562,0.0003667071,0.0003430786,0.00034422064],"domain_scores_gemma":[0.99861515,0.0003830669,0.00014014432,0.00037039508,0.0003612342,0.00013000505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002136775,0.00014610731,0.00025761986,0.00013961553,0.00016235921,0.00014616936,0.0005495311,0.000051668892,0.0000031048316],"category_scores_gemma":[0.0000671075,0.00008885897,0.000020790234,0.0004070331,0.00018946269,0.00029746402,0.00023301525,0.00010115256,0.000013238806],"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.00008961882,0.0002815122,0.0070833135,0.0019093767,0.00019764985,0.000016697026,0.015524822,0.26222512,0.018618595,0.60626805,0.000042849697,0.08774241],"study_design_scores_gemma":[0.0016158777,0.0002096613,0.000703388,0.0015061547,0.0000057272946,0.00006536574,0.00027526543,0.9935846,0.0011428092,0.00044670008,0.00017371349,0.000270793],"about_ca_topic_score_codex":0.00001643831,"about_ca_topic_score_gemma":0.0000017304136,"teacher_disagreement_score":0.87372726,"about_ca_system_score_codex":0.00002436573,"about_ca_system_score_gemma":0.00010046705,"threshold_uncertainty_score":0.36235636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93671036,0.00048484094,0.0016142526,0.000016205571,0.00026576436,0.00023224764,0.000026697124,0.000041317988,0.060608346],"genre_scores_gemma":[0.9922008,0.0000047535796,0.0003507834,0.000023202147,0.000090793415,0.0000047027825,0.000010536299,0.000024290885,0.007290167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986781,0.00030348488,0.00040673508,0.00016758409,0.0002263938,0.00021768843],"domain_scores_gemma":[0.9988972,0.00022376471,0.0003300579,0.00024039291,0.00026881942,0.000039792238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137413,0.00016206743,0.0004178602,0.00004754749,0.0002795732,0.00011193653,0.00013640766,0.000045609533,0.000405234],"category_scores_gemma":[0.000063419924,0.0001244511,0.000060113234,0.000065963795,0.00028685093,0.0000794423,0.000022487104,0.00006569157,0.000008062668],"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.000040887444,0.00010989831,0.0007431795,0.00025746727,0.00017627241,0.0000017891307,0.0069797058,0.00014683089,0.00055569294,0.98953277,0.0014310655,0.00002443621],"study_design_scores_gemma":[0.015805304,0.0015066947,0.000756116,0.0040176185,0.00092699204,0.00019080454,0.051055323,0.00872847,0.02164502,0.32819876,0.56398773,0.0031811409],"about_ca_topic_score_codex":0.00085804454,"about_ca_topic_score_gemma":0.00033190256,"teacher_disagreement_score":0.66133404,"about_ca_system_score_codex":0.000024879368,"about_ca_system_score_gemma":0.000054244705,"threshold_uncertainty_score":0.50749683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61433935,0.00008148865,0.3828123,0.000044387285,0.00022674949,0.00014432434,0.000010461603,0.000084378284,0.0022565934],"genre_scores_gemma":[0.9912676,0.000002261606,0.008514098,0.00004410121,0.00007837681,0.0000010201809,0.0000017956474,0.000008784885,0.00008195393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838126,0.0004171863,0.00049331604,0.0002619642,0.00022883482,0.00021744466],"domain_scores_gemma":[0.99862164,0.0003431049,0.00023311764,0.00053561304,0.00020028434,0.000066247354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024308346,0.0001370479,0.00036049375,0.00010404838,0.00016729264,0.00008324466,0.0006105923,0.000037831178,0.0000039787965],"category_scores_gemma":[0.000050188126,0.00012220663,0.000047682148,0.00020536956,0.0007983733,0.00021527066,0.0005075763,0.00007286664,0.000005751835],"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.000011448213,0.00006215237,0.00042181587,0.00014749968,0.000033765304,0.0000011864212,0.004041658,0.000206136,0.0031521816,0.985917,0.000036476144,0.0059687207],"study_design_scores_gemma":[0.0009376778,0.0007267541,0.029544163,0.0007968309,0.000027884435,0.00012039171,0.0010596404,0.74303496,0.024702717,0.19834277,0.00018483277,0.00052136945],"about_ca_topic_score_codex":0.00013770809,"about_ca_topic_score_gemma":0.000013805684,"teacher_disagreement_score":0.7875742,"about_ca_system_score_codex":0.000017499626,"about_ca_system_score_gemma":0.000051185893,"threshold_uncertainty_score":0.49834418},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01750727,0.00018406111,0.94655716,0.000042570355,0.001086721,0.00035381987,3.896997e-7,0.00020641314,0.034061585],"genre_scores_gemma":[0.9921363,9.884283e-7,0.0065670596,0.00001894298,0.00020207965,0.000005866093,0.0000018868587,0.0000112682055,0.001055609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983073,0.0003159998,0.0003880248,0.00036118884,0.00033342052,0.00029407858],"domain_scores_gemma":[0.997441,0.0001955953,0.00079398765,0.0013012564,0.00020396418,0.000064191445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025118943,0.00016079137,0.0003954262,0.000068991525,0.000529738,0.00054372515,0.0013089067,0.00008240077,0.0000029083692],"category_scores_gemma":[0.00007861299,0.00012288817,0.00004666447,0.000111631976,0.00013718168,0.0003208129,0.00020347071,0.00010347779,0.00004440405],"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.00001712757,0.000052479725,0.00052173773,0.00013512715,0.000050422856,0.0000046327464,0.0007811932,0.0011921016,0.0006950492,0.9946073,0.00004975883,0.0018930619],"study_design_scores_gemma":[0.0040540616,0.0021206355,0.012055728,0.000852137,0.00014503555,0.0003221134,0.0009415975,0.40661144,0.0057561924,0.5578561,0.0073571685,0.0019278168],"about_ca_topic_score_codex":0.00020125441,"about_ca_topic_score_gemma":0.0000041356734,"teacher_disagreement_score":0.97462904,"about_ca_system_score_codex":0.000026270292,"about_ca_system_score_gemma":0.00007114095,"threshold_uncertainty_score":0.5243154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094664946,0.0001149942,0.89654624,0.0002736734,0.0020117133,0.0005568938,0.000015600881,0.00048986956,0.0053260927],"genre_scores_gemma":[0.97634476,4.8776366e-7,0.021965323,0.0004855585,0.0007268988,0.0000133282265,0.0000069857847,0.000024752117,0.00043191717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978164,0.00036358906,0.0005945046,0.0004679032,0.00029790628,0.0004597104],"domain_scores_gemma":[0.99724865,0.00075909065,0.00043756023,0.0012196571,0.00024475064,0.000090307294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030935127,0.00022257262,0.0004613351,0.00012554851,0.00031500758,0.0002321259,0.0015672187,0.00008799206,0.000009639244],"category_scores_gemma":[0.00007983511,0.00019633344,0.000140195,0.0002354807,0.00052980747,0.00024639716,0.00039424852,0.00009494785,0.000055914606],"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.0000332155,0.000057393052,0.000102226404,0.0001700755,0.000052020332,0.0000019245244,0.00162645,0.0000252303,0.0007267817,0.9716445,0.0050821775,0.020477973],"study_design_scores_gemma":[0.0016940826,0.00054782804,0.0023734048,0.0006895795,0.00003293639,0.00013554237,0.0002875392,0.72053033,0.003300467,0.23700821,0.032707483,0.00069256907],"about_ca_topic_score_codex":0.000023734217,"about_ca_topic_score_gemma":0.000001556481,"teacher_disagreement_score":0.8816798,"about_ca_system_score_codex":0.00004874157,"about_ca_system_score_gemma":0.000049465485,"threshold_uncertainty_score":0.8006245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08752072,0.00017585834,0.89685214,0.000061180566,0.0008470871,0.00045122515,0.000003967401,0.00020667602,0.013881164],"genre_scores_gemma":[0.96177435,0.0000025790982,0.037761815,0.000025887217,0.0000368178,8.879128e-7,0.0000018314867,0.0000075203147,0.00038829158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998111,0.000510878,0.0005070234,0.00025331503,0.00039404447,0.00022370194],"domain_scores_gemma":[0.99829376,0.000339065,0.00037647117,0.0006281641,0.0002967201,0.00006579585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302911,0.00011274373,0.00037661186,0.00011257411,0.000054534365,0.000040753413,0.00090850267,0.00005220427,0.000017803293],"category_scores_gemma":[0.000040854513,0.000103393446,0.00007372545,0.00040224934,0.0001421931,0.00016700197,0.00029227155,0.00011681878,0.0000421572],"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.000009554566,0.00007817486,0.0009975769,0.00036655247,0.000030949424,6.899934e-7,0.0021807167,0.018649934,0.0007092363,0.97283214,0.00006452369,0.004079934],"study_design_scores_gemma":[0.00050382473,0.0001413052,0.0022350955,0.00022461226,0.0000036497352,0.000010605895,0.00020024322,0.9859535,0.0006670543,0.009595702,0.0003124017,0.0001519665],"about_ca_topic_score_codex":0.00006497009,"about_ca_topic_score_gemma":4.3472568e-7,"teacher_disagreement_score":0.96730363,"about_ca_system_score_codex":0.000023220418,"about_ca_system_score_gemma":0.000074151125,"threshold_uncertainty_score":0.42162624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28557038,0.00013366941,0.7110661,0.000021395737,0.0011549476,0.00017978752,0.0000036188521,0.00014678715,0.0017232558],"genre_scores_gemma":[0.96945953,0.0000013052799,0.03032488,0.00008678136,0.00007380553,8.894759e-7,0.0000038712437,0.000016781383,0.000032122956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973229,0.0005284496,0.00087848573,0.0004186125,0.00042676975,0.00042473627],"domain_scores_gemma":[0.9968767,0.0010636833,0.00081540755,0.00081637886,0.00031284758,0.00011494678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024428486,0.00023077708,0.0005860394,0.00021804812,0.0001704157,0.00006450707,0.0011343892,0.00010693814,0.000003412697],"category_scores_gemma":[0.000021714939,0.00021341599,0.00015669774,0.0005524748,0.00057859876,0.000100247285,0.00019649946,0.00015592473,0.000010796268],"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.00014305151,0.00027058495,0.0021651012,0.0008583566,0.00028156093,0.000050900282,0.0058562965,0.034035273,0.0028453118,0.67153794,0.00041504254,0.28154057],"study_design_scores_gemma":[0.00036674386,0.00026599775,0.00017875696,0.0006528762,0.000017902063,0.00003091771,0.00014286932,0.9899342,0.00039608494,0.0077733975,0.00002318918,0.00021705052],"about_ca_topic_score_codex":0.00005323656,"about_ca_topic_score_gemma":9.283971e-7,"teacher_disagreement_score":0.95589894,"about_ca_system_score_codex":0.00003809702,"about_ca_system_score_gemma":0.0001555602,"threshold_uncertainty_score":0.87028515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031175,0.0006991898,0.49468938,0.00016357707,0.0002727359,0.0003691221,0.0000037083914,0.000029065377,0.0006557244],"genre_scores_gemma":[0.9985177,0.00000280264,0.00036918995,0.00016451548,0.00082770985,0.000005441363,0.0000056017902,0.000011138587,0.00009591012],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991788,0.00014463296,0.00021866437,0.000210238,0.00007738833,0.00017023347],"domain_scores_gemma":[0.9994218,0.00017337671,0.0001551388,0.00012711494,0.00008264035,0.00003998132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073911017,0.000104686405,0.00014804157,0.000008727284,0.00014782423,0.000028193523,0.00021183303,0.00008243503,0.0000021025282],"category_scores_gemma":[0.000085771615,0.000066776534,0.00010742288,0.000066181274,0.000080108926,0.00000126623,0.00009325001,0.000066116845,0.0000022809404],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042119698,0.000031167532,0.00016300689,0.0001632363,0.00011575531,5.65424e-7,0.00024658046,0.007954703,0.9699539,0.005728566,0.00042367107,0.014797657],"study_design_scores_gemma":[0.0025844974,0.007810933,0.001125626,0.00029924183,0.00018829336,0.00006430629,0.002093172,0.19904798,0.6545789,0.0031705329,0.12794149,0.0010950239],"about_ca_topic_score_codex":0.0000041521566,"about_ca_topic_score_gemma":4.6641344e-7,"teacher_disagreement_score":0.4954002,"about_ca_system_score_codex":0.0000050646204,"about_ca_system_score_gemma":0.000017701665,"threshold_uncertainty_score":0.27230683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8327727,0.00018044439,0.16040824,0.0008347293,0.0016529022,0.0004437786,0.00006759651,0.000078643374,0.0035609838],"genre_scores_gemma":[0.9922306,0.000001939696,0.0002799044,0.00018923044,0.00012073139,0.000016588427,0.0000021114142,0.000013895223,0.0071449885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957852,0.0017300036,0.00097388955,0.00043574534,0.00079612323,0.00027904956],"domain_scores_gemma":[0.99456924,0.003732202,0.0007387452,0.000691978,0.0002042176,0.000063629355],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.010130143,0.00013775745,0.00028845106,0.00023218417,0.0016552594,0.00012983628,0.0011177522,0.000048845362,0.00028843308],"category_scores_gemma":[0.0003893363,0.00010939361,0.00014146151,0.0010722887,0.00029588127,0.00013856824,0.0004196051,0.00032202498,0.000104577935],"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.00036894646,0.00031310105,0.0056954,0.00001844968,0.00013006649,0.000010462619,0.031237965,0.10810499,0.0032584346,0.83655566,0.004139259,0.0101672765],"study_design_scores_gemma":[0.0032867093,0.00030522078,0.017587645,0.00014651052,0.00009667537,0.0003657073,0.28080052,0.40734783,0.003576342,0.08570386,0.19969647,0.0010865225],"about_ca_topic_score_codex":0.00011029215,"about_ca_topic_score_gemma":0.0000058587116,"teacher_disagreement_score":0.7508518,"about_ca_system_score_codex":0.00010714228,"about_ca_system_score_gemma":0.00012986464,"threshold_uncertainty_score":0.99964446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.511784,0.00044005679,0.4837984,0.00011452349,0.00062893995,0.0001798031,0.0000015050302,0.000092337796,0.0029603934],"genre_scores_gemma":[0.9904761,0.0000029497853,0.009171428,0.000083053805,0.00012420845,0.0000029114885,0.0000046677883,0.0000069356483,0.00012776261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982619,0.0003322379,0.0004958508,0.0002921079,0.0003831514,0.00023469776],"domain_scores_gemma":[0.9989817,0.00032248723,0.00021663678,0.00033247494,0.00008757081,0.00005910834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018864361,0.0001332377,0.00024111189,0.00035763075,0.00008864523,0.000088094326,0.0005753634,0.000063367595,0.0000036114734],"category_scores_gemma":[0.00003413243,0.00013247899,0.0000591767,0.0005118358,0.00003650222,0.00023959253,0.00009729581,0.00012891597,0.000028658533],"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.0000111956015,0.00008117837,0.00049771345,0.00004359684,0.000019986102,0.000006514384,0.0021923964,0.086850315,0.0004122128,0.8611852,0.00016547382,0.04853424],"study_design_scores_gemma":[0.0014799086,0.00018453882,0.032043807,0.00036586373,0.000010559468,0.00018286261,0.000337694,0.8479359,0.001652721,0.11314612,0.002109176,0.0005508327],"about_ca_topic_score_codex":0.000029328683,"about_ca_topic_score_gemma":0.000015075666,"teacher_disagreement_score":0.7610856,"about_ca_system_score_codex":0.00006608241,"about_ca_system_score_gemma":0.00007522335,"threshold_uncertainty_score":0.5402336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15400793,0.00040450357,0.7772339,0.000033843866,0.0028779996,0.00069075765,0.00007970058,0.0011758967,0.063495465],"genre_scores_gemma":[0.99343246,0.0000043106643,0.0029292912,0.00022349003,0.00026604297,0.00001283091,0.000025023237,0.000055173565,0.0030513674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944898,0.0025965772,0.00084024225,0.000777803,0.0006203129,0.0006752809],"domain_scores_gemma":[0.99173725,0.0053350157,0.00070826476,0.001872711,0.00019629038,0.00015049826],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0074471664,0.00043182747,0.0007900985,0.00018610666,0.00018837294,0.00017827115,0.0024111292,0.00018244787,0.0008818951],"category_scores_gemma":[0.00018808391,0.0003720616,0.00025736107,0.00050787564,0.00025862345,0.00050424587,0.0007924289,0.00031814413,0.0018586706],"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.000058645935,0.000094710405,0.00013323317,0.00013333834,0.00014161684,0.000012502019,0.0026006363,0.00030279302,0.000700853,0.95355386,0.0010130975,0.0412547],"study_design_scores_gemma":[0.001550229,0.0002811722,0.002567322,0.0014637907,0.000059482634,0.00045798204,0.0024169248,0.1599273,0.0028108258,0.8218666,0.005356016,0.0012423809],"about_ca_topic_score_codex":0.000012792676,"about_ca_topic_score_gemma":1.6826985e-7,"teacher_disagreement_score":0.83942455,"about_ca_system_score_codex":0.0000782291,"about_ca_system_score_gemma":0.00010405067,"threshold_uncertainty_score":0.99987316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54479015,0.00042725296,0.44512546,0.00012057209,0.0011466838,0.00021787881,0.000005168239,0.00016334366,0.008003504],"genre_scores_gemma":[0.99464273,0.0000023318285,0.005116596,0.00001966371,0.000100118974,0.0000012255422,7.2670895e-7,0.000011758257,0.000104837396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806845,0.00045428285,0.00058119436,0.00029562006,0.00033880095,0.00026164544],"domain_scores_gemma":[0.996011,0.00053648214,0.0012150048,0.0020284078,0.0001421518,0.00006696382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033663367,0.00015809097,0.0005463616,0.00009272934,0.0003242373,0.00015340827,0.0024815185,0.000063594634,0.0000069133857],"category_scores_gemma":[0.00023339318,0.00014102971,0.00012519778,0.000081822924,0.0005117164,0.00029328253,0.00059490086,0.0001002187,0.000013627575],"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.000009809277,0.000039359325,0.00035120492,0.00021890932,0.000045870973,0.0000050757626,0.00072434347,0.00018320071,0.003189581,0.98939925,0.00006792196,0.0057654395],"study_design_scores_gemma":[0.0009785191,0.00023722068,0.038308818,0.0019191018,0.000045168046,0.00014674124,0.00057103107,0.2098321,0.023361621,0.7237596,0.00026652357,0.00057355384],"about_ca_topic_score_codex":0.00012539282,"about_ca_topic_score_gemma":6.8201666e-7,"teacher_disagreement_score":0.4498526,"about_ca_system_score_codex":0.00002249826,"about_ca_system_score_gemma":0.00003723528,"threshold_uncertainty_score":0.57510245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50269127,0.00018487703,0.49550906,0.00032380395,0.0005147476,0.00031331778,0.0002875236,0.000040770694,0.00013467066],"genre_scores_gemma":[0.9867042,0.0000030134515,0.012371714,0.00009194985,0.00010255397,0.000011772485,0.0000067159644,0.000010236927,0.00069785723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764484,0.00030425636,0.00061081536,0.00073888677,0.00048567203,0.0002155328],"domain_scores_gemma":[0.9898008,0.008642592,0.00026634024,0.00097305136,0.00018764695,0.00012955363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076412903,0.00013868594,0.000355032,0.00020855301,0.00017114768,0.00024924468,0.0004729057,0.000030327486,0.000018873026],"category_scores_gemma":[0.0031106093,0.000086382286,0.000047029745,0.0002128246,0.00020285888,0.00014852583,0.0004541624,0.00002422495,0.000026600344],"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.0010392392,0.00033404288,0.043926623,0.0007048999,0.0002759285,0.000011333937,0.012835729,0.044135164,0.0061146184,0.19704854,0.28173837,0.4118355],"study_design_scores_gemma":[0.0023677722,0.00037067404,0.0039823866,0.0027580382,0.00010018365,0.000005003749,0.005665752,0.8611471,0.0032409534,0.085986346,0.033545785,0.0008299714],"about_ca_topic_score_codex":0.000115936906,"about_ca_topic_score_gemma":0.000011458374,"teacher_disagreement_score":0.81701195,"about_ca_system_score_codex":0.000015932743,"about_ca_system_score_gemma":0.00003056515,"threshold_uncertainty_score":0.37239143},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9390509,0.0023714025,0.053456444,0.0008992628,0.000397433,0.0008232213,0.0000045375955,0.000082765175,0.0029139975],"genre_scores_gemma":[0.99697274,0.00001472077,0.0027182135,0.000022345943,0.000081586666,0.00001070598,8.0710487e-7,0.00000859637,0.00017029297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850875,0.000224443,0.00051849824,0.00030841498,0.00018316419,0.00025672474],"domain_scores_gemma":[0.9984236,0.0003140429,0.00026973838,0.00084245746,0.00011763419,0.000032576903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024479623,0.00011487171,0.0002587099,0.00010842675,0.000116682604,0.000073398485,0.00089297513,0.000045300265,0.0000010953621],"category_scores_gemma":[0.00005117872,0.000089700006,0.000023640629,0.00056953076,0.00027642158,0.00014309064,0.0003429478,0.000096237294,0.0000059962285],"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.0000119797405,0.000112169095,0.0012977129,0.0002797062,0.000016771666,0.0000018836884,0.010956996,0.00007631712,0.004008757,0.97429127,0.00055776595,0.008388699],"study_design_scores_gemma":[0.0043126014,0.00092747225,0.026554111,0.0034679207,0.00003521689,0.00015390306,0.0034455012,0.458841,0.031628978,0.46191034,0.007644889,0.0010780528],"about_ca_topic_score_codex":0.00023721738,"about_ca_topic_score_gemma":0.00002214286,"teacher_disagreement_score":0.5123809,"about_ca_system_score_codex":0.000022300677,"about_ca_system_score_gemma":0.0000527796,"threshold_uncertainty_score":0.36578602},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011123046,0.00012276591,0.08531318,0.000040960796,0.9106176,0.0006646471,0.00006487701,0.00018194725,0.002982895],"genre_scores_gemma":[0.00010654407,0.000046100984,0.0037099821,0.000013014379,0.99409235,0.000004520191,0.00020642177,0.000043729902,0.0017773543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995805,0.00080461544,0.0008072875,0.00069923006,0.0015197727,0.0003640615],"domain_scores_gemma":[0.99523836,0.0023658636,0.0008046313,0.000800782,0.00067345216,0.00011689476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031617049,0.00037568933,0.0008004068,0.00031915132,0.00013967535,0.00035814484,0.0011576528,0.0006612803,0.0000063145326],"category_scores_gemma":[0.00065035064,0.00034716097,0.00009199269,0.00031130298,0.00010908805,0.00021575337,0.00039862256,0.0007509449,0.00007763854],"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.00002075958,0.00009185576,6.472139e-7,0.0005103478,0.000043353157,0.0000015589445,0.0009764603,0.0036476748,0.00000440906,0.0120210275,0.9774573,0.0052246046],"study_design_scores_gemma":[0.00064862915,0.00032802182,0.0000014740256,0.00082634145,0.000013155425,0.0000020937596,0.00007096861,0.09810739,0.000011153646,0.00055317103,0.89910746,0.00033013307],"about_ca_topic_score_codex":0.000030339357,"about_ca_topic_score_gemma":7.5640645e-7,"teacher_disagreement_score":0.09445972,"about_ca_system_score_codex":0.00010514338,"about_ca_system_score_gemma":0.00026212333,"threshold_uncertainty_score":0.999898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3015073,0.000121183526,0.6968998,0.00010177022,0.00021672282,0.00020721246,0.0000077285695,0.00007307716,0.00086523086],"genre_scores_gemma":[0.99707586,0.00001200687,0.002527858,0.000017005883,0.00014286042,0.0000018594843,0.000011477078,0.0000056466615,0.00020541488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989235,0.00018634387,0.00040465867,0.00018817892,0.00016310276,0.00013423726],"domain_scores_gemma":[0.9983128,0.00043295405,0.0002863103,0.00088675815,0.000058359274,0.000022842476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011665142,0.000070452465,0.000151222,0.000018092152,0.00019331534,0.00006723921,0.0012842295,0.000022335256,0.0000032935382],"category_scores_gemma":[0.000009734957,0.000049789123,0.00002651233,0.00023845879,0.000060363524,0.00018856315,0.00017625622,0.000055681372,0.000006078756],"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.0000053078834,0.000027250502,0.00005160021,0.0000333086,0.000023851951,3.660817e-7,0.0005271735,0.0068717278,0.007976948,0.27081674,0.00004857187,0.71361715],"study_design_scores_gemma":[0.0000788728,0.000018290693,0.0013374315,0.000080082915,0.000004809578,0.000007318075,0.000024485644,0.9938008,0.0005089363,0.0015206015,0.0025484625,0.000069892616],"about_ca_topic_score_codex":0.000011132132,"about_ca_topic_score_gemma":1.6819162e-7,"teacher_disagreement_score":0.98692906,"about_ca_system_score_codex":0.0000049984833,"about_ca_system_score_gemma":0.000015105128,"threshold_uncertainty_score":0.23864391},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104923174,0.00079866935,0.89256775,0.00006760694,0.00038517144,0.0003006355,0.0000071035156,0.000035275825,0.0009145884],"genre_scores_gemma":[0.9643104,0.0000032585508,0.035503935,0.000024606876,0.000122773,0.0000049390796,8.391546e-7,0.0000073450183,0.000021877973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967476,0.0014470357,0.0009206976,0.00021629478,0.00043455273,0.00023379865],"domain_scores_gemma":[0.9944921,0.004051833,0.0007046778,0.00059334177,0.00012429722,0.000033733493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004977131,0.00013984849,0.00053754187,0.00015206478,0.00007830915,0.00004876256,0.0010583455,0.000051252788,0.0000022263298],"category_scores_gemma":[0.00028444067,0.00010022784,0.000104482875,0.0005661423,0.00031371292,0.00015434981,0.00018079698,0.00015023517,0.0000019391384],"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.000007636389,0.00012747891,0.0007591903,0.00029491136,0.000031961106,0.0000010680461,0.0070300517,0.045053158,0.0014130693,0.9377664,0.000019168087,0.0074959416],"study_design_scores_gemma":[0.00031567883,0.00008354619,0.003764281,0.000645127,0.000010258943,0.000007646873,0.0009872048,0.98060924,0.0005112453,0.012816338,0.00011352628,0.00013590422],"about_ca_topic_score_codex":0.00031427402,"about_ca_topic_score_gemma":0.0000035064656,"teacher_disagreement_score":0.9355561,"about_ca_system_score_codex":0.000028809765,"about_ca_system_score_gemma":0.000035547208,"threshold_uncertainty_score":0.40871724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6095451,0.0002854018,0.3881111,0.000097711105,0.00081452687,0.00019692216,0.0000019738975,0.000065629974,0.00088161277],"genre_scores_gemma":[0.9962035,0.0000010793331,0.0034657344,0.00010996979,0.0001586215,0.0000039060533,0.00000587347,0.000008177873,0.000043149063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788874,0.00071569625,0.00047148496,0.00031938296,0.0003643522,0.0002403153],"domain_scores_gemma":[0.99861825,0.0007848861,0.00025502607,0.00021715632,0.000063220185,0.00006149263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026821422,0.00012295769,0.0002747278,0.000299498,0.00029371338,0.000067607405,0.00048275283,0.00003125704,0.0000050788235],"category_scores_gemma":[0.00006311187,0.0001371767,0.00003825201,0.00066059927,0.000047223333,0.00010201469,0.0005594297,0.00018244964,0.000002128159],"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.00002456321,0.00008759827,0.0029503147,0.00007454102,0.000022191134,0.000017004211,0.006039701,0.4296976,0.0007327655,0.50088626,0.00016784422,0.059299614],"study_design_scores_gemma":[0.0005855445,0.00016670502,0.0152672995,0.000050597748,0.000004693923,0.00011744481,0.00074505206,0.9699735,0.00015388003,0.012173585,0.0005558051,0.00020590633],"about_ca_topic_score_codex":0.000060280356,"about_ca_topic_score_gemma":0.000007897405,"teacher_disagreement_score":0.5402759,"about_ca_system_score_codex":0.00007338878,"about_ca_system_score_gemma":0.00009428689,"threshold_uncertainty_score":0.55939037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33706984,0.0013057998,0.013115277,0.000387116,0.0030276817,0.00025800816,0.000002089005,0.00023887918,0.6445953],"genre_scores_gemma":[0.9870953,0.000007670208,0.000049700182,0.000011720108,0.0003746178,7.802925e-7,6.82844e-8,0.000006097837,0.012454045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889904,0.00049327774,0.00016254088,0.000095894124,0.00018865101,0.00016060856],"domain_scores_gemma":[0.99919754,0.000450173,0.00012482975,0.00013605198,0.00004117429,0.00005021824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019042488,0.000048860857,0.000130545,0.000036744517,0.00018933315,0.000008633367,0.00019961638,0.000048204703,0.00005521093],"category_scores_gemma":[0.0001238044,0.000031879772,0.0000429563,0.000071718605,0.0003007373,0.00004422548,0.000019642119,0.000026388276,0.00008289252],"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.000008774788,0.000011059275,0.0008718744,0.000021262229,0.000011418591,6.98038e-7,0.012819871,0.000005671139,0.00060608564,0.97264993,0.0017663795,0.011226998],"study_design_scores_gemma":[0.0016554475,0.00018441184,0.019789148,0.0025455789,0.00005980383,0.0000083472405,0.02475991,0.00009937169,0.0010141768,0.046422612,0.9025805,0.00088069384],"about_ca_topic_score_codex":0.00014365981,"about_ca_topic_score_gemma":0.0000067878373,"teacher_disagreement_score":0.9262273,"about_ca_system_score_codex":0.00006358762,"about_ca_system_score_gemma":0.00007091057,"threshold_uncertainty_score":0.14562166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07871975,0.00010611493,0.89907056,0.000029524756,0.0015478116,0.00013137503,4.3730654e-7,0.00012248349,0.020271946],"genre_scores_gemma":[0.86392057,9.365877e-7,0.13568273,0.0000086726395,0.000082414204,0.0000013979788,1.3029714e-7,0.0000051767825,0.00029797037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988776,0.00031557961,0.00026645375,0.00019136995,0.00019374154,0.0001552773],"domain_scores_gemma":[0.99764574,0.00015379438,0.00053878693,0.0015361661,0.00008890224,0.00003659171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030407228,0.00008052292,0.00017722296,0.00004436048,0.0003065874,0.0001944321,0.0020354388,0.000041325045,0.0000011113532],"category_scores_gemma":[0.0003060997,0.00007322685,0.000040334366,0.00004521908,0.0001137632,0.00032682312,0.00034245788,0.0000731782,0.000028821916],"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.000003270366,0.000010697285,0.0002231772,0.00005171334,0.000008972859,6.3459265e-7,0.0008406663,0.00056773506,0.0007528281,0.97589976,0.000038481703,0.021602072],"study_design_scores_gemma":[0.0005305522,0.00015567505,0.04298116,0.0005337386,0.000012344806,0.00006190422,0.00019805106,0.88166714,0.018907074,0.05208563,0.0024400866,0.00042665837],"about_ca_topic_score_codex":0.000018195422,"about_ca_topic_score_gemma":9.3067186e-8,"teacher_disagreement_score":0.9238141,"about_ca_system_score_codex":0.000019166957,"about_ca_system_score_gemma":0.000023931461,"threshold_uncertainty_score":0.37823856},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113554046,0.0004779067,0.8770537,0.00007344604,0.00039130574,0.0003174102,5.864129e-7,0.00008309704,0.008048524],"genre_scores_gemma":[0.9920801,0.0000022292938,0.007611573,0.00007377514,0.00011510114,0.000002898566,4.664228e-7,0.000009789998,0.00010406279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970555,0.0010333585,0.0005058944,0.0003007109,0.00058576814,0.00051876745],"domain_scores_gemma":[0.99595094,0.0028701033,0.00016960964,0.00085435004,0.00009783893,0.000057174333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016545834,0.00013336093,0.0002459705,0.00033075718,0.00012558427,0.00007114197,0.0022120979,0.00005271568,0.0000014852823],"category_scores_gemma":[0.00015203586,0.00009459269,0.000069478956,0.0010895835,0.00021120433,0.00017101472,0.00025812842,0.00029926907,0.000017052329],"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.000017678989,0.00004590408,0.00034622976,0.000034864093,0.000009150084,0.000033485525,0.005394362,0.0011714284,0.00033405988,0.95781535,0.000022735861,0.034774777],"study_design_scores_gemma":[0.0017206545,0.00052341074,0.02229135,0.0005994526,0.000008610391,0.00047189943,0.0074990625,0.14929405,0.0033893462,0.81064457,0.0027845707,0.00077304756],"about_ca_topic_score_codex":0.000019863217,"about_ca_topic_score_gemma":0.0000020992788,"teacher_disagreement_score":0.87852603,"about_ca_system_score_codex":0.000038480695,"about_ca_system_score_gemma":0.000036592082,"threshold_uncertainty_score":0.57344884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5225712,0.0002560031,0.46568042,0.00014056567,0.002105728,0.00027491603,0.0000064857736,0.002765027,0.0061996668],"genre_scores_gemma":[0.99706924,0.0000050915987,0.0019647384,0.00006397295,0.0001642435,0.0000034106508,0.000005670808,0.000022544835,0.0007010983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997682,0.0004957771,0.0005282492,0.0004051094,0.00044122702,0.00044767192],"domain_scores_gemma":[0.9975417,0.00088977424,0.00029809496,0.001091752,0.00008898422,0.000089654124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035726621,0.00019416364,0.00039858336,0.00025702195,0.00018448375,0.00019663242,0.0015862606,0.00007544324,0.0000067911064],"category_scores_gemma":[0.000084179825,0.0001757042,0.00010955454,0.0009006922,0.000100863945,0.00024310901,0.0005950097,0.000119048025,0.00038463308],"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.000006924799,0.00003221329,0.00007097511,0.00014776953,0.000045378434,0.00002060783,0.002076061,0.0016457177,0.0013828787,0.97836506,0.0016945422,0.01451187],"study_design_scores_gemma":[0.00062330154,0.00012190949,0.0026684597,0.00043648639,0.0000121179955,0.00006986065,0.00074127346,0.8841877,0.0014114468,0.107085355,0.0022291562,0.00041290873],"about_ca_topic_score_codex":0.000020253765,"about_ca_topic_score_gemma":2.2235183e-7,"teacher_disagreement_score":0.882542,"about_ca_system_score_codex":0.000037008296,"about_ca_system_score_gemma":0.000060207854,"threshold_uncertainty_score":0.716501},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06870624,0.00070689694,0.92716247,0.00028518075,0.00045039286,0.00037627033,0.000006342214,0.00065069983,0.0016555218],"genre_scores_gemma":[0.9905374,7.0438205e-7,0.008916605,0.00011405227,0.00003674339,0.000007593439,0.0000028492814,0.000011634608,0.00037239122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831474,0.00046044175,0.00036387244,0.00024356907,0.00040835387,0.00020901347],"domain_scores_gemma":[0.9963423,0.0022500388,0.0004326001,0.0007714198,0.00017443555,0.000029187844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001953381,0.00013039607,0.00023699668,0.00016462096,0.00015543534,0.00004858717,0.001096641,0.00006672386,0.000006322459],"category_scores_gemma":[0.00034424427,0.00008519902,0.00008378318,0.0006202743,0.00014016399,0.00007339903,0.00037367927,0.00013960485,0.000023543795],"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.000056872064,0.00008562813,0.00012528822,0.00025840147,0.00004397119,0.000018177807,0.008004865,0.029011557,0.010155181,0.94037706,0.0024755877,0.009387436],"study_design_scores_gemma":[0.0005748426,0.00034405504,0.00036560567,0.0021599561,0.000025045665,0.000013840425,0.00085559924,0.81046575,0.062645406,0.12177396,0.0003028801,0.00047307328],"about_ca_topic_score_codex":0.000010227284,"about_ca_topic_score_gemma":4.95206e-7,"teacher_disagreement_score":0.9218312,"about_ca_system_score_codex":0.00004259714,"about_ca_system_score_gemma":0.00005360862,"threshold_uncertainty_score":0.3474315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41177538,0.0025275466,0.5360577,0.00055400416,0.0057891477,0.0011490653,0.00013668965,0.0008610491,0.04114941],"genre_scores_gemma":[0.9988864,8.3361937e-7,0.0003265007,0.00004682728,0.00014471945,0.0000054011575,0.0000051105444,0.000015238751,0.000568955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975987,0.0005547824,0.0006890206,0.00037160632,0.0004973939,0.00028848843],"domain_scores_gemma":[0.9976366,0.0009626301,0.0003102054,0.00087975024,0.00015423176,0.000056564422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671823,0.00020053709,0.00050611637,0.00010054301,0.00013313028,0.0002553578,0.001200918,0.000068244466,0.000022881084],"category_scores_gemma":[0.00008030613,0.00013427978,0.0001834103,0.0005506741,0.00026488435,0.00013299592,0.0001931494,0.00017902648,0.00011787615],"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.000029067269,0.00006987592,0.000013382432,0.0003654493,0.00010988624,0.000014736367,0.002281476,0.0012021641,0.0022616854,0.9893091,0.0028988067,0.0014443808],"study_design_scores_gemma":[0.000493162,0.00033436355,0.0010064425,0.003746962,0.000026841595,0.000062636165,0.00028257264,0.96701294,0.0013881169,0.021937717,0.0032931683,0.00041509225],"about_ca_topic_score_codex":0.00004175097,"about_ca_topic_score_gemma":5.8926275e-7,"teacher_disagreement_score":0.96737134,"about_ca_system_score_codex":0.00004377113,"about_ca_system_score_gemma":0.00007894902,"threshold_uncertainty_score":0.547577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14157146,0.0029584737,0.84441125,0.0001345629,0.0012530773,0.0002769968,0.0000030027265,0.0005991852,0.008791973],"genre_scores_gemma":[0.9961701,0.000013807472,0.002701937,0.00032378559,0.00008263477,0.0000049971677,0.0000018840727,0.000014801159,0.0006860545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970101,0.0011924766,0.0006121821,0.000527775,0.0002604852,0.00039699],"domain_scores_gemma":[0.9962796,0.0022302158,0.00031564792,0.0010026834,0.000091934155,0.00007994681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00593823,0.00026612825,0.00053776184,0.00026118706,0.00023030971,0.0001749099,0.0013223574,0.00011709526,0.000006445773],"category_scores_gemma":[0.00015340663,0.00022559897,0.000098641605,0.00045621744,0.0002671062,0.00020992315,0.00078207307,0.00017222196,0.000021402238],"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.000022969303,0.000047669284,0.00018001061,0.00022539312,0.00006736364,0.000007846556,0.00080303376,0.00019440766,0.0015889078,0.96064794,0.00020279239,0.03601164],"study_design_scores_gemma":[0.00073519885,0.00011109275,0.0034003097,0.0008269621,0.000035848072,0.000100409925,0.00050507364,0.20079602,0.0014584789,0.7909569,0.00067591056,0.00039776482],"about_ca_topic_score_codex":0.000019762118,"about_ca_topic_score_gemma":3.6202633e-7,"teacher_disagreement_score":0.85459864,"about_ca_system_score_codex":0.00003883042,"about_ca_system_score_gemma":0.000057528006,"threshold_uncertainty_score":0.91996586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30269244,0.00055752276,0.6764093,0.000012829064,0.0009341417,0.0002590391,0.0000049317873,0.0005757891,0.018553965],"genre_scores_gemma":[0.99748707,0.0000033305594,0.00218247,0.000008269969,0.00005459998,0.0000023548885,0.0000037296106,0.000020709575,0.00023746732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931055,0.00006835598,0.00024775573,0.000117008334,0.00010139589,0.00015491033],"domain_scores_gemma":[0.9993967,0.00022962994,0.000070081645,0.00020920493,0.00007047761,0.000023936018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045701745,0.00012149723,0.00024255016,0.000099779325,0.00006574211,0.000034099496,0.0001366357,0.000058526428,0.000006493547],"category_scores_gemma":[0.000023400486,0.0001048325,0.000028195418,0.0002700176,0.000037106965,0.000035461693,0.000023684988,0.00010401471,0.0000054787106],"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.000017681883,0.000011734603,0.0017870793,0.00034187984,0.000096341384,9.028879e-7,0.00035075142,0.9370929,0.00036687354,0.05705074,0.00014882768,0.0027342965],"study_design_scores_gemma":[0.0010643088,0.00007807958,0.003785466,0.0023031288,0.00006068004,0.000009468366,0.000296629,0.9847026,0.003253145,0.00325169,0.00081224,0.0003825844],"about_ca_topic_score_codex":0.00003927452,"about_ca_topic_score_gemma":0.00000921307,"teacher_disagreement_score":0.6947946,"about_ca_system_score_codex":0.000034092605,"about_ca_system_score_gemma":0.00001563604,"threshold_uncertainty_score":0.42749453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09912467,0.0007646134,0.8919042,0.00015258715,0.0011831394,0.00034774686,0.0000011910491,0.00023457441,0.006287285],"genre_scores_gemma":[0.99253416,0.0000036913295,0.0070327655,0.00005386654,0.00006139182,0.0000035928606,0.0000010121537,0.0000062056674,0.00030329011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976651,0.0008659447,0.0005956015,0.00040095716,0.00024093606,0.00023146684],"domain_scores_gemma":[0.99719834,0.0016177939,0.00024164445,0.0006462953,0.0002438992,0.00005199672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003507374,0.00016566993,0.0004401751,0.00018756262,0.00018080593,0.00013632432,0.0007443272,0.00007512085,0.0000015761934],"category_scores_gemma":[0.00023294373,0.0001517733,0.000061494735,0.0006247871,0.00016930804,0.00019903597,0.00067944976,0.00012397704,0.000003783315],"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.000016044947,0.000058444697,0.0046229525,0.0002676307,0.000043894823,0.0000018829501,0.0015559153,0.005715434,0.000064868786,0.96907043,0.000075890675,0.01850659],"study_design_scores_gemma":[0.0018093833,0.000087098866,0.029863855,0.00047661955,0.000027492539,0.000044685818,0.00020738099,0.77232456,0.00040563833,0.19391939,0.00050071004,0.000333203],"about_ca_topic_score_codex":0.00003393279,"about_ca_topic_score_gemma":9.4859166e-7,"teacher_disagreement_score":0.8934095,"about_ca_system_score_codex":0.000040049163,"about_ca_system_score_gemma":0.000074601725,"threshold_uncertainty_score":0.6189136},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31005794,0.0015598144,0.67668456,0.0001604994,0.0019619332,0.00022795385,0.0000030370559,0.0001831443,0.009161109],"genre_scores_gemma":[0.9985254,0.000008906618,0.0010623707,0.00005548788,0.000049995186,0.0000022660527,7.24384e-7,0.0000046077635,0.0002902838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814814,0.0006491776,0.0005247826,0.00022296105,0.00024470495,0.0002102104],"domain_scores_gemma":[0.9968977,0.0019231905,0.00040265976,0.0006264178,0.00012575093,0.00002429503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030285588,0.00012127644,0.00028812463,0.00010698344,0.00027234497,0.00008575463,0.0010661039,0.000050195315,0.000001904682],"category_scores_gemma":[0.00012446762,0.00008507517,0.00008943545,0.00048230976,0.00040667102,0.00012001312,0.00025716645,0.00010449336,0.0000030647582],"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.000014195214,0.000021458747,0.00019005024,0.00010182585,0.000047564226,6.993185e-7,0.0006446639,0.0013726323,0.001996415,0.98257,0.00016536067,0.012875152],"study_design_scores_gemma":[0.00041166347,0.00011916384,0.006153491,0.0009011631,0.000020736863,0.000013886769,0.0007229432,0.41424948,0.009865217,0.56623137,0.001102533,0.00020833696],"about_ca_topic_score_codex":0.00007532656,"about_ca_topic_score_gemma":0.0000036146296,"teacher_disagreement_score":0.68846744,"about_ca_system_score_codex":0.00003224462,"about_ca_system_score_gemma":0.00006815171,"threshold_uncertainty_score":0.34692645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03331142,0.0003029025,0.96305186,0.00011183566,0.0013630328,0.0010069166,0.000004472731,0.00020638946,0.0006411597],"genre_scores_gemma":[0.94150984,0.0000024352207,0.057540137,0.00010599911,0.000053565702,0.00004711586,0.0000035713624,0.000015221077,0.0007221273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977268,0.0006421675,0.0005393994,0.00045056044,0.00021911958,0.0004219279],"domain_scores_gemma":[0.9963118,0.0023148407,0.00023575727,0.0007753785,0.0003015122,0.000060740877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034549304,0.0001802545,0.00042425978,0.0002879369,0.00018628333,0.000109377645,0.0011426227,0.00009135694,9.81627e-7],"category_scores_gemma":[0.0003336687,0.00016570221,0.00015228971,0.00051278487,0.00013899185,0.00018542752,0.0003351404,0.00013851281,0.0000043456535],"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.00022521964,0.00005768528,0.000021304908,0.00035157742,0.000098812765,6.51251e-7,0.00048858556,0.0020070525,0.011625675,0.9157254,0.00016455608,0.06923344],"study_design_scores_gemma":[0.0013987512,0.00017002677,0.00006218498,0.0002482056,0.000011809587,0.0000068566496,0.00010523099,0.8416154,0.004523163,0.15114585,0.0005390284,0.00017355368],"about_ca_topic_score_codex":0.0000085106285,"about_ca_topic_score_gemma":3.0232997e-7,"teacher_disagreement_score":0.9081984,"about_ca_system_score_codex":0.000063799605,"about_ca_system_score_gemma":0.000081611346,"threshold_uncertainty_score":0.67571396},"labels":[],"label_agreement":null}]}