{"meta":{"query_hash":"08c656f4e6ac","filters":{"venue":"Electronic Notes in Theoretical Computer Science"},"cohort_total":63,"direct_labels_cover":0,"predictions_cover":63,"exported":63,"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/08c656f4e6ac","api":"https://metacan.xera.ac/api/v1/cohort?venue=Electronic+Notes+in+Theoretical+Computer+Science"},"results":[{"id":"W128508507","doi":"10.1016/s1571-0661(05)81054-0","title":"Preface","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Library science; State (computer science); Art history; Classics; Computer science; History; World Wide Web; Programming language","score_opus":0.00990933206034021,"score_gpt":0.25187493522481624,"score_spread":0.24196560316447605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128508507","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.014250883,0.00024290041,0.97894,0.00089396833,0.0005357931,0.00022175912,5.3215555e-8,0.00023378029,0.0046808557],"genre_scores_gemma":[0.9832092,0.000024199138,0.01623085,0.0003481196,0.00014008481,0.000014851815,3.1729786e-7,0.000008065931,0.000024302464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967048,0.00012990175,0.00030946863,0.0008738568,0.0006368858,0.0013450806],"domain_scores_gemma":[0.99848014,0.00028009934,0.00006665935,0.00088883773,0.00009787462,0.00018640189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054465,0.00020237977,0.00022416926,0.00022526726,0.00024994102,0.00044161297,0.00295891,0.000072895324,0.000034144643],"category_scores_gemma":[0.00015063219,0.00016319695,0.000063838146,0.0020117874,0.0011956148,0.0006555118,0.0007486355,0.00036742285,0.0001441319],"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.0000042158927,0.00005987147,0.0007940508,0.0000028779198,0.0000021093956,0.000022926331,0.00023763767,0.00012272681,0.00013352674,0.91362804,0.000005625134,0.08498637],"study_design_scores_gemma":[0.00027051062,0.00034000978,0.00075346004,0.000005409663,0.0000015866351,0.00014328724,0.000002324512,0.23632061,0.0020578976,0.75754195,0.0022950557,0.00026786354],"about_ca_topic_score_codex":0.000017562734,"about_ca_topic_score_gemma":0.0000141687515,"teacher_disagreement_score":0.9689583,"about_ca_system_score_codex":0.00023005907,"about_ca_system_score_gemma":0.00030371762,"threshold_uncertainty_score":0.66549784},"labels":[],"label_agreement":null},{"id":"W134208412","doi":"10.1016/s1571-0661(05)80556-0","title":"Preface","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Humanities; Association (psychology); Geography; Computer science; Epistemology; Philosophy","score_opus":0.005233163918159997,"score_gpt":0.1923543362941889,"score_spread":0.1871211723760289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134208412","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.53627753,0.0009741766,0.4490795,0.00014890388,0.0006337953,0.00018812268,6.916096e-7,0.00038325522,0.0123140495],"genre_scores_gemma":[0.99889755,0.000024868536,0.0009309737,0.00005375076,0.00006742987,0.000008050195,1.4991285e-7,0.0000111972895,0.0000060233956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985777,0.000044525543,0.00016976573,0.00026312936,0.00023046673,0.0007143829],"domain_scores_gemma":[0.99943,0.000151791,0.0000103516795,0.00030376564,0.00001759106,0.00008650777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006550319,0.00012430373,0.00012900207,0.00012966638,0.00008617171,0.00006723297,0.00058245694,0.000043516502,0.00021526079],"category_scores_gemma":[0.000036796235,0.00011093184,0.000034386725,0.0007762095,0.0008093827,0.00016941926,0.00006556027,0.00027323246,0.00013398788],"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.0000015641803,0.000018691428,0.00009366276,0.000007869749,0.0000025281506,0.0000035411542,0.00025157258,0.0057202163,0.0009898739,0.9744032,0.000014183493,0.018493082],"study_design_scores_gemma":[0.00014658665,0.00008767534,0.00016374078,0.000022901613,0.0000017081459,0.000025136116,0.0000024857973,0.8059199,0.009265834,0.18386127,0.00031692363,0.00018581505],"about_ca_topic_score_codex":5.972246e-7,"about_ca_topic_score_gemma":0.0000015924388,"teacher_disagreement_score":0.8001997,"about_ca_system_score_codex":0.00010814404,"about_ca_system_score_gemma":0.000011245243,"threshold_uncertainty_score":0.45236692},"labels":[],"label_agreement":null},{"id":"W1618713168","doi":"10.1016/s1571-0661(04)81007-7","title":"Three approaches to partiality in the sketch data model1 1Research partially supported by the Australian Research Council and NSERC Canada.","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Mount Allison University","funders":"","keywords":"Sketch; Equivalence (formal languages); Computer science; Information retrieval; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics","score_opus":0.25763518615005127,"score_gpt":0.336122033931163,"score_spread":0.07848684778111176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1618713168","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.048206847,0.00013839452,0.9047367,0.044942137,0.00014717183,0.0010152789,0.000018352119,0.000030968327,0.0007641288],"genre_scores_gemma":[0.99085337,0.00001328003,0.008344624,0.0006716969,0.000041490726,0.000049481805,0.000006606849,0.0000072882885,0.000012139383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916844,0.0010084749,0.00038676726,0.0013840552,0.0036032842,0.0019330527],"domain_scores_gemma":[0.99564445,0.001244611,0.000038470982,0.0026642322,0.00019791286,0.00021032582],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.043395046,0.00020682208,0.00020903724,0.00012677327,0.0005722626,0.0012074768,0.00936482,0.000048609338,0.00001686241],"category_scores_gemma":[0.0012757913,0.00012884714,0.000016650543,0.0032049497,0.0021263186,0.0008287182,0.0028192066,0.0009350677,0.0000068276313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012771039,0.000074712014,0.00046852417,0.000005849515,0.0000044085123,0.000018808925,0.00050913455,0.00024143068,0.000023445304,0.9711888,0.0030593069,0.024392812],"study_design_scores_gemma":[0.000308086,0.00021810744,0.0017118411,0.000015051299,0.000003273467,0.000017743816,0.000057236437,0.75422794,0.0007365545,0.23476744,0.0076727276,0.0002640136],"about_ca_topic_score_codex":0.018007586,"about_ca_topic_score_gemma":0.2297612,"teacher_disagreement_score":0.94264656,"about_ca_system_score_codex":0.00063765625,"about_ca_system_score_gemma":0.0040635066,"threshold_uncertainty_score":0.99982935},"labels":[],"label_agreement":null},{"id":"W1965382524","doi":"10.1016/j.entcs.2005.09.028","title":"Type Theory and Language Constructs for Objects with States","year":2006,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Object (grammar); Computer science; Subtyping; Type theory; Programming language; Type (biology); State (computer science); Class (philosophy); Relation (database); Object-oriented programming; Method; Theoretical computer science; Object model; Artificial intelligence; Data mining","score_opus":0.004056061187361299,"score_gpt":0.23038798772999414,"score_spread":0.22633192654263284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965382524","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.07996351,0.0005049993,0.91825795,0.0001258277,0.00017052582,0.00030305312,3.7437786e-7,0.00010422093,0.00056954095],"genre_scores_gemma":[0.96820194,0.0000055225846,0.03152833,0.00014981121,0.00007962776,0.000013674546,0.0000015878212,0.000008183951,0.0000113337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802864,0.00011162635,0.0001867623,0.0005970111,0.00028286362,0.00079308316],"domain_scores_gemma":[0.9985696,0.00079496886,0.000059735525,0.0003825481,0.00011060381,0.000082526036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017262358,0.00016518743,0.00019270374,0.00013552401,0.00018876743,0.0003268523,0.00080643804,0.000046309917,0.0000041573944],"category_scores_gemma":[0.00010676088,0.0001159755,0.000022536598,0.0007682781,0.0016055538,0.00029225642,0.00022985403,0.00015837749,0.0000046802234],"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.000028646338,0.000027633116,0.00036496908,0.000011952227,0.000003202476,0.000009016399,0.00047201052,0.00006864909,0.00031313967,0.97596633,0.0000025765785,0.022731889],"study_design_scores_gemma":[0.00047441674,0.0007346127,0.00037245313,0.0000091095435,0.000003895178,0.00008548458,0.000022693403,0.056942403,0.00645008,0.9345927,0.000091450725,0.00022066745],"about_ca_topic_score_codex":0.000024190093,"about_ca_topic_score_gemma":0.000038952927,"teacher_disagreement_score":0.88823843,"about_ca_system_score_codex":0.0000742903,"about_ca_system_score_gemma":0.00024724836,"threshold_uncertainty_score":0.591573},"labels":[],"label_agreement":null},{"id":"W1969866994","doi":"10.1016/j.entcs.2007.01.062","title":"Towards a Common Semantic Foundation for Use Cases and Task Models","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Notation; Documentation; Formalism (music); Task (project management); User interface; Software engineering; Interface (matter); Programming language; Systems engineering","score_opus":0.034932888214651146,"score_gpt":0.32091262079969884,"score_spread":0.2859797325850477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969866994","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.08096525,0.00011047689,0.91789424,0.0002505623,0.00026518412,0.00028514818,6.258978e-7,0.0002178474,0.000010682248],"genre_scores_gemma":[0.5378122,0.000010814382,0.46203655,0.000098463475,0.000026922276,0.000007833132,4.9613004e-7,0.0000062287245,5.259906e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975958,0.0000841384,0.0003020509,0.00069745985,0.0003411042,0.0009794495],"domain_scores_gemma":[0.99140775,0.0077722208,0.000060622504,0.0005257071,0.0001128502,0.00012084907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036711697,0.00019462101,0.00024483827,0.00028623678,0.00021150509,0.00030509869,0.0010391367,0.00006510384,7.787118e-7],"category_scores_gemma":[0.00219368,0.00017685366,0.000040444385,0.00088536576,0.0010501841,0.0013747085,0.0005577118,0.00025564924,0.0000012237479],"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.000016022857,0.00001958109,0.00006734658,0.000009695737,0.0000021348421,0.0000096427675,0.00021870204,0.010849774,0.00029446406,0.8118111,3.859949e-7,0.17670117],"study_design_scores_gemma":[0.00016317698,0.00022878035,0.000496539,0.000018068784,0.000002139916,0.0000623573,0.0000015344261,0.49095008,0.0031659184,0.50474286,0.000015668531,0.00015288586],"about_ca_topic_score_codex":0.000016602127,"about_ca_topic_score_gemma":0.000022927308,"teacher_disagreement_score":0.4801003,"about_ca_system_score_codex":0.00023395772,"about_ca_system_score_gemma":0.00015398968,"threshold_uncertainty_score":0.7211883},"labels":[],"label_agreement":null},{"id":"W1976967219","doi":"10.1016/j.entcs.2005.01.045","title":"A New Approach to Upward-Closed Set Backward Reachability Analysis","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Parameterized complexity; Petri net; Binary decision diagram; Fixed point; Model checking; Intersection (aeronautics); Computer science; Set (abstract data type); Computation; Algorithm; Theoretical computer science; Stochastic Petri net; Class (philosophy); State (computer science); Mathematics; Programming language","score_opus":0.01737028778483418,"score_gpt":0.30211673041644277,"score_spread":0.2847464426316086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976967219","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.016952023,0.000036415022,0.97820824,0.0016306969,0.00016999616,0.0003875498,9.864623e-7,0.00020458549,0.0024094984],"genre_scores_gemma":[0.49473503,0.000002020309,0.50477046,0.00038228667,0.000082178245,0.000013260227,9.965155e-7,0.0000055217097,0.000008282925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949846,0.00042600813,0.0005715623,0.0016259941,0.0010045934,0.0013872174],"domain_scores_gemma":[0.99675673,0.0004359183,0.00010167067,0.0020751918,0.00015542765,0.00047506392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00658948,0.0002912075,0.00043709972,0.00081444357,0.00022600575,0.00041008333,0.0045552123,0.00010561949,0.00005122542],"category_scores_gemma":[0.00072241534,0.00026430687,0.00016654351,0.008545229,0.00082765555,0.0009861763,0.0011101613,0.00053418666,0.00015381568],"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.0000138346195,0.00008537233,0.00018395855,0.000003301045,0.000014024092,5.328089e-7,0.00085863005,0.009446345,0.00017174338,0.7917981,0.000017376233,0.19740674],"study_design_scores_gemma":[0.00021870398,0.00017707517,0.0032643552,0.000006893232,0.000019796089,0.000011906091,0.000003363783,0.8913854,0.006050419,0.0980517,0.00047689668,0.0003335424],"about_ca_topic_score_codex":0.000035607263,"about_ca_topic_score_gemma":0.000015901935,"teacher_disagreement_score":0.881939,"about_ca_system_score_codex":0.00079263997,"about_ca_system_score_gemma":0.00059469906,"threshold_uncertainty_score":0.9999809},"labels":[],"label_agreement":null},{"id":"W1981347876","doi":"10.1016/j.entcs.2008.10.016","title":"A Technique for Verifying Measurements","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Entropy (arrow of time); Characterization (materials science); Theory of relativity; General relativity; Theoretical computer science; Information theory; Algorithm; Theoretical physics; Statistical physics; Calculus (dental); Mathematics; Physics; Quantum mechanics; Statistics; Optics","score_opus":0.02293368776716887,"score_gpt":0.28160545409131815,"score_spread":0.2586717663241493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981347876","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.047769595,0.000013548823,0.95123357,0.00014475177,0.00005182642,0.00038073707,0.0000018804373,0.00001932377,0.0003847644],"genre_scores_gemma":[0.97794443,0.0000011019079,0.021692665,0.000056285313,0.0000916301,0.00020321444,0.0000018453987,0.000007767871,0.0000010716726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879515,0.000018236768,0.0001521581,0.00032465503,0.00019751926,0.0005122951],"domain_scores_gemma":[0.99949867,0.00010701608,0.000033094573,0.00023294259,0.000067133464,0.00006111902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069077685,0.000094799594,0.00010857926,0.00007068941,0.0003041303,0.000029804078,0.00044265462,0.000019438674,0.00003969552],"category_scores_gemma":[0.000017381424,0.00008642781,0.00004641266,0.00041690868,0.00042346108,0.00008447411,0.00009131188,0.0001485631,0.000007545533],"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.000004012462,0.000057622474,0.00033515325,0.0000014352302,0.000002234987,1.4142195e-7,0.000042796306,0.000024201585,0.009042729,0.98609793,0.000003968623,0.004387777],"study_design_scores_gemma":[0.00019238828,0.000092417074,0.000088765846,0.000010935851,0.00000220633,0.0000028010022,0.000001454353,0.043524347,0.09744968,0.85841745,0.000101823534,0.000115704075],"about_ca_topic_score_codex":0.0000053557146,"about_ca_topic_score_gemma":4.4512032e-7,"teacher_disagreement_score":0.9301748,"about_ca_system_score_codex":0.000069292735,"about_ca_system_score_gemma":0.00019696266,"threshold_uncertainty_score":0.35244238},"labels":[],"label_agreement":null},{"id":"W1984844770","doi":"10.1016/j.entcs.2009.10.008","title":"Programming with Quantum Communication","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quantum; Programming language; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.00477036593406557,"score_gpt":0.23655014401209404,"score_spread":0.23177977807802846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984844770","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.036347948,0.00009981206,0.95921904,0.002723141,0.000052385698,0.00019779336,7.889832e-8,0.000212668,0.0011471091],"genre_scores_gemma":[0.86090076,0.000015027745,0.1381708,0.00088574184,0.000014915967,0.000008224671,8.091243e-7,0.0000032546154,4.3971505e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778545,0.00008769403,0.00029102212,0.00042129614,0.00057466,0.00083986693],"domain_scores_gemma":[0.998579,0.00017198522,0.000084807994,0.0009050996,0.00012758383,0.00013150177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014534103,0.00016432341,0.00015861595,0.00034661317,0.00031825886,0.00050330505,0.002449638,0.000043310287,0.000009836806],"category_scores_gemma":[0.00005053413,0.00012693749,0.00004236569,0.0025933569,0.0011355139,0.0012774513,0.0002202785,0.00037410943,0.00002302788],"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.0000073960337,0.000058422793,0.00008150424,0.00000145852,0.0000011637679,0.0000016620797,0.0003862428,0.00015001463,0.000038294915,0.8400058,0.0000022619254,0.15926576],"study_design_scores_gemma":[0.00031106194,0.0007139487,0.0017385005,0.00003673891,0.0000015147333,0.000035636036,0.000007026212,0.5241949,0.0014725904,0.47100696,0.00026091997,0.00022022273],"about_ca_topic_score_codex":0.0000027389838,"about_ca_topic_score_gemma":0.0000032810055,"teacher_disagreement_score":0.82455283,"about_ca_system_score_codex":0.000110394765,"about_ca_system_score_gemma":0.0002262204,"threshold_uncertainty_score":0.51763606},"labels":[],"label_agreement":null},{"id":"W1985984316","doi":"10.1016/s1571-0661(04)80466-3","title":"Contraction of the ITCPN state space","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Contraction (grammar); Computer science; Mathematics; Topology (electrical circuits); Theoretical computer science; Combinatorics; Linguistics","score_opus":0.009600772076562939,"score_gpt":0.23398248957374018,"score_spread":0.22438171749717725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985984316","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.08921863,0.00022045817,0.9070703,0.0016789159,0.000633454,0.00019643056,4.56747e-7,0.00006612015,0.0009152824],"genre_scores_gemma":[0.9808239,0.000024408344,0.01888636,0.000193375,0.00004756943,0.000005959656,4.047077e-8,0.0000069753655,0.000011444464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703157,0.00021394057,0.00041196417,0.00061747176,0.0008561676,0.00086891255],"domain_scores_gemma":[0.9979165,0.00060685084,0.00015882407,0.0010874273,0.00014113146,0.00008927167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200847,0.00016606253,0.00022665541,0.00020069833,0.00020717061,0.0001647816,0.0031823672,0.000049997114,0.0000216252],"category_scores_gemma":[0.00032026967,0.00011890538,0.00007712302,0.002340547,0.0013972817,0.0005951398,0.00077411515,0.00043186554,0.000021421443],"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.0000030793553,0.0000571728,0.0002436603,0.000005538596,0.0000028729276,0.0000024718645,0.0004372892,0.005716529,0.001798204,0.95341164,0.000008532162,0.038313024],"study_design_scores_gemma":[0.00021176127,0.00009518286,0.00043365994,0.000046656285,0.0000017130471,0.00003804582,0.0000014104464,0.851771,0.020313857,0.12687813,0.00007197451,0.00013664419],"about_ca_topic_score_codex":0.000010458508,"about_ca_topic_score_gemma":0.000008111212,"teacher_disagreement_score":0.89160526,"about_ca_system_score_codex":0.00029265202,"about_ca_system_score_gemma":0.00015588907,"threshold_uncertainty_score":0.5913683},"labels":[],"label_agreement":null},{"id":"W1986867802","doi":"10.1016/j.entcs.2007.08.002","title":"Can a Model Checker Generate Tests for Non-Deterministic Systems?","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Model checking; Computer science; Determinism; Modular design; Counterexample; Model-based testing; Programming language; Theoretical computer science; CTL*; Temporal logic; Software; Distributed computing; Test case; Mathematics; Machine learning","score_opus":0.017236272022157544,"score_gpt":0.2968998082688012,"score_spread":0.27966353624664364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986867802","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.025830347,0.00006159863,0.9714103,0.00026586806,0.00034450254,0.00044761496,0.0000017463825,0.0014988574,0.0001392014],"genre_scores_gemma":[0.6473121,0.0000018649496,0.3522244,0.00031355195,0.00009251084,0.000037350426,6.1771595e-7,0.000013217138,0.000004372953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632037,0.00004758809,0.00047240104,0.0009991769,0.0005358078,0.0016246744],"domain_scores_gemma":[0.99736255,0.0010976231,0.0001112824,0.00095807883,0.0002351469,0.0002352857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004436238,0.00027898443,0.00031052684,0.00038584427,0.00033204863,0.00043341963,0.0024108845,0.000102577906,7.9686515e-7],"category_scores_gemma":[0.00082293147,0.0002460624,0.00007293803,0.0012466433,0.0009749284,0.00028219688,0.00055609556,0.0003397229,0.000004923368],"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.000011687649,0.00006376939,0.00025983664,0.00001979794,0.0000029099344,0.00001547702,0.00023768622,0.0031381368,0.00051729265,0.9775777,0.00005070042,0.018105015],"study_design_scores_gemma":[0.00016420714,0.00024354277,0.00017717638,0.00004705555,0.0000025210873,0.000046280944,2.754787e-7,0.6367869,0.0026670727,0.35964197,0.0000061418086,0.00021691012],"about_ca_topic_score_codex":0.000013897058,"about_ca_topic_score_gemma":0.000009320121,"teacher_disagreement_score":0.6336487,"about_ca_system_score_codex":0.0003870961,"about_ca_system_score_gemma":0.0006731179,"threshold_uncertainty_score":0.99999917},"labels":[],"label_agreement":null},{"id":"W1991609533","doi":"10.1016/j.entcs.2005.03.007","title":"A New Method for Transforming Timed Automata","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Automaton; Computer science; Timed automaton; Transformation (genetics); Theoretical computer science; Conformance testing; Finite-state machine; State (computer science); Model checking; Algorithm; Programming language; Operating system","score_opus":0.011921949294967406,"score_gpt":0.3276170705568103,"score_spread":0.31569512126184285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991609533","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.0007388291,0.00008228481,0.99476516,0.0028512718,0.00030647035,0.0005040595,6.5810406e-7,0.0002569914,0.00049424515],"genre_scores_gemma":[0.27995688,0.000005620476,0.71942234,0.00041113968,0.00015498007,0.000029030705,5.3418967e-7,0.000009821234,0.000009649951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966742,0.00016046668,0.0004479502,0.00090160774,0.0005650517,0.0012507703],"domain_scores_gemma":[0.9978523,0.00084544875,0.00008324862,0.0008992243,0.00009898997,0.00022078078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281452,0.0002216283,0.0002617245,0.00032711867,0.00025068273,0.00028204665,0.003205893,0.00008849148,0.000022488859],"category_scores_gemma":[0.00043428713,0.0002013129,0.00009357091,0.0016125187,0.00047251183,0.0013663855,0.00033152974,0.00033942424,0.000028233013],"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.0000088622555,0.000021653866,0.000001775504,0.000003352318,0.000001577078,3.2596787e-7,0.00025991665,0.0005379805,0.00085327466,0.5503234,0.000006648476,0.4479812],"study_design_scores_gemma":[0.00041191932,0.00022958416,0.000038887087,0.000015892349,0.0000029555083,0.000028792583,9.247066e-7,0.7120531,0.05608381,0.22992158,0.0010205341,0.0001919983],"about_ca_topic_score_codex":0.0000073543615,"about_ca_topic_score_gemma":0.000007220454,"teacher_disagreement_score":0.7115151,"about_ca_system_score_codex":0.00040673168,"about_ca_system_score_gemma":0.0007032815,"threshold_uncertainty_score":0.8209302},"labels":[],"label_agreement":null},{"id":"W1993746088","doi":"10.1016/j.entcs.2011.01.021","title":"Phase Groups and the Origin of Non-locality for Qubits","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Engineering and Physical Sciences Research Council","keywords":"Qubit; Mathematics; Group (periodic table); Theoretical physics; Hidden variable theory; Observable; Element (criminal law); Locality; Quantum mechanics; Quantum; Physics; Law","score_opus":0.013482044675170857,"score_gpt":0.28597665531867,"score_spread":0.27249461064349917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993746088","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.2941068,0.0000141073915,0.7052544,0.0001433465,0.00003162472,0.00022319875,0.0000035675985,0.000003973957,0.00021898169],"genre_scores_gemma":[0.9954348,0.0000018465431,0.0044138837,0.000044260283,0.00005047856,0.000048995684,0.0000010562654,0.000004091364,5.9516356e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991268,0.00002857478,0.00017650095,0.00024059074,0.000107616215,0.00031992383],"domain_scores_gemma":[0.999324,0.00029115516,0.00005217304,0.00023546214,0.000050788698,0.000046367666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377388,0.00007889621,0.00014021815,0.00003254917,0.00012673964,0.00002326232,0.00039217167,0.000014531217,0.000028450486],"category_scores_gemma":[0.000014872821,0.000051663676,0.000041226802,0.0002721685,0.0014280769,0.000060250426,0.00010796261,0.000116122785,0.0000013794524],"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.00003870784,0.0001504738,0.000059282476,0.000002616467,0.0000036016224,3.1326184e-8,0.00024426082,0.0000016547566,0.00028509783,0.9782687,0.0000012835216,0.020944305],"study_design_scores_gemma":[0.0010142704,0.00015533387,0.000047151272,0.0000056141994,0.000005461558,3.6116407e-7,0.000006933714,0.23279351,0.009850557,0.756049,0.000019448982,0.00005239234],"about_ca_topic_score_codex":0.00002334287,"about_ca_topic_score_gemma":0.0000015036511,"teacher_disagreement_score":0.701328,"about_ca_system_score_codex":0.000013671778,"about_ca_system_score_gemma":0.000088858236,"threshold_uncertainty_score":0.52618086},"labels":[],"label_agreement":null},{"id":"W2011841843","doi":"10.1016/j.entcs.2010.08.003","title":"Unitary Theories, Unitary Categories","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Ottawa","funders":"","keywords":"Unitary state; Mathematics; Characterization (materials science); Algebra over a field; Pure mathematics; Political science; Law; Physics","score_opus":0.006429317419456973,"score_gpt":0.23402486783066248,"score_spread":0.2275955504112055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011841843","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.03531486,0.00020152709,0.9573633,0.0010678202,0.0018813631,0.0002624315,3.938817e-7,0.00030792467,0.0036003517],"genre_scores_gemma":[0.98066497,0.000011279709,0.018559707,0.00043286305,0.00028126893,0.000019329998,0.0000023517823,0.000013962546,0.000014297344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996257,0.00018855566,0.0003994221,0.0009539024,0.0007085113,0.001492597],"domain_scores_gemma":[0.99751437,0.00065104157,0.00008559955,0.0012886602,0.00020493162,0.00025542534],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003127552,0.00030085404,0.00030031844,0.00033009233,0.00047693413,0.0005173071,0.0039215568,0.00013718994,0.000048231574],"category_scores_gemma":[0.0003386091,0.00023843376,0.00007482481,0.0023066152,0.0035349482,0.00093484897,0.0010635728,0.0010570891,0.00007899215],"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.0000063121656,0.00007059054,0.00066452654,0.0000065830804,0.000004591464,0.000026525142,0.00058527617,0.00003075568,0.00046080496,0.9560401,0.000007080991,0.04209684],"study_design_scores_gemma":[0.00022591445,0.00030538422,0.00052913674,0.0000034654977,0.000003044152,0.00011444177,0.000010962451,0.05357325,0.0040949974,0.9396508,0.001154205,0.000334421],"about_ca_topic_score_codex":0.00008754629,"about_ca_topic_score_gemma":0.0001357232,"teacher_disagreement_score":0.94535005,"about_ca_system_score_codex":0.00012944838,"about_ca_system_score_gemma":0.00075715047,"threshold_uncertainty_score":0.99917686},"labels":[],"label_agreement":null},{"id":"W2013047129","doi":"10.1016/s1571-0661(05)80492-x","title":"Tabular Verification and Refinement","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Structuring; Programming language; Theoretical computer science; Formal methods; Refinement calculus; Model checking; Formal verification","score_opus":0.011398349599132355,"score_gpt":0.23211852709580588,"score_spread":0.22072017749667353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013047129","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.013043135,0.00064808235,0.9834272,0.0011949443,0.00024581118,0.00017437937,6.172724e-8,0.0001043099,0.0011620622],"genre_scores_gemma":[0.9836162,0.000052830594,0.01601413,0.0002235597,0.0000643218,0.000014209278,2.868686e-7,0.0000047220633,0.000009771537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790305,0.0000850792,0.00023652948,0.00066212437,0.00041618932,0.0006970046],"domain_scores_gemma":[0.9990425,0.00013344844,0.00005468783,0.0005931112,0.000059630547,0.00011659928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012969503,0.00013756048,0.00014958014,0.00015217486,0.00020293958,0.00031448118,0.0011455439,0.00004759457,0.00003188292],"category_scores_gemma":[0.00009030849,0.000113602284,0.000026182022,0.0008916041,0.0008634956,0.0003652695,0.0003809933,0.00020537266,0.000049824885],"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.0000010254213,0.00004293604,0.00020273699,0.0000040230952,0.0000014493194,0.0000039565293,0.0003359942,0.000020812031,0.0001890358,0.8822631,0.0000073744163,0.11692755],"study_design_scores_gemma":[0.00027236866,0.0003490915,0.00065280905,0.000005436865,0.0000020765654,0.000032271317,0.0000027251258,0.60306865,0.002304071,0.39091,0.002180788,0.00021970413],"about_ca_topic_score_codex":0.000008396035,"about_ca_topic_score_gemma":0.000003705971,"teacher_disagreement_score":0.970573,"about_ca_system_score_codex":0.00012793652,"about_ca_system_score_gemma":0.000048490205,"threshold_uncertainty_score":0.46325666},"labels":[],"label_agreement":null},{"id":"W2013754071","doi":"10.1016/j.entcs.2009.07.012","title":"LCF-style Platform based on Multiway Decision Graphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reachability; Automated theorem proving; HOL; Computer science; Set (abstract data type); Product (mathematics); Theoretical computer science; Inference; Rule of inference; Programming language; Artificial intelligence; Mathematics","score_opus":0.01075389753875564,"score_gpt":0.28725173771968154,"score_spread":0.2764978401809259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013754071","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.035675514,0.00003368901,0.96142215,0.00063576223,0.00045403163,0.00027823393,4.7441063e-7,0.00021128962,0.0012888386],"genre_scores_gemma":[0.56149864,0.0000040954087,0.43748173,0.00097456085,0.000028690185,0.0000060532234,4.7970246e-7,0.0000051195384,6.578784e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589944,0.0001515074,0.00046077475,0.0011005297,0.0011257806,0.0012619722],"domain_scores_gemma":[0.99708486,0.0010123679,0.00010851291,0.0014504679,0.00012678166,0.00021702888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072575,0.000285513,0.00026563084,0.00065475795,0.00034475542,0.0003654125,0.0035351904,0.0001147922,0.000022240174],"category_scores_gemma":[0.00078052614,0.00024054255,0.00009876468,0.0028544348,0.0010107427,0.0009701898,0.00028728662,0.0006186341,0.00006235638],"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.000030758296,0.00011080002,0.000028914363,0.0000012794803,5.7193495e-7,0.000004279688,0.00008705685,0.0028303564,0.0003302369,0.6946819,0.0000029969406,0.30189088],"study_design_scores_gemma":[0.00032666794,0.0007713388,0.0019268548,0.000035928442,0.0000010239622,0.00000868734,6.0065287e-7,0.61636794,0.011841303,0.36848077,0.000042232074,0.00019664338],"about_ca_topic_score_codex":0.000002274553,"about_ca_topic_score_gemma":0.0000016710648,"teacher_disagreement_score":0.6135376,"about_ca_system_score_codex":0.0004159075,"about_ca_system_score_gemma":0.00030096862,"threshold_uncertainty_score":0.98090404},"labels":[],"label_agreement":null},{"id":"W2016647275","doi":"10.1016/j.entcs.2009.06.022","title":"Probabilistic Analysis of Wireless Systems Using Theorem Proving","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Automated theorem proving; Probabilistic logic; Probabilistic analysis of algorithms; Wireless; General Packet Radio Service; GSM; HOL; Theoretical computer science; Distributed computing; Computer network; Programming language; Telecommunications","score_opus":0.014751320193868529,"score_gpt":0.2924607097555175,"score_spread":0.277709389561649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016647275","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.24858533,0.00007704401,0.750604,0.00006285636,0.00017871629,0.00025299445,5.137398e-7,0.00006993626,0.00016866115],"genre_scores_gemma":[0.77356523,0.0000032718654,0.22634363,0.000049940107,0.000027752996,0.000004847342,4.5482366e-7,0.000004493849,4.0105013e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965134,0.00036707244,0.0006196693,0.0008223982,0.0007770649,0.000900377],"domain_scores_gemma":[0.99781144,0.00047620747,0.00023576045,0.0011246401,0.00023840135,0.000113531576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048399484,0.00020714938,0.00046236717,0.000891855,0.00017404706,0.00025719032,0.0026761226,0.000076631,0.0000038735448],"category_scores_gemma":[0.0004635459,0.00017847595,0.0001080882,0.0070616375,0.0013941873,0.0007341264,0.00033023837,0.00031300273,0.0000017234328],"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.000008072703,0.00007818508,0.00014270276,0.000010701642,0.00001533968,0.0000019102933,0.00030973132,0.042104848,0.0026550866,0.9245874,6.586073e-8,0.030085914],"study_design_scores_gemma":[0.00009326682,0.00023716716,0.001588325,0.000040941188,0.000035612757,0.000011428246,0.0000032909984,0.84613097,0.0054976307,0.14618433,9.5013337e-7,0.00017609009],"about_ca_topic_score_codex":0.000014282618,"about_ca_topic_score_gemma":0.00000197566,"teacher_disagreement_score":0.8040261,"about_ca_system_score_codex":0.000448647,"about_ca_system_score_gemma":0.00041164382,"threshold_uncertainty_score":0.72780377},"labels":[],"label_agreement":null},{"id":"W2016819899","doi":"10.1016/j.entcs.2009.09.011","title":"On the Relationship Between Boolean and Fuzzy Cellular Automata","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":24,"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 Ottawa","funders":"","keywords":"Mathematics; Discrete mathematics; Boolean network; Two-element Boolean algebra; Complete Boolean algebra; Boolean domain; Stone's representation theorem for Boolean algebras; Boolean expression; Boolean function; Pure mathematics; Algebra over a field","score_opus":0.013898130151227525,"score_gpt":0.25650775269609166,"score_spread":0.24260962254486412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016819899","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.25390106,0.000060480827,0.73417693,0.010574906,0.000041751257,0.00019776255,5.886778e-7,0.00014159216,0.0009049154],"genre_scores_gemma":[0.9898148,0.000003504217,0.009288006,0.00081742276,0.000057060286,0.00000840011,0.0000013764617,0.0000051486813,0.0000042651377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978059,0.00013159707,0.00025302736,0.00066084176,0.0004705994,0.00067804166],"domain_scores_gemma":[0.9964415,0.0023166884,0.00005651656,0.0010252107,0.000033049855,0.00012707635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770954,0.00016778556,0.00015114294,0.0001709098,0.0005242882,0.0003956453,0.0020586613,0.000055339726,0.00000613056],"category_scores_gemma":[0.00033719523,0.000120434044,0.00004020416,0.001342818,0.0010050742,0.00032650548,0.0003580879,0.00046695877,0.000048312213],"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.0000012408564,0.000034357774,0.0006320492,0.0000011113075,9.643858e-7,0.000002053787,0.00013470708,0.00003585869,0.00023220392,0.974839,0.000011609237,0.024074873],"study_design_scores_gemma":[0.00012620559,0.00018908228,0.031007895,0.000017433316,0.0000024616365,0.00000777848,0.0000010628107,0.14246207,0.002388806,0.8236105,0.00004299586,0.00014371186],"about_ca_topic_score_codex":0.0000019106756,"about_ca_topic_score_gemma":8.717945e-7,"teacher_disagreement_score":0.73591375,"about_ca_system_score_codex":0.00010149348,"about_ca_system_score_gemma":0.00013788787,"threshold_uncertainty_score":0.49111578},"labels":[],"label_agreement":null},{"id":"W2017017113","doi":"10.1016/j.entcs.2006.12.013","title":"Pauli Measurements are Universal","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pauli exclusion principle; Qubit; Physics; Theoretical physics; Statistical physics; Quantum mechanics; Quantum","score_opus":0.01098471972778858,"score_gpt":0.24768597972965883,"score_spread":0.23670126000187025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017017113","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.05437527,0.000047410813,0.941552,0.0006946741,0.00035424667,0.00012517444,2.0731994e-7,0.00015041725,0.0027006408],"genre_scores_gemma":[0.9651889,0.000004955601,0.033813644,0.0009367599,0.000046737267,0.000001871638,3.637577e-7,0.000004830538,0.0000019329586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702966,0.00006017418,0.00034033184,0.00049882464,0.0009165806,0.0011544313],"domain_scores_gemma":[0.99871737,0.00021686086,0.00009983741,0.00059090415,0.000162245,0.0002128013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035000332,0.00017254164,0.00016288071,0.00053269416,0.00025530014,0.00025348202,0.0022777363,0.000059346443,0.000029296485],"category_scores_gemma":[0.000106313746,0.00015381891,0.00006751457,0.0026651071,0.0011314554,0.0010109212,0.00045468094,0.00034005922,0.000064508786],"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.0000064248006,0.0000505574,0.0018914376,0.0000027181945,0.0000027667484,0.0000064331366,0.00025544135,0.00008988758,0.00019258012,0.95693225,0.000007916765,0.040561598],"study_design_scores_gemma":[0.0013508853,0.0006224188,0.02755769,0.00007958522,0.0000054780367,0.00006114454,0.00003829669,0.3806995,0.039798122,0.5475581,0.0013934107,0.0008353857],"about_ca_topic_score_codex":0.0000036682432,"about_ca_topic_score_gemma":0.000010503989,"teacher_disagreement_score":0.9108136,"about_ca_system_score_codex":0.00022492021,"about_ca_system_score_gemma":0.00022119653,"threshold_uncertainty_score":0.6272553},"labels":[],"label_agreement":null},{"id":"W202241028","doi":"10.1016/s1571-0661(05)80574-2","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Category theory; Rewriting; Computer science; Field (mathematics); Domain theory; Type theory; Semantics (computer science); Programming language; Functional programming; Constructive; Model theory; Mathematics; Type (biology); Discrete mathematics; Pure mathematics","score_opus":0.009012709285752936,"score_gpt":0.24566776240007185,"score_spread":0.23665505311431892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202241028","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.0059810453,0.00027811315,0.98498356,0.00030685402,0.0006125925,0.00022445228,5.3941708e-8,0.00017423795,0.0074390727],"genre_scores_gemma":[0.96772516,0.0000088278475,0.031907964,0.0002622275,0.000055834094,0.000014806806,1.7864443e-7,0.000007848446,0.000017146445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967173,0.00022367919,0.00030190058,0.00086337037,0.000597742,0.0012960372],"domain_scores_gemma":[0.99847573,0.00031147734,0.00006539303,0.0008732509,0.00009321654,0.00018091596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027705918,0.00020110267,0.00022100181,0.00019897116,0.00024568263,0.0004058805,0.0022582388,0.00007209927,0.000032522297],"category_scores_gemma":[0.0003159282,0.0001626396,0.000062557396,0.0017131738,0.0011583884,0.00054448406,0.00038379026,0.00036389928,0.000113528185],"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.0000016493959,0.00005887162,0.0003666456,0.000004049612,0.0000021820035,0.000008960511,0.00023917461,0.00010802758,0.00015222066,0.974219,0.000004862973,0.024834333],"study_design_scores_gemma":[0.00026890318,0.00029489718,0.00022116516,0.000004421764,0.0000015638185,0.00007665576,0.0000027023282,0.07554183,0.009159595,0.91198623,0.0021738315,0.00026818828],"about_ca_topic_score_codex":0.0000072250064,"about_ca_topic_score_gemma":0.000006573131,"teacher_disagreement_score":0.9617441,"about_ca_system_score_codex":0.00021984486,"about_ca_system_score_gemma":0.0004403478,"threshold_uncertainty_score":0.663225},"labels":[],"label_agreement":null},{"id":"W2026691974","doi":"10.1016/j.entcs.2006.10.036","title":"Type-Safe Code Transformations in Haskell","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Programming language; Haskell; Computer science; Compiler; Abstract syntax; Dependent type; Correctness; Type (biology); Transformation (genetics); Type inference; Functional programming; Theoretical computer science; Semantics (computer science); Lambda calculus; Inference; Artificial intelligence","score_opus":0.01093150777426207,"score_gpt":0.26451387620971734,"score_spread":0.2535823684354553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026691974","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.016394561,0.00017518656,0.9770598,0.0005612911,0.0005087828,0.0002608223,1.5554123e-7,0.000107110056,0.0049323128],"genre_scores_gemma":[0.9813883,0.00001352424,0.018226199,0.0002797789,0.00007113686,0.0000059119684,7.908859e-7,0.00000672056,0.000007673191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702543,0.00009367223,0.00046690716,0.0005946603,0.00052821025,0.0012911049],"domain_scores_gemma":[0.9986997,0.00042875178,0.000058533406,0.0005604039,0.00009783729,0.00015473635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043129963,0.00017717005,0.00021753891,0.00040721064,0.00017996765,0.00023991405,0.001939865,0.000087706205,0.000017738925],"category_scores_gemma":[0.0001291629,0.00015086487,0.000050046725,0.0026833243,0.0009191734,0.00064658397,0.00025279945,0.00044523485,0.00008276795],"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.000007913174,0.00007609497,0.00061600807,0.000005684312,0.0000013911751,0.00001531331,0.00081855414,0.00023054125,0.00013882811,0.9471978,0.0000029435132,0.05088895],"study_design_scores_gemma":[0.00048969494,0.00041208215,0.0025367213,0.000012115885,0.0000017904296,0.00005677883,0.0000095878,0.25622544,0.0046197902,0.7340628,0.0012540123,0.000319213],"about_ca_topic_score_codex":0.00002570115,"about_ca_topic_score_gemma":0.00021961956,"teacher_disagreement_score":0.9649937,"about_ca_system_score_codex":0.00029557335,"about_ca_system_score_gemma":0.0003375126,"threshold_uncertainty_score":0.6152091},"labels":[],"label_agreement":null},{"id":"W2028905856","doi":"10.1016/j.entcs.2009.09.064","title":"Formal Verification and Validation of UML 2.0 Sequence Diagrams using Source and Destination of Messages","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Promela; Sequence diagram; Computer science; Programming language; Unified Modeling Language; Model checking; Applications of UML; UML tool; Software; Theoretical computer science; Software engineering","score_opus":0.02005992062363393,"score_gpt":0.30380842704577804,"score_spread":0.2837485064221441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028905856","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.4355108,0.000057989324,0.5641756,0.0000913734,0.000028477167,0.00009657052,1.8669986e-7,0.000016769332,0.000022206978],"genre_scores_gemma":[0.6519042,0.000019557123,0.34804192,0.000021083808,0.000009031535,0.0000015235412,4.3886942e-7,0.0000020862449,1.4024184e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983157,0.00015375276,0.0003577427,0.00040252737,0.00040114083,0.00036912615],"domain_scores_gemma":[0.9989776,0.00024484246,0.00020191922,0.0003610644,0.00015672557,0.000057833786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002890291,0.00011369657,0.00017137904,0.00023127763,0.00011865878,0.0000888816,0.00065310544,0.00005350238,9.124812e-7],"category_scores_gemma":[0.0004437282,0.00010746913,0.000018111008,0.00097617885,0.0011990316,0.0012812187,0.0001936871,0.00014488089,1.9182843e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068220115,0.000025355044,0.0005001831,0.000011072027,7.7992473e-7,1.5695704e-7,0.00033903267,0.0009972261,0.030000076,0.7377539,2.4192643e-8,0.23036532],"study_design_scores_gemma":[0.00011924709,0.00027149156,0.0083945505,0.000036103156,0.000003031336,0.00001920032,0.0000028016582,0.6722065,0.20339844,0.11546394,6.8530335e-7,0.00008396263],"about_ca_topic_score_codex":0.0000067356605,"about_ca_topic_score_gemma":4.388912e-7,"teacher_disagreement_score":0.67120934,"about_ca_system_score_codex":0.00009149486,"about_ca_system_score_gemma":0.00011630689,"threshold_uncertainty_score":0.44178817},"labels":[],"label_agreement":null},{"id":"W2030272387","doi":"10.1016/j.entcs.2004.02.049","title":"DPVK - An Eclipse Plug-in to Detect Design Patterns in Eiffel Systems","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Eiffel; Computer science; Eclipse; Software design pattern; Programming language; Software engineering; Reverse engineering; Extensibility; Plug-in; Engineering design process; Compatibility (geochemistry); Architectural pattern; Software; Software design; Software development; Object-oriented programming; Engineering","score_opus":0.01331049559400888,"score_gpt":0.2734982694376952,"score_spread":0.2601877738436863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030272387","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.3477493,0.000064815744,0.65109164,0.00026743906,0.00030280295,0.00040144243,3.905089e-7,0.00011398861,0.000008229753],"genre_scores_gemma":[0.9255727,0.0000066266243,0.0740567,0.00014017029,0.00013021879,0.00007359274,3.2154645e-7,0.000018871227,7.927921e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99491924,0.00030973105,0.00047906704,0.0012891168,0.0009800809,0.0020227411],"domain_scores_gemma":[0.99683696,0.0015449043,0.000037342754,0.0011486575,0.000077218465,0.00035491967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004704979,0.000288543,0.00034613145,0.0011581474,0.000098228775,0.000504837,0.004064758,0.00010744519,0.0000063587236],"category_scores_gemma":[0.0009860172,0.000275228,0.000039970644,0.0038495231,0.0004462194,0.000797007,0.00086314604,0.0008109646,0.00004788938],"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.000024384872,0.00014148316,0.0053585493,0.000018848928,0.0000022886861,0.0001780019,0.0010382341,0.40001366,0.0005376404,0.5702867,9.3527973e-7,0.022399284],"study_design_scores_gemma":[0.0010170392,0.0012822397,0.03280949,0.00027165454,0.0000010883018,0.00008579638,0.000005182741,0.81082225,0.008733382,0.14436646,0.000007229662,0.00059818843],"about_ca_topic_score_codex":0.00016438284,"about_ca_topic_score_gemma":0.00012016644,"teacher_disagreement_score":0.5778234,"about_ca_system_score_codex":0.0014814622,"about_ca_system_score_gemma":0.0007051065,"threshold_uncertainty_score":0.99997},"labels":[],"label_agreement":null},{"id":"W2032260294","doi":"10.1016/s1571-0661(05)80122-7","title":"ASF+SDF parsing tools applied to ELAN","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Centrum Wiskunde and Informatica; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Research Consortium for Informatics and Mathematics","keywords":"Parsing; Computer science; Syntax; Programming language; Rotation formalisms in three dimensions; LR parser; Parser combinator; Abstract syntax tree; Natural language processing; Abstract syntax; Syntax error; Development (topology); Top-down parsing; Artificial intelligence; Mathematics","score_opus":0.011012687068714631,"score_gpt":0.24727246182427323,"score_spread":0.2362597747555586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032260294","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.02765001,0.000077702716,0.9586014,0.00084517174,0.00033606883,0.00041230815,2.0215933e-7,0.00024177431,0.0118353395],"genre_scores_gemma":[0.96749836,0.0000054268635,0.031199647,0.0010559895,0.00017618922,0.000030349722,7.733385e-7,0.000011547037,0.000021721453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607533,0.000114727954,0.00039880487,0.0010949228,0.00072410883,0.0015921149],"domain_scores_gemma":[0.99826103,0.00036191236,0.000050394352,0.000959274,0.00006569332,0.0003017076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089259,0.00025719532,0.0003097017,0.0002371188,0.00032743582,0.00085900974,0.002969863,0.000086564374,0.00011312731],"category_scores_gemma":[0.000097059914,0.00021692988,0.000067642155,0.0020727804,0.00079843774,0.0005159813,0.0004834656,0.0003940316,0.00046665178],"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.000007639252,0.000053193533,0.000040729417,0.0000026660846,0.0000019710153,0.0000070039227,0.00038035057,0.00042902352,0.00020129711,0.6602133,0.0000077068435,0.3386551],"study_design_scores_gemma":[0.00049103855,0.0008462254,0.0009010506,0.000018122359,0.000004254933,0.000083375344,0.000005917006,0.13129534,0.0075669126,0.8533408,0.0047739795,0.00067294773],"about_ca_topic_score_codex":0.000014991238,"about_ca_topic_score_gemma":0.000010480298,"teacher_disagreement_score":0.93984836,"about_ca_system_score_codex":0.0002773725,"about_ca_system_score_gemma":0.0002889365,"threshold_uncertainty_score":0.88461435},"labels":[],"label_agreement":null},{"id":"W2033396863","doi":"10.1016/j.entcs.2004.06.064","title":"A Practical Approach to Partial Functions in CVC Lite","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Surprise; Partial function; Formalism (music); Programming language; Classical logic; Theoretical computer science; Partial evaluation; Semantics (computer science); Model checking; Algorithm; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.017565980413891548,"score_gpt":0.28098337289810243,"score_spread":0.26341739248421087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033396863","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.006277059,0.00006579095,0.98527294,0.003470424,0.00034854753,0.0003914105,1.639678e-7,0.00014203109,0.004031656],"genre_scores_gemma":[0.87899256,0.00000238534,0.12003561,0.0006235174,0.00026460938,0.000058488582,6.448946e-7,0.000008112713,0.000014080819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613565,0.00022855608,0.00043976886,0.0010772359,0.0006669108,0.0014518711],"domain_scores_gemma":[0.9983957,0.00038715548,0.00005975898,0.0007832675,0.00008686532,0.0002873007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029081118,0.0002205177,0.00027123335,0.0003962167,0.00019558734,0.00048103085,0.0016310933,0.00009442444,0.00001444113],"category_scores_gemma":[0.00036861305,0.00018549063,0.0000654609,0.0026884829,0.00075738435,0.00082239637,0.00073110434,0.0005814218,0.00020289776],"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.000011366539,0.00029463434,0.00030815252,0.0000038122962,0.0000022671,0.000007308943,0.0006334162,0.0012429245,0.000059876485,0.94726807,0.000027177382,0.050141],"study_design_scores_gemma":[0.00046399655,0.00049115415,0.0006549377,0.0000086863765,0.0000031094696,0.00012818123,0.000009743067,0.83420086,0.0010377511,0.15683123,0.005780741,0.00038959106],"about_ca_topic_score_codex":0.000023439425,"about_ca_topic_score_gemma":0.000042156837,"teacher_disagreement_score":0.8727155,"about_ca_system_score_codex":0.0004081187,"about_ca_system_score_gemma":0.0004964289,"threshold_uncertainty_score":0.7564088},"labels":[],"label_agreement":null},{"id":"W2036428616","doi":"10.1016/j.entcs.2004.06.049","title":"A Language For Multiplicative-additive Linear Logic","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linear logic; Decidability; Modulo; Equivalence (formal languages); Concurrency; Rewriting; Mathematical proof; Mathematics; Multiplicative function; Curry–Howard correspondence; Term (time); Distributive property; Algebra over a field; Calculus (dental); Programming language; Discrete mathematics; Computer science; Natural deduction; Pure mathematics","score_opus":0.011406425401567461,"score_gpt":0.2828745985792736,"score_spread":0.27146817317770616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036428616","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.0036921229,0.00024883606,0.99294883,0.001352842,0.00020020551,0.000551525,0.0000011937568,0.00019335309,0.0008110922],"genre_scores_gemma":[0.85238105,0.000006840105,0.14662729,0.0005830876,0.00029678928,0.00007913453,0.0000018742718,0.000008894345,0.000015072312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971229,0.00010588634,0.00031377652,0.0009027251,0.0004005528,0.0011541995],"domain_scores_gemma":[0.9981728,0.00074943487,0.00009459246,0.000678037,0.00015209771,0.00015302839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017615628,0.00021501038,0.00025516076,0.00019111497,0.0002495393,0.00020755075,0.0022090233,0.000080103346,0.000015964399],"category_scores_gemma":[0.0003409406,0.00016971445,0.00009378756,0.0009971439,0.0011306931,0.0004841782,0.00049630494,0.00029808228,0.00008185371],"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.000007907979,0.00008321496,0.00002631128,0.000004294854,0.0000034019456,0.0000030297442,0.0010148035,0.0001416318,0.00034411842,0.841956,0.0000075271587,0.15640773],"study_design_scores_gemma":[0.0005139665,0.0004804506,0.00011382289,0.0000059335575,0.0000026637383,0.000025958838,0.00001084333,0.644775,0.0138131855,0.33811665,0.0018680606,0.00027349422],"about_ca_topic_score_codex":0.000008753361,"about_ca_topic_score_gemma":0.000019467429,"teacher_disagreement_score":0.8486889,"about_ca_system_score_codex":0.00026673515,"about_ca_system_score_gemma":0.0002433499,"threshold_uncertainty_score":0.69207543},"labels":[],"label_agreement":null},{"id":"W2045048599","doi":"10.1016/s1571-0661(04)80486-9","title":"A Semantics for Timed MSC","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Formal semantics (linguistics); Event (particle physics); Formal specification; Formal methods; Formal verification; Operational semantics; Software engineering","score_opus":0.01736229215600636,"score_gpt":0.2811296066941258,"score_spread":0.2637673145381194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045048599","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.0060644047,0.00012836815,0.99069136,0.0015163202,0.00046770074,0.00037545833,6.0859765e-7,0.00016203751,0.00059375464],"genre_scores_gemma":[0.5368627,0.000010610866,0.4627723,0.00026019508,0.00005766573,0.000024232211,2.3515784e-7,0.0000062048484,0.0000058745077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971022,0.00012222838,0.00034725256,0.00077912695,0.00051213,0.001137064],"domain_scores_gemma":[0.9980545,0.000663658,0.00008086898,0.0009241489,0.00014067517,0.00013616974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026627039,0.00018478151,0.0002111695,0.0002744123,0.00025476568,0.0002820959,0.0027673899,0.000074750526,0.00003388766],"category_scores_gemma":[0.0007105858,0.00016770903,0.00007006483,0.0016518408,0.0012520201,0.0007159851,0.00047267604,0.00030422077,0.0000632512],"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.000004031601,0.00006248128,0.000022587235,0.0000067752117,0.0000018695969,0.0000014919721,0.00026318067,0.00019947295,0.0004987454,0.9088849,0.000015906257,0.09003855],"study_design_scores_gemma":[0.00021691392,0.0002559563,0.000071806826,0.0000130298,0.0000018737688,0.000019939045,6.992547e-7,0.7237581,0.012576964,0.2626139,0.00030383992,0.00016700017],"about_ca_topic_score_codex":0.0000011121195,"about_ca_topic_score_gemma":0.00000107002,"teacher_disagreement_score":0.7235586,"about_ca_system_score_codex":0.00024259835,"about_ca_system_score_gemma":0.00010542665,"threshold_uncertainty_score":0.6838976},"labels":[],"label_agreement":null},{"id":"W2048387852","doi":"10.1016/s1571-0661(04)80958-7","title":"Regular-Language Semantics for a Call-by-Value Programming Language","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Basis Foundation","keywords":"Finitary; Game semantics; Equivalence (formal languages); Computer science; Operational semantics; Decidability; Programming language; Denotational semantics; Mathematics; Semantics (computer science); Theoretical computer science; Discrete mathematics","score_opus":0.006798227184641947,"score_gpt":0.26479770567837907,"score_spread":0.2579994784937371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048387852","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.022083044,0.0008203183,0.97440434,0.0009890208,0.00039440568,0.00072052167,6.809967e-7,0.00028323694,0.0003044404],"genre_scores_gemma":[0.92677146,0.00001347425,0.07253773,0.0003441709,0.00019880132,0.00006774085,0.000004085689,0.000019382072,0.00004315063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959126,0.00014688053,0.000433218,0.0010605531,0.00068402814,0.0017626851],"domain_scores_gemma":[0.9980713,0.0005115019,0.000120775876,0.0009526419,0.000118740594,0.00022502425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002679226,0.000299227,0.00034919806,0.00022427463,0.00033457493,0.00062525936,0.0026068748,0.00012062712,0.000007206255],"category_scores_gemma":[0.00034086872,0.00025027557,0.00012257296,0.0015821272,0.0010809969,0.00048201825,0.00057374174,0.00036805912,0.000020611351],"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.000010727531,0.000108434484,0.00014321312,0.000018571083,0.00000654249,0.000035896945,0.0014745417,0.000051101913,0.0012173116,0.85302866,0.000022960128,0.14388207],"study_design_scores_gemma":[0.0012505654,0.0012943568,0.000087258544,0.000036911097,0.000015500316,0.00030621383,0.000073030285,0.6730282,0.017092064,0.30104667,0.0048981644,0.00087110023],"about_ca_topic_score_codex":0.000048263944,"about_ca_topic_score_gemma":0.000028170785,"teacher_disagreement_score":0.9046884,"about_ca_system_score_codex":0.00026291076,"about_ca_system_score_gemma":0.00027607623,"threshold_uncertainty_score":0.99999493},"labels":[],"label_agreement":null},{"id":"W2049808440","doi":"10.1016/s1571-0661(04)80983-6","title":"Geodesic Paths Approach to Color Image Enhancement","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial intelligence; Smoothing; Computer vision; Computer science; Color image; Noise reduction; Median filter; Noise (video); Pixel; Mathematics; Filter (signal processing); Pattern recognition (psychology); Image segmentation; Image processing; Image (mathematics)","score_opus":0.010780131142595347,"score_gpt":0.2758154286070843,"score_spread":0.26503529746448895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049808440","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.03284857,0.0000836037,0.9598229,0.0011885198,0.00031096663,0.00036162368,2.500858e-7,0.00012743869,0.0052561066],"genre_scores_gemma":[0.57412374,0.000011072689,0.4246214,0.0011239161,0.00006871642,0.000025328098,3.7345282e-7,0.000007677383,0.000017776807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995614,0.00028489126,0.00039425681,0.0012074943,0.00084863196,0.0016507494],"domain_scores_gemma":[0.99803084,0.00045163208,0.000059862174,0.0010006742,0.0001637907,0.00029317613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038854727,0.0002735952,0.00031011875,0.00038741782,0.00031942767,0.00060957833,0.0033150783,0.00006396952,0.000029380488],"category_scores_gemma":[0.00025598306,0.00023698606,0.00007660826,0.00292856,0.0010258582,0.00075004535,0.001072424,0.00042118976,0.00013055785],"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.000032949392,0.00020725613,0.000019948971,0.0000048453935,0.0000031365728,0.000030107578,0.00048724745,0.00053336634,0.014119219,0.8743533,0.000023879695,0.11018473],"study_design_scores_gemma":[0.0006228541,0.0006942378,0.00024778617,0.0000309749,0.0000039669185,0.000110279885,0.0000035501469,0.6984652,0.061601534,0.23723726,0.00051210064,0.00047022582],"about_ca_topic_score_codex":0.000010296828,"about_ca_topic_score_gemma":0.0000015357986,"teacher_disagreement_score":0.6979319,"about_ca_system_score_codex":0.00039117812,"about_ca_system_score_gemma":0.00037768035,"threshold_uncertainty_score":0.9664011},"labels":[],"label_agreement":null},{"id":"W2051988259","doi":"10.1016/s1571-0661(04)80669-8","title":"Improving Termination of MDG-Based Abstract State Enumeration via Term Schematization","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Enumeration; Exploit; Term (time); Computer science; State (computer science); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.008095859017107783,"score_gpt":0.273987958328635,"score_spread":0.2658920993115272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051988259","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.1495854,0.000023101013,0.8496486,0.00014712727,0.00018155506,0.0002353915,5.408014e-7,0.00008096774,0.00009735208],"genre_scores_gemma":[0.67291725,0.000004203232,0.32697555,0.000058622565,0.00002446509,0.000010867242,0.0000022894094,0.0000060503357,6.777461e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974787,0.000136723,0.00054072,0.00058797473,0.00065705826,0.0005987783],"domain_scores_gemma":[0.99843097,0.00031217467,0.00028047088,0.00064788415,0.00024819418,0.00008027901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030455638,0.0001717879,0.00019125697,0.0004232141,0.0001680228,0.00019908369,0.0013164565,0.00006643094,0.0000169953],"category_scores_gemma":[0.0004576895,0.00016394145,0.000045391498,0.0017265996,0.0007323998,0.0013354239,0.00019677547,0.00026320128,0.000010887446],"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.00001559698,0.0001039637,0.0005638302,0.000026161795,0.000001586151,0.0000024432181,0.00021326066,0.0037563147,0.038688503,0.49522942,2.4247916e-7,0.4613987],"study_design_scores_gemma":[0.00019494446,0.00016182172,0.0042941268,0.00003253026,0.0000017009806,0.0000105593645,5.7854663e-7,0.7349182,0.20327961,0.0569669,0.0000029916077,0.00013604172],"about_ca_topic_score_codex":0.000008548079,"about_ca_topic_score_gemma":0.000003969388,"teacher_disagreement_score":0.7311619,"about_ca_system_score_codex":0.00031855787,"about_ca_system_score_gemma":0.00032912896,"threshold_uncertainty_score":0.66853386},"labels":[],"label_agreement":null},{"id":"W2058843773","doi":"10.1016/j.entcs.2005.05.012","title":"Source Transformation for Concurrency Analysis","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Concurrency; Java; Programming language; Deadlock; Debugging; Concurrent object-oriented programming; Distributed computing; Operating system; Programming paradigm","score_opus":0.005884489380710531,"score_gpt":0.25858299521963823,"score_spread":0.2526985058389277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058843773","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.014963865,0.00016498458,0.98211837,0.0017902501,0.00017064957,0.00030583146,0.000004049924,0.00011662033,0.0003654035],"genre_scores_gemma":[0.95784354,0.0000071367563,0.041700587,0.00029245927,0.00010607611,0.000036276062,0.0000046323344,0.0000049399105,0.00000435432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973819,0.000068926056,0.00044966897,0.00066413893,0.00047757084,0.00095779746],"domain_scores_gemma":[0.998738,0.0003287169,0.000084724474,0.0005595964,0.00015319174,0.00013575087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018838712,0.00017850795,0.0002956136,0.00037710374,0.00024974652,0.00033494664,0.0018236284,0.000062326755,0.000014072478],"category_scores_gemma":[0.000082379345,0.00015727604,0.0001535747,0.0030947435,0.00056663674,0.00096917106,0.00013293883,0.00021566467,0.000018864346],"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.000004634673,0.000045035646,0.00007484052,0.000004829023,0.0000115061885,2.1698662e-7,0.0004707951,0.008616195,0.00008330181,0.79413044,0.000005413699,0.1965528],"study_design_scores_gemma":[0.0003905,0.00014595024,0.00027149852,0.000012328481,0.000015258176,0.0000065687536,0.0000027197107,0.9566229,0.0022984007,0.037590116,0.0024315084,0.00021222983],"about_ca_topic_score_codex":0.000005527869,"about_ca_topic_score_gemma":0.00002059342,"teacher_disagreement_score":0.94800675,"about_ca_system_score_codex":0.00023709635,"about_ca_system_score_gemma":0.00021263213,"threshold_uncertainty_score":0.6413531},"labels":[],"label_agreement":null},{"id":"W2059295095","doi":"10.1016/j.entcs.2012.08.009","title":"Timed Sets, Functional Complexity, and Computability","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computability; P; Modulo; Categorical variable; Distributive property; Theoretical computer science; Mathematics; Discrete mathematics; Basis (linear algebra); Computer science; Time complexity; Algebra over a field; Pure mathematics","score_opus":0.02085770852822977,"score_gpt":0.2670126453691139,"score_spread":0.24615493684088413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059295095","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.16900915,0.00033787847,0.8272594,0.0015918243,0.00080809195,0.0003372609,0.0000016357042,0.00025599802,0.00039871436],"genre_scores_gemma":[0.8381241,0.0000065149097,0.16115619,0.00048425538,0.00020019978,0.0000140733655,0.0000021057788,0.000011292501,0.0000012809088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945204,0.00041620637,0.0005609145,0.0013237302,0.0010559959,0.0021227533],"domain_scores_gemma":[0.9964877,0.0015120782,0.00010376213,0.001163016,0.00019506668,0.00053838734],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00525838,0.0003905919,0.000456598,0.00033415906,0.00048394085,0.00041417187,0.00218153,0.000116242874,0.00009459842],"category_scores_gemma":[0.00036048025,0.0003511318,0.00009564164,0.0019682355,0.0051674163,0.0013507077,0.0031068064,0.00073357555,0.00005987419],"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.000011175011,0.00029931497,0.0077610356,0.000011518772,0.0000056181907,0.000003006885,0.0003051904,0.0003145627,0.00009229258,0.91838825,0.000009516265,0.0727985],"study_design_scores_gemma":[0.00032382636,0.000184955,0.06291538,0.000009857806,0.000003288939,0.00011963722,0.0000021886965,0.51585263,0.00054093054,0.41966668,0.00006769801,0.000312962],"about_ca_topic_score_codex":0.000019444231,"about_ca_topic_score_gemma":0.000010525736,"teacher_disagreement_score":0.66911495,"about_ca_system_score_codex":0.00055801816,"about_ca_system_score_gemma":0.00037783312,"threshold_uncertainty_score":0.9998941},"labels":[],"label_agreement":null},{"id":"W2060866535","doi":"10.1016/j.entcs.2011.01.010","title":"Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Dagger; Mathematics; Hilbert space; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.022552166226990918,"score_gpt":0.25994593900460267,"score_spread":0.23739377277761176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060866535","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.03631402,0.00019055449,0.96059775,0.0011820284,0.0005360539,0.00043711206,0.0000059692034,0.00019098303,0.0005455002],"genre_scores_gemma":[0.91554385,0.000006852445,0.08345061,0.0008521757,0.00009927355,0.000020134159,0.0000040035056,0.000016159956,0.0000069189846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613243,0.00008998457,0.0004717294,0.0011577986,0.00056200224,0.0015860448],"domain_scores_gemma":[0.99694175,0.0015121949,0.00020104066,0.0008673179,0.00021785825,0.00025987058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012141014,0.00037736044,0.00044842064,0.00028835356,0.0004854039,0.00026837867,0.0025792995,0.00009708272,0.000067946006],"category_scores_gemma":[0.00031964845,0.00030535035,0.00013550503,0.0010763552,0.002261179,0.00093452353,0.0005261338,0.0004814333,0.00003649436],"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.00005974362,0.00017477808,0.0002661027,0.000010597091,0.000009375478,0.000015727988,0.0005588426,0.00074925926,0.0005256604,0.9908554,0.000015885536,0.0067586442],"study_design_scores_gemma":[0.00052184117,0.0004591079,0.007939158,0.00003257076,0.0000049741543,0.0000270153,0.000006734854,0.306411,0.0050601726,0.6789605,0.00018218497,0.00039470114],"about_ca_topic_score_codex":0.000016988895,"about_ca_topic_score_gemma":0.000025686642,"teacher_disagreement_score":0.87922984,"about_ca_system_score_codex":0.000196542,"about_ca_system_score_gemma":0.0003452478,"threshold_uncertainty_score":0.99993986},"labels":[],"label_agreement":null},{"id":"W2065638548","doi":"10.1016/s1571-0661(05)82589-7","title":"A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sequent; Sequent calculus; Cut-elimination theorem; Natural deduction; Mathematics; Axiom; Proof calculus; Calculus (dental); Graph; Parsing; Algebra over a field; Computer science; Discrete mathematics; Mathematical proof; Artificial intelligence; Pure mathematics","score_opus":0.012514827799573488,"score_gpt":0.2525650648909845,"score_spread":0.24005023709141102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065638548","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.045239042,0.000103251055,0.94955134,0.0015288753,0.00031768603,0.0007670182,1.9390149e-7,0.00010967481,0.0023828922],"genre_scores_gemma":[0.9704652,0.000005001442,0.028281286,0.0010495503,0.00008817431,0.00009986019,6.5599227e-7,0.000009352811,9.1740867e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953928,0.00043176758,0.00048440517,0.0011934729,0.00092487683,0.0015726661],"domain_scores_gemma":[0.99788976,0.0003894553,0.00006784027,0.0013248345,0.00012585497,0.00020223486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005813995,0.00028845284,0.00031949644,0.00033124108,0.0002629954,0.0005050746,0.004341819,0.00009043738,0.0000036627407],"category_scores_gemma":[0.0004732421,0.00019167409,0.00010296597,0.00377185,0.002025184,0.0003722058,0.00074229273,0.0006008252,0.00003859454],"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.000008370123,0.00027489354,0.00024158346,0.0000124524895,0.0000022586894,0.000014763089,0.003771765,0.0027469497,0.000051056886,0.984231,0.0000013188327,0.0086435815],"study_design_scores_gemma":[0.00044089396,0.0004716295,0.001152064,0.000010612198,0.0000026387254,0.00006865112,0.00003154179,0.04777525,0.0010666193,0.9485951,0.00008522498,0.0002997709],"about_ca_topic_score_codex":0.00010795604,"about_ca_topic_score_gemma":0.000052017756,"teacher_disagreement_score":0.92522615,"about_ca_system_score_codex":0.0005758818,"about_ca_system_score_gemma":0.0005096588,"threshold_uncertainty_score":0.8068252},"labels":[],"label_agreement":null},{"id":"W2073667548","doi":"10.1016/j.entcs.2009.12.029","title":"Formal Specification of Correlation in WS Orchestrations Using BP-calculus","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Web service; Process calculus; Business Process Execution Language; Orchestration; Programming language; Uniqueness; Semantics (computer science); Correlation; Function (biology); Theoretical computer science; Service-oriented architecture; Mathematics","score_opus":0.009075165976633218,"score_gpt":0.2583048167233229,"score_spread":0.24922965074668968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073667548","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.285775,0.00004771024,0.7130314,0.00044114937,0.000112160764,0.00014035121,2.1061273e-7,0.000031449323,0.00042054855],"genre_scores_gemma":[0.90094584,0.000004755604,0.098653525,0.00033871445,0.000050461986,0.00000170819,0.0000014436671,0.0000033095096,2.3303745e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977441,0.00007400059,0.00046722882,0.0004968687,0.0004835322,0.0007343126],"domain_scores_gemma":[0.99890316,0.00028382233,0.00011970168,0.00049909746,0.00011193341,0.00008231789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015805403,0.00014502436,0.00018033679,0.00052496314,0.0001309111,0.00010087846,0.0013204851,0.00007043023,0.0000059604245],"category_scores_gemma":[0.00003619253,0.00013251924,0.000041914092,0.0029034312,0.00038907162,0.00097515027,0.00019198826,0.00033883456,0.0000039937245],"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.000013316777,0.00007489399,0.00029776988,0.000003944408,8.999665e-7,0.0000023802988,0.0012807816,0.015772179,0.004935341,0.92569476,8.4980286e-8,0.051923633],"study_design_scores_gemma":[0.0002304454,0.00022488699,0.0075573474,0.000037560683,0.0000018577973,0.000016103662,0.000009081882,0.82568157,0.016030721,0.15007067,0.000009328814,0.00013040539],"about_ca_topic_score_codex":0.000028593919,"about_ca_topic_score_gemma":0.00006371481,"teacher_disagreement_score":0.8099094,"about_ca_system_score_codex":0.00024131466,"about_ca_system_score_gemma":0.00034335937,"threshold_uncertainty_score":0.54039776},"labels":[],"label_agreement":null},{"id":"W2090121147","doi":"10.1016/j.entcs.2004.01.021","title":"Probabilistic Guarded Commands Mechanized in HOL","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"University of Sydney; Macquarie University; Magdalen College, University of Oxford","keywords":"HOL; Correctness; Computer science; Probabilistic logic; Predicate transformer semantics; Automated theorem proving; Mutual exclusion; Proof assistant; Programming language; Theoretical computer science; Mathematical proof; Algorithm; Operational semantics; Artificial intelligence; Mathematics; Semantics (computer science)","score_opus":0.00939515989005353,"score_gpt":0.24850822638845638,"score_spread":0.23911306649840286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090121147","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.025880951,0.00018182596,0.96997714,0.0014483252,0.00034583829,0.0004873073,1.446217e-7,0.00016244629,0.0015160448],"genre_scores_gemma":[0.97547644,0.000008246507,0.023929399,0.00038670396,0.00013776598,0.000041796724,7.158823e-7,0.000010535937,0.000008407196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996167,0.00024497032,0.0005106407,0.00097268715,0.0006705059,0.0014341925],"domain_scores_gemma":[0.9982885,0.00044396694,0.00009088479,0.0009068561,0.00010346517,0.00016630293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034392502,0.00025770484,0.00036442938,0.0003816292,0.00018279995,0.000380175,0.002896068,0.000101528465,0.000027577673],"category_scores_gemma":[0.0002977924,0.00021354217,0.00007102761,0.002085721,0.0009935831,0.0006010751,0.0007696221,0.00052640785,0.00008188093],"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.000009787568,0.00014231828,0.0001732401,0.000008115563,0.0000021498852,0.000012869151,0.00054136553,0.0006069751,0.0003042495,0.954767,0.000004088283,0.04342787],"study_design_scores_gemma":[0.0005318678,0.00027660767,0.00023504738,0.000010584157,0.0000016589971,0.000037953047,0.0000026042321,0.42969194,0.0033982703,0.56530946,0.0002559105,0.0002480909],"about_ca_topic_score_codex":0.000022446804,"about_ca_topic_score_gemma":0.00010845915,"teacher_disagreement_score":0.94959545,"about_ca_system_score_codex":0.0005037222,"about_ca_system_score_gemma":0.00038544505,"threshold_uncertainty_score":0.8707997},"labels":[],"label_agreement":null},{"id":"W2091224100","doi":"10.1016/j.entcs.2014.06.003","title":"Non-deterministic Semantics in Polynomial Format","year":2014,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Modal logic; Semantics (computer science); Mathematics; Algebra over a field; Algebraic semantics; Polynomial; Discrete mathematics; Computer science; Modal; Calculus (dental); Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004740707857415193,"score_gpt":0.23440243660763127,"score_spread":0.22966172875021607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091224100","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.111880325,0.000046051937,0.88279074,0.00047042494,0.00062191096,0.00018532711,2.1332541e-7,0.000092358016,0.003912647],"genre_scores_gemma":[0.97928977,0.000010488539,0.020068256,0.00041817533,0.00018440306,0.000011492855,5.0558975e-7,0.000010868056,0.000006052527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964409,0.000135497,0.00045315662,0.0008718399,0.0005148019,0.0015838391],"domain_scores_gemma":[0.9980784,0.00068443595,0.00008803342,0.00086805463,0.00007611621,0.0002049428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026514924,0.00027253016,0.00035992524,0.0004138437,0.00021745703,0.0003919011,0.003156719,0.00010500089,0.000012091218],"category_scores_gemma":[0.0003967725,0.00023205145,0.0000763247,0.0015620436,0.0013929037,0.0006416146,0.0010956407,0.0005461494,0.000095013485],"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.00000910292,0.00009033667,0.0011329578,0.000010257632,0.0000013828859,0.000013004528,0.00064080517,0.00021453085,0.00017700913,0.9583812,0.000011627782,0.03931782],"study_design_scores_gemma":[0.0005044303,0.00041920313,0.002645356,0.00004075643,0.0000019455229,0.00004722058,0.0000018530958,0.8080128,0.0020350819,0.18583383,0.00016355449,0.00029401897],"about_ca_topic_score_codex":0.0000099724175,"about_ca_topic_score_gemma":0.000037560865,"teacher_disagreement_score":0.8674094,"about_ca_system_score_codex":0.0003027493,"about_ca_system_score_gemma":0.000404381,"threshold_uncertainty_score":0.94627833},"labels":[],"label_agreement":null},{"id":"W2099691160","doi":"10.1016/j.entcs.2006.12.012","title":"Distributed Measurement-based Quantum Computation","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Quantum computer; Operational semantics; Equivalence (formal languages); Probabilistic logic; Quantum; Semantics (computer science); Algorithm; Mathematics; Discrete mathematics; Programming language; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.01126227020785206,"score_gpt":0.26694310119865605,"score_spread":0.25568083099080396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099691160","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.12129894,0.000014138429,0.87787986,0.00033215914,0.00009826497,0.00016321059,0.0000042608617,0.00003630706,0.00017285766],"genre_scores_gemma":[0.99603736,2.236759e-7,0.0037448911,0.00008746083,0.00009694533,0.000010492916,0.000013982842,0.0000085221955,1.12420345e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980359,0.00003534094,0.0002745648,0.00040048573,0.00050807424,0.00074561243],"domain_scores_gemma":[0.9992038,0.00020831052,0.00006560769,0.00023843064,0.00016554278,0.000118325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024069229,0.00013492124,0.00013396333,0.00012395681,0.00022724406,0.00008841828,0.00043323124,0.000026072863,0.000052823656],"category_scores_gemma":[0.000029386743,0.00012464738,0.000050684637,0.00096143456,0.00049627054,0.00009302278,0.00007771299,0.0002444123,0.00002329618],"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.0000089092855,0.00012195403,0.0003774753,0.0000015811148,0.000002711302,5.252401e-7,0.00001851105,0.0006281985,0.0015290084,0.977357,0.000003893364,0.019950291],"study_design_scores_gemma":[0.00021484001,0.00006557549,0.00072267925,0.000010695226,0.0000029611228,3.7636656e-7,0.0000040094696,0.43681526,0.010978645,0.55104405,0.000034279183,0.00010664558],"about_ca_topic_score_codex":0.000015656287,"about_ca_topic_score_gemma":0.0000049472073,"teacher_disagreement_score":0.87473845,"about_ca_system_score_codex":0.00019343526,"about_ca_system_score_gemma":0.00026908578,"threshold_uncertainty_score":0.5082973},"labels":[],"label_agreement":null},{"id":"W2125004756","doi":"10.1016/j.entcs.2004.11.012","title":"Algebra and Sequent Calculus for Epistemic Actions","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sequent calculus; Sequent; Proof calculus; Mathematics; Cut-elimination theorem; Calculus (dental); Constructive; Algebra over a field; Semantics (computer science); Algebraic semantics; Natural deduction; Computer science; Discrete mathematics; Pure mathematics; Mathematical proof; Programming language","score_opus":0.012084311959250749,"score_gpt":0.27192947919433375,"score_spread":0.259845167235083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125004756","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.04385709,0.00043239834,0.9506921,0.0033283525,0.00026815734,0.00028472484,7.555474e-7,0.00012632825,0.0010100659],"genre_scores_gemma":[0.9338564,0.000032380816,0.06540912,0.0004578925,0.00018661754,0.000034846318,5.893302e-7,0.000007895017,0.000014208214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974427,0.00007573452,0.00027330578,0.0008128818,0.00030393823,0.001091435],"domain_scores_gemma":[0.99847686,0.0006344407,0.000043553195,0.00052694627,0.00010742915,0.0002107504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015004622,0.00019517317,0.00021763369,0.00019446197,0.00038289826,0.00030671625,0.0013898708,0.000072559786,0.000012507914],"category_scores_gemma":[0.00024374927,0.00016308793,0.000066852874,0.00078829937,0.0013158267,0.0005872134,0.0005435918,0.00029091752,0.000023596065],"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.0000052295204,0.000050799117,0.000078271936,0.000005562332,0.0000029010985,0.0000012473863,0.00033436716,0.00012936069,0.0005833266,0.91636467,0.000010865684,0.0824334],"study_design_scores_gemma":[0.00039522717,0.00028621682,0.00035152238,0.000019622146,0.000004105259,0.00008692311,0.000002339398,0.6631679,0.008254357,0.3261124,0.0010814938,0.00023787015],"about_ca_topic_score_codex":0.0000049915857,"about_ca_topic_score_gemma":0.00002726134,"teacher_disagreement_score":0.8899994,"about_ca_system_score_codex":0.00039106008,"about_ca_system_score_gemma":0.00036374127,"threshold_uncertainty_score":0.66505325},"labels":[],"label_agreement":null},{"id":"W2146838639","doi":"10.1016/j.entcs.2007.09.019","title":"Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":33,"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 Ottawa","funders":"","keywords":"Computer science; HOL; Syntax; Programming language; Abstract syntax; Variety (cybernetics); Logical framework; Representation (politics); Artificial intelligence; Theoretical computer science","score_opus":0.02692483528903797,"score_gpt":0.2744474474135393,"score_spread":0.24752261212450136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146838639","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.0392691,0.00025286156,0.95770353,0.00014556151,0.0010890543,0.0004909795,0.0000011016502,0.00026644714,0.000781348],"genre_scores_gemma":[0.83378774,0.000003592199,0.16578265,0.000100849276,0.00026647662,0.000031317628,0.0000010705226,0.000017874889,0.00000842638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958312,0.00011502405,0.0005318707,0.0011407179,0.00073221425,0.0016489876],"domain_scores_gemma":[0.9978787,0.0005910946,0.00018251124,0.00085958734,0.00026486834,0.00022329239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002421193,0.00032147497,0.00042030145,0.000278238,0.0007297271,0.0003731798,0.0023766397,0.00007859469,0.000008378901],"category_scores_gemma":[0.00018962898,0.0002737724,0.00012089057,0.0013603752,0.0013161283,0.00070334907,0.00054299016,0.00039016854,0.000024578638],"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.000012253965,0.000059985286,0.00019927823,0.00003054418,0.000008415766,0.000053732154,0.0001974666,0.0008926832,0.00048288185,0.9873031,0.0000033169274,0.01075637],"study_design_scores_gemma":[0.0009333141,0.00037758818,0.00053209584,0.00006552064,0.000009247066,0.0008863826,0.00000891903,0.852271,0.0087643815,0.13536566,0.00018623672,0.00059963093],"about_ca_topic_score_codex":0.00009141527,"about_ca_topic_score_gemma":0.000007722214,"teacher_disagreement_score":0.8519374,"about_ca_system_score_codex":0.00063440617,"about_ca_system_score_gemma":0.0007743892,"threshold_uncertainty_score":0.99997145},"labels":[],"label_agreement":null},{"id":"W2158464066","doi":"10.1016/s1571-0661(03)50004-4","title":"Towards the Correctness of Security Protocols","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Authentication Protocols Security","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":"Université Laval","funders":"","keywords":"Computer science; Correctness; Cryptographic protocol; Secrecy; Protocol (science); Theoretical computer science; Mathematical proof; Completeness (order theory); Cryptographic primitive; Cryptography; Type safety; Computer security; Programming language; Mathematics","score_opus":0.01217210551762005,"score_gpt":0.30075313010209914,"score_spread":0.2885810245844791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158464066","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.005262346,0.000029940067,0.9822404,0.00056029647,0.00016189752,0.010564641,6.160293e-7,0.000078374534,0.0011014885],"genre_scores_gemma":[0.95724076,0.0000018009703,0.038520887,0.00019758231,0.000021233935,0.0040085753,1.5887989e-7,0.000007801655,0.000001180653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965652,0.00042142504,0.0004925517,0.00074640545,0.00084023445,0.00093414634],"domain_scores_gemma":[0.9974476,0.00060545723,0.0001788285,0.0013947474,0.00025682244,0.00011652828],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0038634513,0.0002093816,0.00027043626,0.0001585506,0.00025217628,0.00017584319,0.003764228,0.00006157497,0.000038982253],"category_scores_gemma":[0.0009445782,0.00014748101,0.000076227865,0.0024419914,0.002911448,0.0006002727,0.00063637306,0.0005063338,0.000012750215],"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.000006919336,0.00013723153,0.00017113633,0.000012478516,0.0000020182324,0.0000015147081,0.0008891217,0.00017004926,0.00024200705,0.9808145,7.715984e-7,0.017552236],"study_design_scores_gemma":[0.0002746178,0.00019991036,0.00022425913,0.000036231686,0.0000012936594,0.000024887682,0.000005196334,0.120583326,0.069578275,0.80875105,0.00016334251,0.00015759422],"about_ca_topic_score_codex":0.0000036735473,"about_ca_topic_score_gemma":0.0000043084356,"teacher_disagreement_score":0.95197845,"about_ca_system_score_codex":0.00019911551,"about_ca_system_score_gemma":0.0008454261,"threshold_uncertainty_score":0.99980205},"labels":[],"label_agreement":null},{"id":"W2160243077","doi":"10.1016/j.entcs.2011.11.017","title":"Proving Reachability in B using Substitution Refinement","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Substitution (logic); Computer science; Statement (logic); State (computer science); Construct (python library); Property (philosophy); Programming language; Scheme (mathematics); Theoretical computer science; Mathematics; Law","score_opus":0.030907949543989392,"score_gpt":0.2734806031087783,"score_spread":0.2425726535647889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160243077","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.3548262,0.00004359534,0.6441636,0.00011535075,0.00022086421,0.00015507801,8.8216986e-8,0.00006706152,0.000408139],"genre_scores_gemma":[0.84082085,0.000003585978,0.159012,0.000112519905,0.000038697803,0.00000772343,2.3151586e-7,0.0000040977857,2.8344695e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712205,0.00018955195,0.00046055624,0.000878577,0.0004470848,0.0009021895],"domain_scores_gemma":[0.9987134,0.00023455433,0.000093541115,0.00076810777,0.00009384233,0.00009655248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038050725,0.00016449257,0.00018572318,0.0003560979,0.00022659423,0.00014222505,0.001848679,0.00006493833,0.000019514357],"category_scores_gemma":[0.00028205558,0.0001596062,0.000040937935,0.0019955277,0.0010950079,0.0007215817,0.0006547209,0.00042806318,0.00000826317],"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.000007100958,0.00016020956,0.0023602203,0.000007202504,9.286415e-7,0.0000055725304,0.0013045395,0.00066605996,0.00049891573,0.97167397,1.191613e-7,0.02331518],"study_design_scores_gemma":[0.00018897784,0.00010900064,0.0063402005,0.000045574652,0.0000010222869,0.000018155046,0.000004530921,0.7513274,0.007944617,0.2338304,0.00001172014,0.00017839001],"about_ca_topic_score_codex":0.00012413747,"about_ca_topic_score_gemma":0.00003625635,"teacher_disagreement_score":0.7506614,"about_ca_system_score_codex":0.00070165313,"about_ca_system_score_gemma":0.0004800561,"threshold_uncertainty_score":0.6508552},"labels":[],"label_agreement":null},{"id":"W2160698486","doi":"10.1016/j.entcs.2009.07.036","title":"S&D Pattern Deployment at Organizational Level: A Prototype for Remote Healthcare System","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Dependability; Software deployment; Computer science; Process (computing); Process management; System deployment; Health care; Computer security; Resource (disambiguation); Knowledge management; Business; Software engineering","score_opus":0.012677058464708494,"score_gpt":0.265783818383173,"score_spread":0.2531067599184645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160698486","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.028346851,0.00013366187,0.9626128,0.0072458903,0.00030507613,0.0009906534,0.0000043873097,0.00026465277,0.00009602165],"genre_scores_gemma":[0.89306504,0.0000041337016,0.10336323,0.0033596673,0.00016106367,0.000021815182,0.000007871993,0.000014041762,0.0000031643272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641997,0.00012928352,0.00042630968,0.0010556296,0.00075212785,0.0012167034],"domain_scores_gemma":[0.99824035,0.0002835679,0.00011372167,0.000836331,0.00029721245,0.00022879521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011385113,0.00027335575,0.00027697466,0.0002670284,0.0004715122,0.00023406275,0.0024058488,0.000085914595,0.000009140339],"category_scores_gemma":[0.00003959874,0.00023051692,0.000069807524,0.0017592937,0.00027127672,0.00030198644,0.00056292006,0.00028120595,0.000033421486],"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.000036676876,0.0000561058,0.00024550347,0.000051789986,0.0000044282865,0.0000046085115,0.0007970867,0.00031886046,0.00039671626,0.91214997,0.00000328577,0.08593497],"study_design_scores_gemma":[0.0009496904,0.0016072126,0.0022119062,0.00023591853,0.0000077148015,0.00016357175,0.000007922799,0.7134408,0.012041626,0.26804274,0.0007027541,0.00058817415],"about_ca_topic_score_codex":0.000033935088,"about_ca_topic_score_gemma":0.00019094042,"teacher_disagreement_score":0.86471814,"about_ca_system_score_codex":0.0006581476,"about_ca_system_score_gemma":0.0004599607,"threshold_uncertainty_score":0.9400207},"labels":[],"label_agreement":null},{"id":"W2164027106","doi":"10.1016/s1571-0661(04)80561-9","title":"Induction, Coinduction, and Adjoints","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Functor; Subcategory; Cartesian product; Adjoint functors; Coalgebra; Commutative property; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.01330354852734839,"score_gpt":0.27284158193229985,"score_spread":0.25953803340495146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164027106","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.8397648,0.000090396694,0.15844056,0.0002533653,0.00065930624,0.00014695004,1.2751225e-7,0.00004583833,0.00059864775],"genre_scores_gemma":[0.9900011,0.000010587359,0.009788608,0.00008613887,0.00009373755,0.0000061870323,1.10760695e-7,0.000009685314,0.0000038539392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983854,0.0001008956,0.00022118326,0.0004291364,0.00031866066,0.00054470805],"domain_scores_gemma":[0.99917936,0.00030543213,0.00004691713,0.0002898427,0.00007984948,0.00009861956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011143232,0.00013601923,0.00017091159,0.00011767289,0.00020439584,0.000077715114,0.000264139,0.000067467416,0.00007832817],"category_scores_gemma":[0.00074501795,0.00011361757,0.000025145111,0.0005972859,0.0012749651,0.00018165355,0.00009677532,0.00031205022,0.000003638489],"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.000004830242,0.00002727815,0.00014548686,0.000004104411,0.0000026743926,9.4186777e-7,0.00017176711,0.000008693305,0.000098701305,0.99617803,0.000005692525,0.0033517957],"study_design_scores_gemma":[0.0002635985,0.00012321906,0.00024343128,0.000012804181,0.000004392411,0.00007408019,0.0000086413165,0.0013803435,0.004724035,0.9929676,0.00005671426,0.00014114482],"about_ca_topic_score_codex":0.0000027523522,"about_ca_topic_score_gemma":0.0000024097437,"teacher_disagreement_score":0.1502363,"about_ca_system_score_codex":0.00012881082,"about_ca_system_score_gemma":0.00017830564,"threshold_uncertainty_score":0.46976623},"labels":[],"label_agreement":null},{"id":"W2164875685","doi":"10.1016/j.entcs.2004.09.018","title":"Labelled Markov Processes: Stronger and Faster Approximations","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Markov chain; Approximations of π; Markov process; Computer science; Markov model; Mathematics; Applied mathematics; Theoretical computer science; Algorithm; Statistics; Machine learning","score_opus":0.0054589061409852846,"score_gpt":0.23772920318290433,"score_spread":0.23227029704191904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164875685","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.032628134,0.0002630241,0.96518916,0.0011011348,0.00012966318,0.00025402816,0.0000021490018,0.00010398157,0.00032872762],"genre_scores_gemma":[0.72154933,0.000019407895,0.2781866,0.00017269407,0.000039552837,0.000021997754,0.0000010809805,0.0000061025858,0.0000032351122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976321,0.00005377905,0.0002921346,0.0007652034,0.00042373646,0.0008330769],"domain_scores_gemma":[0.9988217,0.00024370757,0.00006526775,0.0005985693,0.0001257942,0.0001449967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087742525,0.0001954212,0.00021273192,0.00019817636,0.00029844817,0.00021564099,0.00090465107,0.000044767872,0.000009365118],"category_scores_gemma":[0.00021738885,0.00015956482,0.000023424207,0.0013989516,0.0014344066,0.0013735448,0.00074329076,0.00027189963,0.000014677672],"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.000004711758,0.000047599755,0.00006455965,0.000022622145,0.000002288416,0.0000053321746,0.00052595144,0.00044068738,0.00026068834,0.9839946,8.228146e-7,0.014630108],"study_design_scores_gemma":[0.001710427,0.0006342086,0.0005962407,0.0002464474,0.0000067997853,0.00020380551,0.000039581675,0.16645294,0.012665449,0.8159053,0.0007259657,0.0008128773],"about_ca_topic_score_codex":0.000007961057,"about_ca_topic_score_gemma":0.00002589774,"teacher_disagreement_score":0.6889212,"about_ca_system_score_codex":0.00016230166,"about_ca_system_score_gemma":0.00052913727,"threshold_uncertainty_score":0.65068644},"labels":[],"label_agreement":null},{"id":"W2167556674","doi":"10.1016/j.entcs.2007.09.020","title":"Focusing the Inverse Method for LF: A Preliminary Report","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Correctness; Mathematical proof; Computer science; Horn clause; Calculus (dental); Programming language; Inverse; Logic programming; Theoretical computer science; Mathematics; Algorithm","score_opus":0.020030619559419087,"score_gpt":0.2889938892297287,"score_spread":0.2689632696703096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167556674","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.00456926,0.00016966117,0.9916077,0.0017364006,0.0006153881,0.00058230653,1.3949798e-7,0.00014485772,0.00057425734],"genre_scores_gemma":[0.7773533,0.000006255612,0.22196834,0.00040507285,0.00018522542,0.000053248164,5.518369e-7,0.000008964958,0.00001906387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966557,0.00023162636,0.00043501853,0.0009284136,0.00058972125,0.0011595425],"domain_scores_gemma":[0.9972079,0.0012592608,0.0001461576,0.0010818901,0.00017256151,0.00013224357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049075023,0.00021514819,0.0002656655,0.00017164234,0.00075750885,0.00023534978,0.0025533251,0.000079330544,0.000004847264],"category_scores_gemma":[0.0005800688,0.00014320275,0.00012327274,0.0013186381,0.0017205232,0.0004838514,0.0007702786,0.0003612882,0.000013119461],"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.000014640597,0.000052994703,0.00016472068,0.0000071550053,0.000005191434,0.00008503354,0.000948802,0.00025452964,0.00013438215,0.954845,0.000044666853,0.04344288],"study_design_scores_gemma":[0.000249118,0.0005007833,0.00027804665,0.0000059774543,0.000004467804,0.0014524471,0.0000050776403,0.5109042,0.0027052157,0.4824258,0.0012650465,0.00020383313],"about_ca_topic_score_codex":0.00003482651,"about_ca_topic_score_gemma":0.000019036916,"teacher_disagreement_score":0.77278405,"about_ca_system_score_codex":0.00020549691,"about_ca_system_score_gemma":0.0006375303,"threshold_uncertainty_score":0.63393396},"labels":[],"label_agreement":null},{"id":"W2395895598","doi":"10.1016/s1571-0661(05)80579-1","title":"Preface","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Programming language; Computer science; Metalanguage; Semantics (computer science); Variable (mathematics); Operational semantics; ENCODE; Theoretical computer science; Mathematics","score_opus":0.00990933206034021,"score_gpt":0.25187493522481624,"score_spread":0.24196560316447605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395895598","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.014250883,0.00024290041,0.97894,0.00089396833,0.0005357931,0.00022175912,5.3215555e-8,0.00023378029,0.0046808557],"genre_scores_gemma":[0.9832092,0.000024199138,0.01623085,0.0003481196,0.00014008481,0.000014851815,3.1729786e-7,0.000008065931,0.000024302464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967048,0.00012990175,0.00030946863,0.0008738568,0.0006368858,0.0013450806],"domain_scores_gemma":[0.99848014,0.00028009934,0.00006665935,0.00088883773,0.00009787462,0.00018640189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054465,0.00020237977,0.00022416926,0.00022526726,0.00024994102,0.00044161297,0.00295891,0.000072895324,0.000034144643],"category_scores_gemma":[0.00015063219,0.00016319695,0.000063838146,0.0020117874,0.0011956148,0.0006555118,0.0007486355,0.00036742285,0.0001441319],"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.0000042158927,0.00005987147,0.0007940508,0.0000028779198,0.0000021093956,0.000022926331,0.00023763767,0.00012272681,0.00013352674,0.91362804,0.000005625134,0.08498637],"study_design_scores_gemma":[0.00027051062,0.00034000978,0.00075346004,0.000005409663,0.0000015866351,0.00014328724,0.000002324512,0.23632061,0.0020578976,0.75754195,0.0022950557,0.00026786354],"about_ca_topic_score_codex":0.000017562734,"about_ca_topic_score_gemma":0.0000141687515,"teacher_disagreement_score":0.9689583,"about_ca_system_score_codex":0.00023005907,"about_ca_system_score_gemma":0.00030371762,"threshold_uncertainty_score":0.66549784},"labels":[],"label_agreement":null},{"id":"W2481044","doi":"10.1016/s1571-0661(05)80344-5","title":"Preface","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Context (archaeology); The Internet; Computer security; IBM; World Wide Web","score_opus":0.008260259905129106,"score_gpt":0.22225930992585527,"score_spread":0.21399905002072617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481044","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.0136581715,0.00032304652,0.9794437,0.0019839408,0.0004013701,0.00032266858,1.8705114e-7,0.00024133208,0.0036255254],"genre_scores_gemma":[0.9369059,0.00004903125,0.061800186,0.0010863072,0.00009731289,0.000029066014,2.3635798e-7,0.000010196227,0.00002176733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960628,0.00015288444,0.00034292144,0.001092968,0.00082604913,0.0015223575],"domain_scores_gemma":[0.9979629,0.00038531618,0.00006856275,0.0013178511,0.000064133565,0.00020124792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001693259,0.00023564845,0.00021500181,0.00031107967,0.00024160845,0.00039418202,0.0039116335,0.000051684936,0.00022948538],"category_scores_gemma":[0.00010514662,0.00021262732,0.00006635672,0.0024856802,0.0011823352,0.0007015576,0.0014044188,0.00041356796,0.00028798054],"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.0000017832232,0.00007296598,0.00007552328,0.0000036028925,0.0000027377712,0.000018166891,0.00014278712,0.003467326,0.000057907164,0.8418419,0.00008498149,0.15423033],"study_design_scores_gemma":[0.00025533015,0.00024652755,0.00020852877,0.00001911148,0.0000020267246,0.000015881973,6.9036753e-7,0.8667018,0.0017650378,0.12936871,0.0011664637,0.0002499268],"about_ca_topic_score_codex":0.0000041892945,"about_ca_topic_score_gemma":0.000004804589,"teacher_disagreement_score":0.92324775,"about_ca_system_score_codex":0.00050655176,"about_ca_system_score_gemma":0.000101304075,"threshold_uncertainty_score":0.867069},"labels":[],"label_agreement":null},{"id":"W2528395280","doi":"10.1016/j.entcs.2016.09.032","title":"Categorical Models of the Differential λ-Calculus Revisited","year":2016,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Categorical variable; Calculus (dental); Differential calculus; Mathematics; Differential (mechanical device); Algebra over a field; Computer science; Pure mathematics; Medicine; Statistics","score_opus":0.010765571952055103,"score_gpt":0.23621685046220375,"score_spread":0.22545127851014865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528395280","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.012919597,0.00010790391,0.9846234,0.0010149692,0.00046845354,0.00022863148,2.5942867e-7,0.00006957395,0.0005672508],"genre_scores_gemma":[0.99765265,0.000011595581,0.0021184608,0.00009782907,0.00009233683,0.000009501344,1.194468e-7,0.000006776383,0.000010711864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705136,0.00023147966,0.00040052005,0.00067400147,0.0007375898,0.0009050703],"domain_scores_gemma":[0.9981952,0.00040748247,0.000119671604,0.0010240435,0.0001351093,0.000118529744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012062874,0.00018257007,0.00027378288,0.00013236856,0.00017196394,0.00013027823,0.0033668713,0.000077267265,0.000017829963],"category_scores_gemma":[0.00017872827,0.00008882733,0.00011879235,0.0013941047,0.0018742809,0.00042237013,0.0011626639,0.00023276986,0.000015200094],"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.0000055462333,0.000057452748,0.00016545191,0.0000053223025,0.0000034924494,0.0000021987014,0.00013111127,0.000039013692,0.0014222737,0.95001996,0.0000039065153,0.048144266],"study_design_scores_gemma":[0.00029158677,0.00016075761,0.00038619523,0.0000126894665,0.0000031416077,0.00002428924,6.098497e-7,0.21791394,0.009665294,0.7713472,0.000048740254,0.00014553455],"about_ca_topic_score_codex":0.000012205054,"about_ca_topic_score_gemma":0.000003879684,"teacher_disagreement_score":0.98473305,"about_ca_system_score_codex":0.00019796948,"about_ca_system_score_gemma":0.00027967885,"threshold_uncertainty_score":0.69058657},"labels":[],"label_agreement":null},{"id":"W2529791593","doi":"10.1016/j.entcs.2016.09.030","title":"The Shuffle Quasimonad and Modules with Differentiation and Integration","year":2016,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Topics in Algebra","field":"Mathematics","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 Calgary; University of Ottawa","funders":"","keywords":"Monad (category theory); Mathematics; Multiplication (music); Category theory; Differential (mechanical device); Algebra over a field; Differential algebra; Differential calculus; Algebraic structure; Pure mathematics; Categorical variable; Algebraic number; Chain rule (probability); Discrete mathematics; Functor; Combinatorics","score_opus":0.009130772844529553,"score_gpt":0.2667705334765329,"score_spread":0.25763976063200333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529791593","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.41938913,0.000054518354,0.5794781,0.0009126255,0.000026285494,0.00008263712,1.8634313e-7,0.000016594813,0.000039909697],"genre_scores_gemma":[0.9717475,0.000060884697,0.028109638,0.00002959653,0.000031694562,0.000009229293,9.782668e-8,0.0000063908096,0.0000049427495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897164,0.000057688252,0.00013417457,0.00027994646,0.00022149054,0.0003350753],"domain_scores_gemma":[0.99797916,0.0016623851,0.000043834632,0.00022455955,0.00004596434,0.000044102948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000635891,0.000096627875,0.00009271706,0.000046246576,0.00021438989,0.00008892368,0.00022250603,0.000022499167,0.000003619275],"category_scores_gemma":[0.00046298682,0.000044488803,0.0000073013834,0.00016874334,0.0019747962,0.00018945175,0.0001326696,0.00012664353,7.7460817e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016669055,0.000013478909,0.0002915218,0.0000022910538,0.0000015789637,4.1332726e-7,0.00008540754,6.057107e-7,0.00065636693,0.89221567,4.1787283e-7,0.106715605],"study_design_scores_gemma":[0.0002283678,0.0002551602,0.0019856873,0.000042052638,0.000002995783,0.000011130468,0.0000048910574,0.013393167,0.006495254,0.97749436,0.000005952327,0.00008099574],"about_ca_topic_score_codex":9.917599e-7,"about_ca_topic_score_gemma":0.00006048056,"teacher_disagreement_score":0.5523584,"about_ca_system_score_codex":0.00008677574,"about_ca_system_score_gemma":0.00003614448,"threshold_uncertainty_score":0.7276219},"labels":[],"label_agreement":null},{"id":"W2567056009","doi":"10.1016/j.entcs.2016.12.010","title":"Visual Impairment Simulator Based on the Hadamard Product","year":2016,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Headset; Computer science; Hemianopsia; Visual impairment; Computer vision; Artificial intelligence; Virtual reality; Set (abstract data type); Hadamard transform; Reading (process); Task (project management); Face (sociological concept); Computer graphics (images); Psychology; Visual field; Mathematics; Engineering","score_opus":0.0059418709917704055,"score_gpt":0.2797312955202128,"score_spread":0.2737894245284424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567056009","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.7024808,0.000043240663,0.2522918,0.044379856,0.00009375187,0.0002807619,4.6209345e-7,0.00006247599,0.00036689115],"genre_scores_gemma":[0.99669045,0.0000044116528,0.0011054565,0.0020129902,0.00014987582,0.000009149834,3.3506973e-7,0.000009566249,0.00001774746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997821,0.00011748236,0.00020171507,0.0005261079,0.00064314384,0.00069056486],"domain_scores_gemma":[0.998387,0.0008595392,0.000038124082,0.00050047727,0.00009032227,0.00012454927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019025633,0.00014882807,0.00019949803,0.00016206442,0.00014753551,0.00005862095,0.00037789714,0.000021972086,0.00014694793],"category_scores_gemma":[0.00068268384,0.00006630224,0.0000930497,0.0007696675,0.0017810679,0.000062893814,0.0000948506,0.00024453874,0.000053919775],"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.00065779896,0.0013037894,0.023404982,0.000030342335,0.00004330755,0.00006981631,0.00016291486,0.0019527808,0.024439787,0.7370975,0.0001248357,0.21071216],"study_design_scores_gemma":[0.00096340256,0.0020958062,0.0064942664,0.00028028485,0.000033782024,0.000022563327,0.000002905933,0.8980589,0.06880158,0.022800656,0.00021690289,0.00022893764],"about_ca_topic_score_codex":0.0000027510546,"about_ca_topic_score_gemma":5.1949166e-7,"teacher_disagreement_score":0.8961061,"about_ca_system_score_codex":0.00027491336,"about_ca_system_score_gemma":0.00034641373,"threshold_uncertainty_score":0.6562419},"labels":[],"label_agreement":null},{"id":"W2799453302","doi":"10.1016/j.entcs.2018.03.020","title":"A Categorical Characterization of Relative Entropy on Standard Borel Spaces","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Categorical variable; Convexity; Functor; Kullback–Leibler divergence; Borel set; Pure mathematics; Entropy (arrow of time); Uniqueness; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.005182343513983395,"score_gpt":0.25114512613217027,"score_spread":0.24596278261818688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799453302","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.27829328,0.0000023989653,0.7206388,0.00024297829,0.00014200191,0.00009374344,0.0000081520475,0.00000974485,0.00056885584],"genre_scores_gemma":[0.9960248,0.0000016478847,0.0036729223,0.000058865015,0.00022085795,0.0000057499938,0.000004826822,0.000007979957,0.0000023804732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984744,0.00006309797,0.00022405488,0.00035833407,0.00035751692,0.0005225536],"domain_scores_gemma":[0.9992403,0.0002543524,0.00007547466,0.00021260403,0.00012755473,0.00008970928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425148,0.00012727485,0.0001952333,0.00010134726,0.00011572292,0.000055519922,0.00031735137,0.000028404851,0.0003010853],"category_scores_gemma":[0.000067885325,0.000101626705,0.000038348808,0.00055081927,0.0009482172,0.00011851204,0.00010750021,0.00021886142,0.000024457002],"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.0000803593,0.00007158107,0.00048003218,0.0000015779772,0.000005999268,7.1071014e-7,0.00015397812,0.000006315522,0.004710212,0.97753215,0.000001706824,0.016955351],"study_design_scores_gemma":[0.00031236664,0.0012465212,0.0009758462,0.000020637197,0.000005824243,5.7191687e-7,0.0000039165857,0.14833641,0.04965212,0.799253,0.00007016702,0.00012262524],"about_ca_topic_score_codex":0.000008885198,"about_ca_topic_score_gemma":3.0491083e-7,"teacher_disagreement_score":0.7177315,"about_ca_system_score_codex":0.00009940736,"about_ca_system_score_gemma":0.00014533386,"threshold_uncertainty_score":0.41442168},"labels":[],"label_agreement":null},{"id":"W2964334533","doi":"10.1016/j.entcs.2018.03.025","title":"A Denotational Semantics for SPARC TSO","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Denotational semantics; Programming language; Modular design; Semantics (computer science); Denotational semantics of the Actor model; Normalisation by evaluation; Computer science; Operational semantics; Principle of compositionality; Theoretical computer science; Artificial intelligence","score_opus":0.00968326086108321,"score_gpt":0.2832651843296394,"score_spread":0.27358192346855614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964334533","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.0060595246,0.000038371436,0.990897,0.0016731903,0.00031083316,0.0002607386,6.6668423e-7,0.00028384614,0.0004758203],"genre_scores_gemma":[0.5686285,0.000003762896,0.43077955,0.00043157226,0.00013476395,0.0000121585035,7.1325087e-7,0.000005477548,0.0000034846532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975103,0.00007435655,0.00030862828,0.00072816527,0.00045999893,0.00091855595],"domain_scores_gemma":[0.9982647,0.0006220752,0.00007770405,0.00055587,0.00036380865,0.00011585805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018214084,0.00016985617,0.00018252418,0.0002992684,0.00040415186,0.00031898884,0.0021210804,0.0000611248,0.000013349482],"category_scores_gemma":[0.0003613058,0.00015670969,0.000057682824,0.0013554486,0.0016803513,0.00040250516,0.0005230131,0.00019596434,0.000022112608],"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.000008670522,0.000044815002,0.000082587,0.000003561859,0.0000023615667,0.0000011042862,0.00020753722,0.0010169208,0.00016324461,0.9775177,0.000043088952,0.020908386],"study_design_scores_gemma":[0.00016976509,0.0003186282,0.00015146655,0.000014697493,0.0000011876843,0.000012621339,4.2788002e-7,0.6075853,0.008173897,0.38326508,0.00017026128,0.00013667585],"about_ca_topic_score_codex":0.000002294526,"about_ca_topic_score_gemma":0.0000042045926,"teacher_disagreement_score":0.60656834,"about_ca_system_score_codex":0.00016312649,"about_ca_system_score_gemma":0.00043639148,"threshold_uncertainty_score":0.63904357},"labels":[],"label_agreement":null},{"id":"W2978207776","doi":"10.1016/j.entcs.2019.08.033","title":"On Coloring a Class of Claw-free Graphs","year":2019,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Chordal graph; Split graph; Graph coloring; 1-planar graph; Discrete mathematics; Line graph; Pathwidth; Vertex (graph theory); Edge coloring; Indifference graph; Graph; Graph power","score_opus":0.007934784732203454,"score_gpt":0.27098712578760303,"score_spread":0.2630523410553996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978207776","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.38406417,0.000054172644,0.6124892,0.00046847298,0.00029226695,0.00032127846,7.9275424e-7,0.00008326439,0.0022263525],"genre_scores_gemma":[0.9696909,0.000010773406,0.029992353,0.00025315714,0.000019650977,0.000013775358,2.4849987e-7,0.000012434689,0.0000067038945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957421,0.00023274196,0.00039469934,0.0010333087,0.0011765361,0.0014206426],"domain_scores_gemma":[0.9956101,0.0019436905,0.00010165722,0.0020035682,0.00016581774,0.00017515948],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0030329106,0.00023156193,0.00034944463,0.0007105001,0.0001385903,0.00012982824,0.0059187664,0.000078518206,0.00004475909],"category_scores_gemma":[0.00054205867,0.0002018151,0.00010476271,0.003441275,0.0023496414,0.0006318927,0.0017928624,0.00072046265,0.00006518716],"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.000052449857,0.00009915306,0.000452522,0.0000114856375,0.0000044534017,0.0000064842134,0.00014001201,0.0018935574,0.0026587637,0.9824999,0.0000026270052,0.012178577],"study_design_scores_gemma":[0.0005198424,0.0010210298,0.00044337878,0.00005073629,9.3075033e-7,0.00001057483,0.0000020132186,0.19296768,0.021748777,0.7830309,0.00001910405,0.0001849791],"about_ca_topic_score_codex":0.0000031846719,"about_ca_topic_score_gemma":0.0000037642976,"teacher_disagreement_score":0.5856267,"about_ca_system_score_codex":0.00025566813,"about_ca_system_score_gemma":0.00036891553,"threshold_uncertainty_score":0.9994597},"labels":[],"label_agreement":null},{"id":"W2995907685","doi":"10.1016/j.entcs.2019.09.004","title":"Bisimulation for Feller-Dynkin Processes","year":2019,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Discrete time and continuous time; Equivalence (formal languages); Generalization; Mathematics; Markov chain; Markov process; Time reversibility; Pure mathematics; Algebra over a field; Discrete mathematics; Markov property; Markov model; Mathematical analysis","score_opus":0.010950336446238763,"score_gpt":0.29327613781849843,"score_spread":0.28232580137225965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995907685","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.074527115,0.000067556604,0.92331576,0.00045786973,0.000492984,0.0006018376,5.0389946e-7,0.00012955902,0.00040679448],"genre_scores_gemma":[0.61711514,0.000005321415,0.38263997,0.00015763432,0.000045766134,0.00002504972,8.124537e-7,0.00000662525,0.0000036673275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972993,0.00010049774,0.00033351802,0.0008426598,0.00052431563,0.00089972443],"domain_scores_gemma":[0.99781823,0.0009391311,0.000098726916,0.00078735745,0.0002677065,0.0000888477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002899177,0.0001740628,0.0002006949,0.0003006209,0.00017367571,0.00029053708,0.0022832947,0.0000727531,0.000019139163],"category_scores_gemma":[0.0007648656,0.00015522228,0.000046952504,0.0021823023,0.0005894932,0.0011244228,0.00039252534,0.00023614877,0.000058093436],"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.000015310161,0.000042524927,0.00030917278,0.000028884657,0.0000015590832,2.7456886e-7,0.00020202123,0.0034053673,0.0006579298,0.93702936,0.0000012589275,0.058306314],"study_design_scores_gemma":[0.00025370653,0.00031235116,0.0004908325,0.000023442255,0.0000011340014,0.000005356267,9.942289e-7,0.6676727,0.018861167,0.3119974,0.00022098619,0.00015991775],"about_ca_topic_score_codex":0.0000028740624,"about_ca_topic_score_gemma":0.0000026887017,"teacher_disagreement_score":0.66426736,"about_ca_system_score_codex":0.00025332524,"about_ca_system_score_gemma":0.00052970235,"threshold_uncertainty_score":0.6329781},"labels":[],"label_agreement":null},{"id":"W3093622937","doi":"10.1016/j.entcs.2020.09.004","title":"Towards a Classification of Behavioural Equivalences in Continuous-time Markov Processes","year":2020,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Equivalence (formal languages); Mathematics; Interpretation (philosophy); Theoretical computer science; Semantics (computer science); Algebra over a field; Computer science; Pure mathematics; Programming language","score_opus":0.030788265707390784,"score_gpt":0.29334818792738837,"score_spread":0.2625599222199976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093622937","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.2105187,0.00010946896,0.78693014,0.0015911468,0.00009656849,0.0002553877,0.0000010305281,0.0000770499,0.00042050966],"genre_scores_gemma":[0.7485078,0.000015307802,0.25127435,0.00015138411,0.000026849804,0.00001727277,7.3178245e-7,0.0000056799186,6.5542673e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691844,0.00025549566,0.0005833002,0.00078664726,0.0007056066,0.00075053266],"domain_scores_gemma":[0.9986038,0.00035798983,0.00018619909,0.00049887126,0.00021951682,0.0001336297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485706,0.00018655168,0.00031946754,0.00025840566,0.00007709239,0.00014778205,0.0028970407,0.000077616685,0.00002888549],"category_scores_gemma":[0.0014133352,0.00016896627,0.000044585726,0.003231212,0.0016136818,0.0009913823,0.000551757,0.000369097,0.000014992644],"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.000031321204,0.00010179711,0.0031700279,0.00004247414,0.0000017399819,0.000003504342,0.0012140162,0.00012156407,0.006128417,0.8988722,0.000001509548,0.09031143],"study_design_scores_gemma":[0.0003398461,0.00068513723,0.02004778,0.000078437806,0.0000034579639,0.000011551194,0.000013226017,0.85499245,0.055270247,0.06828202,0.000010432938,0.00026539317],"about_ca_topic_score_codex":0.000013124052,"about_ca_topic_score_gemma":0.000004314755,"teacher_disagreement_score":0.8548709,"about_ca_system_score_codex":0.00018773753,"about_ca_system_score_gemma":0.0007598436,"threshold_uncertainty_score":0.68902445},"labels":[],"label_agreement":null},{"id":"W4213325903","doi":"10.1016/s1571-0661(05)80487-6","title":"Preface","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Software engineering; Notation; Event (particle physics); Popularity; Software development; Rotation formalisms in three dimensions; Software; Programming language; Mathematics","score_opus":0.017528815308889424,"score_gpt":0.2667824920485299,"score_spread":0.24925367673964047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213325903","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.005979972,0.00038111024,0.9912761,0.00085641886,0.00042799136,0.00012892508,1.7207311e-7,0.0004989208,0.0004503882],"genre_scores_gemma":[0.5699509,0.000022302542,0.42982757,0.0001456764,0.000035581546,0.0000071129084,5.1590053e-8,0.000005913214,0.0000049036603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711186,0.00013806263,0.00025332725,0.0008018517,0.0005024121,0.0011924738],"domain_scores_gemma":[0.9974304,0.0013956878,0.000043877546,0.00093317,0.000064997934,0.00013188871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016537827,0.00019937738,0.00021405634,0.0002590024,0.00016101428,0.00018260228,0.0029475936,0.000060055463,0.00003984497],"category_scores_gemma":[0.0011304612,0.00017802714,0.00004752005,0.0018568716,0.0012320615,0.0007917566,0.0008702446,0.00047380984,0.00007542926],"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.0000011911565,0.0000316946,0.00004021937,0.0000029012926,0.0000013818307,0.00000923452,0.00024053466,0.016865956,0.00031456252,0.8697842,0.000004881804,0.11270328],"study_design_scores_gemma":[0.0001423445,0.00015412885,0.0002180884,0.000013337308,7.628036e-7,0.000034137043,6.409081e-7,0.5299,0.0064441804,0.46277168,0.000107329644,0.0002133375],"about_ca_topic_score_codex":0.0000010608763,"about_ca_topic_score_gemma":7.543021e-7,"teacher_disagreement_score":0.5639709,"about_ca_system_score_codex":0.0002624907,"about_ca_system_score_gemma":0.000066106564,"threshold_uncertainty_score":0.7259736},"labels":[],"label_agreement":null},{"id":"W4231496788","doi":"10.1016/s1571-0661(05)82622-2","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Parsing; Gratitude; Programming language; Compiler; Software engineering","score_opus":0.005166389861819994,"score_gpt":0.2582236165892906,"score_spread":0.2530572267274706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231496788","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.006148639,0.00091153436,0.99035186,0.00059738196,0.0002100231,0.0001562564,1.2478496e-7,0.0003939067,0.0012302867],"genre_scores_gemma":[0.5899513,0.0000062805984,0.40970883,0.0003016728,0.000016692806,0.0000068060635,8.808586e-8,0.0000051521697,0.000003238148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709904,0.00015527544,0.0002511216,0.00081703067,0.0005710918,0.0011064541],"domain_scores_gemma":[0.99854827,0.000323497,0.00005655104,0.0008329117,0.00010386419,0.00013493537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022279525,0.00019166146,0.00018358564,0.00027120797,0.00020494415,0.00036238367,0.002832165,0.00007090011,0.000027060787],"category_scores_gemma":[0.00058938895,0.00015955407,0.000044616478,0.0021017639,0.0011614064,0.0008213278,0.0005158567,0.0005090355,0.000027723148],"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.000001672443,0.000035680023,0.000077008925,0.0000033126114,9.792934e-7,0.000009218816,0.0001303132,0.000030176763,0.0010702921,0.9653331,0.0000041219078,0.033304118],"study_design_scores_gemma":[0.0001283008,0.00013676517,0.000035645502,0.000021796517,9.3247985e-7,0.000060841827,7.0712844e-7,0.06143002,0.103418455,0.834394,0.00016025768,0.00021232794],"about_ca_topic_score_codex":0.0000030196197,"about_ca_topic_score_gemma":0.0000025180575,"teacher_disagreement_score":0.58380264,"about_ca_system_score_codex":0.00027260656,"about_ca_system_score_gemma":0.00044831014,"threshold_uncertainty_score":0.65064263},"labels":[],"label_agreement":null},{"id":"W4234644336","doi":"10.1016/s1571-0661(05)80010-6","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language","score_opus":0.0066518300760790025,"score_gpt":0.23989979024881028,"score_spread":0.23324796017273128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234644336","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.021646557,0.00036264546,0.9586011,0.0003634636,0.0005318409,0.0001730929,1.4243113e-7,0.0001755751,0.018145563],"genre_scores_gemma":[0.9382566,0.000018276722,0.061289836,0.00033634444,0.000056840036,0.000011016246,1.7297373e-7,0.000008379685,0.000022525435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648994,0.00022365023,0.00028826843,0.0009791688,0.0005622076,0.0014567797],"domain_scores_gemma":[0.9981758,0.0004955841,0.00005996781,0.00093142485,0.00011464501,0.00022258116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025206401,0.00023210394,0.00023823947,0.00022745389,0.000294828,0.00036185142,0.0027187064,0.00007779302,0.00006363879],"category_scores_gemma":[0.0006085562,0.00019058259,0.00007296946,0.0019921153,0.0014749443,0.00063836767,0.0005441184,0.00045369868,0.00014511602],"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.0000022983652,0.00007848532,0.00037873254,0.0000029811454,0.0000020663804,0.000008854335,0.0003188754,0.0001363277,0.00024245994,0.9798267,0.0000094082225,0.018992808],"study_design_scores_gemma":[0.00036409794,0.00031873863,0.0006384486,0.000018686882,0.0000021694884,0.00008059925,0.0000023143964,0.17488873,0.018300073,0.80380434,0.0012326305,0.00034920065],"about_ca_topic_score_codex":0.0000029774783,"about_ca_topic_score_gemma":0.0000063550438,"teacher_disagreement_score":0.91661006,"about_ca_system_score_codex":0.0002803133,"about_ca_system_score_gemma":0.00061907154,"threshold_uncertainty_score":0.7771732},"labels":[],"label_agreement":null},{"id":"W4236134154","doi":"10.1016/s1571-0661(05)80729-7","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Library science; Event (particle physics); China; Computer science; Operations research; Political science; Engineering; Law","score_opus":0.006809791217408283,"score_gpt":0.2379298432030809,"score_spread":0.2311200519856726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236134154","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.016007697,0.00020215868,0.9727252,0.00062428165,0.0003873864,0.00015789659,1.6981268e-7,0.000131638,0.009763578],"genre_scores_gemma":[0.8069921,0.000015314672,0.19244137,0.0005041289,0.00003110009,0.000007479629,1.3292059e-7,0.0000056527347,0.0000026833332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996863,0.00017345129,0.00026736647,0.0008617981,0.0005569327,0.0012774661],"domain_scores_gemma":[0.99847776,0.0003391529,0.000047698402,0.00089699536,0.00006544243,0.00017297345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002162805,0.00019223159,0.00019748604,0.00020111717,0.00024343505,0.0003425511,0.0024089774,0.00006067178,0.000044936805],"category_scores_gemma":[0.0002423194,0.00015504353,0.00005543352,0.0018821656,0.0012244722,0.00056497456,0.0004372463,0.00038470558,0.000081262915],"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.0000018222348,0.000056956742,0.00017987323,0.0000018261759,0.000001339063,0.000008924198,0.00013403589,0.00034656748,0.00009104416,0.95539695,0.0000058160244,0.043774858],"study_design_scores_gemma":[0.00024202713,0.0002495003,0.00042440332,0.000010359256,0.0000011150746,0.00005467665,0.0000013592465,0.29850516,0.0040848376,0.695521,0.00066365395,0.00024189249],"about_ca_topic_score_codex":0.0000029202345,"about_ca_topic_score_gemma":0.000002787323,"teacher_disagreement_score":0.79098445,"about_ca_system_score_codex":0.00019997152,"about_ca_system_score_gemma":0.00040113856,"threshold_uncertainty_score":0.6322491},"labels":[],"label_agreement":null},{"id":"W4237118884","doi":"10.1016/s1571-0661(05)80358-5","title":"Preface","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Concurrency; Library science; Computer science; Attendance; Event (particle physics); Petri net; Programming language; Political science","score_opus":0.012922322723777711,"score_gpt":0.2441048877898789,"score_spread":0.2311825650661012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237118884","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.0235213,0.0005000104,0.9703985,0.0012260061,0.0005104886,0.00018174977,2.5283794e-7,0.0002548563,0.0034068283],"genre_scores_gemma":[0.9037821,0.000026852427,0.09565562,0.00040112316,0.00010039992,0.00001209383,1.05596754e-7,0.00000998403,0.000011717755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596125,0.00015508247,0.00041292523,0.0010770677,0.0009088791,0.0014848147],"domain_scores_gemma":[0.99785364,0.00050862355,0.00007434466,0.0012607218,0.000105065206,0.00019759765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021605312,0.0002309484,0.00025576493,0.0003849373,0.00026320847,0.00042545213,0.0042947703,0.000076113676,0.000076697346],"category_scores_gemma":[0.00026737692,0.00020663366,0.00006428517,0.0028523612,0.0011807028,0.00095778005,0.0011307296,0.000488605,0.00020902963],"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.0000013833845,0.000055551558,0.000097131655,0.000003728516,0.0000018368297,0.000011616009,0.00038553812,0.0020966125,0.00028254677,0.92509615,0.000013732609,0.07195417],"study_design_scores_gemma":[0.00021188705,0.00014252374,0.00008142723,0.000030345613,0.0000010549687,0.000069431495,9.494505e-7,0.85485196,0.002721819,0.14146271,0.00018881973,0.00023707119],"about_ca_topic_score_codex":0.0000036321,"about_ca_topic_score_gemma":0.000002694187,"teacher_disagreement_score":0.8802608,"about_ca_system_score_codex":0.00041613463,"about_ca_system_score_gemma":0.00013469422,"threshold_uncertainty_score":0.8426276},"labels":[],"label_agreement":null},{"id":"W4238214338","doi":"10.1016/s1571-0661(05)80916-8","title":"Preface","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Event (particle physics); Software; Field (mathematics); Variety (cybernetics); Software engineering; Mathematics education; Programming language; Mathematics; Artificial intelligence; Pure mathematics; Physics","score_opus":0.00990933206034021,"score_gpt":0.25187493522481624,"score_spread":0.24196560316447605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238214338","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.014250883,0.00024290041,0.97894,0.00089396833,0.0005357931,0.00022175912,5.3215555e-8,0.00023378029,0.0046808557],"genre_scores_gemma":[0.9832092,0.000024199138,0.01623085,0.0003481196,0.00014008481,0.000014851815,3.1729786e-7,0.000008065931,0.000024302464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967048,0.00012990175,0.00030946863,0.0008738568,0.0006368858,0.0013450806],"domain_scores_gemma":[0.99848014,0.00028009934,0.00006665935,0.00088883773,0.00009787462,0.00018640189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054465,0.00020237977,0.00022416926,0.00022526726,0.00024994102,0.00044161297,0.00295891,0.000072895324,0.000034144643],"category_scores_gemma":[0.00015063219,0.00016319695,0.000063838146,0.0020117874,0.0011956148,0.0006555118,0.0007486355,0.00036742285,0.0001441319],"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.0000042158927,0.00005987147,0.0007940508,0.0000028779198,0.0000021093956,0.000022926331,0.00023763767,0.00012272681,0.00013352674,0.91362804,0.000005625134,0.08498637],"study_design_scores_gemma":[0.00027051062,0.00034000978,0.00075346004,0.000005409663,0.0000015866351,0.00014328724,0.000002324512,0.23632061,0.0020578976,0.75754195,0.0022950557,0.00026786354],"about_ca_topic_score_codex":0.000017562734,"about_ca_topic_score_gemma":0.0000141687515,"teacher_disagreement_score":0.9689583,"about_ca_system_score_codex":0.00023005907,"about_ca_system_score_gemma":0.00030371762,"threshold_uncertainty_score":0.66549784},"labels":[],"label_agreement":null},{"id":"W4243215113","doi":"10.1016/s1571-0661(05)80875-8","title":"Preface","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science; Operations research; Engineering","score_opus":0.007424242706152011,"score_gpt":0.24707835672429573,"score_spread":0.2396541140181437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243215113","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.0497384,0.00031122664,0.9367745,0.001042506,0.00045727025,0.00016818181,1.3821476e-7,0.00023191399,0.011275865],"genre_scores_gemma":[0.9671622,0.000050919876,0.03213661,0.00045263852,0.00014497925,0.000011210512,3.120502e-7,0.000008739339,0.00003242258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964719,0.00012978874,0.00029552405,0.0009911308,0.0005991276,0.0015125513],"domain_scores_gemma":[0.99819535,0.000445829,0.00006112629,0.0009480049,0.00012031197,0.00022938137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868915,0.00023357836,0.00024165705,0.00025758494,0.00029994315,0.00039374118,0.0035633992,0.000078652614,0.000066891786],"category_scores_gemma":[0.00028986164,0.00019123509,0.000074481715,0.0023388609,0.001522341,0.0007686854,0.0010624451,0.00045811565,0.00018431373],"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.0000060278867,0.00008187276,0.00084191473,0.0000021707956,0.0000020474693,0.000023251245,0.0003246873,0.0001587724,0.00021794868,0.93047255,0.0000111475765,0.0678576],"study_design_scores_gemma":[0.00033827368,0.0003393009,0.0020106826,0.000021110109,0.000002031882,0.00013922853,0.0000018381787,0.43485227,0.0038058185,0.5569667,0.0012007585,0.000321942],"about_ca_topic_score_codex":0.0000072561747,"about_ca_topic_score_gemma":0.00001373464,"teacher_disagreement_score":0.9174238,"about_ca_system_score_codex":0.00029338503,"about_ca_system_score_gemma":0.0004267318,"threshold_uncertainty_score":0.7798341},"labels":[],"label_agreement":null},{"id":"W4246765009","doi":"10.1016/s1571-0661(05)82541-1","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"IBM; Library science; Model checking; Computer science; Operations research; Programming language; Mathematics","score_opus":0.007605294203265922,"score_gpt":0.27226888465223936,"score_spread":0.2646635904489734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246765009","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.03860809,0.00018334245,0.958521,0.00079669623,0.0001370414,0.00013437645,1.345218e-7,0.00012142387,0.0014979065],"genre_scores_gemma":[0.92851037,0.000024226669,0.07119757,0.00022169134,0.000023591341,0.000010286973,1.5265806e-7,0.0000053109584,0.0000068224645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962894,0.00031618547,0.00028561073,0.00092365046,0.0008806955,0.0013044782],"domain_scores_gemma":[0.9976775,0.0009138655,0.000036649155,0.0010281503,0.00013783519,0.00020601222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00413469,0.0001649673,0.0002149751,0.0003195283,0.00025975858,0.00037335418,0.0026433584,0.000060646482,0.000073940035],"category_scores_gemma":[0.0012656813,0.00013849926,0.00008114592,0.0033094536,0.0016726472,0.00059957197,0.00051717844,0.0004968,0.00009371113],"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.000001936938,0.00007763943,0.0007786238,0.000003352988,0.000002629138,0.000005691634,0.00011089875,0.00060643157,0.00020656943,0.96474844,0.0000025913826,0.03345519],"study_design_scores_gemma":[0.00020215528,0.00017824666,0.0005218411,0.00001286412,0.0000014790205,0.000025180518,0.0000016689247,0.3280863,0.014283994,0.6560471,0.0004303106,0.00020883877],"about_ca_topic_score_codex":0.000005621223,"about_ca_topic_score_gemma":0.000004541214,"teacher_disagreement_score":0.88990223,"about_ca_system_score_codex":0.00029295724,"about_ca_system_score_gemma":0.0006595947,"threshold_uncertainty_score":0.61629385},"labels":[],"label_agreement":null}]}