{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":131,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":131,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9d0a9cf466be","filters":{"venue":"Electronic Proceedings in Theoretical Computer Science"}},"results":[{"id":"W2803889673","doi":"10.4204/eptcs.287.1","title":"Towards Large-scale Functional Verification of Universal Quantum Circuits","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Quantum computer; Formal equivalence checking; Boolean function; Qubit; Boolean circuit; Theoretical computer science; Formal verification; Algorithm; Polynomial; Quantum circuit; Electronic circuit; Quantum algorithm; Quantum; Mathematics; Quantum error correction; Quantum mechanics; Physics","authors":[{"name":"Matthew Amy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004568378535353583,"gpt":0.2092226567603188,"spread":0.2046542782249653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004086068,0.0008416589,0.000810241,0.0009718368,0.0009613758,0.002250985,0.003010811,0.001190151,0.002927177],"category_scores_gemma":[0.01157257,0.0007616314,0.001718593,0.0007200756,0.003369455,0.0043855,0.003100941,0.003190691,0.0006708826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001739991,"about_ca_system_score_gemma":0.002924195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003307633,"about_ca_topic_score_gemma":0.003172772,"domain_scores_codex":[0.9961401,0.001281472,0.0002642451,0.0005623756,0.001368049,0.0003838628],"domain_scores_gemma":[0.9924231,0.004042224,0.000392533,0.00218373,0.0008116355,0.0001468495],"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.000226687,0.0002005128,0.001257847,0.0003042325,0.00007990382,0.0003034518,0.0005520188,0.2209393,0.05529996,0.6394966,0.00182113,0.0795183],"study_design_scores_gemma":[0.00006442574,0.00008436915,0.0001780296,0.00002960904,0.00002444153,0.00007481233,0.00007003579,0.7169912,0.032584,0.2460902,0.003778379,0.00003053056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01931265,0.00004155582,0.9779195,0.000141405,0.00001382712,0.00007127035,0.00005896857,0.001609592,0.0008311914],"genre_scores_gemma":[0.4791048,0.0001346096,0.5183504,0.0001815248,0.00003373635,0.0002166658,0.000320647,0.0004497076,0.001207976],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004086068,"threshold_uncertainty_score":0.02160943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078639733","doi":"10.4204/eptcs.172.1","title":"Dilation of states and processes in operational-probabilistic theories","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Key Research and Development Program of China; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Government of Canada; Foundational Questions Institute","keywords":"Probabilistic logic; Dilation (metric space); Computer science; Mathematical economics; Mathematics; Artificial intelligence","authors":[{"name":"Giulio Chiribella","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003445579069430531,"gpt":0.2273131135587382,"spread":0.2238675344893077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003016337,0.0005616834,0.0006704655,0.001260005,0.001252805,0.00241071,0.001051497,0.001356206,0.004187454],"category_scores_gemma":[0.003325075,0.000425164,0.001122415,0.0009914109,0.009030297,0.008582234,0.00293403,0.003162974,0.0005416989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001721265,"about_ca_system_score_gemma":0.0007857382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007332643,"about_ca_topic_score_gemma":0.0004201681,"domain_scores_codex":[0.9979569,0.0007687634,0.0001420418,0.0003477058,0.0006038237,0.0001807587],"domain_scores_gemma":[0.9984003,0.000904696,0.0001391758,0.000277212,0.0001717926,0.0001069044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[9.874958e-7,7.799884e-7,0.00001186731,0.000007896137,8.977029e-7,0.000009957274,0.0000374154,0.0002453106,0.00004530435,0.9990574,0.00007507711,0.0005071043],"study_design_scores_gemma":[0.000002182924,0.000006397605,0.0000490933,0.000007137731,0.000002156433,0.00002676413,0.00002009537,0.001847941,0.00008981562,0.9941922,0.003752172,0.000003968312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03441633,0.006557522,0.8529482,0.005172035,0.0007672799,0.0000656222,0.0002650096,0.0002867236,0.09952124],"genre_scores_gemma":[0.8402848,0.004781786,0.1351908,0.0015536,0.001778582,0.0002498987,0.0002435034,0.000168202,0.01574888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004187454,"threshold_uncertainty_score":0.01595211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1961267274","doi":"10.4204/eptcs.195.22","title":"Logical pre- and post-selection paradoxes are proofs of contextuality","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Foundational Questions Institute","keywords":"Kochen–Specker theorem; Postselection; Von Neumann architecture; Mathematical proof; Selection (genetic algorithm); Class (philosophy); Mathematics; Theoretical physics; Quantum; Pure mathematics; Physics; Computer science; Quantum mechanics; Epistemology; Philosophy; Quantum entanglement; Artificial intelligence","authors":[{"name":"Matthew F. Pusey","is_ca":true},{"name":"Matthew Leifer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01099038170597284,"gpt":0.2629665755079771,"spread":0.2519761938020043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009092514,0.0008136565,0.0009532842,0.001013631,0.002213991,0.004212641,0.002571421,0.002247997,0.005703197],"category_scores_gemma":[0.03712188,0.001034009,0.001736043,0.0007270084,0.01502029,0.011936,0.007329388,0.007493472,0.0007178731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017766,"about_ca_system_score_gemma":0.00214097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006809975,"about_ca_topic_score_gemma":0.0004683326,"domain_scores_codex":[0.9909158,0.003803065,0.0005828613,0.00180366,0.002206115,0.0006884815],"domain_scores_gemma":[0.9587048,0.02379388,0.002204136,0.01105019,0.003133285,0.001113662],"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.000030373,0.00001913191,0.000164255,0.00007925693,0.00002009979,0.0001287136,0.0002940823,0.000664858,0.000734193,0.995076,0.0005774923,0.002211582],"study_design_scores_gemma":[0.00002940825,0.00001874985,0.000136309,0.00001854718,0.000009125477,0.00008655287,0.00006593594,0.002253951,0.001193904,0.9937032,0.002467559,0.00001668407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1472711,0.001755666,0.7483716,0.01602028,0.0009402786,0.0002593672,0.0007840754,0.001235579,0.08336209],"genre_scores_gemma":[0.9186391,0.0006059253,0.07360011,0.002290177,0.0004350164,0.0003138066,0.0002985453,0.0002062143,0.003611071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009092514,"threshold_uncertainty_score":0.04808635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2792585849","doi":"10.4204/eptcs.266.11","title":"A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; U.S. Air Force","keywords":"Morphism; Categorical variable; Categorical quantum mechanics; Programming language specification; Object language; State (computer science); Quantum circuit; Type (biology); Quantum","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01144769719817932,"gpt":0.254595512339921,"spread":0.2431478151417417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001987389,0.0004896055,0.0005458874,0.001160249,0.001446006,0.003613954,0.002547345,0.001547814,0.00979483],"category_scores_gemma":[0.002517247,0.0006707326,0.001575152,0.001432465,0.004079205,0.005531114,0.003138078,0.003305153,0.002045725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002983164,"about_ca_system_score_gemma":0.001714464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004063521,"about_ca_topic_score_gemma":0.002730164,"domain_scores_codex":[0.9980564,0.0005448504,0.0001553819,0.0004311679,0.0005453283,0.0002669228],"domain_scores_gemma":[0.9984856,0.0005401036,0.0001178986,0.0003180421,0.0003849888,0.0001533276],"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.00001642442,0.00001149311,0.00009074202,0.00003475305,0.000003130992,0.00006353994,0.0002150297,0.001001291,0.0007608319,0.993795,0.001055506,0.002952277],"study_design_scores_gemma":[0.00004250648,0.00006557522,0.0001715676,0.00004595459,0.00001729705,0.0003194389,0.000202158,0.02948315,0.002690039,0.8980191,0.06889385,0.00004922075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0130068,0.0003340769,0.9653401,0.001969961,0.0001660894,0.0001323942,0.001003206,0.001624712,0.01642252],"genre_scores_gemma":[0.485152,0.0005065168,0.4867013,0.001865967,0.0002614444,0.0008041032,0.001788635,0.0006071347,0.02231303],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00979483,"threshold_uncertainty_score":0.032767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152635269","doi":"10.4204/eptcs.77.1","title":"Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University","keywords":"Coinduction; Recursion (computer science); Type (biology); Fixed point; Computer science; Productivity; Mathematics; Programming language; Economics; Mathematical proof","authors":[{"name":"Andreas Abel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009176382782976196,"gpt":0.2414956572258375,"spread":0.2323192744428613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007619775,0.0006779899,0.001158663,0.001963005,0.001736733,0.004727342,0.00227456,0.00154012,0.002624964],"category_scores_gemma":[0.02129675,0.001010685,0.001822651,0.001641828,0.008148872,0.009597021,0.005027469,0.004069744,0.0009744894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002126351,"about_ca_system_score_gemma":0.001844713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207109,"about_ca_topic_score_gemma":0.001051753,"domain_scores_codex":[0.9937559,0.001569114,0.0006871782,0.00105195,0.00224567,0.0006901657],"domain_scores_gemma":[0.9854395,0.006062078,0.001161528,0.004943795,0.001967746,0.0004252766],"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.00006961955,0.00001611718,0.0008879139,0.00005694139,0.00001526391,0.00006955479,0.0004924251,0.002077408,0.002517398,0.9761766,0.000397584,0.01722293],"study_design_scores_gemma":[0.00003896564,0.00008759263,0.000484972,0.0000701504,0.00007631875,0.0003366933,0.0001245384,0.03771925,0.0248381,0.9256623,0.01048972,0.00007139993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03128751,0.0002553618,0.9588819,0.0002686864,0.00006321565,0.00005524194,0.00006728815,0.001312029,0.007808711],"genre_scores_gemma":[0.6305471,0.0003340365,0.357834,0.000302124,0.0001478912,0.000301826,0.0001790455,0.0009591221,0.009394809],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007619775,"threshold_uncertainty_score":0.04029769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125182723","doi":"10.4204/eptcs.195.3","title":"Quantum Alternation: Prospects and Problems","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"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; Fonds Québécois de la Recherche sur la Nature et les Technologies; Chinese Academy of Sciences","keywords":"Denotational semantics; Statement (logic); Quantum; Semantics (computer science); Computer science; Mathematics; Quantum algorithm; Programming language; Algebra over a field; Discrete mathematics; Theoretical computer science; Operational semantics; Pure mathematics; Quantum mechanics; Physics; Linguistics; Philosophy","authors":[{"name":"Costin Bădescu","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007612402115275471,"gpt":0.2305862753071317,"spread":0.2229738731918562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007827619,0.0008792497,0.001327111,0.00130758,0.002787127,0.00569301,0.003710208,0.007208518,0.01061986],"category_scores_gemma":[0.009945608,0.0005520344,0.0009344176,0.001871872,0.01705546,0.0271443,0.004938482,0.008536061,0.002137513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002145843,"about_ca_system_score_gemma":0.002961275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00156381,"about_ca_topic_score_gemma":0.0009934305,"domain_scores_codex":[0.9976143,0.001098726,0.00008729005,0.0004448285,0.0004633644,0.000291625],"domain_scores_gemma":[0.9888868,0.006985717,0.0004401962,0.001574983,0.001202213,0.0009100906],"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.00003309164,0.00004710273,0.0001211352,0.00008698206,0.000004861988,0.00005054691,0.0001312537,0.001322671,0.00008877709,0.9827676,0.003082936,0.01226302],"study_design_scores_gemma":[0.000005754273,0.000008896496,0.00002414101,0.00002882806,0.000001137074,0.00002341024,0.0001279455,0.001613701,0.00004752303,0.9928021,0.005308129,0.000008442414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.03977462,0.1070043,0.2836816,0.422687,0.005329767,0.00008014765,0.0002542396,0.0008309142,0.1403574],"genre_scores_gemma":[0.7443382,0.07506561,0.1173094,0.02428874,0.01292933,0.0004685927,0.0003198574,0.0003254892,0.02495481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01061986,"threshold_uncertainty_score":0.04139692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570901353","doi":"10.4204/eptcs.266.5","title":"A Finite Presentation of CNOT-Dihedral Operators","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Controlled NOT gate; Dihedral angle; Dihedral group; Unitary state; Mathematics; Pure mathematics; Discrete mathematics; Computer science; Algebra over a field; Topology (electrical circuits); Combinatorics; Physics; Quantum gate; Quantum; Quantum mechanics; Quantum computer; Law; Group (periodic table)","authors":[{"name":"Matthew Amy","is_ca":true},{"name":"Jianxin Chen","is_ca":false},{"name":"Neil J. Ross","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004989352581409593,"gpt":0.2452646718012964,"spread":0.2402753192198868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103879,0.0007365784,0.0005711934,0.001000972,0.001530035,0.002836144,0.001201016,0.001059062,0.01275964],"category_scores_gemma":[0.001910326,0.000325515,0.0008267518,0.0007589752,0.00300467,0.005157856,0.002203367,0.00298306,0.001904536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001495504,"about_ca_system_score_gemma":0.001120893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005687415,"about_ca_topic_score_gemma":0.000428284,"domain_scores_codex":[0.9985633,0.0002954666,0.0001155035,0.000337605,0.0004111365,0.0002769349],"domain_scores_gemma":[0.9990428,0.0002846974,0.00007615581,0.000164719,0.0002978131,0.0001338307],"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.000009507246,0.000007230105,0.00002230613,0.00001194394,0.000001224196,0.00004184406,0.0001404144,0.0001861343,0.001178037,0.9957361,0.0003667862,0.002298359],"study_design_scores_gemma":[0.0000113275,0.0000213091,0.00002307187,0.00001214123,0.000004985,0.0001202638,0.00009969201,0.003631792,0.003171868,0.9806692,0.01221851,0.0000159062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08895331,0.0004938774,0.7750072,0.001423248,0.0007410726,0.0002104511,0.0006065777,0.0008243234,0.1317398],"genre_scores_gemma":[0.7886965,0.0005638085,0.1658091,0.001007819,0.0003576876,0.0005648475,0.0007203279,0.0004900913,0.04178986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01275964,"threshold_uncertainty_score":0.04268533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044654785","doi":"10.4204/eptcs.3.11","title":"State Complexity Approximation","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"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":"State (computer science); Computer science; Theoretical computer science; Mathematics; Algorithm","authors":[{"name":"Yuan Gao","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006796178078751685,"gpt":0.2484712954851694,"spread":0.2416751174064177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265599,0.001015055,0.001414495,0.001349648,0.0007531673,0.003215231,0.002254403,0.001174234,0.006684076],"category_scores_gemma":[0.02236972,0.0004785002,0.001290322,0.00152686,0.001567727,0.007838277,0.003163444,0.004264102,0.001091054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002115472,"about_ca_system_score_gemma":0.001700294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002244418,"about_ca_topic_score_gemma":0.001471636,"domain_scores_codex":[0.9954211,0.0009338508,0.000240572,0.0009675367,0.00199228,0.0004447166],"domain_scores_gemma":[0.9860491,0.008742814,0.0008256471,0.002783059,0.001347631,0.000251807],"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.000248482,0.0001160171,0.002813101,0.0002351961,0.00008046163,0.0001437485,0.0002245454,0.2861446,0.001961756,0.5974084,0.004865552,0.1057583],"study_design_scores_gemma":[0.00000951036,0.0000363271,0.000356054,0.0000335305,0.00001859561,0.00007682061,0.00002660205,0.7540817,0.001759528,0.2395698,0.004009957,0.00002160867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007816811,0.0002771486,0.9853545,0.0003544618,0.000071458,0.00003618015,0.0001859421,0.0003845087,0.005518888],"genre_scores_gemma":[0.6645337,0.001188982,0.321695,0.0004754412,0.0003363284,0.0003697507,0.001786532,0.0003914264,0.00922281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006684076,"threshold_uncertainty_score":0.02236044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2329299806","doi":"10.4204/eptcs.158.0","title":"Proceedings 9th Workshop on Quantum Physics and Logic","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Quantum logic; Physics; Engineering physics; Quantum; Quantum mechanics; Quantum computer","authors":[{"name":"Ross Duncan","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005988836414477809,"gpt":0.2299726511338213,"spread":0.2239838147193435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002735386,0.0009649047,0.001230175,0.001294934,0.002144353,0.006474704,0.002089096,0.001884277,0.06757799],"category_scores_gemma":[0.003230205,0.0005982715,0.001579492,0.001177008,0.001756725,0.005432513,0.003899298,0.003886861,0.01302111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002372521,"about_ca_system_score_gemma":0.002037307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002023489,"about_ca_topic_score_gemma":0.004115124,"domain_scores_codex":[0.9983797,0.0005811831,0.00008665505,0.0003190932,0.0004042743,0.0002291184],"domain_scores_gemma":[0.9984951,0.0003763486,0.00004141321,0.0004440615,0.0004169233,0.0002260568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006290055,0.0003317141,0.0007171527,0.000498337,0.0001389987,0.0002628344,0.0007415062,0.002719359,0.006713671,0.3592274,0.3061438,0.3218762],"study_design_scores_gemma":[0.00007041634,0.00008710081,0.0007239193,0.0002794483,0.00009640823,0.000281989,0.0003148685,0.009060313,0.006625007,0.2803581,0.7020541,0.00004846101],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.03320901,0.04196147,0.3802981,0.05532999,0.06346716,0.0003238623,0.002077157,0.002336446,0.4209968],"genre_scores_gemma":[0.2285121,0.01595811,0.1344707,0.005341892,0.01202994,0.00031299,0.003793196,0.001870091,0.597711],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.06757799,"threshold_uncertainty_score":0.2260709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2552403574","doi":"10.4204/eptcs.229.8","title":"Developing a Practical Reactive Synthesis Tool: Experience and Lessons Learned","year":2016,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":16,"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":"Debugger; Key (lock); Computer science; Software engineering; Software; Process management; Debugging; Programming language; Engineering; Computer security","authors":[{"name":"Leonid Ryzhyk","is_ca":true},{"name":"Adam K. Walker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02934835107537552,"gpt":0.3277130819157738,"spread":0.2983647308403982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01799597,0.001461589,0.0008937491,0.001147994,0.001890211,0.003777896,0.003721673,0.003159931,0.005680187],"category_scores_gemma":[0.0429702,0.0009360317,0.0007944123,0.001042482,0.002904326,0.00789173,0.004742626,0.003554941,0.00203277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211739,"about_ca_system_score_gemma":0.002221246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002074867,"about_ca_topic_score_gemma":0.002568452,"domain_scores_codex":[0.988701,0.005446041,0.000689079,0.001416432,0.003026802,0.0007206529],"domain_scores_gemma":[0.9741896,0.01679029,0.0005132699,0.002600899,0.004350766,0.001555154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006019116,0.002420046,0.008932319,0.002371049,0.0001611451,0.004385538,0.09797183,0.02852807,0.07195739,0.01817576,0.01071393,0.7537811],"study_design_scores_gemma":[0.0005411645,0.006221555,0.006906308,0.00219129,0.0004301462,0.0163139,0.04635414,0.1327262,0.1519601,0.03849512,0.596893,0.0009671666],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2283895,0.001523032,0.7425824,0.002532905,0.0002097461,0.0004487035,0.0001307053,0.004238279,0.01994453],"genre_scores_gemma":[0.4583415,0.002492167,0.5184097,0.001074337,0.0001237357,0.000322213,0.0005470295,0.002942122,0.01574719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01799597,"threshold_uncertainty_score":0.09517294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052351054","doi":"10.4204/eptcs.9.12","title":"How Creative Should Creators Be To Optimize the Evolution of Ideas? A Computational Model","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Vlaamse regering","keywords":"Creativity; Function (biology); Diversity (politics); Population; Fitness function; Ideal (ethics); Sociology; Psychology; Epistemology; Computer science; Social psychology; Demography; Biology; Philosophy; Evolutionary biology","authors":[{"name":"Stefan Leijnen","is_ca":true},{"name":"Liane Gabora","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01133373887865297,"gpt":0.2871389603538102,"spread":0.2758052214751572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001495825,0.0005031209,0.0005124811,0.0008525301,0.0008548158,0.003318309,0.002204102,0.002390665,0.007726302],"category_scores_gemma":[0.008462591,0.0004384604,0.0008822507,0.001157149,0.00190386,0.00306689,0.00124149,0.001199434,0.0008612194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001398006,"about_ca_system_score_gemma":0.001396841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004813041,"about_ca_topic_score_gemma":0.003215969,"domain_scores_codex":[0.9994022,0.0003108555,0.00002094876,0.0001065159,0.0000856496,0.00007378298],"domain_scores_gemma":[0.9969088,0.002365601,0.0001738895,0.0001732712,0.0001719152,0.000206516],"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.00006035738,0.00007225473,0.002042,0.00009242912,0.00005609104,0.0002082075,0.0006964674,0.3842049,0.0007246454,0.5962099,0.002359204,0.01327359],"study_design_scores_gemma":[0.00005118514,0.00003574764,0.0004598727,0.00002426491,0.00002653873,0.0001243957,0.0001672705,0.7666892,0.0001760939,0.2264575,0.005768606,0.00001937348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.255653,0.002011369,0.5044874,0.01699991,0.0001650505,0.0002801795,0.0006952626,0.0003098992,0.2193979],"genre_scores_gemma":[0.8566359,0.001359447,0.1042806,0.0006893267,0.00009454544,0.0005291614,0.0002060728,0.00008656505,0.03611839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007726302,"threshold_uncertainty_score":0.02584708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966076725","doi":"10.4204/eptcs.31.21","title":"Nondeterministic State Complexity for Suffix-Free Regular Languages","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Catenation; Regular language; Suffix; Upper and lower bounds; Discrete mathematics; Computer science; State (computer science); String (physics); Intersection (aeronautics); Automaton; Mathematics; Theoretical computer science; Algorithm; Automata theory","authors":[{"name":"Yo-Sub Han","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006249754356745859,"gpt":0.2532547907464555,"spread":0.2470050363897097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562088,0.0006682443,0.001164109,0.001411492,0.001411455,0.004649658,0.001748964,0.00123295,0.005303057],"category_scores_gemma":[0.02020306,0.0006134555,0.00182111,0.001264621,0.003224393,0.008742652,0.002287368,0.002848998,0.0004678598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003052801,"about_ca_system_score_gemma":0.002193436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001600211,"about_ca_topic_score_gemma":0.00163282,"domain_scores_codex":[0.9956975,0.0008333136,0.0004350653,0.0008661884,0.001418921,0.0007491369],"domain_scores_gemma":[0.9515318,0.03925262,0.002920142,0.003523391,0.00171981,0.001052135],"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.001232188,0.0004315778,0.008893254,0.0004625207,0.0001338614,0.0005094701,0.001575016,0.3351859,0.03564902,0.5785578,0.00188181,0.03548757],"study_design_scores_gemma":[0.00005593357,0.0001349667,0.001188886,0.00001489625,0.00005424878,0.0001630173,0.0001197507,0.5651072,0.01260417,0.4195549,0.0009391548,0.00006279049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7891127,0.0004011648,0.1986765,0.001016728,0.00004139311,0.0001631072,0.0007899329,0.00057289,0.009225572],"genre_scores_gemma":[0.9677414,0.0002044138,0.02927778,0.00006546247,0.0000551212,0.00017404,0.0005864922,0.0001226409,0.001772614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005303057,"threshold_uncertainty_score":0.02214974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1824826039","doi":"10.4204/eptcs.186.5","title":"Systematic Verification of the Modal Logic Cube in Isabelle/HOL","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"HOL; Cube (algebra); Higher-order logic; Computer science; Modal; Modal logic; Programming language; Embedding; Multimodal logic; Automation; Normal modal logic; Accessibility relation; Automated theorem proving; Dynamic logic (digital electronics); Algorithm; Theoretical computer science; Description logic; Mathematics; Artificial intelligence; Engineering","authors":[{"name":"Christoph Benzmüller","is_ca":false},{"name":"Maximilian Claus","is_ca":false},{"name":"Nik Sultana","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01391705845651953,"gpt":0.2437346175284077,"spread":0.2298175590718882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0106391,0.001110036,0.0009725305,0.001203497,0.002235705,0.002533896,0.002670071,0.001273534,0.007162331],"category_scores_gemma":[0.02162398,0.00133775,0.002797669,0.0007099799,0.004360477,0.005259116,0.006329879,0.003708564,0.001676763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002319298,"about_ca_system_score_gemma":0.008852219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006008806,"about_ca_topic_score_gemma":0.007887334,"domain_scores_codex":[0.985919,0.005645728,0.0004628448,0.001426741,0.005014715,0.00153099],"domain_scores_gemma":[0.9713897,0.01789511,0.001076665,0.006227449,0.003047791,0.0003632771],"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.001016,0.0007016587,0.004715397,0.002262466,0.0005576647,0.001710919,0.003029657,0.1232448,0.09303685,0.5245858,0.02383415,0.2213047],"study_design_scores_gemma":[0.0004659635,0.0003849302,0.001543562,0.000384291,0.0003261176,0.0006134973,0.0004881065,0.4741272,0.2030295,0.2699069,0.04849645,0.0002334864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02764551,0.0001775797,0.9551992,0.0007042682,0.0001155824,0.0003129493,0.000398284,0.01163368,0.003813012],"genre_scores_gemma":[0.3335916,0.0003644183,0.6591787,0.0006915354,0.00006939073,0.0005056831,0.00107399,0.001812366,0.002712433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0106391,"threshold_uncertainty_score":0.05626559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385342865","doi":"10.4204/eptcs.380.5","title":"Compositional Modeling with Stock and Flow Diagrams","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Saskatchewan","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Public Health Agency of Canada; Foundation for the National Institutes of Health","keywords":"Principle of compositionality; Computer science; Story-driven modeling; Programming language; Interaction overview diagram; Semantics (computer science); Theoretical computer science; Stock (firearms); Syntax; Software; Class diagram; Unified Modeling Language; Artificial intelligence","authors":[{"name":"John C. Baez","is_ca":false},{"name":"Xiaoyan Li","is_ca":true},{"name":"Sophie Libkind","is_ca":false},{"name":"Nathaniel Osgood","is_ca":true},{"name":"Evan Patterson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0424166694482239,"gpt":0.3349286603871206,"spread":0.2925119909388967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002601373,0.00100386,0.0006475226,0.001783886,0.001096989,0.002868964,0.001655285,0.001407188,0.007338146],"category_scores_gemma":[0.005895908,0.0007642425,0.002671199,0.001307767,0.002025637,0.004875938,0.002618285,0.001779121,0.001016279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001629423,"about_ca_system_score_gemma":0.002130509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008816258,"about_ca_topic_score_gemma":0.009641089,"domain_scores_codex":[0.9981029,0.0006837401,0.0001563336,0.0003169678,0.0005727461,0.000167216],"domain_scores_gemma":[0.9976698,0.001155229,0.0002108971,0.0004190533,0.0003840383,0.0001610141],"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.00002199453,0.00003148105,0.000461583,0.0000543072,0.00002799497,0.0001080009,0.0002624879,0.1066545,0.0009050705,0.8824334,0.000736661,0.008302419],"study_design_scores_gemma":[0.00003225411,0.00002263472,0.0001032276,0.00003658057,0.00004051008,0.00006382484,0.00005546002,0.4150496,0.001175591,0.5588702,0.02452796,0.00002208715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004650289,0.00008677169,0.9886146,0.0001730958,0.00003169456,0.00005999132,0.0001764658,0.0004067493,0.005800521],"genre_scores_gemma":[0.1973678,0.0006153909,0.7894106,0.0001801878,0.0001019615,0.0005516805,0.0006451635,0.0003649739,0.0107621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008816258,"threshold_uncertainty_score":0.02454853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964707275","doi":"10.4204/eptcs.63.29","title":"The Critical Exponent is Computable for Automatic Sequences","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","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":"Tulane University","keywords":"Exponent; Infimum and supremum; Critical exponent; Mathematics; Constant (computer programming); Computation; Sequence (biology); Rational number; Discrete mathematics; Combinatorics; Computer science; Algorithm; Geometry","authors":[{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01378765320324307,"gpt":0.2557944034789316,"spread":0.2420067502756885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634506,0.0005872594,0.0005766986,0.001917202,0.000731424,0.00273669,0.0004797697,0.0004408779,0.003067936],"category_scores_gemma":[0.009730497,0.0003334682,0.0003647354,0.001262827,0.002320261,0.004603896,0.001341202,0.001479093,0.0006331568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416117,"about_ca_system_score_gemma":0.0007446354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008120438,"about_ca_topic_score_gemma":0.0008377071,"domain_scores_codex":[0.9993432,0.00008741865,0.00005996867,0.0001971169,0.0001912116,0.0001211496],"domain_scores_gemma":[0.9951018,0.003192608,0.0003629092,0.000573351,0.000562248,0.0002070576],"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.0003854984,0.00004954513,0.006217699,0.0002977281,0.00002484064,0.0004639947,0.001068422,0.008299816,0.02211312,0.9056882,0.00254338,0.05284767],"study_design_scores_gemma":[0.0000436766,0.00004607866,0.001413626,0.00009060495,0.00002871827,0.0003532422,0.0001586422,0.04094193,0.02236886,0.9284369,0.006066687,0.000050882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7583922,0.001358128,0.2002217,0.0007588044,0.000108954,0.00006179853,0.0003950795,0.001026931,0.03767656],"genre_scores_gemma":[0.9791213,0.0003096563,0.01809606,0.00006319523,0.00008139508,0.00003869868,0.0001679994,0.0001356781,0.001986152],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003067936,"threshold_uncertainty_score":0.01027471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145158997","doi":"10.4204/eptcs.14.6","title":"An Efficient Explicit-time Description Method for Timed Model Checking","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","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":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Model checking; Process (computing); Rendezvous; Synchronization (alternating current); Modularity (biology); Automaton; State (computer science); Variable (mathematics); Semaphore","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01322371411625222,"gpt":0.3050697146368014,"spread":0.2918460005205492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003186478,0.001316328,0.001010451,0.001298395,0.0007549282,0.002030322,0.002940548,0.001302322,0.007859004],"category_scores_gemma":[0.007008271,0.00105593,0.002220989,0.001154603,0.001329162,0.003320221,0.001929715,0.002475827,0.002051435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001087999,"about_ca_system_score_gemma":0.002702903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002229563,"about_ca_topic_score_gemma":0.002452321,"domain_scores_codex":[0.9962669,0.001080199,0.0004194411,0.0004943644,0.001506742,0.0002323474],"domain_scores_gemma":[0.9966124,0.001612938,0.000199027,0.0008067391,0.0006921245,0.00007683747],"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.0003005975,0.0001807574,0.0006853719,0.0009584355,0.0001741587,0.0008505045,0.0005473783,0.1243492,0.03174593,0.5123084,0.01390003,0.3139993],"study_design_scores_gemma":[0.0002362475,0.00009827031,0.0001270287,0.0001628128,0.00013578,0.0007126014,0.00004695671,0.774424,0.03659616,0.09530247,0.0920366,0.0001211594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003845568,0.00004129887,0.9974405,0.00002967973,0.00003363237,0.00003913374,0.00004897477,0.001423489,0.0005587284],"genre_scores_gemma":[0.04559689,0.0002681228,0.9472238,0.0001698457,0.00005254886,0.0004377335,0.0005935808,0.001164462,0.004493037],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007859004,"threshold_uncertainty_score":0.02629095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2216433683","doi":"10.4204/eptcs.185.3","title":"A Case Study on Logical Relations using Contextual Types","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Mathematical proof; ENCODE; Equivalence (formal languages); Operational semantics; Computer science; Abstract syntax; Normalization (sociology); Logical consequence; Exploit; Logical equivalence; Theoretical computer science; Mathematics; Algebra over a field; Programming language; Semantics (computer science); Discrete mathematics; Pure mathematics; Artificial intelligence","authors":[{"name":"Andrew Cave","is_ca":true},{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0424867910284814,"gpt":0.296455703992082,"spread":0.2539689129636006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01940678,0.0008790026,0.001220331,0.002754423,0.006411293,0.009504535,0.003573134,0.00469971,0.006416063],"category_scores_gemma":[0.03809096,0.00135836,0.002552812,0.003442161,0.02205464,0.02601925,0.01055217,0.007569364,0.001235718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004805443,"about_ca_system_score_gemma":0.003506856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008340584,"about_ca_topic_score_gemma":0.006142626,"domain_scores_codex":[0.9744613,0.01651506,0.0008291379,0.002074148,0.004280606,0.00183977],"domain_scores_gemma":[0.9645644,0.02624919,0.0008546136,0.005299625,0.002276878,0.000755253],"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.000012978,0.00001046617,0.000111748,0.00003918229,0.000004168736,0.0002292069,0.0006254942,0.0006578971,0.0001883435,0.9940439,0.0004164051,0.003660272],"study_design_scores_gemma":[0.00004171313,0.00004670411,0.0002526163,0.0001760436,0.00003071202,0.0009362837,0.001226571,0.008351594,0.002997927,0.9150346,0.07085393,0.00005131674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03212911,0.004769153,0.8605083,0.01231955,0.0003169368,0.0002063,0.0001262139,0.001212655,0.08841184],"genre_scores_gemma":[0.5842291,0.003272182,0.3931085,0.001623449,0.0004137255,0.0002802169,0.0001276324,0.0006420813,0.01630314],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01940678,"threshold_uncertainty_score":0.1026341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967571653","doi":"10.4204/eptcs.151.10","title":"Maximally Atomic Languages","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Mathematics; Regular language; Combinatorics; Semigroup; Rank (graph theory); Discrete mathematics; Physics","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Gareth Davies","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.002605956503864343,"gpt":0.217047875537888,"spread":0.2144419190340237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009514277,0.0003891425,0.0005703401,0.0008743344,0.001129969,0.002276272,0.001070594,0.0005443289,0.005230838],"category_scores_gemma":[0.004640271,0.0004897402,0.0009395696,0.0005602326,0.002047041,0.004214155,0.001907114,0.001053662,0.0008123918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009142098,"about_ca_system_score_gemma":0.0009437689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005822573,"about_ca_topic_score_gemma":0.000704959,"domain_scores_codex":[0.9978885,0.0004285245,0.0002352498,0.0005776147,0.0005489523,0.0003210375],"domain_scores_gemma":[0.9954383,0.001964,0.0006912841,0.0008853605,0.000714826,0.0003063085],"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.0002667032,0.00004891498,0.002405657,0.0002359605,0.00003980953,0.0004140035,0.001194002,0.002486157,0.0211143,0.9470372,0.002200072,0.02255737],"study_design_scores_gemma":[0.00004801547,0.000120874,0.001522337,0.00005350632,0.00005998467,0.00105935,0.0005896575,0.02310115,0.01690043,0.9289891,0.02750486,0.00005079465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5571766,0.0007803144,0.392765,0.001050299,0.0001155365,0.0002786305,0.002340341,0.001911211,0.04358208],"genre_scores_gemma":[0.9189552,0.0001798098,0.07212404,0.0001900277,0.0001312669,0.0002284884,0.001013818,0.0001786148,0.006998846],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005230838,"threshold_uncertainty_score":0.01749891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076858065","doi":"10.4204/eptcs.71.3","title":"Multi-level Contextual Type Theory","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","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":"McGill University","funders":"","keywords":"Decidability; Type (biology); Dependency (UML); Type theory; Substitution (logic); Dependent type; Scheme (mathematics); Upper and lower bounds","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03317835845757754,"gpt":0.2572329000264598,"spread":0.2240545415688822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003107374,0.0007050474,0.0008072236,0.001962176,0.001760578,0.005031015,0.001804607,0.00122275,0.005772554],"category_scores_gemma":[0.003640614,0.0008290412,0.00159031,0.002463575,0.00444671,0.009105351,0.003476124,0.003416425,0.001060966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002530004,"about_ca_system_score_gemma":0.001386727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003282715,"about_ca_topic_score_gemma":0.004096422,"domain_scores_codex":[0.9970822,0.0007642396,0.0002777369,0.0007389554,0.0007181318,0.000418623],"domain_scores_gemma":[0.9973546,0.0007657548,0.0002266519,0.0009418924,0.0005162793,0.0001948398],"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.000008353184,0.000003355514,0.0002193196,0.00003645603,0.000005300019,0.0000252264,0.0001787494,0.0008885061,0.0003789134,0.9929379,0.0004118137,0.004906156],"study_design_scores_gemma":[0.00001124173,0.00001874485,0.0003527765,0.0000878417,0.00004124663,0.0001363958,0.0001621607,0.01751077,0.00191015,0.9456137,0.03412506,0.00002996344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0160942,0.001485345,0.9485061,0.001115425,0.0001706695,0.0000781344,0.0004593778,0.0009759077,0.03111485],"genre_scores_gemma":[0.4991807,0.001377841,0.4854732,0.0006353958,0.0003202424,0.0002476576,0.0005192714,0.0003721329,0.01187345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005772554,"threshold_uncertainty_score":0.01931113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058755347","doi":"10.4204/eptcs.161.15","title":"A Formulation of the Potential for Communication Condition using C2KA","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Covert; Computer science; Channel (broadcasting); Covert channel; Communications system; Path (computing); Theoretical computer science; Distributed computing; Computer network","authors":[{"name":"Jason Jaskolka","is_ca":true},{"name":"Ridha Khédri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008343097245646705,"gpt":0.2616747680868401,"spread":0.2533316708411935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003595165,0.0006860537,0.0009402538,0.001251646,0.001969958,0.003421737,0.002165455,0.002338211,0.01064126],"category_scores_gemma":[0.00960345,0.0005732824,0.001585798,0.001007581,0.005371835,0.008866187,0.003075705,0.004761921,0.001563373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00185277,"about_ca_system_score_gemma":0.003415076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00169525,"about_ca_topic_score_gemma":0.001720618,"domain_scores_codex":[0.9966202,0.00072556,0.0002720371,0.0006674629,0.001226705,0.0004880668],"domain_scores_gemma":[0.9933279,0.003549286,0.000555309,0.001066125,0.001161074,0.0003403002],"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.00002041545,0.000009693055,0.00006466163,0.00005067834,0.000005395723,0.0001620818,0.0001226216,0.008097172,0.001410438,0.9868614,0.0003504257,0.002845021],"study_design_scores_gemma":[0.0000340651,0.0000657389,0.00007212738,0.00003584142,0.00001775476,0.0002195262,0.00008729652,0.09756365,0.003734233,0.8899497,0.008170305,0.0000497532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0117462,0.000144252,0.9669508,0.0009005492,0.0001280558,0.0001298123,0.0001260076,0.000283811,0.01959054],"genre_scores_gemma":[0.6256984,0.0003891566,0.3603568,0.0005575714,0.0003283342,0.0007421205,0.00025946,0.0002045022,0.01146366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064126,"threshold_uncertainty_score":0.03559852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386093908","doi":"10.4204/eptcs.384.8","title":"Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amplitude; Mathematics; Theoretical physics; Physics; Quantum mechanics","authors":[{"name":"Matthew Amy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008348149584011729,"gpt":0.2482284254280993,"spread":0.2398802758440876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304613,0.0006464155,0.0006602586,0.00117253,0.001682509,0.002338214,0.001212171,0.00123057,0.004060207],"category_scores_gemma":[0.003370604,0.0004488843,0.001455854,0.0008394467,0.00348107,0.007673365,0.002242808,0.002898894,0.0008887973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001099871,"about_ca_system_score_gemma":0.0008965053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000651285,"about_ca_topic_score_gemma":0.0007504774,"domain_scores_codex":[0.9987852,0.0003256089,0.00009884488,0.0001230744,0.000510282,0.0001569951],"domain_scores_gemma":[0.9987588,0.0005091442,0.00008219138,0.0002858833,0.0003017618,0.00006220944],"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.00000207159,0.000002574328,0.00001818396,0.000007713957,0.000001589466,0.00001148392,0.00005867067,0.0005317082,0.0001434347,0.9980305,0.0001915994,0.001000386],"study_design_scores_gemma":[0.000005097387,0.000004137102,0.00002032244,0.000005698511,0.000002654002,0.00002012418,0.0000186409,0.004764499,0.000353089,0.9925364,0.002263597,0.000005768775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06956396,0.0009136711,0.8520609,0.002000583,0.0003184151,0.0001066487,0.0003888173,0.0002327123,0.07441434],"genre_scores_gemma":[0.689243,0.001468743,0.2768955,0.001182215,0.000476595,0.0004056646,0.0005745277,0.0003223309,0.02943154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004060207,"threshold_uncertainty_score":0.01358277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950537761","doi":"10.4204/eptcs.280.11","title":"Smtlink 2.0","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"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":"Satisfiability modulo theories; Soundness; Python (programming language); Satisfiability; Extension (predicate logic); Modulo; Translation (biology); Extensibility; Solver","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.008010546611672423,"gpt":0.2430261120248299,"spread":0.2350155654131575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003868595,0.002076296,0.0009348757,0.002113035,0.0007715836,0.003636169,0.005830882,0.001452902,0.12275],"category_scores_gemma":[0.01131186,0.002202075,0.003288557,0.001141994,0.001086503,0.004973161,0.005782138,0.004254761,0.06845153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00150609,"about_ca_system_score_gemma":0.003669997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004042007,"about_ca_topic_score_gemma":0.003640616,"domain_scores_codex":[0.996222,0.0006881939,0.0004435414,0.0006546043,0.001574291,0.0004173618],"domain_scores_gemma":[0.9957095,0.001379782,0.0003020744,0.001065368,0.001367977,0.0001752381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001517651,0.0003295759,0.002492762,0.002848407,0.000316016,0.0007893448,0.0006302532,0.01212192,0.01464721,0.1210617,0.602806,0.2404392],"study_design_scores_gemma":[0.000601694,0.0002397328,0.0007802028,0.0004309774,0.0001281384,0.0008410579,0.0001350492,0.07991316,0.02726948,0.05938691,0.8300763,0.0001973333],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.002564553,0.0002120401,0.4595486,0.0005659842,0.0004604345,0.0004417054,0.01059284,0.5000215,0.02559233],"genre_scores_gemma":[0.08551999,0.0008655996,0.5148456,0.002521119,0.0004268077,0.002109849,0.1026186,0.2270932,0.06399916],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.12275,"threshold_uncertainty_score":0.4106398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3108616151","doi":"10.4204/eptcs.329.1","title":"How to Formally Model Human in Collaborative Robotics","year":2020,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Robotics; Robot; Workspace; Artificial intelligence; Computer science; Human–robot interaction; Human–computer interaction; Risk analysis (engineering); Business","authors":[{"name":"Mehrnoosh Askarpour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01573372877370271,"gpt":0.277300833355258,"spread":0.2615671045815553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005819278,0.001153474,0.0008020018,0.0009693003,0.001136464,0.00445448,0.003197335,0.002711237,0.004051559],"category_scores_gemma":[0.01323015,0.000866759,0.002261497,0.0008167778,0.005673288,0.008771991,0.003961986,0.003983944,0.001735261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001617409,"about_ca_system_score_gemma":0.003724938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006329881,"about_ca_topic_score_gemma":0.005412614,"domain_scores_codex":[0.9947472,0.002268225,0.0005600751,0.0006122541,0.001418515,0.0003937348],"domain_scores_gemma":[0.9925096,0.004020978,0.0006758064,0.001569705,0.0009544351,0.0002693853],"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.00003051017,0.00009486209,0.0005795053,0.0005074884,0.00005240936,0.0003605655,0.001184339,0.05332772,0.002019132,0.917418,0.00191898,0.02250654],"study_design_scores_gemma":[0.00006159173,0.00008047032,0.0001671518,0.0003813852,0.00007317437,0.0003294635,0.0003522676,0.1039079,0.003952357,0.8203008,0.07033479,0.00005861184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002893829,0.0006440376,0.9891967,0.001055497,0.0001182601,0.0001454897,0.0001425198,0.0003557646,0.005447925],"genre_scores_gemma":[0.1832053,0.001910736,0.8060395,0.0007891607,0.0002264166,0.0007965899,0.0009387743,0.0003515485,0.005741987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006329881,"threshold_uncertainty_score":0.03077567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062936109","doi":"10.4204/eptcs.57.8","title":"Analysis of Non-Linear Probabilistic Hybrid Systems","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford","keywords":"Probabilistic logic; Class (philosophy); Variable (mathematics); Probabilistic analysis of algorithms; Phase portrait; Process (computing); Computer science; Linear approximation; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Nonlinear system; Artificial intelligence; Bifurcation; Mathematical analysis; Physics","authors":[{"name":"Joseph Assouramou","is_ca":true},{"name":"Josée Desharnais","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0162888522950719,"gpt":0.2676564201870438,"spread":0.2513675678919719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596066,0.0005500061,0.0005170575,0.0005409899,0.0003783478,0.0009646482,0.0008758678,0.0004964338,0.003196238],"category_scores_gemma":[0.003729204,0.000299439,0.0007460845,0.0003332079,0.001262534,0.001199211,0.001141995,0.0008742286,0.0002395425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001072611,"about_ca_system_score_gemma":0.0007764443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003221676,"about_ca_topic_score_gemma":0.001639474,"domain_scores_codex":[0.9991229,0.0002155437,0.00002966991,0.0001467693,0.0004011604,0.00008403184],"domain_scores_gemma":[0.9982016,0.001265038,0.0001641627,0.0001126625,0.0002102817,0.00004622612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000805323,0.00001602749,0.0009995685,0.0001075621,0.00004939964,0.0001748311,0.0001291915,0.8426284,0.005477687,0.1395527,0.0002133915,0.01057074],"study_design_scores_gemma":[0.0000050895,0.00001012162,0.0001317817,0.000003724634,0.000006162396,0.0000154163,0.00001147389,0.9684541,0.000989229,0.02993117,0.0004376326,0.000004026487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03491999,0.000169604,0.9619493,0.0001170358,0.00002409862,0.00002514104,0.00005059707,0.0002625088,0.002481697],"genre_scores_gemma":[0.9396791,0.0002226899,0.0560322,0.00005156701,0.00002807013,0.00008132445,0.0001130089,0.00008647321,0.003705603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003221676,"threshold_uncertainty_score":0.01069248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394987214","doi":"10.4204/eptcs.402.10","title":"CHC-COMP 2023: Competition Report","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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":"Competition (biology); French horn; Class (philosophy); Computer science; Operations research; Engineering; Sociology; Artificial intelligence","authors":[{"name":"Emanuele De Angelis","is_ca":true},{"name":"Hari Govind V K","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007252410397899102,"gpt":0.276505250815857,"spread":0.2692528404179579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02461672,0.003415791,0.001937933,0.003878673,0.003578677,0.01152685,0.006229092,0.00530194,0.1605502],"category_scores_gemma":[0.02725115,0.001402536,0.002629563,0.005468535,0.001193467,0.005569378,0.005462623,0.005760105,0.1269897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005708329,"about_ca_system_score_gemma":0.01636436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03506757,"about_ca_topic_score_gemma":0.0363168,"domain_scores_codex":[0.9816532,0.003036015,0.0006436594,0.001523778,0.01045242,0.002691035],"domain_scores_gemma":[0.9671011,0.003753419,0.0005331127,0.002460618,0.01822949,0.007922264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002757692,0.0001333903,0.0001317012,0.0001745982,0.0000251324,0.00004398326,0.00002779397,0.001005645,0.000577106,0.004872675,0.9765525,0.01617965],"study_design_scores_gemma":[0.0006209502,0.0002891123,0.0008738373,0.0001637749,0.00003212282,0.0001349378,0.00008330404,0.007134559,0.00278329,0.005895834,0.9819137,0.0000745518],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01939188,0.01046809,0.07979924,0.0401795,0.03555601,0.004209432,0.1840944,0.02819956,0.5981019],"genre_scores_gemma":[0.04591146,0.003264993,0.07206587,0.006895653,0.005139165,0.002383689,0.4694794,0.02321817,0.3716416],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1605502,"threshold_uncertainty_score":0.5370939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029618677","doi":"10.4204/eptcs.31.8","title":"State Complexity of Catenation Combined with Star and Reversal","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Catenation; Combined operations; State (computer science); Continuation; Star (game theory); Computer science; Algorithm; Mathematics; Political science; Chemistry; Programming language; Law","authors":[{"name":"Bo Cui","is_ca":true},{"name":"Yuan Gao","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005197979451632736,"gpt":0.2117304940349313,"spread":0.2065325145832985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117081,0.0003992005,0.0007818554,0.000873287,0.001209292,0.003984415,0.001268799,0.0009717927,0.01228694],"category_scores_gemma":[0.007273977,0.0003644561,0.001775544,0.0009994522,0.001935476,0.008350869,0.002674868,0.002338143,0.0006738437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001689593,"about_ca_system_score_gemma":0.001567879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001677707,"about_ca_topic_score_gemma":0.001622923,"domain_scores_codex":[0.9978053,0.0004039989,0.0001783662,0.0004383879,0.0006104112,0.0005634501],"domain_scores_gemma":[0.9892098,0.00682623,0.0007814751,0.001932659,0.000769911,0.0004799466],"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.001032433,0.0002474837,0.004303677,0.0003525288,0.00008816481,0.000477386,0.0006975338,0.07117444,0.01615309,0.8689237,0.00295884,0.03359065],"study_design_scores_gemma":[0.0000744166,0.0002058816,0.001540641,0.00002991504,0.0001052002,0.0003377841,0.00029488,0.2092962,0.02049787,0.7632724,0.004252835,0.00009200202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8291745,0.0002908724,0.1375906,0.001019456,0.00008082003,0.0001527983,0.0008301147,0.0006119871,0.03024888],"genre_scores_gemma":[0.9806681,0.0001235161,0.01464399,0.00005542322,0.00003375534,0.00008160737,0.0004616741,0.000100919,0.003831067],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01228694,"threshold_uncertainty_score":0.0411039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062744773","doi":"10.4204/eptcs.24.6","title":"Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Computability, Logic, AI 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":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Ergodic theory; Computable analysis; Computable number; Invariant measure; Invariant (physics); Dynamical systems theory; Pseudorandom number generator; Metric space; Computable function","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.003661521673900922,"gpt":0.2232164987631307,"spread":0.2195549770892298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004593161,0.0007438329,0.001229907,0.003097492,0.0009075796,0.003866038,0.001498968,0.001216762,0.002439017],"category_scores_gemma":[0.05028814,0.0006599447,0.0007779588,0.001637471,0.004536383,0.009859948,0.002805958,0.00220603,0.0002804194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002306594,"about_ca_system_score_gemma":0.0006835353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001197407,"about_ca_topic_score_gemma":0.0007252117,"domain_scores_codex":[0.9977468,0.0007539425,0.0001579533,0.0004912685,0.0005880387,0.0002620515],"domain_scores_gemma":[0.957096,0.03429205,0.002145104,0.002906538,0.002172208,0.001387978],"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.0005326638,0.00007447186,0.0136426,0.0002050246,0.00013947,0.0002651468,0.0009992116,0.1818249,0.006105638,0.7725601,0.0006293075,0.02302144],"study_design_scores_gemma":[0.0000376491,0.00007100413,0.002044015,0.00002687501,0.00002972166,0.0001170442,0.00009711957,0.5319431,0.004591948,0.4602467,0.000752277,0.00004258901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5857095,0.0006301913,0.407769,0.0005270867,0.00005454098,0.00006407533,0.0002246053,0.0006460929,0.004374952],"genre_scores_gemma":[0.9716784,0.0002052459,0.02706772,0.00003303258,0.00004922005,0.00005098418,0.0001233287,0.00009370265,0.0006984257],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004593161,"threshold_uncertainty_score":0.02429128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2563256558","doi":"10.4204/eptcs.236.6","title":"Picturing Indefinite Causal Structure","year":2017,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Commission; McGill University","keywords":"Causality (physics); Separable space; Equivalence (formal languages); Characterization (materials science); Causal structure; Diagrammatic reasoning; Order (exchange); Computer science; Generalization; Mathematics; Pure mathematics; Physics; Economics; Programming language","authors":[{"name":"Aleks Kissinger","is_ca":false},{"name":"Sander Uijlen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006052872662043915,"gpt":0.2495472309305121,"spread":0.2434943582684682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009734663,0.0004759516,0.0002804478,0.0007670248,0.001177022,0.002996405,0.0006965359,0.0009922255,0.02201178],"category_scores_gemma":[0.002433694,0.0003245822,0.0005471991,0.0007080784,0.003287466,0.005189403,0.001380816,0.002271203,0.002956691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195818,"about_ca_system_score_gemma":0.000642819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001088962,"about_ca_topic_score_gemma":0.0009706583,"domain_scores_codex":[0.999493,0.0001787826,0.00002413887,0.0001284605,0.0001151823,0.00006035584],"domain_scores_gemma":[0.998755,0.000504051,0.0001015316,0.0003755197,0.0001988298,0.00006504117],"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.00001191617,0.000002847524,0.00002007763,0.0000222149,0.000001712001,0.00004332303,0.0002219897,0.0005429238,0.0008665785,0.9949141,0.0006678774,0.002684475],"study_design_scores_gemma":[0.00001057641,0.00001781072,0.00008115526,0.00003037216,0.000009190673,0.00009256164,0.00009642722,0.006345188,0.002583401,0.937785,0.05293675,0.00001161509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02573659,0.0009986553,0.7103091,0.002863663,0.0009067068,0.00006786275,0.000820627,0.002817549,0.2554793],"genre_scores_gemma":[0.7724406,0.001328742,0.161133,0.0009836606,0.0004227761,0.0001931122,0.0007667746,0.0007555906,0.0619758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02201178,"threshold_uncertainty_score":0.07363677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388667449","doi":"10.4204/eptcs.394.18","title":"Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","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":"University of Waterloo","funders":"","keywords":"Controlled NOT gate; Qubit; Quantum circuit; Computer science; Quantum; Physics; Topology (electrical circuits); Quantum gate; Quantum error correction; Quantum mechanics; Electrical engineering; Engineering","authors":[{"name":"Arianne Meijer-van de Griend","is_ca":false},{"name":"Sarah Meng Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006984824673843871,"gpt":0.2344121889240587,"spread":0.2274273642502148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002680963,0.0003997603,0.0003620794,0.0004991381,0.0004202454,0.0005709725,0.0006515892,0.0002882086,0.003119479],"category_scores_gemma":[0.0008635897,0.000226044,0.0003862812,0.0006138646,0.0005568428,0.0009199029,0.0006848694,0.0005422296,0.000447515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006929141,"about_ca_system_score_gemma":0.0008184115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009661056,"about_ca_topic_score_gemma":0.002202995,"domain_scores_codex":[0.999729,0.00006531226,0.00002157731,0.00006047999,0.00008376484,0.00003983038],"domain_scores_gemma":[0.9996752,0.0001082461,0.00003396299,0.000116348,0.00005522167,0.00001114524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002755623,0.0001311069,0.0008140532,0.0004421366,0.00004997854,0.0001928196,0.0002345122,0.2352425,0.1016063,0.2873487,0.003545255,0.370117],"study_design_scores_gemma":[0.00004832368,0.0002358728,0.0003283471,0.00005558225,0.00004889731,0.0002114689,0.00006325997,0.7370437,0.1364056,0.1023752,0.02314246,0.00004124893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04205997,0.000188892,0.9496295,0.00007157289,0.00004833645,0.00005318816,0.00006192357,0.001727152,0.006159393],"genre_scores_gemma":[0.4075355,0.0001874874,0.5890136,0.00009468642,0.0000173303,0.0001219207,0.0001762983,0.0003973953,0.002455643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003119479,"threshold_uncertainty_score":0.01043564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2734725460","doi":"10.4204/eptcs.266.18","title":"The Category CNOT","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Commutative property; Vector space; Enriched category; Set (abstract data type); Algebra over a field; Category of groups; Closed category","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.009449337264278233,"gpt":0.2734722393144782,"spread":0.2640229020502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007838345,0.0004200379,0.0004431266,0.001905459,0.002694704,0.003353755,0.00106512,0.0006705406,0.006037856],"category_scores_gemma":[0.001299035,0.0002287499,0.0005935528,0.001147262,0.003391649,0.004306113,0.003791045,0.001443033,0.0007799802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001770681,"about_ca_system_score_gemma":0.001912644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004396891,"about_ca_topic_score_gemma":0.002494995,"domain_scores_codex":[0.9984263,0.0002192031,0.00008620254,0.000331337,0.0006557559,0.0002812305],"domain_scores_gemma":[0.9985086,0.0002759998,0.0001141011,0.0002425896,0.0006285957,0.0002300308],"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.000009597784,0.00000568908,0.0001770772,0.00001886547,0.00000294184,0.0000613681,0.0001559688,0.0002259406,0.0003712833,0.9952465,0.0006003774,0.003124432],"study_design_scores_gemma":[0.000009595507,0.00002573923,0.0006707707,0.0000372631,0.00001721492,0.0005922518,0.0002650371,0.005267685,0.002648931,0.9050227,0.08541236,0.00003038618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2380152,0.00169475,0.3973587,0.001671417,0.0009422142,0.0002299737,0.001759063,0.0009679649,0.3573607],"genre_scores_gemma":[0.913792,0.0007017513,0.04127381,0.0007641092,0.0002234945,0.0002639652,0.001724197,0.0002712738,0.04098532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006037856,"threshold_uncertainty_score":0.02019864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2219497026","doi":"10.4204/eptcs.185.2","title":"An Open Challenge Problem Repository for Systems Supporting Binders","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings 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":"McGill University; University of Ottawa","funders":"","keywords":"Computer science; Variety (cybernetics); Set (abstract data type); Field (mathematics); Syntax; Software engineering; Key (lock); Data science; Programming language; Artificial intelligence; Computer security","authors":[{"name":"Amy Felty","is_ca":true},{"name":"Alberto Momigliano","is_ca":true},{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02314822109730651,"gpt":0.2881608817737966,"spread":0.2650126606764901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04494229,0.001934375,0.004030517,0.01247248,0.005331022,0.01323924,0.01373128,0.005274842,0.03242897],"category_scores_gemma":[0.1030501,0.002526124,0.003587662,0.009299648,0.005032583,0.0346778,0.02533637,0.007777496,0.01616213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003777188,"about_ca_system_score_gemma":0.0101974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001275252,"about_ca_topic_score_gemma":0.001364772,"domain_scores_codex":[0.9536425,0.015207,0.0046077,0.004899834,0.01906199,0.002580951],"domain_scores_gemma":[0.8869311,0.03052105,0.006912024,0.05069222,0.01976901,0.005174557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007586072,0.0009979621,0.005653967,0.002261062,0.0001430827,0.0007495026,0.004027331,0.01432208,0.005120063,0.4527315,0.1317965,0.3814384],"study_design_scores_gemma":[0.0003450825,0.0004682954,0.001295162,0.001106341,0.0001417736,0.001235622,0.001235655,0.06572235,0.01248673,0.3707139,0.5448799,0.0003692339],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"dataset","genre_scores_codex":[0.01289062,0.001363816,0.8621885,0.005295734,0.0007924715,0.00166089,0.004428125,0.06495241,0.04642733],"genre_scores_gemma":[0.1005942,0.001159458,0.8317824,0.001424401,0.0009179334,0.001985784,0.01560411,0.01962258,0.02690905],"genre_candidate":"dataset","genre_consensus":null,"teacher_disagreement_score":0.04494229,"threshold_uncertainty_score":0.2376804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386095606","doi":"10.4204/eptcs.384.1","title":"Graphical CSS Code Transformation Using ZX Calculus","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Clarendon Fund; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Ministry of Colleges and Universities","keywords":"Transformation (genetics); Code (set theory); Computer science; Programming language; Calculus (dental); Mathematics; Algebra over a field; Arithmetic; Pure mathematics; Chemistry; Dentistry","authors":[{"name":"Jiaxin Huang","is_ca":true},{"name":"Sarah Meng Li","is_ca":true},{"name":"Lia Yeh","is_ca":true},{"name":"Aleks Kissinger","is_ca":true},{"name":"Michele Mosca","is_ca":true},{"name":"Michael Vasmer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01129253635800418,"gpt":0.2745351148492931,"spread":0.2632425784912889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491922,0.000395631,0.0002911746,0.0008787484,0.0006816504,0.001544843,0.0006668749,0.0006853343,0.009211989],"category_scores_gemma":[0.00176205,0.0002409685,0.0007986249,0.0005121256,0.001752036,0.002075411,0.001288823,0.001652577,0.002189452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008278985,"about_ca_system_score_gemma":0.0007358165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001043934,"about_ca_topic_score_gemma":0.0006911175,"domain_scores_codex":[0.9992864,0.0001396178,0.00004439061,0.0001322677,0.0002980354,0.00009933486],"domain_scores_gemma":[0.9995075,0.0001481814,0.0000424627,0.0001339484,0.0001289561,0.00003892997],"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.0000192537,0.00001443981,0.00005960125,0.0000283692,0.000004144661,0.00008744123,0.000191176,0.002648534,0.004978501,0.9783891,0.0008208192,0.01275861],"study_design_scores_gemma":[0.00002616888,0.00005147077,0.0001230894,0.00003431755,0.00001539198,0.0002084687,0.00009520895,0.03076514,0.01682409,0.9079524,0.04387401,0.00003010736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02374958,0.0002097139,0.9295597,0.0004302376,0.0002924123,0.000109891,0.0002075625,0.001544913,0.04389597],"genre_scores_gemma":[0.5104952,0.0007581326,0.4429524,0.0007407139,0.0002582393,0.000518095,0.000456269,0.001343435,0.04247759],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009211989,"threshold_uncertainty_score":0.03081715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2803006329","doi":"10.4204/eptcs.270.2","title":"Using Elm to Introduce Algebraic Thinking to K-8 Students","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Curriculum; Computer graphics; Syntax; Graphics; Domain (mathematical analysis); Focus (optics); Recursion (computer science); Inclusion (mineral)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01075330660325884,"gpt":0.3088138043659593,"spread":0.2980604977627005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001826734,0.001263124,0.0004976098,0.00103204,0.001761741,0.003546878,0.001430349,0.001524491,0.01955],"category_scores_gemma":[0.004043564,0.0004938723,0.0006772894,0.0004084788,0.002567735,0.003574393,0.005827124,0.004599873,0.007990924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003462058,"about_ca_system_score_gemma":0.00200375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001237972,"about_ca_topic_score_gemma":0.003797831,"domain_scores_codex":[0.998719,0.0004196963,0.00007094008,0.000179914,0.0003078398,0.0003026265],"domain_scores_gemma":[0.998061,0.0004676606,0.0001753542,0.0001176338,0.0003768841,0.0008014525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006380414,0.00459791,0.01991845,0.00166453,0.00003665618,0.004998537,0.1339824,0.002838123,0.04198644,0.1904765,0.2616497,0.3372128],"study_design_scores_gemma":[0.000088502,0.0009425348,0.005857594,0.0006892008,0.00002035115,0.002408982,0.02358062,0.002526802,0.01290751,0.03769407,0.9131799,0.0001038656],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4844199,0.002766307,0.1344868,0.03676802,0.00360709,0.001241262,0.001023165,0.007389303,0.3282982],"genre_scores_gemma":[0.5987764,0.003136508,0.1765143,0.009954397,0.0005020042,0.001410428,0.0008972173,0.00186479,0.2069439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01955,"threshold_uncertainty_score":0.06540126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056248271","doi":"10.4204/eptcs.122.1","title":"Formal Probabilistic Analysis of a Wireless Sensor Network for Forest Fire Detection","year":2013,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Energy Efficient Wireless Sensor Networks","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":"Concordia University","funders":"","keywords":"Wireless sensor network; Probabilistic logic; Scheduling (production processes); Fire detection; Disjoint sets; Probabilistic analysis of algorithms; Upper and lower bounds; Efficient energy use","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.004363880737275489,"gpt":0.2098156737022676,"spread":0.2054517929649921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004879338,0.0007381819,0.0004953523,0.001119317,0.0007355791,0.002030823,0.001493294,0.0009013166,0.001932358],"category_scores_gemma":[0.01431311,0.0005085887,0.001669863,0.0007602891,0.002888268,0.002751708,0.001207688,0.001476943,0.000339962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001977695,"about_ca_system_score_gemma":0.002359099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002075591,"about_ca_topic_score_gemma":0.001749926,"domain_scores_codex":[0.9956363,0.001526805,0.0002710501,0.0005153616,0.00177995,0.0002705336],"domain_scores_gemma":[0.9885315,0.008504977,0.001258619,0.0007434677,0.000832128,0.0001293422],"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.00006943638,0.0001025272,0.001767809,0.0002550504,0.00007333552,0.0004457592,0.0002679293,0.4388785,0.01146016,0.532236,0.0007782486,0.01366518],"study_design_scores_gemma":[0.00001851331,0.00005101852,0.0003732826,0.00003781235,0.00002913408,0.0001689439,0.00004130833,0.8584392,0.002925544,0.135434,0.002462078,0.00001914074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01122582,0.0001322394,0.9857864,0.0003120177,0.00002732922,0.00008324483,0.00007247316,0.0001087078,0.002251704],"genre_scores_gemma":[0.6076117,0.0007212811,0.3882003,0.0002911969,0.0001348871,0.000691818,0.0002636346,0.0001161527,0.001969011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004879338,"threshold_uncertainty_score":0.0258047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007252203","doi":"10.4204/eptcs.31.3","title":"L-systems in Geometric Modeling","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Geometric design; Context (archaeology); Parametric equation; Bézier curve; Geometric modeling; Subdivision; Parametric statistics; Interpretation (philosophy); Computer science; Parametric model; Mathematics; Algorithm; Geometry; Engineering","authors":[{"name":"Przemysław Prusinkiewicz","is_ca":true},{"name":"Mitra Shirmohammadi","is_ca":true},{"name":"Faramarz Samavati","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003667448773009969,"gpt":0.2219284354216459,"spread":0.2182609866486359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001660654,0.0007434319,0.0006040253,0.001525694,0.001141459,0.002806274,0.001094558,0.00135062,0.007528812],"category_scores_gemma":[0.00358036,0.0004703375,0.001369957,0.001195189,0.003551414,0.004322106,0.003811721,0.002343625,0.002088678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00154534,"about_ca_system_score_gemma":0.0007370903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001471812,"about_ca_topic_score_gemma":0.0009698772,"domain_scores_codex":[0.9982205,0.0006556335,0.0001464466,0.0003842376,0.0004574383,0.0001357191],"domain_scores_gemma":[0.9985978,0.0005349315,0.0001850987,0.0003554355,0.000243841,0.00008297936],"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.00000607625,0.000006635018,0.000114963,0.00003371272,0.000006424823,0.00005743803,0.0001604595,0.01166962,0.0006550311,0.9761896,0.0004889832,0.01061102],"study_design_scores_gemma":[0.000006873565,0.00003799063,0.0001003854,0.00003916587,0.00001070198,0.00008489523,0.00008445568,0.08084639,0.001102338,0.8991154,0.01854823,0.00002321263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008033771,0.0006176641,0.9770799,0.0005192855,0.00009670595,0.00003685869,0.00007911757,0.0002966622,0.01324001],"genre_scores_gemma":[0.5274233,0.001748784,0.4509231,0.00064554,0.0004619018,0.0003167268,0.0003518976,0.0002974996,0.01783131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007528812,"threshold_uncertainty_score":0.02518636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986858569","doi":"10.4204/eptcs.61.2","title":"Specification and Verification of Context-dependent Services","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Correctness; Formal verification; Formal methods; Formal specification; Model checking; Service (business); Automaton","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01316253735538987,"gpt":0.2424480778157749,"spread":0.229285540460385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005518098,0.0007359918,0.0006347544,0.001177857,0.0009643298,0.00272964,0.002031121,0.001906451,0.001463348],"category_scores_gemma":[0.0134571,0.001001056,0.001845826,0.0009738272,0.003008688,0.002527084,0.002255539,0.002030402,0.0005341211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503357,"about_ca_system_score_gemma":0.004741886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005826616,"about_ca_topic_score_gemma":0.004705158,"domain_scores_codex":[0.9898148,0.002844105,0.0009801259,0.0008309348,0.004933938,0.000596152],"domain_scores_gemma":[0.9929914,0.003547595,0.0005750756,0.00148431,0.001223997,0.0001776195],"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.0001642286,0.0001573007,0.001495676,0.0005679883,0.000125123,0.001354066,0.0009669563,0.1518257,0.0305259,0.7565054,0.001747782,0.05456395],"study_design_scores_gemma":[0.0001781769,0.0001198157,0.0005314057,0.0002233748,0.0001184569,0.0004925237,0.0002146557,0.6794486,0.06410652,0.2125468,0.04194333,0.00007631082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01794778,0.0003195596,0.9764615,0.0002363353,0.00008962461,0.0001978565,0.0001606339,0.00130603,0.003280672],"genre_scores_gemma":[0.3625903,0.0009509927,0.6299428,0.0002436772,0.00007307874,0.0007571523,0.000582928,0.0002995156,0.004559488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005826616,"threshold_uncertainty_score":0.02918279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055102535","doi":"10.4204/eptcs.13.6","title":"Verifying Real-Time Systems using Explicit-time Description Methods","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Process (computing); Modularity (biology); Rotation formalisms in three dimensions; Synchronization (alternating current); Model checking; Rendezvous; Semaphore; Asynchronous communication","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02040135599401856,"gpt":0.319022635246982,"spread":0.2986212792529634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005373893,0.001011808,0.0007284842,0.0009689475,0.0005060982,0.001833198,0.002197678,0.00100447,0.001686967],"category_scores_gemma":[0.01161528,0.0007720808,0.001584084,0.0007353409,0.001715291,0.003472593,0.001792329,0.001456638,0.0003640252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001112958,"about_ca_system_score_gemma":0.002119535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00199672,"about_ca_topic_score_gemma":0.00228912,"domain_scores_codex":[0.9935662,0.00291509,0.0006079838,0.0005702485,0.002060717,0.0002798722],"domain_scores_gemma":[0.9897465,0.006166962,0.0009159285,0.002269119,0.0008019786,0.00009962369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004491067,0.0002059282,0.002115487,0.0009277047,0.0002322326,0.0007413618,0.0008805409,0.4753841,0.02824291,0.3118301,0.001876367,0.1771142],"study_design_scores_gemma":[0.0002437299,0.0001051507,0.0002235263,0.0001223925,0.00009659256,0.0003071978,0.00005321021,0.8920337,0.03516083,0.05775357,0.01383588,0.00006428263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004291059,0.00008383895,0.9940822,0.00004011707,0.00001385978,0.00005080674,0.00003358194,0.0008928578,0.0005117517],"genre_scores_gemma":[0.2237857,0.0004381102,0.7725567,0.0001069589,0.00002775502,0.0003315852,0.0003401765,0.0003338789,0.002079112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005373893,"threshold_uncertainty_score":0.02842021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2581616143","doi":"10.4204/eptcs.95.16","title":"Symmetry constraints on temporal order in measurement-based quantum computation","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Randomness; Computation; Quantum; State (computer science); Symmetry (geometry); Quantum state; Outcome (game theory); Quantum operation; Transformation (genetics)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01242068531893349,"gpt":0.2494952600691535,"spread":0.23707457475022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004638342,0.0004591214,0.0006154024,0.0008191731,0.001501693,0.003387218,0.001452879,0.001009325,0.003982395],"category_scores_gemma":[0.01090479,0.000383502,0.001241394,0.001062965,0.004035873,0.006077462,0.002429473,0.002335856,0.0007563817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00157758,"about_ca_system_score_gemma":0.001600109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008786471,"about_ca_topic_score_gemma":0.0007033226,"domain_scores_codex":[0.9959915,0.001504672,0.0004266197,0.0005090192,0.001038694,0.0005294957],"domain_scores_gemma":[0.9893419,0.00446221,0.001312568,0.00317584,0.001114237,0.0005932802],"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.00006138999,0.00003309765,0.0001924054,0.00001909643,0.000005150666,0.000067141,0.0001483854,0.00458375,0.002172238,0.9890431,0.0001726126,0.003501528],"study_design_scores_gemma":[0.00002470752,0.00005196885,0.0001528751,0.00001096339,0.000008501759,0.00006319331,0.00005768469,0.04898449,0.003080328,0.9464879,0.001055931,0.00002134991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2091392,0.0004405385,0.7556173,0.001347855,0.0001626472,0.0002030997,0.0003404813,0.0003185103,0.03243047],"genre_scores_gemma":[0.8984917,0.0002671351,0.09743963,0.0001588748,0.0001312315,0.0002586717,0.0001944777,0.0001059684,0.002952221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004638342,"threshold_uncertainty_score":0.02453017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141280064","doi":"10.4204/eptcs.171.7","title":"Completely positive projections and biproducts","year":2014,"lang":"en","type":"preprint","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":5,"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":"Embedding; Equivalence (formal languages); Categorical variable; Pure mathematics; Quantum; Theoretical physics; Mathematics; Computer science; Algebra over a field; Discrete mathematics; Quantum mechanics; Physics; Artificial intelligence","authors":[{"name":"Chris Heunen","is_ca":false},{"name":"Aleks Kissinger","is_ca":false},{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007197205011977849,"gpt":0.2504117138744894,"spread":0.2432145088625115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00234334,0.0007786475,0.0005022647,0.001453104,0.001978175,0.004296178,0.0009625285,0.001113282,0.007232188],"category_scores_gemma":[0.003740412,0.0004743446,0.0007921786,0.001343147,0.008561577,0.006167872,0.005150236,0.003470052,0.00133832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001059066,"about_ca_system_score_gemma":0.001108829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005092735,"about_ca_topic_score_gemma":0.0002998655,"domain_scores_codex":[0.9971852,0.000936828,0.0001459092,0.0005407465,0.0008390835,0.0003522613],"domain_scores_gemma":[0.9971268,0.0008286174,0.0002806214,0.0006626354,0.0006527723,0.0004485895],"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.00000404842,0.000002901432,0.00001417013,0.000008829956,0.000001084286,0.0000149127,0.00005639389,0.00009415836,0.0001986446,0.9975626,0.0002468456,0.001795389],"study_design_scores_gemma":[0.00000475644,0.00001032296,0.00004282299,0.000008298196,0.000001723719,0.0000535338,0.00004330873,0.0006509054,0.0005096953,0.992537,0.006129871,0.000007852193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1556303,0.002596195,0.5371162,0.004147058,0.001372301,0.0001086214,0.0006925054,0.0009174268,0.2974194],"genre_scores_gemma":[0.900913,0.001255996,0.07138155,0.0008353146,0.0006419447,0.0001750602,0.000413043,0.0002403741,0.02414378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007232188,"threshold_uncertainty_score":0.02419406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997470409","doi":"10.4204/eptcs.17.6","title":"Virtual Machine Support for Many-Core Architectures: Decoupling Abstract from Concrete Concurrency Models","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings 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":"Queen's University","funders":"","keywords":"Concurrency; Non-lock concurrency control; Isolation (microbiology); Concurrent computing; Distributed concurrency control; Abstraction; Virtual machine; Multiversion concurrency control; Concurrent object-oriented programming; Set (abstract data type)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0126023249041503,"gpt":0.2592350687552572,"spread":0.2466327438511069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019544,0.0005467617,0.0007175007,0.0003943622,0.0007318248,0.0017989,0.001848452,0.0005908138,0.002296846],"category_scores_gemma":[0.008655631,0.0004791885,0.0004797169,0.0004624233,0.001206555,0.005563445,0.0016573,0.001585521,0.0002529433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006831618,"about_ca_system_score_gemma":0.000924771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006525649,"about_ca_topic_score_gemma":0.001183065,"domain_scores_codex":[0.9979445,0.0007749236,0.0001782902,0.0001750148,0.0007291769,0.0001980322],"domain_scores_gemma":[0.9924862,0.003759953,0.000384125,0.002578717,0.0005694058,0.0002214121],"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.002416233,0.0009027933,0.01137831,0.001196069,0.0001741684,0.0005875333,0.002129191,0.2775175,0.1675221,0.3241529,0.003460993,0.2085621],"study_design_scores_gemma":[0.0001192742,0.0004618081,0.0007838603,0.00007121284,0.00006446362,0.0001236164,0.000208754,0.8362111,0.06932911,0.08576474,0.006810644,0.00005138792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4779314,0.0005344072,0.5131815,0.0003400439,0.00006692381,0.0001980249,0.0000982046,0.002424837,0.005224638],"genre_scores_gemma":[0.8713135,0.0001510999,0.1272546,0.00005824115,0.00001215,0.0001540191,0.0001066918,0.0002074883,0.0007422631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002296846,"threshold_uncertainty_score":0.01033604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072635954","doi":"10.4204/eptcs.34.3","title":"Explicit Substitutions for Contextual Type Theory","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings 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":"McGill University","funders":"","keywords":"Soundness; Substitution (logic); Normalization (sociology); Type (biology); Type theory; Modal; Computer science; Type inference; Mathematics; Inference; Artificial intelligence; Programming language","authors":[{"name":"Andreas Abel","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01084458306697359,"gpt":0.2559854188274706,"spread":0.245140835760497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003072326,0.0008170662,0.0008224565,0.001233855,0.001889979,0.003157048,0.00151915,0.001329288,0.007970421],"category_scores_gemma":[0.005144282,0.0009983368,0.001196682,0.001666709,0.004317672,0.006343734,0.003700526,0.004241547,0.002269614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361144,"about_ca_system_score_gemma":0.002209147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002309532,"about_ca_topic_score_gemma":0.002779612,"domain_scores_codex":[0.9969767,0.001097867,0.000222715,0.000490164,0.0009370807,0.0002754319],"domain_scores_gemma":[0.9975607,0.0009166199,0.0001229311,0.0008128365,0.0004675446,0.0001192076],"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.00001081268,0.000006307439,0.00009440775,0.00006268123,0.000008303316,0.00004262557,0.0001990762,0.001148253,0.0007532393,0.9859272,0.0008387808,0.0109082],"study_design_scores_gemma":[0.00001705177,0.00001483378,0.00009766922,0.00009531924,0.00004510001,0.00008807831,0.00009470562,0.01116552,0.002023485,0.9356373,0.05069431,0.00002653013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005877197,0.001734701,0.9728246,0.0009167847,0.000522644,0.0000714402,0.0001594018,0.001127479,0.01676568],"genre_scores_gemma":[0.3051292,0.003476564,0.6723642,0.00126965,0.0009996297,0.0004064774,0.0004201826,0.001032273,0.0149019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007970421,"threshold_uncertainty_score":0.02666372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388652902","doi":"10.4204/eptcs.394.2","title":"Generators and Relations for 2-Qubit Clifford+T Operators","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","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":"Dalhousie University","funders":"","keywords":"Qubit; Mathematics; Computer science; Physics; Quantum; Quantum mechanics","authors":[{"name":"Xiaoning Bian","is_ca":true},{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005236406282705447,"gpt":0.2392558016829437,"spread":0.2340193954002383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333312,0.000668493,0.0004319509,0.001151601,0.001527182,0.002038765,0.0009717025,0.001236188,0.01609806],"category_scores_gemma":[0.001673202,0.0003379227,0.0008275061,0.0008883405,0.002269317,0.002609177,0.002004737,0.001904914,0.002578791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006823061,"about_ca_system_score_gemma":0.0008255359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006373613,"about_ca_topic_score_gemma":0.0005296198,"domain_scores_codex":[0.9991466,0.0002487792,0.00006539976,0.000129463,0.0002182253,0.0001915589],"domain_scores_gemma":[0.9994886,0.000191989,0.00007298911,0.00006629699,0.0001145868,0.00006539108],"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.00001172357,0.00001183098,0.00004626496,0.00001957863,0.000001427655,0.00009812205,0.0002473941,0.0002769382,0.0008282089,0.994451,0.001373872,0.002633505],"study_design_scores_gemma":[0.00003055397,0.00002883656,0.00006884768,0.00001290872,0.000002673619,0.0001168788,0.00007894735,0.002620758,0.001418728,0.9860199,0.009585428,0.00001565753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1598428,0.001892728,0.6012843,0.003046834,0.001736396,0.0007960633,0.001273456,0.0008965168,0.229231],"genre_scores_gemma":[0.8112444,0.0008473432,0.1465307,0.001225995,0.0005952117,0.001115455,0.0006352377,0.0004181405,0.03738753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01609806,"threshold_uncertainty_score":0.05385333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396945312","doi":"10.4204/eptcs.406.2","title":"Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits","year":2024,"lang":"en","type":"preprint","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Catalytic Cross-Coupling Reactions","field":"Chemistry","cited_by":4,"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":"Electronic circuit; Computer science; Mathematics; Engineering; Electrical engineering","authors":[{"name":"Andrew N. Glaudell","is_ca":false},{"name":"Neil J. Ross","is_ca":true},{"name":"John van de Wetering","is_ca":false},{"name":"L. T. Yeh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007500263343795225,"gpt":0.2688134216711506,"spread":0.2613131583273554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001933689,0.0002758708,0.000268973,0.0003107882,0.0003593008,0.0007697725,0.0005543874,0.0004664955,0.004469628],"category_scores_gemma":[0.0007459799,0.0001679089,0.0002820618,0.0003256419,0.0004919171,0.0008236791,0.0006084928,0.0004758062,0.0005103328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007289887,"about_ca_system_score_gemma":0.0004863813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000479809,"about_ca_topic_score_gemma":0.001077681,"domain_scores_codex":[0.9997222,0.00003543333,0.00001942496,0.00005973952,0.00009587661,0.00006735554],"domain_scores_gemma":[0.9998301,0.00004963684,0.00002548213,0.00004535362,0.00003354211,0.00001585168],"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.0001271164,0.00006669625,0.0002636168,0.0002146775,0.00001887857,0.0002344097,0.0001808171,0.03279607,0.04749168,0.8348785,0.003076453,0.08065107],"study_design_scores_gemma":[0.0001044065,0.0002803542,0.0004677555,0.0001275052,0.00003689786,0.0004340635,0.00009660894,0.4100281,0.1470703,0.4005887,0.04071018,0.00005510541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2756796,0.0009680817,0.6030496,0.0008101715,0.000511018,0.0001474855,0.0004305801,0.001271733,0.1171317],"genre_scores_gemma":[0.897659,0.0002897711,0.09438914,0.0002300386,0.00005265251,0.0001032148,0.0001889335,0.00006426477,0.007022983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004469628,"threshold_uncertainty_score":0.01495242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3200821764","doi":"10.4204/eptcs.343.2","title":"Generators and Relations for Real Stabilizer Operators","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","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":"Dalhousie University","funders":"","keywords":"Stabilizer (aeronautics); Set (abstract data type); Operator (biology); Hadamard transform; Pauli exclusion principle; Electronic circuit; Real number; Tensor (intrinsic definition)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.004367914828980769,"gpt":0.2321516839981695,"spread":0.2277837691691887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001459624,0.0006787258,0.0004242435,0.001216704,0.001321789,0.002307984,0.0007961967,0.0008965672,0.01217972],"category_scores_gemma":[0.002510166,0.0003918471,0.0007837539,0.0005076583,0.003724584,0.004126621,0.001591786,0.002288433,0.00223298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001271802,"about_ca_system_score_gemma":0.0007669916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006315645,"about_ca_topic_score_gemma":0.0005484457,"domain_scores_codex":[0.998453,0.0003517243,0.0001294457,0.0004207433,0.0004085228,0.0002364768],"domain_scores_gemma":[0.998731,0.0004019647,0.0001437717,0.0001825611,0.0004168989,0.0001237601],"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.000007515342,0.00000955602,0.00003572304,0.00001164003,0.000001349008,0.00003567136,0.000186379,0.0001889579,0.001244582,0.9953597,0.0004742657,0.002444614],"study_design_scores_gemma":[0.00001766438,0.00002566463,0.00004619242,0.000009244986,0.000003153047,0.00009225844,0.00006975717,0.003232884,0.00277125,0.9855596,0.008156417,0.00001607322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2091773,0.001009779,0.5954093,0.001940606,0.00107414,0.0004587032,0.0008113377,0.001354526,0.1887643],"genre_scores_gemma":[0.8349044,0.0006146316,0.1153161,0.0005223076,0.0005787122,0.000521647,0.0005534004,0.0004563309,0.04653236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01217972,"threshold_uncertainty_score":0.04074526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3174770175","doi":"10.4204/eptcs.343.11","title":"Generators and Relations for the Group On(Z[1/2])","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","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":"Dalhousie University","funders":"","keywords":"Combinatorics; Integer (computer science); Mathematics; Group (periodic table); Prime power; Toffoli gate; Dimension (graph theory); Order (exchange); Discrete mathematics; Root of unity; Prime (order theory); Quantum gate; Physics; Quantum computer; Quantum; Quantum mechanics","authors":[{"name":"Sarah Meng Li","is_ca":true},{"name":"Neil J. Ross","is_ca":true},{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004478205023977122,"gpt":0.2232835871599188,"spread":0.2188053821359417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107286,0.001120146,0.0004561987,0.001720673,0.001604783,0.002290526,0.001026886,0.0009589324,0.01812115],"category_scores_gemma":[0.001246403,0.0002750884,0.0007132187,0.0008862148,0.002491199,0.002661313,0.001704369,0.002296576,0.0055824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007431697,"about_ca_system_score_gemma":0.0007116097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006981279,"about_ca_topic_score_gemma":0.0005442659,"domain_scores_codex":[0.9993045,0.0001846203,0.00004890578,0.0001388125,0.0001625745,0.0001604293],"domain_scores_gemma":[0.9995551,0.0001195317,0.00007614459,0.00006816671,0.0001165116,0.00006460618],"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.00001732972,0.00001113356,0.00004089584,0.00002001323,0.000001643391,0.00005500057,0.0002227746,0.0001811287,0.0008637886,0.9882023,0.00271829,0.007665632],"study_design_scores_gemma":[0.00002103837,0.00004493308,0.0001441495,0.00002527871,0.000004581281,0.0001720942,0.0001284472,0.001418258,0.001345853,0.9232825,0.07338908,0.00002370344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07199103,0.003818924,0.5023608,0.003443589,0.003119215,0.0006306507,0.001761628,0.0009160411,0.4119582],"genre_scores_gemma":[0.5667415,0.002041928,0.3169813,0.002044711,0.001726207,0.001827268,0.002237517,0.0008788563,0.1055207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01812115,"threshold_uncertainty_score":0.06062132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388667510","doi":"10.4204/eptcs.394.17","title":"Symbolic Synthesis of Clifford Circuits and Beyond","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","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":"Dalhousie University; McGill University; Simon Fraser University","funders":"","keywords":"Electronic circuit; Computer science; Theoretical computer science; Engineering; Electrical engineering","authors":[{"name":"Matthew Amy","is_ca":true},{"name":"Owen Bennett-Gibbs","is_ca":true},{"name":"Neil J. Ross","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00466237897613747,"gpt":0.2245449037376794,"spread":0.219882524761542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102577,0.0006307473,0.0004613543,0.0005803696,0.0007103311,0.001287894,0.0009901267,0.0006649994,0.004842132],"category_scores_gemma":[0.00267367,0.0002617974,0.0006613132,0.0007115853,0.001719177,0.00211203,0.001244569,0.001319229,0.0006513405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009158458,"about_ca_system_score_gemma":0.0009720123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007247643,"about_ca_topic_score_gemma":0.001157078,"domain_scores_codex":[0.9993325,0.0001622366,0.00004694921,0.0001371152,0.0002296662,0.00009147294],"domain_scores_gemma":[0.9993235,0.0003585596,0.00003978845,0.0001722237,0.00008129788,0.00002474414],"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.0000753454,0.00003950805,0.0001399418,0.0001554598,0.00001550641,0.0001284498,0.0001364157,0.04754351,0.01158093,0.8571219,0.001457543,0.08160543],"study_design_scores_gemma":[0.00002764212,0.00004643829,0.00006222509,0.0000554708,0.00001722566,0.00008356509,0.00004431384,0.2192234,0.0257438,0.7389604,0.01571877,0.00001669255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02452794,0.0004272921,0.9513198,0.0004425442,0.0001196664,0.00008542126,0.0001204392,0.001262686,0.02169423],"genre_scores_gemma":[0.5937954,0.0005517591,0.3969568,0.0003188844,0.00006279304,0.0001834918,0.0003093728,0.0003342689,0.007487148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004842132,"threshold_uncertainty_score":0.01619858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3209644401","doi":"10.4204/eptcs.351.5","title":"A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","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":"Canadian Nautical Research Society","funders":"Conseil Régional, Île-de-France","keywords":"Mathematics; Finitary; Cartesian closed category; Type (biology); Homotopy; Algebra over a field; Pure mathematics; Closure (psychology); Type theory; Polynomial; Categorical variable; Functor; Generalization; Discrete mathematics","authors":[{"name":"Eric Finster","is_ca":false},{"name":"Samuel Mimram","is_ca":false},{"name":"Maxime Lucas","is_ca":false},{"name":"Thomas Seiller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01059184188387806,"gpt":0.2753249278970062,"spread":0.2647330860131281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001521733,0.0002564427,0.0003730982,0.001892298,0.001425493,0.00268254,0.0007522915,0.0006429536,0.005175414],"category_scores_gemma":[0.001255594,0.0002808406,0.000459563,0.001431226,0.003342001,0.003193256,0.002418591,0.001419859,0.001069954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007230231,"about_ca_system_score_gemma":0.001110794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003080415,"about_ca_topic_score_gemma":0.002141452,"domain_scores_codex":[0.9988403,0.0002389628,0.0001106263,0.0002479434,0.0003954134,0.0001667607],"domain_scores_gemma":[0.9987417,0.0003115778,0.00007164334,0.0002051398,0.0004727465,0.0001972142],"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.00001843585,0.000008549292,0.0005287104,0.00007233502,0.000005121859,0.0001363736,0.0009659715,0.0002503573,0.001738299,0.986798,0.0008194362,0.00865845],"study_design_scores_gemma":[0.0000135854,0.00006552914,0.003210832,0.00006114317,0.00002246125,0.001103977,0.001232046,0.004148838,0.003247533,0.9167936,0.07006495,0.00003538361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1665866,0.003078193,0.7357722,0.001563392,0.0005555867,0.0001636038,0.00153726,0.001252359,0.08949082],"genre_scores_gemma":[0.8753957,0.0008332051,0.100942,0.0005740779,0.0002818735,0.0001602627,0.00110391,0.0001707373,0.02053824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005175414,"threshold_uncertainty_score":0.01731348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977514759","doi":"10.4204/eptcs.35.1","title":"Optimizing Computation of Recovery Plans for BPEL Applications","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings 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":"University of Toronto","funders":"","keywords":"Liveness; Business Process Execution Language; Computer science; Correctness; Bounded function; Web service; Automaton; Finite-state machine; Computation; Property (philosophy); Distributed computing; Service (business); Model checking; Service-oriented architecture; Programming language; Theoretical computer science; Mathematics","authors":[{"name":"Jocelyn Simmonds","is_ca":true},{"name":"Shoham Ben-David","is_ca":true},{"name":"Marsha Chećhik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003878688703389407,"gpt":0.2373018440889445,"spread":0.2334231553855551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001777615,0.001034824,0.0006990673,0.00109172,0.0007419042,0.0009868715,0.001141031,0.0008543172,0.003365357],"category_scores_gemma":[0.006425347,0.0006414097,0.0007902473,0.0005510416,0.001063258,0.001241027,0.0009290897,0.001317501,0.0004489378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724294,"about_ca_system_score_gemma":0.002668317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01431369,"about_ca_topic_score_gemma":0.01725964,"domain_scores_codex":[0.998919,0.0002937156,0.00006332654,0.0001816005,0.000310536,0.0002317655],"domain_scores_gemma":[0.9960803,0.003015018,0.0002339884,0.0002138023,0.000334936,0.0001218046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003508258,0.0002004013,0.001950573,0.0001902254,0.00004594856,0.000181991,0.0001869824,0.9013934,0.006629697,0.00667006,0.0009991564,0.0812007],"study_design_scores_gemma":[0.00003508855,0.00004377242,0.0001274027,0.000005508221,0.00001278873,0.0000101118,0.00004007199,0.9939978,0.002684297,0.002815545,0.0002229522,0.00000473675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2885383,0.0003231047,0.6950658,0.000494506,0.00004541013,0.0003914134,0.0003554172,0.009956195,0.004829884],"genre_scores_gemma":[0.6010962,0.0001217106,0.3961764,0.00007032124,0.00001421896,0.0002083518,0.0005594622,0.0003765409,0.00137695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01431369,"threshold_uncertainty_score":0.02846074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011926166","doi":"10.4204/eptcs.45.5","title":"Untangling Typechecking of Intersections and Unions","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings 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":"McGill University","funders":"Carnegie Mellon University; National Science Foundation","keywords":"Soundness; Intersection (aeronautics); Term (time); Position (finance); Type (biology); Key (lock)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01475602053628695,"gpt":0.2361652184078919,"spread":0.2214091978716049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01436117,0.0009606155,0.001645924,0.002330683,0.002427344,0.004727705,0.00348259,0.001910462,0.005015436],"category_scores_gemma":[0.05594969,0.00233571,0.002572268,0.002535833,0.006752571,0.01657081,0.008985514,0.004743584,0.001698128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001907883,"about_ca_system_score_gemma":0.005074396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002736777,"about_ca_topic_score_gemma":0.003734595,"domain_scores_codex":[0.9806862,0.006040244,0.001814824,0.003626162,0.006019137,0.001813424],"domain_scores_gemma":[0.9362562,0.03418578,0.003287938,0.02043861,0.005082048,0.0007494212],"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.001214397,0.0002400224,0.0146814,0.001169587,0.0002324821,0.0009851669,0.002876995,0.02523021,0.02101035,0.5978273,0.008131177,0.3264009],"study_design_scores_gemma":[0.0001343977,0.00013267,0.001103752,0.0004018455,0.0003318564,0.0006008645,0.0004195777,0.1242177,0.1229942,0.7184741,0.03098646,0.0002026183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0427798,0.0003837146,0.9393445,0.0007680053,0.0002830705,0.000122821,0.0002741241,0.008681661,0.007362203],"genre_scores_gemma":[0.5731016,0.0004378279,0.4135188,0.00067735,0.0002300334,0.0002604568,0.0005099198,0.005257874,0.006006116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01436117,"threshold_uncertainty_score":0.07595003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1704961025","doi":"10.4204/eptcs.31","title":"Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems","year":2010,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","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":"Library science; Computer science; Operations research; Engineering","authors":[{"name":"Ian McQuillan","is_ca":false},{"name":"Giovanni Pighizzini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02232007085100891,"gpt":0.2888146064640826,"spread":0.2664945356130737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007000288,0.001280013,0.001413748,0.001927687,0.001426877,0.007258726,0.002024895,0.001731765,0.03411972],"category_scores_gemma":[0.01313834,0.0009952594,0.001823208,0.001509977,0.003105497,0.007968152,0.004264369,0.008731312,0.005507939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005535372,"about_ca_system_score_gemma":0.002633402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003323982,"about_ca_topic_score_gemma":0.004089095,"domain_scores_codex":[0.9949548,0.001701454,0.0004261716,0.0008747242,0.001753291,0.0002896214],"domain_scores_gemma":[0.9918901,0.00453814,0.0001835973,0.001514973,0.001427462,0.0004457789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002081958,0.0001511351,0.000636843,0.0007275174,0.0001646456,0.00023358,0.001151667,0.004446275,0.002102236,0.5269863,0.2706352,0.1925565],"study_design_scores_gemma":[0.00004368238,0.00004695123,0.000653266,0.0004379654,0.0000536428,0.0003555295,0.0001589775,0.007032934,0.001500912,0.4199394,0.5697296,0.00004703907],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01286393,0.09385046,0.6224842,0.07385124,0.02512893,0.0003008306,0.003300233,0.00154872,0.1666714],"genre_scores_gemma":[0.2418321,0.07843915,0.3253157,0.01042886,0.02255145,0.001001112,0.01315604,0.002490756,0.3047848],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.03411972,"threshold_uncertainty_score":0.1141419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}