{"meta":{"query_hash":"9d0a9cf466be","filters":{"venue":"Electronic Proceedings in Theoretical Computer Science"},"cohort_total":131,"direct_labels_cover":0,"predictions_cover":131,"exported":131,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9d0a9cf466be","api":"https://metacan.xera.ac/api/v1/cohort?venue=Electronic+Proceedings+in+Theoretical+Computer+Science"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science; Operations research; Engineering","score_opus":0.02232007085100891,"score_gpt":0.28881460646408263,"score_spread":0.26649453561307374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704961025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02372735,0.00038716404,0.89465266,0.0005349265,0.00681659,0.0018229032,0.000042832653,0.0003002803,0.07171529],"genre_scores_gemma":[0.8025776,0.000098364864,0.19581605,0.00019988099,0.0007524618,0.00014663108,0.0000103478205,0.0000524749,0.00034616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914774,0.000060766324,0.0013507967,0.0021330758,0.002495878,0.0024821023],"domain_scores_gemma":[0.99615055,0.00020078944,0.00094457914,0.0007090999,0.0016106878,0.00038428672],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0069413693,0.0008003882,0.0010404448,0.0014014572,0.0005227668,0.0009541129,0.008090923,0.00073185295,0.00007702224],"category_scores_gemma":[0.0005328782,0.0007301244,0.00019627136,0.003735989,0.006245657,0.0031432996,0.0020070625,0.0035145478,0.00022012378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098109995,0.00020880361,0.00001070299,0.00020780842,0.00001343873,0.000001028612,0.0007227926,0.00008630189,0.0005705213,0.9914713,0.0019465097,0.004662677],"study_design_scores_gemma":[0.0010380814,0.0025691155,0.0005374331,0.0016534086,0.000025625171,0.00028506696,0.00012545017,0.8076882,0.009954948,0.16482262,0.009439739,0.0018603456],"about_ca_topic_score_codex":0.000008416226,"about_ca_topic_score_gemma":0.0000010463656,"teacher_disagreement_score":0.82664865,"about_ca_system_score_codex":0.0010316803,"about_ca_system_score_gemma":0.0012378144,"threshold_uncertainty_score":0.999515},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01391705845651953,"score_gpt":0.2437346175284077,"score_spread":0.22981755907188817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824826039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12211642,0.00060405134,0.86495584,0.0014036355,0.000965594,0.0017253896,1.6450359e-7,0.00017449648,0.008054422],"genre_scores_gemma":[0.99704725,0.00000427661,0.002715687,0.000117660325,0.000043591688,0.000050913466,1.04330894e-7,0.0000065805893,0.000013924601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996994,0.000096919386,0.00058982533,0.0006461253,0.0008808204,0.0007922738],"domain_scores_gemma":[0.99876654,0.000095807285,0.00023650531,0.0004934254,0.00028389326,0.00012385692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048192106,0.0001849503,0.00035197832,0.00024281225,0.00011096771,0.00023097488,0.0033809945,0.0000859217,0.0000014296768],"category_scores_gemma":[0.00046437368,0.00012005701,0.00006286479,0.0027050148,0.0010775783,0.00061301055,0.00070451334,0.00036288486,0.000014125789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004973675,0.0000832249,0.0005686454,0.00024203515,0.0000023637517,0.0000010219046,0.0016232611,0.000066452914,0.00036934126,0.99654883,0.000009852532,0.00047999842],"study_design_scores_gemma":[0.00038175684,0.00027484944,0.00041807722,0.00017148565,0.0000038007786,0.00004835639,0.00008016672,0.30649343,0.0042330446,0.6876973,0.00001843569,0.00017929488],"about_ca_topic_score_codex":0.000013565008,"about_ca_topic_score_gemma":0.0000041376757,"teacher_disagreement_score":0.87493086,"about_ca_system_score_codex":0.00043057208,"about_ca_system_score_gemma":0.00044154466,"threshold_uncertainty_score":0.62827855},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010990381705972836,"score_gpt":0.26296657550797714,"score_spread":0.2519761938020043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1961267274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9128398,0.000036754333,0.085571386,0.00034536354,0.000026624375,0.00023121032,0.0000021979135,0.000021485619,0.0009251867],"genre_scores_gemma":[0.9988588,0.0000013025407,0.0009916603,0.00004498581,0.00006485872,0.000029701156,7.6305656e-7,0.0000048171537,0.0000031294633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987668,0.000012696346,0.00021633609,0.0003675192,0.00025110017,0.0003855961],"domain_scores_gemma":[0.99938244,0.000038019924,0.000102104386,0.00007769632,0.0002727761,0.00012698567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097396836,0.00010753298,0.00017286034,0.00007012524,0.000092100054,0.0000721559,0.00030421457,0.00003064511,0.00001193447],"category_scores_gemma":[0.000040665647,0.000087867214,0.000025230334,0.0004996335,0.00071261416,0.0001840909,0.00015154324,0.00021320835,0.0000018789415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022100781,0.000100694066,0.0039968058,0.0000052687687,0.0000028001484,4.6152397e-8,0.00031313716,0.0000026185915,0.0018480173,0.9902512,0.0000074734153,0.0034498542],"study_design_scores_gemma":[0.00027303884,0.00035981115,0.005132811,0.00002073098,0.0000047697185,0.0000043529403,0.00013225588,0.057308804,0.007409,0.929199,0.00003994151,0.00011552601],"about_ca_topic_score_codex":0.000012030965,"about_ca_topic_score_gemma":8.630829e-7,"teacher_disagreement_score":0.086018994,"about_ca_system_score_codex":0.00005035497,"about_ca_system_score_gemma":0.00015125226,"threshold_uncertainty_score":0.3583121},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013787653203243074,"score_gpt":0.2557944034789316,"score_spread":0.24200675027568855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964707275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058606204,0.00032528315,0.9335961,0.0033795168,0.0006404557,0.0005513324,0.000001021356,0.0003841674,0.0025159179],"genre_scores_gemma":[0.8931097,0.000021318743,0.10578585,0.00087118725,0.00008669771,0.00010356911,1.397167e-7,0.000012777717,0.000008812407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959944,0.000038043312,0.0004972695,0.0009880112,0.00069890684,0.0017834022],"domain_scores_gemma":[0.99811953,0.0007790917,0.00010609006,0.00048126368,0.0002932678,0.00022076422],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00411149,0.00027651634,0.00027973435,0.00019701892,0.0009718986,0.0008605607,0.0046542077,0.000078770194,0.000025991387],"category_scores_gemma":[0.00036542868,0.00018970566,0.000102794955,0.0013653118,0.0032475074,0.0012305839,0.0009185738,0.0003695397,0.000024398183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010311322,0.00007303542,0.000072283416,0.00001809917,0.00000480987,0.0000021139156,0.0016187677,0.000002189951,0.00020818377,0.9711426,0.000124576,0.026723063],"study_design_scores_gemma":[0.00014240421,0.00030296558,0.00018844244,0.00003627658,0.0000027567357,0.000039482307,0.000035592537,0.45447037,0.006285405,0.53809595,0.00022570966,0.00017462397],"about_ca_topic_score_codex":0.0000055935852,"about_ca_topic_score_gemma":8.028891e-7,"teacher_disagreement_score":0.8345035,"about_ca_system_score_codex":0.00024450026,"about_ca_system_score_gemma":0.00035688403,"threshold_uncertainty_score":0.9994651},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006249754356745859,"score_gpt":0.2532547907464555,"score_spread":0.24700503638970966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966076725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37489903,0.00004127393,0.6203756,0.0014428825,0.0004974168,0.0004896202,0.0000052909872,0.0003829516,0.0018659421],"genre_scores_gemma":[0.8810781,0.0000036439083,0.11821585,0.00046067254,0.00015638054,0.000047990998,0.0000010292034,0.000016996777,0.000019311976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996326,0.000021253587,0.0004003629,0.0011169285,0.00062305795,0.0015123846],"domain_scores_gemma":[0.99825525,0.00030844865,0.00013044215,0.00081433926,0.00024977958,0.00024175567],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032166557,0.00029261637,0.00032659157,0.00031995802,0.00038140785,0.0007035984,0.0055770613,0.00008983253,0.00001969063],"category_scores_gemma":[0.00054255355,0.00025600728,0.00009209058,0.0012209072,0.0027192943,0.0009312659,0.0013739981,0.000655103,0.000013045512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016200136,0.00007612072,0.00007172394,0.000021415848,0.0000033187584,0.0000050514464,0.00042058487,0.0000028130798,0.008724066,0.9739639,0.00008712539,0.01660766],"study_design_scores_gemma":[0.00044963422,0.00030725353,0.000524415,0.000021406204,0.0000028425143,0.00007450857,0.000011519867,0.28688186,0.014540321,0.6966116,0.0002968615,0.00027776457],"about_ca_topic_score_codex":0.0000041712633,"about_ca_topic_score_gemma":0.0000097754155,"teacher_disagreement_score":0.5061791,"about_ca_system_score_codex":0.00013116864,"about_ca_system_score_gemma":0.00032393445,"threshold_uncertainty_score":0.99999475},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.002605956503864343,"score_gpt":0.21704787553788799,"score_spread":0.21444191903402365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967571653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29696015,0.00007336809,0.6856353,0.0011146995,0.00019193625,0.00014910074,1.773804e-7,0.0004109047,0.015464357],"genre_scores_gemma":[0.95959115,0.000012162279,0.03923868,0.0009830659,0.00013892566,0.000013550996,2.4071173e-7,0.000012224483,0.000009999809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968207,0.00003496678,0.0003025438,0.00094860164,0.00060930464,0.0012839085],"domain_scores_gemma":[0.9990266,0.00015787152,0.0000839519,0.00043023835,0.000115924035,0.00018540745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032217843,0.00023111155,0.00025011617,0.00038657355,0.00022635904,0.0005740521,0.003697032,0.000071105314,0.000021047525],"category_scores_gemma":[0.00018587665,0.00019686432,0.00005984211,0.0017616488,0.0011633739,0.0010400724,0.0009998527,0.0004206399,0.00007330548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004855099,0.000038087437,0.00023703671,0.0000074038917,0.0000017935944,0.0000025031395,0.00028553364,0.0000063236484,0.0013149048,0.95649344,0.000030998177,0.041577138],"study_design_scores_gemma":[0.00025530654,0.00021707125,0.0009568033,0.0000316119,0.0000015770271,0.00006898239,0.000011482265,0.4480433,0.0059208153,0.5438238,0.00042397136,0.0002453089],"about_ca_topic_score_codex":0.0000034166778,"about_ca_topic_score_gemma":0.0000010223905,"teacher_disagreement_score":0.662631,"about_ca_system_score_codex":0.00021508339,"about_ca_system_score_gemma":0.00017237107,"threshold_uncertainty_score":0.8027894},"labels":[],"label_agreement":null},{"id":"W1969392070","doi":"10.4204/eptcs.122.7","title":"Formal Analysis of Soft Errors using Theorem Proving","year":2013,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Computer science; Random variable; Theoretical computer science; Algorithm; Electronic circuit; Gaussian; Mathematics; Statistics","score_opus":0.010720317880594793,"score_gpt":0.2705253148929311,"score_spread":0.2598049970123363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969392070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36338666,0.000022068314,0.63515127,0.00007649293,0.00009810745,0.0002490723,1.9815306e-7,0.00007815963,0.0009379913],"genre_scores_gemma":[0.6499077,0.000001839982,0.34996697,0.00007714816,0.000021640724,0.000016570555,2.0707138e-7,0.0000065652625,0.0000013562651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963087,0.000052791882,0.0006264917,0.0008354239,0.00085393543,0.0013226934],"domain_scores_gemma":[0.9984515,0.00012620687,0.00028954624,0.0004899143,0.0004823747,0.00016050485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043161833,0.00023396742,0.00041331895,0.0012523328,0.00025365746,0.0003694981,0.0032435174,0.00009092713,0.000030117224],"category_scores_gemma":[0.00036227828,0.00020185712,0.00012897054,0.007998836,0.0017596424,0.0037407058,0.0010403934,0.00040935792,0.0000073367155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054418233,0.000050290597,0.0009246806,0.000014138974,0.000023932334,3.1483086e-7,0.000816614,0.0009691475,0.004976147,0.9718285,0.0000011645088,0.020389587],"study_design_scores_gemma":[0.00011100068,0.00016426566,0.0036720277,0.000024005134,0.000028760105,0.000012143056,0.000029258967,0.83501565,0.012984108,0.14775386,0.000004029209,0.00020087621],"about_ca_topic_score_codex":0.000021059766,"about_ca_topic_score_gemma":0.0000011394565,"teacher_disagreement_score":0.8340465,"about_ca_system_score_codex":0.00038379003,"about_ca_system_score_gemma":0.0003546807,"threshold_uncertainty_score":0.8231495},"labels":[],"label_agreement":null},{"id":"W1973168763","doi":"10.4204/eptcs.31.14","title":"Ciliate Gene Unscrambling with Fewer Templates","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Alphabet; Set (abstract data type); Finite set; Object (grammar); Template; Turing machine; Formal language; Completeness (order theory)","score_opus":0.003014915257480152,"score_gpt":0.2085467797662993,"score_spread":0.20553186450881913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973168763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884507,0.00003689908,0.009707206,0.00015487925,0.00011030888,0.00015378257,0.0000012268528,0.000021934897,0.0013630546],"genre_scores_gemma":[0.99249417,0.000010523855,0.007057685,0.0002446454,0.00015901845,0.000007879175,0.000002635208,0.000009161428,0.000014284473],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840707,0.000006573205,0.00011964627,0.0005547213,0.00024871153,0.00066327397],"domain_scores_gemma":[0.9995115,0.000010675877,0.000041698317,0.00016438877,0.0001539596,0.00011776944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007497881,0.0001456646,0.00011283521,0.00008820336,0.00020943572,0.00011222208,0.00073315005,0.00009668104,0.000017490385],"category_scores_gemma":[0.00006671233,0.000120226265,0.000029533618,0.00044239996,0.0013721618,0.000020621168,0.0003047222,0.0003849876,0.000008005615],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010146003,0.000051960644,0.013238664,0.0000073277492,0.000008278272,0.0000032943026,0.000081967264,0.00001630816,0.5148735,0.47023752,0.000019902931,0.0013598338],"study_design_scores_gemma":[0.0007589646,0.0011391243,0.008438685,0.000021721155,0.0000096790545,0.000169892,0.000017239508,0.005624043,0.93614954,0.046522655,0.0006902228,0.00045822407],"about_ca_topic_score_codex":0.0000025049505,"about_ca_topic_score_gemma":0.000007863471,"teacher_disagreement_score":0.42371485,"about_ca_system_score_codex":0.000027149106,"about_ca_system_score_gemma":0.00019109197,"threshold_uncertainty_score":0.5055787},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.003878688703389407,"score_gpt":0.2373018440889445,"score_spread":0.2334231553855551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977514759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068622,0.00003265445,0.92842203,0.0006318594,0.0002470215,0.0005071843,0.0000019489075,0.000111881265,0.0014233903],"genre_scores_gemma":[0.7579815,0.000004315503,0.24155863,0.00027575454,0.00009794504,0.000071901704,0.000001364231,0.000007598155,0.0000010004013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977756,0.00000975471,0.00037061266,0.0007152845,0.00040777063,0.00072095625],"domain_scores_gemma":[0.9988819,0.00022189482,0.0001586956,0.0002738078,0.000343988,0.0001197579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012714047,0.0001738046,0.0002185708,0.00038923064,0.00023630421,0.00021101533,0.002222413,0.00008051353,0.0000024993367],"category_scores_gemma":[0.00002999873,0.00015777526,0.00006649485,0.0017231297,0.0005829478,0.00071456865,0.00042088018,0.00041121128,0.000003066182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015541753,0.000064874934,0.000062368315,0.000038697068,0.000004116059,1.7216718e-7,0.00084480486,0.0003829261,0.011328128,0.9539536,0.0000037730865,0.03330095],"study_design_scores_gemma":[0.00034484058,0.0003207147,0.00023170792,0.00003525633,0.000005080222,0.000022215268,0.000025734753,0.49909464,0.027654584,0.47173426,0.0003275525,0.00020343058],"about_ca_topic_score_codex":0.0000048398133,"about_ca_topic_score_gemma":0.000016308215,"teacher_disagreement_score":0.6893595,"about_ca_system_score_codex":0.00005883912,"about_ca_system_score_gemma":0.00025147252,"threshold_uncertainty_score":0.6433888},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Formal verification; Formal methods; Formal specification; Model checking; Service (business); Automaton","score_opus":0.01316253735538987,"score_gpt":0.24244807781577488,"score_spread":0.22928554046038502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986858569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22517794,0.0002277145,0.77013254,0.000088265035,0.0001555652,0.00026781464,3.019103e-7,0.00008963179,0.0038601956],"genre_scores_gemma":[0.78551465,0.000046701974,0.2143438,0.00005412105,0.000019288998,0.0000148581485,1.7398473e-7,0.000004869164,0.0000015542595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979466,0.00003152134,0.000389509,0.0006710012,0.00048197072,0.00047938808],"domain_scores_gemma":[0.9990429,0.000038557027,0.00018197743,0.00038468017,0.00025757725,0.00009425985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026930717,0.00014009821,0.00018530455,0.0002916334,0.00011446764,0.00011691897,0.001778926,0.00006264305,0.000008318293],"category_scores_gemma":[0.00006730847,0.00013003037,0.000027173985,0.0011040834,0.0011139478,0.0013688254,0.00038786404,0.00021883253,0.000006271933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015099678,0.000055767923,0.00065316755,0.000025259993,0.0000024627807,2.1771045e-7,0.0024433353,0.0000014083338,0.0029563173,0.92961067,5.091574e-7,0.0642358],"study_design_scores_gemma":[0.0003405502,0.0005160239,0.028814428,0.00006497462,0.000006328177,0.000040901145,0.00013939923,0.42057073,0.1572277,0.3919255,0.00007458643,0.00027886574],"about_ca_topic_score_codex":0.000011108527,"about_ca_topic_score_gemma":9.727144e-7,"teacher_disagreement_score":0.5603367,"about_ca_system_score_codex":0.00013365276,"about_ca_system_score_gemma":0.00009459034,"threshold_uncertainty_score":0.53024846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.012602324904150298,"score_gpt":0.2592350687552572,"score_spread":0.2466327438511069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997470409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17025757,0.00008621893,0.8256195,0.00019357789,0.0010386136,0.0006257469,0.0000036511922,0.00027110006,0.0019040297],"genre_scores_gemma":[0.9661516,0.0000066924213,0.033073395,0.00026864477,0.00037721786,0.00008145851,0.0000053177396,0.000023318456,0.000012374599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955202,0.000010768415,0.00061157765,0.0014421053,0.0007713043,0.0016440608],"domain_scores_gemma":[0.9982597,0.00037486257,0.00022324885,0.00049773813,0.00030385892,0.00034058111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026437547,0.00039655255,0.00044562639,0.00030329858,0.00041452394,0.0007561784,0.0037579979,0.00018787973,0.000033654876],"category_scores_gemma":[0.00023086493,0.00032867253,0.00013903157,0.00086269964,0.0014367584,0.0007838083,0.0007008446,0.0011110081,0.00001950015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023774004,0.000026971007,0.00019120869,0.000015236221,0.00000857563,0.000004484125,0.0009328018,0.000072684365,0.0038869902,0.96978736,0.000018887815,0.025031043],"study_design_scores_gemma":[0.000427111,0.00040077345,0.00009067423,0.000008612579,0.000004497051,0.000036309008,0.0000087892,0.5022068,0.003538705,0.49275133,0.00024914925,0.00027722324],"about_ca_topic_score_codex":0.000028197486,"about_ca_topic_score_gemma":0.000012621301,"teacher_disagreement_score":0.795894,"about_ca_system_score_codex":0.00013872063,"about_ca_system_score_gemma":0.00053673534,"threshold_uncertainty_score":0.99991655},"labels":[],"label_agreement":null},{"id":"W1997489826","doi":"10.4204/eptcs.31.5","title":"On the Complexity of the Evaluation of Transient Extensions of Boolean Functions","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Boolean function; Product term; Boolean circuit; Boolean algebra; Boolean expression; And-inverter graph; Transient (computer programming); Parity function; XOR gate; Circuit minimization for Boolean functions","score_opus":0.03914086889851467,"score_gpt":0.3038161356205675,"score_spread":0.2646752667220528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997489826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6877906,0.000010235365,0.3082966,0.0011383459,0.0004470641,0.00039618486,0.0000012024724,0.000015901871,0.0019039108],"genre_scores_gemma":[0.95976514,0.0000013505535,0.04012749,0.000066324625,0.000017418848,0.000017190701,1.1453203e-7,0.000003957864,0.0000010370273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973639,0.00011257851,0.0004444195,0.0003836893,0.0013268837,0.0003685164],"domain_scores_gemma":[0.9978804,0.00027623156,0.00027339906,0.0006445727,0.00087895297,0.00004647356],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008639907,0.00011647676,0.000177062,0.00016840614,0.00020965241,0.000035452176,0.0025331152,0.000052053725,0.000020891612],"category_scores_gemma":[0.00143805,0.00006851785,0.00008192401,0.0020346157,0.005654714,0.00029005756,0.00033614933,0.0005308989,0.0000012685952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009273319,0.00010248182,0.000041040214,0.000007216725,0.0000025278725,1.2326829e-8,0.00058383273,0.00016024841,0.03190015,0.9590391,0.000010497217,0.008143656],"study_design_scores_gemma":[0.00012714733,0.00018442578,0.010953502,0.00003423818,0.000007823762,0.0000055027026,0.000018268134,0.47526026,0.0947592,0.41858715,0.000007910986,0.000054566444],"about_ca_topic_score_codex":0.0000042693423,"about_ca_topic_score_gemma":0.000004121742,"teacher_disagreement_score":0.5404519,"about_ca_system_score_codex":0.000087577144,"about_ca_system_score_gemma":0.00040288357,"threshold_uncertainty_score":0.9970513},"labels":[],"label_agreement":null},{"id":"W2000822860","doi":"10.4204/eptcs.165.3","title":"USBcat - Towards an Intrusion Surveillance Toolset","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Computer science; Covert channel; Computer security; Covert; Malware; Adversary; Rootkit; Intrusion detection system; Operating system; Cloud computing; Cloud computing security; Security information and event management","score_opus":0.00460713100319494,"score_gpt":0.24741509778475695,"score_spread":0.24280796678156202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000822860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05884002,0.000020899939,0.9362105,0.00073009654,0.00031772742,0.00024907204,3.504416e-7,0.0008899009,0.0027414358],"genre_scores_gemma":[0.83609647,0.000014937674,0.16314535,0.0005508642,0.00014105738,0.000031499432,5.3780184e-7,0.000014435605,0.000004847154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960584,0.00006504388,0.00040746632,0.0013395768,0.0008288679,0.0013006503],"domain_scores_gemma":[0.99852717,0.000104108905,0.0001317678,0.0006335106,0.00033566082,0.00026781097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038017496,0.00029270962,0.0003090709,0.00045523798,0.00034668698,0.0005878752,0.0037478965,0.00010883754,0.000013570423],"category_scores_gemma":[0.000436269,0.00026573474,0.000052391835,0.002475707,0.0012328468,0.0031254608,0.001199848,0.0006032574,0.000018234528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009572988,0.00004277623,0.000099536664,0.0000059072886,8.065114e-7,0.0000010070511,0.00015838687,0.000023195393,0.0016329307,0.8258976,0.000013768035,0.17211454],"study_design_scores_gemma":[0.00022236558,0.0009105745,0.001258189,0.000024555951,8.343491e-7,0.00007529406,0.000004243317,0.37045532,0.031864174,0.5933338,0.001476124,0.00037451106],"about_ca_topic_score_codex":0.0000061659593,"about_ca_topic_score_gemma":0.0000048577704,"teacher_disagreement_score":0.7772564,"about_ca_system_score_codex":0.00045448443,"about_ca_system_score_gemma":0.00022482351,"threshold_uncertainty_score":0.9999795},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.003667448773009969,"score_gpt":0.22192843542164592,"score_spread":0.21826098664863594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007252203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5189245,0.00011067287,0.4785886,0.000037370864,0.0001203892,0.0001221864,1.1853655e-7,0.00028240524,0.0018137781],"genre_scores_gemma":[0.9855784,0.00003330583,0.014239003,0.00002514473,0.00007325537,0.00003195142,1.943965e-7,0.000017598226,0.0000011503063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979477,0.0000046226796,0.00032865693,0.00042865475,0.00037943077,0.0009109157],"domain_scores_gemma":[0.9995858,0.000050149756,0.000023066716,0.00014991457,0.00008192929,0.000109125416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176427,0.00016781618,0.00023997974,0.00091068156,0.00005707801,0.00012231497,0.00082260027,0.00008275354,0.000010160622],"category_scores_gemma":[0.00014327768,0.00015353212,0.000033162247,0.0045171487,0.00045454458,0.00045232798,0.00014619027,0.00096345897,0.000007915359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034658765,0.00002933352,0.00038283961,0.00001495595,0.0000019716733,0.0000020385178,0.00008413116,0.04222641,0.011532408,0.93469787,0.0000045749275,0.011020013],"study_design_scores_gemma":[0.00008388302,0.000042925258,0.000074571086,0.000016994956,0.0000013947906,0.000012023272,0.000004723249,0.8719109,0.0041243164,0.12350856,0.00004912881,0.00017058209],"about_ca_topic_score_codex":0.0000065382064,"about_ca_topic_score_gemma":0.0000038479675,"teacher_disagreement_score":0.8296845,"about_ca_system_score_codex":0.00027503647,"about_ca_system_score_gemma":0.000039311017,"threshold_uncertainty_score":0.6260858},"labels":[],"label_agreement":null},{"id":"W2008270704","doi":"10.4204/eptcs.85.3","title":"Measuring Progress of Probabilistic LTL Model Checking","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Measure (data warehouse); Probabilistic logic; Model checking; Set (abstract data type); Polynomial; Exponential function; Time complexity","score_opus":0.02659591590787949,"score_gpt":0.2787672107818356,"score_spread":0.25217129487395606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008270704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1555573,0.0001813429,0.8413832,0.00012047183,0.00021036198,0.00032122727,1.6008282e-7,0.00013763679,0.0020882885],"genre_scores_gemma":[0.6143105,0.0000031672491,0.38556743,0.000032194923,0.0000488791,0.00002896004,7.037234e-8,0.000007565797,0.0000012300311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645513,0.00003875488,0.00049464847,0.0006381893,0.00093694776,0.0014363026],"domain_scores_gemma":[0.99877715,0.00006748901,0.00020539296,0.0004166296,0.00033361424,0.00019973492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064041675,0.00021343274,0.00027207853,0.00036403316,0.00017901488,0.00018122728,0.0028061008,0.00007996358,0.0000025847278],"category_scores_gemma":[0.00046540704,0.00019156853,0.00005552606,0.002198677,0.0018647878,0.0023027179,0.0008883493,0.00043613874,0.0000051488214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008309251,0.00011762029,0.00092216267,0.000047506266,0.0000022858242,1.6441868e-7,0.0013596911,0.00027900928,0.0016297423,0.9788831,0.000001439066,0.016748995],"study_design_scores_gemma":[0.00012709151,0.0001127951,0.0009553538,0.00006592505,0.0000030953865,0.000024174678,0.0000069569805,0.7608346,0.031747185,0.20593144,0.000006080755,0.00018532517],"about_ca_topic_score_codex":7.2975746e-7,"about_ca_topic_score_gemma":1.1455411e-7,"teacher_disagreement_score":0.77295166,"about_ca_system_score_codex":0.00043295952,"about_ca_system_score_gemma":0.00030213146,"threshold_uncertainty_score":0.7811938},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.014756020536286945,"score_gpt":0.23616521840789187,"score_spread":0.22140919787160493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011926166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094338015,0.000119136654,0.89027315,0.00008165249,0.00027692437,0.00016408207,6.365893e-8,0.00012007453,0.014626925],"genre_scores_gemma":[0.98249114,0.000011976774,0.017395943,0.000047140347,0.000035378664,0.000007890522,6.126978e-8,0.00000533242,0.000005111196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842906,0.000016474312,0.000257876,0.00047937257,0.00025612657,0.00056109886],"domain_scores_gemma":[0.9994249,0.000045574732,0.00009053067,0.00018384417,0.00015674435,0.00009843616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001366431,0.00012197811,0.00016904718,0.00028122138,0.00016098257,0.000117206866,0.0010933037,0.00005205896,0.0000065661116],"category_scores_gemma":[0.00008053866,0.00010314602,0.000031726537,0.0013599453,0.0010763612,0.00055867934,0.00054699025,0.00026011912,0.0000032084542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003532287,0.000039128052,0.0014688785,0.000011030358,0.0000031963746,0.0000014079736,0.002781338,8.438098e-7,0.00043899074,0.9871463,0.0000017100531,0.008103656],"study_design_scores_gemma":[0.0002175095,0.0005047411,0.001678887,0.000026309386,0.000004719078,0.00010367248,0.00014429062,0.07700173,0.011482552,0.9085448,0.000083276835,0.00020756004],"about_ca_topic_score_codex":0.00002183975,"about_ca_topic_score_gemma":0.0000058030096,"teacher_disagreement_score":0.88815314,"about_ca_system_score_codex":0.00009703079,"about_ca_system_score_gemma":0.00012077766,"threshold_uncertainty_score":0.42061725},"labels":[],"label_agreement":null},{"id":"W2023568492","doi":"10.4204/eptcs.63.25","title":"Fife's Theorem for (7/3)-Powers","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automaton; Characterization (materials science); Binary number; Power (physics); Cellular automaton; Mathematics; Discrete mathematics; Finite-state machine; Computer science; Algebra over a field; Pure mathematics; Arithmetic; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.009762890928154543,"score_gpt":0.22897538780698515,"score_spread":0.2192124968788306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023568492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053880338,0.00009349964,0.92978704,0.0004583516,0.00045694812,0.00047707552,8.345862e-7,0.0003948057,0.014451084],"genre_scores_gemma":[0.89160025,0.000010500018,0.10757016,0.00063573406,0.00009360118,0.00006157918,3.1455775e-7,0.000016107682,0.000011754181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963723,0.000021820118,0.00038137197,0.0011136647,0.0005159248,0.001594934],"domain_scores_gemma":[0.99880576,0.00018195392,0.000112337504,0.00045610717,0.0002235171,0.00022034362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033960012,0.00027908076,0.00028212383,0.00037988543,0.0003151077,0.00033913497,0.0042529125,0.00009255108,0.000039343005],"category_scores_gemma":[0.00019329228,0.00023506997,0.000105559935,0.0016870203,0.0017520541,0.0013303423,0.0008045879,0.00035437007,0.000024093719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026415699,0.00008578274,0.00009295299,0.000010662541,0.0000043295113,0.000002477681,0.001504877,0.0000016283136,0.00059696904,0.97411895,0.000062025516,0.02349293],"study_design_scores_gemma":[0.0003614472,0.0004976527,0.00035739006,0.000032262942,0.000003221465,0.000043116102,0.000030285708,0.19345638,0.015452163,0.78921497,0.00025359684,0.00029750605],"about_ca_topic_score_codex":0.0000026207076,"about_ca_topic_score_gemma":6.095812e-7,"teacher_disagreement_score":0.8377199,"about_ca_system_score_codex":0.00023245066,"about_ca_system_score_gemma":0.00027785246,"threshold_uncertainty_score":0.95858747},"labels":[],"label_agreement":null},{"id":"W2028176049","doi":"10.4204/eptcs.139.3","title":"Actions and Events in Concurrent Systems Design","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Principle of compositionality; Morphism; Component (thermodynamics); Computer science; Context (archaeology); Set (abstract data type); Programming language; Theoretical computer science; Categorical variable; Component-based software engineering; Software system; Software; Artificial intelligence; Mathematics; Pure mathematics","score_opus":0.022314868517718706,"score_gpt":0.28312878246317674,"score_spread":0.26081391394545805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028176049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021922788,0.00015008407,0.9767037,0.00019397675,0.00044089276,0.00024827922,6.918537e-8,0.000207675,0.00013254356],"genre_scores_gemma":[0.80615634,0.00002286422,0.19370359,0.000039066275,0.000035899666,0.000033869255,4.6976545e-8,0.000006358671,0.0000019683382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767804,0.00008914707,0.00027524965,0.00072559045,0.0003677089,0.0008642392],"domain_scores_gemma":[0.9987964,0.0007269846,0.00006252296,0.00021042574,0.00008450013,0.00011914686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042079,0.00017976474,0.00024440145,0.00037165862,0.000120533645,0.00014485652,0.0013325115,0.000059803988,5.9708526e-7],"category_scores_gemma":[0.00093108934,0.0001630614,0.000018742385,0.0013693526,0.0006024981,0.00082796096,0.00054253446,0.00044117618,0.0000032039177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002747265,0.00002106445,0.00025584485,0.0000127906615,0.0000010488518,6.133245e-7,0.00023579097,0.0077753183,0.0003143603,0.9758043,0.0000021536407,0.01557393],"study_design_scores_gemma":[0.00023566574,0.00021432912,0.0014843093,0.000065285814,9.677434e-7,0.000040371637,0.000007273996,0.6865047,0.00094587926,0.31027266,0.00004583176,0.00018271615],"about_ca_topic_score_codex":0.000002014329,"about_ca_topic_score_gemma":3.8441382e-7,"teacher_disagreement_score":0.7842335,"about_ca_system_score_codex":0.00030767373,"about_ca_system_score_gemma":0.000109694585,"threshold_uncertainty_score":0.66494507},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005197979451632736,"score_gpt":0.21173049403493127,"score_spread":0.20653251458329855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029618677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85664177,0.000013903303,0.14167838,0.0008136101,0.00009722924,0.00018775943,7.135545e-7,0.00009448456,0.0004721262],"genre_scores_gemma":[0.94130033,0.000005915893,0.058537673,0.00012179972,0.000018479295,0.000006138125,3.50797e-7,0.0000067568653,0.000002545519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979643,0.000017206672,0.00025938565,0.0006052356,0.0005085904,0.0006452794],"domain_scores_gemma":[0.9991655,0.00009110605,0.0001220896,0.00025582392,0.00023320792,0.00013227902],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018636846,0.00016590873,0.0002262254,0.00023972426,0.00015232242,0.00021001087,0.0013732836,0.000043565982,0.0000068468153],"category_scores_gemma":[0.00006934484,0.00012718767,0.000020073165,0.0011682835,0.0037350617,0.0009086076,0.00051036687,0.00045353192,0.000001642722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003739704,0.000057504512,0.0005316274,0.000014708739,0.0000029257483,0.0000017297082,0.00061026576,0.0000029310554,0.011220737,0.9823444,0.0000041277176,0.0051716696],"study_design_scores_gemma":[0.00050122174,0.0007566999,0.0071442304,0.000029490016,0.0000023996297,0.00005288274,0.00001200992,0.31974393,0.024771625,0.64678586,0.000015528887,0.0001841356],"about_ca_topic_score_codex":0.000010147692,"about_ca_topic_score_gemma":0.000011804051,"teacher_disagreement_score":0.33555853,"about_ca_system_score_codex":0.00006354681,"about_ca_system_score_gemma":0.00020754438,"threshold_uncertainty_score":0.99897623},"labels":[],"label_agreement":null},{"id":"W2032558432","doi":"10.4204/eptcs.151.16","title":"Similarity density of the Thue-Morse word with overlap-free infinite binary words","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Mathematics; Generalization; Complement (music); Similarity (geometry); Binary number; Combinatorics; Measure (data warehouse); Natural number; Discrete mathematics; Arithmetic; Artificial intelligence; Computer science; Mathematical analysis; Data mining","score_opus":0.004434492969161611,"score_gpt":0.20834336137438172,"score_spread":0.2039088684052201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032558432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57473046,0.000026471484,0.42093864,0.001735548,0.0003148203,0.0003958313,6.588418e-7,0.00017105103,0.0016864813],"genre_scores_gemma":[0.94190794,0.0000056808976,0.057380553,0.0005562094,0.0001136049,0.000015212107,1.7339264e-7,0.000015137876,0.000005488109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479496,0.00013354671,0.00058168435,0.0014182188,0.0015864724,0.0014851188],"domain_scores_gemma":[0.9969198,0.000490683,0.00027944206,0.0015584539,0.0005290795,0.00022250455],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.004618558,0.00041151966,0.0005381208,0.00032995734,0.00043224613,0.00038267672,0.008274128,0.0001311055,0.0000068398053],"category_scores_gemma":[0.0007748944,0.00027675566,0.00013251633,0.0047306707,0.0045454456,0.0010070186,0.005160922,0.0010496207,0.0000050230237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038672177,0.00019187103,0.009485324,0.000025978668,0.0000066037537,0.0000028228692,0.00060254533,0.00023566715,0.00042857,0.97366154,0.000022412212,0.01529801],"study_design_scores_gemma":[0.00059143576,0.00072535046,0.041071787,0.000086685985,0.000008254582,0.00007389759,0.000013228393,0.49733767,0.0056591146,0.45400393,0.00006819181,0.0003604612],"about_ca_topic_score_codex":0.00001573145,"about_ca_topic_score_gemma":0.000019811625,"teacher_disagreement_score":0.5196576,"about_ca_system_score_codex":0.00040312554,"about_ca_system_score_gemma":0.00060592324,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W2034471623","doi":"10.4204/eptcs.77.5","title":"Initial Semantics for Strengthened Signatures","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Eesti Teadusfondi; McGill University; Villum Fonden","keywords":"Arity; Semantics (computer science); Syntax; Modular design; Signature (topology); Abstract syntax","score_opus":0.011148187978022245,"score_gpt":0.2668316497745944,"score_spread":0.25568346179657214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034471623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022147886,0.00031174987,0.9724099,0.00047735017,0.0009428001,0.00052226125,3.167062e-7,0.00024388687,0.0029438464],"genre_scores_gemma":[0.9730634,0.000006463803,0.026007663,0.0002898184,0.0005515002,0.00005704409,6.825704e-7,0.000013197934,0.000010214784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965682,0.000025420564,0.0003440096,0.00066094246,0.0005920976,0.0018093277],"domain_scores_gemma":[0.9989215,0.00019716911,0.00011356499,0.00028121984,0.00023527913,0.00025127854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002946155,0.00024157942,0.00026630447,0.00027123553,0.00032158257,0.0004928118,0.0022651213,0.00012114687,0.000006012774],"category_scores_gemma":[0.00023133603,0.00019608354,0.000083320534,0.0012347561,0.0008591959,0.0012728097,0.00056010863,0.00037937585,0.000013955208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010678623,0.00010424806,0.00029529913,0.000022070264,0.000004888806,7.4194895e-7,0.0009042351,0.000007283556,0.00034650858,0.98165464,0.000053308868,0.016596071],"study_design_scores_gemma":[0.00056491466,0.0006190708,0.00027489642,0.0000128508245,0.0000073212054,0.000047784793,0.000030103893,0.22148718,0.0115800435,0.7623421,0.0025969457,0.00043679733],"about_ca_topic_score_codex":0.0000020595005,"about_ca_topic_score_gemma":8.454175e-7,"teacher_disagreement_score":0.9509155,"about_ca_system_score_codex":0.00020227961,"about_ca_system_score_gemma":0.00021967542,"threshold_uncertainty_score":0.7996054},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Theoretical computer science; Mathematics; Algorithm","score_opus":0.006796178078751685,"score_gpt":0.24847129548516936,"score_spread":0.24167511740641767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044654785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079886265,0.000036411977,0.90978914,0.0032537945,0.000153347,0.00018900471,1.7960292e-7,0.00035507858,0.0063367574],"genre_scores_gemma":[0.8887738,0.000005797529,0.11046843,0.0006522094,0.00007776985,0.0000051209913,3.8795017e-7,0.0000047710573,0.000011703299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969963,0.000030259935,0.0003111952,0.00083926285,0.0007025775,0.0011203946],"domain_scores_gemma":[0.9992276,0.000049273658,0.000096931624,0.00028924274,0.00016349944,0.00017344861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022847936,0.00020447592,0.00021620252,0.00032912672,0.00031522344,0.00061170245,0.0023665521,0.00004301484,0.000009681764],"category_scores_gemma":[0.00011570282,0.00017855957,0.00004642914,0.0021340002,0.0008850008,0.0011212138,0.00035609293,0.0006035061,0.000025900554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004818851,0.00006316804,0.000077123266,0.000003616499,8.8529174e-7,0.0000019816196,0.00045102517,0.00008415743,0.0003622394,0.8934048,0.000016324919,0.10552989],"study_design_scores_gemma":[0.00015191568,0.00026622033,0.0020378907,0.000013752758,5.532814e-7,0.000026656795,0.0000018916792,0.51596147,0.0013935844,0.47994378,0.000063929314,0.00013834907],"about_ca_topic_score_codex":0.0000029970242,"about_ca_topic_score_gemma":4.551284e-7,"teacher_disagreement_score":0.80888754,"about_ca_system_score_codex":0.00023379414,"about_ca_system_score_gemma":0.00018061836,"threshold_uncertainty_score":0.72814476},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011333738878652974,"score_gpt":0.2871389603538102,"score_spread":0.27580522147515724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052351054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47222316,0.00018997787,0.47738406,0.030920144,0.00008186333,0.0007424469,0.0000022867973,0.000103445826,0.018352639],"genre_scores_gemma":[0.9871474,0.000007190982,0.0119831795,0.0006978287,0.000080402635,0.000012313462,5.1933966e-7,0.000003611677,0.00006756223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782133,0.000040778767,0.00018952125,0.00038401017,0.0009029154,0.00066146284],"domain_scores_gemma":[0.99919057,0.000076466305,0.000082542145,0.0000891568,0.0004226648,0.00013858383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017274431,0.00012678544,0.00016360292,0.00013749975,0.0005514898,0.00022062933,0.00083538,0.000068244306,0.00001340988],"category_scores_gemma":[0.0004834894,0.00008542499,0.000056733916,0.0016888687,0.0017673757,0.00064031634,0.00009463581,0.00024808472,0.0000015679329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029745614,0.00004035984,0.000036520014,0.0000015467854,0.0000022982192,2.5935208e-7,0.010649362,0.0057017365,0.00034364042,0.981305,0.000093303475,0.0017962538],"study_design_scores_gemma":[0.00017123377,0.00027667353,0.0007081314,0.00002955518,0.000007700465,0.0000030090857,0.0023457673,0.36652488,0.00037304405,0.62937444,0.000045876164,0.00013968891],"about_ca_topic_score_codex":0.00008155326,"about_ca_topic_score_gemma":0.000025449786,"teacher_disagreement_score":0.5149242,"about_ca_system_score_codex":0.0009178907,"about_ca_system_score_gemma":0.00057728746,"threshold_uncertainty_score":0.65119696},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02040135599401856,"score_gpt":0.319022635246982,"score_spread":0.29862127925296345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055102535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09468475,0.00009549349,0.900193,0.00014835541,0.00039267182,0.00041811028,2.0103589e-7,0.00042545973,0.0036419805],"genre_scores_gemma":[0.4617221,0.0000146722095,0.53805107,0.000082944876,0.000099215555,0.0000110147985,2.6326316e-7,0.000009945995,0.000008781411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953965,0.00020441909,0.00067508867,0.0012757862,0.0008788636,0.0015693764],"domain_scores_gemma":[0.9984178,0.00014498559,0.00025652046,0.00059269246,0.00034549736,0.0002425022],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009158017,0.0003459638,0.00044004174,0.0006377742,0.00046817865,0.0011323071,0.0031851123,0.00015666557,0.000009560172],"category_scores_gemma":[0.0003870013,0.0003307269,0.00007932509,0.003467491,0.000668012,0.003238748,0.000513279,0.00056630344,0.00004401069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000121405965,0.000045480625,0.000009242552,0.000009376062,0.0000022415745,0.0000015194483,0.0003580636,0.00025875657,0.17687804,0.799394,0.000008834569,0.023022268],"study_design_scores_gemma":[0.00018971495,0.000487673,0.00024055765,0.00009128092,0.000005488732,0.00012767699,0.000010603345,0.8653564,0.025421616,0.107676655,0.000045017037,0.00034734118],"about_ca_topic_score_codex":0.000008054637,"about_ca_topic_score_gemma":3.7724263e-8,"teacher_disagreement_score":0.86509764,"about_ca_system_score_codex":0.0011521043,"about_ca_system_score_gemma":0.0003303506,"threshold_uncertainty_score":0.99991447},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004363880737275489,"score_gpt":0.20981567370226756,"score_spread":0.20545179296499208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056248271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44659188,0.000027095364,0.552371,0.00013714068,0.00014815357,0.00047632007,4.7887903e-7,0.00009882383,0.00014905482],"genre_scores_gemma":[0.9509242,0.000008462789,0.04863543,0.00011273047,0.00012715888,0.00016868938,0.0000016171196,0.000016048083,0.000005635082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956542,0.000033737062,0.0006607639,0.0010694389,0.00070376863,0.0018780828],"domain_scores_gemma":[0.99795294,0.0004328638,0.00027647175,0.0004526084,0.00068701524,0.00019812258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019540174,0.00030025293,0.00054697646,0.0005629309,0.00035741625,0.0003715346,0.0022049835,0.00013817621,0.000007826328],"category_scores_gemma":[0.00016868551,0.00026579143,0.00020505562,0.007367231,0.0012602009,0.0012312398,0.00059005455,0.00036765035,0.000003585268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019674231,0.000083910476,0.0007086006,0.000026133454,0.00004191005,4.7454782e-7,0.00020602431,0.108904384,0.0007630333,0.8664415,0.000010153511,0.02279419],"study_design_scores_gemma":[0.0002839874,0.000483095,0.0038016932,0.000043615306,0.000051648178,0.000010384935,0.000009048726,0.9321788,0.0018526636,0.060985997,0.000013757913,0.0002853109],"about_ca_topic_score_codex":0.000024707568,"about_ca_topic_score_gemma":0.000035600195,"teacher_disagreement_score":0.82327443,"about_ca_system_score_codex":0.00033876378,"about_ca_system_score_gemma":0.00017279152,"threshold_uncertainty_score":0.99997944},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008343097245646705,"score_gpt":0.26167476808684015,"score_spread":0.25333167084119346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058755347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22471267,0.00001719251,0.7741082,0.00048583184,0.00015307796,0.00025870808,2.512211e-7,0.0000383806,0.00022573535],"genre_scores_gemma":[0.92056745,0.0000021805583,0.07920964,0.00014629122,0.000056831195,0.000011695451,5.291245e-7,0.0000046564005,7.3104985e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842227,0.000043666885,0.0003372047,0.00038001194,0.00039015466,0.00042670066],"domain_scores_gemma":[0.998857,0.00017000268,0.00022063171,0.00036422894,0.00034568168,0.00004246228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025435144,0.00010353711,0.00013513613,0.0001531471,0.0004602348,0.00018484535,0.0020746847,0.000055335233,0.0000017716866],"category_scores_gemma":[0.00023568851,0.00008482795,0.000062272695,0.0011231727,0.0006477663,0.00070623064,0.000469232,0.000201027,6.3318544e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056648164,0.000028236947,0.00008399124,0.000013528108,0.0000014131843,8.860317e-9,0.00035500526,0.0009863905,0.003843936,0.98939353,0.0000040051386,0.005284272],"study_design_scores_gemma":[0.000175323,0.00006131772,0.000690247,0.00003482326,0.0000023210464,0.0000075141525,0.0000054826924,0.61063904,0.009822079,0.37846842,0.00002931637,0.00006411481],"about_ca_topic_score_codex":0.0000030061422,"about_ca_topic_score_gemma":6.1327364e-7,"teacher_disagreement_score":0.6958548,"about_ca_system_score_codex":0.00018132488,"about_ca_system_score_gemma":0.00015777833,"threshold_uncertainty_score":0.3855315},"labels":[],"label_agreement":null},{"id":"W2061212999","doi":"10.4204/eptcs.31.17","title":"Operational State Complexity of Deterministic Unranked Tree Automata","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Tree (set theory); Tree automaton; Intersection (aeronautics); String (physics); State (computer science); Upper and lower bounds; Regular language; Time complexity","score_opus":0.00859781140142239,"score_gpt":0.2449642404551377,"score_spread":0.23636642905371533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061212999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6318951,0.000014461846,0.36354664,0.00084073696,0.0004088162,0.00024699725,0.000002607625,0.0002242972,0.002820351],"genre_scores_gemma":[0.92921597,0.000003832606,0.07042558,0.00025890436,0.00006409037,0.000014353825,9.0109944e-7,0.0000103312195,0.0000060644643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967659,0.000029447667,0.000525453,0.0008613959,0.0008184655,0.0009993209],"domain_scores_gemma":[0.9986825,0.00019111685,0.00015276458,0.0005077517,0.00027426105,0.00019162688],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026403116,0.00024487163,0.0003282412,0.0003436772,0.0002495948,0.00038890942,0.0037393803,0.000072093484,0.000036106027],"category_scores_gemma":[0.00023178787,0.00021244453,0.00006752757,0.0015453761,0.00434154,0.0010787777,0.0009827763,0.0006229508,0.000015523881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012598402,0.00011612828,0.00017912217,0.000013389126,0.0000032456965,0.0000034195837,0.00039612167,0.0000096144195,0.020330263,0.9580761,0.000012371782,0.02084763],"study_design_scores_gemma":[0.00030758075,0.00021078711,0.0033373497,0.000019869009,0.00000181936,0.00006431004,0.00000345079,0.4972716,0.017069433,0.4815019,0.000036562516,0.00017533684],"about_ca_topic_score_codex":0.0000059832996,"about_ca_topic_score_gemma":0.000009909456,"teacher_disagreement_score":0.49726197,"about_ca_system_score_codex":0.000102365935,"about_ca_system_score_gemma":0.00051580847,"threshold_uncertainty_score":0.9983681},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.003661521673900922,"score_gpt":0.2232164987631307,"score_spread":0.21955497708922977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062744773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899687,0.00015255157,0.30821073,0.00041604394,0.0004950731,0.00045354772,6.671087e-7,0.000056089415,0.00024659347],"genre_scores_gemma":[0.9794701,0.000026990987,0.02035882,0.000058327936,0.00006724099,0.0000053386643,2.5463282e-7,0.000011311119,0.0000016406009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956617,0.00011983329,0.000990626,0.0011023436,0.0009690871,0.0011564298],"domain_scores_gemma":[0.9975361,0.0009787587,0.00033176094,0.00055357174,0.00042426717,0.0001755116],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.006496115,0.0003225796,0.000692067,0.00046784952,0.00018682874,0.0002836848,0.003505723,0.00013519326,0.000007138921],"category_scores_gemma":[0.00045056,0.0002453997,0.00007814567,0.003029747,0.0042220624,0.0006329981,0.002001818,0.0010749936,0.0000020217637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003089362,0.00016695392,0.011226802,0.00008811188,0.00000605405,0.0000056359117,0.0009675708,0.0012957681,0.0036454268,0.97799724,0.00000311883,0.0045664166],"study_design_scores_gemma":[0.0007799601,0.0002828786,0.009174676,0.00010107934,0.000004035581,0.00017491348,0.000038764476,0.8799568,0.0022748495,0.106973514,0.000007185561,0.00023137248],"about_ca_topic_score_codex":0.000073993884,"about_ca_topic_score_gemma":0.000012646022,"teacher_disagreement_score":0.878661,"about_ca_system_score_codex":0.0001557636,"about_ca_system_score_gemma":0.00036236618,"threshold_uncertainty_score":0.9999998},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016288852295071904,"score_gpt":0.2676564201870438,"score_spread":0.2513675678919719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062936109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18010926,0.000033728284,0.81576055,0.00001947921,0.000238279,0.00028787923,6.387758e-7,0.00008911849,0.003461067],"genre_scores_gemma":[0.7645832,0.0000055753117,0.23532028,0.000029960604,0.000024584166,0.000027216483,3.2966162e-7,0.0000062881136,0.0000025883292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967919,0.000046394463,0.0006217754,0.0008936217,0.000746832,0.0008994491],"domain_scores_gemma":[0.9984715,0.00008892487,0.00025092645,0.0005801669,0.00045881662,0.00014967096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045359833,0.00020593239,0.000438714,0.0010404941,0.00012732265,0.00012813974,0.003444729,0.000058323905,0.000010334505],"category_scores_gemma":[0.0003307151,0.00018041651,0.00010108421,0.00659454,0.0016640434,0.0009987296,0.00063054444,0.0003369068,0.000008274697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012627254,0.00010077769,0.00071771804,0.000026971085,0.00002766436,0.0000014746967,0.0008720456,0.0004212881,0.0004852454,0.99407864,0.0000018761183,0.0032537016],"study_design_scores_gemma":[0.00012074818,0.00034969405,0.0043515167,0.000030901785,0.00004110813,0.00001811605,0.000011411695,0.9286829,0.009832373,0.056358214,0.00000787206,0.00019512666],"about_ca_topic_score_codex":0.000014805094,"about_ca_topic_score_gemma":5.6866907e-7,"teacher_disagreement_score":0.9377204,"about_ca_system_score_codex":0.00027951604,"about_ca_system_score_gemma":0.000269647,"threshold_uncertainty_score":0.7357172},"labels":[],"label_agreement":null},{"id":"W2066882107","doi":"10.4204/eptcs.115.1","title":"On a New Notion of Partial Refinement","year":2013,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Implementation; Computer science; Software implementation; Partial evaluation; Partial function; Software; Programming language; State (computer science); Theoretical computer science; Mathematics","score_opus":0.009488073523694195,"score_gpt":0.26036392529289676,"score_spread":0.2508758517692026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066882107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11856059,0.000014479501,0.87525177,0.0009279436,0.00023762042,0.00031334176,6.731887e-8,0.0000875321,0.0046066856],"genre_scores_gemma":[0.7383177,0.0000036486047,0.26138663,0.00020716999,0.000049639497,0.000022246473,1.07129374e-7,0.0000044812186,0.000008346317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747,0.000028076509,0.00039836793,0.00063661137,0.0007246582,0.0007422862],"domain_scores_gemma":[0.9990582,0.00007914954,0.00014426355,0.00035426844,0.00020985768,0.0001542948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403282,0.0001567444,0.00018538297,0.000312211,0.00010183488,0.00020504576,0.0019870433,0.00005796428,0.00004416084],"category_scores_gemma":[0.00031679086,0.00013365506,0.000041780535,0.0016620195,0.00069260085,0.0010656506,0.0004160312,0.00030501856,0.0000615581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008596659,0.00006450167,0.000030936102,0.0000065111,0.0000013635959,1.6590417e-7,0.00028869364,0.00005481608,0.0029467337,0.93878776,0.00006154719,0.057748385],"study_design_scores_gemma":[0.00022239785,0.0006795267,0.0011881604,0.000038257494,0.0000011997284,0.0000059507774,0.0000035984945,0.46097392,0.054238707,0.48246115,0.00005482128,0.00013229322],"about_ca_topic_score_codex":0.000012800114,"about_ca_topic_score_gemma":2.2322484e-7,"teacher_disagreement_score":0.6197572,"about_ca_system_score_codex":0.0002656094,"about_ca_system_score_gemma":0.00026733402,"threshold_uncertainty_score":0.5450295},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010844583066973591,"score_gpt":0.2559854188274706,"score_spread":0.24514083576049703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072635954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03832665,0.00007481485,0.953023,0.00042226966,0.0012592338,0.00055822596,2.657409e-7,0.00026649566,0.006069042],"genre_scores_gemma":[0.98174345,0.000004361799,0.017577874,0.00027182035,0.00027190795,0.000077990684,5.902337e-7,0.000010902271,0.000041079955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971203,0.000020844569,0.00032868944,0.0008731076,0.00044258617,0.0012144615],"domain_scores_gemma":[0.9986379,0.00024719193,0.00009565343,0.00038321613,0.00043446443,0.00020154126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003399029,0.00021902363,0.00024341635,0.00025604057,0.00045231465,0.0005702792,0.002710749,0.000118241354,0.000018374025],"category_scores_gemma":[0.0004746129,0.00017846914,0.00007441711,0.0015100158,0.001453462,0.0008425851,0.0004463952,0.00056780095,0.0000368256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017536951,0.00006678034,0.00014169635,0.000009426729,0.0000040063533,0.0000012746478,0.00051150494,0.000001956136,0.0033697728,0.9822531,0.0000432392,0.013579704],"study_design_scores_gemma":[0.00038305152,0.00046557724,0.00018241385,0.0000053111585,0.000003987667,0.0000597991,0.0000224899,0.06355185,0.005765568,0.92593074,0.003358515,0.00027071688],"about_ca_topic_score_codex":0.000004045221,"about_ca_topic_score_gemma":0.000009612428,"teacher_disagreement_score":0.94341683,"about_ca_system_score_codex":0.00012519817,"about_ca_system_score_gemma":0.0004592282,"threshold_uncertainty_score":0.72777605},"labels":[],"label_agreement":null},{"id":"W2076471571","doi":"10.4204/eptcs.90.9","title":"On the Parity Problem in One-Dimensional Cellular Automata","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Parity (physics); Mathematics; Cellular automaton; Existential quantification; RADIUS; Neighbourhood (mathematics); Combinatorics; Discrete mathematics; Computer science; Algorithm; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.009925712297043532,"score_gpt":0.22783236351567598,"score_spread":0.21790665121863245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076471571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6772078,0.00015507852,0.30389723,0.008430673,0.00021508533,0.00089579524,7.6931235e-7,0.00034576285,0.008851771],"genre_scores_gemma":[0.9801466,0.0000042667702,0.018983932,0.0006982898,0.00006858417,0.0000814017,6.4518935e-7,0.00000932862,0.00000695704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966605,0.00004618132,0.0003487767,0.000710223,0.00082728174,0.0014070374],"domain_scores_gemma":[0.99884665,0.00028888954,0.00008452415,0.0005160977,0.00008269232,0.00018112174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039735944,0.0002107997,0.00019747406,0.00025478064,0.00033271656,0.00032036952,0.0028670672,0.000072372946,0.00002656387],"category_scores_gemma":[0.00010624893,0.00015522487,0.000050010312,0.0023572484,0.0009706143,0.00089115114,0.0009927275,0.0006739151,0.0000918019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040792015,0.00031832562,0.00027528623,0.0000056386752,0.0000017596969,8.450016e-7,0.0003822583,0.000029639383,0.0024747448,0.99362856,0.00007303066,0.0028058114],"study_design_scores_gemma":[0.00022791974,0.000119578894,0.0021599056,0.00004826712,0.0000020536463,0.000019369978,0.000005370687,0.43059587,0.014430792,0.55192846,0.00023049083,0.00023191684],"about_ca_topic_score_codex":0.0000057721318,"about_ca_topic_score_gemma":0.0000013424777,"teacher_disagreement_score":0.4417001,"about_ca_system_score_codex":0.00032829738,"about_ca_system_score_gemma":0.00022252685,"threshold_uncertainty_score":0.63298863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033178358457577536,"score_gpt":0.25723290002645977,"score_spread":0.22405454156888222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076858065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013936672,0.0002060963,0.9710188,0.00008550623,0.0006997722,0.00034514704,1.5170252e-7,0.00032010762,0.01338774],"genre_scores_gemma":[0.9479357,0.00001071551,0.05153353,0.00031748778,0.000096016476,0.000020562855,2.1989517e-7,0.000013728325,0.000072046874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964846,0.000057092686,0.00040080582,0.0010397041,0.00058987725,0.0014279698],"domain_scores_gemma":[0.99875355,0.00009621146,0.00012497498,0.00042227306,0.00036294252,0.00024004832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036006807,0.0002790026,0.00029698867,0.0003101679,0.0002801332,0.00035448142,0.0035643382,0.00011477672,0.000042504886],"category_scores_gemma":[0.0002490026,0.00022263938,0.00006859221,0.0019205635,0.0018261945,0.0010072999,0.00092403096,0.00050855934,0.00012776715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002330804,0.0001369446,0.00046823497,0.0000087811195,0.0000062723016,0.0000084507665,0.0024507584,5.163644e-7,0.00041902586,0.9699094,0.000019683312,0.026548572],"study_design_scores_gemma":[0.0006242023,0.00089909334,0.0029272651,0.000014447503,0.000005240075,0.00010841693,0.000070539565,0.068656184,0.0054218457,0.9203873,0.0004129007,0.0004725196],"about_ca_topic_score_codex":0.000012647753,"about_ca_topic_score_gemma":0.0000047644885,"teacher_disagreement_score":0.933999,"about_ca_system_score_codex":0.00022296718,"about_ca_system_score_gemma":0.0003670716,"threshold_uncertainty_score":0.9078971},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.003445579069430531,"score_gpt":0.2273131135587382,"score_spread":0.22386753448930768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078639733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8094588,0.000018337128,0.18918563,0.00024456703,0.000013849826,0.00014673504,0.0000011969252,0.00000867144,0.00092221244],"genre_scores_gemma":[0.9988072,0.000005573732,0.0010881125,0.000026166075,0.00003495099,0.000031033953,0.0000018510035,0.000004075075,0.000001033265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991195,0.000008162887,0.0001904966,0.0002694892,0.00015318434,0.00025915785],"domain_scores_gemma":[0.9996007,0.00011395297,0.000049495153,0.000062556865,0.00013814545,0.000035119112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008128801,0.0000788795,0.00011496154,0.00009003891,0.000078784375,0.00006539205,0.00021899726,0.000014705858,0.000014801123],"category_scores_gemma":[0.00006199401,0.0000664986,0.000009009076,0.0006256656,0.00055939244,0.000197936,0.00008438467,0.00011086082,8.4403143e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004487323,0.00004382511,0.0032357238,0.000016692653,8.357233e-7,9.438997e-9,0.0003466721,0.000058446945,0.00048276977,0.993414,6.223627e-7,0.0023959288],"study_design_scores_gemma":[0.00010976648,0.000071948634,0.0011171655,0.00002491875,0.0000013786082,3.9156507e-7,0.000029627601,0.20739138,0.00353505,0.7876418,0.000014817114,0.00006175321],"about_ca_topic_score_codex":0.000008100106,"about_ca_topic_score_gemma":0.000002387984,"teacher_disagreement_score":0.20733294,"about_ca_system_score_codex":0.000026715285,"about_ca_system_score_gemma":0.00011308495,"threshold_uncertainty_score":0.27117342},"labels":[],"label_agreement":null},{"id":"W2091250089","doi":"10.4204/eptcs.139.2","title":"Automated Reasoning over Deontic Action Logics with Finite Vocabularies","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Action (physics); Coherence (philosophical gambling strategy); Accessibility relation; Normal modal logic; Non-monotonic logic; Description logic; Boolean algebra; Algebra over a field","score_opus":0.006135563503916793,"score_gpt":0.2358335286004227,"score_spread":0.22969796509650592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091250089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13383543,0.00006828258,0.857204,0.00031479562,0.0002643156,0.00021783232,1.2215277e-7,0.0009774495,0.0071177557],"genre_scores_gemma":[0.9549987,0.000013177123,0.044458114,0.00033691447,0.00013732287,0.000020388861,5.7149566e-7,0.000015821617,0.000019040455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962066,0.000056316076,0.00033260506,0.001138685,0.00078149984,0.0014843189],"domain_scores_gemma":[0.99861217,0.00025932494,0.00016552955,0.00040695793,0.00032487535,0.00023114093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002490953,0.00033615617,0.0003426628,0.00035560384,0.00051852263,0.000978015,0.002251177,0.00012688006,0.000011298053],"category_scores_gemma":[0.00056732586,0.00025327483,0.000056411896,0.0025451386,0.0016279081,0.0014833125,0.0006537649,0.00061794085,0.00002943207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022746128,0.00006443529,0.0015445221,0.00001687127,0.000005725868,0.0000041425296,0.0007087982,0.00019495451,0.0002640213,0.9885675,0.00003552628,0.008570757],"study_design_scores_gemma":[0.00045385133,0.0007387984,0.004506473,0.00008507052,0.000006826124,0.00008634095,0.000010722652,0.8386752,0.0023521765,0.15243503,0.0002953755,0.00035413948],"about_ca_topic_score_codex":0.000006495507,"about_ca_topic_score_gemma":0.000010021117,"teacher_disagreement_score":0.83848023,"about_ca_system_score_codex":0.0003748977,"about_ca_system_score_gemma":0.0003626613,"threshold_uncertainty_score":0.99999195},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.007612402115275471,"score_gpt":0.23058627530713172,"score_spread":0.22297387319185624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125182723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41489166,0.00034102093,0.57860756,0.0030305723,0.00044126707,0.00036455007,2.0932076e-7,0.00034558837,0.001977546],"genre_scores_gemma":[0.9576363,0.000012301285,0.041871235,0.00027958362,0.0001688923,0.00001505678,1.6934784e-7,0.0000102852855,0.0000061847036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680847,0.000023174409,0.0003024462,0.0010000714,0.0008036766,0.0010621734],"domain_scores_gemma":[0.9989719,0.000063089465,0.00009410515,0.00026580226,0.00026115542,0.0003439521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024598625,0.0002325048,0.00023021028,0.00033174007,0.00023160159,0.0007564992,0.001906934,0.000058647078,0.000001463691],"category_scores_gemma":[0.00015611545,0.00019253034,0.000029841769,0.0017547283,0.0011002494,0.0008486871,0.0011335772,0.0005038243,0.000009134086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043273653,0.000045055025,0.00037041114,0.0000106519,0.0000020786863,0.000005438448,0.001276558,0.00032111595,0.0001465785,0.9801153,0.000023675757,0.017678825],"study_design_scores_gemma":[0.00027984005,0.00035003264,0.00038187226,0.000035281562,9.285109e-7,0.00014302686,0.000006259727,0.5889209,0.000551502,0.40899593,0.0001684817,0.00016597057],"about_ca_topic_score_codex":0.0000051364154,"about_ca_topic_score_gemma":0.0000010274047,"teacher_disagreement_score":0.58859974,"about_ca_system_score_codex":0.0002143223,"about_ca_system_score_gemma":0.00035666933,"threshold_uncertainty_score":0.7851159},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007197205011977849,"score_gpt":0.25041171387448935,"score_spread":0.2432145088625115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141280064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5558485,0.00007273394,0.43439195,0.0022710632,0.000315437,0.0010496804,0.000020961585,0.00010241218,0.0059272847],"genre_scores_gemma":[0.9959552,0.000007425833,0.0033102154,0.00009495176,0.00041231705,0.00018789533,0.000008119102,0.000018706303,0.0000051495945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753207,0.000016789349,0.0002915382,0.0010921075,0.0003113158,0.00075616996],"domain_scores_gemma":[0.9991742,0.000057497127,0.00013939361,0.00025062665,0.00024105617,0.00013727235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010136337,0.0002774002,0.00030853707,0.00023665055,0.00034885816,0.0003835094,0.00076838495,0.00007396631,0.000029865634],"category_scores_gemma":[0.00002043546,0.0002587617,0.00005504328,0.0006287366,0.0011502028,0.00012572897,0.0012191309,0.0009937609,0.000009223446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004345698,0.000069622685,0.00014283803,0.000016824471,0.000008641768,1.0701181e-7,0.00020138425,0.0000117537675,0.00029439398,0.9943227,0.000040362233,0.004887007],"study_design_scores_gemma":[0.00012343569,0.00011075184,0.00033886198,0.000078099,0.00001225641,0.0000047161043,0.000016295808,0.1827175,0.0016025713,0.8145466,0.00019461538,0.00025433395],"about_ca_topic_score_codex":0.0000254009,"about_ca_topic_score_gemma":7.113925e-7,"teacher_disagreement_score":0.44010672,"about_ca_system_score_codex":0.00012332399,"about_ca_system_score_gemma":0.00033265745,"threshold_uncertainty_score":0.99998647},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013223714116252217,"score_gpt":0.3050697146368014,"score_spread":0.29184600052054915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145158997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03762836,0.000024534733,0.95986855,0.000469519,0.00014044793,0.0006267653,4.5754425e-7,0.00034222967,0.00089916046],"genre_scores_gemma":[0.48809147,0.0000014199644,0.51152414,0.0002840556,0.000052720323,0.000034669287,5.016699e-7,0.00000741167,0.000003636212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960464,0.000059186536,0.00048769696,0.0012871445,0.00073349447,0.0013860485],"domain_scores_gemma":[0.9985925,0.00009858051,0.00016526529,0.0005289553,0.00037938662,0.00023532298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007441346,0.00028188346,0.00030686412,0.00047550764,0.00040380558,0.00067283044,0.0032330004,0.000119407596,0.0000032999578],"category_scores_gemma":[0.0003032305,0.00026490507,0.00007928073,0.0019286852,0.00038371346,0.0018313074,0.00023984809,0.00039495222,0.000009578302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028023802,0.00012584927,0.0000020389418,0.000006024149,0.0000012877167,2.5479582e-7,0.00069344195,0.009448635,0.04874284,0.8851853,0.000009095104,0.05575719],"study_design_scores_gemma":[0.0002363388,0.00068393507,0.00007209963,0.000022209564,0.0000031965137,0.000018101691,0.0000050558247,0.66764235,0.037316762,0.29376492,0.000009954147,0.00022510941],"about_ca_topic_score_codex":7.883182e-7,"about_ca_topic_score_gemma":8.769245e-8,"teacher_disagreement_score":0.6581937,"about_ca_system_score_codex":0.0006106552,"about_ca_system_score_gemma":0.00029565563,"threshold_uncertainty_score":0.99998033},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009176382782976196,"score_gpt":0.24149565722583746,"score_spread":0.23231927444286127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152635269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5118445,0.00043142022,0.4791616,0.0013525444,0.001156752,0.0006377952,2.879847e-7,0.00029792264,0.0051171645],"genre_scores_gemma":[0.98233753,0.0000050710646,0.017215112,0.00019321684,0.000206227,0.000022512653,7.728904e-7,0.000009586655,0.000009954716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976054,0.00004873565,0.00027824493,0.0006239525,0.0005061167,0.0009375797],"domain_scores_gemma":[0.99900216,0.00013034436,0.000119949196,0.00021718722,0.00033397664,0.00019641276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021897794,0.00020771672,0.00020968023,0.00033265486,0.00027789787,0.0002967676,0.0009826676,0.00009989989,0.00000899998],"category_scores_gemma":[0.0002491609,0.00017409137,0.000030053847,0.0016115698,0.0011297746,0.001735657,0.00042586282,0.00035826702,0.00002500852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008645815,0.00007485404,0.008194267,0.000012724003,0.0000041403546,0.0000010171875,0.0009205444,0.0000027194226,0.0003530888,0.9732361,0.000021130285,0.017170759],"study_design_scores_gemma":[0.00068582356,0.00073494285,0.045497127,0.00002849694,0.000010965414,0.00013331088,0.00006067714,0.094847314,0.014540903,0.84151965,0.0012967854,0.0006440267],"about_ca_topic_score_codex":0.0000050665576,"about_ca_topic_score_gemma":0.0000011613326,"teacher_disagreement_score":0.47049302,"about_ca_system_score_codex":0.00024804732,"about_ca_system_score_gemma":0.00028169854,"threshold_uncertainty_score":0.709924},"labels":[],"label_agreement":null},{"id":"W2152844281","doi":"10.4204/eptcs.170.6","title":"Simple Balanced Binary Search Trees","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ternary search tree; Weight-balanced tree; Binary search tree; Simple (philosophy); Binary number; Optimal binary search tree; Implementation; Basis (linear algebra); Code (set theory)","score_opus":0.005834959949034589,"score_gpt":0.24722204912693854,"score_spread":0.24138708917790394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152844281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12859759,0.000051319934,0.8672216,0.0006859798,0.00019349217,0.00017735525,5.212413e-7,0.00024196427,0.002830172],"genre_scores_gemma":[0.9556821,0.000014777033,0.04369137,0.00041528748,0.00016281662,0.000013966583,0.0000011473883,0.000010524756,0.00000799265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962009,0.000044018874,0.00031653274,0.0011143455,0.000899336,0.0014248188],"domain_scores_gemma":[0.9988138,0.00016060131,0.00006430493,0.0005204647,0.0001891139,0.00025173204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027128523,0.00023452308,0.0002652857,0.00035309943,0.00039519268,0.0005964268,0.003931891,0.000074799864,0.000019368757],"category_scores_gemma":[0.00013084181,0.0001918762,0.000052023945,0.0021054808,0.0011268609,0.0015025462,0.0019380068,0.00052695564,0.000040924402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008832041,0.00006146005,0.0004090373,0.0000065266927,0.0000014240076,0.0000021155893,0.00019084576,0.00008044494,0.0033446148,0.9599571,0.000084879546,0.03585267],"study_design_scores_gemma":[0.000295468,0.00042993645,0.00311137,0.000029433051,0.00000103205,0.000021925343,0.0000055151677,0.7829113,0.004240319,0.20811643,0.00061274326,0.00022455759],"about_ca_topic_score_codex":0.0000067779383,"about_ca_topic_score_gemma":0.0000011780027,"teacher_disagreement_score":0.82708454,"about_ca_system_score_codex":0.00020804102,"about_ca_system_score_gemma":0.00022404034,"threshold_uncertainty_score":0.7824484},"labels":[],"label_agreement":null},{"id":"W2158734104","doi":"10.4204/eptcs.71.6","title":"An Improved Implementation and Abstract Interface for Hybrid","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Interface (matter); HOL; Mathematical proof; De Bruijn sequence; Proof assistant; Programming language; Theoretical computer science; Set (abstract data type); Syntax; Hybrid system; Object (grammar); Abstract syntax; Representation (politics); Mathematics; Artificial intelligence; Semantics (computer science); Discrete mathematics","score_opus":0.013775314963967005,"score_gpt":0.28105117106918526,"score_spread":0.26727585610521826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158734104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118733905,0.00005936382,0.8793495,0.00008927096,0.00020690913,0.00051460427,3.0007746e-7,0.0001379477,0.0009081415],"genre_scores_gemma":[0.9683036,0.000005650529,0.03145768,0.000096127296,0.00006770121,0.000057381352,5.160336e-7,0.00000893689,0.000002404837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777293,0.000011768644,0.00030206327,0.0008002461,0.00024122959,0.0008717656],"domain_scores_gemma":[0.9992834,0.00004188727,0.00011073714,0.0002230435,0.00017339368,0.00016755711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020265891,0.00017581765,0.00017590339,0.00017819215,0.00021364648,0.0004530164,0.0014521901,0.00004112217,0.000009630826],"category_scores_gemma":[0.000032559692,0.00014846135,0.000032608463,0.00044067693,0.00061422965,0.0013764075,0.00028852175,0.00019130696,0.0000032034945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013902446,0.000052262032,0.0002629755,0.000014852314,0.0000028249108,6.9095483e-7,0.0013857114,3.4783858e-7,0.0019549937,0.9269404,0.0000066380685,0.069364436],"study_design_scores_gemma":[0.00057204266,0.0017758776,0.0015741416,0.000006102182,0.0000042899023,0.00006228848,0.00011750638,0.18859404,0.054544672,0.7523117,0.00013441077,0.00030291843],"about_ca_topic_score_codex":0.000019956773,"about_ca_topic_score_gemma":0.000005484245,"teacher_disagreement_score":0.8495697,"about_ca_system_score_codex":0.00012676323,"about_ca_system_score_gemma":0.0001471082,"threshold_uncertainty_score":0.60540783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0424867910284814,"score_gpt":0.296455703992082,"score_spread":0.2539689129636006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216433683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4935545,0.00004448386,0.50114405,0.00016215081,0.00032237289,0.0004685842,7.770441e-8,0.00018554371,0.0041182428],"genre_scores_gemma":[0.9943139,3.8950276e-7,0.0053603845,0.0001488118,0.00013360051,0.000020921554,1.0820959e-7,0.00000899305,0.000012908715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693155,0.00007356777,0.0003677019,0.0009069991,0.0007770518,0.0009431421],"domain_scores_gemma":[0.99883235,0.00012609664,0.00010397296,0.0003252994,0.00031789418,0.00029441787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003222834,0.00022473007,0.00026872463,0.00030779984,0.00033729462,0.00058077637,0.001472108,0.00008242244,0.000004808972],"category_scores_gemma":[0.00030025054,0.00017252096,0.000046842342,0.0018366174,0.0008678789,0.0007181728,0.0006198444,0.0005010622,0.000049733593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011565839,0.00028728583,0.0014438813,0.000002004025,0.000005148423,0.00029786356,0.00341453,0.00009208766,0.00002868244,0.99153423,0.000016464302,0.0028662684],"study_design_scores_gemma":[0.0010879586,0.003610403,0.00020406324,0.000011008238,0.000010299336,0.0042719203,0.000957813,0.5443816,0.00021400797,0.4446468,0.00016504167,0.00043904845],"about_ca_topic_score_codex":0.00003033825,"about_ca_topic_score_gemma":0.0000066007215,"teacher_disagreement_score":0.5468874,"about_ca_system_score_codex":0.000480053,"about_ca_system_score_gemma":0.00046252547,"threshold_uncertainty_score":0.70352006},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023148221097306514,"score_gpt":0.2881608817737966,"score_spread":0.2650126606764901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219497026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008206698,0.00022035558,0.97113603,0.0005694878,0.00092720636,0.001938712,2.1335255e-7,0.0003646277,0.01663668],"genre_scores_gemma":[0.9755665,0.000003029329,0.023750424,0.000101420716,0.00026645817,0.00025619962,8.980799e-7,0.000019899458,0.00003514067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995534,0.000062825035,0.0006204183,0.0013767611,0.00078888336,0.0016170987],"domain_scores_gemma":[0.9980453,0.00008222948,0.00028870732,0.00051706773,0.000589781,0.00047687438],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.007910719,0.00027754795,0.00039091558,0.0002684114,0.00042321865,0.0026942508,0.0062401127,0.00012474073,8.2105555e-7],"category_scores_gemma":[0.0001356328,0.00023149682,0.000048849823,0.0012076388,0.000767962,0.002609682,0.0011342851,0.00034871922,0.000007818887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018480529,0.00014300452,0.00020826476,0.00004257312,0.0000054208385,0.000005639519,0.0018935462,0.00006613986,0.0002640719,0.9913339,0.00008286806,0.0059361183],"study_design_scores_gemma":[0.0006904205,0.0023852196,0.000022005031,0.000023531753,0.0000043593504,0.0001327252,0.00021418063,0.47308448,0.0010791427,0.52078646,0.001202403,0.0003750951],"about_ca_topic_score_codex":0.000042953907,"about_ca_topic_score_gemma":0.000003754184,"teacher_disagreement_score":0.96735984,"about_ca_system_score_codex":0.0005256459,"about_ca_system_score_gemma":0.000985416,"threshold_uncertainty_score":0.9991366},"labels":[],"label_agreement":null},{"id":"W2259714137","doi":"10.4204/eptcs.184.6","title":"Using Indexed and Synchronous Events to Model and Validate Cyber-Physical Systems","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Liveness; Event (particle physics); Semantics (computer science); Search engine indexing; Construct (python library); State (computer science); Syntax; Model checking; Programming language; Real-time computing; Information retrieval; Artificial intelligence","score_opus":0.02960301789718997,"score_gpt":0.3100154273053389,"score_spread":0.28041240940814893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259714137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45699033,0.00004090926,0.54228127,0.00009985257,0.00010774428,0.00021627503,2.2012794e-7,0.000058607402,0.00020481186],"genre_scores_gemma":[0.717749,0.0000033404422,0.28208444,0.000088831854,0.000049594026,0.000015129668,7.022077e-8,0.0000080063355,0.0000015643303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722785,0.00004800505,0.00028619144,0.0009003345,0.00066758343,0.00087002746],"domain_scores_gemma":[0.9989265,0.000051735205,0.000088197296,0.00027800183,0.00023278485,0.00042274015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031709152,0.00021321511,0.00027654585,0.0003051479,0.0001853864,0.000491662,0.0012947149,0.000065129716,1.5062149e-7],"category_scores_gemma":[0.00024646314,0.00019275055,0.000018367815,0.0012939355,0.00071799575,0.0013325085,0.0012294209,0.00031807937,0.0000036341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012318274,0.00003549406,0.0001668472,0.000014041558,0.0000020979874,8.9009404e-7,0.0016192954,0.0030651507,0.0022638263,0.9885815,0.0000026692398,0.004235904],"study_design_scores_gemma":[0.0002097888,0.0002606366,0.00017238197,0.000044993452,0.0000033068015,0.00008817207,0.000018063032,0.817455,0.0018576345,0.17968382,0.000006862526,0.00019932321],"about_ca_topic_score_codex":0.000007797318,"about_ca_topic_score_gemma":2.6341328e-7,"teacher_disagreement_score":0.8143899,"about_ca_system_score_codex":0.00044594734,"about_ca_system_score_gemma":0.0003454998,"threshold_uncertainty_score":0.78601396},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum logic; Physics; Engineering physics; Quantum; Quantum mechanics; Quantum computer","score_opus":0.005988836414477809,"score_gpt":0.22997265113382134,"score_spread":0.22398381471934353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329299806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.272502,0.000062397594,0.72031736,0.0029534486,0.00038467278,0.00027672172,2.1112727e-7,0.00039192877,0.0031112689],"genre_scores_gemma":[0.9558569,0.000017447337,0.04264678,0.0011008926,0.00033684657,0.000014125335,1.8193742e-7,0.000018428562,0.000008369406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576825,0.000023974631,0.00035625297,0.0014928451,0.0008223454,0.0015363605],"domain_scores_gemma":[0.99881107,0.00026248704,0.00013821691,0.00029652633,0.00020583441,0.00028584138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024347266,0.00038850328,0.0003730273,0.00031375547,0.00050601107,0.0009410408,0.0024478107,0.00010694107,0.0000026573066],"category_scores_gemma":[0.0002887529,0.00031370713,0.00006419945,0.0022063386,0.0015556406,0.00066769484,0.0011373091,0.00097477675,0.000015499072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102253225,0.000073375246,0.000098845005,0.00001678332,0.000002647242,0.0000014010036,0.00057295075,0.0001923162,0.00024677737,0.91505927,0.000038034646,0.0836874],"study_design_scores_gemma":[0.00021284992,0.00045581078,0.00032681483,0.000086815584,0.0000017687855,0.00004109111,0.0000063033713,0.55986893,0.00067878515,0.43786034,0.00021498749,0.00024548607],"about_ca_topic_score_codex":0.0000012372113,"about_ca_topic_score_gemma":3.083654e-7,"teacher_disagreement_score":0.6833549,"about_ca_system_score_codex":0.00015858813,"about_ca_system_score_gemma":0.00012543885,"threshold_uncertainty_score":0.9999315},"labels":[],"label_agreement":null},{"id":"W2331387892","doi":"10.4204/eptcs.157.3","title":"Automatic Device Driver Synthesis Project: a Work-in-Progress Report","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Work (physics); Computer science; Engineering; Systems engineering; Mechanical engineering","score_opus":0.008160420653458223,"score_gpt":0.27745660586082815,"score_spread":0.2692961852073699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331387892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564852,0.000114004026,0.33761698,0.0026724245,0.00016114685,0.00061734085,1.5081929e-7,0.000464351,0.0018684117],"genre_scores_gemma":[0.9421119,0.000011052666,0.057523247,0.00014472676,0.000065348606,0.0001239088,2.1686272e-7,0.000012426696,0.000007140288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440736,0.00012527882,0.00067465456,0.0015584637,0.0014620115,0.0017722563],"domain_scores_gemma":[0.9978341,0.00074512133,0.00015327417,0.0007149498,0.00034158517,0.00021095686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008681424,0.0002911275,0.00047658634,0.0009470056,0.0002562385,0.0007870674,0.003964609,0.00011777144,0.000020838837],"category_scores_gemma":[0.0020696232,0.00024639032,0.0001111559,0.0077720657,0.0020584255,0.0011164128,0.0012563526,0.00073648675,0.000034121862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010579465,0.0001863644,0.010922924,0.00004914945,0.0000067750116,0.000034563764,0.000694759,0.000024653267,0.00004465484,0.84780556,0.000026512585,0.1401935],"study_design_scores_gemma":[0.00024125702,0.00018215104,0.008244586,0.00023704581,0.000006384288,0.00014030054,0.000016201848,0.88635665,0.001474082,0.10247214,0.00023555415,0.0003936442],"about_ca_topic_score_codex":0.000013320102,"about_ca_topic_score_gemma":0.0000057237025,"teacher_disagreement_score":0.886332,"about_ca_system_score_codex":0.00061721826,"about_ca_system_score_gemma":0.0006762972,"threshold_uncertainty_score":0.9999988},"labels":[],"label_agreement":null},{"id":"W2411596298","doi":"10.4204/eptcs.209.1","title":"Formal refinement of extended state machines","year":2016,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Formal specification; B-Method; Formal methods; Programming language; Event (particle physics); Consistency (knowledge bases); Construct (python library); Process (computing); Language Of Temporal Ordering Specification; Process calculus; Theoretical computer science; Artificial intelligence","score_opus":0.006850093954983825,"score_gpt":0.2623549203145504,"score_spread":0.25550482635956656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411596298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12865286,0.000035621317,0.86809397,0.00061430555,0.00020512709,0.00018998107,6.027657e-7,0.00010479874,0.0021027566],"genre_scores_gemma":[0.7214779,0.000020812802,0.27836227,0.00007945729,0.000026344811,0.000016501524,6.040848e-8,0.0000057914303,0.000010805459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996914,0.000034306937,0.00050751545,0.00069271727,0.00075680565,0.0010946055],"domain_scores_gemma":[0.9988841,0.00010113522,0.00019020837,0.0004123754,0.00028504926,0.0001271275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004076067,0.00018813483,0.00023148277,0.00037156913,0.00013618154,0.000113385446,0.002758599,0.00004524756,0.000016632806],"category_scores_gemma":[0.00029785352,0.00012365705,0.000050987896,0.0015699972,0.0014892101,0.001948267,0.0009584565,0.0002006157,0.000010842418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018757739,0.00004804557,0.00015026837,0.0000101988035,0.0000019837717,5.4188524e-7,0.00021780934,0.0000034107259,0.010503272,0.7887575,0.0000056374515,0.20028257],"study_design_scores_gemma":[0.00053051463,0.00072186824,0.0044301813,0.000089755595,0.0000021509225,0.000035018067,0.0000036173337,0.22556654,0.13894491,0.62928474,0.00013397446,0.00025674695],"about_ca_topic_score_codex":0.000002147752,"about_ca_topic_score_gemma":7.0571616e-7,"teacher_disagreement_score":0.59282506,"about_ca_system_score_codex":0.00029077657,"about_ca_system_score_gemma":0.00023595394,"threshold_uncertainty_score":0.54870564},"labels":[],"label_agreement":null},{"id":"W2460288346","doi":"10.4204/eptcs.214.6","title":"Quantum Probability as an Application of Data Compression Principles","year":2016,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centennial College","funders":"","keywords":"Wave function; Lossy compression; Mathematics; Entropy (arrow of time); Probability amplitude; Quantum nonlocality; Quantum; Statistical physics; Quantum mechanics; Computer science; Physics; Quantum entanglement; Quantum operation; Open quantum system; Statistics","score_opus":0.019757753812511686,"score_gpt":0.2915540978454285,"score_spread":0.27179634403291686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460288346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5101706,0.000005307673,0.48869142,0.0002640716,0.000017780978,0.00025488174,0.0000067224414,0.000023966504,0.0005652772],"genre_scores_gemma":[0.9958217,0.0000023433117,0.0040233335,0.000016416649,0.00007665848,0.000044662393,0.000005572195,0.000007790359,0.0000014921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820757,0.000014624577,0.0003033078,0.0007141551,0.00031615846,0.00044417425],"domain_scores_gemma":[0.99897146,0.00006579742,0.00013359882,0.00056245027,0.0001606218,0.00010608856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064994,0.00011999035,0.00015718423,0.00007335406,0.0001319481,0.000049438324,0.0016833172,0.000029215902,0.000039661572],"category_scores_gemma":[0.000025486166,0.00008087802,0.000022016602,0.0005148459,0.00080606085,0.0006293127,0.00061590195,0.00013605239,0.000010314945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011246289,0.00018243065,0.0012037639,0.000005482939,0.0000018194318,1.8491042e-8,0.000048914088,0.0000014047309,0.016420975,0.9486273,0.0000027336619,0.033493932],"study_design_scores_gemma":[0.00015285407,0.000119553595,0.00048745374,0.000027858361,0.0000029263326,8.4476056e-7,0.000009246115,0.22560231,0.014297127,0.75901395,0.00019213506,0.00009374865],"about_ca_topic_score_codex":0.000014866028,"about_ca_topic_score_gemma":9.2825513e-7,"teacher_disagreement_score":0.48565114,"about_ca_system_score_codex":0.00006096948,"about_ca_system_score_gemma":0.00019415778,"threshold_uncertainty_score":0.329811},"labels":[],"label_agreement":null},{"id":"W2516023085","doi":"10.4204/eptcs.224.6","title":"Fault Localization in Web Applications via Model Finding","year":2016,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Satisfiability; Programming language; Focus (optics); Set (abstract data type); Object (grammar); Fault (geology); Theoretical computer science; Specification language; Fault model; Algorithm; Artificial intelligence; Engineering","score_opus":0.007970434223973321,"score_gpt":0.2536372894738852,"score_spread":0.2456668552499119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516023085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060684457,0.000027204254,0.98982453,0.0009298065,0.000042072184,0.00028346828,2.926706e-7,0.0018565515,0.00096763886],"genre_scores_gemma":[0.8815783,0.00001735633,0.11794954,0.00030239185,0.00003532292,0.00010170711,1.6394957e-7,0.000009993171,0.000005190058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973168,0.000018219733,0.00034836223,0.00087494525,0.0005007575,0.00094095],"domain_scores_gemma":[0.99906695,0.00021029892,0.00008854309,0.00033916289,0.00017635859,0.00011866135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018962696,0.00018569981,0.00018301279,0.00057038077,0.00019327935,0.00021442345,0.0021337087,0.00008386642,0.0000024816657],"category_scores_gemma":[0.00026371126,0.00014144472,0.000032314612,0.0026003153,0.0007817745,0.00096174603,0.0006124806,0.00025771724,0.000013424961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028760721,0.00004619813,0.0011125997,0.0000056653953,6.0373145e-7,8.602293e-7,0.00016972343,0.00036937304,0.0011539689,0.9284916,0.00006158477,0.06858494],"study_design_scores_gemma":[0.000120692224,0.000049496393,0.000048057627,0.000058843445,5.323981e-7,0.000013182759,3.2721087e-7,0.5258858,0.001734207,0.47193503,0.00003259727,0.00012117443],"about_ca_topic_score_codex":0.0000023338491,"about_ca_topic_score_gemma":0.000001977707,"teacher_disagreement_score":0.8755099,"about_ca_system_score_codex":0.0005398862,"about_ca_system_score_gemma":0.00032773483,"threshold_uncertainty_score":0.5767948},"labels":[],"label_agreement":null},{"id":"W2521857543","doi":"10.4204/eptcs.222","title":"Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics, Québec City, Canada, 22nd August 2016","year":2016,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Concurrency; Computer science; Programming language; Operational semantics; Semantics (computer science); Petri net; Field (mathematics); Formal semantics (linguistics); Concurrent object-oriented programming; Software engineering; Programming paradigm; Declarative programming; Mathematics; Inductive programming","score_opus":0.007193294609170283,"score_gpt":0.2506999194488999,"score_spread":0.24350662483972962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521857543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5126856,0.0047981716,0.22627518,0.0627931,0.03380881,0.008136282,0.0006005889,0.00069852074,0.15020373],"genre_scores_gemma":[0.9960575,0.00013480462,0.0005457924,0.0006857683,0.0005823482,0.00010251423,0.000019918785,0.000034478402,0.0018368354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99324906,0.000042799893,0.0009646778,0.0022465459,0.0018230168,0.0016739061],"domain_scores_gemma":[0.997664,0.00040581267,0.00045044508,0.0003777655,0.0007352925,0.0003667387],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012486652,0.0007920719,0.00084105146,0.00064301945,0.00040913525,0.0014843295,0.0045138267,0.0003506618,0.00015144939],"category_scores_gemma":[0.00033819536,0.00062617485,0.000081071805,0.0013376572,0.0014561085,0.0012298187,0.0013102964,0.0015605361,0.00004182684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011913602,0.00010911131,0.00054797134,0.000080037324,0.000024907087,0.000015977419,0.00042983892,0.000115662755,0.00010505777,0.9652021,0.023249058,0.010001134],"study_design_scores_gemma":[0.013787876,0.0032082004,0.013351678,0.031638544,0.000051561274,0.00049685355,0.0003108762,0.7387328,0.0051795044,0.09108718,0.09274608,0.009408839],"about_ca_topic_score_codex":0.004429782,"about_ca_topic_score_gemma":0.005222503,"teacher_disagreement_score":0.87411493,"about_ca_system_score_codex":0.002456871,"about_ca_system_score_gemma":0.004428948,"threshold_uncertainty_score":0.99961895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029348351075375517,"score_gpt":0.32771308191577375,"score_spread":0.2983647308403982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552403574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28125083,0.000023522673,0.7065434,0.011479982,0.00009242221,0.00015913708,2.4005757e-7,0.00023824291,0.00021226799],"genre_scores_gemma":[0.8865612,0.000060070186,0.1131071,0.00012200154,0.000048455866,0.000081506616,2.2576197e-8,0.000013417887,0.0000062270947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959962,0.000040971197,0.0002976383,0.0012898903,0.0008959326,0.0014793845],"domain_scores_gemma":[0.99676245,0.002317479,0.00006907234,0.00037473167,0.0002540391,0.00022224594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002712414,0.00024340302,0.00025774265,0.00040952076,0.00026796132,0.00052531424,0.0018405396,0.000090765614,0.000009005102],"category_scores_gemma":[0.0071380045,0.00017585284,0.000034011107,0.0018704179,0.0020136493,0.0020795725,0.0015128911,0.00044702407,0.000019131974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015546762,0.000025160294,0.0008259512,0.000007943738,0.0000035115092,0.000010822517,0.00059911696,7.0744056e-7,0.004159746,0.9242161,0.000006271065,0.070129134],"study_design_scores_gemma":[0.00074228895,0.0005023956,0.022570698,0.0005385149,0.0000065146405,0.000639866,0.000067616566,0.0775054,0.15784547,0.73772293,0.00069204223,0.0011662401],"about_ca_topic_score_codex":0.0000025598908,"about_ca_topic_score_gemma":4.2637e-7,"teacher_disagreement_score":0.6053104,"about_ca_system_score_codex":0.0007278006,"about_ca_system_score_gemma":0.00073576,"threshold_uncertainty_score":0.85453737},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006052872662043915,"score_gpt":0.24954723093051215,"score_spread":0.24349435826846824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563256558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9111459,0.000008836525,0.0804014,0.0005794231,0.00014647626,0.00016974958,0.000003857565,0.000033274675,0.0075110393],"genre_scores_gemma":[0.99843657,0.0000010856438,0.0012267369,0.000049204777,0.00025656255,0.000014312659,9.427399e-7,0.000009737068,0.000004824096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842906,0.0000036513225,0.00016566909,0.0004615587,0.00026199606,0.0006780493],"domain_scores_gemma":[0.9993899,0.000020615093,0.000106831336,0.0002956181,0.00008227787,0.00010478357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004489905,0.0001412031,0.00013846323,0.00008615305,0.0008111724,0.00055279845,0.0012979568,0.00003308146,0.000098129916],"category_scores_gemma":[0.000019220572,0.00012287628,0.000034363624,0.00021381717,0.00077246013,0.0003610721,0.00043641325,0.0004124085,0.000011239496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002923227,0.000021450081,0.0024175725,0.0000021733792,0.000002772474,2.3852544e-7,0.00009761511,0.000003135333,0.0015249491,0.9912463,0.0000076118113,0.004673257],"study_design_scores_gemma":[0.00018774779,0.00005150901,0.00251226,0.000015965063,0.000003757579,0.00000272455,0.00001195652,0.044410035,0.009362784,0.94316345,0.00012431073,0.00015347998],"about_ca_topic_score_codex":0.000008367253,"about_ca_topic_score_gemma":0.0000010857615,"teacher_disagreement_score":0.087290645,"about_ca_system_score_codex":0.0000659381,"about_ca_system_score_gemma":0.00013190047,"threshold_uncertainty_score":0.6238964},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.004989352581409593,"score_gpt":0.24526467180129644,"score_spread":0.24027531921988685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570901353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4620057,0.000029211144,0.535549,0.000533312,0.00029255,0.00016374,3.336301e-7,0.000114263916,0.0013119198],"genre_scores_gemma":[0.9248412,0.0000032698922,0.07470185,0.00021675142,0.00021735679,0.000006698575,2.0581263e-7,0.0000084662,0.000004149745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714595,0.000031524447,0.00039020096,0.0007952472,0.0006811873,0.0009558771],"domain_scores_gemma":[0.9989062,0.00014147729,0.00012288119,0.00031303058,0.00037430786,0.00014212418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015777991,0.00019949426,0.00024013016,0.00041378444,0.00026565182,0.0002897021,0.0024899612,0.00006201274,0.000012345543],"category_scores_gemma":[0.00019834397,0.00016733493,0.000056829504,0.0027372674,0.0022929336,0.0006885534,0.0009170264,0.0003682494,0.000012254385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010761093,0.00005640081,0.00025508017,0.000009956504,0.0000032212859,0.000001640326,0.0016025183,0.00024569937,0.0021452792,0.9759472,0.000017415921,0.019704804],"study_design_scores_gemma":[0.00024919177,0.000701698,0.00065209664,0.00004943255,0.0000017176112,0.000026508402,0.000009247556,0.81937915,0.03448436,0.14420752,0.000063301995,0.00017579409],"about_ca_topic_score_codex":0.000004985674,"about_ca_topic_score_gemma":0.000001296435,"teacher_disagreement_score":0.83173966,"about_ca_system_score_codex":0.000108683795,"about_ca_system_score_gemma":0.0003222096,"threshold_uncertainty_score":0.84484094},"labels":[],"label_agreement":null},{"id":"W2578144384","doi":"10.4204/eptcs.31.18","title":"Transformations Between Different Types of Unranked Bottom-Up Tree Automata","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Tree automaton; Automaton; Tree (set theory); String (physics); Mathematics; Computer science; State (computer science); Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm","score_opus":0.0052680346812756865,"score_gpt":0.2312247567987587,"score_spread":0.22595672211748302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578144384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.631415,0.000025265079,0.3644425,0.00092077255,0.0003584685,0.00022363136,0.000001984667,0.00024218706,0.0023701878],"genre_scores_gemma":[0.98338604,0.000011164131,0.016375966,0.00009564327,0.00009604194,0.000016429132,0.0000011997827,0.000011162831,0.0000063673947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970581,0.00002522485,0.0005284912,0.0006682495,0.0007338273,0.0009861144],"domain_scores_gemma":[0.99878687,0.00023068217,0.00013613307,0.00047952635,0.00017372967,0.00019305856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018599299,0.0002533575,0.00037341157,0.0004335403,0.00022196103,0.00028028683,0.0035359452,0.00011574793,0.00002418916],"category_scores_gemma":[0.000114760194,0.00020202025,0.00009220467,0.0016881878,0.0016116606,0.0011925643,0.00049539265,0.00079934276,0.000012730372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059565396,0.000070255584,0.00046700868,0.000018351051,0.000005961734,5.3287215e-7,0.0008033568,0.000002097671,0.010775118,0.9432373,0.0000150650585,0.044598967],"study_design_scores_gemma":[0.0006185565,0.00034342258,0.009022911,0.00005486218,0.0000107511005,0.000029610836,0.000014197196,0.3383894,0.074121825,0.5769755,0.00009103038,0.00032789045],"about_ca_topic_score_codex":0.0000034545403,"about_ca_topic_score_gemma":0.0000043829023,"teacher_disagreement_score":0.3662618,"about_ca_system_score_codex":0.000092934424,"about_ca_system_score_gemma":0.00024233323,"threshold_uncertainty_score":0.8238147},"labels":[],"label_agreement":null},{"id":"W2578735002","doi":"10.4204/eptcs.31.12","title":"Transition Complexity of Incomplete DFAs","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Multiplicative function; Intersection (aeronautics); Finite-state machine; Computational complexity theory; Upper and lower bounds; Descriptive complexity theory; State (computer science); Discrete mathematics; Automaton; Average-case complexity; Time complexity; Computer science; Theoretical computer science; Algorithm","score_opus":0.007691240734273789,"score_gpt":0.23088464506836429,"score_spread":0.2231934043340905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578735002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50997967,0.000015879685,0.48582488,0.0013221505,0.00028442053,0.00017321215,9.449794e-7,0.0001614237,0.0022374443],"genre_scores_gemma":[0.92961085,0.0000036373433,0.069976866,0.0003048846,0.0000843629,0.000009305167,5.2713705e-7,0.000008452309,0.0000011007551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971729,0.000024684423,0.00042872643,0.0007623743,0.00067221746,0.00093909714],"domain_scores_gemma":[0.99895257,0.00011138958,0.0001283388,0.00041970317,0.0002258731,0.0001621179],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026777927,0.00020907153,0.0002996939,0.00037112617,0.00020555337,0.00021931865,0.003060195,0.00008591054,0.00003767094],"category_scores_gemma":[0.00009556392,0.00018608678,0.00007668016,0.0019125993,0.004109071,0.0010700108,0.0005698899,0.00070028735,0.000011413462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000947638,0.000086028915,0.0000662742,0.000014088643,0.0000022453387,0.0000015945914,0.00062410155,0.000006505855,0.04013099,0.94909513,0.0000072803164,0.009956269],"study_design_scores_gemma":[0.00023287993,0.00018910553,0.0012609984,0.000023003238,0.0000017719356,0.000056103927,0.000008601525,0.34387377,0.03343338,0.6207131,0.000040005983,0.00016727552],"about_ca_topic_score_codex":0.0000075083317,"about_ca_topic_score_gemma":0.0000049135883,"teacher_disagreement_score":0.4196312,"about_ca_system_score_codex":0.00008967176,"about_ca_system_score_gemma":0.0002313026,"threshold_uncertainty_score":0.9986012},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.01242068531893349,"score_gpt":0.24949526006915346,"score_spread":0.23707457475021998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581616143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14981058,0.000049400645,0.84326005,0.00084527774,0.00038654316,0.000329646,3.6202331e-7,0.00017712936,0.0051409765],"genre_scores_gemma":[0.97789735,0.0000023237883,0.020777734,0.0012397411,0.00005009605,0.000023016737,8.5357715e-7,0.000008619966,2.5787864e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961147,0.000050767645,0.0005208215,0.0005441699,0.0013602809,0.0014092879],"domain_scores_gemma":[0.99894,0.00009897108,0.00014593144,0.0002163255,0.00035267448,0.00024608162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004918619,0.0002557561,0.00024545402,0.001066605,0.00019218068,0.00035318366,0.0013854726,0.00008898817,0.000020114854],"category_scores_gemma":[0.00020995984,0.000229629,0.000058856105,0.0043596565,0.001281935,0.001671577,0.00020051998,0.0005554212,0.000046286576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017182065,0.00021865872,0.003155453,0.000014763823,0.0000021744863,9.134504e-7,0.00043722,0.00010897748,0.00013648497,0.9788562,0.0000330667,0.017018886],"study_design_scores_gemma":[0.000969323,0.00043293333,0.00853298,0.0001158147,0.0000020312254,0.0000186061,0.000049078935,0.87361103,0.0030285036,0.112765916,0.000084157946,0.00038963242],"about_ca_topic_score_codex":0.0000032566854,"about_ca_topic_score_gemma":0.000001432174,"teacher_disagreement_score":0.873502,"about_ca_system_score_codex":0.00050346495,"about_ca_system_score_gemma":0.00045376032,"threshold_uncertainty_score":0.9363999},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009449337264278233,"score_gpt":0.27347223931447817,"score_spread":0.26402290205019996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734725460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95480645,0.00010142108,0.024032192,0.0013245819,0.0011966147,0.0003511908,1.2429398e-7,0.00015468657,0.01803274],"genre_scores_gemma":[0.9977896,0.000008638335,0.0014817151,0.0001739783,0.0004962018,0.0000148719755,3.629966e-8,0.0000127441335,0.000022209528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776506,0.00001564727,0.00025496198,0.00044324112,0.00053765386,0.0009834282],"domain_scores_gemma":[0.9990926,0.00026581285,0.00007124354,0.00023306263,0.00023849553,0.00009878929],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018989898,0.00015490482,0.00015284373,0.00007815782,0.00068073696,0.00026373877,0.00139927,0.000060740305,0.000028682907],"category_scores_gemma":[0.00042095126,0.00009708061,0.00004107343,0.0008306735,0.0038247406,0.00019713488,0.00039271786,0.0003724388,0.000014284878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021090136,0.000016167249,0.000032865733,0.000003481733,0.000002824937,3.53759e-7,0.0003834453,1.5192374e-7,0.00010485675,0.9957555,0.0001411891,0.0035381047],"study_design_scores_gemma":[0.00017819073,0.0003001917,0.00009007098,0.000013408783,0.0000036896738,0.00001808685,0.000025750915,0.010432202,0.0039830874,0.9844218,0.0003967175,0.00013683875],"about_ca_topic_score_codex":0.0000022153042,"about_ca_topic_score_gemma":0.000002821552,"teacher_disagreement_score":0.04298316,"about_ca_system_score_codex":0.00020991504,"about_ca_system_score_gemma":0.00021748639,"threshold_uncertainty_score":0.9988863},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011447697198179323,"score_gpt":0.254595512339921,"score_spread":0.2431478151417417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792585849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18100841,0.000049191338,0.81695217,0.0005926584,0.00029416798,0.00033296464,8.2224665e-7,0.00027448,0.00049515284],"genre_scores_gemma":[0.92168677,0.0000030818671,0.07744589,0.0004272622,0.0003697,0.000038230064,7.0932816e-7,0.000018110322,0.000010232742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960315,0.0000151315535,0.0004236535,0.001243044,0.00066194776,0.0016246776],"domain_scores_gemma":[0.99875873,0.00012253798,0.00012638765,0.00038696916,0.00036341863,0.00024197262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002211447,0.00029913703,0.00029985688,0.00040323613,0.00052177464,0.0006687852,0.002676327,0.000112167814,0.0000054440725],"category_scores_gemma":[0.00020389736,0.00025792076,0.0001018522,0.0016412082,0.00144901,0.0007844164,0.00060911436,0.0005446454,0.000015402467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020030262,0.00009760955,0.000009214514,0.000015492691,0.0000037073403,0.0000032119779,0.0030285702,0.0002879243,0.004586621,0.95974827,0.0000476385,0.03215174],"study_design_scores_gemma":[0.0002641589,0.00038322047,0.00015563137,0.000020681295,0.0000023554721,0.00005522589,0.0000105217605,0.5831244,0.0020356497,0.41372284,0.000020464699,0.00020488225],"about_ca_topic_score_codex":0.0000055249934,"about_ca_topic_score_gemma":0.0000030934154,"teacher_disagreement_score":0.74067837,"about_ca_system_score_codex":0.0003338396,"about_ca_system_score_gemma":0.00047767122,"threshold_uncertainty_score":0.9999873},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.010753306603258841,"score_gpt":0.30881380436595934,"score_spread":0.2980604977627005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803006329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38386917,0.000014087788,0.61361927,0.0012564106,0.00040830817,0.0002557957,5.3016333e-8,0.00027354044,0.00030335312],"genre_scores_gemma":[0.67210513,4.7284965e-7,0.32610562,0.0013986946,0.00035601997,0.000011316233,5.918116e-8,0.00001415614,0.0000085084885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99466336,0.000057972426,0.0003945379,0.0015406157,0.0014238959,0.0019195969],"domain_scores_gemma":[0.9985437,0.000079383135,0.00008728985,0.00050762866,0.0003265179,0.0004554782],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0059423563,0.00029518688,0.00028864722,0.00077074947,0.00085611345,0.0017910376,0.0062041953,0.00007317774,0.000009002537],"category_scores_gemma":[0.0005690402,0.00027563891,0.00005189407,0.0044800076,0.0007316066,0.000889552,0.0030983745,0.00073773356,0.00010990248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013929063,0.00006933663,0.0011592122,0.000005202338,0.0000044275835,0.0000029080084,0.0078113293,0.000117439966,0.0014795368,0.93079454,0.00004425754,0.05849791],"study_design_scores_gemma":[0.0014192116,0.007026182,0.010911679,0.0008697929,0.000024920633,0.0004088432,0.00023713708,0.63688415,0.026229642,0.29595625,0.017222017,0.0028101865],"about_ca_topic_score_codex":0.000015842343,"about_ca_topic_score_gemma":0.0000032993648,"teacher_disagreement_score":0.6367667,"about_ca_system_score_codex":0.0006393164,"about_ca_system_score_gemma":0.00028206923,"threshold_uncertainty_score":0.9999696},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.004568378535353583,"score_gpt":0.20922265676031884,"score_spread":0.20465427822496526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803889673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44430125,0.00002892471,0.5525963,0.0004811148,0.00043954104,0.00015785721,7.407909e-7,0.000100847574,0.0018934722],"genre_scores_gemma":[0.9855087,0.000005929314,0.014211849,0.00016286473,0.00008566553,0.0000038681906,8.9084324e-7,0.000009451761,0.000010829328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697065,0.000027694714,0.0003443582,0.0008943332,0.0008211471,0.00094178756],"domain_scores_gemma":[0.9989872,0.00008745113,0.00014436604,0.0003667491,0.00028346575,0.0001307944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017688877,0.000201041,0.0002669401,0.00038521542,0.00016709974,0.00016480201,0.0020255584,0.00008034333,0.000028046194],"category_scores_gemma":[0.00005780095,0.0001814398,0.00007718102,0.0021654342,0.0006323933,0.00063936913,0.000668475,0.0004969099,0.000025845602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008575355,0.00009310482,0.0004401645,0.000018363966,0.0000036183044,8.7453793e-7,0.0008066338,0.0006726928,0.0033548148,0.982384,0.000023109244,0.0121940505],"study_design_scores_gemma":[0.0003976743,0.0003676531,0.0065454347,0.000052423933,0.0000021550047,0.00002676495,0.000027947373,0.86143625,0.0051746,0.12561654,0.00015092362,0.00020165637],"about_ca_topic_score_codex":0.0000031772013,"about_ca_topic_score_gemma":4.6819878e-7,"teacher_disagreement_score":0.86076355,"about_ca_system_score_codex":0.00022081894,"about_ca_system_score_gemma":0.0005210615,"threshold_uncertainty_score":0.73989004},"labels":[],"label_agreement":null},{"id":"W2896032622","doi":"10.4204/eptcs.282.6","title":"Refining Santa: An Exercise in Efficient Synchronization","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Refining (metallurgy); Computer science; Synchronization (alternating current); Simple (philosophy); Programming language; Telecommunications","score_opus":0.0077748444266685,"score_gpt":0.24709507501846079,"score_spread":0.23932023059179228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896032622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19071747,0.00017105018,0.8042289,0.00013167437,0.0005308542,0.00029021592,6.611765e-8,0.00025852546,0.0036712221],"genre_scores_gemma":[0.98952436,0.000010546249,0.010141053,0.00010319665,0.00017390234,0.000027344422,4.6126436e-7,0.000012305453,0.000006820553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963407,0.00003958271,0.0004339681,0.0011442772,0.00069348037,0.0013480254],"domain_scores_gemma":[0.9989728,0.00004742594,0.00011756369,0.00039038487,0.00028297355,0.00018886018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033128504,0.00023149943,0.0002714097,0.0005148775,0.00030926272,0.0006239224,0.0024251803,0.00010076448,0.000010386112],"category_scores_gemma":[0.000119617165,0.00020060185,0.00003444352,0.003334356,0.0014330556,0.0009917236,0.00065447827,0.0003754361,0.000042956435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112514,0.00011290666,0.00090778305,0.000013595922,9.3768386e-7,0.000004681612,0.0016549544,0.000069811475,0.00029281244,0.9498899,0.000006002824,0.047035377],"study_design_scores_gemma":[0.00039189548,0.0007053214,0.0013312502,0.000061624305,0.0000022310855,0.00004599131,0.00003251998,0.848307,0.0031842757,0.14549077,0.00012457582,0.00032251913],"about_ca_topic_score_codex":0.000020838354,"about_ca_topic_score_gemma":0.000014615174,"teacher_disagreement_score":0.8482372,"about_ca_system_score_codex":0.0004997951,"about_ca_system_score_gemma":0.00034527382,"threshold_uncertainty_score":0.8180306},"labels":[],"label_agreement":null},{"id":"W2897141232","doi":"10.4204/eptcs.282.1","title":"A Theory of Lazy Imperative Timing","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lazy evaluation; Programming language; Functional programming","score_opus":0.013642270608609753,"score_gpt":0.28849984624969816,"score_spread":0.2748575756410884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897141232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12096109,0.000036346108,0.8694232,0.00015089895,0.00023993672,0.00018792812,2.0475753e-7,0.00010175278,0.008898619],"genre_scores_gemma":[0.67245907,0.000004306798,0.32729962,0.00013717025,0.00007911268,0.000010461567,6.100432e-8,0.0000056052554,0.000004604052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732333,0.00006997105,0.00039812023,0.0007327896,0.00059809687,0.0008776616],"domain_scores_gemma":[0.9986881,0.00015576731,0.00015245439,0.0003862553,0.0005066253,0.00011078567],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0057461793,0.00017790083,0.00023056718,0.00037874773,0.00023425721,0.00018513073,0.0028378442,0.000069241956,0.000021660053],"category_scores_gemma":[0.00056031434,0.00015291522,0.000045743625,0.0025499144,0.0039924784,0.0012944458,0.000805968,0.00034374473,0.000019365927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019386298,0.00004060753,0.000079961945,0.00000781612,0.0000027744645,4.521329e-7,0.0022453847,0.0000030045853,0.0062059397,0.95786846,0.0000059204413,0.033520296],"study_design_scores_gemma":[0.0001566134,0.000618343,0.00061290304,0.000040427083,0.000001996346,0.00002667086,0.000028760622,0.31214163,0.14483196,0.5413446,0.000039135743,0.00015698482],"about_ca_topic_score_codex":0.0000012261731,"about_ca_topic_score_gemma":3.9097483e-7,"teacher_disagreement_score":0.55149794,"about_ca_system_score_codex":0.00023799358,"about_ca_system_score_gemma":0.0003232516,"threshold_uncertainty_score":0.9987181},"labels":[],"label_agreement":null},{"id":"W2903407100","doi":"10.4204/eptcs.284.7","title":"A Notebook Format for the Holistic Design of Embedded Systems (Tool Paper)","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Documentation; Code (set theory); Software; Programming language; Source code; Product (mathematics); Extension (predicate logic); Software engineering; Set (abstract data type)","score_opus":0.017161912880920394,"score_gpt":0.2750405078965424,"score_spread":0.257878595015622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903407100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055667013,0.00019536506,0.99225944,0.000302326,0.0004294825,0.0009735813,6.335375e-7,0.00016450282,0.0001079935],"genre_scores_gemma":[0.94581497,0.000012002315,0.053656194,0.00013844756,0.00019439349,0.00016122528,9.9084076e-8,0.000014801849,0.000007855171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671346,0.00003420133,0.00041807664,0.0006517314,0.00087769073,0.0013048542],"domain_scores_gemma":[0.99608064,0.0025316323,0.00010241209,0.00052395754,0.00064881676,0.000112560796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061600804,0.0002083993,0.0002610931,0.0002969528,0.00033139318,0.00047209588,0.0041603125,0.000072450275,0.0000053702356],"category_scores_gemma":[0.0019279702,0.00014590706,0.000058776346,0.0017678944,0.002254576,0.0008218199,0.00073452236,0.00034718477,0.000012296888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029563242,0.000028763754,0.000025844422,0.00004274339,0.0000069522875,6.065464e-7,0.00077859464,0.0005935462,0.0015998506,0.9913693,0.00014758861,0.0053766575],"study_design_scores_gemma":[0.00031200863,0.00074984523,0.00015541031,0.000070461996,0.0000043689847,0.00004319292,0.000013101896,0.9171239,0.0069184704,0.07422174,0.00020523269,0.00018223366],"about_ca_topic_score_codex":0.00000261427,"about_ca_topic_score_gemma":1.9737064e-7,"teacher_disagreement_score":0.94024825,"about_ca_system_score_codex":0.00029030978,"about_ca_system_score_gemma":0.00049514347,"threshold_uncertainty_score":0.8307079},"labels":[],"label_agreement":null},{"id":"W2914115105","doi":"10.4204/eptcs.288.3","title":"Semantics-Preserving DPO-Based Term Graph Rewriting","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Graph rewriting; Rewriting; Graph; Term (time); Clique-width; Graph property; Confluence","score_opus":0.003758014458008914,"score_gpt":0.21878854531286424,"score_spread":0.21503053085485532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914115105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14757974,0.00004597948,0.84918123,0.00060365186,0.0002062536,0.00036211728,2.6751428e-7,0.00089715875,0.0011236202],"genre_scores_gemma":[0.68658835,0.0000050618323,0.31306925,0.00024244786,0.00004827587,0.00002290805,3.1910972e-7,0.000018156004,0.0000052096616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956801,0.000026951639,0.00044812198,0.001289326,0.00096087967,0.0015946171],"domain_scores_gemma":[0.9985217,0.00013966292,0.000121809964,0.0007418186,0.00027276712,0.00020225463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026254244,0.0003318816,0.00034723492,0.00069523003,0.00019963413,0.0006390498,0.0047943546,0.00011891141,0.000019429246],"category_scores_gemma":[0.000058514375,0.0003227394,0.00009586568,0.002614912,0.0006480864,0.001378231,0.0014753976,0.00074211473,0.000026201516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051181933,0.000043528198,0.002457314,0.000049816623,0.0000028056668,0.0000050333265,0.000204573,0.00049577304,0.0034674366,0.98416287,0.000018359457,0.009087371],"study_design_scores_gemma":[0.0002977405,0.00029060344,0.0010175636,0.000251483,0.000002456876,0.000032608274,0.0000019819868,0.84849334,0.017776344,0.13115224,0.00025689355,0.00042672316],"about_ca_topic_score_codex":0.0000033956624,"about_ca_topic_score_gemma":5.8475655e-7,"teacher_disagreement_score":0.85301065,"about_ca_system_score_codex":0.00038501932,"about_ca_system_score_gemma":0.00029932344,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W2949818755","doi":"10.4204/eptcs.273.3","title":"Objective and Subjective Solomonoff Probabilities in Quantum Mechanics","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Seneca Polytechnic","funders":"","keywords":"Frequentist probability; Quantum probability; Bayesian probability; Probability amplitude; Imprecise probability; Probability theory; Probability distribution; Applied probability; Subjectivism","score_opus":0.004709978456028789,"score_gpt":0.23489889452598173,"score_spread":0.23018891606995293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949818755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8512539,0.000021818594,0.14552443,0.0002375109,0.000077155884,0.0004004387,0.000001958099,0.00003265603,0.0024501209],"genre_scores_gemma":[0.9988654,0.000003605081,0.0008503325,0.000051553212,0.00013504383,0.000081247534,4.8361125e-7,0.000010472234,0.0000018548512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816686,0.00001488573,0.00023026709,0.00063169195,0.00021381325,0.00074247876],"domain_scores_gemma":[0.9994762,0.000070961796,0.00006109111,0.00012541066,0.00017799408,0.0000883504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010827908,0.00016522537,0.00019038699,0.00018422016,0.00021881945,0.00013125225,0.00042843245,0.00003968774,0.00003106839],"category_scores_gemma":[0.000029814673,0.00015010028,0.000026370448,0.0009913332,0.0010625198,0.00029456304,0.000272867,0.00033661173,0.0000080811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014830165,0.00007507194,0.00075799954,0.0000036764839,0.0000028780807,1.3281239e-7,0.0012658236,0.0000012070926,0.00078368885,0.9947347,0.0000028290526,0.0023571427],"study_design_scores_gemma":[0.0001880897,0.00029324007,0.00045591727,0.000022546425,0.0000022527718,0.0000024395824,0.00026851668,0.23787142,0.004571641,0.7561678,0.00001710551,0.00013898719],"about_ca_topic_score_codex":0.000027942597,"about_ca_topic_score_gemma":0.000008764557,"teacher_disagreement_score":0.23856688,"about_ca_system_score_codex":0.00016326887,"about_ca_system_score_gemma":0.00021593762,"threshold_uncertainty_score":0.6120912},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008010546611672423,"score_gpt":0.24302611202482993,"score_spread":0.23501556541315752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950537761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021392237,0.00009005568,0.94484687,0.0008135977,0.0007863097,0.00027772124,5.025651e-8,0.00039145842,0.031401705],"genre_scores_gemma":[0.98258084,0.000006456759,0.016361587,0.0005004745,0.0004878603,0.000019694424,1.3832852e-7,0.000010478928,0.000032497057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963211,0.000024839494,0.000354915,0.0010559241,0.0007296334,0.0015135867],"domain_scores_gemma":[0.99882543,0.0000630886,0.00009947997,0.00042026065,0.00037081633,0.00022090247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002787332,0.00022789903,0.00024255546,0.0003326436,0.00039637357,0.00073921424,0.0035680325,0.00009271107,0.000024659163],"category_scores_gemma":[0.00014481373,0.00018531678,0.000058426383,0.002605849,0.002686503,0.001032587,0.0009781066,0.00040303782,0.00018987847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052090313,0.000046523597,0.00035631048,0.0000063867096,0.0000024663036,0.0000032593562,0.00070170074,6.5271564e-7,0.00037539733,0.9708875,0.000069879134,0.02754471],"study_design_scores_gemma":[0.00027496894,0.0008130015,0.0004411536,0.000009030507,0.0000019378892,0.000094169685,0.000011480498,0.1572501,0.0073775887,0.8302208,0.0032075625,0.0002981552],"about_ca_topic_score_codex":0.000006224529,"about_ca_topic_score_gemma":0.0000032714545,"teacher_disagreement_score":0.96118855,"about_ca_system_score_codex":0.00027259643,"about_ca_system_score_gemma":0.00034189745,"threshold_uncertainty_score":0.98985326},"labels":[],"label_agreement":null},{"id":"W2950677588","doi":"10.4204/eptcs.287.0","title":"Proceedings of the 15th International Conference on Quantum Physics and Logic","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quantum logic; Physics; Theoretical physics; Quantum; Engineering physics; Quantum mechanics; Quantum computer","score_opus":0.008388357043858145,"score_gpt":0.24493264094500947,"score_spread":0.23654428390115131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950677588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97260696,0.000003971848,0.0070602708,0.00097192446,0.00012127233,0.00028558823,0.0000023351104,0.000014363942,0.01893333],"genre_scores_gemma":[0.99951416,0.0000030154815,0.00028710617,0.00008672519,0.000076032935,0.000015831622,3.4893984e-7,0.0000060702423,0.000010717333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.0000024902556,0.00016923966,0.0003767741,0.00031674374,0.00034152583],"domain_scores_gemma":[0.9995536,0.000023640288,0.000105650535,0.000086378,0.00018482778,0.000045891873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041444163,0.0001164863,0.00013265759,0.00004959899,0.00009467248,0.000108879685,0.00076978654,0.000022994407,0.00005792314],"category_scores_gemma":[0.00000791731,0.00008125582,0.00003560409,0.00047726193,0.00055083574,0.00017419187,0.00028986,0.00027902974,0.000008000151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069590287,0.000064433254,0.0024264038,0.0000053397384,0.0000034339341,1.0048219e-8,0.00012696393,0.0000020914847,0.0064352704,0.98958355,0.000010151802,0.0013353727],"study_design_scores_gemma":[0.00016185902,0.000116487645,0.0007554628,0.0000434188,0.0000025028621,0.0000010409967,0.000060514092,0.16529596,0.008759739,0.8246849,0.00003218904,0.00008594233],"about_ca_topic_score_codex":0.0000021872293,"about_ca_topic_score_gemma":6.516595e-8,"teacher_disagreement_score":0.16529386,"about_ca_system_score_codex":0.00004460765,"about_ca_system_score_gemma":0.00008417529,"threshold_uncertainty_score":0.3313516},"labels":[],"label_agreement":null},{"id":"W2963778005","doi":"10.4204/eptcs.195.0","title":"Proceedings of the 12th International Workshop on Quantum Physics and Logic","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quantum logic; Physics; Quantum; Engineering ethics; Theoretical physics; Engineering physics; Engineering; Quantum mechanics; Quantum computer","score_opus":0.013988562075368667,"score_gpt":0.25552349155366055,"score_spread":0.2415349294782919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963778005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6033801,0.000117905154,0.3739133,0.005976981,0.0008279576,0.0004652605,5.5396833e-7,0.00017169956,0.015146241],"genre_scores_gemma":[0.99077696,0.000012433421,0.008523326,0.0005477846,0.0001112274,0.000010591957,7.1528184e-8,0.0000066127573,0.000010973456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976253,0.0000071228637,0.00025881059,0.0006746023,0.00080134184,0.00063285005],"domain_scores_gemma":[0.9991079,0.000085042,0.00014599922,0.00016509849,0.00035439673,0.0001415522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197393,0.00018710655,0.00019527794,0.0001328813,0.0001386262,0.00025185797,0.002712804,0.00005658266,0.000002479652],"category_scores_gemma":[0.00031209408,0.00012371496,0.00004271588,0.001564879,0.0016102599,0.0008875798,0.001188546,0.00045221054,0.0000034875306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000155017,0.00006561453,0.0005549054,0.0000051679194,0.0000024318656,4.7320694e-7,0.00056652277,0.00005000471,0.0006113573,0.9903169,0.00003712462,0.007773941],"study_design_scores_gemma":[0.00027847703,0.0002583692,0.0007799706,0.000062271014,0.0000017744441,0.00002716798,0.000042607757,0.16918567,0.00593659,0.82319504,0.00008647422,0.00014555531],"about_ca_topic_score_codex":5.558159e-7,"about_ca_topic_score_gemma":1.8626132e-7,"teacher_disagreement_score":0.38739687,"about_ca_system_score_codex":0.00020335814,"about_ca_system_score_gemma":0.0001744156,"threshold_uncertainty_score":0.59330696},"labels":[],"label_agreement":null},{"id":"W2973918868","doi":"10.4204/eptcs.306.20","title":"Mutex Graphs and Multicliques: Reducing Grounding Size for Planning","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Semaphore; Mutual exclusion; Bottleneck; Graph; Representation (politics); Operator (biology)","score_opus":0.005906480353639804,"score_gpt":0.2485408980229939,"score_spread":0.2426344176693541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973918868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62141967,0.0002327642,0.37579373,0.00054616656,0.00031369145,0.00047402154,5.379175e-7,0.0002557785,0.00096363697],"genre_scores_gemma":[0.8681087,0.000007660777,0.1314619,0.00031480333,0.00005089226,0.000027252228,4.39509e-7,0.000014586443,0.000013754875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965922,0.000025879785,0.00037224026,0.0011775444,0.00045005727,0.0013820525],"domain_scores_gemma":[0.9983235,0.00091481785,0.00013190474,0.00027392924,0.00016261831,0.00019320098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036290577,0.0002664172,0.00030840858,0.00033779524,0.00042417028,0.000766539,0.0015725325,0.00009878519,0.000005230907],"category_scores_gemma":[0.0003582467,0.0002467137,0.000058089354,0.0012563196,0.00058934756,0.0013320554,0.0005576147,0.000513401,0.0000052195765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020824133,0.000022442235,0.0029751896,0.000055757035,0.0000048536667,0.0000021637873,0.0022396275,0.00018790967,0.0025900581,0.98350495,0.00002179793,0.008374408],"study_design_scores_gemma":[0.0005885059,0.0005035033,0.0011954997,0.00030865145,0.000004089835,0.000063604086,0.00004963896,0.68126976,0.002993368,0.3125565,0.000111974725,0.00035491114],"about_ca_topic_score_codex":0.000005885439,"about_ca_topic_score_gemma":2.3542422e-7,"teacher_disagreement_score":0.68108183,"about_ca_system_score_codex":0.00021533259,"about_ca_system_score_gemma":0.00022588656,"threshold_uncertainty_score":0.9999985},"labels":[],"label_agreement":null},{"id":"W2982491624","doi":"10.4204/eptcs.308.1","title":"Towards A Logical Account of Epistemic Causality","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Causality (physics); Counterexample; Epistemology; Causal reasoning; Dimension (graph theory); Computer science; Mathematics; Philosophy; Psychology; Cognition; Discrete mathematics; Pure mathematics","score_opus":0.0070475254332443334,"score_gpt":0.24213160518906654,"score_spread":0.2350840797558222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982491624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6621545,0.00020423198,0.29973453,0.0011233832,0.0005313048,0.00047136607,6.150693e-7,0.00020560759,0.035574447],"genre_scores_gemma":[0.988535,0.000018925084,0.011098745,0.00022446159,0.00007671465,0.000013672499,2.6403822e-7,0.000008608684,0.000023620207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613625,0.00004056007,0.0005052948,0.0011207729,0.0009050373,0.001292108],"domain_scores_gemma":[0.99860775,0.00014084452,0.0001760711,0.0004950738,0.0003845122,0.00019574423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00341751,0.00026885906,0.0004588346,0.00028260174,0.0001231831,0.00027074543,0.0037847636,0.00012983439,0.000053125947],"category_scores_gemma":[0.00023995338,0.00020834323,0.00010754909,0.0021820362,0.0015668009,0.0009098587,0.0014271335,0.0005581761,0.00007188133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015467314,0.000111031426,0.0026251501,0.000035191893,0.0000039555694,0.000002439936,0.00057395606,0.000009631027,0.0021233098,0.988043,0.000013418049,0.006443465],"study_design_scores_gemma":[0.00052793813,0.00081016513,0.007433158,0.000082852435,0.000004148183,0.00009225127,0.000018429446,0.19533154,0.012052038,0.78312063,0.0001534189,0.00037342787],"about_ca_topic_score_codex":0.000009427885,"about_ca_topic_score_gemma":0.0000015557736,"teacher_disagreement_score":0.3263805,"about_ca_system_score_codex":0.00044636283,"about_ca_system_score_gemma":0.00066511275,"threshold_uncertainty_score":0.84959906},"labels":[],"label_agreement":null},{"id":"W3088768572","doi":"10.4204/eptcs.327.7","title":"Proceedings of the Sixteenth International Workshop on the ACL2 Theorem Prover and its Applications","year":2020,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Automated theorem proving; Calculus (dental); Programming language; Computer science; Gas meter prover; Software engineering; Mathematics; Mathematical proof; Medicine","score_opus":0.012881381362688701,"score_gpt":0.2568102535012909,"score_spread":0.24392887213860218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088768572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26317644,0.00016661502,0.6460003,0.059462663,0.00049399707,0.0030667768,0.0000029330176,0.0002921571,0.027338084],"genre_scores_gemma":[0.97739637,0.000026204438,0.02080215,0.0015320986,0.000118623466,0.00010727285,9.149648e-8,0.000009044429,0.000008121692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975826,0.000021881267,0.00034231963,0.00072109775,0.00081360334,0.00051846047],"domain_scores_gemma":[0.9988904,0.00022742139,0.00020939927,0.00021362623,0.000350121,0.00010903345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002059421,0.00018450922,0.0001596266,0.00010636505,0.00029200432,0.0003534778,0.004475684,0.000062157174,0.00000849812],"category_scores_gemma":[0.0008637128,0.000110042274,0.000051009487,0.0021986389,0.0013726574,0.0008055228,0.0013201431,0.0005892872,0.000006596346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016256226,0.000038061793,0.0000979809,0.000013698056,0.0000042352694,5.714997e-8,0.0010408373,0.000010503509,0.0037066052,0.98399276,0.00003660706,0.011042425],"study_design_scores_gemma":[0.00021290268,0.0001964617,0.000974738,0.00008104769,0.000005267329,0.000015691558,0.000076129334,0.64640325,0.06916091,0.28176495,0.00090292987,0.00020572844],"about_ca_topic_score_codex":2.2312098e-7,"about_ca_topic_score_gemma":6.478278e-8,"teacher_disagreement_score":0.7142199,"about_ca_system_score_codex":0.0001364524,"about_ca_system_score_gemma":0.0001346927,"threshold_uncertainty_score":0.83170086},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015733728773702712,"score_gpt":0.277300833355258,"score_spread":0.2615671045815553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108616151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020537542,0.00002055171,0.96234363,0.0141568445,0.00008157913,0.0004921153,4.614921e-7,0.00014944888,0.0022178022],"genre_scores_gemma":[0.5598618,0.0000021521441,0.4390523,0.001001571,0.000046675108,0.000024698,1.4909688e-7,0.000007226652,0.000003410147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659055,0.000038574908,0.00039123854,0.0010337764,0.0007533733,0.0011924964],"domain_scores_gemma":[0.9988655,0.000048332826,0.00010628127,0.00029764112,0.00034395518,0.00033828572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021473623,0.000244454,0.00029245406,0.00038147767,0.00020606315,0.0008290237,0.003577765,0.00008465543,0.000001375613],"category_scores_gemma":[0.00049899815,0.0002355078,0.000034997982,0.005552056,0.0006828378,0.0022700012,0.0011469419,0.00059607194,0.000008796838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016570246,0.000030030042,0.00006523372,0.0000118944145,0.000001190473,0.000002010211,0.0029597923,0.007830185,0.003717495,0.979213,0.000020695994,0.0061319238],"study_design_scores_gemma":[0.00025179115,0.0005406752,0.00015464528,0.000024270188,0.0000010701632,0.0000051068278,0.000033312022,0.8035916,0.009532715,0.1855665,0.00005524915,0.00024305625],"about_ca_topic_score_codex":7.6911994e-7,"about_ca_topic_score_gemma":0.0000019636586,"teacher_disagreement_score":0.7957614,"about_ca_system_score_codex":0.00046931434,"about_ca_system_score_gemma":0.0004362728,"threshold_uncertainty_score":0.960373},"labels":[],"label_agreement":null},{"id":"W3122855612","doi":"10.4204/eptcs.333.7","title":"The more legs the merrier: A new composition for symmetric (multi-)lenses","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Web Applications and Data Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Australian Research Council; Mount Allison University","keywords":"Lens (geology); Composition (language); Mathematics; Variety (cybernetics); Pure mathematics; Computer science; Combinatorics; Physics; Optics","score_opus":0.00948605200614814,"score_gpt":0.2640331341295555,"score_spread":0.2545470821234073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122855612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036120247,0.0005152722,0.97300225,0.021317486,0.00019352885,0.00054704695,0.000001283874,0.00009549894,0.00071562635],"genre_scores_gemma":[0.9059707,0.00010329181,0.092221916,0.0013684289,0.00012921038,0.00013118012,0.000002068179,0.000009140905,0.00006407445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997381,0.000025245074,0.00031025213,0.00081976026,0.0005568089,0.00090693636],"domain_scores_gemma":[0.9984123,0.00039629167,0.000098169025,0.0006445313,0.0003205694,0.00012810969],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002082205,0.0001746167,0.0001515742,0.00014681832,0.0011405152,0.001503332,0.003470352,0.00003931297,0.0000028833947],"category_scores_gemma":[0.00020227947,0.00010759282,0.000071842835,0.0033437503,0.0010304672,0.00068397814,0.0012610967,0.00028928238,0.000009659985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005571129,0.000049092836,0.000015355497,0.000005400852,0.00000564462,7.97203e-7,0.00020061481,0.000019103543,0.0003887552,0.9424822,0.000668632,0.056158837],"study_design_scores_gemma":[0.0004830776,0.0001661013,0.0008041062,0.000024297387,0.0000110056435,0.000054116954,0.00005930295,0.62696385,0.0075453217,0.3458921,0.017763175,0.00023351023],"about_ca_topic_score_codex":0.000005758675,"about_ca_topic_score_gemma":0.000004560679,"teacher_disagreement_score":0.90235865,"about_ca_system_score_codex":0.00022200022,"about_ca_system_score_gemma":0.0005137527,"threshold_uncertainty_score":0.9995332},"labels":[],"label_agreement":null},{"id":"W3128965925","doi":"10.4204/eptcs.365.0.2","title":"Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions","year":2022,"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Institute of Steel Construction","keywords":"Asynchrony (computer programming); Asynchronous communication; Session (web analytics); Computer science; Event (particle physics); Interpretation (philosophy); Semantics (computer science); Theoretical computer science; Programming language; World Wide Web; Computer network","score_opus":0.005999358135159142,"score_gpt":0.2507313321935596,"score_spread":0.24473197405840044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128965925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07968623,0.0002986573,0.91750205,0.00079545955,0.0005848977,0.0005963968,0.0000032096843,0.00014807268,0.00038500203],"genre_scores_gemma":[0.98248696,0.0000052680693,0.017118456,0.0002209861,0.00009126322,0.000060781054,0.0000010662646,0.0000073110177,0.000007919869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974205,0.000031753392,0.00026519786,0.00080624095,0.00053703506,0.00093926064],"domain_scores_gemma":[0.99930847,0.00008205614,0.00010238788,0.00022311043,0.00013135056,0.00015264237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206948,0.00018823799,0.00022394452,0.00012404959,0.00077250926,0.00035582023,0.0016008025,0.000050383314,0.000010629081],"category_scores_gemma":[0.00009230726,0.0001566519,0.00004832187,0.0012103721,0.00063383527,0.00037859735,0.0013679446,0.00029685732,0.0000011992165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010138228,0.000055507146,0.0010865326,0.00001948052,0.000004873318,0.0000021560563,0.00048503117,0.00017494195,0.00015602869,0.98383284,0.000044627475,0.014127861],"study_design_scores_gemma":[0.0003503978,0.00057255157,0.00067904027,0.0000042537513,0.0000047459057,0.00014522368,0.000035297155,0.4012448,0.00030887447,0.59537166,0.0010795501,0.00020362104],"about_ca_topic_score_codex":0.0000057274083,"about_ca_topic_score_gemma":0.000004857227,"teacher_disagreement_score":0.90280074,"about_ca_system_score_codex":0.00043428276,"about_ca_system_score_gemma":0.00034980307,"threshold_uncertainty_score":0.6388079},"labels":[],"label_agreement":null},{"id":"W3173882028","doi":"10.4204/eptcs.335.1","title":"Proceedings Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rationality; Epistemology; Sociology; Cognitive science; Psychology; Philosophy","score_opus":0.017658513109999066,"score_gpt":0.2404549740206308,"score_spread":0.2227964609106317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173882028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7890936,0.00042179893,0.004738476,0.000809176,0.0001798445,0.00021387721,0.000005272345,0.00004336073,0.20449458],"genre_scores_gemma":[0.99900883,0.00004969288,0.0006890487,0.00010763522,0.00009546291,0.000012997119,8.1465834e-7,0.000011862876,0.000023677161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777544,0.000017372025,0.00058645144,0.0008368356,0.00014685834,0.00063706766],"domain_scores_gemma":[0.9990909,0.00014232047,0.00020231491,0.00014179466,0.00028666397,0.00013597212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003395715,0.00019254524,0.00044018333,0.00023644663,0.00015451555,0.00019588057,0.0005154822,0.0000950467,0.00015540939],"category_scores_gemma":[0.0005424976,0.00019004359,0.00005557275,0.0009673124,0.0026364215,0.00030097153,0.00026179603,0.00038838302,0.000031268028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029595554,0.00015985071,0.002332759,0.000064052154,0.0000073628867,0.0000011477628,0.00074739644,0.0000011134468,0.00056490395,0.995784,0.000012134882,0.00029568482],"study_design_scores_gemma":[0.00037212097,0.00031114995,0.0029130422,0.00012314595,0.0000029709242,0.000034660232,0.000057759473,0.025843149,0.011180318,0.95884836,0.00010012295,0.00021321427],"about_ca_topic_score_codex":0.0000014302792,"about_ca_topic_score_gemma":7.2710264e-7,"teacher_disagreement_score":0.2099152,"about_ca_system_score_codex":0.00016483275,"about_ca_system_score_gemma":0.0002010228,"threshold_uncertainty_score":0.9714005},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004478205023977122,"score_gpt":0.22328358715991878,"score_spread":0.21880538213594167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174770175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10302586,0.00035165402,0.88846934,0.007084263,0.00031361476,0.0002247454,5.4431314e-7,0.00010153837,0.0004284341],"genre_scores_gemma":[0.9104066,0.0000189018,0.08835824,0.0010154275,0.00015998755,0.000025107092,2.576306e-7,0.000007521361,0.00000796753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791765,0.00002057553,0.00020343215,0.0007649924,0.0003640834,0.00072928035],"domain_scores_gemma":[0.99887425,0.0005394328,0.000049686994,0.00027300886,0.00015710863,0.00010651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014133666,0.00015791367,0.0001439439,0.00012859618,0.000722575,0.000575451,0.0012022464,0.00004653749,0.0000031350269],"category_scores_gemma":[0.00021837966,0.00010877206,0.000048719,0.0014012669,0.0008294893,0.0002561955,0.00058492424,0.00041254872,0.0000028360607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032816035,0.000029867622,0.000051987452,0.0000037146265,0.0000033745373,0.000001795418,0.0002998242,0.00041251665,0.00029096176,0.9542026,0.000050359777,0.044649746],"study_design_scores_gemma":[0.00018736914,0.00019688609,0.00072390505,0.000019711179,0.0000024071749,0.000059253518,0.000007713099,0.70877045,0.0014001745,0.2878296,0.000681978,0.00012052369],"about_ca_topic_score_codex":7.012694e-7,"about_ca_topic_score_gemma":0.0000012418806,"teacher_disagreement_score":0.80738074,"about_ca_system_score_codex":0.000093056915,"about_ca_system_score_gemma":0.00022126551,"threshold_uncertainty_score":0.5557536},"labels":[],"label_agreement":null},{"id":"W3175209382","doi":"10.4204/eptcs.343.8","title":"Generators and Relations for Un(Z[1/2,i])","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Political science","score_opus":0.008787751245342658,"score_gpt":0.27804600276117625,"score_spread":0.2692582515158336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175209382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63236904,0.00017605457,0.36565953,0.0006218866,0.00007199443,0.00014840906,7.275699e-7,0.00004872127,0.0009036016],"genre_scores_gemma":[0.880421,0.000012737365,0.119286865,0.000158295,0.00007361778,0.00001916874,4.0039382e-7,0.000009457682,0.000018476325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986011,0.000007512589,0.0001929861,0.00044173107,0.00020844919,0.0005482382],"domain_scores_gemma":[0.9992715,0.00029584958,0.000042451986,0.00010321245,0.00019440641,0.00009255385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008021379,0.00010946244,0.00015195708,0.00011911,0.0002398719,0.00009772806,0.00023175328,0.00004879892,0.000024297078],"category_scores_gemma":[0.00079200004,0.00009872725,0.000029811852,0.0010171143,0.00065700826,0.00024368842,0.00017198302,0.00020638849,0.000001887083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046574764,0.000034480276,0.00028177357,0.000014396765,0.0000029977332,0.000001028505,0.00017286713,0.000002405901,0.0010669054,0.99351877,0.000031096664,0.0048686313],"study_design_scores_gemma":[0.00026126273,0.00009070362,0.00021465562,0.000019771458,0.0000066144266,0.000039534523,0.00002854123,0.015123869,0.02018957,0.96378607,0.00011283859,0.00012659932],"about_ca_topic_score_codex":4.0252296e-8,"about_ca_topic_score_gemma":5.623339e-7,"teacher_disagreement_score":0.24805191,"about_ca_system_score_codex":0.000099555065,"about_ca_system_score_gemma":0.00015895175,"threshold_uncertainty_score":0.40259805},"labels":[],"label_agreement":null},{"id":"W3200297247","doi":"10.4204/eptcs.343.6","title":"Restricted Hidden Cardinality Constraints in Causal Models","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Causal model; Causality (physics); Hidden variable theory; Cardinality (data modeling); Constraint (computer-aided design); Relation (database); Causal inference; Inequality","score_opus":0.009851663658136493,"score_gpt":0.2527251194018217,"score_spread":0.24287345574368518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200297247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79254144,0.000033159555,0.19555722,0.00050801714,0.00007134952,0.00019815429,0.0000048002976,0.000032619067,0.011053259],"genre_scores_gemma":[0.99788857,0.000003431766,0.0019089046,0.00006346466,0.00008532267,0.00003521865,0.0000031519987,0.000007801917,0.0000041561048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807256,0.000019017065,0.0002750371,0.00058962655,0.00030893416,0.0007347934],"domain_scores_gemma":[0.9994361,0.00005278934,0.00005098401,0.0001678714,0.00017969955,0.00011258705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068538333,0.00013729301,0.00019885933,0.000114509414,0.00012611151,0.00014649318,0.00048689602,0.000038212333,0.000084852465],"category_scores_gemma":[0.000021944303,0.00013619405,0.000044622884,0.0015541124,0.00068929227,0.00025052277,0.00025005342,0.00042947216,0.000007156689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003841082,0.00009136326,0.0007273961,0.0000029896457,0.0000031715722,0.0000023574396,0.0001514528,0.000020040468,0.0012645186,0.9907965,0.000008600242,0.0069277366],"study_design_scores_gemma":[0.00024001117,0.00003859327,0.0006815316,0.000023307508,0.0000030777887,0.0000066187804,0.000068632,0.16838299,0.0035571049,0.82684225,0.00002066744,0.00013521285],"about_ca_topic_score_codex":0.00002054384,"about_ca_topic_score_gemma":0.0000021344122,"teacher_disagreement_score":0.20534712,"about_ca_system_score_codex":0.00016076303,"about_ca_system_score_gemma":0.0005549478,"threshold_uncertainty_score":0.55538327},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.004367914828980769,"score_gpt":0.23215168399816946,"score_spread":0.2277837691691887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200821764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4968693,0.00015166053,0.500252,0.0016710269,0.00021634313,0.00018510353,8.157671e-7,0.00012132444,0.0005324499],"genre_scores_gemma":[0.8102351,0.000023530583,0.18932791,0.00026489777,0.000111622336,0.000018597095,5.296453e-7,0.000009472371,0.000008370206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974125,0.000026373758,0.00028898998,0.001002175,0.00036817722,0.00090176094],"domain_scores_gemma":[0.99899274,0.00019094672,0.000054181855,0.00025521487,0.00031928104,0.00018762024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013605184,0.00019213614,0.0002170147,0.00019393454,0.0004938574,0.00060434506,0.00095808395,0.000069527174,0.0000056858385],"category_scores_gemma":[0.00020272104,0.00016941324,0.000049930062,0.0016589462,0.00079029414,0.0005029432,0.0007243237,0.00035616444,0.0000022033005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031674983,0.000035976078,0.00038259837,0.0000085005495,0.0000031408506,0.0000030552965,0.00060436537,0.0002418534,0.0015630341,0.9800988,0.000029061393,0.017026449],"study_design_scores_gemma":[0.00029635042,0.00019028141,0.0007941765,0.000024255361,0.000002752561,0.00007164695,0.000014509145,0.75247395,0.006706106,0.23894134,0.00027337595,0.00021127699],"about_ca_topic_score_codex":0.0000017630923,"about_ca_topic_score_gemma":0.0000023811963,"teacher_disagreement_score":0.7522321,"about_ca_system_score_codex":0.00015481199,"about_ca_system_score_gemma":0.000588044,"threshold_uncertainty_score":0.69084716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01059184188387806,"score_gpt":0.2753249278970062,"score_spread":0.2647330860131281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209644401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98582304,0.00020063686,0.0061712004,0.00053439196,0.00028932805,0.00019235793,5.415686e-7,0.00005042891,0.0067381067],"genre_scores_gemma":[0.9952934,0.000016794573,0.0043666996,0.0001812386,0.00007868966,0.000013623831,4.858684e-7,0.000014483897,0.000034606775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975597,0.000104542494,0.0004751415,0.0006096313,0.00031631792,0.00093463867],"domain_scores_gemma":[0.99884206,0.00049484003,0.00010578777,0.00026224073,0.00019542218,0.000099670906],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025425993,0.00019078546,0.0004175592,0.0003259407,0.000084597195,0.000034585628,0.00080616045,0.00016765471,0.0002072213],"category_scores_gemma":[0.0010177942,0.00017337968,0.00006236797,0.0018338156,0.0028475046,0.00016480738,0.00034544308,0.00061401346,0.0000086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078949604,0.00018359661,0.0019014732,0.000029052344,0.000007921367,0.000024586534,0.0012427227,9.502336e-7,0.0034640785,0.99079,0.000028697112,0.0022479664],"study_design_scores_gemma":[0.0004494312,0.00038031896,0.0011662007,0.00004328877,0.000009873195,0.0001355788,0.00015872304,0.0013244117,0.03237824,0.9637304,0.000041226187,0.00018230976],"about_ca_topic_score_codex":0.00000328909,"about_ca_topic_score_gemma":0.000013109499,"teacher_disagreement_score":0.028914165,"about_ca_system_score_codex":0.00020759492,"about_ca_system_score_gemma":0.0007629028,"threshold_uncertainty_score":0.9998662},"labels":[],"label_agreement":null},{"id":"W4286775475","doi":"10.4204/eptcs.363.8","title":"Teaching Interaction using State Diagrams","year":2022,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Reachability; Computer science; State (computer science); Graphics; Mathematics education; State diagram; Programming language; Software engineering; Theoretical computer science; Psychology; Computer graphics (images)","score_opus":0.008708065485185726,"score_gpt":0.26719998257676647,"score_spread":0.25849191709158076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286775475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37746656,0.000041960608,0.6205513,0.00057685043,0.00044429448,0.0001501119,1.4692895e-7,0.00031270445,0.00045607914],"genre_scores_gemma":[0.92764306,0.0000013402633,0.07194859,0.00027339347,0.00007876434,0.000026100379,3.3423865e-7,0.000014249911,0.000014144812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640894,0.00014736979,0.00033548923,0.00095076876,0.0008884348,0.001268993],"domain_scores_gemma":[0.9992271,0.000129142,0.00015015125,0.0002802828,0.00006755,0.0001457459],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005889772,0.00020756091,0.00020175769,0.000521556,0.001558237,0.0007345476,0.0026483834,0.000027015612,0.000013118708],"category_scores_gemma":[0.00015136396,0.0002082461,0.00006465624,0.0016990843,0.00048373296,0.001258493,0.002021564,0.0021044873,0.0000050590857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000888275,0.00008430272,0.00036852577,0.000005298931,0.0000028709162,0.0000057659777,0.0035841432,0.0024634083,0.0005409703,0.78777313,0.000005211422,0.2051575],"study_design_scores_gemma":[0.00024280327,0.0004927266,0.00018176058,0.000026226364,0.000002736813,0.0002569258,0.00012989056,0.9240468,0.00038602616,0.069935575,0.0039763483,0.00032215184],"about_ca_topic_score_codex":0.000050628725,"about_ca_topic_score_gemma":0.0000013626974,"teacher_disagreement_score":0.9215834,"about_ca_system_score_codex":0.0010708303,"about_ca_system_score_gemma":0.00026680419,"threshold_uncertainty_score":0.9997416},"labels":[],"label_agreement":null},{"id":"W4296345334","doi":"10.4204/eptcs.370.14","title":"Characterizing the Decidability of Finite State Automata Team Games with Communication","year":2022,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Undecidable problem; Decidability; Perfect information; Computer science; Imperfect; Automaton; State (computer science); Bounded function; Finite-state machine; Theoretical computer science; Discrete mathematics; Mathematical economics; Mathematics; Algorithm","score_opus":0.004493288395293986,"score_gpt":0.217890313072296,"score_spread":0.21339702467700203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296345334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5687093,0.00017061725,0.42496255,0.0028216606,0.00014995699,0.00070152304,0.000008105513,0.00018285449,0.0022934126],"genre_scores_gemma":[0.99351346,0.0000116635365,0.0060959514,0.00025338627,0.000012826002,0.000098980294,0.000001189632,0.0000070756464,0.000005474787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972374,0.00010380986,0.0004277767,0.00061063434,0.0009122463,0.00070814317],"domain_scores_gemma":[0.99843925,0.00026760943,0.0002540259,0.00074170716,0.00022180697,0.00007561664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045316964,0.00016542034,0.00024630423,0.00014490602,0.00064133434,0.00030141542,0.0045696395,0.000021042933,0.00000815758],"category_scores_gemma":[0.000100349476,0.000114689115,0.000041771542,0.0024309952,0.0015398881,0.000765151,0.0017433468,0.0005870388,0.0000016865812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031368294,0.00012567652,0.0007371063,0.000015121912,0.0000050460985,0.0000013748445,0.0023843686,0.0004293014,0.00053632,0.9844655,0.000025681515,0.011243162],"study_design_scores_gemma":[0.00048690234,0.0007200118,0.0046388656,0.000070558104,0.0000035425483,0.00011303799,0.00012993308,0.8988069,0.003114987,0.09018724,0.0014612874,0.0002667129],"about_ca_topic_score_codex":0.000012291827,"about_ca_topic_score_gemma":0.0000024167257,"teacher_disagreement_score":0.8983776,"about_ca_system_score_codex":0.0003095968,"about_ca_system_score_gemma":0.0003821812,"threshold_uncertainty_score":0.8491603},"labels":[],"label_agreement":null},{"id":"W4307867104","doi":"10.4204/eptcs.372.15","title":"Exponential Modalities and Complementarity (extended abstract)","year":2022,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unitary state; Modalities; Mathematics; Complementarity (molecular biology); Exponential function; Categorical variable; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.007014535483838723,"score_gpt":0.24452059059264855,"score_spread":0.23750605510880982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307867104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96410817,0.000019796718,0.032378048,0.00058528135,0.0000781083,0.00021776612,0.000010417849,0.000030288027,0.0025721528],"genre_scores_gemma":[0.9990491,0.0000011386171,0.0006737059,0.00009274741,0.000077344164,0.000091447495,0.0000039395422,0.000006490865,0.0000040856526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855316,0.000007967502,0.00018375841,0.0004012929,0.00032633354,0.0005274991],"domain_scores_gemma":[0.99970526,0.000029794872,0.000053217464,0.000093732815,0.000040213967,0.00007779155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008473656,0.00010564628,0.000116633695,0.000091863236,0.00062636775,0.00013456913,0.00047634455,0.00000868739,0.0005359891],"category_scores_gemma":[0.0000027459387,0.00010748617,0.00002669844,0.00039283588,0.0004921631,0.00016460936,0.00058694754,0.00035078046,0.0000022406732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073639108,0.00009269572,0.00032852613,0.000002381659,0.0000031570887,1.7395769e-7,0.00029062483,0.0000048949855,0.0010123391,0.9949208,0.000025965977,0.003311068],"study_design_scores_gemma":[0.00023698111,0.000113596485,0.0010181564,0.0000030190809,0.0000033048186,0.0000041149597,0.00026204294,0.06602943,0.0013549955,0.93042994,0.0004156323,0.0001288094],"about_ca_topic_score_codex":0.000033157743,"about_ca_topic_score_gemma":7.4268104e-7,"teacher_disagreement_score":0.066024534,"about_ca_system_score_codex":0.000105562875,"about_ca_system_score_gemma":0.000108208835,"threshold_uncertainty_score":0.5868705},"labels":[],"label_agreement":null},{"id":"W4353115879","doi":"10.4204/eptcs.397.5","title":"Normalizing Resistor Networks","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Rewriting; Resistor; Electronic circuit; Computer science; Quantum; Topology (electrical circuits); Physics; Electrical engineering; Quantum mechanics; Voltage; Engineering","score_opus":0.004568360625917888,"score_gpt":0.2249425239763987,"score_spread":0.2203741633504808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353115879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1602761,0.00014223554,0.83313245,0.002063607,0.0007310395,0.0002273717,2.2444965e-7,0.0011559008,0.002271102],"genre_scores_gemma":[0.9717446,0.000026430398,0.027498098,0.00040904447,0.00027645633,0.0000148918825,4.7197523e-7,0.000015704958,0.000014330597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958453,0.00003062846,0.0003651441,0.0010914793,0.00074959674,0.001917844],"domain_scores_gemma":[0.99896276,0.00018391765,0.00008989118,0.00039101028,0.00014580217,0.00022659065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003254657,0.00025578268,0.00025759017,0.0006780389,0.00055530475,0.0006086913,0.0034348047,0.00008450744,0.0000053196545],"category_scores_gemma":[0.0001451403,0.00022526814,0.00007627218,0.006429981,0.0009826733,0.00067991426,0.0016548953,0.00073921453,0.000047662048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049444666,0.000021897757,0.0001558819,0.000007802993,0.0000025029935,0.000014637557,0.00044155392,0.0052992417,0.00019052053,0.95954126,0.00017963673,0.034140117],"study_design_scores_gemma":[0.00018290043,0.00017492141,0.0014316334,0.00004978088,0.00000131042,0.000054067823,0.000006408307,0.87041074,0.00048809938,0.12645091,0.00048574182,0.00026347485],"about_ca_topic_score_codex":0.0000037414186,"about_ca_topic_score_gemma":0.0000010562561,"teacher_disagreement_score":0.86511153,"about_ca_system_score_codex":0.00023545617,"about_ca_system_score_gemma":0.0002361686,"threshold_uncertainty_score":0.91861683},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0424166694482239,"score_gpt":0.3349286603871206,"score_spread":0.2925119909388967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385342865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57622343,0.00006891088,0.4213369,0.00044868258,0.00010517954,0.00018224391,9.3228624e-7,0.00009877183,0.0015349506],"genre_scores_gemma":[0.99069107,0.0000035775379,0.009003227,0.00014182772,0.00011026107,0.000018133722,3.6277106e-7,0.0000112301195,0.000020300697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488354,0.000035523644,0.0005495469,0.0010809577,0.002390649,0.0010597843],"domain_scores_gemma":[0.9982547,0.0007035892,0.00009798951,0.00025559322,0.000472059,0.0002160437],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0072373576,0.00019649928,0.00032667172,0.00079047284,0.00054935156,0.0011075026,0.001275287,0.000052040166,0.0000397179],"category_scores_gemma":[0.0005199489,0.000130652,0.0000452075,0.00462814,0.0011949044,0.00064735964,0.0008269275,0.00034925962,0.000060405433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003973757,0.000018140623,0.0011265028,0.00000286642,0.0000020864456,0.000006544068,0.00041381322,0.0041626617,0.00023077866,0.9788151,0.00010889013,0.01507289],"study_design_scores_gemma":[0.00019159769,0.00015297328,0.0010733783,0.0000354684,0.0000011538232,0.00006657241,0.000063485146,0.58735406,0.000038041228,0.4108577,0.000047836915,0.00011773215],"about_ca_topic_score_codex":0.0000027929943,"about_ca_topic_score_gemma":0.0000057482775,"teacher_disagreement_score":0.5831914,"about_ca_system_score_codex":0.0001253383,"about_ca_system_score_gemma":0.00018629135,"threshold_uncertainty_score":0.9999294},"labels":[],"label_agreement":null},{"id":"W4385342950","doi":"10.4204/eptcs.380.12","title":"Extending Resource Monotones using Kan Extensions","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Computer science; Bipartite graph; Functor; Resource (disambiguation); Theoretical computer science; Set (abstract data type); Quantum entanglement; Probabilistic logic; Discrete mathematics; Mathematics; Quantum; Artificial intelligence","score_opus":0.011815003518333592,"score_gpt":0.27594543962891793,"score_spread":0.26413043611058434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385342950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8572875,0.000016340055,0.13892165,0.00044973928,0.00008449895,0.00023921145,0.0000018771906,0.0001418766,0.002857287],"genre_scores_gemma":[0.9978521,0.000003052496,0.0018427529,0.000060908947,0.00018263704,0.00003115268,0.0000019391625,0.000016299355,0.000009178603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979525,0.000009338809,0.00023187694,0.000560073,0.0003165671,0.000929649],"domain_scores_gemma":[0.99948484,0.00006741186,0.00006337868,0.0001764913,0.00007762179,0.00013025798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010940529,0.00015097532,0.00016065489,0.00028352466,0.0005009733,0.00017447588,0.0006456428,0.000029564299,0.000046763864],"category_scores_gemma":[0.000020151032,0.00013943102,0.000053039297,0.0023936331,0.0005042532,0.00019022105,0.00038325583,0.00031299997,0.000039947787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002746736,0.000030726525,0.00025457406,0.000002303814,0.000002532861,5.602936e-7,0.00014350082,0.00007264141,0.007245593,0.9877469,0.00003565359,0.0044622594],"study_design_scores_gemma":[0.000083728984,0.000029193343,0.00018884482,0.000023376942,0.0000034462237,0.000003166764,0.00007301946,0.4401728,0.0030389025,0.55594796,0.00031725332,0.00011833366],"about_ca_topic_score_codex":0.0000068470176,"about_ca_topic_score_gemma":1.5668999e-7,"teacher_disagreement_score":0.44010013,"about_ca_system_score_codex":0.00009494643,"about_ca_system_score_gemma":0.00012865504,"threshold_uncertainty_score":0.5685832},"labels":[],"label_agreement":null},{"id":"W4385761401","doi":"10.4204/eptcs.382.2","title":"Computer Aided Design and Grading for an Electronic Functional Programming Exam","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Grading (engineering); Computer science; Automation; Constructive; Programming language; Mathematical proof; Software engineering; Process (computing); Artificial intelligence","score_opus":0.02026439381970135,"score_gpt":0.26803784934809655,"score_spread":0.2477734555283952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385761401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083137386,0.00007198716,0.9140998,0.0006502991,0.00029050364,0.0006899331,1.4728057e-7,0.0010363143,0.000023640707],"genre_scores_gemma":[0.71980757,0.000009692283,0.2796615,0.00015164347,0.00021279606,0.00012377177,0.0000019136937,0.000023418552,0.000007698265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948322,0.00009811714,0.00040735558,0.0015595955,0.0006791319,0.0024235582],"domain_scores_gemma":[0.9985557,0.00051137485,0.0001268466,0.0003154145,0.00019531752,0.00029532332],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008041804,0.0003437886,0.0003267125,0.00073246815,0.00096276595,0.001341724,0.0017379832,0.00011535581,0.0000018399539],"category_scores_gemma":[0.00021394559,0.00032417785,0.00007435186,0.0027959412,0.00087207573,0.0015626405,0.0006404851,0.0008533919,0.000009010889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023809887,0.000050603245,0.00014811971,0.000019325136,0.0000068341906,0.0000017489388,0.001180911,0.00078445644,0.00030100803,0.73206913,0.000036248268,0.2653778],"study_design_scores_gemma":[0.00059117156,0.001833149,0.0008701507,0.000056197496,0.0000069874113,0.00010228494,0.000036570764,0.8799144,0.0004330219,0.11397002,0.0017725372,0.00041351412],"about_ca_topic_score_codex":0.000003904003,"about_ca_topic_score_gemma":0.0000013380348,"teacher_disagreement_score":0.87912995,"about_ca_system_score_codex":0.00034987845,"about_ca_system_score_gemma":0.00040463696,"threshold_uncertainty_score":0.999921},"labels":[],"label_agreement":null},{"id":"W4386093894","doi":"10.4204/eptcs.384.10","title":"Moore-Penrose Dagger Categories","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Kyoto University Foundation","keywords":"Dagger; Mathematics; Inverse; Singular value decomposition; Pure mathematics; Context (archaeology); Polar decomposition; Algebra over a field; Quantum mechanics; Physics; Algorithm; Geometry; Polar","score_opus":0.005907617392832552,"score_gpt":0.24890941383289183,"score_spread":0.2430017964400593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8759428,0.0000206149,0.11068344,0.0013945887,0.0002008541,0.00033506824,0.0000036519348,0.00022415721,0.011194808],"genre_scores_gemma":[0.99916476,0.0000034510576,0.00046824274,0.000073309755,0.00017877277,0.000068482776,0.00000362079,0.000012594795,0.000026777692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811953,0.0000054682255,0.0001990876,0.00049524277,0.000312469,0.0008681948],"domain_scores_gemma":[0.99953353,0.00004664606,0.000047071335,0.00015969771,0.00010121307,0.00011185679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091485295,0.00014093232,0.00014346174,0.00018488796,0.00028982764,0.00020346315,0.0007424263,0.000026425152,0.00010645165],"category_scores_gemma":[0.00001427298,0.00012410093,0.000042238175,0.0021558246,0.00065595564,0.00025418456,0.0003036126,0.0002880305,0.00016141441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024383924,0.000035238798,0.00065720663,0.00000269451,0.0000025525135,3.4182062e-7,0.0002255106,0.0000068231284,0.0012733003,0.99363357,0.00014173843,0.004018573],"study_design_scores_gemma":[0.00013160484,0.000057884914,0.0006136881,0.000009249824,0.000002623153,0.000001431167,0.0000647634,0.10360657,0.005810773,0.8891067,0.00044643288,0.00014828614],"about_ca_topic_score_codex":0.000007118784,"about_ca_topic_score_gemma":3.470015e-7,"teacher_disagreement_score":0.123221934,"about_ca_system_score_codex":0.00006738556,"about_ca_system_score_gemma":0.00016663362,"threshold_uncertainty_score":0.50606894},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008348149584011729,"score_gpt":0.24822842542809928,"score_spread":0.23988027584408755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053060804,0.00006800727,0.9416912,0.0037543266,0.00028309468,0.0005103309,0.0000041437866,0.00039244271,0.00023564491],"genre_scores_gemma":[0.96271354,0.000012661832,0.03643175,0.000504372,0.00021682591,0.00009325184,0.0000021997084,0.000016277756,0.000009134142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963939,0.000026866934,0.0003111269,0.0009625016,0.0008884933,0.0014170969],"domain_scores_gemma":[0.99781024,0.0012857945,0.00011516638,0.00039132172,0.0002750953,0.00012239942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029991488,0.00027732117,0.00026193197,0.0002860489,0.0009405402,0.00083031895,0.0032524636,0.000051422798,0.0000047751623],"category_scores_gemma":[0.00020923096,0.00017002379,0.00007472556,0.0033685942,0.001999138,0.00046904216,0.00082369096,0.00045031542,0.000010892968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027323093,0.000025047137,0.00018436456,0.000013521548,0.00001157273,0.0000019449274,0.0007178862,0.0019047629,0.0003560119,0.9793283,0.000031126914,0.017398177],"study_design_scores_gemma":[0.00026953395,0.00027486615,0.0016792272,0.000030232613,0.0000029855048,0.000019862893,0.000013100878,0.5278766,0.00022901027,0.46922645,0.00022148133,0.00015662657],"about_ca_topic_score_codex":0.0000037204572,"about_ca_topic_score_gemma":0.000003213456,"teacher_disagreement_score":0.9096527,"about_ca_system_score_codex":0.00014487049,"about_ca_system_score_gemma":0.00038044827,"threshold_uncertainty_score":0.8006785},"labels":[],"label_agreement":null},{"id":"W4386093978","doi":"10.4204/eptcs.384.3","title":"Locally Tomographic Shadows (Extended Abstract)","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tomographic reconstruction; Computer science; Computer vision; Iterative reconstruction","score_opus":0.005986921705246553,"score_gpt":0.24547323266829746,"score_spread":0.2394863109630509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90639263,0.000017314896,0.082671285,0.000935279,0.00014558145,0.00038152587,0.0000034618772,0.0002400603,0.009212832],"genre_scores_gemma":[0.99919367,0.0000055586243,0.0004640692,0.00008409017,0.00015398177,0.00007278146,0.0000032076446,0.000013836661,0.000008795523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978105,0.000004789412,0.00025449216,0.00057696993,0.00038170573,0.0009715821],"domain_scores_gemma":[0.9994474,0.00005491785,0.000061113526,0.00017540822,0.00011691725,0.00014425817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222241,0.00016067471,0.0001580837,0.00029325444,0.0002611427,0.00019550037,0.00087145966,0.00003966859,0.00014327985],"category_scores_gemma":[0.000013785642,0.00014573455,0.00006549569,0.0028195963,0.00063131837,0.00023414502,0.00025589444,0.00042865865,0.00012397802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040924688,0.000060762028,0.00036863537,0.0000037511534,0.0000037517937,5.880409e-7,0.0001054789,0.000008609049,0.0013633191,0.983405,0.00007614604,0.014599878],"study_design_scores_gemma":[0.00016557181,0.00010236695,0.002162165,0.000020428624,0.000003074507,0.0000018320985,0.000042105148,0.1193925,0.0020543009,0.8756918,0.00019503289,0.00016882144],"about_ca_topic_score_codex":0.0000054360753,"about_ca_topic_score_gemma":5.930778e-7,"teacher_disagreement_score":0.119383894,"about_ca_system_score_codex":0.000056971658,"about_ca_system_score_gemma":0.00017604655,"threshold_uncertainty_score":0.59428823},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011292536358004182,"score_gpt":0.2745351148492931,"score_spread":0.2632425784912889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386095606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24290061,0.000027672366,0.7541915,0.001331196,0.0002459507,0.0001749426,2.215481e-7,0.0007655545,0.00036231976],"genre_scores_gemma":[0.9652327,0.000009575705,0.034475222,0.00016422263,0.00008519757,0.0000140767725,7.205859e-7,0.000013736252,0.0000045896268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962695,0.000054645818,0.0003849599,0.0008526064,0.00086619117,0.0015720481],"domain_scores_gemma":[0.9991917,0.000118695636,0.00008279578,0.00026455213,0.00013297879,0.00020924903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044024927,0.00022537295,0.0002346402,0.00076307816,0.00061360793,0.0007086396,0.00219259,0.00010310142,0.0000036821525],"category_scores_gemma":[0.0001800438,0.0002055261,0.00008231009,0.005543127,0.0010195251,0.0012836944,0.0004676856,0.00090976467,0.00003162158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057019165,0.000030614032,0.00015056369,0.000013198086,0.0000026609712,0.000007060143,0.0024241582,0.00047733376,0.0006882517,0.92957604,0.000008372627,0.06661604],"study_design_scores_gemma":[0.00028377888,0.00021125004,0.0007903844,0.000059131664,0.0000034818106,0.000083986735,0.00004137553,0.93163764,0.0009233336,0.06468559,0.0010008456,0.00027918132],"about_ca_topic_score_codex":0.000009519624,"about_ca_topic_score_gemma":0.0000018856468,"teacher_disagreement_score":0.93116033,"about_ca_system_score_codex":0.00029627042,"about_ca_system_score_gemma":0.00026306143,"threshold_uncertainty_score":0.8381111},"labels":[],"label_agreement":null},{"id":"W4386095693","doi":"10.4204/eptcs.384.7","title":"Generators and Relations for 3-Qubit Clifford+CS 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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Qubit; Physics; Quantum mechanics; Quantum","score_opus":0.0052980364038951455,"score_gpt":0.23948872887487338,"score_spread":0.23419069247097823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386095693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4981797,0.00007677256,0.4977654,0.0025327832,0.0003406522,0.00038140191,0.000001219554,0.0004237928,0.00029830102],"genre_scores_gemma":[0.91950035,0.00001790396,0.0798984,0.00033961146,0.00016874168,0.00004563859,8.977903e-7,0.000014622385,0.0000138460055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970579,0.00001841415,0.00031829075,0.0009764281,0.0004262576,0.0012027051],"domain_scores_gemma":[0.9990849,0.00022705799,0.000065513974,0.00024310073,0.00017061771,0.00020884332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021515817,0.00022195143,0.00022683787,0.00052213913,0.00068990135,0.0006101084,0.00150333,0.00007928288,0.0000025665267],"category_scores_gemma":[0.00020693315,0.0001908724,0.000055139935,0.003329821,0.000885838,0.0005482206,0.00085053284,0.00038673673,0.000013039263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038683584,0.000017925155,0.00029556514,0.000009821496,0.000003097757,0.0000017966927,0.00059628463,0.00068664714,0.00041142316,0.97211313,0.00014993185,0.0257105],"study_design_scores_gemma":[0.00025355516,0.0002403026,0.0008305272,0.000025253788,0.0000021123876,0.000025951385,0.0000092879445,0.7418909,0.0011138227,0.25494197,0.00046497383,0.00020135062],"about_ca_topic_score_codex":0.0000013152124,"about_ca_topic_score_gemma":8.5012965e-7,"teacher_disagreement_score":0.74120426,"about_ca_system_score_codex":0.00012515087,"about_ca_system_score_gemma":0.00027695176,"threshold_uncertainty_score":0.77835506},"labels":[],"label_agreement":null},{"id":"W4386211456","doi":"10.4204/eptcs.385.40","title":"Proceedings 39th International Conference on Logic Programming","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Ministerio de Ciencia e Innovación","keywords":"Computer science; Programming language","score_opus":0.016768188259415184,"score_gpt":0.27524222376854657,"score_spread":0.2584740355091314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386211456","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2620559,0.00011777198,0.3515406,0.017157968,0.003712913,0.0020764992,0.0000021374337,0.004833409,0.3585028],"genre_scores_gemma":[0.9853653,0.000048193677,0.01368464,0.00043891033,0.00025707867,0.00008100602,0.0000012166043,0.000016939726,0.000106768755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504775,0.000015228255,0.00041992337,0.0014979987,0.0011750398,0.0018440642],"domain_scores_gemma":[0.99864656,0.00009711304,0.00015199526,0.0002625715,0.00056665693,0.00027509945],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028370304,0.00035756582,0.000314398,0.0008024261,0.00041428997,0.0013663841,0.0048454,0.00012554,0.000035478588],"category_scores_gemma":[0.00039006316,0.00029745605,0.00009107814,0.0043183807,0.0013826943,0.0013204726,0.0015352421,0.0007551964,0.0002635911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015640451,0.00010414164,0.00042346268,0.000013977875,0.0000056660165,0.000010254254,0.0010853035,0.000008082814,0.00059869135,0.9716058,0.0002117156,0.02591726],"study_design_scores_gemma":[0.00039919626,0.0006550623,0.0008931112,0.0000969954,0.000002716621,0.0000620717,0.00006655706,0.4526512,0.00215576,0.5415173,0.0010970597,0.00040296259],"about_ca_topic_score_codex":0.0000018279721,"about_ca_topic_score_gemma":0.000001026011,"teacher_disagreement_score":0.72330934,"about_ca_system_score_codex":0.0004825909,"about_ca_system_score_gemma":0.00036678408,"threshold_uncertainty_score":0.9999477},"labels":[],"label_agreement":null},{"id":"W4386399952","doi":"10.4204/eptcs.386.18","title":"A General Approach to Proving Properties of Fibonacci Representations via Automata Theory","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Fibonacci number; Automaton; Computer science; Representation (politics); Mathematical proof; Automata theory; Expression (computer science); Computation; Theoretical computer science; Algorithm; Mathematics; Algebra over a field; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.011136977253306984,"score_gpt":0.2418375955661348,"score_spread":0.23070061831282782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386399952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4505789,0.00003704668,0.5444608,0.00061013456,0.00015032946,0.00048885186,6.5976167e-7,0.0005573314,0.0031159627],"genre_scores_gemma":[0.9553469,0.0000068623904,0.044178057,0.0002298141,0.00007977994,0.000103862345,7.8518195e-7,0.000017155411,0.00003682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626344,0.00006601976,0.0004948918,0.0010983994,0.0008457405,0.0012315328],"domain_scores_gemma":[0.9987663,0.0001210773,0.000119229604,0.0005823826,0.00021851351,0.0001924812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004280696,0.00024396213,0.00031470618,0.00078831846,0.00028120575,0.00035152867,0.0035786608,0.00006711689,0.000004061102],"category_scores_gemma":[0.00032482596,0.00020003323,0.00007582298,0.0052678357,0.0010607134,0.001092034,0.0019382575,0.00031753516,0.000029897248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014412356,0.00009891808,0.00010146607,0.000039821865,0.0000053133354,0.0000013516641,0.0024625505,0.0003623498,0.023413112,0.961377,0.000043690947,0.01208001],"study_design_scores_gemma":[0.00018038269,0.00015971428,0.0009696249,0.00006240289,0.0000029112773,0.000031042702,0.00007125857,0.6784519,0.023709806,0.29612365,0.000018240173,0.0002190443],"about_ca_topic_score_codex":0.0000072752955,"about_ca_topic_score_gemma":4.047088e-7,"teacher_disagreement_score":0.67808956,"about_ca_system_score_codex":0.00018022061,"about_ca_system_score_gemma":0.00032248776,"threshold_uncertainty_score":0.81571186},"labels":[],"label_agreement":null},{"id":"W4386400244","doi":"10.4204/eptcs.386.5","title":"Duality of Lattices Associated to Left and Right Quotients","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; Eesti Teadusagentuur","keywords":"Duality (order theory); Quotient; Mathematics; Pure mathematics; Left and right; Structural engineering; Engineering","score_opus":0.006738549479829083,"score_gpt":0.25724041209966036,"score_spread":0.25050186261983126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386400244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8843781,0.000030495034,0.11269653,0.0010739274,0.0001661788,0.00021297022,7.4644e-7,0.00022047601,0.0012206062],"genre_scores_gemma":[0.99205667,0.000011888234,0.0076108947,0.00027405427,0.000022107157,0.000006119652,3.2145425e-7,0.000005828736,0.000012117686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735874,0.000026794853,0.00031070245,0.000748821,0.0006073659,0.00094755023],"domain_scores_gemma":[0.9991499,0.0001784835,0.0000963309,0.00020769463,0.0001830394,0.00018451284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022180288,0.00016029614,0.00025023226,0.00039015242,0.00018693268,0.00016680923,0.0015801118,0.000055741584,0.000009520733],"category_scores_gemma":[0.0003837344,0.00013432816,0.00003112286,0.003095835,0.0008944139,0.0007374178,0.0011464795,0.0002459347,0.0000163866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005018934,0.00004158394,0.002062909,0.000010647487,0.0000028507368,0.0000024440967,0.0010066405,0.000036877726,0.0010298581,0.991998,0.000017112585,0.003786045],"study_design_scores_gemma":[0.00028887653,0.0005062709,0.024842877,0.00006321027,0.0000027965693,0.000013036351,0.00002239711,0.17324074,0.010524778,0.7901683,0.000071367154,0.00025537133],"about_ca_topic_score_codex":0.0000020226103,"about_ca_topic_score_gemma":0.0000025297818,"teacher_disagreement_score":0.20182973,"about_ca_system_score_codex":0.00012907913,"about_ca_system_score_gemma":0.000116511976,"threshold_uncertainty_score":0.5477744},"labels":[],"label_agreement":null},{"id":"W4387218579","doi":"10.4204/eptcs.391.14","title":"ORTAC+ : A User Friendly Domain Specific Language for Multi-Agent Mission Planning","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; USable; Planner; Domain (mathematical analysis); Plan (archaeology); Modeling language; Semantics (computer science); Robot; Agile software development; Software engineering; Human–computer interaction; Field (mathematics); Drone; Natural language; Programming language; Artificial intelligence; Operations research; Engineering; World Wide Web","score_opus":0.01776820336026865,"score_gpt":0.2921193739152016,"score_spread":0.27435117055493297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387218579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18488233,0.00021554569,0.81245726,0.0007931207,0.00034166014,0.00040167448,0.0000016875309,0.0005166342,0.00039007663],"genre_scores_gemma":[0.7615028,0.000008799923,0.23803167,0.00021058744,0.0001338545,0.000038199312,0.0000033102108,0.000020229518,0.000050517392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959072,0.000033458997,0.0004128202,0.001209107,0.0006680038,0.0017694187],"domain_scores_gemma":[0.9988235,0.00028529792,0.00012208274,0.00036102225,0.0001467985,0.00026128654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037590729,0.00029514142,0.0002862921,0.00058745255,0.0006006316,0.0005914079,0.002426673,0.000110664354,0.000010324308],"category_scores_gemma":[0.00012864998,0.000259406,0.0000894927,0.0029353765,0.0005139738,0.00073471497,0.00072149956,0.0005228178,0.000046256875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024046762,0.000051815772,0.00058286503,0.00003146237,0.00000475207,0.000027538033,0.0047249957,0.0003910678,0.005055877,0.98113155,0.0011265702,0.0068474677],"study_design_scores_gemma":[0.0011128953,0.00059400353,0.0009981906,0.000298484,0.000003984311,0.000052879062,0.00025017117,0.9091805,0.009029926,0.068096,0.0097631775,0.0006197788],"about_ca_topic_score_codex":0.0000026024802,"about_ca_topic_score_gemma":4.819601e-7,"teacher_disagreement_score":0.9130355,"about_ca_system_score_codex":0.0002787644,"about_ca_system_score_gemma":0.00028258492,"threshold_uncertainty_score":0.9999858},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Qubit; Mathematics; Computer science; Physics; Quantum; Quantum mechanics","score_opus":0.005236406282705447,"score_gpt":0.2392558016829437,"score_spread":0.23401939540023825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388652902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49289742,0.00006876262,0.50301945,0.0026238526,0.00031988657,0.00036102594,0.0000010689726,0.00041495232,0.0002936107],"genre_scores_gemma":[0.92204255,0.000015250271,0.07739184,0.00032242847,0.00015650832,0.00004389717,7.9796206e-7,0.000013537749,0.000013173949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717444,0.000017113893,0.00030194747,0.00094225764,0.00040270522,0.001161521],"domain_scores_gemma":[0.999139,0.00021441457,0.0000607739,0.00023049628,0.00015986018,0.00019542454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021274139,0.00020941763,0.00021513138,0.00051712693,0.0006573764,0.00058112305,0.0014302395,0.000073988514,0.00000246314],"category_scores_gemma":[0.00019069853,0.00017977004,0.000051556086,0.0032483554,0.000851242,0.0005401146,0.0007902469,0.00036624412,0.000012936286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034711625,0.000016299995,0.0002785891,0.000008730647,0.0000028433292,0.0000016180094,0.0005826969,0.00055907515,0.00041524012,0.9715014,0.00013964542,0.026490403],"study_design_scores_gemma":[0.00023989768,0.00023086749,0.0008196238,0.00002271625,0.0000018103655,0.000025299953,0.000009130841,0.7332126,0.0010710504,0.26376617,0.0004131533,0.00018766678],"about_ca_topic_score_codex":0.0000013069977,"about_ca_topic_score_gemma":8.2158516e-7,"teacher_disagreement_score":0.73265356,"about_ca_system_score_codex":0.00011854811,"about_ca_system_score_gemma":0.00025481,"threshold_uncertainty_score":0.733081},"labels":[],"label_agreement":null},{"id":"W4388667248","doi":"10.4204/eptcs.394.16","title":"A Biset-Enriched Categorical Model for Proto-Quipper with Dynamic Lifting","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical variable; Computer science; Machine learning","score_opus":0.007691420931401275,"score_gpt":0.2635504460324845,"score_spread":0.2558590251010832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388667248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7188321,0.000033772267,0.27965382,0.00038384364,0.00004010217,0.0006235895,9.527462e-7,0.00008610255,0.00034573168],"genre_scores_gemma":[0.9912081,0.000011886233,0.008190194,0.00025576135,0.00010956648,0.00015859512,0.000009739188,0.00001893,0.000037242484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748397,0.000012320275,0.00023390214,0.0008535404,0.0002655961,0.0011506747],"domain_scores_gemma":[0.9994483,0.000040076764,0.00006362453,0.00014497562,0.00017905075,0.00012398911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013388084,0.00020711763,0.00019251877,0.00013717724,0.000248268,0.00011494479,0.00071917346,0.000120080156,0.0000015641432],"category_scores_gemma":[0.00021928188,0.00014586911,0.000058669197,0.0010875886,0.00081130816,0.000016562184,0.00043918806,0.00024389486,0.0000044800627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037899223,0.00012783174,0.0012536409,0.00006105925,0.000017737908,0.000003885687,0.00025123166,0.002284151,0.26466218,0.71972144,0.00009648765,0.011141327],"study_design_scores_gemma":[0.00047910013,0.0011864904,0.00034718015,0.000016938702,0.0000050481067,0.000023699178,0.000019202937,0.9376635,0.007172566,0.05269935,0.000113853705,0.0002730753],"about_ca_topic_score_codex":5.662673e-7,"about_ca_topic_score_gemma":0.0000016250932,"teacher_disagreement_score":0.9353793,"about_ca_system_score_codex":0.00008548005,"about_ca_system_score_gemma":0.00023750518,"threshold_uncertainty_score":0.59483695},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006984824673843871,"score_gpt":0.23441218892405868,"score_spread":0.22742736425021481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388667449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20483153,0.000020919435,0.79201734,0.0015257191,0.00021897067,0.00045024775,0.0000020611906,0.00064544956,0.00028777364],"genre_scores_gemma":[0.9549712,0.0000058810647,0.044655435,0.00016442778,0.000088595276,0.000080352744,0.0000017698032,0.000026199326,0.0000061684395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569094,0.00003070865,0.0004167302,0.0012990215,0.00079765514,0.001764956],"domain_scores_gemma":[0.99836266,0.00066174957,0.00016156113,0.00037290485,0.00025946618,0.00018163401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030982653,0.0003234277,0.00036069134,0.0006446027,0.00070072315,0.0006703505,0.002508519,0.00008511103,0.0000028107218],"category_scores_gemma":[0.00029561215,0.0002649001,0.00008459496,0.004257158,0.0009112277,0.0006444113,0.0006373667,0.00049550715,0.000017806737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017340573,0.000038076516,0.00016653276,0.000028161468,0.0000068155337,0.0000046014943,0.0007104719,0.002736263,0.0006998472,0.95932436,0.000014371413,0.03625317],"study_design_scores_gemma":[0.0002766235,0.00037768047,0.001475486,0.00012460284,0.0000048745096,0.00005493478,0.000018431485,0.77266747,0.0011238726,0.22352439,0.000043605167,0.0003080499],"about_ca_topic_score_codex":0.000002705318,"about_ca_topic_score_gemma":0.0000021199999,"teacher_disagreement_score":0.7699312,"about_ca_system_score_codex":0.00031183663,"about_ca_system_score_gemma":0.00036518901,"threshold_uncertainty_score":0.99998033},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; McGill University; Simon Fraser University","funders":"","keywords":"Electronic circuit; Computer science; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.00466237897613747,"score_gpt":0.22454490373767944,"score_spread":0.21988252476154196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388667510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8712371,0.00010774354,0.12368269,0.0016347948,0.0002487794,0.00022312727,9.578054e-7,0.00037522038,0.0024895922],"genre_scores_gemma":[0.98875254,0.00004108222,0.010958096,0.00015177898,0.00006864461,0.0000130937415,1.4646874e-7,0.000010887925,0.0000037080486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704057,0.00002547831,0.00036043042,0.00084892166,0.00061880326,0.0011057674],"domain_scores_gemma":[0.9989461,0.00035768148,0.00010440378,0.0002875346,0.00013410277,0.00017019533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023557045,0.00020781162,0.00032090166,0.00066085893,0.00024312547,0.00024069691,0.0019850652,0.000068565336,0.0000025519817],"category_scores_gemma":[0.00026905193,0.00017890042,0.000052780615,0.0039265146,0.0014882823,0.00040712405,0.0011808028,0.00037914715,0.000008680699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002028213,0.000024863413,0.00027101187,0.00002442809,0.0000033759418,0.0000036631495,0.00070307014,0.000083122075,0.0009682769,0.85925436,0.000014981489,0.1386468],"study_design_scores_gemma":[0.00013078006,0.00018968275,0.003009198,0.0000622322,0.0000026547978,0.00005747324,0.000014000632,0.6951214,0.007501437,0.29368988,0.000035628364,0.00018563992],"about_ca_topic_score_codex":0.0000020953894,"about_ca_topic_score_gemma":3.709098e-7,"teacher_disagreement_score":0.69503826,"about_ca_system_score_codex":0.00006977327,"about_ca_system_score_gemma":0.00019436273,"threshold_uncertainty_score":0.72953475},"labels":[],"label_agreement":null},{"id":"W4388697727","doi":"10.4204/eptcs.395","title":"Proceedings Fifth International Workshop on Formal Methods for Autonomous Systems","year":2023,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Political science; Factory (object-oriented programming); Computer science","score_opus":0.014531621272525292,"score_gpt":0.3218465612347951,"score_spread":0.30731493996226983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388697727","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000144043,0.00020435514,0.9827489,0.00076197175,0.005615371,0.001609501,0.0000108686145,0.0013751432,0.0075298473],"genre_scores_gemma":[0.053060174,0.0002223173,0.9410749,0.0003317245,0.0013511021,0.0015877843,0.00002036837,0.00017066099,0.0021809845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926763,0.000028791152,0.0009809504,0.0024619433,0.0012197209,0.0026322645],"domain_scores_gemma":[0.99728453,0.00050520065,0.0004318291,0.00056520326,0.00089322,0.00032002444],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.006202241,0.0008389959,0.0009033773,0.0017505442,0.0003863095,0.001994835,0.008912334,0.0005674332,0.000018962968],"category_scores_gemma":[0.0002360159,0.00079391774,0.0002386887,0.0027759362,0.00088542275,0.0016992047,0.002502922,0.001817104,0.00019877475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000284665,0.000063175576,0.0000010217149,0.00014602445,0.000026494567,0.000001729505,0.0004727369,0.0009823443,0.00008865774,0.92438227,0.009107386,0.06469967],"study_design_scores_gemma":[0.00032411097,0.0005588614,0.000006099058,0.0007521096,0.000009313125,0.000051719006,0.000004553199,0.8269649,0.0010889334,0.038952604,0.13048247,0.00080431317],"about_ca_topic_score_codex":0.0000035816254,"about_ca_topic_score_gemma":2.0114135e-7,"teacher_disagreement_score":0.8854297,"about_ca_system_score_codex":0.002023664,"about_ca_system_score_gemma":0.00079841574,"threshold_uncertainty_score":0.99945116},"labels":[],"label_agreement":null},{"id":"W4388723135","doi":"10.4204/eptcs.396.3","title":"Semi-Automation of Meta-Theoretic Proofs in Beluga","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; Calculus (dental); Computer science; Natural deduction; Simple (philosophy); Gas meter prover; Beluga; Normalization (sociology); Programming language; Automated theorem proving; Theoretical computer science; Mathematics; Algebra over a field; Pure mathematics; Epistemology; Medicine; Philosophy; Ecology","score_opus":0.013693317650228194,"score_gpt":0.25348481666541406,"score_spread":0.23979149901518587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388723135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2018297,0.0003713351,0.78507185,0.0013546423,0.00053024944,0.0011853061,4.3192713e-7,0.00072867144,0.008927787],"genre_scores_gemma":[0.9956986,0.000021669737,0.004030626,0.00007353144,0.000049068145,0.000092616836,6.842028e-7,0.00001121554,0.00002202574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626726,0.0000634495,0.0006237505,0.0009086739,0.0008925719,0.0012442733],"domain_scores_gemma":[0.99891853,0.00017499863,0.00018887506,0.00037486805,0.0002188818,0.00012382351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005516859,0.0002474941,0.00048425837,0.0008815177,0.00012802814,0.00025722277,0.0024697355,0.0001049399,0.000015317632],"category_scores_gemma":[0.00026518805,0.00019568673,0.000112388276,0.006271531,0.0012361633,0.00089081627,0.0007593668,0.00039152423,0.000049532573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056404283,0.00006441928,0.00057436473,0.00005447757,0.000013120948,0.0000056246918,0.0011590244,0.0001096059,0.00054044405,0.99121463,0.00002092864,0.0062377257],"study_design_scores_gemma":[0.00023963742,0.00027564308,0.0008950559,0.000014848413,0.00001098842,0.000023118246,0.000019701252,0.34081575,0.005766267,0.6516759,0.00007684208,0.00018628883],"about_ca_topic_score_codex":0.000008310487,"about_ca_topic_score_gemma":0.0000041213016,"teacher_disagreement_score":0.79386884,"about_ca_system_score_codex":0.00023936931,"about_ca_system_score_gemma":0.00025884667,"threshold_uncertainty_score":0.7979874},"labels":[],"label_agreement":null},{"id":"W4388734666","doi":"10.4204/eptcs.396.2","title":"Contextual Refinement Types","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; sort; Extension (predicate logic); Computer science; Sorting; Theoretical computer science; Programming language; Mathematics; Information retrieval","score_opus":0.01127090374969492,"score_gpt":0.2507713428775514,"score_spread":0.23950043912785646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388734666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06287155,0.0002501654,0.89409167,0.0033874,0.0014087898,0.00073408755,3.008822e-7,0.0016570599,0.035598963],"genre_scores_gemma":[0.9965356,0.000019113224,0.002870119,0.0002904307,0.00014950863,0.00003921082,5.9469335e-7,0.000009826167,0.00008562549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965948,0.000023772149,0.00034022177,0.00089185796,0.0007618098,0.0013875247],"domain_scores_gemma":[0.99913853,0.00009289198,0.00008298657,0.0003240478,0.00018999654,0.00017156104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002979729,0.00020400558,0.00023854348,0.00041997444,0.0002815053,0.0005353881,0.002537288,0.000070932016,0.000016316564],"category_scores_gemma":[0.00015450903,0.0001651033,0.00005647712,0.0035289412,0.0009293042,0.00062733557,0.0009882399,0.00034228526,0.00027522378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004734229,0.000034391393,0.00025130028,0.000010657325,0.0000037334828,0.000008189354,0.0005933588,0.000010484691,0.0003190511,0.972002,0.0002303434,0.02653174],"study_design_scores_gemma":[0.00040617178,0.0005611632,0.00078811665,0.00001306331,0.0000027112285,0.00004850742,0.000037039736,0.2326599,0.0025229272,0.75708824,0.0055354913,0.0003366773],"about_ca_topic_score_codex":0.00000686021,"about_ca_topic_score_gemma":0.000003121675,"teacher_disagreement_score":0.933664,"about_ca_system_score_codex":0.00023782316,"about_ca_system_score_gemma":0.00026101182,"threshold_uncertainty_score":0.6732717},"labels":[],"label_agreement":null},{"id":"W4390620470","doi":"10.4204/eptcs.397.9","title":"Constructor Theory as Process Theory","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Process (computing); Computer science; Exploit; Category theory; Mathematics; Pure mathematics; Programming language","score_opus":0.006866520292743715,"score_gpt":0.29629701523148155,"score_spread":0.28943049493873785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390620470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40581825,0.000063068124,0.5821631,0.0009028218,0.0005316323,0.00038842595,9.921384e-7,0.00079371425,0.009338013],"genre_scores_gemma":[0.9816382,0.000013604739,0.017402342,0.0006826686,0.00014129489,0.000059685815,0.0000010593079,0.000023580444,0.0000375448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946329,0.00019038157,0.0005088603,0.0015056089,0.0013739235,0.0017883175],"domain_scores_gemma":[0.9973836,0.0013233299,0.00014214216,0.00047370326,0.0003884816,0.00028876995],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.010614208,0.000356301,0.00035498475,0.0009695221,0.0003693594,0.00073099515,0.004565464,0.000102475715,0.000054907345],"category_scores_gemma":[0.0013107718,0.0003193053,0.00009991764,0.007348009,0.0029201678,0.0018270544,0.0015129824,0.00069464,0.00024779438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037655172,0.000046096466,0.0001255309,0.000020666172,0.0000078070425,0.000014096519,0.0015990786,0.00058785605,0.00029848213,0.96042675,0.00002147134,0.03681453],"study_design_scores_gemma":[0.00024622044,0.00017031081,0.0007686139,0.000040631687,0.0000030810877,0.00010672477,0.00006566868,0.30090624,0.0040551033,0.6932871,0.00006382744,0.0002864803],"about_ca_topic_score_codex":7.910923e-7,"about_ca_topic_score_gemma":2.058291e-7,"teacher_disagreement_score":0.57581997,"about_ca_system_score_codex":0.00036176306,"about_ca_system_score_gemma":0.0012750846,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W4393904285","doi":"10.4204/eptcs.401.2","title":"Towards a Semantic Characterisation of Global Type Well-formedness","year":2024,"lang":"en","type":"preprint","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Geological Modeling and Analysis","field":"Earth and Planetary Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Oxford; Canadian Institute of Steel Construction; Agence Nationale de la Recherche; Queen Mary University of London","keywords":"Natural language processing; Computer science; Type (biology); Artificial intelligence; Geology; Paleontology","score_opus":0.00883522109306321,"score_gpt":0.23858656283482238,"score_spread":0.22975134174175918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393904285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869754,0.000571814,0.005015541,0.0008610827,0.0007711003,0.0001917129,0.00001135456,0.00008561001,0.0055164336],"genre_scores_gemma":[0.99810725,0.00010025551,0.0014953879,0.00009237133,0.00017767232,0.0000020409725,0.000015420304,0.0000035264893,0.0000060952575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971059,0.00002383348,0.00046886428,0.000897563,0.0007081762,0.00079569593],"domain_scores_gemma":[0.9992435,0.00003412858,0.00014725617,0.00018642948,0.0002488114,0.00013988113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757161,0.00026664184,0.00044419128,0.00020435848,0.0000908523,0.00025005368,0.0011947011,0.00020432951,0.00026548418],"category_scores_gemma":[0.00013845353,0.0001989401,0.0001184174,0.0017244401,0.0010774572,0.00012278621,0.00051341316,0.00084169774,0.00008119691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011070166,0.00008775635,0.04122369,0.0005679997,0.000050427105,0.000012335524,0.00054039806,0.0077626826,0.00005233812,0.83327293,0.000033326567,0.116285406],"study_design_scores_gemma":[0.000048755537,0.00019371,0.016427258,0.00016489974,0.00002647898,0.000011750855,0.000011220842,0.58453006,0.00008280701,0.39831805,0.000015395326,0.00016963747],"about_ca_topic_score_codex":0.00018790051,"about_ca_topic_score_gemma":0.0000643963,"teacher_disagreement_score":0.5767674,"about_ca_system_score_codex":0.000089570065,"about_ca_system_score_gemma":0.00065770495,"threshold_uncertainty_score":0.8112542},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competition (biology); French horn; Class (philosophy); Computer science; Operations research; Engineering; Sociology; Artificial intelligence","score_opus":0.0072524103978991025,"score_gpt":0.276505250815857,"score_spread":0.2692528404179579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394987214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019764014,0.0002526059,0.96053517,0.0013008164,0.0012765938,0.00028389326,4.365615e-7,0.0006222476,0.015964247],"genre_scores_gemma":[0.74966,0.000021845632,0.24988516,0.00017522577,0.00018143922,0.000033464643,0.0000010027467,0.000011835652,0.000029984598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959771,0.000040868857,0.0005371296,0.0013492319,0.0009511526,0.0011445128],"domain_scores_gemma":[0.99888146,0.00012013572,0.000088731496,0.0005022562,0.00022992211,0.00017749396],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005416739,0.0002499045,0.0002399771,0.0006299296,0.0002573658,0.0012094621,0.002716271,0.0000974635,0.000033361648],"category_scores_gemma":[0.00026842768,0.00022643343,0.00007788172,0.004124702,0.0013886772,0.0023040492,0.00076050416,0.0007362615,0.0001198254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044257954,0.00003719134,0.00003563533,0.00003193117,0.0000033956535,0.000042631324,0.00033442167,0.000021460057,0.001298947,0.9750249,0.00006812618,0.023096971],"study_design_scores_gemma":[0.00007793094,0.00016565631,0.0003061036,0.000100394,0.000002558632,0.0006728234,0.000006225117,0.6161463,0.0060540764,0.37454882,0.0016974299,0.00022164646],"about_ca_topic_score_codex":0.0000044007243,"about_ca_topic_score_gemma":8.763806e-7,"teacher_disagreement_score":0.729896,"about_ca_system_score_codex":0.0006793249,"about_ca_system_score_gemma":0.00052898604,"threshold_uncertainty_score":0.9998274},"labels":[],"label_agreement":null},{"id":"W4394989431","doi":"10.4204/eptcs.402.3","title":"Mechanizing Session-Types: Enforcing Linearity without Linearity","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linearity; Session (web analytics); Computer science; Electrical engineering; World Wide Web; Engineering","score_opus":0.008867492183074456,"score_gpt":0.24546971506241758,"score_spread":0.23660222287934313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394989431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46750692,0.0007462112,0.5169119,0.0025551014,0.0012982727,0.00032261878,5.993437e-7,0.0011780608,0.0094802845],"genre_scores_gemma":[0.9946649,0.000019513433,0.0030278952,0.0009252242,0.0012881592,0.000013820793,0.0000022469494,0.0000305738,0.000027659202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689597,0.0000047376766,0.00040313418,0.0009558181,0.0007089661,0.0010313872],"domain_scores_gemma":[0.9992115,0.000053208107,0.0000886938,0.00017510087,0.00042970642,0.000041778378],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028060437,0.00028560773,0.0003222346,0.00078571955,0.0004767881,0.00206228,0.0009445538,0.00011041665,0.000062758285],"category_scores_gemma":[0.00031015003,0.00023314026,0.00009535814,0.0041030813,0.00060676766,0.002579492,0.00062876276,0.0007967514,0.00008397672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014374676,0.000040770694,0.00068900676,0.00023842328,0.000009097799,0.000005216878,0.000098650424,0.00038403698,0.0007079623,0.9828644,0.000019784084,0.014928281],"study_design_scores_gemma":[0.00011614975,0.000015005972,0.000044508306,0.00034076144,0.00003066542,0.000009109192,0.000024672881,0.79087037,0.00058258034,0.20692794,0.00077803305,0.00026017422],"about_ca_topic_score_codex":0.000064710555,"about_ca_topic_score_gemma":0.000007329515,"teacher_disagreement_score":0.79048634,"about_ca_system_score_codex":0.00019170095,"about_ca_system_score_gemma":0.00024549733,"threshold_uncertainty_score":0.99897367},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Electronic circuit; Computer science; Mathematics; Engineering; Electrical engineering","score_opus":0.007500263343795225,"score_gpt":0.2688134216711506,"score_spread":0.26131315832735535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396945312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99088615,0.00042638983,0.00090381753,0.00028996568,0.0004959996,0.00030866137,0.000031080508,0.0003413861,0.0063165254],"genre_scores_gemma":[0.99886954,0.000105215906,0.00041316502,0.000020469146,0.000344743,0.00013602151,0.000004597995,0.000070574075,0.000035645782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949849,0.0000015296368,0.0008928571,0.0017645824,0.0009826245,0.0013734819],"domain_scores_gemma":[0.99795276,0.0005129353,0.00031538392,0.00066946977,0.00033638618,0.0002130613],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018802491,0.00053418725,0.00075998553,0.0006130651,0.00016025377,0.00051756174,0.0024874795,0.00046798264,0.00016105556],"category_scores_gemma":[0.00091978355,0.0005271407,0.0002912688,0.0011280418,0.003602615,0.00016126523,0.003242484,0.0028808538,0.00004069731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046794034,0.00033579534,0.00032478163,0.0020855977,0.00007376466,0.0000145930435,0.00074052426,0.0001907057,0.19758862,0.7798625,0.00005175037,0.018684572],"study_design_scores_gemma":[0.00020458603,0.00004467875,0.00008689397,0.0017067788,0.00008406381,0.00009251771,0.000034487985,0.16463241,0.55095214,0.28156078,0.000051555307,0.0005491181],"about_ca_topic_score_codex":0.000031668576,"about_ca_topic_score_gemma":0.0000035608643,"teacher_disagreement_score":0.49830174,"about_ca_system_score_codex":0.0016590001,"about_ca_system_score_gemma":0.001410481,"threshold_uncertainty_score":0.999718},"labels":[],"label_agreement":null},{"id":"W4399803815","doi":"10.4204/eptcs.403.4","title":"Computing Tiling Properties of Polyforms","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.006365792233128846,"score_gpt":0.22367440747964973,"score_spread":0.21730861524652087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399803815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98827225,0.0017522736,0.007526712,0.00020901108,0.00038131585,0.00015874847,6.7878403e-7,0.00014866152,0.00155032],"genre_scores_gemma":[0.99750865,0.00001547589,0.0022446858,0.00006507655,0.0001413953,0.000003786561,1.17450995e-7,0.000013551525,0.0000072520916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99773234,0.000012377894,0.0003691729,0.0005412916,0.0005203374,0.00082448724],"domain_scores_gemma":[0.9996015,0.000039013838,0.00005052738,0.00011525908,0.00011478423,0.00007891848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017616274,0.00016943447,0.00022578395,0.00020791269,0.00017634196,0.00040043835,0.00081847043,0.000052513995,0.000077056015],"category_scores_gemma":[0.00007935694,0.00011068972,0.000050485698,0.000914954,0.0021298227,0.00054605096,0.000389961,0.00030155887,0.000015089743],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001859249,0.000009919288,0.000025416437,0.000105590545,0.0000014069266,0.0000011932487,0.001097272,0.000030498593,0.44237027,0.5496418,0.000004878397,0.0066932025],"study_design_scores_gemma":[0.000079297504,0.00023073543,0.000059856153,0.0004181475,0.0000038804424,0.00005020674,0.0000651204,0.1914397,0.73136693,0.07601188,0.00010149115,0.00017272655],"about_ca_topic_score_codex":0.000013256007,"about_ca_topic_score_gemma":0.0000010422024,"teacher_disagreement_score":0.4736299,"about_ca_system_score_codex":0.00016154544,"about_ca_system_score_gemma":0.00025475622,"threshold_uncertainty_score":0.78474206},"labels":[],"label_agreement":null},{"id":"W4399803839","doi":"10.4204/eptcs.403.16","title":"Uniform Sampling and Visualization of 3D Reluctant Walks","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthant; Random walk; Sampling (signal processing); Sample (material); Visualization; Mathematics; Statistical physics; Combinatorics; Computer science; Statistics; Data mining; Physics; Computer vision","score_opus":0.010211621795285286,"score_gpt":0.29270100765312157,"score_spread":0.2824893858578363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399803839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019357344,0.00026364683,0.97817916,0.0003301342,0.0001553836,0.000106671796,7.761658e-7,0.00016107706,0.0014458131],"genre_scores_gemma":[0.969103,0.00012994123,0.030567963,0.00013968181,0.00004071135,0.0000029141786,0.0000011728663,0.000008182403,0.000006424569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980764,0.000010606435,0.00033201344,0.00060007896,0.0004778687,0.00050303934],"domain_scores_gemma":[0.9994418,0.00007856493,0.00005570037,0.00016596695,0.000161156,0.000096835625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016401485,0.00013492454,0.00016505754,0.00046987634,0.00011522701,0.00057328556,0.0009671803,0.00004821986,0.000008176469],"category_scores_gemma":[0.00012886524,0.00011524415,0.000023007628,0.0027454386,0.0008060684,0.0011509679,0.000565419,0.00018822393,0.0000039623305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020623088,0.000021437087,0.00010957478,0.000049579623,0.000002770598,0.0000012788672,0.0005437524,0.000020390415,0.0009710598,0.97736853,0.000007734874,0.020901805],"study_design_scores_gemma":[0.000082213875,0.00014307258,0.0001518414,0.00012251745,0.0000033243286,0.000029530169,0.0000100111765,0.79465514,0.0026014678,0.20166703,0.00041035295,0.00012348316],"about_ca_topic_score_codex":0.0000017783447,"about_ca_topic_score_gemma":5.4340177e-7,"teacher_disagreement_score":0.94974566,"about_ca_system_score_codex":0.00012806528,"about_ca_system_score_gemma":0.00024245567,"threshold_uncertainty_score":0.5528206},"labels":[],"label_agreement":null},{"id":"W4399803897","doi":"10.4204/eptcs.403.31","title":"LLT Polynomials and Hecke Algebra Traces","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"National Science Foundation","keywords":"Hecke algebra; TRACE (psycholinguistics); Mathematics; Basis (linear algebra); Pure mathematics; Algebra over a field; Macdonald polynomials; Hecke operator; Discrete orthogonal polynomials; Orthogonal polynomials; Linguistics; Philosophy; Modular form","score_opus":0.00911369497939203,"score_gpt":0.2914685498078059,"score_spread":0.2823548548284139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399803897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9315554,0.001428382,0.06189184,0.0011731861,0.00023681912,0.0002370051,9.252457e-7,0.00026964777,0.0032068044],"genre_scores_gemma":[0.9881866,0.00006412562,0.011354877,0.00014926067,0.00018033355,0.00001373059,1.5772864e-7,0.000018980027,0.000031956246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774265,0.000011066836,0.0002898463,0.0006877392,0.00039941072,0.00086927816],"domain_scores_gemma":[0.9992606,0.00037562437,0.000037409074,0.00012358387,0.000060331295,0.00014246812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016497489,0.00019871487,0.00024668127,0.00035102418,0.00016110203,0.0003874875,0.00052511535,0.00007242931,0.000045023786],"category_scores_gemma":[0.00034154012,0.00015852616,0.000042325883,0.0014316024,0.0015536863,0.0006109631,0.000274198,0.00046205486,0.000014586562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008716932,0.000028192095,0.000059102804,0.00007311826,0.0000052290006,0.000005634353,0.000483156,5.3246737e-7,0.0011620624,0.9745648,0.00007015482,0.023539308],"study_design_scores_gemma":[0.00013097182,0.00019343839,0.00009767659,0.0001270221,0.000008598725,0.00010203618,0.0000386381,0.02342079,0.007872906,0.967566,0.00023563787,0.00020627111],"about_ca_topic_score_codex":3.6144687e-7,"about_ca_topic_score_gemma":7.5417927e-7,"teacher_disagreement_score":0.056631185,"about_ca_system_score_codex":0.0001538592,"about_ca_system_score_gemma":0.00014958887,"threshold_uncertainty_score":0.64645094},"labels":[],"label_agreement":null},{"id":"W4399803900","doi":"10.4204/eptcs.403.7","title":"Power Quotients of Plactic-like Monoids","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Monoid; Quotient; Congruence relation; Syntactic monoid; Mathematics; Free monoid; Pure mathematics; Set (abstract data type); Generator (circuit theory); Power (physics); Combinatorics; Algebra over a field; Computer science; Physics","score_opus":0.0032465031534163933,"score_gpt":0.22655064517696422,"score_spread":0.2233041420235478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399803900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37874684,0.00069148693,0.60792416,0.00081937003,0.0012600935,0.00027134703,0.0000010446273,0.00050979864,0.009775876],"genre_scores_gemma":[0.98620373,0.000018933371,0.01344378,0.00023584883,0.000053919117,0.000011674467,2.11155e-7,0.00001411769,0.000017786024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672925,0.000022983837,0.00041531908,0.0009743678,0.00079574133,0.0010623592],"domain_scores_gemma":[0.9990649,0.0001931185,0.00006887619,0.00037120588,0.00014443316,0.00015743764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023551867,0.00023222514,0.00026420574,0.0005583057,0.00012466595,0.0005496406,0.0028574425,0.000079975405,0.000038987353],"category_scores_gemma":[0.00008975658,0.00019327001,0.00008665703,0.0028971513,0.0013622512,0.001568207,0.00093704497,0.0004985726,0.000037646747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008582024,0.000066659326,0.00008753953,0.000029519455,0.000006140252,0.000008299366,0.0009678851,0.000011163861,0.0023688667,0.9845255,0.00009221156,0.01182764],"study_design_scores_gemma":[0.000174543,0.0004417914,0.00036484672,0.0001538833,0.0000034420812,0.00007826191,0.000022124903,0.48586127,0.0134156365,0.49874038,0.00048651025,0.00025731075],"about_ca_topic_score_codex":0.0000022542217,"about_ca_topic_score_gemma":2.0307539e-7,"teacher_disagreement_score":0.6074569,"about_ca_system_score_codex":0.00026359354,"about_ca_system_score_gemma":0.00038540296,"threshold_uncertainty_score":0.78813225},"labels":[],"label_agreement":null},{"id":"W4399804111","doi":"10.4204/eptcs.403.29","title":"On the Orthogonality of Generalized Pattern Sequences","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Integer (computer science); Combinatorics; Mathematics; Orthogonality; Word (group theory); Binary number; Finite set; Set (abstract data type); Discrete mathematics; Arithmetic","score_opus":0.007625491408060929,"score_gpt":0.24426465859038907,"score_spread":0.23663916718232814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399804111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50649357,0.0003647946,0.48557374,0.004344311,0.0003816173,0.00021741337,0.000001185072,0.00023228054,0.002391095],"genre_scores_gemma":[0.99640894,0.00002644214,0.002596965,0.00086046744,0.00007258362,0.000020204736,2.0128375e-7,0.000008066687,0.000006139557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972838,0.000054995264,0.0003479441,0.00077944476,0.0007716022,0.00076220045],"domain_scores_gemma":[0.9988526,0.0005260404,0.00006551401,0.00036742282,0.00010492845,0.00008349463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004114339,0.00019331396,0.0002087137,0.00023886058,0.00017184735,0.0005318408,0.003066493,0.000050741353,0.000046976977],"category_scores_gemma":[0.00013370684,0.00011669396,0.000085597756,0.002131012,0.0018071345,0.00060129864,0.00058794906,0.00045205173,0.00002069367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041145627,0.000030878986,0.00004787134,0.000019717705,0.0000051384363,0.0000050774674,0.00046329372,0.000018093815,0.0014032488,0.9604681,0.000054855445,0.037479613],"study_design_scores_gemma":[0.00005626349,0.00015563253,0.00014971118,0.00009594295,0.0000017533578,0.000024298295,0.0000064114292,0.38302094,0.0095220925,0.6067794,0.00007859791,0.00010898074],"about_ca_topic_score_codex":0.0000062660206,"about_ca_topic_score_gemma":7.331451e-7,"teacher_disagreement_score":0.48991537,"about_ca_system_score_codex":0.00015084952,"about_ca_system_score_gemma":0.000311196,"threshold_uncertainty_score":0.6658462},"labels":[],"label_agreement":null},{"id":"W4399804130","doi":"10.4204/eptcs.403.32","title":"HBS Tilings Extended: State of the Art and Novel Observations","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Surface Polishing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"State (computer science); Statistical physics; Mathematics; Physics; Algorithm","score_opus":0.006868616332461763,"score_gpt":0.2328019738925436,"score_spread":0.22593335756008182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399804130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47655243,0.00035870844,0.5204267,0.0005496317,0.0001838225,0.00020561865,0.0000026659775,0.00048511368,0.0012353157],"genre_scores_gemma":[0.9710781,0.000042504947,0.028776078,0.000049073744,0.000018611305,0.000009796412,1.2322076e-7,0.000014840447,0.000010868448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998866,0.000002923092,0.0001860983,0.00026266355,0.00024991526,0.0004323632],"domain_scores_gemma":[0.9996863,0.00007553987,0.000016865539,0.00011521102,0.0000602975,0.00004579531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930827,0.000112676804,0.000111440706,0.00011415098,0.00006472234,0.00013017292,0.0005226209,0.000028938204,0.0000021108199],"category_scores_gemma":[0.000093238996,0.00008503933,0.000023770306,0.0010142437,0.0010343369,0.0004584581,0.00021999226,0.00039437783,0.000001138451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013315585,0.000007404675,0.00006855377,0.00004150134,0.0000025952907,2.1677204e-7,0.00034023187,0.0005785434,0.025750348,0.9687653,0.000048602506,0.0043953727],"study_design_scores_gemma":[0.000036017856,0.00003461764,0.00092583074,0.00012012022,0.000002500224,0.000012258881,0.0000036967397,0.5253703,0.045383967,0.42769653,0.00032351163,0.00009067175],"about_ca_topic_score_codex":7.9365685e-7,"about_ca_topic_score_gemma":0.0000012504483,"teacher_disagreement_score":0.5410688,"about_ca_system_score_codex":0.00015394254,"about_ca_system_score_gemma":0.00007264768,"threshold_uncertainty_score":0.38110572},"labels":[],"label_agreement":null},{"id":"W4399804137","doi":"10.4204/eptcs.403.30","title":"Counting Polyominoes in a Rectangle b x h","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Diatoms and Algae Research","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Rectangle; Combinatorics; Mathematics; Arithmetic; Computer science; Discrete mathematics; Geometry","score_opus":0.006244672072277034,"score_gpt":0.2675106944241739,"score_spread":0.2612660223518969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399804137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884209,0.00063680275,0.0020294173,0.00068467495,0.00028137342,0.00018201226,7.462708e-7,0.0001462614,0.007617833],"genre_scores_gemma":[0.998133,0.000029362513,0.0015476475,0.00009063646,0.0001417668,0.00002439695,1.7070886e-7,0.000014030481,0.000019000741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689543,0.000019038724,0.00028337963,0.00076326507,0.00067928445,0.001359625],"domain_scores_gemma":[0.9995142,0.00015831762,0.000023553273,0.00011699906,0.000075383155,0.00011152019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004472489,0.00014861135,0.00018527011,0.0004900258,0.00012413642,0.00092582527,0.0009466758,0.000054774944,0.00017499889],"category_scores_gemma":[0.00020169269,0.000120183344,0.00003468779,0.0023103296,0.0012880596,0.00075959426,0.00039421834,0.0004734677,0.00012293957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012437363,0.000035849956,0.00048044318,0.000036171354,6.647571e-7,0.000017648896,0.00038991563,0.000005462282,0.076981306,0.9146802,0.00003035715,0.0073295375],"study_design_scores_gemma":[0.0003790617,0.0004632723,0.0016874904,0.00063659606,0.0000037948198,0.000108619926,0.00009575158,0.3690211,0.19374114,0.4323435,0.0010019157,0.0005177638],"about_ca_topic_score_codex":0.00002209278,"about_ca_topic_score_gemma":0.000008292018,"teacher_disagreement_score":0.4823367,"about_ca_system_score_codex":0.00046543288,"about_ca_system_score_gemma":0.00047638896,"threshold_uncertainty_score":0.8927754},"labels":[],"label_agreement":null},{"id":"W4399830230","doi":"10.4204/eptcs.403.25","title":"Detecting Isohedral Polyforms with a SAT Solver","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Solver; Range (aeronautics); Boolean satisfiability problem; Theoretical computer science; Software; Programming language; Code (set theory); Parallel computing; Algorithm; Set (abstract data type)","score_opus":0.00877650782574143,"score_gpt":0.2796964007061778,"score_spread":0.2709198928804364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399830230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59926564,0.00012512167,0.39428264,0.0003502939,0.00042310928,0.00045191497,4.0639438e-7,0.0005925664,0.0045082835],"genre_scores_gemma":[0.9336792,0.0000039503943,0.06598312,0.000055604316,0.00018461139,0.00003080285,1.1424731e-7,0.00004249677,0.000020082094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968952,0.000010136862,0.00036935016,0.00071430096,0.00076708326,0.0012439506],"domain_scores_gemma":[0.9989946,0.00042108496,0.00007181982,0.0002259532,0.00014220412,0.00014435804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738041,0.00028226146,0.00030465767,0.00031877198,0.00021400298,0.00043624968,0.0008725915,0.00008075047,0.00002480515],"category_scores_gemma":[0.00045542236,0.00019907861,0.000057701473,0.0019732092,0.0012395286,0.0007980164,0.00035348497,0.0007672983,0.0000233755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024684401,0.000047889505,0.000031743868,0.000118547934,0.000008339326,0.000011583103,0.0010675945,0.00000411149,0.00093357044,0.99333256,0.000012790499,0.004406594],"study_design_scores_gemma":[0.00023862504,0.00047332823,0.000008370619,0.00034114308,0.000013217577,0.0001795283,0.000060075286,0.08832892,0.009486579,0.900541,0.000053416417,0.00027581578],"about_ca_topic_score_codex":7.493003e-7,"about_ca_topic_score_gemma":0.0000016643237,"teacher_disagreement_score":0.33441356,"about_ca_system_score_codex":0.00058885274,"about_ca_system_score_gemma":0.00031552408,"threshold_uncertainty_score":0.811819},"labels":[],"label_agreement":null},{"id":"W4399830286","doi":"10.4204/eptcs.403.26","title":"A Symmetry Property of Christoffel Words","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Symmetry (geometry); Cardinality (data modeling); Property (philosophy); Mathematics; Bivariate analysis; Pure mathematics; Algebra over a field; Computer science; Geometry; Philosophy; Statistics; Epistemology","score_opus":0.004598778382710914,"score_gpt":0.22805784423766448,"score_spread":0.22345906585495356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399830286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15345524,0.0015351404,0.83000684,0.0018131651,0.00080696377,0.00037343142,9.659304e-7,0.000690564,0.011317697],"genre_scores_gemma":[0.9807689,0.000047099093,0.018809697,0.00020413128,0.00010777107,0.000018341427,1.9258789e-7,0.000013928642,0.000029917599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968028,0.000024174173,0.00041115872,0.0009877081,0.0007477528,0.0010264125],"domain_scores_gemma":[0.99914813,0.00015366891,0.000062023486,0.00036370463,0.0001287943,0.00014370774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981815,0.00022779922,0.00028444524,0.000591849,0.00012541968,0.000526085,0.0030570864,0.000078897545,0.000016908429],"category_scores_gemma":[0.00012040668,0.00015045196,0.00008893133,0.003972264,0.0016488573,0.0012544118,0.00096976856,0.0005387563,0.000026349482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006062458,0.000053836542,0.000039013157,0.000054567383,0.0000050852873,0.000008196721,0.00072240055,0.000003116839,0.0031399834,0.90260017,0.000080704755,0.09328684],"study_design_scores_gemma":[0.00011791264,0.00027007645,0.00013036215,0.00020435902,0.0000032890257,0.000086450484,0.000013771786,0.52926433,0.016610062,0.45249328,0.00059907115,0.00020703398],"about_ca_topic_score_codex":0.0000049768837,"about_ca_topic_score_gemma":3.6670244e-7,"teacher_disagreement_score":0.82731366,"about_ca_system_score_codex":0.00027193903,"about_ca_system_score_gemma":0.000499609,"threshold_uncertainty_score":0.6135253},"labels":[],"label_agreement":null},{"id":"W4399830315","doi":"10.4204/eptcs.403.28","title":"Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Palindrome; Alphabet; Ternary operation; Iterated function; Combinatorics; Cluster analysis; Mathematics; Word (group theory); Computer science; Biology; Genetics; Linguistics; Statistics; Philosophy","score_opus":0.0036366341824186185,"score_gpt":0.2320275942637919,"score_spread":0.2283909600813733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399830315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5985472,0.001312684,0.39659786,0.000949024,0.00049508124,0.00021242467,8.035959e-7,0.0005749087,0.0013100265],"genre_scores_gemma":[0.9878001,0.00006685589,0.011469731,0.00046585154,0.00013928824,0.00002042232,4.2697832e-7,0.000018801426,0.000018481773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673307,0.000029166062,0.0003313087,0.0012094139,0.0005495977,0.0011474319],"domain_scores_gemma":[0.9992473,0.00018318422,0.000042827396,0.00027459723,0.000057920886,0.00019416225],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020784023,0.0002893986,0.00026377055,0.00052120455,0.00022159962,0.001993084,0.0017431917,0.000085467706,0.000026981572],"category_scores_gemma":[0.000055149354,0.00023928375,0.000056090907,0.0021829414,0.0010754314,0.0018057809,0.0013479724,0.00056720973,0.000016332378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008150456,0.000028282993,0.00026467338,0.00004947504,0.000007775681,0.000042526503,0.0016670455,0.000011043142,0.0023774873,0.94692045,0.00002891638,0.048594154],"study_design_scores_gemma":[0.00018507228,0.00025852755,0.000830396,0.00023746843,0.0000037934485,0.00032709845,0.0000137022835,0.79620427,0.0015782855,0.19989666,0.00018681522,0.00027792348],"about_ca_topic_score_codex":0.000003950771,"about_ca_topic_score_gemma":0.0000010370316,"teacher_disagreement_score":0.7961932,"about_ca_system_score_codex":0.00022910425,"about_ca_system_score_gemma":0.00020627517,"threshold_uncertainty_score":0.9990429},"labels":[],"label_agreement":null},{"id":"W4400407587","doi":"10.4204/eptcs.405","title":"Proceedings of the Thirteenth Workshop on Trends in Functional Programming in Education","year":2024,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science","score_opus":0.008677346374010785,"score_gpt":0.2684802496949892,"score_spread":0.2598029033209784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400407587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59983295,0.012366326,0.07307526,0.034057528,0.0369962,0.007953338,0.000008912912,0.0017793608,0.23393013],"genre_scores_gemma":[0.9896614,0.000045260684,0.00777739,0.00019499204,0.00032839953,0.00016088462,0.0000027687101,0.000038322123,0.0017906138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453413,0.00004720427,0.0008053596,0.0017796007,0.0013270064,0.0015067107],"domain_scores_gemma":[0.99882436,0.00016287358,0.00033506917,0.0003323731,0.00022012931,0.00012517684],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003982294,0.0005107765,0.0005414106,0.0024254266,0.00020811106,0.0009836613,0.0037691952,0.0003304307,0.000028982504],"category_scores_gemma":[0.00023334744,0.00039051787,0.00016877965,0.009408,0.0011791921,0.00069192366,0.0011800174,0.003916277,0.00005548695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018929806,0.00025939135,0.00022284174,0.00009629584,0.0000046928058,7.5653367e-7,0.0018122282,0.00015349973,0.00002711057,0.67212397,0.0013115653,0.32396874],"study_design_scores_gemma":[0.0040295357,0.004540895,0.026843099,0.040369384,0.00010726461,0.0005111186,0.001710856,0.41323236,0.0035293528,0.24238299,0.25595438,0.006788747],"about_ca_topic_score_codex":0.000019927282,"about_ca_topic_score_gemma":0.00001125078,"teacher_disagreement_score":0.42974097,"about_ca_system_score_codex":0.001386657,"about_ca_system_score_gemma":0.0012673248,"threshold_uncertainty_score":0.9998547},"labels":[],"label_agreement":null},{"id":"W4401460213","doi":"10.4204/eptcs.406.1","title":"A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Simon Fraser University","funders":"","keywords":"Toffoli gate; Hadamard transform; Arithmetic; Qubit; Computer science; Mathematics; Physics; Quantum gate; Quantum; Quantum mechanics","score_opus":0.00939213605732696,"score_gpt":0.2490098491788436,"score_spread":0.23961771312151664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401460213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047740493,0.00066995685,0.9478384,0.0018840028,0.00045618837,0.0004010397,0.0000031512586,0.00031655154,0.0006901841],"genre_scores_gemma":[0.95688486,0.0000105677445,0.042276237,0.00047166232,0.00029505053,0.000032382297,9.3072083e-7,0.00001761827,0.000010677331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965809,0.000033858465,0.00034502233,0.001248631,0.0006102446,0.0011813447],"domain_scores_gemma":[0.9983769,0.0009773324,0.000054329463,0.00023045814,0.0001670408,0.00019391609],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034264484,0.0002765135,0.00026705157,0.00043967072,0.0004414493,0.0014187943,0.0016567371,0.0000752923,0.0000073498923],"category_scores_gemma":[0.00023457849,0.0002323819,0.00008382995,0.0014998341,0.001308597,0.00068727206,0.0007517694,0.00050680025,0.000008713895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071438885,0.000023526107,0.000014650342,0.000047387945,0.00000840704,0.0000041279322,0.0007659346,0.00011694713,0.0004715005,0.8982448,0.000020290698,0.10027529],"study_design_scores_gemma":[0.00014151516,0.0002034502,0.00010252678,0.000055952056,0.0000033013928,0.00009083636,0.000004028333,0.49911454,0.00017481663,0.49961463,0.00032921575,0.00016518559],"about_ca_topic_score_codex":9.329722e-7,"about_ca_topic_score_gemma":5.8945164e-7,"teacher_disagreement_score":0.9091444,"about_ca_system_score_codex":0.0001927667,"about_ca_system_score_gemma":0.00035853166,"threshold_uncertainty_score":0.9996178},"labels":[],"label_agreement":null},{"id":"W4403877379","doi":"10.4204/eptcs.409.11","title":"A Game-Theoretic Approach for Security Control Selection","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Information and Cyber Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Selection (genetic algorithm); Computer science; Game theory; Control (management); Mathematical economics; Economics; Artificial intelligence","score_opus":0.003990559499816152,"score_gpt":0.22950760412864607,"score_spread":0.2255170446288299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403877379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009336317,0.00015726523,0.980171,0.0007295701,0.00034736277,0.0006875395,0.0000015719916,0.00056955166,0.007999799],"genre_scores_gemma":[0.97077733,0.000012358518,0.02827014,0.0006031952,0.00016936766,0.00014481088,0.0000015073985,0.000013330611,0.000007964083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966951,0.00002906667,0.00042602047,0.00095148984,0.00064127543,0.0012570623],"domain_scores_gemma":[0.99907595,0.00015578889,0.00006476369,0.00021997491,0.00030264052,0.00018089994],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0035924122,0.00026112772,0.00025796864,0.00052307505,0.0002736606,0.0013936005,0.001889603,0.00011337728,0.000011735696],"category_scores_gemma":[0.00011162929,0.00022659561,0.00011700664,0.0026493883,0.0009925329,0.002006202,0.00027156493,0.0006074448,0.000018876548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019008306,0.000059324928,0.000022898465,0.00010152962,0.000006644943,7.3457784e-7,0.0019194292,0.0000624379,0.000111310575,0.99045604,0.00007557898,0.00716504],"study_design_scores_gemma":[0.00028507595,0.00021290744,0.000021528731,0.00002843051,0.000004321392,0.00006201394,0.000010726078,0.59715974,0.0012385956,0.4002626,0.00053438987,0.00017968257],"about_ca_topic_score_codex":0.0000015195054,"about_ca_topic_score_gemma":5.22421e-7,"teacher_disagreement_score":0.961441,"about_ca_system_score_codex":0.00048099426,"about_ca_system_score_gemma":0.0005073559,"threshold_uncertainty_score":0.999643},"labels":[],"label_agreement":null},{"id":"W4404537869","doi":"10.4204/eptcs.412","title":"Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics","year":2024,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.011782314654715121,"score_gpt":0.2760641878329189,"score_spread":0.2642818731782038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404537869","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23409106,0.007945755,0.28282642,0.025747936,0.060749464,0.011173085,0.000052530355,0.0018094426,0.3756043],"genre_scores_gemma":[0.99636656,0.00022281031,0.0010953943,0.00041472106,0.0007573187,0.00013591308,0.000016452388,0.000041389987,0.0009494186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938055,0.000039558352,0.00082855567,0.0023137878,0.0015356193,0.0014769799],"domain_scores_gemma":[0.99837893,0.00029890938,0.00028513788,0.00031347887,0.0004678744,0.00025568673],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016983777,0.00074190105,0.0007190254,0.0011355533,0.00032240158,0.003075887,0.003823529,0.00042535353,0.00006314465],"category_scores_gemma":[0.00026474777,0.0006133084,0.00010689401,0.0021785481,0.001514526,0.0010400293,0.0015702845,0.0022133538,0.00018177928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005461493,0.000101761434,0.00009133588,0.00012719394,0.000019580046,0.000013231554,0.001217816,0.00008754623,0.000070724636,0.98658943,0.0014568887,0.010169886],"study_design_scores_gemma":[0.002189565,0.0017734291,0.0004182755,0.0026039216,0.000024140705,0.00023757797,0.00023111666,0.5524641,0.0016331058,0.42435157,0.0117919855,0.0022811429],"about_ca_topic_score_codex":0.0000051146917,"about_ca_topic_score_gemma":0.0000032206915,"teacher_disagreement_score":0.7622755,"about_ca_system_score_codex":0.0008519879,"about_ca_system_score_gemma":0.0006436951,"threshold_uncertainty_score":0.9996318},"labels":[],"label_agreement":null},{"id":"W4407349698","doi":"10.4204/eptcs.416.35","title":"Logical foundations of Smart Contracts","year":2025,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Business; Computer science","score_opus":0.0054517392931537935,"score_gpt":0.25214547667799064,"score_spread":0.24669373738483685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407349698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109606445,0.00009262473,0.8766553,0.004166249,0.00011294823,0.00025343426,2.6953398e-7,0.0001702419,0.008942497],"genre_scores_gemma":[0.968393,0.000014970369,0.031173535,0.0003599884,0.000012067119,0.00003636254,1.5952803e-7,0.0000024224498,0.000007453039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981014,0.000014159682,0.00034605095,0.00061533117,0.0002879299,0.0006351361],"domain_scores_gemma":[0.9990621,0.00016101306,0.0000827735,0.0003616441,0.0002692626,0.00006321481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398504,0.00012824236,0.00021521602,0.00044749238,0.00022685528,0.00012721855,0.0025373243,0.00010715557,0.000008011899],"category_scores_gemma":[0.00021653692,0.000113863236,0.000044387358,0.00325152,0.002303967,0.00035076804,0.0007400732,0.00043071582,0.0000054561256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047065173,0.00011749699,0.0003784094,0.0000059018066,0.000003206843,4.6290845e-7,0.000087459375,0.0000045925426,0.0008646555,0.9820721,0.000025375435,0.016435608],"study_design_scores_gemma":[0.00020181826,0.00014076446,0.0016266609,0.000024499468,0.0000024880912,0.00000976484,0.0000055734763,0.17470527,0.011725056,0.81097305,0.0004856365,0.00009944424],"about_ca_topic_score_codex":0.0000026882178,"about_ca_topic_score_gemma":0.000002542211,"teacher_disagreement_score":0.8587866,"about_ca_system_score_codex":0.00015522308,"about_ca_system_score_gemma":0.00036229898,"threshold_uncertainty_score":0.8489062},"labels":[],"label_agreement":null},{"id":"W4410727648","doi":"10.4204/eptcs.420","title":"Proceedings 16th International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software","year":2025,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.021440658531715506,"score_gpt":0.28019407107126326,"score_spread":0.25875341253954776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410727648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002645709,0.002481664,0.928078,0.0038979426,0.0013279526,0.0032595526,0.000009699258,0.0008664651,0.057433013],"genre_scores_gemma":[0.7508408,0.0003618297,0.24485621,0.00088067434,0.0003502769,0.0007442762,0.000016196822,0.000056788514,0.0018929861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994053,0.00005793674,0.00081658736,0.0021976577,0.00130917,0.0015656179],"domain_scores_gemma":[0.9977039,0.00041253722,0.00037669242,0.0006888563,0.00048886513,0.00032916668],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030620352,0.00068721053,0.0007178492,0.0017829842,0.00041945765,0.0022404247,0.008166084,0.0003847084,0.000029350256],"category_scores_gemma":[0.0006925513,0.0006450312,0.000102667094,0.004011675,0.001199394,0.001048505,0.0036260474,0.0018472725,0.00010604215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018763003,0.00012887814,0.000047103167,0.00015696001,0.00001920818,0.0000023224097,0.0026032708,0.000008303729,0.000039407078,0.9050369,0.0062651355,0.08567372],"study_design_scores_gemma":[0.004701756,0.0052170404,0.00038232372,0.030464545,0.00015300211,0.0007164431,0.0017612631,0.45836604,0.021964453,0.3294035,0.13572298,0.01114668],"about_ca_topic_score_codex":0.0000068511176,"about_ca_topic_score_gemma":0.0000010832058,"teacher_disagreement_score":0.74819505,"about_ca_system_score_codex":0.0011876634,"about_ca_system_score_gemma":0.000736717,"threshold_uncertainty_score":0.9996001},"labels":[],"label_agreement":null},{"id":"W4413306518","doi":"10.4204/eptcs.426.9","title":"Contributions to the Theory of Clifford-Cyclotomic Circuits","year":2025,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electronic circuit; Mathematics; Computer science; Engineering; Electrical engineering","score_opus":0.004630297809018311,"score_gpt":0.25464051451053826,"score_spread":0.25001021670151996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09173695,0.0002030859,0.89741296,0.0055762287,0.0004336986,0.0006203667,0.0000022271686,0.00017680947,0.003837655],"genre_scores_gemma":[0.9951339,0.0000106184525,0.0035729094,0.0011494334,0.00004946454,0.00005085426,3.4347056e-7,0.000007900455,0.00002457177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657613,0.0000820942,0.0005351694,0.0008920823,0.00067114586,0.0012433669],"domain_scores_gemma":[0.99807423,0.00045865943,0.00011812603,0.0007362246,0.0004638694,0.00014890858],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0058212364,0.0002306348,0.00032194125,0.00056675647,0.00039522164,0.0003437424,0.0061049983,0.00007800385,0.000009637619],"category_scores_gemma":[0.000902151,0.00017092207,0.00009117544,0.0050628125,0.0017961896,0.0005504316,0.0017865121,0.0005248603,0.00003230246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092543605,0.00006701899,0.00010975251,0.000012424679,0.000008038054,0.0000013433637,0.00045164826,0.000041108615,0.0032013191,0.9807868,0.00012324781,0.015188043],"study_design_scores_gemma":[0.000295327,0.00019475208,0.0014679364,0.0000948779,0.000007787548,0.000024292467,0.000019263762,0.18857732,0.036020216,0.77253705,0.0005704205,0.00019075364],"about_ca_topic_score_codex":0.0000032432454,"about_ca_topic_score_gemma":0.000002147844,"teacher_disagreement_score":0.90339696,"about_ca_system_score_codex":0.00047698565,"about_ca_system_score_gemma":0.0009295087,"threshold_uncertainty_score":0.99927247},"labels":[],"label_agreement":null},{"id":"W4413306534","doi":"10.4204/eptcs.426.7","title":"A Classification Program for Nonlocality Paradoxes of Three Qubits","year":2025,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission","keywords":"Quantum nonlocality; Qubit; Computer science; Theoretical physics; Theoretical computer science; Quantum mechanics; Physics; Quantum; Quantum entanglement","score_opus":0.009885692293326887,"score_gpt":0.2913437251554954,"score_spread":0.28145803286216853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20971054,0.00001618501,0.78661466,0.0006200588,0.000048855585,0.0007129816,0.000003048553,0.000032455828,0.0022412466],"genre_scores_gemma":[0.9900609,0.0000010455883,0.009521349,0.000031140356,0.00004447091,0.00033174446,0.0000021694102,0.0000044310677,0.0000027328442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875957,0.0000044412577,0.00026168802,0.00038502435,0.00016207545,0.00042720055],"domain_scores_gemma":[0.9994508,0.00007108284,0.000082554325,0.00014262239,0.0002093892,0.000043523258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008374651,0.000100286445,0.00015662215,0.00011095892,0.00014085951,0.000069948015,0.00055143837,0.000028988596,0.000007985701],"category_scores_gemma":[0.00002123439,0.00008879852,0.000053347274,0.0009859498,0.000589209,0.0001113078,0.00010482091,0.00014667543,0.0000011682416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011181104,0.00018501276,0.0012444777,0.000016033866,0.0000048536435,5.857761e-9,0.000031072632,0.0000014011652,0.0015311177,0.9504676,0.00001693501,0.046490345],"study_design_scores_gemma":[0.00015085893,0.0000964102,0.0011319964,0.000023616472,0.0000053003323,1.07040826e-7,0.00001232569,0.34372905,0.0047138054,0.6499395,0.00013935982,0.000057707057],"about_ca_topic_score_codex":0.000004686489,"about_ca_topic_score_gemma":0.0000011494906,"teacher_disagreement_score":0.7803504,"about_ca_system_score_codex":0.00005778736,"about_ca_system_score_gemma":0.00024013896,"threshold_uncertainty_score":0.36210987},"labels":[],"label_agreement":null},{"id":"W4413306536","doi":"10.4204/eptcs.426.12","title":"Dagger-Drazin Inverses","year":2025,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Melanoma and MAPK Pathways","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Eesti Teadusagentuur","keywords":"Dagger; Mathematics; Computer science; Algebra over a field; Pure mathematics; Philosophy; Theology","score_opus":0.0031368408452571005,"score_gpt":0.23388263556294983,"score_spread":0.23074579471769274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9286265,0.0002447241,0.030720355,0.0004824753,0.00039176978,0.00019459968,7.199976e-7,0.000035169764,0.0393037],"genre_scores_gemma":[0.9972365,0.000034328226,0.001713701,0.0007438733,0.0001483113,0.00001530131,0.0000017556558,0.0000060948328,0.0001001406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984561,0.000010859105,0.00016960007,0.0005525701,0.00018310692,0.000627772],"domain_scores_gemma":[0.99960935,0.000013524136,0.00003111849,0.0001709507,0.000100162884,0.00007491159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007085245,0.0001327158,0.00012208086,0.00015650199,0.00013165032,0.00008224288,0.0007007773,0.00008411179,0.000012275425],"category_scores_gemma":[0.00015720398,0.000119391174,0.000039257684,0.00067090744,0.001011735,0.000012892081,0.00041540133,0.00018507084,0.000008675403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002663402,0.000034375385,0.0009746853,0.000010424251,0.0000040576406,9.318189e-7,0.00003591089,0.0000035403264,0.1171819,0.87729234,0.0005476704,0.0038875411],"study_design_scores_gemma":[0.00082693074,0.00089114887,0.0019705615,0.00008149936,0.000010505696,0.000034936922,0.00004419048,0.009743443,0.79908407,0.16570383,0.02118361,0.0004252709],"about_ca_topic_score_codex":0.0000016287428,"about_ca_topic_score_gemma":0.0000026359194,"teacher_disagreement_score":0.7115885,"about_ca_system_score_codex":0.000069585505,"about_ca_system_score_gemma":0.00035903417,"threshold_uncertainty_score":0.48686308},"labels":[],"label_agreement":null},{"id":"W4413306539","doi":"10.4204/eptcs.426.2","title":"A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits","year":2025,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Ministry of Colleges and Universities; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada; Villum Fonden","keywords":"Qutrit; Set (abstract data type); Electronic circuit; Computer science; Natural (archaeology); Mathematics; Theoretical computer science; Electrical engineering; Engineering; Physics; Programming language; Quantum mechanics; Biology","score_opus":0.013755047491881067,"score_gpt":0.27556860441368997,"score_spread":0.2618135569218089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12010504,0.0005645182,0.87564915,0.0016702436,0.0005118987,0.000778603,0.0000032369867,0.00030486393,0.00041241213],"genre_scores_gemma":[0.9344531,0.000017962868,0.06458655,0.0007913257,0.000047172907,0.000063216015,0.0000018041271,0.000012104764,0.000026763353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961456,0.000028833505,0.00045793486,0.0013629178,0.00049662904,0.001508107],"domain_scores_gemma":[0.9987533,0.00026353687,0.00010593474,0.00041383886,0.0002927958,0.00017059394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023611987,0.00031082888,0.00038628498,0.00054993876,0.0004725705,0.00082088687,0.0032254583,0.00009607602,0.0000025717131],"category_scores_gemma":[0.0003196121,0.00028711814,0.00008009223,0.0022446807,0.0016661641,0.0010165022,0.0014610001,0.0005436489,0.0000073007286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106761145,0.000059261674,0.00024108433,0.000058894464,0.000007359841,0.0000025041838,0.00032005625,0.0000025637723,0.0034994946,0.98035824,0.00004609989,0.015393753],"study_design_scores_gemma":[0.00088299386,0.00017440523,0.0011967494,0.00008443337,0.0000057298407,0.00004596444,0.000009899778,0.71431047,0.0040920433,0.27842098,0.00051307847,0.00026325008],"about_ca_topic_score_codex":0.0000031120546,"about_ca_topic_score_gemma":0.0000030169383,"teacher_disagreement_score":0.81434804,"about_ca_system_score_codex":0.0002599829,"about_ca_system_score_gemma":0.0004165455,"threshold_uncertainty_score":0.9999581},"labels":[],"label_agreement":null},{"id":"W4415169288","doi":"10.4204/eptcs.432","title":"Proceedings of the International Workshop on Verification of Scientific Software","year":2025,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Correctness; Software; Software verification; Snapshot (computer storage); Set (abstract data type); Verification and validation","score_opus":0.027699496294125155,"score_gpt":0.32927212161185265,"score_spread":0.3015726253177275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415169288","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3787617,0.00049681106,0.059152905,0.008462686,0.044960607,0.0035691024,0.00019313506,0.00017311564,0.5042299],"genre_scores_gemma":[0.98067266,0.000021833846,0.0025151211,0.00019063824,0.00018721499,0.000025379044,0.000008675678,0.000014398414,0.016364085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99019676,0.00003084363,0.001444604,0.0023281034,0.005140689,0.000858992],"domain_scores_gemma":[0.9945127,0.0008563097,0.0011046383,0.000995841,0.0024282043,0.000102310616],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.015094304,0.00035256776,0.0005890934,0.0020909102,0.0004558565,0.0016877621,0.012740612,0.00018480208,0.00038650786],"category_scores_gemma":[0.0069633154,0.00023604726,0.00022950408,0.009656596,0.005126899,0.0005220471,0.0036488024,0.00087978743,0.00017675207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062815794,0.0002032508,0.00025377213,0.000063054074,0.000015506776,1.3662849e-7,0.00033786954,0.00022320624,0.00094560854,0.8471526,0.11075832,0.039983865],"study_design_scores_gemma":[0.0013885989,0.0006174257,0.0036421535,0.0053182365,0.00008081355,0.000016074508,0.0007047639,0.13641311,0.053900704,0.56417394,0.23229922,0.0014449724],"about_ca_topic_score_codex":0.0000032429257,"about_ca_topic_score_gemma":0.0000010027311,"teacher_disagreement_score":0.60191095,"about_ca_system_score_codex":0.0005049056,"about_ca_system_score_gemma":0.0010812681,"threshold_uncertainty_score":0.9993486},"labels":[],"label_agreement":null},{"id":"W4416298547","doi":"10.4204/eptcs.436.5","title":"Mutation Testing for Industrial Robotic Systems","year":2025,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Chicoutimi","funders":"","keywords":"Mutation; Software; Reliability (semiconductor); Process (computing); Robot; Industrial robot; Quality (philosophy); Mutation testing","score_opus":0.020033874459946397,"score_gpt":0.2757728134674147,"score_spread":0.2557389390074683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416298547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009617007,0.00008251045,0.9846288,0.0005626137,0.00060749054,0.00057187246,1.8571956e-7,0.0026422213,0.0012872827],"genre_scores_gemma":[0.84482074,6.886517e-7,0.15478186,0.00017709807,0.00010139379,0.00010214107,2.8820807e-7,0.000006850967,0.0000089149935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997448,0.000022842489,0.0003855784,0.0008144372,0.00038741913,0.0009416787],"domain_scores_gemma":[0.9981726,0.0009274331,0.00011048517,0.0002659355,0.00043863957,0.000084936546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030692862,0.0001889582,0.00024475568,0.00055131206,0.00035705822,0.00077788805,0.0019849595,0.00010243485,3.883495e-7],"category_scores_gemma":[0.0027589295,0.00017550748,0.000039698007,0.0033913937,0.00059271476,0.0006226308,0.00047738495,0.00037511415,0.0000018922068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006187547,0.000030915304,0.0009010869,0.00002314505,0.000002483097,0.0000011642687,0.000085561216,0.00031143328,0.00011642201,0.962304,0.00027615516,0.035941456],"study_design_scores_gemma":[0.00021326772,0.0002425007,0.0001556847,0.00015693474,0.0000029775201,0.00002325489,0.0000015982663,0.5439157,0.000740592,0.45440194,0.00002671998,0.00011884419],"about_ca_topic_score_codex":0.000010026496,"about_ca_topic_score_gemma":2.1780085e-7,"teacher_disagreement_score":0.83520377,"about_ca_system_score_codex":0.00042779968,"about_ca_system_score_gemma":0.00064832927,"threshold_uncertainty_score":0.7501192},"labels":[],"label_agreement":null},{"id":"W4416298600","doi":"10.4204/eptcs.436","title":"Proceedings Seventh International Workshop on Formal Methods for Autonomous Systems","year":2025,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Publication; Formal methods; Work (physics); International community","score_opus":0.012427707625593016,"score_gpt":0.343675594728961,"score_spread":0.33124788710336794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416298600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009897833,0.0010188433,0.66644794,0.001067958,0.010507701,0.005006789,0.00010828645,0.0005293976,0.3143233],"genre_scores_gemma":[0.83882624,0.00029438228,0.12294758,0.0012275719,0.004775856,0.0038951004,0.0001678706,0.0005274389,0.027337944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9894533,0.000059000926,0.0015035626,0.0031813018,0.0016882238,0.0041145775],"domain_scores_gemma":[0.9956558,0.0008666338,0.0008291947,0.0004096674,0.001820806,0.00041793496],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011538849,0.0012369445,0.0014139808,0.0027929782,0.0007163113,0.0022183436,0.006568827,0.00079067505,0.00022727078],"category_scores_gemma":[0.0014732227,0.0011478146,0.00037296515,0.004010168,0.0028571826,0.0015137161,0.00189366,0.0028924397,0.000947257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004994364,0.00025526749,0.000003841196,0.00037396702,0.000090684174,9.872514e-7,0.00041609182,0.00034512774,0.00043757076,0.947323,0.031036776,0.019217221],"study_design_scores_gemma":[0.0018559379,0.00128175,0.000011979029,0.0031246506,0.000096046715,0.00011776861,0.00012182195,0.71298635,0.0044876644,0.06756755,0.20653218,0.0018162812],"about_ca_topic_score_codex":0.000004167165,"about_ca_topic_score_gemma":4.208841e-7,"teacher_disagreement_score":0.8797555,"about_ca_system_score_codex":0.006142966,"about_ca_system_score_gemma":0.0026058818,"threshold_uncertainty_score":0.9998565},"labels":[],"label_agreement":null}]}