{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":63,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":63,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"08c656f4e6ac","filters":{"venue":"Electronic Notes in Theoretical Computer Science"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Bob Coecke","is_ca":true},{"name":"Bill Edwards","is_ca":true},{"name":"Robert W. Spekkens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01348204467517086,"gpt":0.28597665531867,"spread":0.2724946106434992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411509,0.000276951,0.0004399614,0.001013967,0.001425271,0.002179714,0.0008539659,0.001342029,0.003593191],"category_scores_gemma":[0.003319776,0.0002547238,0.0006367621,0.0005005556,0.007811338,0.004838082,0.00223815,0.001678518,0.0002988093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136218,"about_ca_system_score_gemma":0.0007959863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005616337,"about_ca_topic_score_gemma":0.0004034533,"domain_scores_codex":[0.9991192,0.0003401545,0.0000369971,0.0001211418,0.0002424436,0.0001399466],"domain_scores_gemma":[0.998095,0.0008486395,0.0002956149,0.0004784025,0.0001562638,0.000126081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002745569,0.000002737712,0.00004113182,0.000004921874,0.000001020501,0.00001329194,0.0001401442,0.0003408069,0.0002087355,0.9987713,0.00004497471,0.0004281753],"study_design_scores_gemma":[0.000003815962,0.000008372828,0.00005884667,0.000004276671,0.00000128178,0.00002052117,0.00005974568,0.002468781,0.0002221562,0.9963471,0.0008006136,0.0000045941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5476007,0.001396107,0.3503877,0.006404695,0.0002884133,0.0001095424,0.0001245852,0.0003126758,0.09337559],"genre_scores_gemma":[0.9816085,0.0001857923,0.01436689,0.0002297395,0.0001012652,0.00006581451,0.00002727445,0.00003192248,0.003382999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003593191,"threshold_uncertainty_score":0.01202035,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vitor Lima","is_ca":true},{"name":"Chamseddine Talhi","is_ca":true},{"name":"Djedjiga Mouheb","is_ca":true},{"name":"Mourad Debbabi","is_ca":true},{"name":"Liangzhu Wang","is_ca":true},{"name":"Makan Pourzandi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02005992062363393,"gpt":0.303808427045778,"spread":0.2837485064221441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009320548,0.001250397,0.0005273927,0.002007754,0.0008847868,0.002217541,0.001369344,0.001090633,0.002253077],"category_scores_gemma":[0.02184527,0.000869928,0.001421542,0.0007530496,0.002042515,0.002073106,0.001383698,0.001330841,0.0006785758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001859699,"about_ca_system_score_gemma":0.004795347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006426176,"about_ca_topic_score_gemma":0.005223616,"domain_scores_codex":[0.989539,0.004623436,0.0009038093,0.0009028729,0.003575459,0.0004554779],"domain_scores_gemma":[0.984529,0.008935026,0.001862051,0.002117143,0.002393083,0.000163863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005919149,0.0003190889,0.007023258,0.001278529,0.0001436771,0.001557841,0.002790472,0.2558668,0.06546874,0.5255309,0.003809913,0.1356188],"study_design_scores_gemma":[0.0002477135,0.0003517658,0.001731338,0.0005332121,0.0001656052,0.0007014637,0.0002757031,0.6949037,0.1205441,0.1189133,0.06147555,0.0001564438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.012021,0.0001009248,0.9833195,0.0001045239,0.00005511126,0.0002145766,0.0002123842,0.002482529,0.001489446],"genre_scores_gemma":[0.311042,0.000481217,0.6823802,0.0001238651,0.00005469843,0.0008450512,0.001175419,0.0007547326,0.003142895],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009320548,"threshold_uncertainty_score":0.04929233,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alberto Momigliano","is_ca":false},{"name":"Alan J. Martin","is_ca":true},{"name":"Amy Felty","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02692483528903797,"gpt":0.2744474474135393,"spread":0.2475226121245014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00583013,0.0009619013,0.001120443,0.002456894,0.001531035,0.005609428,0.003696757,0.002191569,0.01024127],"category_scores_gemma":[0.008462995,0.00143961,0.002061827,0.001639175,0.004250179,0.01284971,0.007591551,0.003407436,0.003246862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001482503,"about_ca_system_score_gemma":0.003166384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003825181,"about_ca_topic_score_gemma":0.003423107,"domain_scores_codex":[0.997043,0.0008374594,0.0003485249,0.0006986907,0.0008304432,0.0002419036],"domain_scores_gemma":[0.9942444,0.002324949,0.0003830177,0.001999125,0.000700234,0.0003481952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006649649,0.000215502,0.003525948,0.0008661511,0.0003029516,0.0007856489,0.00274895,0.01539501,0.02210219,0.7582557,0.0325511,0.1625859],"study_design_scores_gemma":[0.000321144,0.0002105879,0.001143571,0.000232248,0.0003942796,0.001098082,0.0003768165,0.3154957,0.04182113,0.4215922,0.2169425,0.0003716848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004028951,0.00009115681,0.959177,0.0002172997,0.00008169717,0.0001092693,0.0002923053,0.03347348,0.002528945],"genre_scores_gemma":[0.1163017,0.0002177025,0.8713813,0.000531287,0.000135334,0.0004102939,0.001328179,0.003522431,0.006171745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01024127,"threshold_uncertainty_score":0.03426045,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vincent Danos","is_ca":false},{"name":"Ellie D’Hondt","is_ca":false},{"name":"Elham Kashefi","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01126227020785206,"gpt":0.2669431011986561,"spread":0.255680830990804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462358,0.00066914,0.0008247516,0.0007162222,0.001221714,0.002957319,0.002815424,0.001648266,0.0048415],"category_scores_gemma":[0.003826681,0.0004292856,0.001446486,0.0008563947,0.003847086,0.00542771,0.003235682,0.002957104,0.0009665466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001919313,"about_ca_system_score_gemma":0.001990733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002165926,"about_ca_topic_score_gemma":0.001691725,"domain_scores_codex":[0.9975802,0.0006916875,0.0001458867,0.0004194663,0.0008752834,0.000287518],"domain_scores_gemma":[0.9980615,0.0007572613,0.0001667321,0.0005410566,0.000303292,0.0001702328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001241879,0.00002022701,0.00005916061,0.0000194374,0.000005128581,0.00005995225,0.0001119202,0.01274797,0.0006208665,0.9837943,0.0003549569,0.002193831],"study_design_scores_gemma":[0.00004603682,0.00004364119,0.00005314185,0.0000209941,0.00001574779,0.00009331418,0.00004328497,0.2584166,0.001630441,0.7267823,0.01283366,0.00002068703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","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.000422052,0.4280995,0.0004410745,0.0002211851,0.0006616395,0.0002150758,0.0001677773,0.01372702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0048415,"threshold_uncertainty_score":0.01619643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexandru Baltag","is_ca":false},{"name":"Bob Coecke","is_ca":false},{"name":"Mehrnoosh Sadrzadeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01208431195925075,"gpt":0.2719294791943337,"spread":0.259845167235083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002789397,0.000765954,0.001003694,0.002149614,0.002624443,0.003651244,0.00223177,0.001505482,0.009509807],"category_scores_gemma":[0.003085761,0.0004641555,0.002070968,0.002361517,0.004357025,0.007465553,0.003113618,0.003652204,0.00254695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002541607,"about_ca_system_score_gemma":0.002254711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00342139,"about_ca_topic_score_gemma":0.002396596,"domain_scores_codex":[0.9980106,0.0004700232,0.0001536366,0.0003588205,0.0007528196,0.0002541431],"domain_scores_gemma":[0.9988502,0.0004471777,0.0001242257,0.00013851,0.0002952858,0.0001446125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003236152,0.000006432072,0.00001981985,0.00001887018,0.00000304234,0.00004108558,0.00007500126,0.00043278,0.0001373146,0.9975581,0.0003503219,0.001353957],"study_design_scores_gemma":[0.000006138134,0.000005075527,0.00002585991,0.000009139531,0.000005493452,0.00004256161,0.00001973964,0.002567407,0.0001270576,0.9876243,0.00956028,0.000006903198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01088359,0.004593987,0.8916559,0.003143012,0.0007609862,0.0001669178,0.0007029895,0.0006897404,0.08740286],"genre_scores_gemma":[0.4928765,0.006444716,0.444898,0.0021823,0.002204553,0.0009764031,0.001663927,0.0002592909,0.0484944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009509807,"threshold_uncertainty_score":0.03181344,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sergey Berezin","is_ca":false},{"name":"Clark Barrett","is_ca":false},{"name":"Igor Shikanian","is_ca":false},{"name":"Marsha Chećhik","is_ca":true},{"name":"Arie Gurfinkel","is_ca":true},{"name":"David L. Dill","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01756598041389155,"gpt":0.2809833728981024,"spread":0.2634173924842109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007618747,0.0008359056,0.0009072748,0.002262392,0.002566938,0.008498649,0.004177961,0.003460647,0.008635283],"category_scores_gemma":[0.02468609,0.001295078,0.001805285,0.001875977,0.006593066,0.01105511,0.006339477,0.005011506,0.0016944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002220006,"about_ca_system_score_gemma":0.003219451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002378151,"about_ca_topic_score_gemma":0.002711662,"domain_scores_codex":[0.9932328,0.002237035,0.0005066851,0.001000886,0.002384593,0.0006379502],"domain_scores_gemma":[0.9913042,0.004350683,0.0002895688,0.002387346,0.001469164,0.0001991645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001075222,0.00004259577,0.0006029463,0.0001658425,0.00001790196,0.000238177,0.0008057643,0.005146827,0.003149102,0.9301397,0.003362711,0.0562209],"study_design_scores_gemma":[0.00007576568,0.00009933543,0.0002334188,0.0001844145,0.00004237071,0.0007847142,0.0004006401,0.1144693,0.01860516,0.7809029,0.08409978,0.0001022549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007860878,0.000105792,0.9754949,0.001373498,0.00008113594,0.0001577939,0.0001340542,0.004130816,0.01066118],"genre_scores_gemma":[0.2157798,0.00015924,0.7748092,0.000895587,0.00006858238,0.0003715719,0.0003202604,0.0008687974,0.006727003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008635283,"threshold_uncertainty_score":0.0402922,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sergiy Boroday","is_ca":true},{"name":"Alexandre Petrenko","is_ca":true},{"name":"Roland Groz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01723627202215754,"gpt":0.2968998082688012,"spread":0.2796635362466436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039294,0.0008680132,0.0008033151,0.001020972,0.0003737744,0.001422178,0.001667343,0.002395656,0.003469579],"category_scores_gemma":[0.04774601,0.000534404,0.001140904,0.0007047001,0.00205752,0.005342805,0.001186344,0.001955274,0.001004939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006120796,"about_ca_system_score_gemma":0.001119162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001116954,"about_ca_topic_score_gemma":0.001464256,"domain_scores_codex":[0.9962988,0.001659174,0.0001560608,0.0004381,0.001136753,0.0003110692],"domain_scores_gemma":[0.9724708,0.02129155,0.001004658,0.003555412,0.001436691,0.0002409621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006669121,0.0006241661,0.008650082,0.0007985703,0.0002501492,0.0009086439,0.0005044611,0.2259741,0.02755724,0.348535,0.01221332,0.3733173],"study_design_scores_gemma":[0.000168517,0.0001785423,0.00043779,0.0001320582,0.00006492965,0.0003569411,0.00007179343,0.7093213,0.02104308,0.2623596,0.005817959,0.0000474275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01433163,0.0002340172,0.978658,0.00198599,0.0001586107,0.00004294044,0.00004104331,0.002743506,0.001804283],"genre_scores_gemma":[0.5147948,0.0005132068,0.4801847,0.001049243,0.0001646853,0.0001775385,0.0002593723,0.0007489583,0.002107416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0039294,"threshold_uncertainty_score":0.02078092,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Heather Betel","is_ca":true},{"name":"Paola Flocchini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01389813015122753,"gpt":0.2565077526960917,"spread":0.2426096225448641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001725144,0.0004523023,0.0008393039,0.00135724,0.00107929,0.002345222,0.001100314,0.001544406,0.003009337],"category_scores_gemma":[0.01402405,0.0003959876,0.000873696,0.001374664,0.003420933,0.004160944,0.001848814,0.002155231,0.0002847288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002021679,"about_ca_system_score_gemma":0.0007260788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003892226,"about_ca_topic_score_gemma":0.002191751,"domain_scores_codex":[0.9984803,0.0004428466,0.00008580095,0.0003632142,0.0005031739,0.0001247617],"domain_scores_gemma":[0.991056,0.006972281,0.000524449,0.0005696593,0.0006317152,0.0002459295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001772281,0.00001139861,0.0004239394,0.00004227551,0.00001213731,0.00007649143,0.0001762286,0.02149275,0.0005808474,0.9697277,0.0002870335,0.007151359],"study_design_scores_gemma":[0.000007860124,0.00002275218,0.0003360657,0.00003056305,0.00001439867,0.0001050693,0.00004683218,0.1551264,0.0003222075,0.84167,0.002301796,0.0000160515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1188848,0.00586145,0.8242303,0.002768985,0.0002100851,0.00006535505,0.000231731,0.0002010953,0.04754623],"genre_scores_gemma":[0.9173872,0.003123355,0.07166205,0.00053526,0.000340442,0.000154036,0.0001458283,0.00006098051,0.006590781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003892226,"threshold_uncertainty_score":0.01466841,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Dagger; Mathematics; Hilbert space; Pure mathematics; Algebra over a field; Discrete mathematics","authors":[{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02255216622699092,"gpt":0.2599459390046027,"spread":0.2373937727776118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002604829,0.0005618013,0.0006133395,0.001169908,0.001350506,0.003082549,0.0009750935,0.001226891,0.005996491],"category_scores_gemma":[0.005011192,0.0005480337,0.001381215,0.001182465,0.004976805,0.01180728,0.004647884,0.003619962,0.001001828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430386,"about_ca_system_score_gemma":0.0009477374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00191719,"about_ca_topic_score_gemma":0.001642141,"domain_scores_codex":[0.9980868,0.0004272331,0.0001769164,0.0004991464,0.0004622442,0.0003476183],"domain_scores_gemma":[0.9960765,0.001977951,0.0002999734,0.0004628672,0.0008960132,0.0002867243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001060657,0.000009867043,0.0001757024,0.00003317781,0.000005365939,0.00005740807,0.0002791381,0.0002828401,0.0005605732,0.9956852,0.0005017266,0.002398431],"study_design_scores_gemma":[0.00001117512,0.00001524236,0.0003566415,0.000009420273,0.000006740441,0.00009682683,0.0001413442,0.002010249,0.000975871,0.9915206,0.004843815,0.00001215515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2990657,0.00155005,0.5979917,0.00406121,0.0004249267,0.0001429599,0.001493523,0.0005255808,0.09474429],"genre_scores_gemma":[0.9244136,0.0006107524,0.05857131,0.0007510213,0.0001416763,0.000170146,0.0008912319,0.00008607282,0.01436406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005996491,"threshold_uncertainty_score":0.0200603,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dan R. Ghica","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006798227184641947,"gpt":0.2647977056783791,"spread":0.2579994784937371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760492,0.0008798803,0.00069111,0.001120914,0.001293391,0.003358476,0.002396363,0.001568525,0.006519873],"category_scores_gemma":[0.002178097,0.0005707445,0.001803445,0.001129818,0.003938859,0.005983262,0.001924793,0.003332432,0.001849152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001773303,"about_ca_system_score_gemma":0.001333597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001560146,"about_ca_topic_score_gemma":0.001526666,"domain_scores_codex":[0.9987202,0.0002932519,0.000123854,0.000249763,0.0004257604,0.0001872662],"domain_scores_gemma":[0.9991751,0.000317725,0.0001057308,0.0001552641,0.0001663174,0.00007977695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008623098,0.0000148658,0.00003149419,0.00003568562,0.000006507591,0.00008852464,0.000234727,0.001644119,0.0007309304,0.9942128,0.0005919576,0.002399794],"study_design_scores_gemma":[0.00002364535,0.00003040153,0.00005309301,0.00002529075,0.00002253928,0.0002396448,0.00009247452,0.01925058,0.001745127,0.9525552,0.02594162,0.00002036992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006778733,0.0003646443,0.9731861,0.0009537904,0.0001589068,0.0001609218,0.0002637954,0.00148732,0.01664574],"genre_scores_gemma":[0.3470219,0.0007726029,0.6303057,0.0009825836,0.000260416,0.0009791394,0.0006042068,0.0009714891,0.01810199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006519873,"threshold_uncertainty_score":0.02181119,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ryan Kavanagh","is_ca":false},{"name":"Stephen Brookes","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00968326086108321,"gpt":0.2832651843296394,"spread":0.2735819234685561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608645,0.0006466709,0.0005178726,0.0008812068,0.001108149,0.002171826,0.001322645,0.0008699205,0.005077847],"category_scores_gemma":[0.001738129,0.0004992433,0.001264283,0.000766196,0.003632085,0.004175814,0.002720531,0.001830395,0.0007596978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001029849,"about_ca_system_score_gemma":0.001677804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001840615,"about_ca_topic_score_gemma":0.001800904,"domain_scores_codex":[0.9990851,0.0001509248,0.0001144958,0.0001569148,0.0003350131,0.0001576093],"domain_scores_gemma":[0.9990104,0.000308948,0.00009221746,0.0002253128,0.0002671026,0.00009591211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002417703,0.0000199536,0.0001342398,0.0000646948,0.000007748297,0.0001157349,0.000299574,0.006790058,0.003044355,0.9815401,0.000553155,0.007406099],"study_design_scores_gemma":[0.00003283838,0.00006594352,0.0001242464,0.00003517115,0.00003351293,0.0001605468,0.0002206887,0.07362053,0.006450801,0.8953118,0.02391556,0.00002834954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02107631,0.0001315617,0.9618774,0.0005014634,0.0001201477,0.0001092239,0.000213737,0.0009066999,0.01506336],"genre_scores_gemma":[0.5170851,0.0003388797,0.4690951,0.0005392883,0.0001698303,0.0005666073,0.0005239464,0.000442605,0.01123871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005077847,"threshold_uncertainty_score":0.01698709,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Joe Hurd","is_ca":false},{"name":"Annabelle McIver","is_ca":false},{"name":"Carroll Morgan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00939515989005353,"gpt":0.2485082263884564,"spread":0.2391130664984029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761087,0.0005278793,0.0004843622,0.0009501808,0.0008654473,0.002246562,0.002162281,0.0008236552,0.007198833],"category_scores_gemma":[0.004489985,0.0007779719,0.001201174,0.0005768883,0.004127623,0.004978352,0.003745527,0.003059301,0.001283301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001306913,"about_ca_system_score_gemma":0.001744719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002076194,"about_ca_topic_score_gemma":0.002684314,"domain_scores_codex":[0.9979367,0.0004779499,0.0001307701,0.0002945441,0.0008443558,0.0003157012],"domain_scores_gemma":[0.9965959,0.001579023,0.0001974218,0.001186863,0.000353245,0.00008750235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001395727,0.00009123918,0.0005193422,0.0002298564,0.0000250764,0.0004393483,0.0006717109,0.02575502,0.01026305,0.9200235,0.005384379,0.03645788],"study_design_scores_gemma":[0.0001589597,0.00009424755,0.0002847512,0.000126521,0.00006230547,0.0002944687,0.000138686,0.1396322,0.0415876,0.7618075,0.05573608,0.00007667681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01484019,0.0003106829,0.9540645,0.0009846172,0.0002702776,0.0001368615,0.0003020397,0.008269206,0.02082165],"genre_scores_gemma":[0.503213,0.000628943,0.4710033,0.001031086,0.0002813723,0.0004865518,0.000754483,0.002029439,0.02057175],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007198833,"threshold_uncertainty_score":0.02408254,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ahmed Khoumsi","is_ca":true},{"name":"Lucien Ouédraogo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01192194929496741,"gpt":0.3276170705568103,"spread":0.3156951212618428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001692179,0.001180046,0.0008343057,0.001753076,0.0009302726,0.001701689,0.001589544,0.001099086,0.008646065],"category_scores_gemma":[0.005278462,0.000868736,0.00258554,0.001086675,0.001630303,0.002606424,0.002016163,0.003438064,0.003142074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006995132,"about_ca_system_score_gemma":0.00130186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103495,"about_ca_topic_score_gemma":0.0009263115,"domain_scores_codex":[0.9970107,0.0004318406,0.0002823684,0.0008729429,0.001264659,0.0001373678],"domain_scores_gemma":[0.9973985,0.0009331128,0.0001541244,0.000814116,0.0006147492,0.00008545612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002518601,0.000194351,0.0006985655,0.0006017384,0.0001716297,0.0007125334,0.0009575456,0.01510671,0.06687482,0.3377012,0.0151411,0.561588],"study_design_scores_gemma":[0.0002507062,0.0004104603,0.0004861349,0.0001886224,0.0002776448,0.003108501,0.0002278501,0.1713815,0.1081215,0.2654375,0.4498984,0.0002113204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005927847,0.00007770761,0.9958331,0.00006407275,0.0002374148,0.00007773926,0.0000646734,0.001327721,0.001724691],"genre_scores_gemma":[0.02392216,0.0002951442,0.9650584,0.0002135773,0.0001733322,0.0005369804,0.000327572,0.00103633,0.008436519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008646065,"threshold_uncertainty_score":0.02892399,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jesse Bingham","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01737028778483418,"gpt":0.3021167304164428,"spread":0.2847464426316086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209715,0.001014892,0.001081465,0.002446681,0.001169164,0.002130199,0.00272814,0.001071418,0.004337408],"category_scores_gemma":[0.004591958,0.0007324775,0.00242947,0.001159542,0.002288144,0.004614725,0.002813706,0.003673878,0.001087484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001378918,"about_ca_system_score_gemma":0.002189292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002636891,"about_ca_topic_score_gemma":0.002240612,"domain_scores_codex":[0.9976293,0.0003325038,0.0001610755,0.0005551178,0.001159521,0.00016249],"domain_scores_gemma":[0.9981636,0.0007407033,0.0001144602,0.0005334633,0.0003843999,0.00006329532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009395213,0.0001407573,0.0007419268,0.0002552462,0.0001098015,0.0002382203,0.0004728172,0.08085886,0.02963056,0.7415468,0.001622628,0.1442885],"study_design_scores_gemma":[0.00005765779,0.0001232524,0.0002493511,0.0001018349,0.0001137972,0.0003256228,0.00007287815,0.5593809,0.02469718,0.3763772,0.03842494,0.00007543848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008069041,0.00003181044,0.9982161,0.00003397486,0.00001519403,0.00002154228,0.00001778939,0.0002679616,0.0005887051],"genre_scores_gemma":[0.0496505,0.0001923309,0.9475699,0.00009618641,0.00005704468,0.0001573166,0.0001656212,0.0001899928,0.001921094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004337408,"threshold_uncertainty_score":0.01451004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Vincent Danos","is_ca":true},{"name":"Josée Desharnais","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005458906140985285,"gpt":0.2377292031829043,"spread":0.232270297041919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008533556,0.001166621,0.001587428,0.001713386,0.0008957821,0.004625268,0.002719495,0.00256622,0.007786672],"category_scores_gemma":[0.03976337,0.0009751976,0.002599873,0.001456908,0.003164323,0.01134541,0.004925008,0.006575665,0.001286013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003281362,"about_ca_system_score_gemma":0.001568891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003218892,"about_ca_topic_score_gemma":0.0026773,"domain_scores_codex":[0.9913345,0.002705003,0.0005116186,0.001424072,0.003381267,0.0006435776],"domain_scores_gemma":[0.9725079,0.01770309,0.001952387,0.005702621,0.001448643,0.0006853558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003492827,0.0000710296,0.0007962198,0.0002220136,0.00007024467,0.0001340394,0.0007551679,0.1035478,0.004926634,0.8565634,0.0009069688,0.03165706],"study_design_scores_gemma":[0.0000474541,0.00007372081,0.0002276077,0.00006795107,0.0000456774,0.0001160425,0.0001047794,0.5067923,0.002845304,0.4840656,0.00557248,0.00004100216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02481031,0.0006081254,0.9686419,0.0006561253,0.0001415137,0.00005692233,0.0001022583,0.0005161644,0.004466665],"genre_scores_gemma":[0.4618113,0.0008379295,0.5278005,0.0004821821,0.0002966903,0.0001859168,0.000420476,0.0006065119,0.007558442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008533556,"threshold_uncertainty_score":0.04513025,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tong Zheng","is_ca":true},{"name":"Ferhat Khendek","is_ca":true},{"name":"Loı̈c Hélouët","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01736229215600636,"gpt":0.2811296066941258,"spread":0.2637673145381194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002473523,0.001114794,0.0007327914,0.001654267,0.001552158,0.003290492,0.001573623,0.001712412,0.006213862],"category_scores_gemma":[0.004800303,0.0005347579,0.001904815,0.001484747,0.003164375,0.005158209,0.002650614,0.003145996,0.00164344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001624935,"about_ca_system_score_gemma":0.002051153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001301877,"about_ca_topic_score_gemma":0.0009186197,"domain_scores_codex":[0.996778,0.0007393502,0.0004856369,0.0005662057,0.001074621,0.0003561587],"domain_scores_gemma":[0.9966314,0.001124531,0.0003614027,0.0003575973,0.001234147,0.000290869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002282605,0.00001754854,0.0000537102,0.00007029249,0.000009833152,0.0001731792,0.0003812627,0.002098752,0.001732502,0.9869093,0.001148777,0.007382063],"study_design_scores_gemma":[0.00007363217,0.00007447512,0.00006270209,0.00008982747,0.00003987476,0.0005084935,0.0002457882,0.02228648,0.004929035,0.8664896,0.1051589,0.000041216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005132013,0.0006195983,0.9764258,0.0008349387,0.0004553974,0.0001920132,0.0003959232,0.001038815,0.0149056],"genre_scores_gemma":[0.3094332,0.001652602,0.6697953,0.001205184,0.001080973,0.001365072,0.001312006,0.0006730694,0.01348265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006213862,"threshold_uncertainty_score":0.02078748,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mark van den Brand","is_ca":false},{"name":"Christophe Ringeissen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01101268706871463,"gpt":0.2472724618242732,"spread":0.2362597747555586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004338096,0.001477278,0.0009612175,0.00259024,0.001321256,0.003214128,0.002827338,0.001263884,0.02341728],"category_scores_gemma":[0.008105932,0.001321721,0.001640886,0.001900109,0.001099817,0.004253529,0.002484666,0.002644437,0.009822243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00140922,"about_ca_system_score_gemma":0.00319113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004254022,"about_ca_topic_score_gemma":0.00429544,"domain_scores_codex":[0.9969331,0.000660515,0.000471544,0.0005520047,0.001116899,0.0002659015],"domain_scores_gemma":[0.9956385,0.001324679,0.0002505212,0.001014448,0.001680219,0.00009166391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000296426,0.0001352192,0.00182986,0.0008747946,0.0001236863,0.001319219,0.001090077,0.02135969,0.01184881,0.333279,0.118619,0.5092242],"study_design_scores_gemma":[0.00009742002,0.00004803119,0.0003753052,0.0002201837,0.00009226155,0.001149297,0.0001219949,0.1368968,0.04338691,0.1248097,0.6926513,0.0001508707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009881428,0.00007432351,0.963917,0.0001755022,0.0001991751,0.0001149855,0.0008650908,0.02762206,0.006043764],"genre_scores_gemma":[0.02676296,0.0003802776,0.938695,0.0004863322,0.0001458295,0.0003969409,0.00459514,0.01293446,0.01560313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02341728,"threshold_uncertainty_score":0.07833856,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Robin Cockett","is_ca":true},{"name":"Joaquín Díaz Boïls","is_ca":false},{"name":"Jonathan Gallagher","is_ca":true},{"name":"Pavel Hrubeš","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02085770852822977,"gpt":0.2670126453691139,"spread":0.2461549368408841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089499,0.0003982793,0.0002964259,0.001928973,0.001187481,0.002817165,0.0008618149,0.0009839883,0.003520187],"category_scores_gemma":[0.002654863,0.0002244046,0.0007586072,0.001325342,0.005998342,0.005723676,0.001861708,0.001485042,0.0002387947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002703462,"about_ca_system_score_gemma":0.0008818355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002841165,"about_ca_topic_score_gemma":0.00167039,"domain_scores_codex":[0.9990601,0.0002752493,0.00006170075,0.0001773843,0.000281967,0.0001436161],"domain_scores_gemma":[0.9984432,0.0008836428,0.0001535026,0.0001918112,0.0001834975,0.0001443234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004448939,0.000002288419,0.0000944944,0.00001317069,0.000001722793,0.00001889657,0.0001044815,0.0008320937,0.0001782214,0.9968604,0.000122746,0.001767137],"study_design_scores_gemma":[0.000002472554,0.000009741998,0.0002132101,0.00001192149,0.000003291358,0.00006650759,0.0001108561,0.004926463,0.0002802078,0.9891344,0.005231387,0.000009489328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.192287,0.005597035,0.6479487,0.004383368,0.0004010071,0.00009742968,0.0003956068,0.0004426924,0.1484471],"genre_scores_gemma":[0.9495094,0.00100748,0.03882365,0.0002459408,0.0002036521,0.0001171925,0.0001637004,0.00005572079,0.009873258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003520187,"threshold_uncertainty_score":0.01961505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01475132019386853,"gpt":0.2924607097555175,"spread":0.277709389561649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009156946,0.001260348,0.0009078896,0.002194552,0.001108101,0.003307978,0.002395075,0.00103154,0.003366013],"category_scores_gemma":[0.02272398,0.0006590714,0.003031463,0.001582553,0.004074654,0.004513673,0.002852648,0.002741517,0.0006504758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00183665,"about_ca_system_score_gemma":0.00245995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001933214,"about_ca_topic_score_gemma":0.001317187,"domain_scores_codex":[0.991733,0.003413958,0.0004905102,0.0006703793,0.003181875,0.0005102934],"domain_scores_gemma":[0.9779107,0.01856355,0.0009632081,0.001436039,0.0009959545,0.0001306494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004491832,0.0000730696,0.0009199591,0.0004229696,0.000121961,0.0003833379,0.0003210117,0.1642002,0.003708624,0.7824332,0.00128707,0.04608373],"study_design_scores_gemma":[0.00004287256,0.00004649181,0.0002397283,0.00007342171,0.00005870875,0.0001652661,0.00004725598,0.4189722,0.005920342,0.5686565,0.0057433,0.0000338823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001657626,0.0001061099,0.9967837,0.0001198997,0.00001300435,0.00003274062,0.00002726281,0.0002479649,0.001011701],"genre_scores_gemma":[0.2284958,0.001311657,0.7674782,0.0002593499,0.0002133307,0.0003630603,0.0002403925,0.000205828,0.001432353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009156946,"threshold_uncertainty_score":0.0484271,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Pauli exclusion principle; Qubit; Physics; Theoretical physics; Statistical physics; Quantum mechanics; Quantum","authors":[{"name":"Vincent Danos","is_ca":false},{"name":"Elham Kashefi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01098471972778858,"gpt":0.2476859797296588,"spread":0.2367012600018703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606757,0.0003859902,0.0006675495,0.000512744,0.001207561,0.002007514,0.00106218,0.001173007,0.004540276],"category_scores_gemma":[0.008143729,0.0004985751,0.0007069905,0.0005094567,0.005093126,0.006145424,0.002552438,0.002370002,0.0007009349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000763723,"about_ca_system_score_gemma":0.0007825964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001409967,"about_ca_topic_score_gemma":0.0008423048,"domain_scores_codex":[0.998243,0.0004016405,0.00007618154,0.0004177509,0.0004205549,0.0004408791],"domain_scores_gemma":[0.9949122,0.002075528,0.0004997556,0.001948803,0.000363703,0.0001999658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002213835,0.000007156083,0.0001421174,0.0000207114,0.000006072751,0.00004452987,0.000125746,0.002612541,0.0008175875,0.993932,0.0004657308,0.001803749],"study_design_scores_gemma":[0.00001171709,0.00002119489,0.0001557724,0.00001454138,0.000009358087,0.0001312229,0.00006207245,0.02260131,0.001668658,0.9733699,0.001936495,0.00001762532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3348612,0.0007334517,0.5174743,0.003302294,0.0003614535,0.0001217312,0.0007286099,0.0008671994,0.1415498],"genre_scores_gemma":[0.9821681,0.0002666084,0.0107137,0.0003070652,0.00008135278,0.00004903929,0.00008871422,0.00008578115,0.006239685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004540276,"threshold_uncertainty_score":0.01518869,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yingjun Dai","is_ca":true},{"name":"Angèle M. Foley","is_ca":true},{"name":"Chı́nh T. Hoàng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007934784732203454,"gpt":0.270987125787603,"spread":0.2630523410553996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410457,0.0009870558,0.0008218682,0.002055711,0.002437842,0.003152365,0.001558918,0.001204549,0.007669488],"category_scores_gemma":[0.00414496,0.0006636623,0.0009895264,0.002498142,0.001762307,0.004369411,0.001934254,0.00204697,0.0008788665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002718554,"about_ca_system_score_gemma":0.001358168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004716319,"about_ca_topic_score_gemma":0.004647362,"domain_scores_codex":[0.9988913,0.0001512453,0.0000463279,0.0003785575,0.0002040721,0.0003284998],"domain_scores_gemma":[0.996869,0.001653723,0.0003484335,0.0005156148,0.0002144386,0.0003988251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001032601,0.0006137104,0.007574693,0.0006254315,0.00012437,0.0007693893,0.001438304,0.1085527,0.02204317,0.6311655,0.0316381,0.194422],"study_design_scores_gemma":[0.0002219016,0.0001880575,0.002815873,0.0001091378,0.0000569678,0.0008997362,0.0004953959,0.2534459,0.009109531,0.7034224,0.02916216,0.00007293397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5352656,0.002328475,0.4098906,0.003153426,0.0002709814,0.0005208557,0.001895011,0.002346619,0.04432839],"genre_scores_gemma":[0.8038786,0.001555103,0.1689721,0.001136612,0.000377299,0.0004655339,0.003836493,0.0006804153,0.01909786],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007669488,"threshold_uncertainty_score":0.02565694,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wei Wang","is_ca":true},{"name":"Vassilios Tzerpos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01331049559400888,"gpt":0.2734982694376952,"spread":0.2601877738436863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002319177,0.001172306,0.000645917,0.001786828,0.0003278521,0.001278974,0.001458211,0.001263815,0.003408826],"category_scores_gemma":[0.01025739,0.00122542,0.0009389794,0.0006458135,0.0004110158,0.002427185,0.001323419,0.001288827,0.001345092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004345108,"about_ca_system_score_gemma":0.0007308592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001355277,"about_ca_topic_score_gemma":0.001869733,"domain_scores_codex":[0.9984189,0.0003893421,0.0002340649,0.0002864428,0.000538389,0.0001328644],"domain_scores_gemma":[0.9947425,0.003497045,0.0004714016,0.0007706007,0.0004013391,0.0001171427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00168896,0.0007992908,0.02229476,0.001928792,0.0002606766,0.002225936,0.001474375,0.04271669,0.1295846,0.01120546,0.02963657,0.7561839],"study_design_scores_gemma":[0.0007243032,0.0007909198,0.01734754,0.0005027145,0.0002195129,0.002957618,0.0004396747,0.6427841,0.2342596,0.0174712,0.08226787,0.0002349135],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.04084811,0.0001545408,0.7887756,0.0001409796,0.0000892688,0.0003261169,0.001405587,0.1666287,0.001631155],"genre_scores_gemma":[0.1734662,0.0002287703,0.8088541,0.0001545313,0.00002163207,0.0003926188,0.003922404,0.009553288,0.003406458],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.003408826,"threshold_uncertainty_score":0.01226509,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J.R.B. Cockett","is_ca":true},{"name":"Craig Pastro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01140642540156746,"gpt":0.2828745985792736,"spread":0.2714681731777062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002086822,0.0008966638,0.0008434216,0.001965098,0.002197459,0.004948479,0.002291449,0.001256267,0.0102785],"category_scores_gemma":[0.002627345,0.0009021049,0.002183759,0.001992092,0.002870701,0.006805488,0.003044938,0.005251815,0.003955312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001606258,"about_ca_system_score_gemma":0.001788515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000956823,"about_ca_topic_score_gemma":0.001096409,"domain_scores_codex":[0.9982303,0.0004339734,0.0002373331,0.000290546,0.0006028469,0.00020508],"domain_scores_gemma":[0.9985642,0.0006659598,0.0001349103,0.0001869314,0.0003196045,0.0001284094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001063709,0.00001971919,0.00004440553,0.00008915886,0.000007505455,0.0001144574,0.0003036724,0.0004193711,0.001936032,0.9866372,0.002082762,0.008335094],"study_design_scores_gemma":[0.00002272131,0.00004953061,0.000103022,0.0000714488,0.00003908967,0.0006774074,0.000123154,0.008593436,0.003254087,0.8642916,0.1227351,0.00003934868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004844846,0.001331643,0.9612084,0.001810839,0.000699513,0.0002167962,0.0005991068,0.001721446,0.02756744],"genre_scores_gemma":[0.2121425,0.002342664,0.7331947,0.002408411,0.001691355,0.00109632,0.001374687,0.0009885444,0.04476083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102785,"threshold_uncertainty_score":0.03438497,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gerald Penn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01251482779957349,"gpt":0.2525650648909845,"spread":0.240050237091411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002007229,0.0006988005,0.0007653131,0.002485679,0.00258553,0.003947231,0.003344089,0.002175752,0.008710247],"category_scores_gemma":[0.003742164,0.0009698827,0.002081129,0.002576674,0.005122249,0.008216525,0.003642361,0.004431167,0.002342542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002018499,"about_ca_system_score_gemma":0.001629202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002293098,"about_ca_topic_score_gemma":0.002660217,"domain_scores_codex":[0.9987758,0.0003346968,0.00009050626,0.000303327,0.0003599033,0.0001357954],"domain_scores_gemma":[0.9985591,0.0007822265,0.00006741526,0.0003390271,0.0001744977,0.00007778171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006674174,0.000009163739,0.00004474177,0.00003214002,0.000005752147,0.00007091438,0.0001259732,0.002612123,0.0008200407,0.9851011,0.0004926191,0.01067875],"study_design_scores_gemma":[0.000004125693,0.000007214308,0.00003003534,0.00001038953,0.000009345593,0.00006632946,0.00002790073,0.008375174,0.001153126,0.983225,0.007078992,0.00001233494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00386155,0.0002035051,0.9856427,0.0004255217,0.0000721207,0.00005590298,0.0000737282,0.0006749598,0.008990075],"genre_scores_gemma":[0.1691307,0.0009153217,0.8194394,0.0004363564,0.0001534599,0.0001802825,0.0003305396,0.0005391048,0.008874839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008710247,"threshold_uncertainty_score":0.02913862,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quantum; Programming language; Theoretical computer science; Physics; Quantum mechanics","authors":[{"name":"Anya Tafliovich","is_ca":true},{"name":"Eric C. R. Hehner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00477036593406557,"gpt":0.236550144012094,"spread":0.2317797780780285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003875816,0.0006796404,0.0006306039,0.0007775938,0.001855681,0.003341733,0.001857482,0.001458707,0.006301244],"category_scores_gemma":[0.007893814,0.0005803813,0.001602235,0.000881146,0.006138979,0.007816466,0.003298575,0.003426991,0.0008836995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001967491,"about_ca_system_score_gemma":0.002622859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002929648,"about_ca_topic_score_gemma":0.002482502,"domain_scores_codex":[0.9961721,0.001893191,0.0002393558,0.0004458808,0.0009069959,0.0003423961],"domain_scores_gemma":[0.9955066,0.002886042,0.000267058,0.000727374,0.0004215901,0.0001912108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005490705,0.000006609078,0.00002640829,0.00002521931,0.000003002653,0.00001693054,0.0001341918,0.002092249,0.0001420612,0.9942815,0.0003226086,0.002943698],"study_design_scores_gemma":[0.00001436231,0.00001275964,0.00002591154,0.00003161051,0.000008870701,0.00004283764,0.00005593276,0.01687601,0.0006185659,0.9676213,0.01467824,0.00001350988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006068347,0.0004019903,0.9681285,0.002249584,0.0001202701,0.00008422844,0.00006759927,0.0003989534,0.02248052],"genre_scores_gemma":[0.3605841,0.001229829,0.6207916,0.001088008,0.0003635482,0.0005464836,0.0002148097,0.0003834839,0.01479815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006301244,"threshold_uncertainty_score":0.02107978,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Walter Carnielli","is_ca":false},{"name":"Mariana Matulovic","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004740707857415193,"gpt":0.2344024366076313,"spread":0.2296617287502161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004439808,0.000641686,0.0007195357,0.001230829,0.001255622,0.003673991,0.002452649,0.0009095242,0.006445293],"category_scores_gemma":[0.005611058,0.0005721415,0.002003407,0.00129551,0.004026983,0.009107112,0.003034101,0.003380707,0.001911498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00226833,"about_ca_system_score_gemma":0.002030797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001594089,"about_ca_topic_score_gemma":0.001621316,"domain_scores_codex":[0.9958675,0.001185571,0.0003784539,0.0008464444,0.001392698,0.000329424],"domain_scores_gemma":[0.996034,0.001856225,0.000239269,0.001109672,0.0006727817,0.00008817237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002040767,0.00001064489,0.00003877397,0.00006155388,0.000005908713,0.0000344801,0.0001719978,0.001316768,0.0006245108,0.9869473,0.0006405828,0.01012707],"study_design_scores_gemma":[0.0000427031,0.00003092183,0.00006632752,0.00003075208,0.00002129629,0.0001365044,0.00006825908,0.02384923,0.005630046,0.9276404,0.04245647,0.00002705969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002980639,0.0002570811,0.9888815,0.000546245,0.000130615,0.00004928501,0.0001695368,0.0006908487,0.006294237],"genre_scores_gemma":[0.276914,0.001016068,0.7062854,0.0005883828,0.000361209,0.0003271759,0.0006329262,0.0005429611,0.0133319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006445293,"threshold_uncertainty_score":0.02348018,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Timothy A. Cassidy","is_ca":true},{"name":"James R. Cordy","is_ca":true},{"name":"Thomas Dean","is_ca":true},{"name":"Juergen Dingel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005884489380710531,"gpt":0.2585829952196382,"spread":0.2526985058389277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002072568,0.0009957207,0.0006883998,0.002261529,0.001077933,0.0023993,0.001625092,0.0008088459,0.01467978],"category_scores_gemma":[0.009619105,0.0007389417,0.00156734,0.001810537,0.001524549,0.003164914,0.002857831,0.002952277,0.004233396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136096,"about_ca_system_score_gemma":0.001681778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001395393,"about_ca_topic_score_gemma":0.001094627,"domain_scores_codex":[0.9970075,0.0007766053,0.0001685502,0.0003666692,0.001464218,0.0002164512],"domain_scores_gemma":[0.9956949,0.00180317,0.0002162021,0.001297918,0.0009293653,0.0000584269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001806381,0.000141689,0.001092738,0.0003771463,0.0000624667,0.0005462462,0.0007965583,0.01902725,0.01584016,0.6477652,0.0141458,0.3000241],"study_design_scores_gemma":[0.00007105161,0.00005720286,0.0003163289,0.000150878,0.00005525542,0.0004526554,0.0001985504,0.2309673,0.04726534,0.6305448,0.0898675,0.00005321372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001650931,0.000107245,0.9864947,0.0001422038,0.00005344473,0.00007889006,0.0001391,0.005524334,0.005809199],"genre_scores_gemma":[0.152059,0.0006052353,0.8277397,0.0002659448,0.0001218846,0.0004820918,0.0015797,0.006161439,0.01098501],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01467978,"threshold_uncertainty_score":0.0491088,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel Sinnig","is_ca":true},{"name":"Patrice Chalin","is_ca":true},{"name":"Ferhat Khendek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03493288821465115,"gpt":0.3209126207996988,"spread":0.2859797325850477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02556676,0.002031251,0.002233967,0.01097756,0.003278927,0.01473769,0.006202796,0.006391018,0.004542772],"category_scores_gemma":[0.03167086,0.002656121,0.00583332,0.008578557,0.009826974,0.02322133,0.01110737,0.01328415,0.002315059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005179794,"about_ca_system_score_gemma":0.01049859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007090712,"about_ca_topic_score_gemma":0.004922836,"domain_scores_codex":[0.9759095,0.009912125,0.0041267,0.003104088,0.005618078,0.001329509],"domain_scores_gemma":[0.9693475,0.009547331,0.002313564,0.009749341,0.007512982,0.001529407],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000124621,0.00004952246,0.0001297675,0.00009070466,0.00001767108,0.0001038387,0.0006732141,0.002358502,0.0004095672,0.9834226,0.0007834216,0.01194867],"study_design_scores_gemma":[0.00003359626,0.000061714,0.0002904467,0.000496613,0.00005679643,0.0002819603,0.0009199385,0.03954134,0.001190007,0.9103056,0.04676658,0.00005542278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001109757,0.0001427217,0.9946226,0.0007582851,0.00005757256,0.0001591885,0.0001033008,0.000249119,0.002797483],"genre_scores_gemma":[0.04952255,0.000562989,0.9448694,0.0004690859,0.0001825637,0.0009608133,0.001110216,0.0002937369,0.002028554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02556676,"threshold_uncertainty_score":0.1352115,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ramiro Velázquez","is_ca":false},{"name":"Claudia N. Sánchez","is_ca":true},{"name":"Edwige Pissaloux","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005941870991770406,"gpt":0.2797312955202128,"spread":0.2737894245284424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002365401,0.000535103,0.0002543508,0.000309407,0.0001132312,0.000381679,0.0005738791,0.0004985413,0.005923601],"category_scores_gemma":[0.0008491789,0.0001243971,0.0002902635,0.0001160517,0.0002055959,0.0002893542,0.0003668634,0.0003453903,0.000733784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001473407,"about_ca_system_score_gemma":0.0002467953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009146931,"about_ca_topic_score_gemma":0.0005324559,"domain_scores_codex":[0.9998692,0.00004622207,0.000009912958,0.00001738423,0.00004528218,0.00001192908],"domain_scores_gemma":[0.9995302,0.0002483562,0.00002138641,0.00006415969,0.00007909369,0.00005691067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004671599,0.0017591,0.007464726,0.001366845,0.0002270929,0.004227656,0.001538681,0.2273052,0.513531,0.008036121,0.01271387,0.217158],"study_design_scores_gemma":[0.000778794,0.007979126,0.01305257,0.0001597053,0.0002724548,0.005773696,0.0002760234,0.7377825,0.1940105,0.003378381,0.03632529,0.0002110299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5635803,0.0005775536,0.4143397,0.0003620433,0.0003240329,0.0007257609,0.001382194,0.007110024,0.01159847],"genre_scores_gemma":[0.9215233,0.0003681061,0.0709011,0.00009578925,0.00002487214,0.0002910024,0.0006114365,0.0001950829,0.005989353],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005923601,"threshold_uncertainty_score":0.0198164,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pierre Busnel","is_ca":true},{"name":"Paul El Khoury","is_ca":false},{"name":"Keqin Li","is_ca":false},{"name":"Ayda Saïdane","is_ca":false},{"name":"Nicola Zannone","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01267705846470849,"gpt":0.265783818383173,"spread":0.2531067599184645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320167,0.0003914941,0.0003691544,0.0004126486,0.0006280919,0.0009870586,0.002050601,0.001563063,0.004963291],"category_scores_gemma":[0.003500703,0.0003839334,0.0003516067,0.0003494604,0.0007104198,0.001192026,0.001246509,0.001059311,0.001418769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000562585,"about_ca_system_score_gemma":0.0008865501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004562034,"about_ca_topic_score_gemma":0.003765734,"domain_scores_codex":[0.9991862,0.0003300162,0.00007592046,0.0001106041,0.0001847363,0.0001125469],"domain_scores_gemma":[0.9977418,0.0008321304,0.0001202593,0.0005052715,0.0002995839,0.0005009758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002658032,0.007507725,0.0309175,0.002039565,0.0002065653,0.01665069,0.02140387,0.05287495,0.1817857,0.01799645,0.03656354,0.6293955],"study_design_scores_gemma":[0.002944159,0.01044907,0.04684679,0.0006462961,0.0003150697,0.01304985,0.01234806,0.5393519,0.1774919,0.01502886,0.1810825,0.0004454213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6427718,0.0002197703,0.3101833,0.003192358,0.0002084901,0.002066856,0.0005066567,0.022188,0.0186628],"genre_scores_gemma":[0.7460486,0.0001838898,0.238569,0.0004435742,0.00002363937,0.0004487828,0.0005017666,0.0007437557,0.01303695],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004963291,"threshold_uncertainty_score":0.01660383,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Contraction (grammar); Computer science; Mathematics; Topology (electrical circuits); Theoretical computer science; Combinatorics; Linguistics","authors":[{"name":"Hanifa Boucheneb","is_ca":true},{"name":"G Berthelot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009600772076562939,"gpt":0.2339824895737402,"spread":0.2243817174971773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276843,0.0004789624,0.0004725131,0.0005111938,0.0005735294,0.001307985,0.001064602,0.0005220352,0.0058513],"category_scores_gemma":[0.00558843,0.0002739159,0.001004404,0.0005402381,0.002059442,0.00277727,0.003344243,0.001949592,0.001067881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005252208,"about_ca_system_score_gemma":0.001212988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001193278,"about_ca_topic_score_gemma":0.0006633382,"domain_scores_codex":[0.9972843,0.0007341456,0.0002232653,0.0004904427,0.0009068437,0.0003609918],"domain_scores_gemma":[0.9966208,0.001341111,0.000192843,0.0009156697,0.0007254453,0.0002041721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002053332,0.0001059301,0.001480206,0.0001963789,0.00003061498,0.0005885141,0.0009013647,0.05869346,0.0247966,0.8150864,0.001588843,0.09632635],"study_design_scores_gemma":[0.00005587865,0.0002703101,0.0007469959,0.00008878485,0.00004117723,0.0006182717,0.000365029,0.2891251,0.03145168,0.6398057,0.0373746,0.00005641915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03590045,0.0000403546,0.9536011,0.0001428331,0.00009787935,0.000115713,0.00008504108,0.0002941306,0.009722441],"genre_scores_gemma":[0.4812149,0.0002282212,0.5056387,0.0002572915,0.00006392053,0.0008007659,0.0006903016,0.0004500939,0.01065581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0058513,"threshold_uncertainty_score":0.01957452,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Keye Martin","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02293368776716887,"gpt":0.2816054540913182,"spread":0.2586717663241493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009389002,0.00132797,0.001564582,0.003228583,0.004810762,0.004597594,0.003354952,0.004678178,0.01237519],"category_scores_gemma":[0.03890622,0.001590309,0.003763363,0.00237727,0.0112989,0.01783366,0.01030537,0.01047868,0.004690403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564936,"about_ca_system_score_gemma":0.002211312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001097896,"about_ca_topic_score_gemma":0.0007219329,"domain_scores_codex":[0.9847574,0.005334252,0.001090136,0.003037238,0.004676087,0.001104889],"domain_scores_gemma":[0.9703557,0.01391346,0.001194696,0.01095307,0.002988907,0.0005940748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007515908,0.00003469087,0.000273077,0.0001425901,0.00004752898,0.0001863261,0.0006285399,0.001073378,0.007441566,0.9496126,0.003757116,0.03672756],"study_design_scores_gemma":[0.00004986781,0.0001436107,0.0002274416,0.0001275721,0.00007390374,0.0006344141,0.0002108239,0.01447313,0.01870524,0.9199716,0.04528786,0.00009457338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002713181,0.0002701461,0.9842896,0.001028211,0.0003578555,0.0001318048,0.0001491653,0.001046768,0.0100133],"genre_scores_gemma":[0.1723172,0.0008398984,0.8142766,0.001222874,0.000598845,0.0006500555,0.000389356,0.0007315423,0.008973645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01237519,"threshold_uncertainty_score":0.04965436,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nicolas Gagné","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005182343513983395,"gpt":0.2511451261321703,"spread":0.2459627826181869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002611381,0.0005318112,0.0007173365,0.004405761,0.00151692,0.003463158,0.001235623,0.001034853,0.003726817],"category_scores_gemma":[0.00486319,0.0004183597,0.0009482765,0.002104301,0.006415489,0.007458024,0.003652582,0.002778885,0.0003504174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001482166,"about_ca_system_score_gemma":0.0006135596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008038001,"about_ca_topic_score_gemma":0.0006058713,"domain_scores_codex":[0.9974629,0.0005398999,0.0001611623,0.0004898889,0.001040201,0.0003060239],"domain_scores_gemma":[0.9956771,0.002174797,0.0004266957,0.0005080032,0.0007587185,0.0004547089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006250594,0.00000904424,0.0003942871,0.0000206499,0.00000648209,0.00003093615,0.0001614525,0.000553782,0.0007913901,0.995427,0.0001836013,0.002415054],"study_design_scores_gemma":[0.0000050026,0.00002942994,0.001157705,0.00001811795,0.00001153062,0.000158571,0.00007784118,0.00699687,0.0009362958,0.9857802,0.004806762,0.00002170247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.166802,0.0019802,0.7717165,0.002366803,0.0002242188,0.0000542491,0.0005920202,0.00037404,0.05589],"genre_scores_gemma":[0.9460638,0.0005522307,0.04618921,0.0004852665,0.0004237416,0.000104352,0.0003554093,0.00009258815,0.005733391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004405761,"threshold_uncertainty_score":0.01381046,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marc Frappier","is_ca":true},{"name":"Fama Diagne","is_ca":true},{"name":"Amel Mammar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03090794954398939,"gpt":0.2734806031087783,"spread":0.2425726535647889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00348745,0.001001522,0.000644086,0.001548925,0.001089383,0.001346115,0.00135651,0.0009754527,0.001917923],"category_scores_gemma":[0.007673561,0.001042645,0.00251369,0.0008907871,0.003405683,0.003252286,0.003324293,0.002717584,0.000682105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001320203,"about_ca_system_score_gemma":0.00219805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01281541,"about_ca_topic_score_gemma":0.009511361,"domain_scores_codex":[0.9963659,0.001293987,0.0002785177,0.0005457668,0.001076278,0.0004395178],"domain_scores_gemma":[0.9939175,0.004184088,0.0002794079,0.0007866332,0.0006948412,0.000137565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004702818,0.0003285504,0.003339818,0.0005227165,0.0002197804,0.001612431,0.001606256,0.07926138,0.09151667,0.7406913,0.001795796,0.07863514],"study_design_scores_gemma":[0.0002127152,0.0003631238,0.0009817288,0.0001054621,0.0001875571,0.0003554679,0.0002849012,0.3547706,0.09345008,0.5380118,0.01116942,0.0001071375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0283294,0.00006341807,0.9680437,0.000232313,0.00002291883,0.00009099783,0.00006162373,0.0008940158,0.002261618],"genre_scores_gemma":[0.4185867,0.0003546845,0.5772649,0.0004808418,0.0000350998,0.0002350744,0.0003419126,0.0002689715,0.002431823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01281541,"threshold_uncertainty_score":0.02548164,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Louis-Julien Guillemette","is_ca":true},{"name":"Stefan Monnier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01093150777426207,"gpt":0.2645138762097173,"spread":0.2535823684354553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736962,0.0003898864,0.0004048962,0.0006382798,0.000833938,0.00238608,0.001328668,0.0008917365,0.003285028],"category_scores_gemma":[0.007494458,0.000670972,0.001230927,0.0004889211,0.00309405,0.003231114,0.001795012,0.002122659,0.001280838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008893171,"about_ca_system_score_gemma":0.001937931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001557639,"about_ca_topic_score_gemma":0.001563724,"domain_scores_codex":[0.9979474,0.0004162956,0.0001906979,0.0002520023,0.0009839669,0.0002096321],"domain_scores_gemma":[0.9958984,0.001507192,0.0003720795,0.001563428,0.0005466043,0.0001123039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002057878,0.0001092672,0.001664923,0.0004840136,0.00005616244,0.001104807,0.002319746,0.03653137,0.02574822,0.7817174,0.008907906,0.1411503],"study_design_scores_gemma":[0.0001101805,0.0001209768,0.0004808752,0.0001647541,0.00005577885,0.0005027173,0.0001313332,0.1047058,0.06462291,0.7730728,0.05591827,0.0001136637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03343899,0.0001971771,0.9370508,0.0007745143,0.0002664043,0.0001255279,0.0003514183,0.01548835,0.01230687],"genre_scores_gemma":[0.4666081,0.000490836,0.5165043,0.0006071105,0.0001851971,0.0003208114,0.0005682593,0.004046039,0.01066937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003285028,"threshold_uncertainty_score":0.01098949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Michael Johnson","is_ca":false},{"name":"Robert Rosebrugh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2576351861500513,"gpt":0.336122033931163,"spread":0.07848684778111176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01833852,0.0014489,0.001787151,0.006326158,0.002568878,0.01002451,0.006756964,0.005045946,0.007487704],"category_scores_gemma":[0.06030394,0.002354177,0.004555757,0.006156238,0.014363,0.0292742,0.01983576,0.008238649,0.001380204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003724811,"about_ca_system_score_gemma":0.002921378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003659707,"about_ca_topic_score_gemma":0.002809346,"domain_scores_codex":[0.9793937,0.007099773,0.001903765,0.003226391,0.007074293,0.001302035],"domain_scores_gemma":[0.9525878,0.01989312,0.003234908,0.01627315,0.005980764,0.002030279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001008098,0.00005010769,0.0009134116,0.0001929477,0.0000461962,0.00009329379,0.001108253,0.003185954,0.0006766596,0.9640732,0.002078341,0.02748077],"study_design_scores_gemma":[0.00005463986,0.0001321127,0.0005134688,0.0001590598,0.00008090249,0.0004874435,0.0006211637,0.03915741,0.001794855,0.930669,0.02619574,0.0001341132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008266649,0.000774443,0.9801524,0.004083841,0.0001079684,0.0002058446,0.0004298471,0.0005741479,0.005404863],"genre_scores_gemma":[0.2382884,0.001689992,0.744426,0.002069271,0.0005648636,0.001205351,0.001569067,0.0003932636,0.009793692],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01833852,"threshold_uncertainty_score":0.09698451,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pieter Hofstra","is_ca":true},{"name":"Robin Cockett","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006429317419456973,"gpt":0.2340248678306625,"spread":0.2275955504112055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001112867,0.0003984785,0.0005306876,0.001787474,0.002634711,0.003491032,0.0005883679,0.001421352,0.005714755],"category_scores_gemma":[0.003292533,0.000236232,0.0004139048,0.001621851,0.008829498,0.009113702,0.002346036,0.002339194,0.0004933032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001467546,"about_ca_system_score_gemma":0.0008573376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001813252,"about_ca_topic_score_gemma":0.001302182,"domain_scores_codex":[0.9988692,0.000406092,0.00004605802,0.0002280887,0.000298044,0.0001523677],"domain_scores_gemma":[0.9987099,0.000653056,0.00009384416,0.0002184095,0.0001923384,0.0001324636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[9.852133e-7,0.000001418981,0.00003187968,0.000006296169,5.526999e-7,0.000005557706,0.00005453894,0.00004530324,0.00002914644,0.9982588,0.0003626925,0.001202793],"study_design_scores_gemma":[0.000001130851,0.000001992732,0.00005619634,0.000005591805,7.089359e-7,0.00002377781,0.00004855876,0.0001930632,0.00002978773,0.9936377,0.005999975,0.000001417476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1312206,0.03123857,0.3312957,0.01719183,0.001700611,0.00009193024,0.0006029476,0.00054227,0.4861156],"genre_scores_gemma":[0.9410885,0.005554752,0.02820489,0.001817389,0.001434171,0.0001343047,0.0003715696,0.00009907847,0.02129522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005714755,"threshold_uncertainty_score":0.01911771,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Faisal Abouzaid","is_ca":true},{"name":"John Mullins","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009075165976633218,"gpt":0.2583048167233229,"spread":0.2492296507466897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003978304,0.0005783461,0.0008621542,0.000709502,0.001250078,0.002767621,0.001282054,0.001161409,0.001914546],"category_scores_gemma":[0.004594542,0.000708858,0.001199484,0.001003391,0.003010915,0.002327762,0.001890648,0.002004605,0.0005513582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001284768,"about_ca_system_score_gemma":0.003415148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003126394,"about_ca_topic_score_gemma":0.002248836,"domain_scores_codex":[0.9968479,0.0007722751,0.0003561171,0.0002769024,0.001407917,0.0003387776],"domain_scores_gemma":[0.9977571,0.00109513,0.0002738064,0.0003041323,0.0004525059,0.0001174161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005560037,0.0000611421,0.0002719979,0.00008923806,0.00002724453,0.0007167995,0.0004865795,0.0485446,0.00704271,0.9301407,0.0006366027,0.01192679],"study_design_scores_gemma":[0.0001139664,0.00006560364,0.0001765672,0.0000726234,0.00006841152,0.0003285768,0.0001311437,0.5097061,0.01442808,0.4457189,0.02912769,0.00006235192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007613944,0.00009552603,0.9867216,0.0001924158,0.00005631366,0.00007650008,0.00004753986,0.0006500538,0.004546119],"genre_scores_gemma":[0.3716259,0.0006167455,0.6191332,0.0002039451,0.0001472735,0.000659603,0.0001665031,0.0002480779,0.007198658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003978304,"threshold_uncertainty_score":0.02103949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andrea Corradini","is_ca":false},{"name":"Marina Lenisa","is_ca":false},{"name":"Ugo Montanari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00990933206034021,"gpt":0.2518749352248162,"spread":0.241965603164476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001200826,0.001209343,0.001113831,0.003033627,0.002467594,0.00632738,0.001929456,0.001888295,0.6146879],"category_scores_gemma":[0.007248091,0.0004220097,0.0008767534,0.002764538,0.0008952956,0.004578732,0.003274361,0.002768711,0.4456075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002288148,"about_ca_system_score_gemma":0.002563864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00241354,"about_ca_topic_score_gemma":0.002906414,"domain_scores_codex":[0.9983959,0.0001836085,0.0001091287,0.0003516753,0.0008165031,0.0001432598],"domain_scores_gemma":[0.9967033,0.0005111012,0.0001402853,0.0004344677,0.001578655,0.0006320708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002693016,0.00002020812,0.0001043902,0.0001301001,0.000002980777,0.00003164291,0.00007939355,0.00005850747,0.0001239582,0.0067094,0.941784,0.0509285],"study_design_scores_gemma":[0.00000221864,0.000008715136,0.0001330493,0.00006702227,0.000001202402,0.00003977798,0.00004364015,0.00001989505,0.00004399009,0.001581335,0.9980561,0.000003203241],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001004447,0.01196614,0.004810819,0.0214186,0.07965093,0.0003234786,0.01100937,0.002252711,0.8675635],"genre_scores_gemma":[0.004468147,0.0056941,0.002101562,0.004975699,0.01310052,0.0001747418,0.01027205,0.001176824,0.9580363],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6146879,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J.R.B. Cockett","is_ca":true},{"name":"Jonathan Gallagher","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0107655719520551,"gpt":0.2362168504622038,"spread":0.2254512785101487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297491,0.0003066577,0.000405493,0.0009713137,0.002005287,0.003712034,0.001100536,0.0008855691,0.003271404],"category_scores_gemma":[0.00192327,0.0002693553,0.0007610469,0.0009175665,0.007125182,0.005469757,0.003545769,0.002250548,0.0004200912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003201208,"about_ca_system_score_gemma":0.001433388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002856393,"about_ca_topic_score_gemma":0.00159254,"domain_scores_codex":[0.9986303,0.0003376895,0.00005540273,0.0002102047,0.0005712301,0.000195277],"domain_scores_gemma":[0.9989417,0.0003481409,0.0001005048,0.000205849,0.0002130845,0.0001907747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002687905,0.00000188078,0.00006280358,0.000003960109,7.538226e-7,0.00001887029,0.0001799978,0.0001866658,0.00008771347,0.9985739,0.00008636522,0.0007943164],"study_design_scores_gemma":[0.000004497796,0.000007208203,0.000107367,0.000006157358,0.000002666387,0.00005324754,0.0001109577,0.001789017,0.0002113204,0.9927604,0.004941322,0.000005773495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3562625,0.00267438,0.4036339,0.009484891,0.0004876637,0.00004800562,0.0003554554,0.0006107087,0.2264425],"genre_scores_gemma":[0.9781951,0.0003518318,0.01192222,0.0003160613,0.000116819,0.000026961,0.00005871059,0.00004251811,0.008969811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003712034,"threshold_uncertainty_score":0.02322644,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Robin Cockett","is_ca":true},{"name":"Luigi Santocanale","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01330354852734839,"gpt":0.2728415819322998,"spread":0.2595380334049515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005635631,0.0006110973,0.0009020031,0.001940889,0.003107095,0.003143477,0.001339213,0.001209324,0.006837697],"category_scores_gemma":[0.006550737,0.0005998514,0.001816146,0.001527974,0.01167228,0.009731121,0.006783789,0.003898356,0.001390329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001910994,"about_ca_system_score_gemma":0.001099944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001579541,"about_ca_topic_score_gemma":0.001517891,"domain_scores_codex":[0.9962895,0.001171596,0.0002518746,0.0008569165,0.0007237995,0.0007063647],"domain_scores_gemma":[0.9933687,0.003518692,0.0004187569,0.001145895,0.001074343,0.0004737363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009355927,0.00001182337,0.0002196558,0.00002272061,0.000003697238,0.00009037784,0.0002459181,0.0001814594,0.0003122417,0.9946468,0.0005441001,0.003711729],"study_design_scores_gemma":[0.000006279209,0.000007573911,0.0001187604,0.00001474905,0.000005596713,0.00009462458,0.00007732968,0.0007862062,0.0008160514,0.9920999,0.005965676,0.000007184649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.09010796,0.005786701,0.6689972,0.006991972,0.0010476,0.0001456416,0.0002719436,0.0009126441,0.2257384],"genre_scores_gemma":[0.85733,0.002373085,0.09559729,0.002539817,0.0006324403,0.0003021775,0.0003927305,0.0004022739,0.04043026],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.006837697,"threshold_uncertainty_score":0.02980441,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Library science; Event (particle physics); China; Computer science; Operations research; Political science; Engineering; Law","authors":[{"name":"Andrzej Skowron","is_ca":false},{"name":"Marcin Szczuka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006809791217408283,"gpt":0.2379298432030809,"spread":0.2311200519856726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464489,0.001239459,0.001242296,0.003564849,0.002130481,0.006983628,0.001938098,0.001706471,0.5435548],"category_scores_gemma":[0.009941256,0.000380325,0.0009388595,0.003285257,0.0006631513,0.004343161,0.002680386,0.002610901,0.4189391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001998673,"about_ca_system_score_gemma":0.002484324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001819317,"about_ca_topic_score_gemma":0.001925236,"domain_scores_codex":[0.9982679,0.0001924628,0.0001452053,0.0003315803,0.0009270648,0.0001357816],"domain_scores_gemma":[0.9951499,0.0007261279,0.0001977318,0.0004972513,0.002729507,0.0006994532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002420178,0.00001633022,0.00008153798,0.0001702861,0.000003631423,0.00004099103,0.00006775555,0.0000513213,0.0001211858,0.002897461,0.9421051,0.05442028],"study_design_scores_gemma":[0.000002899279,0.000009866743,0.0001544524,0.000117305,0.000001980908,0.00005499775,0.00005974677,0.00002003269,0.00004917082,0.001026794,0.9984989,0.00000374274],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.001063113,0.02163216,0.00532175,0.03196016,0.1637597,0.0005516294,0.01131597,0.002241395,0.7621541],"genre_scores_gemma":[0.004795708,0.01193006,0.002957884,0.006956296,0.02837121,0.0003072594,0.01313419,0.001217391,0.93033],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.5435548,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Linan Chen","is_ca":true},{"name":"Florence Clerc","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01095033644623876,"gpt":0.2932761378184984,"spread":0.2823258013722597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003305269,0.0008696325,0.0007802329,0.001573266,0.001080476,0.002324302,0.0010844,0.001303159,0.003343946],"category_scores_gemma":[0.01021418,0.0003695884,0.001207317,0.001033817,0.003370227,0.004300648,0.002470489,0.00253955,0.0005863282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002317695,"about_ca_system_score_gemma":0.001250732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009702224,"about_ca_topic_score_gemma":0.0005409595,"domain_scores_codex":[0.9961144,0.001237516,0.0003155986,0.0007638233,0.001219287,0.0003493118],"domain_scores_gemma":[0.9962121,0.002186192,0.0004584572,0.0003521019,0.0005609309,0.0002303248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001873291,0.0000174951,0.0001004407,0.00002044623,0.000007632203,0.00004242437,0.0001430725,0.005232379,0.0005916452,0.9907453,0.0001015592,0.002978887],"study_design_scores_gemma":[0.00001813297,0.00003343315,0.00007534723,0.00001837529,0.000009944237,0.00006077164,0.00003631253,0.06473133,0.001072103,0.9314282,0.002501083,0.00001504102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05357709,0.0007180762,0.9289439,0.0004372906,0.0001422426,0.0000952378,0.000105767,0.0002711474,0.01570925],"genre_scores_gemma":[0.8370792,0.0007044789,0.1522889,0.0002943623,0.0001735519,0.0005147647,0.0002855824,0.0001757692,0.00848338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003343946,"threshold_uncertainty_score":0.01748013,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mourad Debbabi","is_ca":false},{"name":"Mohamed Mejri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01217210551762005,"gpt":0.3007531301020991,"spread":0.2885810245844791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02176085,0.001417919,0.001581233,0.002405137,0.002934487,0.006296829,0.004128608,0.005224776,0.004201514],"category_scores_gemma":[0.04830686,0.00229814,0.003704851,0.001661467,0.01659627,0.01755332,0.01173989,0.01647885,0.002803385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003384413,"about_ca_system_score_gemma":0.005822855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002283822,"about_ca_topic_score_gemma":0.001194046,"domain_scores_codex":[0.9649392,0.01386247,0.002344203,0.003519293,0.01323022,0.002104677],"domain_scores_gemma":[0.9561017,0.01902982,0.001827022,0.01329252,0.009057407,0.000691485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005838132,0.00003579782,0.0003108818,0.0001847061,0.0000326605,0.000122147,0.0009133673,0.004767359,0.001766808,0.9769056,0.001401837,0.01350058],"study_design_scores_gemma":[0.00005155566,0.00004159521,0.0001103655,0.00009765098,0.00003450673,0.0000986961,0.0001452658,0.02605302,0.005782758,0.949451,0.01810896,0.00002450044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005433189,0.0004568851,0.9824637,0.002417032,0.0002033098,0.0001505138,0.00008819201,0.0006130222,0.008174144],"genre_scores_gemma":[0.2566502,0.001794442,0.7290528,0.00190165,0.0006177175,0.0005213642,0.0006152353,0.0007795176,0.008067138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02176085,"threshold_uncertainty_score":0.1150838,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marc Bagnol","is_ca":true},{"name":"Richard Blute","is_ca":true},{"name":"J.R.B. Cockett","is_ca":true},{"name":"Jean-Simon Pacaud Lemay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009130772844529553,"gpt":0.2667705334765329,"spread":0.2576397606320033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263273,0.0004077519,0.0003976856,0.001262781,0.001022431,0.002049702,0.0006659885,0.0005723641,0.003413811],"category_scores_gemma":[0.001081016,0.0003084657,0.0008841787,0.0008460424,0.003886816,0.005223613,0.002134827,0.001365087,0.000503178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001059192,"about_ca_system_score_gemma":0.0009236702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007124202,"about_ca_topic_score_gemma":0.0006012319,"domain_scores_codex":[0.9992871,0.0001996559,0.0000392592,0.0001595871,0.0001992038,0.0001152586],"domain_scores_gemma":[0.9994429,0.0001498476,0.00008885582,0.0001139291,0.000101972,0.0001024299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006985812,0.000006087,0.00009766694,0.00001317202,0.000002840155,0.00003031866,0.0001074771,0.0001676723,0.0005266273,0.9964647,0.00013816,0.00243836],"study_design_scores_gemma":[0.00001075433,0.0000437312,0.000325212,0.00001306028,0.000008520989,0.0002192242,0.00006703958,0.004003092,0.001644057,0.9792717,0.01437956,0.00001396859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1879365,0.004700122,0.7146306,0.001972387,0.0004609183,0.00007919288,0.0002114075,0.0004119798,0.08959686],"genre_scores_gemma":[0.890798,0.001262212,0.077549,0.0006798495,0.0004468808,0.00009779852,0.0001287772,0.00008437331,0.02895317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003413811,"threshold_uncertainty_score":0.01142031,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"M. Szczepański","is_ca":false},{"name":"Bogdan Smołka","is_ca":false},{"name":"Damian Ślusarczyk","is_ca":false},{"name":"Konstantinos N. Plataniotis","is_ca":true},{"name":"A.N. Venetsanopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01078013114259535,"gpt":0.2758154286070843,"spread":0.265035297464489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000349047,0.0007330913,0.0004574044,0.001079712,0.0002533776,0.0006124136,0.000552951,0.000643035,0.002442743],"category_scores_gemma":[0.0006531187,0.0002106961,0.0006053849,0.0008582899,0.0006826011,0.001106051,0.0004592297,0.001000822,0.0005004288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005887339,"about_ca_system_score_gemma":0.0003815004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000874174,"about_ca_topic_score_gemma":0.0007201422,"domain_scores_codex":[0.9997911,0.00005046007,0.000008812221,0.00004707613,0.00008713157,0.00001550183],"domain_scores_gemma":[0.9998162,0.00006308137,0.00002402631,0.00002520723,0.00005590586,0.00001556641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001020367,0.00005564312,0.0003244702,0.0002780019,0.00008183971,0.0002090928,0.000163799,0.07242993,0.05857051,0.5262948,0.00415029,0.3373396],"study_design_scores_gemma":[0.00002021387,0.0001891089,0.0007316957,0.00002664698,0.00003783264,0.0007661387,0.00004416011,0.6881127,0.0237777,0.2359793,0.05025633,0.00005824195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004066818,0.0009599289,0.9925748,0.00009311171,0.00006278935,0.00002236646,0.00002226075,0.0001637573,0.002034165],"genre_scores_gemma":[0.1565108,0.004829732,0.819649,0.0001650184,0.0003037999,0.000157608,0.0001724341,0.0002511519,0.01796037],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002442743,"threshold_uncertainty_score":0.008171797,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Linan Chen","is_ca":true},{"name":"Florence Clerc","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03078826570739078,"gpt":0.2933481879273884,"spread":0.2625599222199976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006401537,0.001021527,0.001129097,0.003666578,0.001361389,0.004955714,0.001938761,0.003012691,0.002314541],"category_scores_gemma":[0.01850353,0.0007890144,0.002414765,0.002237285,0.008214264,0.01065404,0.004397617,0.005834767,0.0004006479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002074164,"about_ca_system_score_gemma":0.001808996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001683719,"about_ca_topic_score_gemma":0.0006241968,"domain_scores_codex":[0.9946868,0.001649773,0.0007098645,0.001134347,0.001303427,0.0005157759],"domain_scores_gemma":[0.9846433,0.008201283,0.001922473,0.002146944,0.001880975,0.001204979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004945682,0.00007374289,0.0009390811,0.00005625444,0.00001664189,0.0000905107,0.0007659266,0.003623948,0.0007901312,0.9813703,0.0002278535,0.01199612],"study_design_scores_gemma":[0.00002784192,0.00007306576,0.0005264614,0.00005280425,0.00001796401,0.0001010239,0.0002240604,0.04222006,0.0005584402,0.9534373,0.002733947,0.00002697538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1053224,0.001174545,0.8811575,0.001262658,0.0002055612,0.0002141947,0.0001514761,0.0002687935,0.0102429],"genre_scores_gemma":[0.7353059,0.001033958,0.2588528,0.0004442601,0.0004281017,0.000462088,0.0005934197,0.000138514,0.002740895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006401537,"threshold_uncertainty_score":0.03385496,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brigitte Pientka","is_ca":true},{"name":"Xi Li","is_ca":true},{"name":"Florent Pompigne","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02003061955941909,"gpt":0.2889938892297287,"spread":0.2689632696703096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007290433,0.0008057292,0.001032127,0.001593981,0.001194303,0.003428977,0.002353488,0.00103627,0.0265705],"category_scores_gemma":[0.0144133,0.001044571,0.00205923,0.00116853,0.001697676,0.01173523,0.003607082,0.0050805,0.004293152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001754521,"about_ca_system_score_gemma":0.00300176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004053629,"about_ca_topic_score_gemma":0.002360484,"domain_scores_codex":[0.9952073,0.001641759,0.0002846033,0.0007772346,0.001546209,0.0005428839],"domain_scores_gemma":[0.9916307,0.004123738,0.0001689406,0.001881636,0.001918686,0.0002762903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005776238,0.0004797706,0.00264586,0.0010439,0.0001214834,0.0005207781,0.001107382,0.009866877,0.02748769,0.5225675,0.01728616,0.416295],"study_design_scores_gemma":[0.0003057103,0.0008348619,0.002397749,0.0005078913,0.0003480371,0.001727529,0.0005779043,0.1747177,0.1250476,0.3549762,0.3382058,0.0003529832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00979589,0.000753291,0.9723377,0.0007956414,0.0001840089,0.0002144282,0.0002072429,0.002663966,0.0130478],"genre_scores_gemma":[0.1618579,0.001883707,0.8133844,0.0007565901,0.0004626952,0.0003623086,0.001264527,0.00146671,0.01856123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0265705,"threshold_uncertainty_score":0.08888716,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Huichun Xu","is_ca":true},{"name":"S. Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004056061187361299,"gpt":0.2303879877299941,"spread":0.2263319265426328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007288171,0.001154815,0.001150474,0.003085405,0.003509408,0.006520473,0.003073233,0.003261234,0.006521133],"category_scores_gemma":[0.007594458,0.001358606,0.003586798,0.003755209,0.009999583,0.01511597,0.003449554,0.008195174,0.002870846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002628259,"about_ca_system_score_gemma":0.002619488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002553963,"about_ca_topic_score_gemma":0.001412147,"domain_scores_codex":[0.9958353,0.001254632,0.0005871632,0.0008671629,0.001089156,0.0003665272],"domain_scores_gemma":[0.9953909,0.002161185,0.000493821,0.0009403974,0.000824483,0.0001892136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003812599,0.000005019454,0.00004550062,0.00002801365,0.000003422758,0.00002417163,0.0002925985,0.0003647211,0.0001599459,0.9943798,0.0008477534,0.003845279],"study_design_scores_gemma":[0.00001227159,0.00001455946,0.00004759675,0.00005058773,0.00001477904,0.00009071814,0.0000860404,0.002881976,0.0004659403,0.9524088,0.04390644,0.00002026283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003245551,0.00208228,0.9748683,0.002497382,0.0008358333,0.0001095344,0.0003225367,0.0008967892,0.01514179],"genre_scores_gemma":[0.1357377,0.003989248,0.8372536,0.003360237,0.001887483,0.001111523,0.001034015,0.0009106733,0.01471549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007288171,"threshold_uncertainty_score":0.038544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sa’ed Abed","is_ca":true},{"name":"Otmane Aı̈t Mohamed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01075389753875564,"gpt":0.2872517377196815,"spread":0.2764978401809259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393949,0.0007468018,0.0006036688,0.001205293,0.0005697648,0.001547872,0.001842869,0.0008494496,0.00962643],"category_scores_gemma":[0.003284881,0.0004775481,0.00144502,0.0005143991,0.001304561,0.002131683,0.001640256,0.001310724,0.001652192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001120335,"about_ca_system_score_gemma":0.001700142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003234032,"about_ca_topic_score_gemma":0.002604737,"domain_scores_codex":[0.9987118,0.0002942251,0.00008566221,0.0002981335,0.0004088373,0.0002012426],"domain_scores_gemma":[0.998516,0.0007851756,0.0001058205,0.0003494401,0.0001784777,0.00006514895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007344153,0.0006129947,0.002647516,0.000903778,0.0001912463,0.001731925,0.0006058465,0.2384245,0.04407037,0.4088938,0.01029835,0.2908852],"study_design_scores_gemma":[0.0002535761,0.0003152551,0.0004928494,0.0001057005,0.0001056302,0.0006386123,0.00006804599,0.7166898,0.0622939,0.1693995,0.04954766,0.00008947207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01311675,0.00008428967,0.9711477,0.0001275865,0.00004480785,0.0003156291,0.0004782189,0.01047156,0.004213381],"genre_scores_gemma":[0.2268114,0.0001681369,0.76557,0.000194785,0.0000295087,0.0004570158,0.001177469,0.0007609946,0.004830607],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00962643,"threshold_uncertainty_score":0.03220356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}