{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137739,0.00007889621,0.0001402182,0.00003254917,0.0001267396,0.00002326232,0.0003921717,0.00001453122,0.00002845049],"category_scores_gemma":[0.00001487282,0.00005166368,0.0000412268,0.0002721685,0.001428077,0.00006025043,0.0001079626,0.0001161228,0.000001379452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001367178,"about_ca_system_score_gemma":0.00008885824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002334287,"about_ca_topic_score_gemma":0.000001503651,"domain_scores_codex":[0.9991268,0.00002857478,0.000176501,0.0002405907,0.0001076162,0.0003199238],"domain_scores_gemma":[0.999324,0.0002911552,0.00005217304,0.0002354621,0.0000507887,0.00004636767],"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.00003870784,0.0001504738,0.00005928248,0.000002616467,0.000003601622,3.132618e-8,0.0002442608,0.000001654757,0.0002850978,0.9782687,0.000001283522,0.0209443],"study_design_scores_gemma":[0.00101427,0.0001553339,0.00004715127,0.000005614199,0.000005461558,3.611641e-7,0.000006933714,0.2327935,0.009850557,0.756049,0.00001944898,0.00005239234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2941068,0.00001410739,0.7052544,0.0001433465,0.00003162472,0.0002231987,0.000003567598,0.000003973957,0.0002189817],"genre_scores_gemma":[0.9954348,0.000001846543,0.004413884,0.00004426028,0.00005047856,0.00004899568,0.000001056265,0.000004091364,5.951636e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.701328,"threshold_uncertainty_score":0.5261809,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002890291,0.0001136966,0.000171379,0.0002312776,0.0001186588,0.0000888816,0.0006531054,0.00005350238,9.124812e-7],"category_scores_gemma":[0.0004437282,0.0001074691,0.00001811101,0.0009761789,0.001199032,0.001281219,0.0001936871,0.0001448809,1.918284e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009149486,"about_ca_system_score_gemma":0.0001163069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000673566,"about_ca_topic_score_gemma":4.388912e-7,"domain_scores_codex":[0.9983157,0.0001537528,0.0003577427,0.0004025274,0.0004011408,0.0003691262],"domain_scores_gemma":[0.9989776,0.0002448425,0.0002019192,0.0003610644,0.0001567256,0.00005783379],"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.000006822012,0.00002535504,0.0005001831,0.00001107203,7.799247e-7,1.56957e-7,0.0003390327,0.0009972261,0.03000008,0.7377539,2.419264e-8,0.2303653],"study_design_scores_gemma":[0.0001192471,0.0002714916,0.008394551,0.00003610316,0.000003031336,0.00001920032,0.000002801658,0.6722065,0.2033984,0.1154639,6.853033e-7,0.00008396263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4355108,0.00005798932,0.5641756,0.0000913734,0.00002847717,0.00009657052,1.866999e-7,0.00001676933,0.00002220698],"genre_scores_gemma":[0.6519042,0.00001955712,0.3480419,0.00002108381,0.000009031535,0.000001523541,4.388694e-7,0.000002086245,1.402418e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6712093,"threshold_uncertainty_score":0.4417882,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002421193,0.000321475,0.0004203015,0.000278238,0.0007297271,0.0003731798,0.00237664,0.00007859469,0.000008378901],"category_scores_gemma":[0.000189629,0.0002737724,0.0001208906,0.001360375,0.001316128,0.0007033491,0.0005429902,0.0003901685,0.00002457864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006344062,"about_ca_system_score_gemma":0.0007743892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009141527,"about_ca_topic_score_gemma":0.000007722214,"domain_scores_codex":[0.9958312,0.000115024,0.0005318707,0.001140718,0.0007322142,0.001648988],"domain_scores_gemma":[0.9978787,0.0005910946,0.0001825112,0.0008595873,0.0002648683,0.0002232924],"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.00001225396,0.00005998529,0.0001992782,0.00003054418,0.000008415766,0.00005373215,0.0001974666,0.0008926832,0.0004828818,0.9873031,0.000003316927,0.01075637],"study_design_scores_gemma":[0.0009333141,0.0003775882,0.0005320958,0.00006552064,0.000009247066,0.0008863826,0.00000891903,0.852271,0.008764382,0.1353657,0.0001862367,0.0005996309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0392691,0.0002528616,0.9577035,0.0001455615,0.001089054,0.0004909795,0.00000110165,0.0002664471,0.000781348],"genre_scores_gemma":[0.8337877,0.000003592199,0.1657826,0.0001008493,0.0002664766,0.00003131763,0.000001070523,0.00001787489,0.00000842638],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8519374,"threshold_uncertainty_score":0.9999714,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002406923,0.0001349212,0.0001339633,0.0001239568,0.0002272441,0.00008841828,0.0004332312,0.00002607286,0.00005282366],"category_scores_gemma":[0.00002938674,0.0001246474,0.00005068464,0.0009614346,0.0004962705,0.00009302278,0.00007771299,0.0002444123,0.00002329618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001934353,"about_ca_system_score_gemma":0.0002690858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001565629,"about_ca_topic_score_gemma":0.000004947207,"domain_scores_codex":[0.9980359,0.00003534094,0.0002745648,0.0004004857,0.0005080742,0.0007456124],"domain_scores_gemma":[0.9992038,0.0002083105,0.00006560769,0.0002384306,0.0001655428,0.000118325],"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.000008909285,0.000121954,0.0003774753,0.000001581115,0.000002711302,5.252401e-7,0.00001851105,0.0006281985,0.001529008,0.977357,0.000003893364,0.01995029],"study_design_scores_gemma":[0.00021484,0.00006557549,0.0007226793,0.00001069523,0.000002961123,3.763666e-7,0.00000400947,0.4368153,0.01097864,0.551044,0.00003427918,0.0001066456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1212989,0.00001413843,0.8778799,0.0003321591,0.00009826497,0.0001632106,0.000004260862,0.00003630706,0.0001728577],"genre_scores_gemma":[0.9960374,2.236759e-7,0.003744891,0.00008746083,0.00009694533,0.00001049292,0.00001398284,0.000008522195,1.124203e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8747385,"threshold_uncertainty_score":0.5082973,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001500462,0.0001951732,0.0002176337,0.000194462,0.0003828983,0.0003067162,0.001389871,0.00007255979,0.00001250791],"category_scores_gemma":[0.0002437493,0.0001630879,0.00006685287,0.0007882994,0.001315827,0.0005872134,0.0005435918,0.0002909175,0.00002359607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003910601,"about_ca_system_score_gemma":0.0003637413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004991586,"about_ca_topic_score_gemma":0.00002726134,"domain_scores_codex":[0.9974427,0.00007573452,0.0002733058,0.0008128818,0.0003039382,0.001091435],"domain_scores_gemma":[0.9984769,0.0006344407,0.00004355319,0.0005269463,0.0001074292,0.0002107504],"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.00000522952,0.00005079912,0.00007827194,0.000005562332,0.000002901098,0.000001247386,0.0003343672,0.0001293607,0.0005833266,0.9163647,0.00001086568,0.0824334],"study_design_scores_gemma":[0.0003952272,0.0002862168,0.0003515224,0.00001962215,0.000004105259,0.00008692311,0.000002339398,0.6631679,0.008254357,0.3261124,0.001081494,0.0002378701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04385709,0.0004323983,0.9506921,0.003328352,0.0002681573,0.0002847248,7.555474e-7,0.0001263282,0.001010066],"genre_scores_gemma":[0.9338564,0.00003238082,0.06540912,0.0004578925,0.0001866175,0.00003484632,5.893302e-7,0.000007895017,0.00001420821],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8899994,"threshold_uncertainty_score":0.6650532,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002908112,0.0002205177,0.0002712334,0.0003962167,0.0001955873,0.0004810308,0.001631093,0.00009442444,0.00001444113],"category_scores_gemma":[0.0003686131,0.0001854906,0.0000654609,0.002688483,0.0007573843,0.0008223964,0.0007311043,0.0005814218,0.0002028978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004081187,"about_ca_system_score_gemma":0.0004964289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002343942,"about_ca_topic_score_gemma":0.00004215684,"domain_scores_codex":[0.9961357,0.0002285561,0.0004397689,0.001077236,0.0006669108,0.001451871],"domain_scores_gemma":[0.9983957,0.0003871555,0.00005975898,0.0007832675,0.00008686532,0.0002873007],"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.00001136654,0.0002946343,0.0003081525,0.000003812296,0.0000022671,0.000007308943,0.0006334162,0.001242924,0.00005987649,0.9472681,0.00002717738,0.050141],"study_design_scores_gemma":[0.0004639965,0.0004911541,0.0006549377,0.000008686377,0.00000310947,0.0001281812,0.000009743067,0.8342009,0.001037751,0.1568312,0.005780741,0.0003895911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006277059,0.00006579095,0.9852729,0.003470424,0.0003485475,0.0003914105,1.639678e-7,0.0001420311,0.004031656],"genre_scores_gemma":[0.8789926,0.00000238534,0.1200356,0.0006235174,0.0002646094,0.00005848858,6.448946e-7,0.000008112713,0.00001408082],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8727155,"threshold_uncertainty_score":0.7564088,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004436238,0.0002789844,0.0003105268,0.0003858443,0.0003320486,0.0004334196,0.002410884,0.0001025779,7.968652e-7],"category_scores_gemma":[0.0008229315,0.0002460624,0.00007293803,0.001246643,0.0009749284,0.0002821969,0.0005560956,0.0003397229,0.000004923368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003870961,"about_ca_system_score_gemma":0.0006731179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001389706,"about_ca_topic_score_gemma":0.000009320121,"domain_scores_codex":[0.9963204,0.00004758809,0.000472401,0.0009991769,0.0005358078,0.001624674],"domain_scores_gemma":[0.9973626,0.001097623,0.0001112824,0.0009580788,0.0002351469,0.0002352857],"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.00001168765,0.00006376939,0.0002598366,0.00001979794,0.000002909934,0.00001547702,0.0002376862,0.003138137,0.0005172926,0.9775777,0.00005070042,0.01810502],"study_design_scores_gemma":[0.0001642071,0.0002435428,0.0001771764,0.00004705555,0.000002521087,0.00004628094,2.754787e-7,0.6367869,0.002667073,0.359642,0.000006141809,0.0002169101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02583035,0.00006159863,0.9714103,0.0002658681,0.0003445025,0.000447615,0.000001746383,0.001498857,0.0001392014],"genre_scores_gemma":[0.6473121,0.00000186495,0.3522244,0.000313552,0.00009251084,0.00003735043,6.17716e-7,0.00001321714,0.000004372953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6336487,"threshold_uncertainty_score":0.9999992,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770954,0.0001677856,0.0001511429,0.0001709098,0.0005242882,0.0003956453,0.002058661,0.00005533973,0.00000613056],"category_scores_gemma":[0.0003371952,0.000120434,0.00004020416,0.001342818,0.001005074,0.0003265055,0.0003580879,0.0004669588,0.00004831221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001014935,"about_ca_system_score_gemma":0.0001378879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001910676,"about_ca_topic_score_gemma":8.717945e-7,"domain_scores_codex":[0.9978059,0.0001315971,0.0002530274,0.0006608418,0.0004705994,0.0006780417],"domain_scores_gemma":[0.9964415,0.002316688,0.00005651656,0.001025211,0.00003304986,0.0001270763],"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.000001240856,0.00003435777,0.0006320492,0.000001111307,9.643858e-7,0.000002053787,0.0001347071,0.00003585869,0.0002322039,0.974839,0.00001160924,0.02407487],"study_design_scores_gemma":[0.0001262056,0.0001890823,0.0310079,0.00001743332,0.000002461637,0.00000777848,0.000001062811,0.1424621,0.002388806,0.8236105,0.00004299586,0.0001437119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539011,0.00006048083,0.7341769,0.01057491,0.00004175126,0.0001977626,5.886778e-7,0.0001415922,0.0009049154],"genre_scores_gemma":[0.9898148,0.000003504217,0.009288006,0.0008174228,0.00005706029,0.00000840011,0.000001376462,0.000005148681,0.000004265138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7359138,"threshold_uncertainty_score":0.4911158,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001214101,0.0003773604,0.0004484206,0.0002883536,0.0004854039,0.0002683787,0.0025793,0.00009708272,0.00006794601],"category_scores_gemma":[0.0003196484,0.0003053503,0.000135505,0.001076355,0.002261179,0.0009345235,0.0005261338,0.0004814333,0.00003649436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000196542,"about_ca_system_score_gemma":0.0003452478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000169889,"about_ca_topic_score_gemma":0.00002568664,"domain_scores_codex":[0.9961324,0.00008998457,0.0004717294,0.001157799,0.0005620022,0.001586045],"domain_scores_gemma":[0.9969417,0.001512195,0.0002010407,0.0008673179,0.0002178583,0.0002598706],"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.00005974362,0.0001747781,0.0002661027,0.00001059709,0.000009375478,0.00001572799,0.0005588426,0.0007492593,0.0005256604,0.9908554,0.00001588554,0.006758644],"study_design_scores_gemma":[0.0005218412,0.0004591079,0.007939158,0.00003257076,0.000004974154,0.0000270153,0.000006734854,0.306411,0.005060173,0.6789605,0.000182185,0.0003947011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03631402,0.0001905545,0.9605978,0.001182028,0.0005360539,0.0004371121,0.000005969203,0.000190983,0.0005455002],"genre_scores_gemma":[0.9155439,0.000006852445,0.08345061,0.0008521757,0.00009927355,0.00002013416,0.000004003506,0.00001615996,0.000006918985],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8792298,"threshold_uncertainty_score":0.9999399,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002679226,0.000299227,0.0003491981,0.0002242746,0.0003345749,0.0006252594,0.002606875,0.0001206271,0.000007206255],"category_scores_gemma":[0.0003408687,0.0002502756,0.000122573,0.001582127,0.001080997,0.0004820183,0.0005737417,0.0003680591,0.00002061135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002629108,"about_ca_system_score_gemma":0.0002760762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004826394,"about_ca_topic_score_gemma":0.00002817079,"domain_scores_codex":[0.9959126,0.0001468805,0.000433218,0.001060553,0.0006840281,0.001762685],"domain_scores_gemma":[0.9980713,0.0005115019,0.0001207759,0.0009526419,0.0001187406,0.0002250243],"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.00001072753,0.0001084345,0.0001432131,0.00001857108,0.00000654249,0.00003589694,0.001474542,0.00005110191,0.001217312,0.8530287,0.00002296013,0.1438821],"study_design_scores_gemma":[0.001250565,0.001294357,0.00008725854,0.0000369111,0.00001550032,0.0003062138,0.00007303029,0.6730282,0.01709206,0.3010467,0.004898164,0.0008711002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02208304,0.0008203183,0.9744043,0.0009890208,0.0003944057,0.0007205217,6.809967e-7,0.0002832369,0.0003044404],"genre_scores_gemma":[0.9267715,0.00001347425,0.07253773,0.0003441709,0.0001988013,0.00006774085,0.000004085689,0.00001938207,0.00004315063],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9046884,"threshold_uncertainty_score":0.9999949,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001821408,0.0001698562,0.0001825242,0.0002992684,0.0004041519,0.0003189888,0.00212108,0.0000611248,0.00001334948],"category_scores_gemma":[0.0003613058,0.0001567097,0.00005768282,0.001355449,0.001680351,0.0004025052,0.0005230131,0.0001959643,0.00002211261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631265,"about_ca_system_score_gemma":0.0004363915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002294526,"about_ca_topic_score_gemma":0.000004204593,"domain_scores_codex":[0.9975103,0.00007435655,0.0003086283,0.0007281653,0.0004599989,0.0009185559],"domain_scores_gemma":[0.9982647,0.0006220752,0.00007770405,0.00055587,0.0003638086,0.000115858],"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.000008670522,0.000044815,0.000082587,0.000003561859,0.000002361567,0.000001104286,0.0002075372,0.001016921,0.0001632446,0.9775177,0.00004308895,0.02090839],"study_design_scores_gemma":[0.0001697651,0.0003186282,0.0001514665,0.00001469749,0.000001187684,0.00001262134,4.2788e-7,0.6075853,0.008173897,0.3832651,0.0001702613,0.0001366759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006059525,0.00003837144,0.990897,0.00167319,0.0003108332,0.0002607386,6.666842e-7,0.0002838461,0.0004758203],"genre_scores_gemma":[0.5686285,0.000003762896,0.4307795,0.0004315723,0.0001347639,0.0000121585,7.132509e-7,0.000005477548,0.000003484653],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6065683,"threshold_uncertainty_score":0.6390436,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00343925,0.0002577048,0.0003644294,0.0003816292,0.0001828,0.000380175,0.002896068,0.0001015285,0.00002757767],"category_scores_gemma":[0.0002977924,0.0002135422,0.00007102761,0.002085721,0.0009935831,0.0006010751,0.0007696221,0.0005264078,0.00008188093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005037222,"about_ca_system_score_gemma":0.000385445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000224468,"about_ca_topic_score_gemma":0.0001084591,"domain_scores_codex":[0.996167,0.0002449703,0.0005106407,0.0009726872,0.0006705059,0.001434193],"domain_scores_gemma":[0.9982885,0.0004439669,0.00009088479,0.0009068561,0.0001034652,0.0001663029],"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.000009787568,0.0001423183,0.0001732401,0.000008115563,0.000002149885,0.00001286915,0.0005413655,0.0006069751,0.0003042495,0.954767,0.000004088283,0.04342787],"study_design_scores_gemma":[0.0005318678,0.0002766077,0.0002350474,0.00001058416,0.000001658997,0.00003795305,0.000002604232,0.4296919,0.00339827,0.5653095,0.0002559105,0.0002480909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02588095,0.000181826,0.9699771,0.001448325,0.0003458383,0.0004873073,1.446217e-7,0.0001624463,0.001516045],"genre_scores_gemma":[0.9754764,0.000008246507,0.0239294,0.000386704,0.000137766,0.00004179672,7.158823e-7,0.00001053594,0.000008407196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9495955,"threshold_uncertainty_score":0.8707997,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281452,0.0002216283,0.0002617245,0.0003271187,0.0002506827,0.0002820466,0.003205893,0.00008849148,0.00002248886],"category_scores_gemma":[0.0004342871,0.0002013129,0.00009357091,0.001612519,0.0004725118,0.001366385,0.0003315297,0.0003394242,0.00002823301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004067317,"about_ca_system_score_gemma":0.0007032815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007354362,"about_ca_topic_score_gemma":0.000007220454,"domain_scores_codex":[0.9966742,0.0001604667,0.0004479502,0.0009016077,0.0005650517,0.00125077],"domain_scores_gemma":[0.9978523,0.0008454488,0.00008324862,0.0008992243,0.00009898997,0.0002207808],"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.000008862256,0.00002165387,0.000001775504,0.000003352318,0.000001577078,3.259679e-7,0.0002599166,0.0005379805,0.0008532747,0.5503234,0.000006648476,0.4479812],"study_design_scores_gemma":[0.0004119193,0.0002295842,0.00003888709,0.00001589235,0.000002955508,0.00002879258,9.247066e-7,0.7120531,0.05608381,0.2299216,0.001020534,0.0001919983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007388291,0.00008228481,0.9947652,0.002851272,0.0003064703,0.0005040595,6.581041e-7,0.0002569914,0.0004942451],"genre_scores_gemma":[0.2799569,0.000005620476,0.7194223,0.0004111397,0.0001549801,0.00002903071,5.341897e-7,0.000009821234,0.000009649951],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7115151,"threshold_uncertainty_score":0.8209302,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00658948,0.0002912075,0.0004370997,0.0008144436,0.0002260058,0.0004100833,0.004555212,0.0001056195,0.00005122542],"category_scores_gemma":[0.0007224153,0.0002643069,0.0001665435,0.008545229,0.0008276555,0.0009861763,0.001110161,0.0005341867,0.0001538157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00079264,"about_ca_system_score_gemma":0.0005946991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003560726,"about_ca_topic_score_gemma":0.00001590193,"domain_scores_codex":[0.9949846,0.0004260081,0.0005715623,0.001625994,0.001004593,0.001387217],"domain_scores_gemma":[0.9967567,0.0004359183,0.0001016707,0.002075192,0.0001554277,0.0004750639],"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.00001383462,0.00008537233,0.0001839585,0.000003301045,0.00001402409,5.328089e-7,0.0008586301,0.009446345,0.0001717434,0.7917981,0.00001737623,0.1974067],"study_design_scores_gemma":[0.000218704,0.0001770752,0.003264355,0.000006893232,0.00001979609,0.00001190609,0.000003363783,0.8913854,0.006050419,0.0980517,0.0004768967,0.0003335424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01695202,0.00003641502,0.9782082,0.001630697,0.0001699962,0.0003875498,9.864623e-7,0.0002045855,0.002409498],"genre_scores_gemma":[0.494735,0.000002020309,0.5047705,0.0003822867,0.00008217825,0.00001326023,9.965155e-7,0.00000552171,0.000008282925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.881939,"threshold_uncertainty_score":0.9999809,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774252,0.0001954212,0.0002127319,0.0001981764,0.0002984482,0.000215641,0.0009046511,0.00004476787,0.000009365118],"category_scores_gemma":[0.0002173888,0.0001595648,0.00002342421,0.001398952,0.001434407,0.001373545,0.0007432908,0.0002718996,0.00001467767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001623017,"about_ca_system_score_gemma":0.0005291373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007961057,"about_ca_topic_score_gemma":0.00002589774,"domain_scores_codex":[0.9976321,0.00005377905,0.0002921346,0.0007652034,0.0004237365,0.0008330769],"domain_scores_gemma":[0.9988217,0.0002437076,0.00006526775,0.0005985693,0.0001257942,0.0001449967],"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.000004711758,0.00004759975,0.00006455965,0.00002262215,0.000002288416,0.000005332175,0.0005259514,0.0004406874,0.0002606883,0.9839946,8.228146e-7,0.01463011],"study_design_scores_gemma":[0.001710427,0.0006342086,0.0005962407,0.0002464474,0.000006799785,0.0002038055,0.00003958168,0.1664529,0.01266545,0.8159053,0.0007259657,0.0008128773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03262813,0.0002630241,0.9651892,0.001101135,0.0001296632,0.0002540282,0.000002149002,0.0001039816,0.0003287276],"genre_scores_gemma":[0.7215493,0.00001940789,0.2781866,0.0001726941,0.00003955284,0.00002199775,0.00000108098,0.000006102586,0.000003235112],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6889212,"threshold_uncertainty_score":0.6506864,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662704,0.0001847815,0.0002111695,0.0002744123,0.0002547657,0.0002820959,0.00276739,0.00007475053,0.00003388766],"category_scores_gemma":[0.0007105858,0.000167709,0.00007006483,0.001651841,0.00125202,0.0007159851,0.000472676,0.0003042208,0.0000632512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002425984,"about_ca_system_score_gemma":0.0001054266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000111212,"about_ca_topic_score_gemma":0.00000107002,"domain_scores_codex":[0.9971022,0.0001222284,0.0003472526,0.0007791269,0.00051213,0.001137064],"domain_scores_gemma":[0.9980545,0.000663658,0.00008086898,0.0009241489,0.0001406752,0.0001361697],"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.000004031601,0.00006248128,0.00002258724,0.000006775212,0.000001869597,0.000001491972,0.0002631807,0.000199473,0.0004987454,0.9088849,0.00001590626,0.09003855],"study_design_scores_gemma":[0.0002169139,0.0002559563,0.00007180683,0.0000130298,0.000001873769,0.00001993905,6.992547e-7,0.7237581,0.01257696,0.2626139,0.0003038399,0.0001670002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006064405,0.0001283681,0.9906914,0.00151632,0.0004677007,0.0003754583,6.085976e-7,0.0001620375,0.0005937546],"genre_scores_gemma":[0.5368627,0.00001061087,0.4627723,0.0002601951,0.00005766573,0.00002423221,2.351578e-7,0.000006204848,0.000005874508],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7235586,"threshold_uncertainty_score":0.6838976,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089259,0.0002571953,0.0003097017,0.0002371188,0.0003274358,0.0008590097,0.002969863,0.00008656437,0.0001131273],"category_scores_gemma":[0.00009705991,0.0002169299,0.00006764216,0.00207278,0.0007984377,0.0005159813,0.0004834656,0.0003940316,0.0004666518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002773725,"about_ca_system_score_gemma":0.0002889365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001499124,"about_ca_topic_score_gemma":0.0000104803,"domain_scores_codex":[0.9960753,0.000114728,0.0003988049,0.001094923,0.0007241088,0.001592115],"domain_scores_gemma":[0.998261,0.0003619124,0.00005039435,0.000959274,0.00006569332,0.0003017076],"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.000007639252,0.00005319353,0.00004072942,0.000002666085,0.000001971015,0.000007003923,0.0003803506,0.0004290235,0.0002012971,0.6602133,0.000007706843,0.3386551],"study_design_scores_gemma":[0.0004910385,0.0008462254,0.0009010506,0.00001812236,0.000004254933,0.00008337534,0.000005917006,0.1312953,0.007566913,0.8533408,0.00477398,0.0006729477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02765001,0.00007770272,0.9586014,0.0008451717,0.0003360688,0.0004123081,2.021593e-7,0.0002417743,0.01183534],"genre_scores_gemma":[0.9674984,0.000005426863,0.03119965,0.00105599,0.0001761892,0.00003034972,7.733385e-7,0.00001154704,0.00002172145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9398484,"threshold_uncertainty_score":0.8846143,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00525838,0.0003905919,0.000456598,0.0003341591,0.0004839409,0.0004141719,0.00218153,0.0001162429,0.00009459842],"category_scores_gemma":[0.0003604802,0.0003511318,0.00009564164,0.001968235,0.005167416,0.001350708,0.003106806,0.0007335756,0.00005987419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005580182,"about_ca_system_score_gemma":0.0003778331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001944423,"about_ca_topic_score_gemma":0.00001052574,"domain_scores_codex":[0.9945204,0.0004162064,0.0005609145,0.00132373,0.001055996,0.002122753],"domain_scores_gemma":[0.9964877,0.001512078,0.0001037621,0.001163016,0.0001950667,0.0005383873],"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.00001117501,0.000299315,0.007761036,0.00001151877,0.000005618191,0.000003006885,0.0003051904,0.0003145627,0.00009229258,0.9183882,0.000009516265,0.0727985],"study_design_scores_gemma":[0.0003238264,0.000184955,0.06291538,0.000009857806,0.000003288939,0.0001196372,0.000002188696,0.5158526,0.0005409305,0.4196667,0.00006769801,0.000312962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1690091,0.0003378785,0.8272594,0.001591824,0.000808092,0.0003372609,0.000001635704,0.000255998,0.0003987144],"genre_scores_gemma":[0.8381241,0.00000651491,0.1611562,0.0004842554,0.0002001998,0.00001407337,0.000002105779,0.0000112925,0.000001280909],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6691149,"threshold_uncertainty_score":0.9998941,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004839948,0.0002071494,0.0004623672,0.000891855,0.0001740471,0.0002571903,0.002676123,0.000076631,0.000003873545],"category_scores_gemma":[0.0004635459,0.000178476,0.0001080882,0.007061637,0.001394187,0.0007341264,0.0003302384,0.0003130027,0.000001723433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000448647,"about_ca_system_score_gemma":0.0004116438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001428262,"about_ca_topic_score_gemma":0.00000197566,"domain_scores_codex":[0.9965134,0.0003670724,0.0006196693,0.0008223982,0.0007770649,0.000900377],"domain_scores_gemma":[0.9978114,0.0004762075,0.0002357605,0.00112464,0.0002384013,0.0001135316],"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.000008072703,0.00007818508,0.0001427028,0.00001070164,0.00001533968,0.000001910293,0.0003097313,0.04210485,0.002655087,0.9245874,6.586073e-8,0.03008591],"study_design_scores_gemma":[0.00009326682,0.0002371672,0.001588325,0.00004094119,0.00003561276,0.00001142825,0.000003290998,0.846131,0.005497631,0.1461843,9.501334e-7,0.0001760901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2485853,0.00007704401,0.750604,0.00006285636,0.0001787163,0.0002529944,5.137398e-7,0.00006993626,0.0001686612],"genre_scores_gemma":[0.7735652,0.000003271865,0.2263436,0.00004994011,0.000027753,0.000004847342,4.548237e-7,0.000004493849,4.010501e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8040261,"threshold_uncertainty_score":0.7278038,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003500033,0.0001725416,0.0001628807,0.0005326942,0.0002553001,0.000253482,0.002277736,0.00005934644,0.00002929649],"category_scores_gemma":[0.0001063137,0.0001538189,0.00006751457,0.002665107,0.001131455,0.001010921,0.0004546809,0.0003400592,0.00006450879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002249202,"about_ca_system_score_gemma":0.0002211965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003668243,"about_ca_topic_score_gemma":0.00001050399,"domain_scores_codex":[0.9970297,0.00006017418,0.0003403318,0.0004988246,0.0009165806,0.001154431],"domain_scores_gemma":[0.9987174,0.0002168609,0.00009983741,0.0005909042,0.000162245,0.0002128013],"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.000006424801,0.0000505574,0.001891438,0.000002718195,0.000002766748,0.000006433137,0.0002554414,0.00008988758,0.0001925801,0.9569322,0.000007916765,0.0405616],"study_design_scores_gemma":[0.001350885,0.0006224188,0.02755769,0.00007958522,0.000005478037,0.00006114454,0.00003829669,0.3806995,0.03979812,0.5475581,0.001393411,0.0008353857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05437527,0.00004741081,0.941552,0.0006946741,0.0003542467,0.0001251744,2.073199e-7,0.0001504173,0.002700641],"genre_scores_gemma":[0.9651889,0.000004955601,0.03381364,0.0009367599,0.00004673727,0.000001871638,3.637577e-7,0.000004830538,0.000001932959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9108136,"threshold_uncertainty_score":0.6272553,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003032911,0.0002315619,0.0003494446,0.0007105001,0.0001385903,0.0001298282,0.005918766,0.00007851821,0.00004475909],"category_scores_gemma":[0.0005420587,0.0002018151,0.0001047627,0.003441275,0.002349641,0.0006318927,0.001792862,0.0007204626,0.00006518716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002556681,"about_ca_system_score_gemma":0.0003689155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003184672,"about_ca_topic_score_gemma":0.000003764298,"domain_scores_codex":[0.9957421,0.000232742,0.0003946993,0.001033309,0.001176536,0.001420643],"domain_scores_gemma":[0.9956101,0.00194369,0.0001016572,0.002003568,0.0001658177,0.0001751595],"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.00005244986,0.00009915306,0.000452522,0.00001148564,0.000004453402,0.000006484213,0.000140012,0.001893557,0.002658764,0.9824999,0.000002627005,0.01217858],"study_design_scores_gemma":[0.0005198424,0.00102103,0.0004433788,0.00005073629,9.307503e-7,0.00001057483,0.000002013219,0.1929677,0.02174878,0.7830309,0.00001910405,0.0001849791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3840642,0.00005417264,0.6124892,0.000468473,0.000292267,0.0003212785,7.927542e-7,0.00008326439,0.002226352],"genre_scores_gemma":[0.9696909,0.00001077341,0.02999235,0.0002531571,0.00001965098,0.00001377536,2.484999e-7,0.00001243469,0.000006703895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5856267,"threshold_uncertainty_score":0.9994597,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004704979,0.000288543,0.0003461314,0.001158147,0.00009822877,0.000504837,0.004064758,0.0001074452,0.000006358724],"category_scores_gemma":[0.0009860172,0.000275228,0.00003997064,0.003849523,0.0004462194,0.000797007,0.000863146,0.0008109646,0.00004788938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001481462,"about_ca_system_score_gemma":0.0007051065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001643828,"about_ca_topic_score_gemma":0.0001201664,"domain_scores_codex":[0.9949192,0.0003097311,0.000479067,0.001289117,0.0009800809,0.002022741],"domain_scores_gemma":[0.996837,0.001544904,0.00003734275,0.001148658,0.00007721846,0.0003549197],"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.00002438487,0.0001414832,0.005358549,0.00001884893,0.000002288686,0.0001780019,0.001038234,0.4000137,0.0005376404,0.5702867,9.352797e-7,0.02239928],"study_design_scores_gemma":[0.001017039,0.00128224,0.03280949,0.0002716545,0.000001088302,0.00008579638,0.000005182741,0.8108222,0.008733382,0.1443665,0.000007229662,0.0005981884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3477493,0.00006481574,0.6510916,0.0002674391,0.0003028029,0.0004014424,3.905089e-7,0.0001139886,0.000008229753],"genre_scores_gemma":[0.9255727,0.000006626624,0.0740567,0.0001401703,0.0001302188,0.00007359274,3.215465e-7,0.00001887123,7.927921e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5778234,"threshold_uncertainty_score":0.99997,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761563,0.0002150104,0.0002551608,0.000191115,0.0002495393,0.0002075508,0.002209023,0.00008010335,0.0000159644],"category_scores_gemma":[0.0003409406,0.0001697144,0.00009378756,0.0009971439,0.001130693,0.0004841782,0.0004963049,0.0002980823,0.00008185371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002667352,"about_ca_system_score_gemma":0.0002433499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008753361,"about_ca_topic_score_gemma":0.00001946743,"domain_scores_codex":[0.9971229,0.0001058863,0.0003137765,0.0009027251,0.0004005528,0.001154199],"domain_scores_gemma":[0.9981728,0.0007494349,0.00009459246,0.000678037,0.0001520977,0.0001530284],"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.000007907979,0.00008321496,0.00002631128,0.000004294854,0.000003401946,0.000003029744,0.001014804,0.0001416318,0.0003441184,0.841956,0.000007527159,0.1564077],"study_design_scores_gemma":[0.0005139665,0.0004804506,0.0001138229,0.000005933558,0.000002663738,0.00002595884,0.00001084333,0.644775,0.01381319,0.3381166,0.001868061,0.0002734942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003692123,0.0002488361,0.9929488,0.001352842,0.0002002055,0.000551525,0.000001193757,0.0001933531,0.0008110922],"genre_scores_gemma":[0.8523811,0.000006840105,0.1466273,0.0005830876,0.0002967893,0.00007913453,0.000001874272,0.000008894345,0.00001507231],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8486889,"threshold_uncertainty_score":0.6920754,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005813995,0.0002884528,0.0003194964,0.0003312411,0.0002629954,0.0005050746,0.004341819,0.00009043738,0.000003662741],"category_scores_gemma":[0.0004732421,0.0001916741,0.000102966,0.00377185,0.002025184,0.0003722058,0.0007422927,0.0006008252,0.00003859454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005758818,"about_ca_system_score_gemma":0.0005096588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000107956,"about_ca_topic_score_gemma":0.00005201776,"domain_scores_codex":[0.9953928,0.0004317676,0.0004844052,0.001193473,0.0009248768,0.001572666],"domain_scores_gemma":[0.9978898,0.0003894553,0.00006784027,0.001324835,0.000125855,0.0002022349],"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.000008370123,0.0002748935,0.0002415835,0.00001245249,0.000002258689,0.00001476309,0.003771765,0.00274695,0.00005105689,0.984231,0.000001318833,0.008643582],"study_design_scores_gemma":[0.000440894,0.0004716295,0.001152064,0.0000106122,0.000002638725,0.00006865112,0.00003154179,0.04777525,0.001066619,0.9485951,0.00008522498,0.0002997709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04523904,0.0001032511,0.9495513,0.001528875,0.000317686,0.0007670182,1.939015e-7,0.0001096748,0.002382892],"genre_scores_gemma":[0.9704652,0.000005001442,0.02828129,0.00104955,0.00008817431,0.00009986019,6.559923e-7,0.000009352811,9.174087e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9252262,"threshold_uncertainty_score":0.8068252,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145341,0.0001643234,0.0001586159,0.0003466132,0.0003182589,0.0005033051,0.002449638,0.00004331029,0.000009836806],"category_scores_gemma":[0.00005053413,0.0001269375,0.00004236569,0.002593357,0.001135514,0.001277451,0.0002202785,0.0003741094,0.00002302788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001103948,"about_ca_system_score_gemma":0.0002262204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002738984,"about_ca_topic_score_gemma":0.000003281006,"domain_scores_codex":[0.9977854,0.00008769403,0.0002910221,0.0004212961,0.00057466,0.0008398669],"domain_scores_gemma":[0.998579,0.0001719852,0.00008480799,0.0009050996,0.0001275838,0.0001315018],"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.000007396034,0.00005842279,0.00008150424,0.00000145852,0.000001163768,0.00000166208,0.0003862428,0.0001500146,0.00003829491,0.8400058,0.000002261925,0.1592658],"study_design_scores_gemma":[0.0003110619,0.0007139487,0.001738501,0.00003673891,0.000001514733,0.00003563604,0.000007026212,0.5241949,0.00147259,0.471007,0.00026092,0.0002202227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03634795,0.00009981206,0.959219,0.002723141,0.0000523857,0.0001977934,7.889832e-8,0.000212668,0.001147109],"genre_scores_gemma":[0.8609008,0.00001502774,0.1381708,0.0008857418,0.00001491597,0.000008224671,8.091243e-7,0.000003254615,4.397151e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8245528,"threshold_uncertainty_score":0.5176361,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002651492,0.0002725302,0.0003599252,0.0004138437,0.000217457,0.0003919011,0.003156719,0.0001050009,0.00001209122],"category_scores_gemma":[0.0003967725,0.0002320514,0.0000763247,0.001562044,0.001392904,0.0006416146,0.001095641,0.0005461494,0.00009501349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003027493,"about_ca_system_score_gemma":0.000404381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009972418,"about_ca_topic_score_gemma":0.00003756087,"domain_scores_codex":[0.9964409,0.000135497,0.0004531566,0.0008718399,0.0005148019,0.001583839],"domain_scores_gemma":[0.9980784,0.0006844359,0.00008803342,0.0008680546,0.00007611621,0.0002049428],"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.00000910292,0.00009033667,0.001132958,0.00001025763,0.000001382886,0.00001300453,0.0006408052,0.0002145309,0.0001770091,0.9583812,0.00001162778,0.03931782],"study_design_scores_gemma":[0.0005044303,0.0004192031,0.002645356,0.00004075643,0.000001945523,0.00004722058,0.000001853096,0.8080128,0.002035082,0.1858338,0.0001635545,0.000294019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1118803,0.00004605194,0.8827907,0.0004704249,0.000621911,0.0001853271,2.133254e-7,0.00009235802,0.003912647],"genre_scores_gemma":[0.9792898,0.00001048854,0.02006826,0.0004181753,0.0001844031,0.00001149286,5.055898e-7,0.00001086806,0.000006052527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8674094,"threshold_uncertainty_score":0.9462783,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001883871,0.000178508,0.0002956136,0.0003771037,0.0002497465,0.0003349466,0.001823628,0.00006232676,0.00001407248],"category_scores_gemma":[0.00008237935,0.000157276,0.0001535747,0.003094743,0.0005666367,0.0009691711,0.0001329388,0.0002156647,0.00001886435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002370963,"about_ca_system_score_gemma":0.0002126321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005527869,"about_ca_topic_score_gemma":0.00002059342,"domain_scores_codex":[0.9973819,0.00006892606,0.000449669,0.0006641389,0.0004775708,0.0009577975],"domain_scores_gemma":[0.998738,0.0003287169,0.00008472447,0.0005595964,0.0001531917,0.0001357509],"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.000004634673,0.00004503565,0.00007484052,0.000004829023,0.00001150619,2.169866e-7,0.0004707951,0.008616195,0.00008330181,0.7941304,0.000005413699,0.1965528],"study_design_scores_gemma":[0.0003905,0.0001459502,0.0002714985,0.00001232848,0.00001525818,0.000006568754,0.000002719711,0.9566229,0.002298401,0.03759012,0.002431508,0.0002122298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01496387,0.0001649846,0.9821184,0.00179025,0.0001706496,0.0003058315,0.000004049924,0.0001166203,0.0003654035],"genre_scores_gemma":[0.9578435,0.000007136756,0.04170059,0.0002924593,0.0001060761,0.00003627606,0.000004632334,0.00000493991,0.00000435432],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9480067,"threshold_uncertainty_score":0.6413531,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00367117,0.000194621,0.0002448383,0.0002862368,0.0002115051,0.0003050987,0.001039137,0.00006510384,7.787118e-7],"category_scores_gemma":[0.00219368,0.0001768537,0.00004044439,0.0008853658,0.001050184,0.001374708,0.0005577118,0.0002556492,0.000001223748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002339577,"about_ca_system_score_gemma":0.0001539897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001660213,"about_ca_topic_score_gemma":0.00002292731,"domain_scores_codex":[0.9975958,0.0000841384,0.0003020509,0.0006974599,0.0003411042,0.0009794495],"domain_scores_gemma":[0.9914078,0.007772221,0.0000606225,0.0005257071,0.0001128502,0.0001208491],"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.00001602286,0.00001958109,0.00006734658,0.000009695737,0.000002134842,0.000009642768,0.000218702,0.01084977,0.0002944641,0.8118111,3.859949e-7,0.1767012],"study_design_scores_gemma":[0.000163177,0.0002287804,0.000496539,0.00001806878,0.000002139916,0.0000623573,0.000001534426,0.4909501,0.003165918,0.5047429,0.00001566853,0.0001528859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08096525,0.0001104769,0.9178942,0.0002505623,0.0002651841,0.0002851482,6.258978e-7,0.0002178474,0.00001068225],"genre_scores_gemma":[0.5378122,0.00001081438,0.4620366,0.00009846348,0.00002692228,0.000007833132,4.9613e-7,0.000006228724,5.259906e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4801003,"threshold_uncertainty_score":0.7211883,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001902563,0.0001488281,0.000199498,0.0001620644,0.0001475355,0.00005862095,0.0003778971,0.00002197209,0.0001469479],"category_scores_gemma":[0.0006826838,0.00006630224,0.0000930497,0.0007696675,0.001781068,0.00006289381,0.0000948506,0.0002445387,0.00005391978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002749134,"about_ca_system_score_gemma":0.0003464137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002751055,"about_ca_topic_score_gemma":5.194917e-7,"domain_scores_codex":[0.997821,0.0001174824,0.0002017151,0.0005261079,0.0006431438,0.0006905649],"domain_scores_gemma":[0.998387,0.0008595392,0.00003812408,0.0005004773,0.00009032227,0.0001245493],"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.000657799,0.001303789,0.02340498,0.00003034233,0.00004330755,0.00006981631,0.0001629149,0.001952781,0.02443979,0.7370975,0.0001248357,0.2107122],"study_design_scores_gemma":[0.0009634026,0.002095806,0.006494266,0.0002802848,0.00003378202,0.00002256333,0.000002905933,0.8980589,0.06880158,0.02280066,0.0002169029,0.0002289376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7024808,0.00004324066,0.2522918,0.04437986,0.00009375187,0.0002807619,4.620935e-7,0.00006247599,0.0003668912],"genre_scores_gemma":[0.9966905,0.000004411653,0.001105456,0.00201299,0.0001498758,0.000009149834,3.350697e-7,0.000009566249,0.00001774746],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8961061,"threshold_uncertainty_score":0.6562419,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138511,0.0002733557,0.0002769747,0.0002670284,0.0004715122,0.0002340628,0.002405849,0.00008591459,0.000009140339],"category_scores_gemma":[0.00003959874,0.0002305169,0.00006980752,0.001759294,0.0002712767,0.0003019864,0.0005629201,0.000281206,0.00003342149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006581476,"about_ca_system_score_gemma":0.0004599607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003393509,"about_ca_topic_score_gemma":0.0001909404,"domain_scores_codex":[0.99642,0.0001292835,0.0004263097,0.00105563,0.0007521278,0.001216703],"domain_scores_gemma":[0.9982404,0.0002835679,0.0001137217,0.000836331,0.0002972124,0.0002287952],"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.00003667688,0.0000561058,0.0002455035,0.00005178999,0.000004428287,0.000004608512,0.0007970867,0.0003188605,0.0003967163,0.91215,0.00000328577,0.08593497],"study_design_scores_gemma":[0.0009496904,0.001607213,0.002211906,0.0002359185,0.000007714802,0.0001635717,0.000007922799,0.7134408,0.01204163,0.2680427,0.0007027541,0.0005881742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02834685,0.0001336619,0.9626128,0.00724589,0.0003050761,0.0009906534,0.00000438731,0.0002646528,0.00009602165],"genre_scores_gemma":[0.893065,0.000004133702,0.1033632,0.003359667,0.0001610637,0.00002181518,0.000007871993,0.00001404176,0.000003164327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8647181,"threshold_uncertainty_score":0.9400207,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200847,0.0001660625,0.0002266554,0.0002006983,0.0002071706,0.0001647816,0.003182367,0.00004999711,0.0000216252],"category_scores_gemma":[0.0003202697,0.0001189054,0.00007712302,0.002340547,0.001397282,0.0005951398,0.0007741151,0.0004318655,0.00002142144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000292652,"about_ca_system_score_gemma":0.0001558891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001045851,"about_ca_topic_score_gemma":0.000008111212,"domain_scores_codex":[0.9970316,0.0002139406,0.0004119642,0.0006174718,0.0008561676,0.0008689126],"domain_scores_gemma":[0.9979165,0.0006068508,0.0001588241,0.001087427,0.0001411315,0.00008927167],"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.000003079355,0.0000571728,0.0002436603,0.000005538596,0.000002872928,0.000002471864,0.0004372892,0.005716529,0.001798204,0.9534116,0.000008532162,0.03831302],"study_design_scores_gemma":[0.0002117613,0.00009518286,0.0004336599,0.00004665629,0.000001713047,0.00003804582,0.000001410446,0.851771,0.02031386,0.1268781,0.00007197451,0.0001366442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08921863,0.0002204582,0.9070703,0.001678916,0.000633454,0.0001964306,4.56747e-7,0.00006612015,0.0009152824],"genre_scores_gemma":[0.9808239,0.00002440834,0.01888636,0.000193375,0.00004756943,0.000005959656,4.047077e-8,0.000006975366,0.00001144446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8916053,"threshold_uncertainty_score":0.5913683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006907769,0.00009479959,0.0001085793,0.00007068941,0.0003041303,0.00002980408,0.0004426546,0.00001943867,0.00003969552],"category_scores_gemma":[0.00001738142,0.00008642781,0.00004641266,0.0004169087,0.0004234611,0.00008447411,0.00009131188,0.0001485631,0.000007545533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006929274,"about_ca_system_score_gemma":0.0001969627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005355715,"about_ca_topic_score_gemma":4.451203e-7,"domain_scores_codex":[0.9987952,0.00001823677,0.0001521581,0.000324655,0.0001975193,0.0005122951],"domain_scores_gemma":[0.9994987,0.0001070161,0.00003309457,0.0002329426,0.00006713346,0.00006111902],"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.000004012462,0.00005762247,0.0003351533,0.00000143523,0.000002234987,1.414219e-7,0.00004279631,0.00002420158,0.009042729,0.9860979,0.000003968623,0.004387777],"study_design_scores_gemma":[0.0001923883,0.00009241707,0.00008876585,0.00001093585,0.00000220633,0.000002801002,0.000001454353,0.04352435,0.09744968,0.8584175,0.0001018235,0.0001157041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04776959,0.00001354882,0.9512336,0.0001447518,0.00005182642,0.0003807371,0.000001880437,0.00001932377,0.0003847644],"genre_scores_gemma":[0.9779444,0.000001101908,0.02169267,0.00005628531,0.0000916301,0.0002032144,0.000001845399,0.000007767871,0.000001071673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9301748,"threshold_uncertainty_score":0.3524424,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425148,0.0001272748,0.0001952333,0.0001013473,0.0001157229,0.00005551992,0.0003173514,0.00002840485,0.0003010853],"category_scores_gemma":[0.00006788532,0.0001016267,0.00003834881,0.0005508193,0.0009482172,0.000118512,0.0001075002,0.0002188614,0.000024457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009940736,"about_ca_system_score_gemma":0.0001453339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008885198,"about_ca_topic_score_gemma":3.049108e-7,"domain_scores_codex":[0.9984744,0.00006309797,0.0002240549,0.0003583341,0.0003575169,0.0005225536],"domain_scores_gemma":[0.9992403,0.0002543524,0.00007547466,0.000212604,0.0001275547,0.00008970928],"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.0000803593,0.00007158107,0.0004800322,0.000001577977,0.000005999268,7.107101e-7,0.0001539781,0.000006315522,0.004710212,0.9775321,0.000001706824,0.01695535],"study_design_scores_gemma":[0.0003123666,0.001246521,0.0009758462,0.0000206372,0.000005824243,5.719169e-7,0.000003916586,0.1483364,0.04965212,0.799253,0.00007016702,0.0001226252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2782933,0.000002398965,0.7206388,0.0002429783,0.0001420019,0.00009374344,0.000008152047,0.00000974485,0.0005688558],"genre_scores_gemma":[0.9960248,0.000001647885,0.003672922,0.00005886501,0.000220858,0.000005749994,0.000004826822,0.000007979957,0.000002380473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7177315,"threshold_uncertainty_score":0.4144217,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003805073,0.0001644926,0.0001857232,0.0003560979,0.0002265942,0.000142225,0.001848679,0.00006493833,0.00001951436],"category_scores_gemma":[0.0002820556,0.0001596062,0.00004093794,0.001995528,0.001095008,0.0007215817,0.0006547209,0.0004280632,0.00000826317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007016531,"about_ca_system_score_gemma":0.0004800561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001241375,"about_ca_topic_score_gemma":0.00003625635,"domain_scores_codex":[0.997122,0.000189552,0.0004605562,0.000878577,0.0004470848,0.0009021895],"domain_scores_gemma":[0.9987134,0.0002345543,0.00009354112,0.0007681078,0.00009384233,0.00009655248],"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.000007100958,0.0001602096,0.00236022,0.000007202504,9.286415e-7,0.00000557253,0.00130454,0.00066606,0.0004989157,0.971674,1.191613e-7,0.02331518],"study_design_scores_gemma":[0.0001889778,0.0001090006,0.006340201,0.00004557465,0.000001022287,0.00001815505,0.000004530921,0.7513274,0.007944617,0.2338304,0.00001172014,0.00017839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3548262,0.00004359534,0.6441636,0.0001153507,0.0002208642,0.000155078,8.821699e-8,0.00006706152,0.000408139],"genre_scores_gemma":[0.8408208,0.000003585978,0.159012,0.0001125199,0.0000386978,0.00000772343,2.315159e-7,0.000004097786,2.83447e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7506614,"threshold_uncertainty_score":0.6508552,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004312996,0.00017717,0.0002175389,0.0004072106,0.0001799677,0.0002399141,0.001939865,0.0000877062,0.00001773892],"category_scores_gemma":[0.0001291629,0.0001508649,0.00005004672,0.002683324,0.0009191734,0.000646584,0.0002527995,0.0004452349,0.00008276795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002955734,"about_ca_system_score_gemma":0.0003375126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002570115,"about_ca_topic_score_gemma":0.0002196196,"domain_scores_codex":[0.9970254,0.00009367223,0.0004669072,0.0005946603,0.0005282103,0.001291105],"domain_scores_gemma":[0.9986997,0.0004287518,0.00005853341,0.0005604039,0.00009783729,0.0001547363],"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.000007913174,0.00007609497,0.0006160081,0.000005684312,0.000001391175,0.00001531331,0.0008185541,0.0002305412,0.0001388281,0.9471978,0.000002943513,0.05088895],"study_design_scores_gemma":[0.0004896949,0.0004120822,0.002536721,0.00001211588,0.00000179043,0.00005677883,0.0000095878,0.2562254,0.00461979,0.7340628,0.001254012,0.000319213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01639456,0.0001751866,0.9770598,0.0005612911,0.0005087828,0.0002608223,1.555412e-7,0.0001071101,0.004932313],"genre_scores_gemma":[0.9813883,0.00001352424,0.0182262,0.0002797789,0.00007113686,0.000005911968,7.908859e-7,0.00000672056,0.000007673191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9649937,"threshold_uncertainty_score":0.6152091,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.04339505,0.0002068221,0.0002090372,0.0001267733,0.0005722626,0.001207477,0.00936482,0.00004860934,0.00001686241],"category_scores_gemma":[0.001275791,0.0001288471,0.00001665054,0.00320495,0.002126319,0.0008287182,0.002819207,0.0009350677,0.000006827631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006376563,"about_ca_system_score_gemma":0.004063507,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01800759,"about_ca_topic_score_gemma":0.2297612,"domain_scores_codex":[0.9916844,0.001008475,0.0003867673,0.001384055,0.003603284,0.001933053],"domain_scores_gemma":[0.9956445,0.001244611,0.00003847098,0.002664232,0.0001979129,0.0002103258],"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.00001277104,0.00007471201,0.0004685242,0.000005849515,0.000004408512,0.00001880893,0.0005091346,0.0002414307,0.0000234453,0.9711888,0.003059307,0.02439281],"study_design_scores_gemma":[0.000308086,0.0002181074,0.001711841,0.0000150513,0.000003273467,0.00001774382,0.00005723644,0.7542279,0.0007365545,0.2347674,0.007672728,0.0002640136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04820685,0.0001383945,0.9047367,0.04494214,0.0001471718,0.001015279,0.00001835212,0.00003096833,0.0007641288],"genre_scores_gemma":[0.9908534,0.00001328003,0.008344624,0.0006716969,0.00004149073,0.00004948181,0.000006606849,0.000007288289,0.00001213938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9426466,"threshold_uncertainty_score":0.9998294,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003127552,0.000300854,0.0003003184,0.0003300923,0.0004769341,0.0005173071,0.003921557,0.0001371899,0.00004823157],"category_scores_gemma":[0.0003386091,0.0002384338,0.00007482481,0.002306615,0.003534948,0.000934849,0.001063573,0.001057089,0.00007899215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001294484,"about_ca_system_score_gemma":0.0007571505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008754629,"about_ca_topic_score_gemma":0.0001357232,"domain_scores_codex":[0.996257,0.0001885557,0.0003994221,0.0009539024,0.0007085113,0.001492597],"domain_scores_gemma":[0.9975144,0.0006510416,0.00008559955,0.00128866,0.0002049316,0.0002554253],"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.000006312166,0.00007059054,0.0006645265,0.00000658308,0.000004591464,0.00002652514,0.0005852762,0.00003075568,0.000460805,0.9560401,0.000007080991,0.04209684],"study_design_scores_gemma":[0.0002259145,0.0003053842,0.0005291367,0.000003465498,0.000003044152,0.0001144418,0.00001096245,0.05357325,0.004094997,0.9396508,0.001154205,0.000334421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03531486,0.0002015271,0.9573633,0.00106782,0.001881363,0.0002624315,3.938817e-7,0.0003079247,0.003600352],"genre_scores_gemma":[0.980665,0.00001127971,0.01855971,0.000432863,0.0002812689,0.00001933,0.000002351782,0.00001396255,0.00001429734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9453501,"threshold_uncertainty_score":0.9991769,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158054,0.0001450244,0.0001803368,0.0005249631,0.0001309111,0.0001008785,0.001320485,0.00007043023,0.000005960424],"category_scores_gemma":[0.00003619253,0.0001325192,0.00004191409,0.002903431,0.0003890716,0.0009751503,0.0001919883,0.0003388346,0.000003993724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002413147,"about_ca_system_score_gemma":0.0003433594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002859392,"about_ca_topic_score_gemma":0.00006371481,"domain_scores_codex":[0.9977441,0.00007400059,0.0004672288,0.0004968687,0.0004835322,0.0007343126],"domain_scores_gemma":[0.9989032,0.0002838223,0.0001197017,0.0004990975,0.0001119334,0.00008231789],"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.00001331678,0.00007489399,0.0002977699,0.000003944408,8.999665e-7,0.000002380299,0.001280782,0.01577218,0.004935341,0.9256948,8.498029e-8,0.05192363],"study_design_scores_gemma":[0.0002304454,0.000224887,0.007557347,0.00003756068,0.000001857797,0.00001610366,0.000009081882,0.8256816,0.01603072,0.1500707,0.000009328814,0.0001304054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.285775,0.00004771024,0.7130314,0.0004411494,0.0001121608,0.0001403512,2.106127e-7,0.00003144932,0.0004205485],"genre_scores_gemma":[0.9009458,0.000004755604,0.09865353,0.0003387145,0.00005046199,0.00000170819,0.000001443667,0.00000330951,2.330375e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8099094,"threshold_uncertainty_score":0.5403978,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054465,0.0002023798,0.0002241693,0.0002252673,0.000249941,0.000441613,0.00295891,0.00007289532,0.00003414464],"category_scores_gemma":[0.0001506322,0.0001631969,0.00006383815,0.002011787,0.001195615,0.0006555118,0.0007486355,0.0003674229,0.0001441319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002300591,"about_ca_system_score_gemma":0.0003037176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001756273,"about_ca_topic_score_gemma":0.00001416875,"domain_scores_codex":[0.9967048,0.0001299017,0.0003094686,0.0008738568,0.0006368858,0.001345081],"domain_scores_gemma":[0.9984801,0.0002800993,0.00006665935,0.0008888377,0.00009787462,0.0001864019],"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.000004215893,0.00005987147,0.0007940508,0.00000287792,0.000002109396,0.00002292633,0.0002376377,0.0001227268,0.0001335267,0.913628,0.000005625134,0.08498637],"study_design_scores_gemma":[0.0002705106,0.0003400098,0.00075346,0.000005409663,0.000001586635,0.0001432872,0.000002324512,0.2363206,0.002057898,0.757542,0.002295056,0.0002678635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01425088,0.0002429004,0.97894,0.0008939683,0.0005357931,0.0002217591,5.321555e-8,0.0002337803,0.004680856],"genre_scores_gemma":[0.9832092,0.00002419914,0.01623085,0.0003481196,0.0001400848,0.00001485181,3.172979e-7,0.000008065931,0.00002430246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9689583,"threshold_uncertainty_score":0.6654978,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206287,0.0001825701,0.0002737829,0.0001323686,0.0001719639,0.0001302782,0.003366871,0.00007726726,0.00001782996],"category_scores_gemma":[0.0001787283,0.00008882733,0.0001187923,0.001394105,0.001874281,0.0004223701,0.001162664,0.0002327699,0.00001520009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001979695,"about_ca_system_score_gemma":0.0002796788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001220505,"about_ca_topic_score_gemma":0.000003879684,"domain_scores_codex":[0.9970514,0.0002314797,0.00040052,0.0006740015,0.0007375898,0.0009050703],"domain_scores_gemma":[0.9981952,0.0004074825,0.0001196716,0.001024044,0.0001351093,0.0001185297],"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.000005546233,0.00005745275,0.0001654519,0.000005322303,0.000003492449,0.000002198701,0.0001311113,0.00003901369,0.001422274,0.95002,0.000003906515,0.04814427],"study_design_scores_gemma":[0.0002915868,0.0001607576,0.0003861952,0.00001268947,0.000003141608,0.00002428924,6.098497e-7,0.2179139,0.009665294,0.7713472,0.00004874025,0.0001455345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0129196,0.0001079039,0.9846234,0.001014969,0.0004684535,0.0002286315,2.594287e-7,0.00006957395,0.0005672508],"genre_scores_gemma":[0.9976526,0.00001159558,0.002118461,0.00009782907,0.00009233683,0.000009501344,1.194468e-7,0.000006776383,0.00001071186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.984733,"threshold_uncertainty_score":0.6905866,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114323,0.0001360192,0.0001709116,0.0001176729,0.0002043958,0.00007771511,0.000264139,0.00006746742,0.00007832817],"category_scores_gemma":[0.000745018,0.0001136176,0.00002514511,0.0005972859,0.001274965,0.0001816536,0.00009677532,0.0003120502,0.000003638489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001288108,"about_ca_system_score_gemma":0.0001783056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002752352,"about_ca_topic_score_gemma":0.000002409744,"domain_scores_codex":[0.9983854,0.0001008956,0.0002211833,0.0004291364,0.0003186607,0.000544708],"domain_scores_gemma":[0.9991794,0.0003054321,0.00004691713,0.0002898427,0.00007984948,0.00009861956],"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.000004830242,0.00002727815,0.0001454869,0.000004104411,0.000002674393,9.418678e-7,0.0001717671,0.000008693305,0.0000987013,0.996178,0.000005692525,0.003351796],"study_design_scores_gemma":[0.0002635985,0.0001232191,0.0002434313,0.00001280418,0.000004392411,0.00007408019,0.000008641317,0.001380343,0.004724035,0.9929676,0.00005671426,0.0001411448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8397648,0.00009039669,0.1584406,0.0002533653,0.0006593062,0.00014695,1.275123e-7,0.00004583833,0.0005986477],"genre_scores_gemma":[0.9900011,0.00001058736,0.009788608,0.00008613887,0.00009373755,0.000006187032,1.107607e-7,0.000009685314,0.000003853939],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1502363,"threshold_uncertainty_score":0.4697662,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002162805,0.0001922316,0.000197486,0.0002011172,0.000243435,0.0003425511,0.002408977,0.00006067178,0.00004493681],"category_scores_gemma":[0.0002423194,0.0001550435,0.00005543352,0.001882166,0.001224472,0.0005649746,0.0004372463,0.0003847056,0.00008126292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001999715,"about_ca_system_score_gemma":0.0004011386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002920234,"about_ca_topic_score_gemma":0.000002787323,"domain_scores_codex":[0.996863,0.0001734513,0.0002673665,0.0008617981,0.0005569327,0.001277466],"domain_scores_gemma":[0.9984778,0.0003391529,0.0000476984,0.0008969954,0.00006544243,0.0001729735],"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.000001822235,0.00005695674,0.0001798732,0.000001826176,0.000001339063,0.000008924198,0.0001340359,0.0003465675,0.00009104416,0.955397,0.000005816024,0.04377486],"study_design_scores_gemma":[0.0002420271,0.0002495003,0.0004244033,0.00001035926,0.000001115075,0.00005467665,0.000001359247,0.2985052,0.004084838,0.695521,0.0006636539,0.0002418925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0160077,0.0002021587,0.9727252,0.0006242816,0.0003873864,0.0001578966,1.698127e-7,0.000131638,0.009763578],"genre_scores_gemma":[0.8069921,0.00001531467,0.1924414,0.0005041289,0.00003110009,0.000007479629,1.329206e-7,0.000005652735,0.000002683333],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7909845,"threshold_uncertainty_score":0.6322491,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002899177,0.0001740628,0.0002006949,0.0003006209,0.0001736757,0.0002905371,0.002283295,0.0000727531,0.00001913916],"category_scores_gemma":[0.0007648656,0.0001552223,0.0000469525,0.002182302,0.0005894932,0.001124423,0.0003925253,0.0002361488,0.00005809344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002533252,"about_ca_system_score_gemma":0.0005297023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002874062,"about_ca_topic_score_gemma":0.000002688702,"domain_scores_codex":[0.9972993,0.0001004977,0.000333518,0.0008426598,0.0005243156,0.0008997244],"domain_scores_gemma":[0.9978182,0.0009391311,0.00009872692,0.0007873575,0.0002677065,0.0000888477],"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.00001531016,0.00004252493,0.0003091728,0.00002888466,0.000001559083,2.745689e-7,0.0002020212,0.003405367,0.0006579298,0.9370294,0.000001258927,0.05830631],"study_design_scores_gemma":[0.0002537065,0.0003123512,0.0004908325,0.00002344226,0.000001134001,0.000005356267,9.942289e-7,0.6676727,0.01886117,0.3119974,0.0002209862,0.0001599177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07452711,0.0000675566,0.9233158,0.0004578697,0.000492984,0.0006018376,5.038995e-7,0.000129559,0.0004067945],"genre_scores_gemma":[0.6171151,0.000005321415,0.38264,0.0001576343,0.00004576613,0.00002504972,8.124537e-7,0.00000662525,0.000003667328],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6642674,"threshold_uncertainty_score":0.6329781,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003863451,0.0002093816,0.0002704363,0.0001585506,0.0002521763,0.0001758432,0.003764228,0.00006157497,0.00003898225],"category_scores_gemma":[0.0009445782,0.000147481,0.00007622787,0.002441991,0.002911448,0.0006002727,0.0006363731,0.0005063338,0.00001275022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001991155,"about_ca_system_score_gemma":0.0008454261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003673547,"about_ca_topic_score_gemma":0.000004308436,"domain_scores_codex":[0.9965652,0.000421425,0.0004925517,0.0007464055,0.0008402345,0.0009341463],"domain_scores_gemma":[0.9974476,0.0006054572,0.0001788285,0.001394747,0.0002568224,0.0001165283],"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.000006919336,0.0001372315,0.0001711363,0.00001247852,0.000002018232,0.000001514708,0.0008891217,0.0001700493,0.0002420071,0.9808145,7.715984e-7,0.01755224],"study_design_scores_gemma":[0.0002746178,0.0001999104,0.0002242591,0.00003623169,0.000001293659,0.00002488768,0.000005196334,0.1205833,0.06957828,0.808751,0.0001633425,0.0001575942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005262346,0.00002994007,0.9822404,0.0005602965,0.0001618975,0.01056464,6.160293e-7,0.00007837453,0.001101488],"genre_scores_gemma":[0.9572408,0.00000180097,0.03852089,0.0001975823,0.00002123393,0.004008575,1.588799e-7,0.000007801655,0.000001180653],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9519784,"threshold_uncertainty_score":0.9998021,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000635891,0.00009662787,0.00009271706,0.00004624658,0.0002143899,0.00008892368,0.000222506,0.00002249917,0.000003619275],"category_scores_gemma":[0.0004629868,0.0000444888,0.000007301383,0.0001687433,0.001974796,0.0001894517,0.0001326696,0.0001266435,7.746082e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008677574,"about_ca_system_score_gemma":0.00003614448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.917599e-7,"about_ca_topic_score_gemma":0.00006048056,"domain_scores_codex":[0.9989716,0.00005768825,0.0001341746,0.0002799465,0.0002214905,0.0003350753],"domain_scores_gemma":[0.9979792,0.001662385,0.00004383463,0.0002245596,0.00004596434,0.00004410295],"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.00001666906,0.00001347891,0.0002915218,0.000002291054,0.000001578964,4.133273e-7,0.00008540754,6.057107e-7,0.0006563669,0.8922157,4.178728e-7,0.1067156],"study_design_scores_gemma":[0.0002283678,0.0002551602,0.001985687,0.00004205264,0.000002995783,0.00001113047,0.000004891057,0.01339317,0.006495254,0.9774944,0.000005952327,0.00008099574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4193891,0.00005451835,0.5794781,0.0009126255,0.00002628549,0.00008263712,1.863431e-7,0.00001659481,0.0000399097],"genre_scores_gemma":[0.9717475,0.0000608847,0.02810964,0.00002959653,0.00003169456,0.000009229293,9.782668e-8,0.00000639081,0.000004942749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5523584,"threshold_uncertainty_score":0.7276219,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003885473,0.0002735952,0.0003101187,0.0003874178,0.0003194277,0.0006095783,0.003315078,0.00006396952,0.00002938049],"category_scores_gemma":[0.0002559831,0.0002369861,0.00007660826,0.00292856,0.001025858,0.0007500454,0.001072424,0.0004211898,0.0001305578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003911781,"about_ca_system_score_gemma":0.0003776803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001029683,"about_ca_topic_score_gemma":0.000001535799,"domain_scores_codex":[0.995614,0.0002848913,0.0003942568,0.001207494,0.000848632,0.001650749],"domain_scores_gemma":[0.9980308,0.0004516321,0.00005986217,0.001000674,0.0001637907,0.0002931761],"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.00003294939,0.0002072561,0.00001994897,0.000004845394,0.000003136573,0.00003010758,0.0004872475,0.0005333663,0.01411922,0.8743533,0.00002387969,0.1101847],"study_design_scores_gemma":[0.0006228541,0.0006942378,0.0002477862,0.0000309749,0.000003966918,0.0001102799,0.000003550147,0.6984652,0.06160153,0.2372373,0.0005121006,0.0004702258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03284857,0.0000836037,0.9598229,0.00118852,0.0003109666,0.0003616237,2.500858e-7,0.0001274387,0.005256107],"genre_scores_gemma":[0.5741237,0.00001107269,0.4246214,0.001123916,0.00006871642,0.0000253281,3.734528e-7,0.000007677383,0.00001777681],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6979319,"threshold_uncertainty_score":0.9664011,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485706,0.0001865517,0.0003194675,0.0002584057,0.00007709239,0.000147782,0.002897041,0.00007761669,0.00002888549],"category_scores_gemma":[0.001413335,0.0001689663,0.00004458573,0.003231212,0.001613682,0.0009913823,0.000551757,0.000369097,0.00001499264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001877375,"about_ca_system_score_gemma":0.0007598436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001312405,"about_ca_topic_score_gemma":0.000004314755,"domain_scores_codex":[0.9969184,0.0002554957,0.0005833002,0.0007866473,0.0007056066,0.0007505327],"domain_scores_gemma":[0.9986038,0.0003579898,0.0001861991,0.0004988713,0.0002195168,0.0001336297],"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.0000313212,0.0001017971,0.003170028,0.00004247414,0.000001739982,0.000003504342,0.001214016,0.0001215641,0.006128417,0.8988722,0.000001509548,0.09031143],"study_design_scores_gemma":[0.0003398461,0.0006851372,0.02004778,0.00007843781,0.000003457964,0.00001155119,0.00001322602,0.8549924,0.05527025,0.06828202,0.00001043294,0.0002653932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2105187,0.000109469,0.7869301,0.001591147,0.00009656849,0.0002553877,0.000001030528,0.0000770499,0.0004205097],"genre_scores_gemma":[0.7485078,0.0000153078,0.2512743,0.0001513841,0.0000268498,0.00001727277,7.317824e-7,0.000005679919,6.554267e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8548709,"threshold_uncertainty_score":0.6890244,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004907502,0.0002151482,0.0002656655,0.0001716423,0.0007575089,0.0002353498,0.002553325,0.00007933054,0.000004847264],"category_scores_gemma":[0.0005800688,0.0001432027,0.0001232727,0.001318638,0.001720523,0.0004838514,0.0007702786,0.0003612882,0.00001311946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002054969,"about_ca_system_score_gemma":0.0006375303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003482651,"about_ca_topic_score_gemma":0.00001903692,"domain_scores_codex":[0.9966557,0.0002316264,0.0004350185,0.0009284136,0.0005897213,0.001159542],"domain_scores_gemma":[0.9972079,0.001259261,0.0001461576,0.00108189,0.0001725615,0.0001322436],"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.0000146406,0.0000529947,0.0001647207,0.000007155005,0.000005191434,0.00008503354,0.000948802,0.0002545296,0.0001343821,0.954845,0.00004466685,0.04344288],"study_design_scores_gemma":[0.000249118,0.0005007833,0.0002780466,0.000005977454,0.000004467804,0.001452447,0.00000507764,0.5109042,0.002705216,0.4824258,0.001265047,0.0002038331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00456926,0.0001696612,0.9916077,0.001736401,0.0006153881,0.0005823065,1.39498e-7,0.0001448577,0.0005742573],"genre_scores_gemma":[0.7773533,0.000006255612,0.2219683,0.0004050728,0.0001852254,0.00005324816,5.518369e-7,0.000008964958,0.00001906387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7727841,"threshold_uncertainty_score":0.633934,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001726236,0.0001651874,0.0001927037,0.000135524,0.0001887674,0.0003268523,0.000806438,0.00004630992,0.000004157394],"category_scores_gemma":[0.0001067609,0.0001159755,0.0000225366,0.0007682781,0.001605554,0.0002922564,0.000229854,0.0001583775,0.000004680223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000742903,"about_ca_system_score_gemma":0.0002472484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002419009,"about_ca_topic_score_gemma":0.00003895293,"domain_scores_codex":[0.9980286,0.0001116264,0.0001867623,0.0005970111,0.0002828636,0.0007930832],"domain_scores_gemma":[0.9985696,0.0007949689,0.00005973552,0.0003825481,0.0001106038,0.00008252604],"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.00002864634,0.00002763312,0.0003649691,0.00001195223,0.000003202476,0.000009016399,0.0004720105,0.00006864909,0.0003131397,0.9759663,0.000002576578,0.02273189],"study_design_scores_gemma":[0.0004744167,0.0007346127,0.0003724531,0.000009109543,0.000003895178,0.00008548458,0.0000226934,0.0569424,0.00645008,0.9345927,0.00009145073,0.0002206675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07996351,0.0005049993,0.918258,0.0001258277,0.0001705258,0.0003030531,3.743779e-7,0.0001042209,0.0005695409],"genre_scores_gemma":[0.9682019,0.000005522585,0.03152833,0.0001498112,0.00007962776,0.00001367455,0.000001587821,0.000008183951,0.0000113337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8882384,"threshold_uncertainty_score":0.591573,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072575,0.000285513,0.0002656308,0.000654758,0.0003447554,0.0003654125,0.00353519,0.0001147922,0.00002224017],"category_scores_gemma":[0.0007805261,0.0002405425,0.00009876468,0.002854435,0.001010743,0.0009701898,0.0002872866,0.0006186341,0.00006235638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004159075,"about_ca_system_score_gemma":0.0003009686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002274553,"about_ca_topic_score_gemma":0.000001671065,"domain_scores_codex":[0.9958994,0.0001515074,0.0004607748,0.00110053,0.001125781,0.001261972],"domain_scores_gemma":[0.9970849,0.001012368,0.0001085129,0.001450468,0.0001267817,0.0002170289],"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.0000307583,0.0001108,0.00002891436,0.00000127948,5.719349e-7,0.000004279688,0.00008705685,0.002830356,0.0003302369,0.6946819,0.000002996941,0.3018909],"study_design_scores_gemma":[0.0003266679,0.0007713388,0.001926855,0.00003592844,0.000001023962,0.00000868734,6.006529e-7,0.6163679,0.0118413,0.3684808,0.00004223207,0.0001966434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03567551,0.00003368901,0.9614221,0.0006357622,0.0004540316,0.0002782339,4.744106e-7,0.0002112896,0.001288839],"genre_scores_gemma":[0.5614986,0.000004095409,0.4374817,0.0009745609,0.00002869018,0.000006053223,4.797025e-7,0.000005119538,6.578784e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6135376,"threshold_uncertainty_score":0.980904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}