{"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077116105,0.013921001,0.004307911,0.04035783,0.18110625,0.00042727336,0.01030108,0.002417095,0.7463904],"genre_scores_gemma":[0.0035539316,0.0067797774,0.0016391438,0.007659297,0.02596516,0.00025826963,0.009979284,0.0013831115,0.94278204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987947,0.00014491036,0.00008896128,0.00020574614,0.0006520397,0.00011367215],"domain_scores_gemma":[0.9954833,0.00080847496,0.00018894083,0.0004408438,0.0025104887,0.00056804606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012223631,0.0012019206,0.0010936726,0.0028934688,0.002664282,0.006207466,0.001936608,0.0019814305,0.53745145],"category_scores_gemma":[0.009752485,0.0004406613,0.00080763054,0.0026794549,0.00078673573,0.004797345,0.0025058328,0.0038062546,0.40727583],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014289864,0.000009338762,0.000034522473,0.00008915287,0.0000013697777,0.000018271527,0.000052278923,0.000026283335,0.000054619755,0.002734678,0.9723274,0.024637802],"study_design_scores_gemma":[0.000002474404,0.0000083087325,0.00010693106,0.00010819525,0.0000011093556,0.000027875089,0.00005656704,0.000013617362,0.000032959346,0.0011171723,0.9985216,0.0000032238568],"about_ca_topic_score_codex":0.0034541734,"about_ca_topic_score_gemma":0.0033436029,"teacher_disagreement_score":0.53745145,"about_ca_system_score_codex":0.0020917114,"about_ca_system_score_gemma":0.0025390524,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010249226,0.013844199,0.0053755855,0.021161785,0.1153613,0.00031205267,0.0105725555,0.0021645818,0.83018315],"genre_scores_gemma":[0.004426161,0.0062828297,0.0023995421,0.0046039186,0.015386712,0.00016246732,0.011065952,0.0012334685,0.95443887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861836,0.00016038322,0.000096492804,0.0003079124,0.0006963854,0.000120431076],"domain_scores_gemma":[0.9970462,0.0004763238,0.00011185569,0.00043011367,0.0014391658,0.0004964355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820131,0.0011639423,0.0010346407,0.0027741154,0.0024259018,0.006384971,0.0018297448,0.0016580928,0.58367926],"category_scores_gemma":[0.006638496,0.00039416263,0.0008920625,0.0026262454,0.0008550004,0.0043157083,0.0029216434,0.0026764227,0.3849938],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002448569,0.00001654656,0.00008423263,0.00012337441,0.0000032875005,0.000027896305,0.00006711744,0.000050441715,0.0001251687,0.005057794,0.95044345,0.04397628],"study_design_scores_gemma":[0.0000022800627,0.0000073463666,0.00012557142,0.000071358794,0.0000015648225,0.000038625807,0.00004300924,0.000022493177,0.00004920225,0.0013688143,0.9982665,0.0000032747155],"about_ca_topic_score_codex":0.002629257,"about_ca_topic_score_gemma":0.0035860024,"teacher_disagreement_score":0.58367926,"about_ca_system_score_codex":0.0021274034,"about_ca_system_score_gemma":0.0023383074,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008266649,0.00077444303,0.9801524,0.004083841,0.000107968415,0.0002058446,0.0004298471,0.00057414785,0.005404863],"genre_scores_gemma":[0.23828845,0.0016899918,0.744426,0.002069271,0.00056486356,0.0012053509,0.001569067,0.00039326362,0.009793692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9793937,0.007099773,0.0019037649,0.003226391,0.0070742927,0.0013020354],"domain_scores_gemma":[0.9525878,0.01989312,0.0032349082,0.016273146,0.0059807636,0.0020302788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01833852,0.0014488996,0.0017871514,0.0063261576,0.0025688782,0.010024506,0.0067569637,0.0050459458,0.0074877036],"category_scores_gemma":[0.06030394,0.002354177,0.004555757,0.0061562383,0.014363003,0.029274197,0.01983576,0.008238649,0.0013802042],"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.00010080982,0.000050107687,0.0009134116,0.00019294769,0.000046196197,0.00009329379,0.0011082533,0.0031859544,0.00067665963,0.9640732,0.0020783406,0.02748077],"study_design_scores_gemma":[0.000054639862,0.00013211269,0.0005134688,0.00015905983,0.000080902486,0.00048744353,0.0006211637,0.039157405,0.0017948548,0.93066895,0.026195744,0.0001341132],"about_ca_topic_score_codex":0.003659707,"about_ca_topic_score_gemma":0.0028093464,"teacher_disagreement_score":0.01833852,"about_ca_system_score_codex":0.003724811,"about_ca_system_score_gemma":0.0029213782,"threshold_uncertainty_score":0.096984506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032455511,0.0020822797,0.9748683,0.0024973825,0.0008358333,0.00010953443,0.00032253668,0.00089678925,0.015141787],"genre_scores_gemma":[0.13573767,0.003989248,0.83725363,0.003360237,0.0018874827,0.0011115225,0.001034015,0.0009106733,0.014715488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958353,0.0012546318,0.0005871632,0.00086716295,0.0010891561,0.00036652724],"domain_scores_gemma":[0.9953909,0.002161185,0.00049382105,0.0009403974,0.000824483,0.0001892136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072881705,0.0011548151,0.0011504742,0.0030854046,0.003509408,0.006520473,0.0030732334,0.0032612341,0.0065211332],"category_scores_gemma":[0.007594458,0.001358606,0.003586798,0.0037552088,0.0099995835,0.015115971,0.0034495543,0.008195174,0.002870846],"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.0000038125986,0.000005019454,0.000045500623,0.000028013654,0.0000034227585,0.00002417163,0.00029259853,0.00036472114,0.0001599459,0.9943798,0.0008477534,0.0038452789],"study_design_scores_gemma":[0.000012271595,0.0000145594595,0.00004759675,0.00005058773,0.000014779037,0.00009071814,0.0000860404,0.002881976,0.00046594028,0.9524088,0.043906443,0.00002026283],"about_ca_topic_score_codex":0.0025539633,"about_ca_topic_score_gemma":0.0014121467,"teacher_disagreement_score":0.0072881705,"about_ca_system_score_codex":0.0026282594,"about_ca_system_score_gemma":0.0026194882,"threshold_uncertainty_score":0.038544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011097565,0.00014272168,0.9946226,0.0007582851,0.000057572564,0.00015918854,0.00010330075,0.00024911904,0.0027974825],"genre_scores_gemma":[0.049522553,0.000562989,0.9448694,0.0004690859,0.00018256374,0.0009608133,0.0011102156,0.0002937369,0.002028554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97590953,0.009912125,0.0041266996,0.003104088,0.005618078,0.0013295087],"domain_scores_gemma":[0.9693475,0.009547331,0.0023135643,0.009749341,0.007512982,0.0015294068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025566762,0.0020312509,0.002233967,0.0109775625,0.0032789274,0.014737688,0.0062027965,0.006391018,0.004542772],"category_scores_gemma":[0.031670857,0.002656121,0.0058333203,0.008578557,0.009826974,0.023221333,0.011107369,0.013284146,0.002315059],"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.0000124621,0.000049522456,0.00012976746,0.00009070466,0.000017671082,0.00010383871,0.0006732141,0.0023585015,0.00040956718,0.98342264,0.00078342156,0.011948675],"study_design_scores_gemma":[0.000033596258,0.000061713996,0.00029044668,0.00049661304,0.000056796427,0.00028196033,0.0009199385,0.039541338,0.0011900065,0.91030556,0.046766575,0.000055422777],"about_ca_topic_score_codex":0.0070907124,"about_ca_topic_score_gemma":0.0049228356,"teacher_disagreement_score":0.025566762,"about_ca_system_score_codex":0.005179794,"about_ca_system_score_gemma":0.010498588,"threshold_uncertainty_score":0.13521153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008069041,0.00003181044,0.9982161,0.000033974862,0.000015194035,0.000021542275,0.000017789394,0.0002679616,0.0005887051],"genre_scores_gemma":[0.0496505,0.0001923309,0.9475699,0.000096186406,0.000057044675,0.00015731655,0.00016562118,0.00018999285,0.0019210938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762934,0.00033250375,0.00016107546,0.00055511785,0.0011595209,0.00016248996],"domain_scores_gemma":[0.99816364,0.00074070325,0.0001144602,0.00053346326,0.0003843999,0.000063295316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020971498,0.0010148924,0.0010814654,0.0024466815,0.0011691639,0.002130199,0.0027281397,0.0010714178,0.004337408],"category_scores_gemma":[0.004591958,0.0007324775,0.0024294702,0.0011595418,0.002288144,0.0046147252,0.0028137057,0.0036738776,0.0010874837],"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.00009395213,0.00014075733,0.00074192684,0.00025524615,0.00010980146,0.00023822025,0.00047281716,0.080858864,0.029630557,0.7415468,0.0016226283,0.14428851],"study_design_scores_gemma":[0.000057657795,0.00012325235,0.00024935108,0.00010183492,0.00011379721,0.00032562276,0.00007287815,0.5593809,0.02469718,0.37637717,0.038424943,0.00007543848],"about_ca_topic_score_codex":0.0026368906,"about_ca_topic_score_gemma":0.0022406122,"teacher_disagreement_score":0.004337408,"about_ca_system_score_codex":0.001378918,"about_ca_system_score_gemma":0.0021892919,"threshold_uncertainty_score":0.0145100355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027131808,0.00027014615,0.9842896,0.0010282112,0.0003578555,0.00013180483,0.00014916525,0.0010467678,0.010013298],"genre_scores_gemma":[0.17231716,0.00083989836,0.8142766,0.0012228744,0.00059884496,0.0006500555,0.000389356,0.0007315423,0.008973645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9847574,0.0053342525,0.001090136,0.0030372385,0.004676087,0.0011048886],"domain_scores_gemma":[0.97035575,0.013913455,0.001194696,0.010953067,0.0029889068,0.0005940748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009389002,0.0013279698,0.0015645823,0.0032285831,0.0048107617,0.0045975936,0.003354952,0.0046781776,0.012375192],"category_scores_gemma":[0.038906224,0.0015903088,0.0037633625,0.0023772698,0.011298899,0.017833658,0.010305372,0.010478683,0.0046904027],"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.00007515908,0.00003469087,0.000273077,0.00014259014,0.00004752898,0.00018632607,0.00062853994,0.0010733778,0.007441566,0.9496126,0.0037571157,0.036727555],"study_design_scores_gemma":[0.000049867806,0.00014361071,0.00022744165,0.00012757212,0.000073903735,0.00063441414,0.00021082388,0.014473134,0.01870524,0.91997164,0.045287862,0.00009457338],"about_ca_topic_score_codex":0.0010978961,"about_ca_topic_score_gemma":0.00072193285,"teacher_disagreement_score":0.012375192,"about_ca_system_score_codex":0.0015649362,"about_ca_system_score_gemma":0.0022113118,"threshold_uncertainty_score":0.049654365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006068347,0.00040199028,0.9681285,0.0022495838,0.000120270146,0.000084228435,0.00006759927,0.00039895345,0.022480521],"genre_scores_gemma":[0.36058405,0.001229829,0.6207916,0.0010880076,0.00036354823,0.0005464836,0.00021480974,0.00038348394,0.014798154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617213,0.0018931906,0.00023935582,0.00044588075,0.0009069959,0.00034239606],"domain_scores_gemma":[0.99550664,0.002886042,0.00026705797,0.00072737405,0.00042159008,0.0001912108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038758162,0.00067964045,0.0006306039,0.0007775938,0.0018556807,0.0033417332,0.0018574815,0.0014587069,0.006301244],"category_scores_gemma":[0.007893814,0.00058038125,0.0016022346,0.000881146,0.006138979,0.007816466,0.0032985746,0.003426991,0.00088369945],"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.0000054907046,0.0000066090784,0.000026408292,0.00002521931,0.0000030026529,0.000016930537,0.00013419183,0.002092249,0.00014206121,0.99428153,0.00032260863,0.0029436976],"study_design_scores_gemma":[0.00001436231,0.000012759638,0.000025911544,0.00003161051,0.000008870701,0.000042837637,0.000055932756,0.016876014,0.00061856594,0.96762127,0.014678238,0.000013509883],"about_ca_topic_score_codex":0.0029296484,"about_ca_topic_score_gemma":0.002482502,"teacher_disagreement_score":0.006301244,"about_ca_system_score_codex":0.0019674909,"about_ca_system_score_gemma":0.0026228589,"threshold_uncertainty_score":0.021079779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035900455,0.0000403546,0.9536011,0.00014283307,0.00009787935,0.000115713,0.00008504108,0.0002941306,0.0097224405],"genre_scores_gemma":[0.48121485,0.00022822118,0.5056387,0.00025729154,0.00006392053,0.0008007659,0.00069030165,0.00045009394,0.010655811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972843,0.00073414564,0.00022326528,0.0004904427,0.0009068437,0.00036099178],"domain_scores_gemma":[0.9966208,0.0013411111,0.000192843,0.0009156697,0.0007254453,0.00020417212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022768432,0.00047896244,0.0004725131,0.0005111938,0.0005735294,0.0013079846,0.0010646016,0.00052203523,0.0058513],"category_scores_gemma":[0.00558843,0.0002739159,0.0010044044,0.0005402381,0.0020594422,0.0027772698,0.0033442434,0.0019495924,0.001067881],"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.00020533324,0.0001059301,0.0014802065,0.00019637894,0.000030614978,0.0005885141,0.0009013647,0.058693457,0.0247966,0.8150864,0.0015888433,0.09632635],"study_design_scores_gemma":[0.00005587865,0.00027031006,0.00074699585,0.00008878485,0.000041177227,0.0006182717,0.00036502897,0.28912514,0.031451683,0.63980573,0.037374597,0.000056419154],"about_ca_topic_score_codex":0.0011932777,"about_ca_topic_score_gemma":0.00066333817,"teacher_disagreement_score":0.0058513,"about_ca_system_score_codex":0.00052522076,"about_ca_system_score_gemma":0.001212988,"threshold_uncertainty_score":0.019574523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014331633,0.00023401718,0.97865796,0.0019859897,0.0001586107,0.000042940435,0.00004104331,0.0027435059,0.0018042825],"genre_scores_gemma":[0.5147948,0.00051320676,0.48018473,0.0010492427,0.00016468529,0.00017753855,0.00025937226,0.0007489583,0.002107416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629885,0.0016591738,0.00015606082,0.00043809996,0.0011367529,0.00031106925],"domain_scores_gemma":[0.9724708,0.021291547,0.001004658,0.0035554117,0.0014366915,0.00024096211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039294004,0.00086801325,0.0008033151,0.001020972,0.00037377444,0.0014221782,0.0016673426,0.002395656,0.0034695792],"category_scores_gemma":[0.047746014,0.00053440395,0.0011409036,0.00070470007,0.0020575204,0.005342805,0.0011863444,0.0019552743,0.001004939],"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.00066691206,0.0006241661,0.008650082,0.00079857034,0.00025014917,0.00090864394,0.00050446106,0.22597408,0.027557239,0.34853503,0.012213318,0.37331727],"study_design_scores_gemma":[0.00016851704,0.00017854232,0.00043778997,0.00013205815,0.00006492965,0.00035694113,0.00007179343,0.7093213,0.021043077,0.2623596,0.005817959,0.000047427497],"about_ca_topic_score_codex":0.0011169539,"about_ca_topic_score_gemma":0.0014642564,"teacher_disagreement_score":0.0039294004,"about_ca_system_score_codex":0.0006120796,"about_ca_system_score_gemma":0.0011191624,"threshold_uncertainty_score":0.020780921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059278467,0.00007770761,0.9958331,0.00006407275,0.00023741479,0.00007773926,0.0000646734,0.0013277214,0.0017246912],"genre_scores_gemma":[0.023922158,0.00029514421,0.9650584,0.00021357728,0.00017333218,0.0005369804,0.00032757202,0.0010363299,0.008436519],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970107,0.00043184063,0.00028236845,0.00087294285,0.0012646593,0.00013736784],"domain_scores_gemma":[0.9973985,0.00093311275,0.0001541244,0.00081411604,0.0006147492,0.00008545612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016921794,0.0011800465,0.0008343057,0.0017530759,0.00093027257,0.0017016885,0.0015895442,0.0010990865,0.008646065],"category_scores_gemma":[0.0052784616,0.000868736,0.0025855396,0.0010866745,0.0016303034,0.0026064236,0.0020161632,0.0034380644,0.0031420742],"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.00025186007,0.00019435101,0.0006985655,0.0006017384,0.00017162968,0.0007125334,0.00095754565,0.015106709,0.06687482,0.3377012,0.015141098,0.561588],"study_design_scores_gemma":[0.00025070616,0.00041046026,0.00048613493,0.00018862239,0.00027764484,0.0031085007,0.00022785012,0.17138146,0.108121455,0.26543754,0.44989842,0.0002113204],"about_ca_topic_score_codex":0.0010349498,"about_ca_topic_score_gemma":0.00092631154,"teacher_disagreement_score":0.008646065,"about_ca_system_score_codex":0.0006995132,"about_ca_system_score_gemma":0.0013018599,"threshold_uncertainty_score":0.028923988},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54760075,0.0013961074,0.35038766,0.006404695,0.00028841326,0.00010954242,0.00012458525,0.00031267578,0.09337559],"genre_scores_gemma":[0.98160845,0.00018579233,0.014366891,0.00022973953,0.00010126519,0.00006581451,0.000027274451,0.00003192248,0.0033829994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991192,0.00034015445,0.000036997102,0.00012114177,0.00024244361,0.00013994661],"domain_scores_gemma":[0.998095,0.0008486395,0.0002956149,0.00047840248,0.00015626376,0.00012608104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014115088,0.000276951,0.00043996138,0.001013967,0.0014252708,0.0021797142,0.0008539659,0.0013420287,0.0035931908],"category_scores_gemma":[0.0033197762,0.00025472383,0.00063676207,0.00050055556,0.0078113377,0.0048380825,0.00223815,0.0016785181,0.00029880932],"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.0000027455687,0.0000027377118,0.00004113182,0.0000049218743,0.000001020501,0.000013291939,0.00014014424,0.0003408069,0.00020873548,0.99877125,0.00004497471,0.00042817526],"study_design_scores_gemma":[0.000003815962,0.000008372828,0.000058846672,0.000004276671,0.0000012817795,0.000020521173,0.00005974568,0.0024687813,0.0002221562,0.9963471,0.0008006136,0.0000045941],"about_ca_topic_score_codex":0.00056163373,"about_ca_topic_score_gemma":0.00040345328,"teacher_disagreement_score":0.0035931908,"about_ca_system_score_codex":0.0011362182,"about_ca_system_score_gemma":0.00079598627,"threshold_uncertainty_score":0.0120203495},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13122062,0.031238567,0.33129567,0.017191833,0.0017006114,0.00009193024,0.0006029476,0.00054227,0.4861156],"genre_scores_gemma":[0.9410885,0.005554752,0.028204892,0.0018173892,0.0014341715,0.00013430473,0.0003715696,0.00009907847,0.021295222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886924,0.00040609197,0.000046058023,0.00022808868,0.00029804403,0.00015236773],"domain_scores_gemma":[0.9987099,0.00065305596,0.00009384416,0.00021840948,0.00019233843,0.00013246358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001112867,0.0003984785,0.00053068757,0.0017874739,0.0026347106,0.0034910317,0.00058836787,0.0014213517,0.005714755],"category_scores_gemma":[0.0032925333,0.00023623196,0.00041390478,0.001621851,0.008829498,0.009113702,0.0023460358,0.002339194,0.00049330323],"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":[9.852133e-7,0.0000014189806,0.000031879677,0.0000062961685,5.526999e-7,0.0000055577057,0.000054538945,0.000045303244,0.000029146442,0.99825877,0.00036269255,0.0012027931],"study_design_scores_gemma":[0.0000011308513,0.000001992732,0.000056196335,0.000005591805,7.089359e-7,0.00002377781,0.000048558755,0.00019306323,0.000029787727,0.99363774,0.0059999754,0.0000014174763],"about_ca_topic_score_codex":0.0018132525,"about_ca_topic_score_gemma":0.0013021823,"teacher_disagreement_score":0.005714755,"about_ca_system_score_codex":0.001467546,"about_ca_system_score_gemma":0.0008573376,"threshold_uncertainty_score":0.019117713},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005532792,0.00046298114,0.9837605,0.00046810435,0.00014186156,0.00015096895,0.0002405339,0.0017547385,0.0074875695],"genre_scores_gemma":[0.22857903,0.0014271201,0.75631434,0.0010036051,0.00017373118,0.0004910944,0.0010978201,0.00094595505,0.009967394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893607,0.004243228,0.00084905926,0.0015874516,0.003049528,0.00091006584],"domain_scores_gemma":[0.97889805,0.00887719,0.0011880612,0.007402729,0.0034060525,0.00022793247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009534254,0.00081955164,0.0009086334,0.0014737984,0.0015407585,0.003536039,0.0022143775,0.0013380864,0.008853312],"category_scores_gemma":[0.03232998,0.00086980074,0.0025793912,0.0025307995,0.0051438212,0.009344632,0.0046920306,0.0029332137,0.0021508264],"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.00017610547,0.000034920748,0.00059930957,0.0003730703,0.0000450914,0.00014393555,0.00070619426,0.014493408,0.003774199,0.88167495,0.00395867,0.094020225],"study_design_scores_gemma":[0.00010382957,0.00014027202,0.00031263224,0.00026163162,0.00011074071,0.00025966915,0.00026375352,0.10732338,0.023948276,0.80335885,0.06382817,0.000088803616],"about_ca_topic_score_codex":0.0046754587,"about_ca_topic_score_gemma":0.0033931246,"teacher_disagreement_score":0.009534254,"about_ca_system_score_codex":0.0020107985,"about_ca_system_score_gemma":0.002716631,"threshold_uncertainty_score":0.05042255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013116746,0.00008428967,0.9711477,0.00012758652,0.00004480785,0.00031562915,0.00047821895,0.010471557,0.0042133806],"genre_scores_gemma":[0.22681141,0.0001681369,0.76557004,0.00019478497,0.000029508705,0.00045701582,0.0011774689,0.00076099456,0.0048306067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987118,0.00029422514,0.000085662214,0.00029813347,0.00040883728,0.0002012426],"domain_scores_gemma":[0.998516,0.0007851756,0.00010582053,0.00034944015,0.00017847774,0.00006514895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393949,0.00074680184,0.0006036688,0.0012052929,0.00056976476,0.0015478721,0.0018428689,0.0008494496,0.00962643],"category_scores_gemma":[0.003284881,0.00047754808,0.00144502,0.0005143991,0.0013045607,0.0021316826,0.0016402558,0.0013107244,0.001652192],"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.0007344153,0.0006129947,0.002647516,0.00090377795,0.00019124633,0.0017319248,0.00060584646,0.23842454,0.044070374,0.4088938,0.010298346,0.29088524],"study_design_scores_gemma":[0.0002535761,0.00031525508,0.0004928494,0.0001057005,0.000105630155,0.00063861225,0.000068045985,0.7166898,0.062293902,0.16939953,0.049547657,0.000089472065],"about_ca_topic_score_codex":0.0032340318,"about_ca_topic_score_gemma":0.002604737,"teacher_disagreement_score":0.00962643,"about_ca_system_score_codex":0.0011203346,"about_ca_system_score_gemma":0.001700142,"threshold_uncertainty_score":0.032203555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016576264,0.00010610989,0.99678373,0.00011989966,0.000013004345,0.000032740623,0.000027262813,0.00024796493,0.0010117012],"genre_scores_gemma":[0.22849584,0.0013116573,0.76747817,0.00025934988,0.00021333071,0.00036306033,0.00024039255,0.00020582798,0.0014323528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99173295,0.0034139585,0.0004905102,0.00067037926,0.0031818755,0.0005102934],"domain_scores_gemma":[0.9779107,0.018563548,0.00096320815,0.0014360391,0.0009959545,0.0001306494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009156946,0.0012603477,0.0009078896,0.0021945522,0.0011081015,0.0033079784,0.0023950748,0.0010315399,0.0033660128],"category_scores_gemma":[0.022723978,0.0006590714,0.0030314631,0.001582553,0.0040746536,0.0045136735,0.0028526483,0.0027415166,0.0006504758],"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.00004491832,0.0000730696,0.0009199591,0.0004229696,0.000121961,0.0003833379,0.00032101173,0.16420016,0.0037086236,0.78243315,0.0012870702,0.04608373],"study_design_scores_gemma":[0.00004287256,0.00004649181,0.00023972834,0.00007342171,0.000058708752,0.00016526614,0.00004725598,0.4189722,0.0059203417,0.5686565,0.0057433,0.000033882305],"about_ca_topic_score_codex":0.0019332138,"about_ca_topic_score_gemma":0.0013171867,"teacher_disagreement_score":0.009156946,"about_ca_system_score_codex":0.0018366501,"about_ca_system_score_gemma":0.00245995,"threshold_uncertainty_score":0.048427105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118884824,0.0058614495,0.8242303,0.002768985,0.00021008507,0.00006535505,0.00023173097,0.00020109533,0.047546227],"genre_scores_gemma":[0.91738725,0.0031233546,0.07166205,0.00053526,0.00034044197,0.000154036,0.00014582834,0.00006098051,0.006590781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848026,0.00044284662,0.00008580095,0.00036321423,0.00050317385,0.00012476169],"domain_scores_gemma":[0.99105597,0.006972281,0.000524449,0.0005696593,0.00063171523,0.00024592952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017251439,0.00045230225,0.00083930395,0.0013572405,0.0010792902,0.0023452223,0.0011003137,0.0015444056,0.0030093372],"category_scores_gemma":[0.014024052,0.00039598756,0.000873696,0.0013746644,0.0034209331,0.004160944,0.0018488141,0.0021552306,0.0002847288],"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.000017722812,0.000011398607,0.00042393943,0.000042275507,0.000012137308,0.00007649143,0.00017622861,0.021492751,0.00058084744,0.9697277,0.00028703347,0.007151359],"study_design_scores_gemma":[0.000007860124,0.00002275218,0.00033606566,0.000030563046,0.000014398669,0.00010506925,0.000046832178,0.15512638,0.00032220746,0.84167,0.002301796,0.000016051497],"about_ca_topic_score_codex":0.0038922264,"about_ca_topic_score_gemma":0.0021917506,"teacher_disagreement_score":0.0038922264,"about_ca_system_score_codex":0.002021679,"about_ca_system_score_gemma":0.0007260788,"threshold_uncertainty_score":0.014668405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33486116,0.00073345174,0.5174743,0.0033022943,0.00036145354,0.00012173124,0.0007286099,0.0008671994,0.1415498],"genre_scores_gemma":[0.9821681,0.0002666084,0.010713701,0.00030706523,0.00008135278,0.000049039292,0.000088714216,0.00008578115,0.006239685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998243,0.00040164054,0.00007618154,0.00041775085,0.00042055495,0.00044087906],"domain_scores_gemma":[0.9949122,0.0020755276,0.00049975555,0.0019488034,0.000363703,0.00019996581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016067566,0.0003859902,0.0006675495,0.00051274395,0.0012075612,0.0020075142,0.0010621804,0.0011730073,0.0045402762],"category_scores_gemma":[0.008143729,0.0004985751,0.00070699054,0.00050945673,0.0050931256,0.006145424,0.0025524378,0.0023700024,0.0007009349],"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.000022138354,0.0000071560835,0.00014211737,0.000020711397,0.0000060727507,0.000044529872,0.00012574604,0.0026125414,0.00081758754,0.993932,0.00046573076,0.001803749],"study_design_scores_gemma":[0.000011717092,0.000021194888,0.00015577236,0.000014541383,0.000009358087,0.00013122289,0.000062072446,0.022601312,0.001668658,0.9733699,0.0019364951,0.000017625322],"about_ca_topic_score_codex":0.001409967,"about_ca_topic_score_gemma":0.0008423048,"teacher_disagreement_score":0.0045402762,"about_ca_system_score_codex":0.000763723,"about_ca_system_score_gemma":0.00078259635,"threshold_uncertainty_score":0.015188694},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011244385,0.011894619,0.0059880465,0.024317026,0.11723963,0.0004335559,0.013366536,0.0028352318,0.8228009],"genre_scores_gemma":[0.004062971,0.0055844737,0.0023934674,0.005059908,0.015735546,0.00019260086,0.012524371,0.0013513756,0.9530954],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985777,0.00015976257,0.0000962513,0.0002803503,0.0007570719,0.00012875733],"domain_scores_gemma":[0.9958488,0.00060716923,0.00015721662,0.00048702158,0.00214312,0.00075673114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012577933,0.0011414504,0.0010776997,0.0030373354,0.002503975,0.006376772,0.0018659623,0.0015742216,0.601695],"category_scores_gemma":[0.008728771,0.00041574752,0.00082834595,0.0028695494,0.000785952,0.0047890516,0.003080164,0.0028160375,0.43788004],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024837522,0.000016710896,0.00009024353,0.00010304669,0.000002271389,0.000025056232,0.000067165245,0.000043428634,0.00011021473,0.0036107034,0.95283,0.043076422],"study_design_scores_gemma":[0.0000023940383,0.0000094760235,0.00014359472,0.00006813549,0.0000012484901,0.0000393112,0.000049103583,0.00002102157,0.00004666415,0.0013325512,0.9982829,0.0000035326063],"about_ca_topic_score_codex":0.0024162475,"about_ca_topic_score_gemma":0.003108175,"teacher_disagreement_score":0.601695,"about_ca_system_score_codex":0.0021070412,"about_ca_system_score_gemma":0.002273981,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343899,0.00019717705,0.9370508,0.0007745143,0.00026640427,0.00012552786,0.00035141828,0.01548835,0.012306872],"genre_scores_gemma":[0.46660808,0.00049083604,0.51650435,0.0006071105,0.00018519707,0.0003208114,0.0005682593,0.0040460387,0.010669369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979474,0.00041629563,0.00019069793,0.00025200227,0.0009839669,0.00020963214],"domain_scores_gemma":[0.9958984,0.0015071922,0.0003720795,0.0015634282,0.00054660434,0.000112303904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017369617,0.0003898864,0.0004048962,0.00063827983,0.000833938,0.0023860799,0.0013286682,0.00089173653,0.0032850276],"category_scores_gemma":[0.007494458,0.00067097205,0.0012309273,0.0004889211,0.0030940499,0.0032311142,0.0017950123,0.002122659,0.0012808382],"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.00020578779,0.000109267225,0.0016649232,0.00048401358,0.00005616244,0.0011048071,0.0023197462,0.036531374,0.025748217,0.7817174,0.008907906,0.14115033],"study_design_scores_gemma":[0.00011018048,0.00012097682,0.00048087517,0.0001647541,0.000055778848,0.00050271733,0.00013133325,0.10470578,0.06462291,0.7730728,0.055918265,0.00011366369],"about_ca_topic_score_codex":0.0015576385,"about_ca_topic_score_gemma":0.0015637238,"teacher_disagreement_score":0.0032850276,"about_ca_system_score_codex":0.0008893171,"about_ca_system_score_gemma":0.001937931,"threshold_uncertainty_score":0.010989487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120210005,0.00010092477,0.98331946,0.00010452386,0.000055111257,0.00021457665,0.0002123842,0.0024825293,0.0014894458],"genre_scores_gemma":[0.31104195,0.000481217,0.6823802,0.0001238651,0.000054698434,0.0008450512,0.001175419,0.00075473264,0.003142895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98953897,0.0046234364,0.0009038093,0.0009028729,0.0035754587,0.0004554779],"domain_scores_gemma":[0.98452896,0.008935026,0.0018620506,0.0021171432,0.0023930827,0.00016386302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009320548,0.001250397,0.00052739267,0.002007754,0.0008847868,0.0022175405,0.0013693437,0.0010906325,0.0022530775],"category_scores_gemma":[0.021845272,0.00086992804,0.0014215424,0.00075304956,0.002042515,0.0020731061,0.0013836977,0.0013308409,0.0006785758],"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.0005919149,0.00031908893,0.007023258,0.0012785291,0.00014367714,0.0015578413,0.0027904718,0.25586683,0.06546874,0.52553093,0.0038099128,0.13561878],"study_design_scores_gemma":[0.0002477135,0.00035176578,0.0017313379,0.0005332121,0.0001656052,0.0007014637,0.00027570312,0.69490373,0.12054414,0.11891334,0.06147555,0.00015644384],"about_ca_topic_score_codex":0.0064261756,"about_ca_topic_score_gemma":0.0052236156,"teacher_disagreement_score":0.009320548,"about_ca_system_score_codex":0.0018596991,"about_ca_system_score_gemma":0.004795347,"threshold_uncertainty_score":0.049292326},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040848106,0.00015454082,0.7887756,0.00014097964,0.0000892688,0.00032611686,0.0014055873,0.16662867,0.0016311553],"genre_scores_gemma":[0.17346618,0.00022877032,0.8088541,0.00015453133,0.000021632071,0.00039261876,0.0039224043,0.009553288,0.003406458],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984189,0.0003893421,0.00023406488,0.00028644278,0.000538389,0.00013286444],"domain_scores_gemma":[0.9947425,0.0034970448,0.00047140164,0.0007706007,0.00040133906,0.00011714268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023191771,0.0011723065,0.000645917,0.0017868283,0.00032785206,0.0012789742,0.0014582111,0.0012638145,0.003408826],"category_scores_gemma":[0.010257394,0.0012254204,0.0009389794,0.00064581353,0.00041101582,0.0024271854,0.0013234194,0.0012888267,0.0013450922],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016889597,0.0007992908,0.022294762,0.0019287916,0.00026067658,0.0022259364,0.001474375,0.042716693,0.1295846,0.011205463,0.029636573,0.75618386],"study_design_scores_gemma":[0.0007243032,0.00079091976,0.017347543,0.0005027145,0.00021951293,0.002957618,0.00043967468,0.64278406,0.2342596,0.017471198,0.082267866,0.00023491349],"about_ca_topic_score_codex":0.001355277,"about_ca_topic_score_gemma":0.0018697333,"teacher_disagreement_score":0.003408826,"about_ca_system_score_codex":0.00043451082,"about_ca_system_score_gemma":0.0007308592,"threshold_uncertainty_score":0.012265086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009881428,0.00007432351,0.96391696,0.0001755022,0.00019917506,0.000114985465,0.00086509075,0.027622059,0.006043764],"genre_scores_gemma":[0.026762959,0.00038027763,0.93869495,0.00048633217,0.00014582947,0.0003969409,0.0045951395,0.012934459,0.015603133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969331,0.00066051504,0.000471544,0.00055200467,0.001116899,0.00026590153],"domain_scores_gemma":[0.99563855,0.0013246792,0.00025052123,0.0010144477,0.0016802192,0.00009166391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043380964,0.0014772782,0.0009612175,0.00259024,0.0013212557,0.0032141276,0.0028273384,0.0012638844,0.02341728],"category_scores_gemma":[0.008105932,0.0013217215,0.001640886,0.0019001086,0.0010998175,0.0042535285,0.0024846664,0.0026444371,0.009822243],"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.00029642603,0.00013521918,0.0018298599,0.0008747946,0.0001236863,0.0013192185,0.0010900771,0.021359691,0.011848815,0.33327904,0.118618965,0.5092242],"study_design_scores_gemma":[0.000097420016,0.00004803119,0.00037530524,0.0002201837,0.00009226155,0.0011492975,0.00012199494,0.13689683,0.043386914,0.12480969,0.69265133,0.00015087066],"about_ca_topic_score_codex":0.0042540217,"about_ca_topic_score_gemma":0.00429544,"teacher_disagreement_score":0.02341728,"about_ca_system_score_codex":0.00140922,"about_ca_system_score_gemma":0.0031911298,"threshold_uncertainty_score":0.07833856},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078608785,0.000105792045,0.97549486,0.0013734978,0.000081135935,0.00015779393,0.0001340542,0.0041308156,0.010661177],"genre_scores_gemma":[0.21577977,0.00015923996,0.77480924,0.00089558697,0.00006858238,0.00037157192,0.00032026035,0.0008687974,0.0067270026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99323285,0.002237035,0.0005066851,0.0010008862,0.0023845928,0.0006379502],"domain_scores_gemma":[0.99130416,0.0043506827,0.00028956876,0.0023873458,0.0014691637,0.00019916445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007618747,0.00083590555,0.0009072748,0.0022623923,0.0025669376,0.008498649,0.0041779606,0.0034606466,0.0086352825],"category_scores_gemma":[0.02468609,0.0012950783,0.0018052851,0.0018759767,0.0065930663,0.011055106,0.0063394774,0.005011506,0.0016943999],"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.00010752221,0.000042595773,0.00060294627,0.00016584249,0.000017901955,0.00023817702,0.0008057643,0.005146827,0.0031491024,0.93013966,0.0033627108,0.0562209],"study_design_scores_gemma":[0.00007576568,0.00009933543,0.0002334188,0.00018441453,0.000042370706,0.0007847142,0.00040064013,0.11446925,0.018605158,0.78090286,0.08409978,0.00010225494],"about_ca_topic_score_codex":0.002378151,"about_ca_topic_score_gemma":0.0027116616,"teacher_disagreement_score":0.0086352825,"about_ca_system_score_codex":0.0022200064,"about_ca_system_score_gemma":0.0032194513,"threshold_uncertainty_score":0.040292203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004844846,0.0013316425,0.9612084,0.0018108393,0.00069951295,0.00021679615,0.0005991068,0.0017214459,0.027567444],"genre_scores_gemma":[0.21214251,0.0023426642,0.7331947,0.0024084114,0.0016913548,0.0010963199,0.0013746868,0.0009885444,0.044760834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982303,0.00043397336,0.00023733311,0.00029054596,0.0006028469,0.00020507995],"domain_scores_gemma":[0.9985642,0.00066595984,0.00013491025,0.00018693137,0.00031960447,0.00012840942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020868222,0.00089666375,0.00084342156,0.001965098,0.002197459,0.0049484787,0.002291449,0.0012562667,0.010278498],"category_scores_gemma":[0.0026273446,0.0009021049,0.0021837594,0.0019920925,0.0028707013,0.006805488,0.0030449382,0.0052518146,0.0039553116],"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.00001063709,0.000019719195,0.000044405526,0.00008915886,0.000007505455,0.00011445736,0.00030367236,0.00041937112,0.0019360322,0.98663723,0.0020827623,0.008335094],"study_design_scores_gemma":[0.000022721315,0.00004953061,0.00010302196,0.0000714488,0.00003908967,0.0006774074,0.00012315401,0.008593436,0.0032540874,0.8642916,0.12273512,0.000039348684],"about_ca_topic_score_codex":0.000956823,"about_ca_topic_score_gemma":0.0010964094,"teacher_disagreement_score":0.010278498,"about_ca_system_score_codex":0.001606258,"about_ca_system_score_gemma":0.0017885145,"threshold_uncertainty_score":0.034384966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005132013,0.00061959826,0.9764258,0.00083493866,0.00045539738,0.00019201316,0.00039592315,0.0010388155,0.014905599],"genre_scores_gemma":[0.30943316,0.0016526019,0.6697953,0.001205184,0.0010809728,0.0013650723,0.0013120064,0.00067306944,0.013482646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677795,0.0007393502,0.0004856369,0.0005662057,0.0010746213,0.0003561587],"domain_scores_gemma":[0.99663144,0.0011245315,0.00036140266,0.0003575973,0.0012341465,0.000290869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002473523,0.0011147939,0.0007327914,0.0016542666,0.001552158,0.003290492,0.0015736229,0.0017124123,0.0062138615],"category_scores_gemma":[0.0048003034,0.00053475786,0.0019048153,0.0014847473,0.0031643752,0.005158209,0.0026506141,0.0031459955,0.00164344],"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.00002282605,0.000017548538,0.000053710202,0.00007029249,0.000009833152,0.0001731792,0.00038126268,0.0020987524,0.0017325024,0.98690933,0.0011487767,0.0073820627],"study_design_scores_gemma":[0.000073632174,0.00007447512,0.000062702085,0.00008982747,0.00003987476,0.00050849345,0.0002457882,0.02228648,0.004929035,0.8664896,0.10515889,0.000041216004],"about_ca_topic_score_codex":0.0013018771,"about_ca_topic_score_gemma":0.00091861974,"teacher_disagreement_score":0.0062138615,"about_ca_system_score_codex":0.0016249353,"about_ca_system_score_gemma":0.0020511525,"threshold_uncertainty_score":0.020787477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067787333,0.0003646443,0.9731861,0.00095379044,0.0001589068,0.00016092183,0.0002637954,0.0014873196,0.01664574],"genre_scores_gemma":[0.3470219,0.00077260286,0.6303057,0.0009825836,0.00026041598,0.0009791394,0.00060420675,0.0009714891,0.018101988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872017,0.00029325194,0.00012385396,0.00024976302,0.00042576037,0.00018726624],"domain_scores_gemma":[0.99917513,0.00031772497,0.00010573075,0.00015526406,0.00016631736,0.00007977695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017604922,0.00087988033,0.00069111,0.0011209144,0.0012933908,0.0033584759,0.0023963626,0.0015685254,0.006519873],"category_scores_gemma":[0.0021780967,0.0005707445,0.0018034454,0.001129818,0.0039388593,0.005983262,0.0019247925,0.0033324317,0.0018491519],"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.000008623098,0.000014865797,0.00003149419,0.00003568562,0.0000065075915,0.00008852464,0.00023472705,0.0016441189,0.00073093036,0.9942128,0.0005919576,0.0023997936],"study_design_scores_gemma":[0.000023645349,0.00003040153,0.00005309301,0.000025290747,0.00002253928,0.00023964481,0.00009247452,0.019250581,0.0017451266,0.95255524,0.025941622,0.000020369922],"about_ca_topic_score_codex":0.0015601462,"about_ca_topic_score_gemma":0.0015266655,"teacher_disagreement_score":0.006519873,"about_ca_system_score_codex":0.0017733029,"about_ca_system_score_gemma":0.0013335968,"threshold_uncertainty_score":0.021811187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040668184,0.0009599289,0.9925748,0.00009311171,0.00006278935,0.000022366465,0.000022260749,0.00016375733,0.0020341647],"genre_scores_gemma":[0.15651079,0.004829732,0.81964904,0.00016501843,0.00030379987,0.00015760801,0.00017243405,0.00025115194,0.017960366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997911,0.00005046007,0.000008812221,0.000047076133,0.00008713157,0.000015501826],"domain_scores_gemma":[0.99981624,0.00006308137,0.000024026313,0.00002520723,0.00005590586,0.00001556641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034904704,0.0007330913,0.00045740444,0.0010797123,0.00025337757,0.0006124136,0.00055295095,0.00064303505,0.002442743],"category_scores_gemma":[0.00065311865,0.00021069615,0.00060538494,0.0008582899,0.00068260106,0.0011060511,0.00045922975,0.0010008218,0.00050042884],"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.00010203667,0.00005564312,0.00032447017,0.00027800185,0.00008183971,0.00020909277,0.00016379896,0.072429925,0.05857051,0.5262948,0.00415029,0.33733955],"study_design_scores_gemma":[0.000020213867,0.0001891089,0.00073169573,0.000026646983,0.00003783264,0.0007661387,0.00004416011,0.6881127,0.0237777,0.23597933,0.05025633,0.000058241953],"about_ca_topic_score_codex":0.000874174,"about_ca_topic_score_gemma":0.00072014215,"teacher_disagreement_score":0.002442743,"about_ca_system_score_codex":0.0005887339,"about_ca_system_score_gemma":0.00038150043,"threshold_uncertainty_score":0.008171797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022773188,0.00014398395,0.97412825,0.00012496902,0.000022993445,0.0000966234,0.000060053102,0.0011066196,0.0015433478],"genre_scores_gemma":[0.29815134,0.00028722038,0.69874686,0.00013180882,0.000024253239,0.0003063358,0.0004024478,0.0003742909,0.0015754214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965262,0.0014823632,0.00037969236,0.00030757984,0.0010961478,0.00020806259],"domain_scores_gemma":[0.99066204,0.0054149204,0.00049728475,0.0023802621,0.0009324214,0.000113094415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048899557,0.0004904437,0.0009642715,0.0008244598,0.00030699844,0.0011675395,0.0012758055,0.0008039105,0.0018657481],"category_scores_gemma":[0.014678751,0.0004174222,0.0011399877,0.0008480695,0.0014289662,0.0031534322,0.0024340427,0.0019820633,0.0006288484],"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.0006208737,0.00023015086,0.0030050331,0.00067855936,0.000113376365,0.00043176344,0.000939894,0.25919282,0.063193195,0.365023,0.0019380342,0.30463332],"study_design_scores_gemma":[0.00008602249,0.00013659087,0.00023991059,0.00006657955,0.000054582888,0.00012453974,0.00006261248,0.8451135,0.0500945,0.09825954,0.0057348707,0.000026724518],"about_ca_topic_score_codex":0.0006302065,"about_ca_topic_score_gemma":0.0008614049,"teacher_disagreement_score":0.0048899557,"about_ca_system_score_codex":0.00075863244,"about_ca_system_score_gemma":0.0015349282,"threshold_uncertainty_score":0.025860846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016509311,0.00010724505,0.98649466,0.00014220376,0.00005344473,0.00007889006,0.00013909997,0.0055243336,0.005809199],"genre_scores_gemma":[0.15205902,0.00060523534,0.8277397,0.0002659448,0.000121884565,0.0004820918,0.0015797002,0.006161439,0.010985007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700755,0.0007766053,0.0001685502,0.0003666692,0.0014642178,0.00021645124],"domain_scores_gemma":[0.9956949,0.0018031704,0.00021620213,0.0012979181,0.00092936534,0.000058426904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020725676,0.0009957207,0.00068839977,0.0022615294,0.0010779332,0.0023992998,0.0016250917,0.00080884586,0.014679778],"category_scores_gemma":[0.009619105,0.0007389417,0.0015673402,0.0018105368,0.001524549,0.0031649137,0.0028578313,0.0029522774,0.004233396],"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.00018063812,0.00014168904,0.0010927377,0.00037714627,0.0000624667,0.0005462462,0.00079655834,0.019027248,0.01584016,0.64776516,0.014145802,0.30002412],"study_design_scores_gemma":[0.00007105161,0.000057202862,0.00031632886,0.00015087801,0.000055255423,0.0004526554,0.0001985504,0.2309673,0.047265336,0.6305448,0.0898675,0.000053213724],"about_ca_topic_score_codex":0.0013953927,"about_ca_topic_score_gemma":0.0010946268,"teacher_disagreement_score":0.014679778,"about_ca_system_score_codex":0.0011360964,"about_ca_system_score_gemma":0.0016817781,"threshold_uncertainty_score":0.049108803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19228704,0.005597035,0.64794874,0.0043833684,0.00040100713,0.00009742968,0.00039560682,0.00044269243,0.14844708],"genre_scores_gemma":[0.9495094,0.0010074796,0.038823653,0.00024594078,0.00020365207,0.000117192496,0.00016370039,0.000055720793,0.009873258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990601,0.00027524933,0.000061700746,0.00017738431,0.000281967,0.00014361608],"domain_scores_gemma":[0.9984432,0.00088364276,0.00015350255,0.00019181122,0.00018349751,0.00014432336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089499,0.00039827934,0.0002964259,0.0019289734,0.0011874806,0.002817165,0.00086181494,0.0009839883,0.0035201872],"category_scores_gemma":[0.0026548633,0.00022440459,0.0007586072,0.0013253418,0.005998342,0.0057236757,0.0018617078,0.0014850419,0.00023879475],"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.000004448939,0.0000022884192,0.0000944944,0.000013170688,0.0000017227927,0.00001889657,0.00010448151,0.0008320937,0.00017822142,0.9968604,0.000122746,0.001767137],"study_design_scores_gemma":[0.0000024725537,0.000009741998,0.00021321006,0.000011921493,0.0000032913583,0.000066507586,0.000110856075,0.0049264627,0.00028020775,0.9891344,0.005231387,0.000009489328],"about_ca_topic_score_codex":0.0028411653,"about_ca_topic_score_gemma":0.00167039,"teacher_disagreement_score":0.0035201872,"about_ca_system_score_codex":0.0027034625,"about_ca_system_score_gemma":0.0008818355,"threshold_uncertainty_score":0.019615054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2990657,0.0015500496,0.5979917,0.0040612095,0.00042492672,0.00014295988,0.0014935232,0.00052558084,0.09474429],"genre_scores_gemma":[0.9244136,0.0006107524,0.058571313,0.00075102126,0.0001416763,0.00017014601,0.0008912319,0.00008607282,0.014364062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980868,0.0004272331,0.00017691635,0.00049914635,0.00046224418,0.00034761828],"domain_scores_gemma":[0.9960765,0.0019779508,0.0002999734,0.0004628672,0.00089601317,0.00028672433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026048287,0.00056180125,0.0006133395,0.0011699075,0.0013505059,0.003082549,0.00097509346,0.0012268907,0.0059964913],"category_scores_gemma":[0.005011192,0.00054803374,0.0013812147,0.0011824646,0.0049768053,0.011807278,0.004647884,0.003619962,0.0010018279],"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.00001060657,0.000009867043,0.00017570236,0.000033177806,0.000005365939,0.000057408066,0.00027913813,0.0002828401,0.00056057324,0.9956852,0.0005017266,0.0023984306],"study_design_scores_gemma":[0.000011175122,0.0000152423645,0.00035664145,0.000009420273,0.000006740441,0.00009682683,0.00014134421,0.0020102488,0.000975871,0.9915206,0.0048438148,0.000012155147],"about_ca_topic_score_codex":0.0019171897,"about_ca_topic_score_gemma":0.0016421409,"teacher_disagreement_score":0.0059964913,"about_ca_system_score_codex":0.0014303855,"about_ca_system_score_gemma":0.00094773737,"threshold_uncertainty_score":0.0200603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038615495,0.00020350506,0.98564273,0.00042552172,0.0000721207,0.000055902976,0.0000737282,0.0006749598,0.008990075],"genre_scores_gemma":[0.16913065,0.0009153217,0.81943935,0.0004363564,0.0001534599,0.00018028254,0.00033053962,0.0005391048,0.008874839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987758,0.0003346968,0.000090506255,0.00030332705,0.00035990332,0.00013579539],"domain_scores_gemma":[0.99855906,0.0007822265,0.00006741526,0.0003390271,0.0001744977,0.00007778171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020072295,0.00069880055,0.0007653131,0.0024856795,0.0025855296,0.0039472305,0.003344089,0.0021757518,0.008710247],"category_scores_gemma":[0.0037421642,0.0009698827,0.002081129,0.0025766739,0.005122249,0.008216525,0.0036423611,0.0044311667,0.0023425417],"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.0000066741736,0.000009163739,0.000044741773,0.00003214002,0.0000057521474,0.00007091438,0.00012597324,0.0026121228,0.0008200407,0.9851011,0.00049261906,0.0106787495],"study_design_scores_gemma":[0.000004125693,0.000007214308,0.000030035344,0.0000103895345,0.000009345593,0.000066329456,0.000027900733,0.008375174,0.0011531262,0.983225,0.007078992,0.0000123349355],"about_ca_topic_score_codex":0.002293098,"about_ca_topic_score_gemma":0.0026602168,"teacher_disagreement_score":0.008710247,"about_ca_system_score_codex":0.002018499,"about_ca_system_score_gemma":0.0016292018,"threshold_uncertainty_score":0.029138625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007613944,0.000095526026,0.98672163,0.00019241584,0.000056313664,0.00007650008,0.00004753986,0.00065005384,0.004546119],"genre_scores_gemma":[0.3716259,0.0006167455,0.61913323,0.00020394514,0.00014727349,0.000659603,0.00016650312,0.0002480779,0.007198658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968479,0.0007722751,0.00035611712,0.0002769024,0.0014079172,0.0003387776],"domain_scores_gemma":[0.99775714,0.0010951295,0.00027380642,0.0003041323,0.00045250586,0.000117416144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003978304,0.0005783461,0.0008621542,0.000709502,0.0012500784,0.0027676208,0.0012820543,0.0011614088,0.0019145465],"category_scores_gemma":[0.0045945416,0.00070885796,0.0011994845,0.0010033905,0.0030109147,0.0023277623,0.0018906478,0.0020046046,0.00055135816],"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.000055600372,0.0000611421,0.00027199794,0.00008923806,0.000027244534,0.0007167995,0.00048657955,0.048544604,0.00704271,0.93014073,0.0006366027,0.011926794],"study_design_scores_gemma":[0.00011396644,0.00006560364,0.0001765672,0.0000726234,0.00006841152,0.00032857677,0.00013114366,0.5097061,0.014428083,0.4457189,0.029127695,0.00006235192],"about_ca_topic_score_codex":0.0031263935,"about_ca_topic_score_gemma":0.0022488357,"teacher_disagreement_score":0.003978304,"about_ca_system_score_codex":0.0012847676,"about_ca_system_score_gemma":0.0034151475,"threshold_uncertainty_score":0.021039486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01484019,0.0003106829,0.9540645,0.0009846172,0.00027027758,0.00013686152,0.00030203967,0.008269206,0.020821651],"genre_scores_gemma":[0.50321305,0.00062894303,0.4710033,0.0010310863,0.00028137234,0.00048655184,0.00075448304,0.0020294392,0.020571748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979367,0.00047794994,0.00013077007,0.00029454406,0.0008443558,0.00031570115],"domain_scores_gemma":[0.9965959,0.0015790232,0.00019742176,0.0011868629,0.000353245,0.00008750235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017610866,0.0005278793,0.00048436224,0.0009501808,0.00086544733,0.0022465622,0.002162281,0.0008236552,0.0071988334],"category_scores_gemma":[0.004489985,0.0007779719,0.0012011742,0.00057688827,0.0041276226,0.0049783518,0.0037455272,0.003059301,0.0012833012],"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.00013957273,0.000091239184,0.0005193422,0.00022985639,0.0000250764,0.00043934825,0.00067171094,0.025755024,0.010263054,0.9200235,0.0053843786,0.03645788],"study_design_scores_gemma":[0.00015895972,0.000094247545,0.0002847512,0.00012652096,0.00006230547,0.00029446871,0.00013868601,0.13963224,0.041587602,0.7618075,0.05573608,0.000076676806],"about_ca_topic_score_codex":0.0020761944,"about_ca_topic_score_gemma":0.0026843143,"teacher_disagreement_score":0.0071988334,"about_ca_system_score_codex":0.001306913,"about_ca_system_score_gemma":0.0017447193,"threshold_uncertainty_score":0.024082541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029806392,0.0002570811,0.9888815,0.00054624496,0.00013061502,0.000049285012,0.00016953677,0.0006908487,0.0062942365],"genre_scores_gemma":[0.27691397,0.0010160682,0.70628536,0.00058838277,0.00036120904,0.0003271759,0.0006329262,0.0005429611,0.013331904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958675,0.0011855707,0.0003784539,0.0008464444,0.0013926977,0.00032942396],"domain_scores_gemma":[0.99603397,0.0018562251,0.000239269,0.0011096718,0.0006727817,0.00008817237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004439808,0.000641686,0.00071953575,0.0012308288,0.0012556219,0.0036739907,0.0024526487,0.0009095242,0.006445293],"category_scores_gemma":[0.005611058,0.0005721415,0.0020034066,0.0012955101,0.0040269834,0.009107112,0.0030341013,0.0033807068,0.0019114983],"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.000020407673,0.000010644887,0.000038773967,0.00006155388,0.0000059087133,0.000034480097,0.00017199782,0.0013167681,0.0006245108,0.9869473,0.0006405828,0.010127067],"study_design_scores_gemma":[0.0000427031,0.000030921827,0.00006632752,0.000030752082,0.000021296286,0.00013650443,0.00006825908,0.023849228,0.0056300457,0.92764044,0.042456467,0.000027059692],"about_ca_topic_score_codex":0.001594089,"about_ca_topic_score_gemma":0.0016213161,"teacher_disagreement_score":0.006445293,"about_ca_system_score_codex":0.0022683297,"about_ca_system_score_gemma":0.0020307968,"threshold_uncertainty_score":0.023480177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006835599,0.0001223931,0.9833346,0.0006786521,0.00009954011,0.0000876609,0.00006929953,0.0002557805,0.008516614],"genre_scores_gemma":[0.5560447,0.00042205196,0.42809948,0.00044107452,0.00022118505,0.0006616395,0.00021507575,0.00016777728,0.013727021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975802,0.0006916875,0.0001458867,0.0004194663,0.00087528344,0.00028751802],"domain_scores_gemma":[0.9980615,0.0007572613,0.0001667321,0.00054105656,0.00030329198,0.00017023283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462358,0.00066914,0.0008247516,0.00071622216,0.0012217142,0.0029573194,0.002815424,0.0016482658,0.0048415],"category_scores_gemma":[0.0038266806,0.00042928563,0.0014464856,0.0008563947,0.0038470859,0.0054277102,0.0032356817,0.0029571042,0.00096654665],"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.000012418787,0.000020227006,0.000059160615,0.000019437397,0.000005128581,0.000059952246,0.00011192023,0.012747971,0.00062086654,0.9837943,0.00035495692,0.0021938311],"study_design_scores_gemma":[0.000046036825,0.00004364119,0.000053141852,0.000020994097,0.00001574779,0.00009331418,0.000043284974,0.25841662,0.0016304412,0.7267823,0.012833663,0.000020687034],"about_ca_topic_score_codex":0.002165926,"about_ca_topic_score_gemma":0.001691725,"teacher_disagreement_score":0.0048415,"about_ca_system_score_codex":0.0019193132,"about_ca_system_score_gemma":0.0019907325,"threshold_uncertainty_score":0.01619643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010883594,0.004593987,0.8916559,0.003143012,0.00076098624,0.0001669178,0.0007029895,0.00068974035,0.08740286],"genre_scores_gemma":[0.4928765,0.006444716,0.44489798,0.0021823004,0.002204553,0.0009764031,0.0016639269,0.00025929094,0.048494402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980106,0.0004700232,0.00015363663,0.00035882046,0.0007528196,0.00025414312],"domain_scores_gemma":[0.9988502,0.00044717774,0.00012422568,0.00013851005,0.00029528583,0.00014461248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002789397,0.000765954,0.0010036937,0.002149614,0.0026244435,0.0036512443,0.0022317702,0.0015054825,0.0095098065],"category_scores_gemma":[0.003085761,0.00046415548,0.0020709676,0.002361517,0.0043570255,0.007465553,0.0031136184,0.0036522038,0.0025469495],"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.0000032361525,0.000006432072,0.000019819849,0.000018870183,0.0000030423405,0.000041085583,0.00007500126,0.00043278004,0.00013731461,0.9975581,0.0003503219,0.0013539572],"study_design_scores_gemma":[0.000006138134,0.0000050755275,0.000025859912,0.000009139531,0.000005493452,0.000042561605,0.000019739637,0.0025674067,0.00012705762,0.9876243,0.00956028,0.000006903198],"about_ca_topic_score_codex":0.00342139,"about_ca_topic_score_gemma":0.0023965964,"teacher_disagreement_score":0.0095098065,"about_ca_system_score_codex":0.0025416068,"about_ca_system_score_gemma":0.0022547108,"threshold_uncertainty_score":0.031813443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040289513,0.00009115681,0.959177,0.0002172997,0.00008169717,0.00010926931,0.00029230525,0.033473477,0.0025289448],"genre_scores_gemma":[0.11630169,0.00021770252,0.87138134,0.000531287,0.00013533399,0.0004102939,0.0013281795,0.0035224315,0.006171745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704295,0.0008374594,0.0003485249,0.00069869065,0.0008304432,0.00024190356],"domain_scores_gemma":[0.9942444,0.002324949,0.00038301767,0.001999125,0.00070023397,0.0003481952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00583013,0.0009619013,0.0011204429,0.0024568944,0.001531035,0.0056094276,0.0036967567,0.0021915692,0.010241272],"category_scores_gemma":[0.008462995,0.0014396104,0.002061827,0.0016391753,0.004250179,0.012849707,0.007591551,0.003407436,0.0032468617],"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.0006649649,0.00021550196,0.0035259482,0.00086615107,0.00030295155,0.0007856489,0.00274895,0.015395009,0.022102188,0.75825566,0.032551102,0.16258593],"study_design_scores_gemma":[0.00032114403,0.00021058791,0.0011435711,0.00023224804,0.00039427963,0.0010980817,0.00037681655,0.31549573,0.04182113,0.42159224,0.21694253,0.0003716848],"about_ca_topic_score_codex":0.0038251814,"about_ca_topic_score_gemma":0.0034231073,"teacher_disagreement_score":0.010241272,"about_ca_system_score_codex":0.0014825029,"about_ca_system_score_gemma":0.0031663838,"threshold_uncertainty_score":0.03426045},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005433189,0.0004568851,0.98246366,0.002417032,0.00020330983,0.00015051378,0.00008819201,0.0006130222,0.008174144],"genre_scores_gemma":[0.2566502,0.0017944418,0.7290528,0.0019016498,0.0006177175,0.00052136416,0.0006152353,0.0007795176,0.008067138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9649392,0.013862469,0.0023442027,0.0035192932,0.013230221,0.002104677],"domain_scores_gemma":[0.9561017,0.01902982,0.0018270216,0.013292524,0.009057407,0.00069148495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021760853,0.001417919,0.0015812328,0.0024051366,0.002934487,0.0062968293,0.0041286084,0.0052247755,0.0042015137],"category_scores_gemma":[0.048306864,0.0022981402,0.003704851,0.0016614675,0.016596267,0.017553316,0.011739892,0.016478846,0.0028033853],"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.000058381323,0.00003579782,0.0003108818,0.00018470606,0.0000326605,0.00012214696,0.00091336726,0.004767359,0.0017668084,0.9769056,0.0014018374,0.013500581],"study_design_scores_gemma":[0.000051555657,0.000041595213,0.000110365545,0.00009765098,0.000034506735,0.0000986961,0.00014526576,0.02605302,0.005782758,0.949451,0.018108964,0.00002450044],"about_ca_topic_score_codex":0.002283822,"about_ca_topic_score_gemma":0.0011940462,"teacher_disagreement_score":0.021760853,"about_ca_system_score_codex":0.0033844134,"about_ca_system_score_gemma":0.0058228546,"threshold_uncertainty_score":0.115083754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028329404,0.00006341807,0.96804374,0.00023231305,0.000022918834,0.00009099783,0.00006162373,0.00089401583,0.0022616177],"genre_scores_gemma":[0.4185867,0.0003546845,0.5772649,0.00048084185,0.0000350998,0.00023507442,0.0003419126,0.00026897146,0.0024318234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963659,0.0012939867,0.00027851766,0.00054576684,0.0010762782,0.0004395178],"domain_scores_gemma":[0.9939175,0.0041840877,0.00027940786,0.00078663323,0.0006948412,0.00013756497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034874503,0.001001522,0.00064408605,0.0015489248,0.0010893833,0.0013461149,0.0013565097,0.0009754527,0.0019179226],"category_scores_gemma":[0.0076735606,0.0010426447,0.00251369,0.0008907871,0.003405683,0.0032522855,0.003324293,0.0027175844,0.00068210496],"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.00047028178,0.00032855044,0.003339818,0.0005227165,0.00021978041,0.001612431,0.0016062558,0.079261385,0.091516666,0.7406913,0.0017957963,0.07863514],"study_design_scores_gemma":[0.00021271521,0.00036312378,0.0009817288,0.00010546212,0.00018755713,0.00035546787,0.00028490118,0.3547706,0.09345008,0.5380118,0.011169424,0.00010713751],"about_ca_topic_score_codex":0.012815409,"about_ca_topic_score_gemma":0.009511361,"teacher_disagreement_score":0.012815409,"about_ca_system_score_codex":0.001320203,"about_ca_system_score_gemma":0.0021980498,"threshold_uncertainty_score":0.025481641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64277184,0.00021977027,0.31018326,0.0031923582,0.00020849014,0.0020668556,0.00050665665,0.022188,0.0186628],"genre_scores_gemma":[0.7460486,0.00018388977,0.238569,0.0004435742,0.00002363937,0.00044878275,0.0005017666,0.0007437557,0.013036953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991862,0.00033001625,0.00007592046,0.00011060413,0.00018473629,0.000112546855],"domain_scores_gemma":[0.9977418,0.0008321304,0.00012025929,0.0005052715,0.00029958395,0.00050097576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201671,0.00039149408,0.00036915438,0.0004126486,0.0006280919,0.0009870586,0.002050601,0.0015630629,0.004963291],"category_scores_gemma":[0.0035007028,0.0003839334,0.00035160666,0.0003494604,0.0007104198,0.0011920257,0.0012465086,0.0010593105,0.0014187692],"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.0026580323,0.0075077247,0.030917505,0.002039565,0.00020656534,0.016650688,0.021403868,0.05287495,0.18178573,0.017996455,0.03656354,0.6293955],"study_design_scores_gemma":[0.0029441589,0.010449069,0.04684679,0.0006462961,0.00031506966,0.013049846,0.01234806,0.53935194,0.17749195,0.015028863,0.18108247,0.0004454213],"about_ca_topic_score_codex":0.0045620343,"about_ca_topic_score_gemma":0.003765734,"teacher_disagreement_score":0.004963291,"about_ca_system_score_codex":0.00056258496,"about_ca_system_score_gemma":0.00088655006,"threshold_uncertainty_score":0.016603827},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090107955,0.005786701,0.66899717,0.006991972,0.0010476003,0.00014564156,0.00027194357,0.00091264414,0.22573842],"genre_scores_gemma":[0.85733,0.0023730847,0.09559729,0.0025398175,0.0006324403,0.00030217753,0.00039273046,0.0004022739,0.040430263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962895,0.0011715955,0.0002518746,0.00085691654,0.00072379946,0.00070636475],"domain_scores_gemma":[0.9933687,0.0035186918,0.00041875694,0.0011458953,0.001074343,0.00047373632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056356313,0.0006110973,0.0009020031,0.0019408894,0.0031070951,0.003143477,0.0013392128,0.0012093241,0.006837697],"category_scores_gemma":[0.0065507367,0.00059985137,0.0018161461,0.0015279738,0.011672281,0.009731121,0.0067837895,0.0038983559,0.0013903287],"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.0000093559265,0.000011823368,0.00021965578,0.000022720607,0.0000036972383,0.00009037784,0.0002459181,0.00018145944,0.00031224173,0.99464685,0.0005441001,0.0037117286],"study_design_scores_gemma":[0.000006279209,0.0000075739113,0.00011876042,0.0000147490455,0.0000055967125,0.00009462458,0.00007732968,0.0007862062,0.0008160514,0.99209994,0.0059656757,0.0000071846493],"about_ca_topic_score_codex":0.0015795407,"about_ca_topic_score_gemma":0.0015178914,"teacher_disagreement_score":0.006837697,"about_ca_system_score_codex":0.0019109944,"about_ca_system_score_gemma":0.0010999438,"threshold_uncertainty_score":0.029804409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024810309,0.0006081254,0.9686419,0.0006561253,0.00014151365,0.00005692233,0.00010225833,0.0005161644,0.0044666645],"genre_scores_gemma":[0.46181133,0.00083792955,0.5278005,0.00048218208,0.00029669033,0.00018591681,0.00042047602,0.0006065119,0.0075584417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913345,0.0027050031,0.0005116186,0.0014240724,0.003381267,0.0006435776],"domain_scores_gemma":[0.9725079,0.017703094,0.0019523868,0.005702621,0.0014486433,0.0006853558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008533556,0.0011666212,0.0015874283,0.0017133858,0.00089578214,0.0046252683,0.0027194952,0.0025662198,0.0077866716],"category_scores_gemma":[0.03976337,0.0009751976,0.002599873,0.0014569076,0.0031643226,0.011345412,0.004925008,0.0065756654,0.0012860126],"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.0003492827,0.0000710296,0.0007962198,0.00022201355,0.00007024467,0.00013403944,0.0007551679,0.103547834,0.004926634,0.8565634,0.00090696884,0.031657062],"study_design_scores_gemma":[0.0000474541,0.00007372081,0.00022760771,0.00006795107,0.000045677396,0.000116042516,0.0001047794,0.5067923,0.002845304,0.4840656,0.0055724797,0.000041002164],"about_ca_topic_score_codex":0.0032188916,"about_ca_topic_score_gemma":0.0026772995,"teacher_disagreement_score":0.008533556,"about_ca_system_score_codex":0.0032813624,"about_ca_system_score_gemma":0.0015688908,"threshold_uncertainty_score":0.045130253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00979589,0.00075329095,0.97233766,0.0007956414,0.00018400885,0.00021442823,0.00020724295,0.002663966,0.013047802],"genre_scores_gemma":[0.16185787,0.0018837067,0.81338435,0.0007565901,0.00046269523,0.0003623086,0.001264527,0.0014667098,0.018561225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520725,0.001641759,0.0002846033,0.00077723456,0.0015462087,0.00054288394],"domain_scores_gemma":[0.99163073,0.0041237376,0.00016894058,0.0018816361,0.0019186859,0.00027629035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007290433,0.00080572924,0.0010321267,0.0015939813,0.0011943033,0.0034289765,0.002353488,0.0010362704,0.026570503],"category_scores_gemma":[0.0144133,0.0010445706,0.0020592296,0.0011685303,0.0016976764,0.011735234,0.0036070822,0.0050804997,0.004293152],"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.0005776238,0.0004797706,0.00264586,0.0010438997,0.000121483405,0.0005207781,0.0011073819,0.009866877,0.027487688,0.5225675,0.017286157,0.41629496],"study_design_scores_gemma":[0.00030571033,0.0008348619,0.0023977489,0.0005078913,0.00034803714,0.0017275286,0.0005779043,0.17471768,0.12504762,0.35497624,0.33820575,0.00035298325],"about_ca_topic_score_codex":0.0040536295,"about_ca_topic_score_gemma":0.0023604836,"teacher_disagreement_score":0.026570503,"about_ca_system_score_codex":0.001754521,"about_ca_system_score_gemma":0.0030017605,"threshold_uncertainty_score":0.088887155},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013771887,0.009229353,0.009340804,0.018518496,0.045675,0.00044747413,0.0123281805,0.0020589628,0.90102446],"genre_scores_gemma":[0.0072745974,0.0053190226,0.004110636,0.004291115,0.006048562,0.00025508282,0.012717505,0.0011199621,0.95886344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986395,0.0002073646,0.00011775468,0.00029938002,0.0006004392,0.00013554179],"domain_scores_gemma":[0.9968946,0.00053654885,0.00013973001,0.000461514,0.0015215916,0.0004459323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014475418,0.0010181245,0.0009943158,0.002658274,0.0025667837,0.005116653,0.0018369386,0.001989757,0.55700994],"category_scores_gemma":[0.008043495,0.0004797781,0.0008310213,0.002793476,0.0008158681,0.0046294653,0.003066962,0.003011892,0.3913477],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004265638,0.00002696222,0.00016820288,0.00016526192,0.0000044271746,0.000058886857,0.00014671279,0.00011754016,0.00017894075,0.014918295,0.92557627,0.05859588],"study_design_scores_gemma":[0.0000034764064,0.000011441271,0.00021206673,0.000092032984,0.0000014784623,0.000050030358,0.00007767349,0.00003730677,0.00006567472,0.0033932847,0.99605113,0.0000044389094],"about_ca_topic_score_codex":0.0034267856,"about_ca_topic_score_gemma":0.0042030998,"teacher_disagreement_score":0.55700994,"about_ca_system_score_codex":0.0025663674,"about_ca_system_score_gemma":0.0026732336,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010635976,0.0096998485,0.0044603627,0.02130132,0.09029973,0.00042901776,0.011059909,0.00217304,0.85951316],"genre_scores_gemma":[0.0035546857,0.004573725,0.0018270047,0.0043968246,0.011405252,0.0001694385,0.009609769,0.0009420027,0.9635213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865013,0.00015805133,0.00009461342,0.00027455267,0.0006943524,0.00012825828],"domain_scores_gemma":[0.996736,0.0005120342,0.0001274329,0.00037562125,0.0016159051,0.00063296926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589188,0.001135238,0.001046597,0.0026883266,0.002357687,0.005967073,0.0018360023,0.0018108194,0.6504344],"category_scores_gemma":[0.0071475552,0.00039845897,0.0007920646,0.0025872642,0.00071917067,0.004336403,0.0030494449,0.00267041,0.47859225],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026498717,0.000019787884,0.00009756522,0.000116421696,0.000002464311,0.000035832938,0.0000786723,0.000043774035,0.00011787854,0.003941428,0.94875395,0.046765715],"study_design_scores_gemma":[0.0000022553675,0.000008895245,0.00013335457,0.000059299055,0.0000010752182,0.000039517774,0.000050629977,0.000017881617,0.00003828558,0.0009147246,0.9987312,0.0000028298764],"about_ca_topic_score_codex":0.0023930443,"about_ca_topic_score_gemma":0.0030309656,"teacher_disagreement_score":0.6504344,"about_ca_system_score_codex":0.0018985766,"about_ca_system_score_gemma":0.002291048,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35626248,0.0026743803,0.40363386,0.009484891,0.00048766367,0.00004800562,0.00035545544,0.0006107087,0.22644249],"genre_scores_gemma":[0.97819513,0.00035183178,0.011922224,0.0003160613,0.000116818985,0.000026961,0.00005871059,0.000042518113,0.008969811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986303,0.0003376895,0.00005540273,0.00021020474,0.00057123014,0.00019527704],"domain_scores_gemma":[0.9989417,0.00034814086,0.00010050476,0.00020584905,0.00021308454,0.00019077472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012974914,0.00030665766,0.00040549296,0.00097131374,0.0020052867,0.003712034,0.001100536,0.0008855691,0.0032714037],"category_scores_gemma":[0.0019232697,0.00026935534,0.00076104695,0.00091756653,0.007125182,0.0054697567,0.0035457686,0.0022505482,0.00042009118],"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.0000026879052,0.0000018807798,0.00006280358,0.000003960109,7.538226e-7,0.000018870292,0.00017999782,0.00018666578,0.00008771347,0.9985739,0.000086365224,0.0007943164],"study_design_scores_gemma":[0.0000044977965,0.0000072082025,0.000107367036,0.000006157358,0.0000026663865,0.000053247542,0.00011095771,0.0017890172,0.00021132035,0.9927604,0.004941322,0.000005773495],"about_ca_topic_score_codex":0.0028563926,"about_ca_topic_score_gemma":0.00159254,"teacher_disagreement_score":0.003712034,"about_ca_system_score_codex":0.0032012078,"about_ca_system_score_gemma":0.0014333875,"threshold_uncertainty_score":0.02322644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18793647,0.0047001224,0.7146306,0.0019723866,0.0004609183,0.000079192876,0.00021140752,0.00041197983,0.08959686],"genre_scores_gemma":[0.890798,0.001262212,0.077548996,0.00067984953,0.00044688082,0.00009779852,0.00012877719,0.000084373314,0.028953167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928707,0.00019965591,0.000039259205,0.00015958709,0.00019920383,0.00011525856],"domain_scores_gemma":[0.9994429,0.00014984765,0.00008885582,0.00011392907,0.00010197198,0.000102429876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263273,0.00040775185,0.00039768557,0.0012627814,0.0010224311,0.0020497015,0.00066598854,0.0005723641,0.0034138106],"category_scores_gemma":[0.0010810158,0.00030846568,0.00088417873,0.0008460424,0.0038868163,0.005223613,0.002134827,0.0013650871,0.000503178],"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.0000069858115,0.0000060869997,0.00009766694,0.000013172017,0.000002840155,0.000030318659,0.00010747709,0.00016767226,0.0005266273,0.9964647,0.00013816002,0.00243836],"study_design_scores_gemma":[0.000010754326,0.000043731205,0.00032521202,0.000013060278,0.0000085209895,0.00021922417,0.00006703958,0.0040030917,0.0016440569,0.9792717,0.014379555,0.000013968591],"about_ca_topic_score_codex":0.0007124202,"about_ca_topic_score_gemma":0.00060123194,"teacher_disagreement_score":0.0034138106,"about_ca_system_score_codex":0.0010591923,"about_ca_system_score_gemma":0.00092367025,"threshold_uncertainty_score":0.01142031},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5635803,0.00057755364,0.41433966,0.00036204327,0.00032403294,0.00072576094,0.0013821945,0.007110024,0.011598466],"genre_scores_gemma":[0.9215233,0.00036810615,0.070901096,0.00009578925,0.000024872144,0.00029100245,0.0006114365,0.0001950829,0.0059893527],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998692,0.000046222074,0.000009912958,0.000017384233,0.000045282177,0.000011929075],"domain_scores_gemma":[0.9995302,0.00024835617,0.000021386406,0.000064159685,0.00007909369,0.00005691067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023654006,0.000535103,0.0002543508,0.00030940698,0.000113231246,0.00038167904,0.0005738791,0.00049854134,0.0059236013],"category_scores_gemma":[0.0008491789,0.00012439712,0.0002902635,0.00011605172,0.00020559592,0.00028935418,0.00036686345,0.00034539032,0.000733784],"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.004671599,0.0017591002,0.0074647265,0.0013668448,0.00022709294,0.0042276564,0.001538681,0.22730523,0.513531,0.008036121,0.012713868,0.21715803],"study_design_scores_gemma":[0.000778794,0.007979126,0.013052568,0.00015970529,0.00027245478,0.005773696,0.00027602338,0.73778254,0.19401045,0.003378381,0.036325287,0.00021102985],"about_ca_topic_score_codex":0.00091469305,"about_ca_topic_score_gemma":0.00053245586,"teacher_disagreement_score":0.0059236013,"about_ca_system_score_codex":0.00014734069,"about_ca_system_score_gemma":0.0002467953,"threshold_uncertainty_score":0.019816399},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16680205,0.0019802,0.7717165,0.0023668031,0.00022421879,0.0000542491,0.0005920202,0.00037404004,0.055889998],"genre_scores_gemma":[0.9460638,0.0005522307,0.04618921,0.00048526647,0.00042374164,0.000104352024,0.00035540934,0.000092588154,0.005733391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746287,0.00053989986,0.00016116227,0.0004898889,0.0010402009,0.00030602393],"domain_scores_gemma":[0.99567705,0.0021747965,0.00042669574,0.0005080032,0.0007587185,0.00045470888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026113805,0.0005318112,0.00071733654,0.0044057607,0.0015169197,0.0034631584,0.0012356226,0.0010348526,0.0037268165],"category_scores_gemma":[0.00486319,0.00041835973,0.00094827655,0.002104301,0.0064154887,0.007458024,0.003652582,0.0027788854,0.00035041737],"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.000006250594,0.00000904424,0.00039428714,0.0000206499,0.00000648209,0.000030936146,0.0001614525,0.000553782,0.00079139014,0.995427,0.00018360125,0.002415054],"study_design_scores_gemma":[0.0000050026,0.000029429939,0.0011577046,0.00001811795,0.000011530625,0.00015857097,0.000077841185,0.00699687,0.0009362958,0.9857802,0.004806762,0.000021702468],"about_ca_topic_score_codex":0.0008038001,"about_ca_topic_score_gemma":0.00060587126,"teacher_disagreement_score":0.0044057607,"about_ca_system_score_codex":0.0014821663,"about_ca_system_score_gemma":0.0006135596,"threshold_uncertainty_score":0.013810456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021076307,0.0001315617,0.9618774,0.00050146336,0.00012014766,0.00010922388,0.00021373703,0.00090669986,0.015063356],"genre_scores_gemma":[0.5170851,0.00033887968,0.46909508,0.00053928833,0.00016983028,0.00056660734,0.0005239464,0.000442605,0.011238712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908507,0.0001509248,0.00011449584,0.0001569148,0.00033501314,0.00015760935],"domain_scores_gemma":[0.99901044,0.000308948,0.00009221746,0.00022531279,0.00026710256,0.00009591211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608645,0.00064667093,0.0005178726,0.0008812068,0.0011081488,0.0021718256,0.0013226445,0.00086992054,0.005077847],"category_scores_gemma":[0.0017381286,0.00049924327,0.0012642834,0.000766196,0.0036320847,0.0041758143,0.0027205313,0.0018303947,0.00075969775],"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.000024177034,0.000019953595,0.00013423982,0.0000646948,0.000007748297,0.000115734874,0.000299574,0.006790058,0.0030443554,0.98154014,0.000553155,0.0074060992],"study_design_scores_gemma":[0.00003283838,0.000065943525,0.00012424636,0.00003517115,0.000033512926,0.0001605468,0.0002206887,0.07362053,0.006450801,0.89531183,0.02391556,0.000028349545],"about_ca_topic_score_codex":0.0018406152,"about_ca_topic_score_gemma":0.0018009036,"teacher_disagreement_score":0.005077847,"about_ca_system_score_codex":0.001029849,"about_ca_system_score_gemma":0.0016778039,"threshold_uncertainty_score":0.016987085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5352656,0.0023284748,0.40989062,0.003153426,0.0002709814,0.0005208557,0.0018950109,0.0023466186,0.044328388],"genre_scores_gemma":[0.8038786,0.0015551033,0.16897213,0.0011366121,0.000377299,0.0004655339,0.0038364928,0.0006804153,0.019097857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988913,0.00015124533,0.000046327896,0.0003785575,0.0002040721,0.00032849977],"domain_scores_gemma":[0.996869,0.0016537228,0.00034843353,0.00051561475,0.0002144386,0.0003988251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064104574,0.0009870558,0.0008218682,0.0020557109,0.002437842,0.0031523649,0.0015589183,0.0012045486,0.0076694884],"category_scores_gemma":[0.00414496,0.0006636623,0.0009895264,0.0024981424,0.0017623075,0.0043694107,0.0019342538,0.0020469704,0.0008788665],"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.0010326009,0.00061371044,0.007574693,0.00062543154,0.00012436998,0.00076938927,0.0014383037,0.10855266,0.022043174,0.6311655,0.031638097,0.19442204],"study_design_scores_gemma":[0.0002219016,0.00018805749,0.0028158727,0.00010913784,0.000056967798,0.00089973625,0.00049539586,0.25344586,0.009109531,0.70342237,0.02916216,0.00007293397],"about_ca_topic_score_codex":0.0047163186,"about_ca_topic_score_gemma":0.0046473616,"teacher_disagreement_score":0.0076694884,"about_ca_system_score_codex":0.0027185536,"about_ca_system_score_gemma":0.0013581675,"threshold_uncertainty_score":0.025656939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05357709,0.0007180762,0.92894393,0.00043729055,0.00014224263,0.000095237796,0.00010576695,0.00027114738,0.015709247],"genre_scores_gemma":[0.8370792,0.00070447894,0.1522889,0.00029436225,0.00017355187,0.00051476475,0.0002855824,0.00017576922,0.00848338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961144,0.001237516,0.00031559862,0.00076382334,0.0012192867,0.00034931183],"domain_scores_gemma":[0.9962121,0.002186192,0.00045845725,0.00035210187,0.00056093093,0.00023032482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003305269,0.0008696325,0.0007802329,0.0015732656,0.0010804763,0.0023243022,0.0010843999,0.0013031593,0.003343946],"category_scores_gemma":[0.010214178,0.0003695884,0.0012073169,0.001033817,0.003370227,0.004300648,0.0024704894,0.0025395502,0.0005863282],"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.000018732911,0.000017495098,0.00010044073,0.000020446232,0.000007632203,0.000042424366,0.0001430725,0.0052323793,0.0005916452,0.9907453,0.00010155921,0.002978887],"study_design_scores_gemma":[0.000018132965,0.000033433153,0.000075347234,0.00001837529,0.000009944237,0.00006077164,0.000036312533,0.06473133,0.0010721034,0.9314282,0.0025010826,0.000015041016],"about_ca_topic_score_codex":0.0009702224,"about_ca_topic_score_gemma":0.0005409595,"teacher_disagreement_score":0.003343946,"about_ca_system_score_codex":0.0023176947,"about_ca_system_score_gemma":0.0012507322,"threshold_uncertainty_score":0.017480135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10532238,0.0011745448,0.8811575,0.0012626578,0.00020556118,0.00021419466,0.00015147608,0.00026879355,0.010242897],"genre_scores_gemma":[0.7353059,0.0010339577,0.25885284,0.0004442601,0.00042810175,0.00046208804,0.0005934197,0.00013851402,0.0027408954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468684,0.001649773,0.0007098645,0.0011343472,0.0013034267,0.0005157759],"domain_scores_gemma":[0.98464334,0.008201283,0.0019224731,0.0021469442,0.0018809753,0.001204979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064015365,0.0010215265,0.0011290971,0.003666578,0.001361389,0.0049557136,0.0019387614,0.0030126914,0.0023145415],"category_scores_gemma":[0.018503532,0.0007890144,0.0024147653,0.0022372846,0.008214264,0.010654039,0.004397617,0.0058347667,0.00040064793],"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.00004945682,0.000073742885,0.00093908113,0.000056254445,0.000016641887,0.0000905107,0.0007659266,0.0036239484,0.0007901312,0.9813703,0.00022785354,0.01199612],"study_design_scores_gemma":[0.00002784192,0.000073065756,0.0005264614,0.000052804255,0.000017964012,0.000101023914,0.00022406041,0.042220056,0.00055844017,0.95343727,0.002733947,0.00002697538],"about_ca_topic_score_codex":0.0016837191,"about_ca_topic_score_gemma":0.00062419684,"teacher_disagreement_score":0.0064015365,"about_ca_system_score_codex":0.002074164,"about_ca_system_score_gemma":0.0018089957,"threshold_uncertainty_score":0.03385496},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010276536,0.00923586,0.004528693,0.01886346,0.07474404,0.00037684676,0.00933743,0.0019909807,0.87989503],"genre_scores_gemma":[0.0038915202,0.0046176407,0.0020438593,0.004122664,0.009418409,0.00018119112,0.008913476,0.0008933744,0.96591794],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867165,0.00016429671,0.00008931388,0.00027668296,0.0006715248,0.00012651013],"domain_scores_gemma":[0.9971137,0.0004438749,0.00010425173,0.00034612985,0.001454175,0.0005378047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011298105,0.0011456939,0.0010194989,0.0024674735,0.0023410532,0.005757213,0.0018124828,0.0017203719,0.6184471],"category_scores_gemma":[0.0069465805,0.00035330604,0.0007291357,0.0024149052,0.00071182504,0.0040610246,0.0029890807,0.002554873,0.44950667],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027240008,0.000020074378,0.000103476195,0.00011679733,0.0000024113788,0.000037134556,0.00009178943,0.00005103879,0.00012573175,0.005397417,0.9416892,0.05233768],"study_design_scores_gemma":[0.0000021589199,0.000009821689,0.0001297279,0.00006300006,0.0000010018093,0.00004251539,0.000059277918,0.000018846504,0.00004338764,0.0010912713,0.9985361,0.0000028222712],"about_ca_topic_score_codex":0.0023846556,"about_ca_topic_score_gemma":0.0028304874,"teacher_disagreement_score":0.6184471,"about_ca_system_score_codex":0.0019292515,"about_ca_system_score_gemma":0.0024135537,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001325523,0.016947435,0.006973106,0.030048648,0.1272195,0.0005066626,0.014149016,0.0024729788,0.80035704],"genre_scores_gemma":[0.0057716127,0.009297148,0.0032951005,0.006260921,0.019231603,0.00029957574,0.015298642,0.0014936641,0.9390518],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982955,0.00021868519,0.00013831515,0.00034691242,0.00086291216,0.00013767714],"domain_scores_gemma":[0.99549687,0.00081256893,0.00017822767,0.00053635327,0.0022824588,0.00069357664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015173922,0.0011318463,0.0011254477,0.0031546855,0.0023417037,0.006894658,0.0018794056,0.0017472061,0.5294501],"category_scores_gemma":[0.009914666,0.00037771047,0.00085469044,0.0031794778,0.00079162617,0.0045679286,0.0030120597,0.002655117,0.377716],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027984139,0.000017025033,0.00009945775,0.00016139969,0.0000033990143,0.000039697992,0.000109368055,0.000057867364,0.00012666412,0.004824889,0.94255465,0.051977627],"study_design_scores_gemma":[0.000002638131,0.000009633158,0.0001498816,0.00009460959,0.0000016165112,0.000048472313,0.00007082248,0.00002031503,0.00004747769,0.0012706816,0.9982803,0.000003661177],"about_ca_topic_score_codex":0.0020964413,"about_ca_topic_score_gemma":0.0022932452,"teacher_disagreement_score":0.5294501,"about_ca_system_score_codex":0.0021832066,"about_ca_system_score_gemma":0.0025083083,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008857616,0.009523812,0.0051965876,0.032917768,0.14381957,0.00044932263,0.013839137,0.0030515122,0.79031646],"genre_scores_gemma":[0.0034285164,0.0044619073,0.0019222223,0.005857445,0.013936788,0.00022232757,0.0137998415,0.0013202701,0.95505077],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982432,0.0002146261,0.00013379821,0.00035119292,0.00090390263,0.00015327113],"domain_scores_gemma":[0.9940216,0.0008515822,0.0002610146,0.00074721297,0.0032714766,0.0008471527],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020360867,0.0011437889,0.0009721673,0.0029724708,0.0026086795,0.007525959,0.0021031087,0.002201045,0.58818364],"category_scores_gemma":[0.011647767,0.0004758398,0.00082154205,0.0029593222,0.0007238011,0.005312553,0.0028653406,0.0037067086,0.43549824],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017080238,0.000010874205,0.00004338149,0.0000857173,0.0000015196397,0.000017102942,0.00003927119,0.000032245338,0.000061106395,0.0028649664,0.96988726,0.02693958],"study_design_scores_gemma":[0.0000020896398,0.0000056232007,0.00010315751,0.0000624759,8.9493943e-7,0.000019166684,0.000031080675,0.000015615773,0.000029267429,0.00063631765,0.99909174,0.0000025891015],"about_ca_topic_score_codex":0.003947821,"about_ca_topic_score_gemma":0.0040155533,"teacher_disagreement_score":0.41181636,"about_ca_system_score_codex":0.002687565,"about_ca_system_score_gemma":0.0030001183,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010631129,0.021632165,0.0053217504,0.03196016,0.16375974,0.0005516294,0.011315974,0.0022413954,0.7621541],"genre_scores_gemma":[0.0047957078,0.011930059,0.0029578838,0.006956296,0.028371207,0.00030725944,0.013134194,0.0012173911,0.93033004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982679,0.00019246279,0.00014520525,0.00033158035,0.0009270648,0.0001357816],"domain_scores_gemma":[0.9951499,0.00072612794,0.00019773182,0.0004972513,0.0027295072,0.0006994532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014644886,0.0012394594,0.0012422961,0.003564849,0.0021304807,0.006983628,0.001938098,0.0017064706,0.5435548],"category_scores_gemma":[0.009941256,0.000380325,0.00093885954,0.0032852571,0.0006631513,0.0043431614,0.0026803864,0.0026109011,0.41893914],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024201785,0.000016330225,0.00008153798,0.0001702861,0.0000036314227,0.00004099103,0.00006775555,0.000051321298,0.00012118585,0.0028974612,0.94210505,0.054420277],"study_design_scores_gemma":[0.0000028992795,0.000009866743,0.00015445241,0.00011730503,0.0000019809079,0.000054997752,0.000059746766,0.000020032692,0.00004917082,0.0010267943,0.9984989,0.0000037427403],"about_ca_topic_score_codex":0.0018193169,"about_ca_topic_score_gemma":0.0019252358,"teacher_disagreement_score":0.5435548,"about_ca_system_score_codex":0.001998673,"about_ca_system_score_gemma":0.0024843237,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016377633,0.007194359,0.006755871,0.020225782,0.058307912,0.00044820545,0.012918706,0.002225424,0.89028597],"genre_scores_gemma":[0.006601541,0.0035275635,0.0025817724,0.0042473003,0.00645251,0.00024818597,0.010465272,0.00088849413,0.96498734],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860483,0.0002061037,0.000108086584,0.00030715656,0.00061944453,0.00015432743],"domain_scores_gemma":[0.99686337,0.00040676066,0.00011778122,0.0004068538,0.0016115075,0.0005938121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014498201,0.0010601155,0.0009119266,0.0021532327,0.0026944831,0.005279661,0.0018079198,0.0019259562,0.6024277],"category_scores_gemma":[0.007476684,0.00040520143,0.0007876138,0.0019437354,0.00077770016,0.004021691,0.0033632354,0.0028528476,0.45234013],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050496998,0.000022977543,0.00014464342,0.00012240623,0.000003504521,0.000059908303,0.00012655089,0.00007092921,0.0001579411,0.009528771,0.93611574,0.053596146],"study_design_scores_gemma":[0.0000036366555,0.0000111170175,0.00016214712,0.00006215897,0.0000013825559,0.000053462387,0.00007042338,0.000023596529,0.00005526915,0.0016735861,0.99787986,0.0000033471977],"about_ca_topic_score_codex":0.003057632,"about_ca_topic_score_gemma":0.0036389383,"teacher_disagreement_score":0.6024277,"about_ca_system_score_codex":0.0022289327,"about_ca_system_score_gemma":0.0025872395,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010044471,0.011966143,0.004810819,0.021418603,0.07965093,0.0003234786,0.011009369,0.0022527112,0.86756355],"genre_scores_gemma":[0.004468147,0.0056941,0.002101562,0.004975699,0.013100523,0.00017474184,0.010272054,0.0011768239,0.9580363],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839586,0.00018360854,0.00010912871,0.00035167532,0.00081650313,0.00014325984],"domain_scores_gemma":[0.9967033,0.0005111012,0.0001402853,0.0004344677,0.0015786551,0.0006320708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012008265,0.0012093432,0.0011138306,0.0030336268,0.0024675943,0.0063273804,0.0019294564,0.0018882953,0.61468786],"category_scores_gemma":[0.007248091,0.00042200973,0.00087675336,0.0027645377,0.00089529564,0.0045787324,0.0032743614,0.0027687107,0.4456075],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026930164,0.000020208116,0.000104390216,0.00013010009,0.0000029807766,0.000031642914,0.00007939355,0.000058507474,0.00012395818,0.0067094,0.94178396,0.050928496],"study_design_scores_gemma":[0.00000221864,0.000008715136,0.00013304931,0.00006702227,0.0000012024016,0.000039777984,0.000043640146,0.000019895055,0.00004399009,0.0015813352,0.99805605,0.0000032032406],"about_ca_topic_score_codex":0.00241354,"about_ca_topic_score_gemma":0.0029064144,"teacher_disagreement_score":0.61468786,"about_ca_system_score_codex":0.0022881483,"about_ca_system_score_gemma":0.002563864,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010868851,0.014277534,0.006867397,0.023903467,0.09733331,0.000383064,0.01573437,0.0028417902,0.8375723],"genre_scores_gemma":[0.004819909,0.0068520266,0.003117336,0.0050201975,0.014772181,0.00021732811,0.014499717,0.0015274335,0.94917387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840647,0.00018623054,0.00011979459,0.00034575397,0.0008143367,0.00012736898],"domain_scores_gemma":[0.99624676,0.00068193703,0.00015139532,0.0005228309,0.0018217119,0.0005753827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013104723,0.0011918258,0.0010718226,0.0031539926,0.0023785084,0.006456148,0.0018864062,0.0017610615,0.59907156],"category_scores_gemma":[0.008746488,0.00041927124,0.0008345839,0.003023961,0.00085989764,0.004896745,0.003127394,0.0026553532,0.40105373],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027471646,0.000015525226,0.00009061793,0.000134734,0.0000030564074,0.00002763406,0.00008412885,0.00005406845,0.00012145498,0.0054809507,0.94270724,0.05125317],"study_design_scores_gemma":[0.0000023514756,0.000007690724,0.00011926932,0.00006915845,0.0000014368676,0.00003755224,0.000043620643,0.000019209643,0.000044034135,0.0014504842,0.99820197,0.0000032178955],"about_ca_topic_score_codex":0.0026396108,"about_ca_topic_score_gemma":0.003157162,"teacher_disagreement_score":0.59907156,"about_ca_system_score_codex":0.0021165211,"about_ca_system_score_gemma":0.0024313927,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011735576,0.013115232,0.007764014,0.025522571,0.10915413,0.00046063538,0.015583679,0.0033243557,0.8239018],"genre_scores_gemma":[0.004790302,0.00744453,0.0038638604,0.006053075,0.015898641,0.0002648048,0.016488202,0.0017789307,0.9434177],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835014,0.00018729418,0.00012357002,0.00034536404,0.00085794396,0.00013571409],"domain_scores_gemma":[0.99605703,0.000650714,0.00015168889,0.00052586035,0.0020081748,0.0006066664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013748523,0.0012030911,0.001102138,0.003074066,0.0024725394,0.0065351673,0.0020672155,0.0019185526,0.58301616],"category_scores_gemma":[0.008931823,0.00044252758,0.0009813588,0.0028346558,0.0008064935,0.004677374,0.0030690448,0.002810498,0.41469008],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029819312,0.000019497453,0.00010127361,0.00015374698,0.0000035234505,0.00003634938,0.000076912605,0.00006619945,0.00013984638,0.0049680537,0.94081587,0.053588852],"study_design_scores_gemma":[0.0000026260457,0.000009491928,0.0001312718,0.00008268367,0.0000017425284,0.000046397265,0.00004383598,0.00002460317,0.00005936661,0.001366955,0.9982273,0.0000037105156],"about_ca_topic_score_codex":0.002436626,"about_ca_topic_score_gemma":0.0030024657,"teacher_disagreement_score":0.58301616,"about_ca_system_score_codex":0.0022118997,"about_ca_system_score_gemma":0.0026419156,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null}]}