{"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012863931,0.093850456,0.6224842,0.073851235,0.025128929,0.00030083055,0.0033002328,0.0015487202,0.16667144],"genre_scores_gemma":[0.24183206,0.07843915,0.32531565,0.010428863,0.022551453,0.0010011117,0.013156041,0.002490756,0.30478483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99495476,0.001701454,0.00042617155,0.00087472424,0.0017532908,0.00028962136],"domain_scores_gemma":[0.9918901,0.0045381403,0.00018359732,0.0015149727,0.0014274622,0.00044577895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070002875,0.0012800127,0.0014137479,0.0019276874,0.0014268768,0.007258726,0.0020248948,0.0017317646,0.034119718],"category_scores_gemma":[0.013138344,0.0009952594,0.0018232082,0.001509977,0.0031054975,0.007968152,0.004264369,0.008731312,0.005507939],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020819575,0.00015113511,0.000636843,0.00072751736,0.0001646456,0.00023358002,0.0011516669,0.0044462746,0.002102236,0.5269863,0.27063516,0.19255646],"study_design_scores_gemma":[0.000043682383,0.00004695123,0.00065326603,0.00043796535,0.0000536428,0.00035552954,0.00015897748,0.0070329336,0.0015009122,0.41993943,0.5697296,0.000047039073],"about_ca_topic_score_codex":0.003323982,"about_ca_topic_score_gemma":0.0040890947,"teacher_disagreement_score":0.034119718,"about_ca_system_score_codex":0.005535372,"about_ca_system_score_gemma":0.0026334017,"threshold_uncertainty_score":0.11414188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027645506,0.00017757967,0.9551992,0.0007042682,0.000115582385,0.0003129493,0.00039828397,0.011633682,0.003813012],"genre_scores_gemma":[0.33359155,0.00036441835,0.6591787,0.00069153536,0.00006939073,0.0005056831,0.00107399,0.001812366,0.0027124332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.985919,0.005645728,0.0004628448,0.001426741,0.0050147153,0.0015309901],"domain_scores_gemma":[0.97138965,0.017895106,0.0010766651,0.006227449,0.0030477913,0.00036327713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010639097,0.0011100359,0.0009725305,0.0012034974,0.0022357053,0.0025338964,0.002670071,0.0012735345,0.0071623307],"category_scores_gemma":[0.021623982,0.00133775,0.0027976686,0.0007099799,0.004360477,0.0052591157,0.0063298787,0.0037085635,0.0016767628],"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.0010159999,0.00070165866,0.004715397,0.0022624657,0.0005576647,0.0017109188,0.0030296568,0.12324479,0.093036845,0.5245858,0.023834152,0.22130471],"study_design_scores_gemma":[0.00046596347,0.00038493017,0.0015435624,0.00038429102,0.0003261176,0.00061349734,0.00048810645,0.47412723,0.20302947,0.2699069,0.04849645,0.00023348643],"about_ca_topic_score_codex":0.0060088057,"about_ca_topic_score_gemma":0.007887334,"teacher_disagreement_score":0.010639097,"about_ca_system_score_codex":0.0023192985,"about_ca_system_score_gemma":0.008852219,"threshold_uncertainty_score":0.056265593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14727111,0.0017556658,0.7483716,0.01602028,0.0009402786,0.00025936717,0.00078407535,0.0012355791,0.08336209],"genre_scores_gemma":[0.91863906,0.00060592534,0.07360011,0.002290177,0.00043501638,0.0003138066,0.0002985453,0.00020621433,0.0036110708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99091583,0.0038030646,0.0005828613,0.0018036598,0.0022061148,0.0006884815],"domain_scores_gemma":[0.9587048,0.023793876,0.0022041358,0.011050188,0.0031332849,0.0011136623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009092514,0.0008136565,0.0009532842,0.0010136314,0.002213991,0.0042126407,0.0025714207,0.0022479969,0.0057031973],"category_scores_gemma":[0.037121885,0.001034009,0.0017360433,0.0007270084,0.015020286,0.011935996,0.007329388,0.0074934717,0.0007178731],"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.000030372998,0.00001913191,0.000164255,0.000079256926,0.000020099791,0.00012871355,0.0002940823,0.00066485803,0.00073419296,0.995076,0.00057749235,0.0022115824],"study_design_scores_gemma":[0.000029408251,0.000018749852,0.00013630904,0.00001854718,0.000009125477,0.00008655287,0.000065935936,0.0022539513,0.0011939035,0.9937032,0.0024675592,0.000016684067],"about_ca_topic_score_codex":0.0006809975,"about_ca_topic_score_gemma":0.00046833255,"teacher_disagreement_score":0.009092514,"about_ca_system_score_codex":0.0017765996,"about_ca_system_score_gemma":0.0021409702,"threshold_uncertainty_score":0.048086345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75839216,0.0013581279,0.20022166,0.00075880444,0.000108953995,0.00006179853,0.0003950795,0.0010269311,0.037676558],"genre_scores_gemma":[0.97912127,0.00030965635,0.018096058,0.00006319523,0.00008139508,0.00003869868,0.00016799942,0.00013567807,0.0019861523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993432,0.00008741865,0.00005996867,0.00019711693,0.00019121157,0.00012114964],"domain_scores_gemma":[0.9951018,0.0031926082,0.0003629092,0.00057335105,0.000562248,0.00020705764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634506,0.00058725936,0.00057669857,0.0019172016,0.00073142396,0.0027366898,0.00047976966,0.00044087786,0.003067936],"category_scores_gemma":[0.009730497,0.0003334682,0.0003647354,0.0012628272,0.002320261,0.0046038963,0.0013412022,0.0014790933,0.0006331568],"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.00038549837,0.00004954513,0.0062176986,0.00029772814,0.000024840641,0.0004639947,0.0010684225,0.008299816,0.022113124,0.90568817,0.0025433796,0.05284767],"study_design_scores_gemma":[0.000043676602,0.00004607866,0.0014136261,0.000090604946,0.000028718268,0.00035324224,0.0001586422,0.040941928,0.022368858,0.92843693,0.006066687,0.000050881998],"about_ca_topic_score_codex":0.00081204384,"about_ca_topic_score_gemma":0.00083770714,"teacher_disagreement_score":0.003067936,"about_ca_system_score_codex":0.0014161168,"about_ca_system_score_gemma":0.0007446354,"threshold_uncertainty_score":0.010274708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7891127,0.00040116484,0.19867654,0.0010167276,0.000041393112,0.00016310718,0.0007899329,0.00057289,0.009225572],"genre_scores_gemma":[0.96774143,0.00020441375,0.029277785,0.000065462475,0.0000551212,0.00017403999,0.00058649224,0.00012264094,0.0017726144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956975,0.00083331356,0.00043506533,0.00086618843,0.0014189207,0.0007491369],"domain_scores_gemma":[0.95153177,0.03925262,0.0029201417,0.0035233912,0.0017198097,0.0010521355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562088,0.00066824426,0.0011641091,0.0014114918,0.0014114549,0.004649658,0.0017489643,0.0012329504,0.005303057],"category_scores_gemma":[0.020203061,0.0006134555,0.0018211104,0.0012646213,0.003224393,0.008742652,0.0022873678,0.0028489977,0.00046785976],"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.0012321881,0.00043157785,0.008893254,0.00046252072,0.00013386142,0.00050947006,0.0015750162,0.33518586,0.035649016,0.5785578,0.0018818098,0.03548757],"study_design_scores_gemma":[0.000055933575,0.00013496669,0.001188886,0.000014896251,0.00005424878,0.00016301732,0.000119750744,0.5651072,0.012604169,0.41955492,0.0009391548,0.00006279049],"about_ca_topic_score_codex":0.0016002107,"about_ca_topic_score_gemma":0.00163282,"teacher_disagreement_score":0.005303057,"about_ca_system_score_codex":0.0030528014,"about_ca_system_score_gemma":0.0021934363,"threshold_uncertainty_score":0.022149742},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5571766,0.0007803144,0.39276502,0.0010502987,0.000115536546,0.0002786305,0.0023403405,0.0019112108,0.04358208],"genre_scores_gemma":[0.9189552,0.00017980978,0.07212404,0.00019002768,0.00013126692,0.0002284884,0.0010138178,0.00017861479,0.0069988463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978885,0.00042852448,0.00023524978,0.0005776147,0.00054895226,0.0003210375],"domain_scores_gemma":[0.9954383,0.0019639996,0.0006912841,0.0008853605,0.000714826,0.00030630847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095142773,0.00038914246,0.00057034014,0.00087433436,0.0011299691,0.0022762723,0.001070594,0.00054432894,0.0052308384],"category_scores_gemma":[0.004640271,0.00048974017,0.00093956955,0.0005602326,0.0020470414,0.004214155,0.0019071138,0.0010536616,0.00081239175],"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.00026670317,0.00004891498,0.0024056567,0.00023596051,0.00003980953,0.00041400353,0.0011940022,0.0024861565,0.021114295,0.94703716,0.0022000724,0.022557367],"study_design_scores_gemma":[0.000048015474,0.000120874,0.001522337,0.000053506315,0.00005998467,0.0010593499,0.00058965746,0.02310115,0.016900431,0.9289891,0.027504856,0.000050794646],"about_ca_topic_score_codex":0.0005822573,"about_ca_topic_score_gemma":0.000704959,"teacher_disagreement_score":0.0052308384,"about_ca_system_score_codex":0.0009142098,"about_ca_system_score_gemma":0.0009437689,"threshold_uncertainty_score":0.01749891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019109639,0.000054174805,0.99581945,0.00010954148,0.000019689684,0.000057708614,0.00006414927,0.00041492784,0.0015493333],"genre_scores_gemma":[0.18648306,0.00054160383,0.8090438,0.00029127861,0.00014816527,0.00054574263,0.00036617246,0.00028544912,0.0022946822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991734,0.0028917058,0.00078303897,0.00091197924,0.0030814267,0.000597907],"domain_scores_gemma":[0.9824782,0.012300644,0.0009541871,0.0025917008,0.0014981552,0.00017707048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0097185075,0.0011599273,0.0008420604,0.0017246831,0.00093185925,0.0038616995,0.0031169443,0.001260197,0.004657627],"category_scores_gemma":[0.014444655,0.00061021536,0.0027278503,0.0011276922,0.005069869,0.004283442,0.0026850011,0.0028484548,0.0011149575],"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.000045451656,0.00010319747,0.00039821604,0.00029712892,0.000047512385,0.00038175765,0.00035569016,0.06200632,0.0054381425,0.9032948,0.0010310672,0.02660082],"study_design_scores_gemma":[0.000085623484,0.00009061229,0.00019691102,0.00013652121,0.0000669972,0.00025992576,0.000064956905,0.3335108,0.019130135,0.6330665,0.013341018,0.000049934974],"about_ca_topic_score_codex":0.0013770465,"about_ca_topic_score_gemma":0.0009233113,"teacher_disagreement_score":0.0097185075,"about_ca_system_score_codex":0.0018074405,"about_ca_system_score_gemma":0.0029275666,"threshold_uncertainty_score":0.051396966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63106424,0.00044429942,0.3574787,0.00032718622,0.000058383153,0.000046997215,0.00007668212,0.002306807,0.008196808],"genre_scores_gemma":[0.9137745,0.00014737637,0.08325193,0.00014190521,0.000014374268,0.00006987307,0.00012247048,0.00019546215,0.0022821887],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992447,0.00014802408,0.00007056585,0.00025179525,0.00020036653,0.000084648345],"domain_scores_gemma":[0.99776113,0.0006474453,0.00023034177,0.0011096684,0.00014076402,0.00011064976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006247745,0.0002482869,0.00046525453,0.00031627374,0.0005655996,0.0012448569,0.0012470001,0.00078457553,0.0015907434],"category_scores_gemma":[0.0027336485,0.00043281872,0.0008963712,0.00021295638,0.001618012,0.001501983,0.0012082793,0.0010565742,0.00063341693],"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.00034486456,0.00009685087,0.002369624,0.00027242996,0.000033928667,0.0007910284,0.0011151619,0.050921917,0.6665732,0.22902465,0.00047900534,0.047977407],"study_design_scores_gemma":[0.00009998119,0.00042059598,0.0020311675,0.000064355576,0.000093913506,0.0012363513,0.0002807943,0.25363275,0.6237504,0.09742707,0.020848561,0.000114062816],"about_ca_topic_score_codex":0.00087013363,"about_ca_topic_score_gemma":0.00096189487,"teacher_disagreement_score":0.0015907434,"about_ca_system_score_codex":0.0006401934,"about_ca_system_score_gemma":0.0007151053,"threshold_uncertainty_score":0.0053215027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28853834,0.00032310473,0.6950658,0.00049450604,0.000045410132,0.00039141337,0.00035541723,0.009956195,0.004829884],"genre_scores_gemma":[0.60109615,0.000121710626,0.39617637,0.000070321235,0.000014218963,0.00020835176,0.0005594622,0.00037654088,0.0013769503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.00029371562,0.000063326544,0.00018160054,0.00031053604,0.00023176549],"domain_scores_gemma":[0.99608034,0.0030150183,0.00023398835,0.00021380231,0.00033493605,0.00012180462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017776154,0.0010348236,0.0006990673,0.0010917198,0.0007419042,0.0009868715,0.0011410313,0.00085431716,0.003365357],"category_scores_gemma":[0.0064253467,0.00064140966,0.0007902473,0.0005510416,0.001063258,0.001241027,0.00092908967,0.0013175011,0.00044893782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00035082584,0.00020040132,0.0019505731,0.00019022536,0.000045948564,0.00018199095,0.00018698242,0.9013934,0.006629697,0.0066700596,0.0009991564,0.0812007],"study_design_scores_gemma":[0.000035088546,0.000043772423,0.0001274027,0.0000055082205,0.000012788725,0.000010111805,0.00004007199,0.9939978,0.0026842966,0.0028155448,0.00022295224,0.00000473675],"about_ca_topic_score_codex":0.014313694,"about_ca_topic_score_gemma":0.01725964,"teacher_disagreement_score":0.014313694,"about_ca_system_score_codex":0.0017242942,"about_ca_system_score_gemma":0.002668317,"threshold_uncertainty_score":0.028460741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017947776,0.00031955956,0.9764615,0.00023633531,0.00008962461,0.00019785651,0.00016063392,0.0013060299,0.0032806718],"genre_scores_gemma":[0.36259028,0.00095099275,0.6299428,0.00024367723,0.000073078736,0.00075715233,0.00058292795,0.00029951564,0.0045594876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98981476,0.0028441055,0.0009801259,0.0008309348,0.0049339384,0.00059615204],"domain_scores_gemma":[0.99299145,0.0035475953,0.0005750756,0.0014843104,0.001223997,0.00017761947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055180984,0.0007359918,0.00063475437,0.0011778573,0.0009643298,0.00272964,0.0020311214,0.0019064512,0.0014633483],"category_scores_gemma":[0.013457105,0.0010010559,0.0018458264,0.0009738272,0.003008688,0.002527084,0.002255539,0.0020304024,0.00053412106],"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.0001642286,0.00015730066,0.0014956756,0.00056798826,0.00012512298,0.0013540658,0.00096695626,0.15182567,0.0305259,0.75650537,0.0017477816,0.05456395],"study_design_scores_gemma":[0.00017817692,0.00011981575,0.0005314057,0.00022337484,0.000118456905,0.0004925237,0.00021465572,0.6794486,0.06410652,0.21254683,0.041943334,0.00007631082],"about_ca_topic_score_codex":0.0058266157,"about_ca_topic_score_gemma":0.004705158,"teacher_disagreement_score":0.0058266157,"about_ca_system_score_codex":0.0015033573,"about_ca_system_score_gemma":0.0047418857,"threshold_uncertainty_score":0.029182792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47793135,0.0005344072,0.5131815,0.00034004386,0.000066923814,0.00019802489,0.000098204604,0.0024248373,0.005224638],"genre_scores_gemma":[0.87131345,0.0001510999,0.1272546,0.00005824115,0.000012150003,0.0001540191,0.00010669181,0.00020748832,0.0007422631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794453,0.0007749236,0.00017829024,0.00017501478,0.00072917686,0.00019803215],"domain_scores_gemma":[0.99248624,0.003759953,0.00038412499,0.0025787174,0.0005694058,0.00022141208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019543997,0.00054676173,0.0007175007,0.0003943622,0.0007318248,0.0017988998,0.0018484524,0.00059081375,0.0022968461],"category_scores_gemma":[0.008655631,0.00047918851,0.00047971687,0.00046242325,0.0012065547,0.005563445,0.0016572997,0.0015855212,0.00025294334],"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.002416233,0.0009027933,0.011378308,0.001196069,0.0001741684,0.00058753334,0.0021291908,0.2775175,0.16752213,0.32415286,0.0034609933,0.20856209],"study_design_scores_gemma":[0.00011927419,0.0004618081,0.00078386033,0.00007121284,0.00006446362,0.00012361638,0.00020875399,0.8362111,0.069329105,0.08576474,0.006810644,0.000051387917],"about_ca_topic_score_codex":0.0006525649,"about_ca_topic_score_gemma":0.001183065,"teacher_disagreement_score":0.0022968461,"about_ca_system_score_codex":0.0006831618,"about_ca_system_score_gemma":0.000924771,"threshold_uncertainty_score":0.010336041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5495935,0.0013671365,0.42582962,0.004249696,0.0001196938,0.0004314271,0.0011966522,0.0027474626,0.014464924],"genre_scores_gemma":[0.86910486,0.00066340645,0.12366146,0.00049306854,0.00017721485,0.00032528283,0.0011669586,0.0005416778,0.003866113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988857,0.00399463,0.00094891916,0.0015945146,0.0032062314,0.0013987265],"domain_scores_gemma":[0.8713781,0.11633464,0.0031918108,0.005617627,0.0025402184,0.0009376101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066945977,0.0012017888,0.0019305934,0.0013290606,0.0017529416,0.006065761,0.0030509618,0.0018226764,0.0064670425],"category_scores_gemma":[0.050641723,0.00097414356,0.0027052215,0.0023993466,0.0031848836,0.016202964,0.003490818,0.003396585,0.0007224139],"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.00516376,0.0006995944,0.01839449,0.0017342041,0.0005134642,0.0016352762,0.0024169371,0.46657276,0.021868156,0.1956835,0.009437343,0.2758806],"study_design_scores_gemma":[0.0002060948,0.00017132459,0.0015901435,0.000070399976,0.00017752865,0.00034657994,0.00025048736,0.74932605,0.008023017,0.23785284,0.0019177875,0.000067810965],"about_ca_topic_score_codex":0.00500691,"about_ca_topic_score_gemma":0.004725188,"teacher_disagreement_score":0.0066945977,"about_ca_system_score_codex":0.0036652596,"about_ca_system_score_gemma":0.0032757777,"threshold_uncertainty_score":0.03540486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023543887,0.0015466978,0.83976036,0.001184389,0.00035895995,0.0012823682,0.0010019448,0.11474409,0.016577318],"genre_scores_gemma":[0.124333225,0.0012833225,0.8486627,0.001083417,0.00010933642,0.0010095091,0.0047824713,0.00494713,0.013788999],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956927,0.0006469327,0.00026034168,0.00043483984,0.0026808311,0.00028436386],"domain_scores_gemma":[0.9966208,0.0010115836,0.00031647657,0.0007430377,0.0009861069,0.00032198775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036571505,0.0015340742,0.00093820406,0.002973757,0.0006677586,0.0036950698,0.0034414288,0.0018360147,0.0037173368],"category_scores_gemma":[0.0076324847,0.0009400563,0.00096854556,0.0010156116,0.0012521013,0.0044042175,0.0031393121,0.0028412677,0.0027969675],"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.0012416249,0.00072559697,0.0061113345,0.0012308592,0.00023985612,0.0016761153,0.0015050212,0.032824647,0.083942145,0.11217432,0.06776014,0.6905684],"study_design_scores_gemma":[0.000265617,0.00097592245,0.002934696,0.0010258633,0.00014823952,0.0025363935,0.00029810754,0.4472531,0.11191442,0.040700976,0.39166334,0.00028330655],"about_ca_topic_score_codex":0.0030707943,"about_ca_topic_score_gemma":0.0017810947,"teacher_disagreement_score":0.0037173368,"about_ca_system_score_codex":0.0013183119,"about_ca_system_score_gemma":0.0020577868,"threshold_uncertainty_score":0.019341052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008033771,0.0006176641,0.97707987,0.0005192855,0.000096705946,0.00003685869,0.00007911757,0.00029666215,0.013240012],"genre_scores_gemma":[0.52742326,0.0017487841,0.45092312,0.00064554,0.0004619018,0.00031672683,0.00035189756,0.0002974996,0.017831307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982205,0.0006556335,0.00014644662,0.00038423762,0.00045743826,0.0001357191],"domain_scores_gemma":[0.9985978,0.0005349315,0.00018509875,0.00035543548,0.00024384104,0.00008297936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016606537,0.00074343185,0.0006040253,0.001525694,0.0011414591,0.0028062742,0.0010945576,0.0013506197,0.007528812],"category_scores_gemma":[0.0035803602,0.00047033746,0.0013699573,0.0011951893,0.0035514138,0.004322106,0.003811721,0.002343625,0.0020886778],"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.00000607625,0.000006635018,0.00011496301,0.000033712724,0.0000064248234,0.00005743803,0.00016045952,0.011669616,0.00065503106,0.9761896,0.0004889832,0.010611019],"study_design_scores_gemma":[0.0000068735653,0.000037990634,0.000100385376,0.000039165872,0.000010701984,0.000084895226,0.00008445568,0.08084639,0.0011023384,0.89911544,0.01854823,0.000023212626],"about_ca_topic_score_codex":0.0014718118,"about_ca_topic_score_gemma":0.00096987723,"teacher_disagreement_score":0.007528812,"about_ca_system_score_codex":0.0015453398,"about_ca_system_score_gemma":0.0007370903,"threshold_uncertainty_score":0.02518636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13686061,0.0004914925,0.8537482,0.0005648885,0.000080337086,0.00013563098,0.00025201714,0.0042042974,0.0036625934],"genre_scores_gemma":[0.839862,0.0002460331,0.15768796,0.000086404216,0.000068101835,0.00019322064,0.0003573033,0.00034085615,0.0011580839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886568,0.0036444496,0.00064236525,0.0016809102,0.0043671005,0.0010083748],"domain_scores_gemma":[0.94433826,0.03856055,0.004111415,0.00779648,0.0042419215,0.0009513748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012064999,0.0017805065,0.001381439,0.004789768,0.0010413111,0.0033098655,0.002688856,0.0011266388,0.0017897538],"category_scores_gemma":[0.05857009,0.0011423446,0.0018015999,0.0021989872,0.0043662526,0.009049365,0.003835412,0.0031958323,0.00046571132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0021626267,0.00017576572,0.009747439,0.0003504996,0.00018650769,0.0002181566,0.0008776686,0.64122677,0.01670808,0.21990286,0.0012422048,0.10720141],"study_design_scores_gemma":[0.00005510399,0.00012333324,0.00045389528,0.00004218053,0.00004391376,0.00003205396,0.00003112957,0.87740254,0.012883642,0.108071685,0.00082504423,0.000035376535],"about_ca_topic_score_codex":0.0037853352,"about_ca_topic_score_gemma":0.0025916656,"teacher_disagreement_score":0.012064999,"about_ca_system_score_codex":0.004228486,"about_ca_system_score_gemma":0.0021320498,"threshold_uncertainty_score":0.063806534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042779803,0.00038371456,0.9393445,0.00076800527,0.00028307046,0.00012282103,0.0002741241,0.0086816605,0.007362203],"genre_scores_gemma":[0.57310164,0.00043782787,0.41351876,0.00067735,0.00023003339,0.00026045684,0.00050991983,0.0052578743,0.0060061156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9806862,0.006040244,0.001814824,0.0036261622,0.0060191373,0.0018134243],"domain_scores_gemma":[0.9362562,0.034185782,0.003287938,0.020438606,0.0050820485,0.00074942125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014361166,0.00096061546,0.0016459243,0.0023306834,0.0024273435,0.004727705,0.00348259,0.0019104623,0.0050154356],"category_scores_gemma":[0.05594969,0.0023357102,0.0025722685,0.0025358326,0.006752571,0.016570814,0.008985514,0.0047435835,0.0016981281],"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.0012143974,0.00024002237,0.014681403,0.0011695866,0.00023248207,0.0009851669,0.002876995,0.025230212,0.021010349,0.59782726,0.008131177,0.3264009],"study_design_scores_gemma":[0.00013439769,0.00013266999,0.0011037523,0.0004018455,0.00033185643,0.0006008645,0.00041957767,0.12421765,0.12299419,0.71847415,0.030986462,0.00020261828],"about_ca_topic_score_codex":0.0027367768,"about_ca_topic_score_gemma":0.0037345954,"teacher_disagreement_score":0.014361166,"about_ca_system_score_codex":0.0019078827,"about_ca_system_score_gemma":0.005074396,"threshold_uncertainty_score":0.07595003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17789035,0.00060959934,0.74206966,0.0013343036,0.0003228205,0.00016692106,0.0007271197,0.0009243562,0.07595477],"genre_scores_gemma":[0.8886817,0.0003583139,0.08756739,0.00074821216,0.0002661108,0.0004421311,0.0004853298,0.00030465293,0.02114611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986319,0.0001540387,0.0001305264,0.00036717064,0.00032789368,0.0003885332],"domain_scores_gemma":[0.9966875,0.0020712027,0.00024321007,0.00047323186,0.00036311275,0.00016176273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390591,0.00075856195,0.0008238146,0.0011582319,0.0017600743,0.0026648636,0.0010390606,0.0013110702,0.010028973],"category_scores_gemma":[0.004883461,0.00056197617,0.002103345,0.0007209717,0.004314772,0.005955155,0.002121175,0.0029672198,0.001642779],"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.000092639835,0.000023167184,0.00070364214,0.0000696338,0.0000117723075,0.0002559483,0.0005839014,0.0026252973,0.0028718403,0.98044467,0.0011305303,0.011187049],"study_design_scores_gemma":[0.000025871497,0.00003680372,0.00032434767,0.000024409572,0.0000147336295,0.0002814984,0.00007824864,0.008730995,0.00499553,0.9781959,0.0072606867,0.000030964187],"about_ca_topic_score_codex":0.001272721,"about_ca_topic_score_gemma":0.0007265934,"teacher_disagreement_score":0.010028973,"about_ca_system_score_codex":0.0010212658,"about_ca_system_score_gemma":0.00065643946,"threshold_uncertainty_score":0.033550322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084983,0.00451811,0.93920344,0.0031281826,0.0004616757,0.00010674769,0.00003267814,0.0003139183,0.043737013],"genre_scores_gemma":[0.50847393,0.0049118516,0.4652482,0.0013217655,0.0008125943,0.00081983575,0.000099022574,0.00020871664,0.018104132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907149,0.0048390115,0.0006340867,0.0010334773,0.002291924,0.00048661415],"domain_scores_gemma":[0.99276567,0.0048790867,0.0004623428,0.0007394226,0.0007205862,0.0004327628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008454572,0.0009884462,0.00062486087,0.0016173036,0.0023088357,0.0050635403,0.0014533541,0.0024100142,0.003543783],"category_scores_gemma":[0.009602656,0.0008830042,0.0011671603,0.0014111002,0.012368846,0.009120189,0.004721012,0.0038232212,0.0006121846],"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.000007768776,0.000004181814,0.000071941075,0.00003400182,0.000004372868,0.000036966183,0.00040301637,0.0015614076,0.00015755676,0.9939135,0.00014039688,0.0036649646],"study_design_scores_gemma":[0.000019555546,0.000037314177,0.000048596274,0.00006232772,0.000015295507,0.00005711784,0.00014814251,0.0067512696,0.00048018957,0.96526796,0.027097119,0.000015160897],"about_ca_topic_score_codex":0.0032049853,"about_ca_topic_score_gemma":0.0018420754,"teacher_disagreement_score":0.008454572,"about_ca_system_score_codex":0.0029648803,"about_ca_system_score_gemma":0.0028251088,"threshold_uncertainty_score":0.044712603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82917446,0.00029087235,0.13759056,0.0010194556,0.00008082003,0.00015279834,0.0008301147,0.00061198714,0.030248877],"genre_scores_gemma":[0.98066807,0.00012351606,0.014643988,0.00005542322,0.00003375534,0.00008160737,0.00046167412,0.00010091898,0.0038310667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978053,0.00040399894,0.0001783662,0.00043838785,0.0006104112,0.0005634501],"domain_scores_gemma":[0.98920983,0.00682623,0.0007814751,0.0019326594,0.00076991104,0.00047994664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170806,0.00039920054,0.00078185543,0.00087328703,0.0012092924,0.0039844154,0.0012687994,0.00097179273,0.012286937],"category_scores_gemma":[0.0072739767,0.0003644561,0.0017755437,0.0009994522,0.0019354755,0.008350869,0.0026748676,0.0023381428,0.00067384366],"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.0010324329,0.00024748372,0.004303677,0.00035252876,0.00008816481,0.00047738597,0.0006975338,0.07117444,0.016153086,0.8689237,0.0029588402,0.033590652],"study_design_scores_gemma":[0.0000744166,0.00020588157,0.0015406411,0.000029915036,0.00010520016,0.00033778406,0.00029487995,0.20929618,0.020497872,0.7632724,0.0042528347,0.000092002025],"about_ca_topic_score_codex":0.0016777073,"about_ca_topic_score_gemma":0.001622923,"teacher_disagreement_score":0.012286937,"about_ca_system_score_codex":0.0016895932,"about_ca_system_score_gemma":0.001567879,"threshold_uncertainty_score":0.0411039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8256747,0.00075398706,0.15273747,0.00046283047,0.00008772311,0.000036025427,0.00014032371,0.00012197942,0.019984929],"genre_scores_gemma":[0.98697996,0.00012014286,0.010553477,0.00006225279,0.00009308869,0.00005060295,0.00009156895,0.000021803924,0.0020271256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848676,0.00039547554,0.0001119227,0.00031860528,0.0005121662,0.00017509851],"domain_scores_gemma":[0.994414,0.0029512595,0.00068203214,0.00047564635,0.00087266776,0.00060438126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012762509,0.00026905915,0.0006762565,0.002454667,0.0012901317,0.0022060364,0.0008787074,0.0008585905,0.0028189095],"category_scores_gemma":[0.010913975,0.00024794176,0.00043790028,0.001592386,0.0029908975,0.0040037846,0.0021829687,0.00078803266,0.000331748],"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.00014479348,0.00003429076,0.0030205336,0.00008790706,0.000023361104,0.00027705604,0.0010905393,0.0031187495,0.004791342,0.97684175,0.00045357115,0.010116233],"study_design_scores_gemma":[0.000021678085,0.00012544154,0.003930476,0.000053684795,0.000027484724,0.00089889637,0.0007647136,0.05320096,0.0035045582,0.9338372,0.0035741024,0.000060872073],"about_ca_topic_score_codex":0.000698661,"about_ca_topic_score_gemma":0.00037074604,"teacher_disagreement_score":0.0028189095,"about_ca_system_score_codex":0.00091570977,"about_ca_system_score_gemma":0.00032526243,"threshold_uncertainty_score":0.00943023},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045794982,0.0007432999,0.909915,0.0013142639,0.0004353365,0.00015462871,0.00054318446,0.0017021599,0.039397135],"genre_scores_gemma":[0.5879666,0.0009928538,0.3766401,0.0013963465,0.0006730075,0.00056434586,0.0009447162,0.0012075069,0.029614437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99467975,0.0011470576,0.0006592327,0.00092979526,0.001837074,0.0007470171],"domain_scores_gemma":[0.99484295,0.0012816235,0.00044797952,0.0014812466,0.0015750909,0.00037119558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005364103,0.0009187414,0.0008392476,0.0024600707,0.0018114074,0.004937746,0.002955842,0.0017064388,0.00810806],"category_scores_gemma":[0.0072079897,0.0007986744,0.0026099873,0.0014493812,0.004805696,0.013946941,0.0078031532,0.00491393,0.002310981],"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.000036235295,0.000019433628,0.00017185374,0.00007666478,0.000014693143,0.000098321594,0.0006570003,0.00069244084,0.0023931372,0.98841417,0.0005831729,0.0068429145],"study_design_scores_gemma":[0.000028479277,0.00007113436,0.00022031092,0.00009180615,0.00007108953,0.00026432396,0.0002129222,0.008297171,0.0072748903,0.9437552,0.03964558,0.00006721148],"about_ca_topic_score_codex":0.0012115545,"about_ca_topic_score_gemma":0.0011153123,"teacher_disagreement_score":0.00810806,"about_ca_system_score_codex":0.002633155,"about_ca_system_score_gemma":0.0023290662,"threshold_uncertainty_score":0.028368413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007816811,0.00027714865,0.98535454,0.00035446175,0.000071458,0.000036180154,0.00018594213,0.00038450875,0.005518888],"genre_scores_gemma":[0.66453373,0.0011889823,0.32169497,0.00047544122,0.00033632838,0.00036975066,0.0017865316,0.00039142644,0.00922281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954211,0.0009338508,0.00024057196,0.0009675367,0.0019922797,0.0004447166],"domain_scores_gemma":[0.98604906,0.008742814,0.00082564715,0.0027830591,0.0013476309,0.00025180695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265599,0.0010150553,0.0014144947,0.0013496482,0.00075316726,0.003215231,0.0022544027,0.0011742343,0.006684076],"category_scores_gemma":[0.022369724,0.0004785002,0.0012903216,0.0015268604,0.0015677267,0.007838277,0.0031634443,0.0042641023,0.0010910544],"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.00024848204,0.0001160171,0.0028131006,0.00023519614,0.00008046163,0.00014374852,0.0002245454,0.28614458,0.0019617558,0.59740835,0.0048655523,0.105758294],"study_design_scores_gemma":[0.00000951036,0.000036327096,0.000356054,0.000033530498,0.000018595607,0.00007682061,0.000026602045,0.7540817,0.0017595283,0.23956977,0.0040099574,0.000021608674],"about_ca_topic_score_codex":0.002244418,"about_ca_topic_score_gemma":0.0014716365,"teacher_disagreement_score":0.006684076,"about_ca_system_score_codex":0.002115472,"about_ca_system_score_gemma":0.0017002943,"threshold_uncertainty_score":0.022360444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25565302,0.0020113685,0.5044874,0.016999912,0.00016505053,0.00028017946,0.00069526257,0.0003098992,0.21939789],"genre_scores_gemma":[0.8566359,0.0013594471,0.104280636,0.00068932667,0.00009454544,0.00052916136,0.00020607281,0.00008656505,0.03611839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940217,0.00031085545,0.000020948763,0.00010651593,0.0000856496,0.000073782976],"domain_scores_gemma":[0.99690884,0.0023656008,0.0001738895,0.0001732712,0.00017191525,0.00020651601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014958249,0.00050312094,0.0005124811,0.00085253007,0.0008548158,0.003318309,0.0022041018,0.0023906652,0.007726302],"category_scores_gemma":[0.008462591,0.00043846044,0.00088225066,0.001157149,0.0019038599,0.0030668904,0.0012414905,0.0011994342,0.0008612194],"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.000060357383,0.00007225473,0.0020420004,0.00009242912,0.000056091045,0.00020820754,0.0006964674,0.38420486,0.00072464545,0.59620994,0.002359204,0.0132735865],"study_design_scores_gemma":[0.000051185136,0.000035747642,0.00045987265,0.000024264908,0.000026538726,0.00012439572,0.0001672705,0.7666892,0.00017609388,0.22645754,0.0057686064,0.000019373476],"about_ca_topic_score_codex":0.0048130406,"about_ca_topic_score_gemma":0.003215969,"teacher_disagreement_score":0.007726302,"about_ca_system_score_codex":0.0013980063,"about_ca_system_score_gemma":0.0013968413,"threshold_uncertainty_score":0.025847077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042910585,0.00008383895,0.99408215,0.000040117073,0.00001385978,0.00005080674,0.000033581942,0.00089285785,0.00051175174],"genre_scores_gemma":[0.22378573,0.00043811023,0.77255666,0.00010695895,0.000027755015,0.00033158518,0.00034017654,0.0003338789,0.0020791125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935662,0.00291509,0.0006079838,0.0005702485,0.0020607172,0.00027987224],"domain_scores_gemma":[0.98974645,0.0061669624,0.00091592845,0.0022691186,0.0008019786,0.00009962369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053738933,0.0010118078,0.0007284842,0.00096894754,0.0005060982,0.0018331978,0.0021976775,0.0010044704,0.0016869667],"category_scores_gemma":[0.011615282,0.00077208085,0.0015840838,0.0007353409,0.0017152914,0.0034725927,0.001792329,0.0014566379,0.00036402518],"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.00044910668,0.00020592824,0.0021154871,0.0009277047,0.00023223257,0.0007413618,0.0008805409,0.47538406,0.028242914,0.3118301,0.0018763673,0.17711419],"study_design_scores_gemma":[0.00024372991,0.00010515074,0.00022352632,0.00012239252,0.000096592565,0.00030719777,0.00005321021,0.8920337,0.035160832,0.057753574,0.013835884,0.000064282634],"about_ca_topic_score_codex":0.0019967204,"about_ca_topic_score_gemma":0.0022891196,"teacher_disagreement_score":0.0053738933,"about_ca_system_score_codex":0.0011129577,"about_ca_system_score_gemma":0.0021195353,"threshold_uncertainty_score":0.02842021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011225817,0.00013223937,0.98578644,0.00031201768,0.000027329223,0.000083244835,0.00007247316,0.00010870777,0.0022517042],"genre_scores_gemma":[0.6076117,0.0007212811,0.3882003,0.00029119692,0.00013488707,0.00069181796,0.00026363457,0.000116152696,0.001969011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956363,0.001526805,0.00027105006,0.0005153616,0.0017799502,0.00027053355],"domain_scores_gemma":[0.9885315,0.0085049765,0.0012586188,0.0007434677,0.000832128,0.00012934221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004879338,0.00073818193,0.00049535226,0.001119317,0.0007355791,0.0020308227,0.0014932937,0.00090131664,0.0019323585],"category_scores_gemma":[0.014313108,0.00050858874,0.0016698629,0.0007602891,0.0028882679,0.0027517083,0.0012076884,0.0014769427,0.00033996202],"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.00006943638,0.00010252719,0.0017678093,0.0002550504,0.00007333552,0.00044575916,0.0002679293,0.4388785,0.011460163,0.53223604,0.0007782486,0.013665183],"study_design_scores_gemma":[0.000018513312,0.00005101852,0.00037328262,0.000037812348,0.000029134084,0.00016894392,0.000041308333,0.8584392,0.0029255438,0.13543397,0.0024620777,0.00001914074],"about_ca_topic_score_codex":0.0020755907,"about_ca_topic_score_gemma":0.0017499261,"teacher_disagreement_score":0.004879338,"about_ca_system_score_codex":0.0019776952,"about_ca_system_score_gemma":0.0023590985,"threshold_uncertainty_score":0.025804698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011746199,0.00014425204,0.96695083,0.0009005492,0.0001280558,0.00012981228,0.00012600761,0.00028381095,0.019590538],"genre_scores_gemma":[0.6256984,0.00038915657,0.3603568,0.00055757136,0.00032833416,0.0007421205,0.00025946,0.00020450221,0.01146366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966202,0.00072556,0.00027203714,0.00066746294,0.0012267049,0.00048806684],"domain_scores_gemma":[0.99332786,0.0035492864,0.000555309,0.0010661246,0.0011610736,0.00034030023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035951652,0.0006860537,0.00094025384,0.0012516463,0.0019699577,0.0034217366,0.002165455,0.0023382106,0.010641259],"category_scores_gemma":[0.00960345,0.0005732824,0.0015857982,0.0010075815,0.0053718346,0.008866187,0.0030757047,0.004761921,0.0015633733],"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.000020415455,0.000009693055,0.00006466163,0.000050678336,0.000005395723,0.00016208178,0.00012262164,0.008097172,0.0014104375,0.9868614,0.00035042566,0.0028450214],"study_design_scores_gemma":[0.000034065102,0.000065738896,0.000072127375,0.00003584142,0.000017754757,0.00021952622,0.000087296525,0.097563654,0.0037342333,0.8899497,0.008170305,0.0000497532],"about_ca_topic_score_codex":0.0016952504,"about_ca_topic_score_gemma":0.0017206183,"teacher_disagreement_score":0.010641259,"about_ca_system_score_codex":0.0018527701,"about_ca_system_score_gemma":0.003415076,"threshold_uncertainty_score":0.035598516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79349405,0.00021385672,0.1994924,0.00036778717,0.000038212514,0.000056697474,0.0005830184,0.0006705089,0.005083417],"genre_scores_gemma":[0.9759665,0.000093190254,0.021720463,0.00003314278,0.00002189541,0.000071282106,0.0005731728,0.00006073624,0.001459525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787986,0.0003511203,0.00027128233,0.00046674526,0.00063578406,0.00039511683],"domain_scores_gemma":[0.98931026,0.00704836,0.0010996382,0.0011298319,0.00095463166,0.00045729222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083982275,0.00041533637,0.000622671,0.00064819196,0.00061775505,0.002774073,0.0010386766,0.0006029903,0.0033594416],"category_scores_gemma":[0.007267049,0.0003241709,0.00074726524,0.00059786934,0.001625405,0.0046215462,0.0013370515,0.0012203697,0.00038720825],"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.0010786132,0.00033306825,0.008759102,0.0004450061,0.00009235512,0.0006283976,0.0015498718,0.34314018,0.066809125,0.52056843,0.0018405936,0.054755356],"study_design_scores_gemma":[0.000034112705,0.00015668396,0.0014988885,0.000019187282,0.00003783672,0.00013230224,0.00017254612,0.6914617,0.021101434,0.2841376,0.0011851899,0.000062521205],"about_ca_topic_score_codex":0.0014991438,"about_ca_topic_score_gemma":0.0015345928,"teacher_disagreement_score":0.0033594416,"about_ca_system_score_codex":0.0013648876,"about_ca_system_score_gemma":0.0011254546,"threshold_uncertainty_score":0.011238456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58570945,0.0006301913,0.40776896,0.00052708667,0.000054540982,0.00006407533,0.00022460533,0.0006460929,0.0043749516],"genre_scores_gemma":[0.9716784,0.00020524593,0.027067723,0.00003303258,0.000049220045,0.00005098418,0.00012332872,0.00009370265,0.0006984257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774677,0.00075394247,0.00015795325,0.0004912685,0.0005880387,0.00026205147],"domain_scores_gemma":[0.95709604,0.034292046,0.002145104,0.0029065383,0.002172208,0.0013879781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045931614,0.0007438329,0.0012299072,0.0030974918,0.00090757955,0.0038660378,0.0014989682,0.0012167617,0.0024390172],"category_scores_gemma":[0.050288144,0.0006599447,0.00077795883,0.001637471,0.0045363833,0.009859948,0.002805958,0.0022060303,0.00028041942],"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.00053266383,0.00007447186,0.0136426,0.00020502458,0.00013946998,0.00026514678,0.0009992116,0.18182494,0.006105638,0.77256006,0.0006293075,0.02302144],"study_design_scores_gemma":[0.000037649104,0.000071004135,0.0020440146,0.000026875008,0.000029721663,0.000117044154,0.00009711957,0.53194314,0.0045919484,0.46024668,0.000752277,0.000042589014],"about_ca_topic_score_codex":0.0011974074,"about_ca_topic_score_gemma":0.0007252117,"teacher_disagreement_score":0.0045931614,"about_ca_system_score_codex":0.002306594,"about_ca_system_score_gemma":0.0006835353,"threshold_uncertainty_score":0.024291277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034919992,0.00016960403,0.96194935,0.00011703577,0.000024098616,0.000025141037,0.000050597075,0.00026250878,0.0024816971],"genre_scores_gemma":[0.9396791,0.00022268994,0.056032203,0.00005156701,0.000028070128,0.00008132445,0.00011300886,0.000086473214,0.003705603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991229,0.00021554373,0.000029669913,0.00014676926,0.00040116045,0.00008403184],"domain_scores_gemma":[0.9982016,0.0012650384,0.00016416269,0.000112662536,0.00021028171,0.00004622612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095960655,0.00055000605,0.00051705755,0.0005409899,0.0003783478,0.0009646482,0.0008758678,0.00049643376,0.0031962378],"category_scores_gemma":[0.003729204,0.000299439,0.0007460845,0.00033320792,0.0012625343,0.0011992109,0.0011419952,0.0008742286,0.00023954247],"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.0000805323,0.000016027487,0.0009995685,0.00010756206,0.00004939964,0.00017483106,0.00012919147,0.84262836,0.0054776873,0.13955268,0.0002133915,0.01057074],"study_design_scores_gemma":[0.0000050895,0.000010121621,0.00013178172,0.0000037246339,0.000006162396,0.000015416303,0.000011473894,0.9684541,0.000989229,0.029931169,0.00043763264,0.000004026487],"about_ca_topic_score_codex":0.0032216755,"about_ca_topic_score_gemma":0.0016394742,"teacher_disagreement_score":0.0032216755,"about_ca_system_score_codex":0.0010726112,"about_ca_system_score_gemma":0.00077644427,"threshold_uncertainty_score":0.010692477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005555837,0.0005653901,0.98067725,0.0006308104,0.0001416791,0.00012152563,0.00008656739,0.000394139,0.0118268775],"genre_scores_gemma":[0.16280293,0.001739307,0.81723017,0.00109224,0.000593746,0.00086911424,0.00045703308,0.0007348977,0.014480563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98991895,0.0026778746,0.0010107673,0.0022895576,0.0034338352,0.0006690487],"domain_scores_gemma":[0.98567617,0.004628712,0.0009252776,0.0059301606,0.0022500628,0.00058953604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009333263,0.0014639574,0.0012186081,0.003144006,0.0020821523,0.004110585,0.0028755413,0.0020525681,0.005206495],"category_scores_gemma":[0.015248908,0.0013360045,0.003251666,0.002949703,0.010860121,0.013457844,0.0066356445,0.0062595867,0.0016196643],"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.000036041314,0.00001851672,0.0002059064,0.000074666015,0.00001991801,0.00009844773,0.0006036915,0.0038377598,0.001923198,0.978865,0.0007047091,0.013612023],"study_design_scores_gemma":[0.000054510216,0.00014060535,0.00024643776,0.00012747805,0.00007463023,0.00038631845,0.00018676474,0.026313582,0.0037998292,0.90490365,0.06370049,0.00006575689],"about_ca_topic_score_codex":0.0021184334,"about_ca_topic_score_gemma":0.0018946165,"teacher_disagreement_score":0.009333263,"about_ca_system_score_codex":0.0018019875,"about_ca_system_score_gemma":0.0022145344,"threshold_uncertainty_score":0.04935962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058771973,0.001734701,0.9728246,0.0009167847,0.000522644,0.0000714402,0.00015940182,0.0011274789,0.01676568],"genre_scores_gemma":[0.30512917,0.0034765638,0.6723642,0.0012696497,0.0009996297,0.00040647737,0.00042018262,0.0010322726,0.0149019025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697673,0.0010978667,0.00022271504,0.00049016403,0.0009370807,0.0002754319],"domain_scores_gemma":[0.99756074,0.0009166199,0.00012293113,0.00081283646,0.00046754457,0.000119207594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030723263,0.0008170662,0.0008224565,0.0012338555,0.0018899794,0.003157048,0.0015191502,0.0013292877,0.007970421],"category_scores_gemma":[0.0051442822,0.0009983368,0.0011966821,0.0016667085,0.0043176715,0.0063437345,0.0037005257,0.0042415466,0.0022696143],"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.0000108126815,0.0000063074385,0.000094407755,0.000062681225,0.000008303316,0.00004262557,0.00019907615,0.0011482532,0.00075323926,0.9859272,0.0008387808,0.010908203],"study_design_scores_gemma":[0.000017051767,0.000014833777,0.000097669224,0.000095319236,0.000045100005,0.00008807831,0.00009470562,0.011165523,0.0020234853,0.9356373,0.050694313,0.000026530126],"about_ca_topic_score_codex":0.0023095324,"about_ca_topic_score_gemma":0.002779612,"teacher_disagreement_score":0.007970421,"about_ca_system_score_codex":0.001361144,"about_ca_system_score_gemma":0.0022091465,"threshold_uncertainty_score":0.02666372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31081706,0.00053173426,0.6627043,0.0014842518,0.00019591002,0.00010556183,0.00009728791,0.000599615,0.023464363],"genre_scores_gemma":[0.86276644,0.0003939021,0.1308312,0.00033808604,0.0000754911,0.00019197431,0.00014526762,0.00019556732,0.005062021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986771,0.0004972276,0.00012997715,0.00022987481,0.00030194438,0.00016393261],"domain_scores_gemma":[0.9931335,0.0047593648,0.0004021484,0.000795168,0.0005930338,0.00031676053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221713,0.00041936096,0.0009266876,0.0005635112,0.0013520875,0.0017184535,0.0014958071,0.0018847398,0.002178216],"category_scores_gemma":[0.01722648,0.00038185192,0.00094928633,0.00043582934,0.0042884727,0.0034115906,0.002686028,0.0017996681,0.00045040765],"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.00016221988,0.00005625305,0.0018354183,0.00015788057,0.000024613884,0.0004336417,0.0005189831,0.19739562,0.0058732075,0.77157515,0.0009503771,0.021016568],"study_design_scores_gemma":[0.00003874814,0.000062312465,0.0001182087,0.000025100275,0.000010769457,0.00011395319,0.000087224165,0.39386526,0.0032709406,0.60140246,0.000980235,0.0000248586],"about_ca_topic_score_codex":0.0015492331,"about_ca_topic_score_gemma":0.00083755393,"teacher_disagreement_score":0.002221713,"about_ca_system_score_codex":0.0009581133,"about_ca_system_score_gemma":0.0008126372,"threshold_uncertainty_score":0.011749685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016094204,0.0014853452,0.9485061,0.0011154255,0.00017066953,0.0000781344,0.00045937777,0.0009759077,0.031114852],"genre_scores_gemma":[0.4991807,0.001377841,0.48547322,0.00063539576,0.00032024243,0.00024765756,0.0005192714,0.0003721329,0.011873448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970822,0.0007642396,0.00027773692,0.0007389554,0.00071813184,0.000418623],"domain_scores_gemma":[0.9973546,0.00076575484,0.00022665189,0.0009418924,0.0005162793,0.00019483983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003107374,0.0007050474,0.00080722355,0.0019621758,0.0017605778,0.005031015,0.0018046072,0.0012227504,0.005772554],"category_scores_gemma":[0.0036406142,0.00082904124,0.0015903095,0.0024635752,0.0044467095,0.009105351,0.003476124,0.003416425,0.0010609663],"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.000008353184,0.0000033555139,0.00021931957,0.000036456026,0.0000053000194,0.000025226404,0.0001787494,0.00088850607,0.0003789134,0.99293786,0.00041181367,0.0049061556],"study_design_scores_gemma":[0.000011241733,0.000018744846,0.00035277652,0.000087841705,0.000041246625,0.0001363958,0.00016216071,0.017510774,0.00191015,0.9456137,0.034125064,0.000029963436],"about_ca_topic_score_codex":0.0032827149,"about_ca_topic_score_gemma":0.0040964223,"teacher_disagreement_score":0.005772554,"about_ca_system_score_codex":0.002530004,"about_ca_system_score_gemma":0.0013867273,"threshold_uncertainty_score":0.01931113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034416333,0.0065575223,0.8529482,0.0051720347,0.00076727994,0.000065622204,0.00026500964,0.0002867236,0.09952124],"genre_scores_gemma":[0.84028476,0.004781786,0.13519081,0.0015536004,0.0017785816,0.00024989867,0.00024350337,0.00016820195,0.015748885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979569,0.00076876336,0.00014204183,0.0003477058,0.0006038237,0.00018075867],"domain_scores_gemma":[0.9984003,0.000904696,0.00013917577,0.00027721198,0.00017179258,0.00010690441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030163373,0.00056168344,0.0006704655,0.001260005,0.0012528051,0.0024107103,0.0010514971,0.0013562056,0.0041874545],"category_scores_gemma":[0.0033250754,0.00042516398,0.001122415,0.0009914109,0.009030297,0.008582234,0.0029340296,0.0031629738,0.0005416989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.874958e-7,7.799884e-7,0.000011867305,0.000007896137,8.9770293e-7,0.000009957274,0.000037415404,0.0002453106,0.000045304347,0.99905735,0.00007507711,0.00050710427],"study_design_scores_gemma":[0.0000021829244,0.0000063976054,0.000049093298,0.0000071377312,0.000002156433,0.000026764132,0.000020095367,0.0018479408,0.00008981562,0.9941922,0.003752172,0.000003968312],"about_ca_topic_score_codex":0.0007332643,"about_ca_topic_score_gemma":0.00042016807,"teacher_disagreement_score":0.0041874545,"about_ca_system_score_codex":0.0017212648,"about_ca_system_score_gemma":0.0007857382,"threshold_uncertainty_score":0.01595211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111719936,0.0005193941,0.8799472,0.0011813921,0.00006144273,0.00022270506,0.0006460709,0.00083020114,0.0048716445],"genre_scores_gemma":[0.5906819,0.0005619668,0.40310028,0.00030422502,0.0001315516,0.0001812727,0.0012811394,0.00014225721,0.0036154552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461514,0.001999147,0.00047502585,0.00090100314,0.0015589377,0.00045084563],"domain_scores_gemma":[0.97862166,0.017242434,0.0012720898,0.0017464383,0.0008058136,0.00031163945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004918313,0.00080324005,0.0012377028,0.0014098154,0.0018365487,0.00556823,0.002646567,0.0012079547,0.004133175],"category_scores_gemma":[0.014384222,0.00099146,0.003038235,0.0016623844,0.0026929958,0.011174764,0.0035199262,0.0028892872,0.00041128806],"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.00033517234,0.00023743854,0.0021979853,0.00068052625,0.0002980647,0.0008245854,0.0012752112,0.18783219,0.009938775,0.7406418,0.0018344477,0.05390393],"study_design_scores_gemma":[0.00012587334,0.000052772615,0.00048271235,0.00004796271,0.000117840325,0.00013481191,0.00023299965,0.38938826,0.008304964,0.59512657,0.005942225,0.00004313271],"about_ca_topic_score_codex":0.010496682,"about_ca_topic_score_gemma":0.01727653,"teacher_disagreement_score":0.010496682,"about_ca_system_score_codex":0.004000432,"about_ca_system_score_gemma":0.0037098976,"threshold_uncertainty_score":0.029025257},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03977462,0.10700428,0.2836816,0.422687,0.005329767,0.00008014765,0.00025423957,0.0008309142,0.14035745],"genre_scores_gemma":[0.7443382,0.075065605,0.11730944,0.02428874,0.012929329,0.00046859268,0.00031985735,0.00032548918,0.024954807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761426,0.0010987264,0.00008729005,0.00044482847,0.00046336435,0.00029162495],"domain_scores_gemma":[0.9888868,0.0069857175,0.0004401962,0.0015749831,0.0012022131,0.00091009063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007827619,0.00087924965,0.0013271113,0.0013075804,0.0027871272,0.00569301,0.0037102075,0.007208518,0.010619865],"category_scores_gemma":[0.009945608,0.0005520344,0.0009344176,0.001871872,0.01705546,0.027144302,0.004938482,0.008536061,0.0021375134],"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.00003309164,0.00004710273,0.000121135185,0.00008698206,0.000004861988,0.000050546914,0.0001312537,0.0013226706,0.00008877709,0.98276764,0.0030829364,0.012263016],"study_design_scores_gemma":[0.0000057542734,0.000008896496,0.000024141014,0.000028828055,0.0000011370736,0.000023410237,0.00012794549,0.0016137012,0.000047523034,0.99280214,0.0053081294,0.000008442414],"about_ca_topic_score_codex":0.0015638102,"about_ca_topic_score_gemma":0.0009934305,"teacher_disagreement_score":0.010619865,"about_ca_system_score_codex":0.002145843,"about_ca_system_score_gemma":0.0029612754,"threshold_uncertainty_score":0.041396916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15563032,0.0025961949,0.5371162,0.004147058,0.0013723009,0.00010862136,0.0006925054,0.0009174268,0.29741937],"genre_scores_gemma":[0.900913,0.0012559957,0.07138155,0.00083531457,0.0006419447,0.00017506021,0.00041304305,0.00024037405,0.024143778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971852,0.00093682803,0.0001459092,0.0005407465,0.0008390835,0.00035226127],"domain_scores_gemma":[0.99712676,0.0008286174,0.00028062137,0.00066263543,0.0006527723,0.0004485895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023433396,0.0007786475,0.00050226465,0.0014531036,0.001978175,0.0042961785,0.00096252846,0.0011132816,0.0072321882],"category_scores_gemma":[0.0037404117,0.00047434462,0.00079217856,0.001343147,0.008561577,0.0061678723,0.0051502357,0.0034700525,0.0013383203],"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.00000404842,0.0000029014323,0.00001417013,0.000008829956,0.0000010842863,0.000014912699,0.000056393892,0.00009415836,0.00019864456,0.99756265,0.00024684562,0.0017953891],"study_design_scores_gemma":[0.00000475644,0.000010322959,0.00004282299,0.000008298196,0.0000017237186,0.000053533797,0.00004330873,0.00065090536,0.0005096953,0.99253696,0.0061298707,0.0000078521925],"about_ca_topic_score_codex":0.0005092735,"about_ca_topic_score_gemma":0.00029986553,"teacher_disagreement_score":0.0072321882,"about_ca_system_score_codex":0.0010590657,"about_ca_system_score_gemma":0.0011088289,"threshold_uncertainty_score":0.024194062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038455683,0.00004129887,0.99744046,0.000029679726,0.000033632372,0.000039133738,0.000048974773,0.0014234894,0.00055872835],"genre_scores_gemma":[0.045596894,0.00026812276,0.9472238,0.00016984573,0.000052548858,0.00043773348,0.0005935808,0.0011644618,0.004493037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962669,0.0010801994,0.00041944112,0.00049436436,0.0015067421,0.00023234737],"domain_scores_gemma":[0.99661237,0.0016129381,0.00019902698,0.0008067391,0.0006921245,0.00007683747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003186478,0.0013163277,0.001010451,0.0012983951,0.00075492816,0.0020303223,0.0029405484,0.0013023218,0.007859004],"category_scores_gemma":[0.007008271,0.0010559296,0.002220989,0.0011546027,0.0013291624,0.003320221,0.0019297152,0.0024758265,0.0020514354],"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.00030059746,0.00018075736,0.0006853719,0.00095843547,0.00017415872,0.0008505045,0.00054737827,0.124349184,0.031745933,0.51230836,0.013900033,0.31399927],"study_design_scores_gemma":[0.00023624754,0.00009827031,0.00012702869,0.0001628128,0.00013577996,0.00071260135,0.00004695671,0.77442396,0.036596164,0.09530247,0.0920366,0.00012115937],"about_ca_topic_score_codex":0.0022295627,"about_ca_topic_score_gemma":0.002452321,"teacher_disagreement_score":0.007859004,"about_ca_system_score_codex":0.0010879989,"about_ca_system_score_gemma":0.0027029032,"threshold_uncertainty_score":0.026290953},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031287514,0.00025536184,0.9588819,0.00026868636,0.00006321565,0.000055241937,0.00006728815,0.0013120291,0.0078087114],"genre_scores_gemma":[0.6305471,0.00033403654,0.357834,0.00030212398,0.00014789119,0.00030182605,0.00017904547,0.0009591221,0.009394809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99375594,0.0015691144,0.00068717817,0.0010519502,0.0022456704,0.00069016573],"domain_scores_gemma":[0.9854395,0.0060620783,0.0011615284,0.004943795,0.0019677458,0.00042527658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007619775,0.00067798985,0.0011586628,0.0019630054,0.0017367335,0.0047273417,0.0022745598,0.0015401205,0.0026249639],"category_scores_gemma":[0.021296753,0.0010106845,0.0018226512,0.0016418283,0.008148872,0.009597021,0.0050274692,0.0040697437,0.0009744894],"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.00006961955,0.000016117183,0.00088791386,0.000056941386,0.000015263911,0.00006955479,0.0004924251,0.0020774077,0.0025173977,0.9761766,0.00039758396,0.017222933],"study_design_scores_gemma":[0.00003896564,0.00008759263,0.000484972,0.000070150396,0.00007631875,0.00033669334,0.0001245384,0.03771925,0.024838097,0.9256623,0.010489716,0.000071399925],"about_ca_topic_score_codex":0.0012071086,"about_ca_topic_score_gemma":0.0010517532,"teacher_disagreement_score":0.007619775,"about_ca_system_score_codex":0.0021263508,"about_ca_system_score_gemma":0.0018447126,"threshold_uncertainty_score":0.040297687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025943164,0.0008943925,0.92530715,0.0005808569,0.0002892827,0.00015443984,0.0009847742,0.004279096,0.04156679],"genre_scores_gemma":[0.27566382,0.0008157039,0.6888469,0.00055786344,0.00016147696,0.00037769845,0.0018250413,0.0012334817,0.030517932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991334,0.00016163892,0.00008307106,0.00012855715,0.00035089318,0.00014256344],"domain_scores_gemma":[0.99889344,0.00033063898,0.000063144245,0.00030075663,0.00035194558,0.000060132974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060521334,0.00040172337,0.00052841264,0.0008764204,0.00084858155,0.0020399943,0.0013347416,0.0010624075,0.014199413],"category_scores_gemma":[0.004988692,0.0003267596,0.00041690364,0.0015810883,0.0008296718,0.003799376,0.0015681237,0.0007472859,0.008353084],"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.00037821004,0.00007644947,0.0007874944,0.0003329982,0.000027447944,0.00017639737,0.0003207423,0.015496267,0.015819917,0.58263683,0.019215148,0.364732],"study_design_scores_gemma":[0.00011458337,0.00017127061,0.00051246537,0.0001821371,0.000050587194,0.0006651176,0.00019771587,0.17733449,0.023508424,0.654385,0.14281057,0.00006768385],"about_ca_topic_score_codex":0.00074015715,"about_ca_topic_score_gemma":0.0012096836,"teacher_disagreement_score":0.014199413,"about_ca_system_score_codex":0.00052788405,"about_ca_system_score_gemma":0.00095707364,"threshold_uncertainty_score":0.047501743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028808734,0.00005429744,0.9884836,0.0002634066,0.00011338823,0.00007332193,0.00009175658,0.004404433,0.003634907],"genre_scores_gemma":[0.14619128,0.0002420807,0.83844423,0.0007476075,0.00020246865,0.00046571143,0.00056814234,0.0029107202,0.0102277575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99335665,0.0016082218,0.0008528155,0.00096121745,0.0026551406,0.00056586385],"domain_scores_gemma":[0.99337715,0.0020008578,0.00032215475,0.0026556412,0.0014183924,0.00022584575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006855563,0.00084470474,0.0010927619,0.0017928897,0.0012606964,0.0053011333,0.0038675903,0.0021880744,0.010183818],"category_scores_gemma":[0.0091010155,0.0015456489,0.0024082162,0.0013196492,0.005001354,0.0138613405,0.0067235692,0.00621973,0.002960338],"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.00012596129,0.000054197862,0.00048918166,0.00014609468,0.0000266937,0.00014078987,0.0007182238,0.0036016281,0.006586683,0.95769405,0.0033737714,0.027042704],"study_design_scores_gemma":[0.00016843018,0.00029624367,0.00048915413,0.00017575843,0.00017776986,0.00065135333,0.00039868045,0.1353133,0.039748617,0.5938502,0.22851247,0.00021797087],"about_ca_topic_score_codex":0.0015250898,"about_ca_topic_score_gemma":0.0010869261,"teacher_disagreement_score":0.010183818,"about_ca_system_score_codex":0.0018034187,"about_ca_system_score_gemma":0.0023661815,"threshold_uncertainty_score":0.036256135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03212911,0.004769153,0.86050826,0.012319546,0.00031693676,0.00020629998,0.00012621393,0.0012126555,0.08841184],"genre_scores_gemma":[0.5842291,0.0032721823,0.3931085,0.0016234489,0.00041372547,0.00028021686,0.0001276324,0.00064208126,0.016303144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97446126,0.01651506,0.0008291379,0.0020741478,0.0042806063,0.0018397702],"domain_scores_gemma":[0.9645644,0.026249189,0.0008546136,0.0052996245,0.0022768783,0.00075525296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01940678,0.0008790026,0.0012203308,0.0027544233,0.0064112926,0.009504535,0.0035731343,0.0046997103,0.006416063],"category_scores_gemma":[0.03809096,0.0013583597,0.0025528118,0.0034421615,0.022054642,0.026019253,0.010552167,0.007569364,0.0012357185],"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.000012978003,0.000010466168,0.000111747984,0.00003918229,0.000004168736,0.00022920693,0.00062549417,0.0006578971,0.00018834352,0.9940439,0.00041640515,0.003660272],"study_design_scores_gemma":[0.00004171313,0.000046704106,0.00025261633,0.00017604358,0.00003071202,0.00093628373,0.0012265709,0.008351594,0.002997927,0.9150346,0.07085393,0.000051316736],"about_ca_topic_score_codex":0.008340584,"about_ca_topic_score_gemma":0.0061426256,"teacher_disagreement_score":0.01940678,"about_ca_system_score_codex":0.0048054433,"about_ca_system_score_gemma":0.003506856,"threshold_uncertainty_score":0.10263407},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128906155,0.0013638159,0.8621885,0.0052957344,0.0007924715,0.0016608903,0.0044281245,0.06495241,0.046427332],"genre_scores_gemma":[0.10059423,0.0011594584,0.8317824,0.0014244006,0.00091793336,0.0019857837,0.015604108,0.019622585,0.026909048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.95364255,0.015206998,0.0046077,0.004899834,0.019061992,0.0025809512],"domain_scores_gemma":[0.88693106,0.030521052,0.006912024,0.05069222,0.019769007,0.005174557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.044942293,0.0019343753,0.0040305173,0.01247248,0.0053310217,0.013239239,0.013731279,0.005274842,0.03242897],"category_scores_gemma":[0.10305008,0.0025261238,0.0035876622,0.009299648,0.005032583,0.034677804,0.025336374,0.0077774962,0.01616213],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075860723,0.0009979621,0.0056539667,0.0022610624,0.00014308273,0.00074950256,0.0040273312,0.01432208,0.0051200627,0.45273146,0.1317965,0.38143837],"study_design_scores_gemma":[0.00034508246,0.00046829545,0.0012951624,0.0011063414,0.00014177356,0.0012356216,0.0012356546,0.06572235,0.012486729,0.37071392,0.5448799,0.00036923392],"about_ca_topic_score_codex":0.0012752515,"about_ca_topic_score_gemma":0.001364772,"teacher_disagreement_score":0.044942293,"about_ca_system_score_codex":0.0037771876,"about_ca_system_score_gemma":0.010197405,"threshold_uncertainty_score":0.23768038},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050727124,0.000064669184,0.9907403,0.00007919951,0.000056133555,0.000100902886,0.00017840652,0.0022382657,0.0014694011],"genre_scores_gemma":[0.17439453,0.00035541542,0.82016057,0.00021239041,0.000081983584,0.0005960041,0.0010106635,0.00083681976,0.002351662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98875064,0.0042229635,0.0017577366,0.001190937,0.0036711723,0.00040656465],"domain_scores_gemma":[0.9791029,0.010453756,0.0021538164,0.005783547,0.002216503,0.00028948006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008284751,0.0013314348,0.0006411258,0.002047512,0.0006915158,0.0034074408,0.0027089422,0.0017941182,0.0032822527],"category_scores_gemma":[0.02622902,0.0009286012,0.0020434172,0.0011015671,0.0031831977,0.006591795,0.0025082377,0.0019532049,0.0008164505],"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.00020430372,0.00011241309,0.0025567417,0.00061866536,0.00012783914,0.0010700457,0.0011881349,0.25407588,0.016510537,0.6523274,0.0030430616,0.06816502],"study_design_scores_gemma":[0.00016224095,0.0002561621,0.00047973453,0.00032282068,0.00016244128,0.0005244214,0.00020158329,0.67193645,0.057448935,0.21622428,0.052171387,0.00010959894],"about_ca_topic_score_codex":0.00267219,"about_ca_topic_score_gemma":0.0023010133,"teacher_disagreement_score":0.008284751,"about_ca_system_score_codex":0.0013709487,"about_ca_system_score_gemma":0.0029950321,"threshold_uncertainty_score":0.04381448},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033209015,0.041961472,0.3802981,0.055329986,0.06346716,0.0003238623,0.0020771571,0.0023364464,0.42099681],"genre_scores_gemma":[0.22851211,0.015958106,0.13447067,0.0053418917,0.012029938,0.00031298999,0.0037931956,0.0018700914,0.59771097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983797,0.0005811831,0.000086655054,0.0003190932,0.0004042743,0.00022911836],"domain_scores_gemma":[0.9984951,0.00037634856,0.000041413212,0.00044406147,0.00041692329,0.00022605683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002735386,0.00096490467,0.0012301755,0.0012949341,0.002144353,0.006474704,0.0020890962,0.0018842771,0.06757799],"category_scores_gemma":[0.0032302053,0.0005982715,0.0015794918,0.0011770081,0.0017567246,0.005432513,0.0038992984,0.003886861,0.01302111],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006290055,0.00033171414,0.00071715267,0.000498337,0.00013899874,0.0002628344,0.0007415062,0.0027193595,0.0067136707,0.35922742,0.30614382,0.3218762],"study_design_scores_gemma":[0.00007041634,0.00008710081,0.0007239193,0.00027944826,0.00009640823,0.00028198896,0.00031486852,0.009060313,0.0066250074,0.28035814,0.7020541,0.00004846101],"about_ca_topic_score_codex":0.0020234885,"about_ca_topic_score_gemma":0.0041151242,"teacher_disagreement_score":0.06757799,"about_ca_system_score_codex":0.0023725214,"about_ca_system_score_gemma":0.002037307,"threshold_uncertainty_score":0.22607088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32232067,0.0029522134,0.5588113,0.002330125,0.0011493223,0.003531858,0.010259072,0.023137325,0.07550813],"genre_scores_gemma":[0.51666045,0.0020472535,0.37142485,0.00059328374,0.00046029413,0.0016315514,0.02484003,0.0048059355,0.077536374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964498,0.00070074125,0.0001259879,0.0005817341,0.0016772103,0.00046441963],"domain_scores_gemma":[0.99552554,0.0005288481,0.0002168579,0.000766705,0.0021869761,0.0007750746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043154643,0.0020138486,0.0011810721,0.0018485404,0.0014192726,0.0021245657,0.0019448819,0.0019010006,0.014588679],"category_scores_gemma":[0.002751873,0.0006260987,0.0016443321,0.0009587987,0.0008411049,0.0018219668,0.0018327753,0.0014284158,0.011196266],"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.0018652846,0.0037287287,0.009421128,0.0010159382,0.0004853493,0.0010033824,0.001682307,0.022265254,0.41302732,0.0057506124,0.037049122,0.50270563],"study_design_scores_gemma":[0.00080098765,0.00856706,0.012431189,0.00014905643,0.0005385467,0.0011035607,0.0010972783,0.050987873,0.7252194,0.0031583447,0.19578287,0.00016381033],"about_ca_topic_score_codex":0.0039059678,"about_ca_topic_score_gemma":0.0026028461,"teacher_disagreement_score":0.014588679,"about_ca_system_score_codex":0.0011295117,"about_ca_system_score_gemma":0.006382975,"threshold_uncertainty_score":0.048803985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005438296,0.00009244565,0.9916677,0.000066549794,0.000034181543,0.00008829987,0.000055453453,0.0005931784,0.0019638697],"genre_scores_gemma":[0.19356619,0.00032592964,0.8003836,0.000119466924,0.000058921985,0.0005485718,0.00032956444,0.00028086727,0.0043868627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930246,0.0032570078,0.0007323866,0.0010272629,0.0015892239,0.0003695049],"domain_scores_gemma":[0.9917197,0.005001451,0.0005571115,0.0015940641,0.0010152478,0.0001123654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007025564,0.00081930764,0.00055784447,0.0011676002,0.00060301216,0.0016209617,0.0015904005,0.0009243279,0.003224154],"category_scores_gemma":[0.012609646,0.0007344507,0.0021363513,0.0008147753,0.002909961,0.002545443,0.0021651234,0.0017345976,0.00065483735],"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.00016784246,0.00006320492,0.0007428658,0.00032880137,0.00006014239,0.00045910612,0.0011862,0.071133524,0.014591246,0.8689411,0.0008407387,0.0414853],"study_design_scores_gemma":[0.00026314825,0.00026101703,0.00042920347,0.00021038463,0.0000942109,0.00030443864,0.00015770199,0.4065846,0.026226776,0.5139824,0.051422145,0.00006396381],"about_ca_topic_score_codex":0.002894753,"about_ca_topic_score_gemma":0.0023609889,"teacher_disagreement_score":0.007025564,"about_ca_system_score_codex":0.0013263368,"about_ca_system_score_gemma":0.0016993395,"threshold_uncertainty_score":0.03715521},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014062725,0.00095009204,0.9364928,0.0040647024,0.00032421038,0.00008280281,0.00008943083,0.00026959582,0.043663707],"genre_scores_gemma":[0.55677605,0.0018763049,0.42463183,0.0013145573,0.0011978315,0.0004056861,0.0001101562,0.00023055194,0.013456976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734086,0.00078873907,0.00014893276,0.00035527142,0.0012281963,0.00013796616],"domain_scores_gemma":[0.99382836,0.004086863,0.00033660105,0.0010610028,0.0005411439,0.00014603077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032768738,0.00054631446,0.00056621205,0.0021692158,0.001065535,0.0038978893,0.0016148946,0.0013065638,0.0029389246],"category_scores_gemma":[0.012544483,0.00044636303,0.00084026303,0.0012161267,0.008368998,0.006532206,0.003146676,0.0031939035,0.00053497835],"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.0000043887826,0.000005635222,0.00003875317,0.000014909975,0.0000027645565,0.000020926369,0.000048390993,0.0035651233,0.00021861,0.9915024,0.0002885132,0.0042896504],"study_design_scores_gemma":[0.000004280752,0.000012403504,0.000039608625,0.000012065442,0.000002393118,0.00003876966,0.000012651616,0.025652805,0.00038657073,0.971226,0.002604327,0.000008145968],"about_ca_topic_score_codex":0.0005965184,"about_ca_topic_score_gemma":0.0004096637,"teacher_disagreement_score":0.0038978893,"about_ca_system_score_codex":0.0014788955,"about_ca_system_score_gemma":0.0012913204,"threshold_uncertainty_score":0.017329931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01000361,0.00007021081,0.98729414,0.0001683706,0.000009044444,0.000039388113,0.000022391576,0.0017965329,0.0005963717],"genre_scores_gemma":[0.43491518,0.00026363897,0.5621947,0.00014174916,0.000020487909,0.00020259117,0.0001556197,0.00037423405,0.0017317383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975712,0.00078935997,0.00014927347,0.0004219818,0.0008538598,0.00021443455],"domain_scores_gemma":[0.9952604,0.0029495393,0.00040527905,0.0009865552,0.00033682355,0.00006139736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018750294,0.00086220435,0.00082774035,0.001340796,0.00066757336,0.0020306914,0.002362154,0.0016344977,0.0017872084],"category_scores_gemma":[0.009442505,0.0006525957,0.0015100145,0.00095038675,0.0020430505,0.0033598375,0.0029497198,0.0019846503,0.0004336474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00021776043,0.00030044233,0.0038448586,0.000610587,0.0001502759,0.0013009663,0.0010969781,0.52658725,0.039135214,0.19994469,0.002433156,0.2243778],"study_design_scores_gemma":[0.000025956268,0.000054923432,0.00014820279,0.000034407854,0.000043879783,0.00027842564,0.00008816108,0.8784713,0.027263442,0.0908831,0.0026872514,0.000020906053],"about_ca_topic_score_codex":0.0022772993,"about_ca_topic_score_gemma":0.00258514,"teacher_disagreement_score":0.002362154,"about_ca_system_score_codex":0.0011271149,"about_ca_system_score_gemma":0.0014809502,"threshold_uncertainty_score":0.009916186},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013539393,0.058410138,0.28842348,0.03664887,0.03535108,0.0010048208,0.01636002,0.009681011,0.5405812],"genre_scores_gemma":[0.039085895,0.023727806,0.074550316,0.0023726358,0.002558055,0.00042900874,0.01661578,0.003366649,0.837294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967489,0.0004318475,0.0001487805,0.00042464663,0.001832279,0.00041360367],"domain_scores_gemma":[0.99531436,0.0006218573,0.00006272281,0.0005328803,0.0028063327,0.0006618077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004690494,0.001592186,0.0019061465,0.0017437688,0.0027350865,0.0074415477,0.0025759412,0.0011975414,0.1186886],"category_scores_gemma":[0.0056524957,0.00090163277,0.0012553433,0.0019382539,0.0033626056,0.0034012434,0.0033551797,0.0033409488,0.023410697],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002453494,0.00013588172,0.0009063936,0.0003657261,0.00006515083,0.00018555904,0.0007738424,0.0026498467,0.004129471,0.054515284,0.72607166,0.20995583],"study_design_scores_gemma":[0.000026805305,0.000025292396,0.0009521063,0.00022078848,0.000022055372,0.00010623513,0.00028507863,0.00332252,0.0013643926,0.0104470095,0.98318106,0.00004676872],"about_ca_topic_score_codex":0.56238997,"about_ca_topic_score_gemma":0.6858001,"teacher_disagreement_score":0.43761003,"about_ca_system_score_codex":0.020038437,"about_ca_system_score_gemma":0.030181784,"threshold_uncertainty_score":0.88037443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22838953,0.001523032,0.74258244,0.0025329047,0.00020974608,0.00044870353,0.00013070526,0.004238279,0.019944528],"genre_scores_gemma":[0.4583415,0.0024921673,0.5184097,0.0010743367,0.00012373572,0.00032221296,0.00054702954,0.002942122,0.01574719],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.988701,0.0054460415,0.000689079,0.0014164322,0.0030268023,0.00072065287],"domain_scores_gemma":[0.9741896,0.016790286,0.0005132699,0.0026008987,0.004350766,0.0015551543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017995974,0.0014615894,0.0008937491,0.0011479941,0.0018902115,0.0037778963,0.0037216733,0.0031599307,0.0056801867],"category_scores_gemma":[0.0429702,0.00093603175,0.00079441234,0.0010424819,0.0029043257,0.00789173,0.004742626,0.0035549407,0.00203277],"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.00060191157,0.002420046,0.0089323195,0.0023710493,0.0001611451,0.004385538,0.09797183,0.028528066,0.071957394,0.018175764,0.010713934,0.7537811],"study_design_scores_gemma":[0.0005411645,0.006221555,0.0069063082,0.00219129,0.00043014623,0.016313896,0.046354137,0.1327262,0.15196007,0.03849512,0.59689295,0.00096716656],"about_ca_topic_score_codex":0.002074867,"about_ca_topic_score_gemma":0.002568452,"teacher_disagreement_score":0.017995974,"about_ca_system_score_codex":0.0012117393,"about_ca_system_score_gemma":0.0022212458,"threshold_uncertainty_score":0.09517294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025736585,0.0009986553,0.7103091,0.0028636632,0.00090670685,0.000067862755,0.000820627,0.0028175488,0.25547934],"genre_scores_gemma":[0.77244055,0.0013287417,0.161133,0.0009836606,0.00042277612,0.00019311221,0.00076677464,0.0007555906,0.061975803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999493,0.00017878259,0.000024138872,0.00012846048,0.00011518231,0.000060355844],"domain_scores_gemma":[0.998755,0.00050405104,0.00010153162,0.00037551965,0.00019882983,0.000065041175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097346626,0.00047595162,0.00028044777,0.0007670248,0.0011770217,0.0029964051,0.0006965359,0.0009922255,0.022011776],"category_scores_gemma":[0.0024336942,0.0003245822,0.0005471991,0.00070807844,0.0032874658,0.005189403,0.0013808162,0.0022712033,0.002956691],"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.000011916165,0.0000028475235,0.000020077629,0.000022214903,0.0000017120007,0.000043323034,0.00022198967,0.0005429238,0.0008665785,0.99491405,0.00066787744,0.002684475],"study_design_scores_gemma":[0.000010576412,0.000017810724,0.00008115526,0.000030372164,0.000009190673,0.00009256164,0.00009642722,0.0063451882,0.0025834008,0.937785,0.05293675,0.000011615087],"about_ca_topic_score_codex":0.0010889621,"about_ca_topic_score_gemma":0.0009706583,"teacher_disagreement_score":0.022011776,"about_ca_system_score_codex":0.0011958178,"about_ca_system_score_gemma":0.00064281904,"threshold_uncertainty_score":0.07363677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08895331,0.0004938774,0.77500725,0.0014232481,0.00074107264,0.00021045108,0.00060657767,0.00082432345,0.13173983],"genre_scores_gemma":[0.7886965,0.00056380854,0.16580908,0.0010078186,0.00035768762,0.00056484755,0.0007203279,0.00049009133,0.041789856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856335,0.00029546663,0.00011550354,0.00033760504,0.00041113654,0.00027693488],"domain_scores_gemma":[0.9990428,0.0002846974,0.00007615581,0.000164719,0.00029781307,0.00013383068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011038791,0.00073657837,0.0005711934,0.0010009715,0.0015300354,0.0028361443,0.0012010159,0.0010590617,0.012759644],"category_scores_gemma":[0.001910326,0.00032551496,0.0008267518,0.00075897516,0.0030046701,0.0051578563,0.0022033667,0.0029830602,0.0019045358],"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.000009507246,0.0000072301045,0.000022306127,0.000011943937,0.0000012241956,0.000041844058,0.00014041444,0.00018613426,0.0011780366,0.9957361,0.0003667862,0.002298359],"study_design_scores_gemma":[0.000011327497,0.000021309095,0.00002307187,0.000012141231,0.0000049849996,0.00012026378,0.000099692006,0.0036317923,0.0031718682,0.9806692,0.012218506,0.000015906196],"about_ca_topic_score_codex":0.00056874147,"about_ca_topic_score_gemma":0.00042828397,"teacher_disagreement_score":0.012759644,"about_ca_system_score_codex":0.0014955036,"about_ca_system_score_gemma":0.0011208929,"threshold_uncertainty_score":0.04268533},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26470926,0.00040839188,0.7143339,0.00032056653,0.00017288238,0.00018546476,0.00047108185,0.0017452636,0.017653244],"genre_scores_gemma":[0.8875994,0.00019569343,0.105834246,0.00011349427,0.000071165014,0.00016165622,0.0005593703,0.00026035227,0.0052045705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963875,0.0007070779,0.00041889865,0.0008055739,0.0012332628,0.0004477009],"domain_scores_gemma":[0.9902519,0.005632551,0.0007543413,0.0021905098,0.000869215,0.00030159624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011776456,0.00051157083,0.00057897845,0.0011463348,0.00088778714,0.0033796965,0.0015190346,0.00092055567,0.00665628],"category_scores_gemma":[0.009066284,0.00044265963,0.0019114318,0.0009833331,0.002042927,0.006034314,0.0017990146,0.002129054,0.00094503775],"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.00022737349,0.00018016268,0.001500907,0.00023537745,0.00006625376,0.0010083419,0.0009322823,0.066697374,0.018386126,0.86025244,0.00114695,0.04936632],"study_design_scores_gemma":[0.000030483647,0.000093639144,0.00044969728,0.000032553475,0.000052999338,0.0003592288,0.00013873033,0.17206623,0.018531417,0.8047389,0.003459815,0.00004625626],"about_ca_topic_score_codex":0.0006384276,"about_ca_topic_score_gemma":0.00073168083,"teacher_disagreement_score":0.00665628,"about_ca_system_score_codex":0.0011502485,"about_ca_system_score_gemma":0.0006232796,"threshold_uncertainty_score":0.02226752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6307605,0.0004834573,0.3582959,0.0006195165,0.000041668456,0.000088732704,0.0012338287,0.00043300557,0.008043453],"genre_scores_gemma":[0.9770586,0.00018935696,0.020081632,0.000036593352,0.000025831463,0.00008228818,0.000616756,0.00005428977,0.0018544768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997891,0.00036103284,0.00021907577,0.00047908307,0.00073243486,0.00031738653],"domain_scores_gemma":[0.9883659,0.007851004,0.0010780876,0.0010505632,0.0012077423,0.00044668358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012263014,0.00031594376,0.0007716759,0.0014428317,0.00079473836,0.0028209744,0.0010748759,0.0006660542,0.003146229],"category_scores_gemma":[0.010930711,0.00029265461,0.0012631617,0.0010227944,0.001511874,0.0064010913,0.001331779,0.0015545313,0.00021549608],"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.00024224988,0.00007709519,0.00546323,0.0002586071,0.000087464505,0.00029312744,0.00071823865,0.21058895,0.00661352,0.75073665,0.0008297459,0.024091227],"study_design_scores_gemma":[0.000018696966,0.000043437845,0.0012046987,0.00002190166,0.000037934526,0.00011431847,0.00010812107,0.41057768,0.0035267517,0.5823136,0.0020010034,0.000031735526],"about_ca_topic_score_codex":0.0030543678,"about_ca_topic_score_gemma":0.0020366411,"teacher_disagreement_score":0.003146229,"about_ca_system_score_codex":0.002836186,"about_ca_system_score_gemma":0.001285584,"threshold_uncertainty_score":0.020578027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20913917,0.0004405385,0.75561726,0.001347855,0.00016264724,0.00020309974,0.00034048135,0.00031851025,0.03243047],"genre_scores_gemma":[0.89849174,0.00026713512,0.09743963,0.00015887484,0.00013123153,0.00025867167,0.0001944777,0.00010596838,0.0029522208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959915,0.0015046718,0.0004266197,0.00050901924,0.0010386944,0.0005294957],"domain_scores_gemma":[0.98934186,0.0044622095,0.0013125679,0.0031758405,0.0011142371,0.0005932802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046383417,0.0004591214,0.00061540236,0.00081917306,0.0015016928,0.0033872183,0.0014528788,0.0010093254,0.003982395],"category_scores_gemma":[0.010904791,0.00038350196,0.0012413942,0.0010629654,0.004035873,0.006077462,0.0024294725,0.0023358557,0.00075638166],"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.00006138999,0.00003309765,0.0001924054,0.000019096426,0.0000051506663,0.000067141,0.00014838544,0.0045837504,0.002172238,0.9890431,0.0001726126,0.003501528],"study_design_scores_gemma":[0.00002470752,0.00005196885,0.00015287509,0.000010963393,0.000008501759,0.00006319331,0.00005768469,0.04898449,0.0030803275,0.9464879,0.0010559312,0.000021349912],"about_ca_topic_score_codex":0.0008786471,"about_ca_topic_score_gemma":0.00070332264,"teacher_disagreement_score":0.0046383417,"about_ca_system_score_codex":0.0015775799,"about_ca_system_score_gemma":0.0016001086,"threshold_uncertainty_score":0.024530172},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23801525,0.0016947496,0.39735875,0.0016714173,0.0009422142,0.00022997365,0.0017590628,0.00096796494,0.3573607],"genre_scores_gemma":[0.913792,0.00070175127,0.04127381,0.0007641092,0.00022349451,0.0002639652,0.0017241971,0.0002712738,0.040985316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984263,0.0002192031,0.00008620254,0.00033133704,0.00065575587,0.00028123055],"domain_scores_gemma":[0.99850863,0.0002759998,0.000114101116,0.00024258955,0.0006285957,0.00023003077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078383455,0.00042003795,0.0004431266,0.0019054591,0.0026947036,0.0033537545,0.0010651205,0.0006705406,0.006037856],"category_scores_gemma":[0.0012990353,0.00022874994,0.00059355283,0.0011472617,0.0033916493,0.004306113,0.003791045,0.0014430329,0.00077998015],"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.000009597784,0.0000056890804,0.00017707716,0.000018865474,0.0000029418397,0.000061368104,0.00015596884,0.00022594062,0.00037128333,0.99524647,0.00060037745,0.0031244324],"study_design_scores_gemma":[0.000009595507,0.000025739226,0.0006707707,0.000037263104,0.000017214918,0.0005922518,0.00026503715,0.005267685,0.0026489312,0.9050227,0.08541236,0.000030386176],"about_ca_topic_score_codex":0.0043968908,"about_ca_topic_score_gemma":0.0024949948,"teacher_disagreement_score":0.006037856,"about_ca_system_score_codex":0.0017706815,"about_ca_system_score_gemma":0.0019126439,"threshold_uncertainty_score":0.020198643},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130068045,0.00033407693,0.96534014,0.0019699612,0.00016608942,0.00013239417,0.0010032058,0.001624712,0.016422521],"genre_scores_gemma":[0.485152,0.0005065168,0.48670134,0.0018659666,0.00026144437,0.00080410315,0.0017886349,0.0006071347,0.02231303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980564,0.00054485037,0.00015538186,0.0004311679,0.0005453283,0.0002669228],"domain_scores_gemma":[0.9984856,0.0005401036,0.000117898555,0.0003180421,0.0003849888,0.00015332764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019873893,0.00048960553,0.0005458874,0.0011602493,0.0014460062,0.0036139542,0.0025473454,0.0015478138,0.00979483],"category_scores_gemma":[0.0025172469,0.00067073264,0.0015751519,0.0014324649,0.0040792054,0.005531114,0.0031380784,0.003305153,0.002045725],"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.000016424417,0.00001149311,0.00009074202,0.000034753055,0.0000031309921,0.00006353994,0.00021502971,0.0010012913,0.00076083187,0.99379504,0.0010555063,0.0029522774],"study_design_scores_gemma":[0.00004250648,0.000065575216,0.0001715676,0.000045954588,0.000017297054,0.00031943893,0.00020215797,0.029483153,0.002690039,0.89801913,0.06889385,0.00004922075],"about_ca_topic_score_codex":0.004063521,"about_ca_topic_score_gemma":0.0027301642,"teacher_disagreement_score":0.00979483,"about_ca_system_score_codex":0.0029831636,"about_ca_system_score_gemma":0.0017144637,"threshold_uncertainty_score":0.032766998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48441988,0.0027663074,0.1344868,0.036768015,0.0036070899,0.0012412624,0.0010231648,0.0073893033,0.32829815],"genre_scores_gemma":[0.5987764,0.0031365077,0.17651425,0.009954397,0.00050200423,0.0014104281,0.00089721725,0.0018647895,0.20694387],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998719,0.00041969627,0.000070940085,0.00017991396,0.0003078398,0.00030262646],"domain_scores_gemma":[0.998061,0.00046766057,0.00017535416,0.00011763384,0.0003768841,0.0008014525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018267339,0.0012631238,0.00049760984,0.0010320403,0.0017617415,0.0035468778,0.0014303487,0.001524491,0.01955],"category_scores_gemma":[0.004043564,0.0004938723,0.00067728944,0.0004084788,0.0025677348,0.0035743925,0.0058271238,0.0045998725,0.007990924],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063804135,0.00459791,0.01991845,0.0016645296,0.00003665618,0.0049985372,0.13398236,0.002838123,0.041986443,0.19047649,0.2616497,0.3372128],"study_design_scores_gemma":[0.000088502,0.0009425348,0.0058575943,0.00068920077,0.00002035115,0.0024089825,0.023580622,0.002526802,0.012907507,0.03769407,0.91317993,0.00010386557],"about_ca_topic_score_codex":0.0012379722,"about_ca_topic_score_gemma":0.0037978312,"teacher_disagreement_score":0.01955,"about_ca_system_score_codex":0.0034620578,"about_ca_system_score_gemma":0.0020037498,"threshold_uncertainty_score":0.065401256},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01931265,0.00004155582,0.97791946,0.00014140498,0.00001382712,0.000071270355,0.00005896857,0.0016095917,0.00083119137],"genre_scores_gemma":[0.4791048,0.00013460955,0.51835036,0.00018152475,0.000033736353,0.00021666575,0.00032064697,0.00044970762,0.0012079765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614006,0.0012814724,0.00026424509,0.00056237564,0.0013680488,0.00038386285],"domain_scores_gemma":[0.9924231,0.0040422236,0.00039253297,0.0021837302,0.0008116355,0.00014684947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040860684,0.0008416589,0.000810241,0.0009718368,0.00096137583,0.002250985,0.0030108113,0.0011901509,0.0029271774],"category_scores_gemma":[0.011572572,0.00076163135,0.0017185933,0.00072007556,0.0033694552,0.0043855,0.0031009407,0.0031906911,0.0006708826],"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.00022668701,0.0002005128,0.0012578467,0.00030423247,0.000079903824,0.00030345184,0.0005520188,0.22093932,0.05529996,0.63949656,0.0018211296,0.0795183],"study_design_scores_gemma":[0.00006442574,0.00008436915,0.00017802959,0.000029609042,0.000024441526,0.00007481233,0.00007003579,0.71699125,0.032583997,0.24609017,0.0037783787,0.00003053056],"about_ca_topic_score_codex":0.0033076329,"about_ca_topic_score_gemma":0.0031727718,"teacher_disagreement_score":0.0040860684,"about_ca_system_score_codex":0.0017399911,"about_ca_system_score_gemma":0.002924195,"threshold_uncertainty_score":0.021609426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025399374,0.000111441615,0.9617173,0.0006424077,0.000048898255,0.00010496262,0.00003345593,0.0016466369,0.01029546],"genre_scores_gemma":[0.4051248,0.00030118215,0.58104706,0.00025087837,0.00006718109,0.00017550266,0.00009590183,0.001011621,0.011925784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970907,0.00096792274,0.0001879323,0.00043376762,0.0009646582,0.00035502907],"domain_scores_gemma":[0.9928803,0.0025613932,0.0002447499,0.0035823248,0.00056063925,0.00017059578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044966056,0.0006340354,0.0008272348,0.00064591883,0.0018502929,0.0020349217,0.0024329626,0.0012920974,0.006979558],"category_scores_gemma":[0.014120649,0.0010447362,0.0010818446,0.0009622341,0.00336772,0.006970077,0.0042963987,0.0029780495,0.001914398],"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.00020379452,0.00006308548,0.0007266223,0.00015198112,0.000025657382,0.00020951562,0.0011882344,0.021546917,0.0146514205,0.8551248,0.0026520225,0.10345601],"study_design_scores_gemma":[0.00013289005,0.00016883646,0.00031668163,0.00012592868,0.00008582244,0.00031775527,0.00044314237,0.16929442,0.03574907,0.7338803,0.059412442,0.00007281815],"about_ca_topic_score_codex":0.0025393134,"about_ca_topic_score_gemma":0.0034367517,"teacher_disagreement_score":0.006979558,"about_ca_system_score_codex":0.0009834339,"about_ca_system_score_gemma":0.002148758,"threshold_uncertainty_score":0.023780584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006642002,0.000753335,0.96135455,0.001022143,0.00034098641,0.000056199136,0.00017019226,0.0010040955,0.02865657],"genre_scores_gemma":[0.612699,0.0025968899,0.34820926,0.0016582604,0.0017275712,0.0005319198,0.0005804643,0.00086886506,0.031127784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971023,0.00053394475,0.0002506939,0.0005721815,0.001113038,0.00042786478],"domain_scores_gemma":[0.993562,0.0029264113,0.00059518666,0.0012586748,0.001280662,0.00037702345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026561487,0.0009062513,0.0008898133,0.0020407233,0.0020545393,0.004894332,0.0022950973,0.0017482693,0.009452313],"category_scores_gemma":[0.009601342,0.00094479584,0.0016851696,0.0020020085,0.005494991,0.009405563,0.0032561633,0.004586717,0.0020290154],"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.0000067491296,0.000006596862,0.000052066243,0.000024245632,0.0000041035255,0.00003396983,0.00008252675,0.0016833674,0.00028939694,0.9936474,0.0006952153,0.0034743303],"study_design_scores_gemma":[0.000014272203,0.000018447687,0.000037533817,0.000031038355,0.000016546604,0.00009847914,0.000040867213,0.0112738395,0.00067746686,0.9763659,0.011409354,0.000016380913],"about_ca_topic_score_codex":0.0014583283,"about_ca_topic_score_gemma":0.0010420018,"teacher_disagreement_score":0.009452313,"about_ca_system_score_codex":0.0024305927,"about_ca_system_score_gemma":0.0026053677,"threshold_uncertainty_score":0.031621158},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013088614,0.00036412274,0.9590811,0.00034143543,0.00092412817,0.00040753707,0.0012479628,0.009430703,0.026894191],"genre_scores_gemma":[0.018711396,0.0009834896,0.8883785,0.0005279137,0.00044413327,0.0012827233,0.0035785558,0.00507065,0.08102266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853146,0.00043867092,0.00014178679,0.00018804237,0.0006123755,0.000087587796],"domain_scores_gemma":[0.99519914,0.0017312876,0.00022418259,0.0013527015,0.0011790035,0.00031364564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018332152,0.001633379,0.0006357409,0.0015087381,0.0007830529,0.0038130826,0.0023946774,0.0016970218,0.0897865],"category_scores_gemma":[0.008827106,0.0007256714,0.0007626085,0.0015441263,0.0009981361,0.002953774,0.002312316,0.002185282,0.025807073],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022785288,0.00016269568,0.00026654458,0.0012450357,0.000029279568,0.0008046735,0.0012205004,0.0112508945,0.020583076,0.19150718,0.21782507,0.5548773],"study_design_scores_gemma":[0.00004759437,0.00025347946,0.0003216242,0.00030982078,0.000011493906,0.00067565904,0.00016022053,0.0062053218,0.008056429,0.028967464,0.95493585,0.00005508831],"about_ca_topic_score_codex":0.00072442566,"about_ca_topic_score_gemma":0.0008375994,"teacher_disagreement_score":0.0897865,"about_ca_system_score_codex":0.00074383477,"about_ca_system_score_gemma":0.0011721819,"threshold_uncertainty_score":0.30036575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008214821,0.00015406718,0.98331535,0.00015687743,0.00011710624,0.000060613576,0.00015189168,0.0016852808,0.006143997],"genre_scores_gemma":[0.39584333,0.00057528145,0.5876972,0.00047020763,0.00019340876,0.00022545819,0.0010038035,0.0019931789,0.011998217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971623,0.00047627164,0.00023240586,0.00069220795,0.0011575972,0.0002792362],"domain_scores_gemma":[0.9969127,0.000923149,0.00017108701,0.0011324517,0.0007507904,0.000109738634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013640079,0.0006176997,0.00070903054,0.000988273,0.00062459527,0.0018285685,0.0016148677,0.0007397622,0.002263228],"category_scores_gemma":[0.0049538915,0.000519488,0.0013900812,0.00092604244,0.0023041319,0.0028323869,0.0032788867,0.0028783972,0.0011922874],"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.000111654816,0.00010435361,0.0004509071,0.00041784137,0.00007763471,0.0005388125,0.00069471344,0.025100704,0.059203044,0.80202913,0.0036588078,0.10761238],"study_design_scores_gemma":[0.00005662746,0.000089307825,0.00025730452,0.00004391282,0.00012233864,0.0005870855,0.00011548311,0.10513993,0.07378709,0.7892145,0.030526277,0.000060162118],"about_ca_topic_score_codex":0.001294828,"about_ca_topic_score_gemma":0.0011271122,"teacher_disagreement_score":0.002263228,"about_ca_system_score_codex":0.00086101395,"about_ca_system_score_gemma":0.0009767476,"threshold_uncertainty_score":0.0075712204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09906216,0.0026920137,0.69340116,0.016137363,0.0006425954,0.00010874545,0.00028016802,0.00021909838,0.18745665],"genre_scores_gemma":[0.9137571,0.0010426538,0.07226047,0.0011864265,0.000806995,0.00017966081,0.000099125056,0.00009397555,0.010573657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961599,0.002068652,0.00016389912,0.00041501274,0.0009174065,0.00027522587],"domain_scores_gemma":[0.9916602,0.005560049,0.0006014616,0.0012151352,0.0005521901,0.00041099126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006166154,0.00052756164,0.0005588476,0.0018364176,0.0022094902,0.0044425908,0.0012734308,0.0024014555,0.004992423],"category_scores_gemma":[0.015729187,0.00043696226,0.0008757013,0.0011890461,0.013820058,0.01012371,0.0030298522,0.0039000507,0.00048752775],"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.0000014155938,0.000001281032,0.00002388774,0.0000032637452,6.075836e-7,0.0000047948197,0.00005342444,0.00023603665,0.000017941495,0.99903345,0.000077363366,0.0005466217],"study_design_scores_gemma":[0.000001259121,0.000001812792,0.0000316217,0.0000035113917,6.1274307e-7,0.000007367563,0.000015644131,0.0012185993,0.000022877439,0.9981799,0.0005139804,0.0000028512175],"about_ca_topic_score_codex":0.0008759955,"about_ca_topic_score_gemma":0.0007940434,"teacher_disagreement_score":0.006166154,"about_ca_system_score_codex":0.0019177163,"about_ca_system_score_gemma":0.0010697453,"threshold_uncertainty_score":0.032610178},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025645534,0.00021204013,0.4595486,0.00056598417,0.00046043447,0.00044170543,0.010592841,0.5000215,0.025592333],"genre_scores_gemma":[0.08551999,0.0008655996,0.5148456,0.0025211188,0.00042680767,0.0021098491,0.10261861,0.22709318,0.06399916],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996222,0.00068819395,0.0004435414,0.0006546043,0.0015742906,0.0004173618],"domain_scores_gemma":[0.99570954,0.0013797819,0.00030207445,0.0010653676,0.0013679774,0.00017523806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038685952,0.0020762961,0.00093487574,0.0021130352,0.0007715836,0.0036361695,0.005830882,0.0014529023,0.12275004],"category_scores_gemma":[0.011311856,0.0022020745,0.0032885566,0.0011419941,0.0010865026,0.0049731606,0.005782138,0.0042547607,0.06845153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015176513,0.00032957594,0.002492762,0.0028484066,0.00031601597,0.0007893448,0.0006302532,0.012121922,0.014647213,0.121061705,0.602806,0.24043916],"study_design_scores_gemma":[0.00060169405,0.00023973278,0.0007802028,0.00043097738,0.00012813836,0.00084105786,0.00013504918,0.07991316,0.027269475,0.059386913,0.8300763,0.00019733331],"about_ca_topic_score_codex":0.004042007,"about_ca_topic_score_gemma":0.0036406158,"teacher_disagreement_score":0.12275004,"about_ca_system_score_codex":0.0015060897,"about_ca_system_score_gemma":0.0036699972,"threshold_uncertainty_score":0.41063982},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013874997,0.082040146,0.15497467,0.042131804,0.14889717,0.00028709538,0.0024792633,0.0014362813,0.5538785],"genre_scores_gemma":[0.10585152,0.044881232,0.059356883,0.0056389393,0.029557006,0.0002985896,0.0052711973,0.0013244858,0.7478202],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987418,0.00032040573,0.0000827764,0.00024343263,0.0004425514,0.00016909446],"domain_scores_gemma":[0.9979342,0.000490039,0.000067341214,0.00039942376,0.0007611079,0.0003479012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147184,0.00082148256,0.0015808458,0.001278808,0.0015476488,0.007095246,0.0011121014,0.0011713136,0.07553163],"category_scores_gemma":[0.0030753391,0.0003413466,0.0010570115,0.00156925,0.0015619961,0.0037457105,0.0023230817,0.0034316534,0.015803723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035653368,0.00020554532,0.00072486285,0.0004084651,0.00010127165,0.00012673586,0.00031891456,0.0011980785,0.0027395447,0.2052317,0.5561394,0.23244889],"study_design_scores_gemma":[0.00003279048,0.000049247916,0.00060476776,0.00018607038,0.000047790745,0.0001299164,0.00012780505,0.003746566,0.0013111484,0.07397772,0.91976357,0.000022586379],"about_ca_topic_score_codex":0.0026084138,"about_ca_topic_score_gemma":0.004457122,"teacher_disagreement_score":0.07553163,"about_ca_system_score_codex":0.0021091357,"about_ca_system_score_gemma":0.0027980502,"threshold_uncertainty_score":0.25267845},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006960186,0.10956549,0.16110466,0.08735096,0.102017574,0.00032950414,0.0035928136,0.0019494893,0.5271293],"genre_scores_gemma":[0.09500604,0.057827163,0.09490674,0.011223304,0.0418637,0.00045950225,0.007278734,0.002970981,0.6884638],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971596,0.0009792887,0.0001915787,0.00052024913,0.00085893524,0.00029032904],"domain_scores_gemma":[0.9977106,0.0008413134,0.00006849601,0.00038733127,0.0006392064,0.000353046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033786285,0.00094098103,0.0013397902,0.001578712,0.0019183662,0.007848968,0.0016514458,0.0016208042,0.09016574],"category_scores_gemma":[0.0047019366,0.0006006311,0.0015415525,0.0015450823,0.0024236308,0.0069689383,0.0036582905,0.006315992,0.01969166],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013658123,0.00010341095,0.00026691577,0.00038536216,0.000059872447,0.00011350088,0.00065032474,0.0007605452,0.0015356806,0.23379073,0.6389463,0.12325085],"study_design_scores_gemma":[0.000013636914,0.000024238087,0.0002540235,0.0001961291,0.00001570965,0.00013859784,0.00013323792,0.00088660634,0.00050931197,0.088581584,0.90922797,0.000018917099],"about_ca_topic_score_codex":0.0016384209,"about_ca_topic_score_gemma":0.0033466602,"teacher_disagreement_score":0.09016574,"about_ca_system_score_codex":0.0031761713,"about_ca_system_score_gemma":0.0027900415,"threshold_uncertainty_score":0.30163443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06809759,0.00037514765,0.9207386,0.0012086527,0.000060788643,0.00021034706,0.00038885814,0.0018779237,0.0070421477],"genre_scores_gemma":[0.3656549,0.00037121677,0.63013947,0.00026232906,0.00004665226,0.00027362976,0.00063307065,0.00039790382,0.0022208167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871814,0.00045710447,0.000056862158,0.00027217547,0.00033901547,0.00015662458],"domain_scores_gemma":[0.99407285,0.004040746,0.00041847274,0.0011217467,0.00019323158,0.0001529349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011233445,0.0009200463,0.0006804558,0.0011298809,0.0009143301,0.0015592499,0.0019146639,0.0010513915,0.005462411],"category_scores_gemma":[0.0066773044,0.0005602986,0.0011991954,0.0017273879,0.0017181091,0.0049430486,0.0026600247,0.0024326087,0.00043040197],"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.00036220753,0.00025870567,0.0018393327,0.00036784043,0.00007676091,0.00029173875,0.0005757228,0.4627716,0.011352891,0.27433184,0.0063853944,0.24138594],"study_design_scores_gemma":[0.000054096305,0.00010006547,0.0003578766,0.000051044684,0.000034993882,0.00014222917,0.00016082024,0.717991,0.0072389552,0.26627657,0.007572243,0.00002018172],"about_ca_topic_score_codex":0.003423182,"about_ca_topic_score_gemma":0.0065682493,"teacher_disagreement_score":0.005462411,"about_ca_system_score_codex":0.0019197619,"about_ca_system_score_gemma":0.0014770566,"threshold_uncertainty_score":0.018273592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007924838,0.0007882842,0.94376457,0.012355741,0.0003702989,0.00006689975,0.00016097943,0.00028429128,0.03428402],"genre_scores_gemma":[0.61857235,0.0021999301,0.3617096,0.004431386,0.0014540685,0.00054459047,0.0004872956,0.0002928896,0.010307882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929096,0.0039603687,0.0005329164,0.00085410307,0.0013423864,0.00040068454],"domain_scores_gemma":[0.9796022,0.013767052,0.0016564257,0.0023235157,0.0021266735,0.00052424194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013953999,0.0009563955,0.0008512297,0.002938951,0.0029251585,0.00811887,0.0027778442,0.0041017653,0.006516952],"category_scores_gemma":[0.019487139,0.0010687337,0.0025473384,0.0018126502,0.011423226,0.019973006,0.0074973167,0.0076753986,0.000916384],"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.0000042932884,0.000007829991,0.00007731992,0.000019537534,0.000006521881,0.0000401935,0.00011128304,0.0009536625,0.0000560136,0.99736565,0.00027046358,0.0010872725],"study_design_scores_gemma":[0.000007434801,0.0000039507895,0.000028089384,0.000013648894,0.0000070973824,0.000026493288,0.00004144419,0.004729042,0.000097892465,0.99237216,0.0026675041,0.000005303764],"about_ca_topic_score_codex":0.001659432,"about_ca_topic_score_gemma":0.0019125756,"teacher_disagreement_score":0.013953999,"about_ca_system_score_codex":0.0026844647,"about_ca_system_score_gemma":0.0034323155,"threshold_uncertainty_score":0.07379669},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016823201,0.0076465453,0.87568986,0.008135646,0.006138239,0.00031890912,0.0009946347,0.012235972,0.08715789],"genre_scores_gemma":[0.045543205,0.01222809,0.8308364,0.0066641574,0.007267148,0.0010677258,0.006955701,0.011272089,0.07816546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9873604,0.0059673097,0.0011884894,0.0016290365,0.0032440946,0.00061067025],"domain_scores_gemma":[0.9778867,0.013415578,0.00032187128,0.004010862,0.0036129823,0.0007521034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018997258,0.0024802126,0.0021282993,0.0047139083,0.0020720598,0.0102916565,0.0048632985,0.0026878281,0.075215586],"category_scores_gemma":[0.032506216,0.0019994606,0.0037313339,0.0032175255,0.0038239553,0.009340016,0.0071641253,0.007443326,0.030568205],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003289369,0.00031102163,0.0005299379,0.0010755808,0.00011964246,0.0005473764,0.000725634,0.006570183,0.0018581013,0.35991016,0.2784602,0.34956327],"study_design_scores_gemma":[0.00013822132,0.0000829716,0.0002516373,0.0007670666,0.00006335009,0.0005647207,0.0001374547,0.031688903,0.0030253534,0.23095079,0.7322548,0.000074690855],"about_ca_topic_score_codex":0.0031364814,"about_ca_topic_score_gemma":0.0024561593,"teacher_disagreement_score":0.075215586,"about_ca_system_score_codex":0.0040926053,"about_ca_system_score_gemma":0.004500992,"threshold_uncertainty_score":0.2516212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028938293,0.0006440376,0.98919666,0.0010554971,0.000118260075,0.00014548971,0.00014251983,0.00035576464,0.005447925],"genre_scores_gemma":[0.18320526,0.0019107356,0.8060395,0.0007891607,0.00022641663,0.0007965899,0.00093877426,0.00035154852,0.005741987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947472,0.0022682252,0.0005600751,0.0006122541,0.0014185145,0.00039373484],"domain_scores_gemma":[0.9925096,0.004020978,0.0006758064,0.001569705,0.00095443515,0.0002693853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058192783,0.0011534737,0.0008020018,0.00096930034,0.0011364644,0.00445448,0.0031973347,0.0027112372,0.0040515587],"category_scores_gemma":[0.013230153,0.00086675904,0.002261497,0.00081677776,0.0056732884,0.008771991,0.003961986,0.003983944,0.0017352608],"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.000030510171,0.000094862095,0.0005795053,0.0005074884,0.00005240936,0.00036056552,0.0011843393,0.05332772,0.0020191318,0.917418,0.00191898,0.022506539],"study_design_scores_gemma":[0.00006159173,0.000080470316,0.00016715184,0.0003813852,0.00007317437,0.00032946354,0.00035226764,0.10390792,0.0039523565,0.8203008,0.07033479,0.000058611837],"about_ca_topic_score_codex":0.006329881,"about_ca_topic_score_gemma":0.005412614,"teacher_disagreement_score":0.006329881,"about_ca_system_score_codex":0.0016174089,"about_ca_system_score_gemma":0.0037249385,"threshold_uncertainty_score":0.030775666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045751937,0.0004024817,0.89615506,0.0005626618,0.00024519998,0.00009325968,0.00009291719,0.0007939072,0.05590253],"genre_scores_gemma":[0.4627032,0.0005328884,0.49259013,0.00032252542,0.00019469303,0.00011337866,0.00021017404,0.0007316888,0.04260134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983895,0.00037116106,0.00009372508,0.0003719092,0.0005813695,0.00019239997],"domain_scores_gemma":[0.99911493,0.00015685981,0.000100482124,0.00031455292,0.00018624347,0.00012684481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012204912,0.000767676,0.00045052468,0.00095269264,0.0016697786,0.0027671233,0.000955782,0.0010319124,0.011039712],"category_scores_gemma":[0.0022846046,0.0004995486,0.0013806557,0.0008876315,0.0031710123,0.0074871085,0.0034907896,0.001669975,0.0019717098],"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.0001051019,0.000032192554,0.00047023964,0.00008479449,0.00001581642,0.00044577813,0.00077622285,0.004162653,0.00934986,0.93922454,0.0011427853,0.044189997],"study_design_scores_gemma":[0.000040791096,0.00023399762,0.00066790363,0.00011196673,0.000058928992,0.0015012677,0.0008817694,0.05670265,0.019233204,0.76792705,0.15256879,0.000071646406],"about_ca_topic_score_codex":0.0012759252,"about_ca_topic_score_gemma":0.0011973355,"teacher_disagreement_score":0.011039712,"about_ca_system_score_codex":0.0011626657,"about_ca_system_score_gemma":0.0006760403,"threshold_uncertainty_score":0.036931515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015647404,0.00027974247,0.9709009,0.0005216085,0.00027334905,0.000084630505,0.00016408194,0.0005192109,0.011609006],"genre_scores_gemma":[0.5952171,0.0006655687,0.38814154,0.0006323095,0.0007342449,0.0006657242,0.0004371955,0.0006921816,0.012814177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653995,0.0011237995,0.0003692101,0.0005965344,0.00100803,0.00036248297],"domain_scores_gemma":[0.995773,0.0014599898,0.0004544471,0.0012278629,0.000757733,0.00032697184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004312454,0.0008182653,0.00061054056,0.0011795593,0.0014529155,0.004266889,0.0017542804,0.0016622427,0.0047561973],"category_scores_gemma":[0.005924809,0.00064147695,0.0015429064,0.0012017487,0.003676475,0.012767322,0.003209813,0.004131554,0.00076933624],"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.000026378979,0.00001122901,0.00012580003,0.000033335535,0.0000076147144,0.00006872563,0.00039143977,0.0011703599,0.00067270984,0.9923211,0.00039591666,0.0047753938],"study_design_scores_gemma":[0.000038198305,0.000038903436,0.000111118425,0.00003750953,0.000034153014,0.00016609496,0.00016417555,0.009006448,0.0022905055,0.9689418,0.019148352,0.000022606035],"about_ca_topic_score_codex":0.0004919455,"about_ca_topic_score_gemma":0.00038404853,"teacher_disagreement_score":0.0047561973,"about_ca_system_score_codex":0.0012869604,"about_ca_system_score_gemma":0.0011700707,"threshold_uncertainty_score":0.022806704},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014043946,0.05053252,0.11395461,0.09128159,0.044133924,0.00010771696,0.0011165784,0.0004170411,0.68441206],"genre_scores_gemma":[0.30871773,0.027380869,0.04750963,0.0070137284,0.025087938,0.0004995561,0.0017036111,0.0008947097,0.5811922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862826,0.00053274,0.000083406274,0.0002732125,0.00033050042,0.00015187854],"domain_scores_gemma":[0.99464804,0.0031312674,0.0001272612,0.0007207315,0.0009372254,0.00043551376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027290026,0.0008550904,0.001662094,0.0018791909,0.0022794,0.0106374705,0.0019058028,0.0027205532,0.07709182],"category_scores_gemma":[0.00814611,0.00046707396,0.0012505447,0.0019090082,0.004406516,0.007035254,0.0026710886,0.0057100374,0.0077939993],"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.000114534065,0.000088442626,0.00041850258,0.00013972087,0.0000578595,0.000117233176,0.00027706622,0.00090190914,0.00020576514,0.8169177,0.13209137,0.048669927],"study_design_scores_gemma":[0.000044976503,0.000023851922,0.0004308806,0.00019857439,0.000054206517,0.000092162314,0.00025697143,0.003756382,0.00025862208,0.62470394,0.37016135,0.00001801963],"about_ca_topic_score_codex":0.004573801,"about_ca_topic_score_gemma":0.0032302176,"teacher_disagreement_score":0.07709182,"about_ca_system_score_codex":0.004530358,"about_ca_system_score_gemma":0.0021021552,"threshold_uncertainty_score":0.2578978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071991034,0.0038189243,0.5023608,0.003443589,0.0031192154,0.00063065067,0.0017616283,0.0009160411,0.4119582],"genre_scores_gemma":[0.5667415,0.0020419275,0.31698132,0.0020447113,0.001726207,0.0018272676,0.0022375172,0.00087885634,0.10552073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930453,0.00018462025,0.000048905782,0.00013881245,0.00016257448,0.0001604293],"domain_scores_gemma":[0.99955505,0.000119531716,0.00007614459,0.00006816671,0.000116511605,0.00006460618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010728596,0.0011201462,0.0004561987,0.0017206733,0.0016047827,0.002290526,0.0010268858,0.00095893245,0.018121153],"category_scores_gemma":[0.0012464034,0.0002750884,0.0007132187,0.0008862148,0.0024911987,0.0026613127,0.0017043694,0.0022965763,0.0055823997],"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.000017329721,0.000011133559,0.000040895844,0.000020013229,0.0000016433908,0.00005500057,0.00022277464,0.00018112866,0.0008637886,0.9882023,0.0027182896,0.007665632],"study_design_scores_gemma":[0.00002103837,0.000044933076,0.00014414954,0.000025278712,0.0000045812812,0.00017209421,0.00012844718,0.0014182576,0.0013458531,0.9232825,0.073389076,0.00002370344],"about_ca_topic_score_codex":0.0006981279,"about_ca_topic_score_gemma":0.0005442659,"teacher_disagreement_score":0.018121153,"about_ca_system_score_codex":0.00074316974,"about_ca_system_score_gemma":0.00071160967,"threshold_uncertainty_score":0.06062132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18431626,0.0043849545,0.42425284,0.0037226714,0.0017148401,0.00060504,0.0024772761,0.0012855452,0.37724057],"genre_scores_gemma":[0.83923453,0.0009760808,0.120428264,0.0008080338,0.0004358267,0.00093517033,0.0015732382,0.000282638,0.035326246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994056,0.00018586767,0.00003225168,0.00010691882,0.00011353144,0.00015576741],"domain_scores_gemma":[0.99962974,0.00013056192,0.000057714806,0.00004623622,0.000069077614,0.0000666541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008651608,0.00058977795,0.0003637837,0.00112972,0.0014103517,0.0017306366,0.0008480856,0.0006403963,0.011319735],"category_scores_gemma":[0.0009059415,0.00021618098,0.0003842265,0.00070819416,0.002078999,0.0016696429,0.001603583,0.0015687847,0.0025128126],"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.000019557992,0.00001561856,0.00008044581,0.000016477727,0.000001530662,0.000083939376,0.0005466558,0.00016850632,0.0010535453,0.9902653,0.0016420997,0.0061062775],"study_design_scores_gemma":[0.000026724567,0.000057473484,0.000272763,0.000029863664,0.000006670981,0.0002501081,0.0003338138,0.0020447103,0.003011315,0.94276977,0.051171046,0.000025834252],"about_ca_topic_score_codex":0.0008717585,"about_ca_topic_score_gemma":0.00068804424,"teacher_disagreement_score":0.011319735,"about_ca_system_score_codex":0.0006984769,"about_ca_system_score_gemma":0.00059929705,"threshold_uncertainty_score":0.03786826},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065983385,0.0010920804,0.9099937,0.0056740297,0.00009636163,0.00007880627,0.0015725265,0.00020428728,0.015304811],"genre_scores_gemma":[0.8640452,0.0014334966,0.12433916,0.00095043913,0.000660863,0.00041574906,0.0021083478,0.00015377626,0.005892925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886234,0.0064440947,0.00069662853,0.001690319,0.0017639213,0.0007816306],"domain_scores_gemma":[0.9155662,0.069709264,0.005469353,0.005724114,0.0020188203,0.0015122343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012144109,0.0011122762,0.0016687328,0.0025723358,0.002022957,0.003973683,0.0027272694,0.0024968835,0.0068649906],"category_scores_gemma":[0.053197417,0.0013557684,0.002301955,0.0028128617,0.005180917,0.011030058,0.0052147405,0.0069275023,0.0005775278],"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.00003904448,0.000030631607,0.0009507083,0.00008078794,0.000038585513,0.00011944079,0.00016262778,0.029641107,0.00018283077,0.96451247,0.0006393894,0.0036024111],"study_design_scores_gemma":[0.000013019441,0.0000061757446,0.00018575763,0.000026211006,0.000009116954,0.000036693105,0.00002496301,0.074681275,0.00009371612,0.9242586,0.00065269123,0.000011767672],"about_ca_topic_score_codex":0.003909123,"about_ca_topic_score_gemma":0.0044439156,"teacher_disagreement_score":0.012144109,"about_ca_system_score_codex":0.003005357,"about_ca_system_score_gemma":0.0020768514,"threshold_uncertainty_score":0.0642249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20917729,0.0010097794,0.59540933,0.001940606,0.0010741401,0.00045870317,0.00081133767,0.0013545256,0.1887643],"genre_scores_gemma":[0.83490443,0.00061463163,0.1153161,0.0005223076,0.0005787122,0.000521647,0.0005534004,0.00045633095,0.046532363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998453,0.0003517243,0.00012944572,0.00042074334,0.00040852284,0.00023647683],"domain_scores_gemma":[0.99873096,0.00040196467,0.0001437717,0.00018256108,0.0004168989,0.00012376012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014596239,0.00067872583,0.00042424354,0.0012167038,0.0013217895,0.0023079836,0.00079619675,0.0008965672,0.012179724],"category_scores_gemma":[0.0025101665,0.0003918471,0.0007837539,0.00050765835,0.0037245844,0.004126621,0.0015917858,0.0022884335,0.0022329798],"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.000007515342,0.00000955602,0.00003572304,0.000011640033,0.0000013490081,0.00003567136,0.00018637895,0.00018895794,0.0012445821,0.9953597,0.0004742657,0.0024446142],"study_design_scores_gemma":[0.000017664377,0.00002566463,0.000046192417,0.000009244986,0.000003153047,0.000092258444,0.000069757174,0.0032328842,0.0027712504,0.9855596,0.008156417,0.000016073218],"about_ca_topic_score_codex":0.0006315645,"about_ca_topic_score_gemma":0.00054844574,"teacher_disagreement_score":0.012179724,"about_ca_system_score_codex":0.0012718025,"about_ca_system_score_gemma":0.0007669916,"threshold_uncertainty_score":0.04074526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1665866,0.0030781932,0.7357722,0.0015633925,0.0005555867,0.00016360379,0.0015372605,0.0012523588,0.08949082],"genre_scores_gemma":[0.8753957,0.00083320506,0.10094203,0.00057407795,0.00028187354,0.00016026275,0.00110391,0.00017073733,0.020538239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988403,0.00023896279,0.00011062628,0.00024794342,0.00039541337,0.00016676071],"domain_scores_gemma":[0.9987417,0.0003115778,0.00007164334,0.00020513982,0.00047274647,0.00019721425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015217331,0.00025644273,0.00037309818,0.001892298,0.0014254934,0.0026825403,0.00075229147,0.00064295356,0.0051754145],"category_scores_gemma":[0.001255594,0.00028084056,0.000459563,0.0014312256,0.0033420015,0.0031932555,0.002418591,0.0014198594,0.0010699542],"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.000018435852,0.000008549292,0.00052871037,0.00007233502,0.0000051218585,0.00013637356,0.0009659715,0.00025035735,0.0017382994,0.986798,0.00081943616,0.00865845],"study_design_scores_gemma":[0.000013585396,0.000065529144,0.003210832,0.00006114317,0.000022461247,0.0011039773,0.0012320462,0.0041488376,0.0032475325,0.91679364,0.07006495,0.000035383615],"about_ca_topic_score_codex":0.0030804146,"about_ca_topic_score_gemma":0.002141452,"teacher_disagreement_score":0.0051754145,"about_ca_system_score_codex":0.0007230231,"about_ca_system_score_gemma":0.0011107943,"threshold_uncertainty_score":0.01731348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032320503,0.00034821423,0.93702376,0.000993489,0.00011187998,0.00020028208,0.00018885771,0.0039714426,0.02484154],"genre_scores_gemma":[0.40317914,0.0010619267,0.5777736,0.00042640613,0.000064777574,0.0005204838,0.0005988904,0.00066637964,0.01570839],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9965928,0.001729351,0.00018686539,0.00049387966,0.0008238113,0.00017323527],"domain_scores_gemma":[0.9870078,0.010666013,0.00035801958,0.00091365847,0.0006726524,0.00038183638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023578058,0.0010203968,0.00044888197,0.001089676,0.00060172897,0.0027981196,0.0014019421,0.001041895,0.015579669],"category_scores_gemma":[0.016427545,0.0006096189,0.0007414868,0.00066444697,0.0012307421,0.004833583,0.0028119616,0.0019314755,0.002858648],"study_design_candidate":"observational","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.00025973085,0.000815196,0.009200192,0.0010319899,0.00006161055,0.0006555867,0.021115657,0.021191683,0.034918386,0.26237863,0.021630477,0.6267409],"study_design_scores_gemma":[0.0002255824,0.00080317666,0.0040578973,0.0008136362,0.00009249961,0.0017599247,0.0036125467,0.11167802,0.044772126,0.29232094,0.5396851,0.00017855328],"about_ca_topic_score_codex":0.0009974255,"about_ca_topic_score_gemma":0.0015631038,"teacher_disagreement_score":0.015579669,"about_ca_system_score_codex":0.0011161179,"about_ca_system_score_gemma":0.001196146,"threshold_uncertainty_score":0.052119195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3443583,0.0005069728,0.6376022,0.0027480246,0.00008868553,0.00030522412,0.0007768535,0.0014584692,0.012155247],"genre_scores_gemma":[0.9516869,0.0001721508,0.043891277,0.0003528706,0.00012566292,0.00037631794,0.00056958623,0.00021546739,0.002609659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880642,0.0032550425,0.00096049946,0.0028516501,0.0027605896,0.0021079744],"domain_scores_gemma":[0.9001621,0.086234905,0.004802691,0.004992084,0.002041048,0.0017671499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006780452,0.0013712216,0.0019114583,0.001645347,0.0022767272,0.008237005,0.006031884,0.004306616,0.003377521],"category_scores_gemma":[0.046165742,0.0018354259,0.0034842568,0.001422097,0.006644914,0.016263692,0.0047591235,0.007428123,0.00028477385],"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.00047162437,0.0004727729,0.005157161,0.00034827457,0.00027162506,0.00086170423,0.0021342656,0.25267303,0.0059989076,0.7184244,0.0018363276,0.011349954],"study_design_scores_gemma":[0.00011414772,0.00008178857,0.0002774999,0.000040167528,0.00007778789,0.0001567636,0.00020759297,0.5833545,0.0036312086,0.41090205,0.0011154343,0.000041040545],"about_ca_topic_score_codex":0.0068364698,"about_ca_topic_score_gemma":0.0044996208,"teacher_disagreement_score":0.008237005,"about_ca_system_score_codex":0.0066189095,"about_ca_system_score_gemma":0.0052688434,"threshold_uncertainty_score":0.0480237},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10598086,0.005127657,0.5300624,0.010690238,0.0014528778,0.00008869316,0.0010935008,0.00065030274,0.3448536],"genre_scores_gemma":[0.9156736,0.0016861733,0.044591818,0.0019618275,0.0007434514,0.00010171137,0.00036027638,0.000109332555,0.03477182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911803,0.00027326413,0.0000432974,0.0001831406,0.00026217973,0.00012006611],"domain_scores_gemma":[0.9989336,0.00047829238,0.00009193921,0.00011143993,0.0003175615,0.000067166024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084679644,0.00037823364,0.00027764472,0.0011401294,0.001065666,0.002103384,0.00057629193,0.00064952305,0.015147734],"category_scores_gemma":[0.0021472303,0.00023033602,0.0006412639,0.0012843651,0.0034202994,0.0044280984,0.0028987732,0.0018685181,0.0011020341],"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.000009308371,0.000004921173,0.00005230008,0.000029968747,0.000003864961,0.000042012434,0.00013458655,0.00020033665,0.00044198742,0.99437994,0.0011428198,0.003558003],"study_design_scores_gemma":[0.0000048743877,0.000007988107,0.00011804414,0.000014086939,0.0000044383532,0.00008855232,0.000055735432,0.001441687,0.00036939842,0.9877022,0.0101858,0.000007137851],"about_ca_topic_score_codex":0.0014561857,"about_ca_topic_score_gemma":0.0011824105,"teacher_disagreement_score":0.015147734,"about_ca_system_score_codex":0.0012846078,"about_ca_system_score_gemma":0.0006700564,"threshold_uncertainty_score":0.05067426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08467486,0.00040409982,0.7409156,0.0006795247,0.0002598633,0.00017968046,0.00032036178,0.0017107589,0.17085528],"genre_scores_gemma":[0.79584914,0.0006872143,0.11547932,0.00045610868,0.00026826037,0.0002789155,0.0005457969,0.00078323594,0.085651964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984914,0.00032324347,0.000083046034,0.0005526288,0.00039911777,0.00015053649],"domain_scores_gemma":[0.998798,0.00031147207,0.00010106792,0.0003314313,0.0003667323,0.0000912472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071430847,0.00044100397,0.00043419382,0.0007270115,0.001102847,0.0020325438,0.0007938153,0.00076883484,0.012058738],"category_scores_gemma":[0.003103154,0.00025491283,0.00058899936,0.00058776897,0.002273757,0.0036033408,0.0015726688,0.0014504022,0.0031048036],"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.000016112905,0.000009930906,0.00006456808,0.000021286773,0.000004094539,0.000061678664,0.00017348715,0.0029029495,0.0060938876,0.9783572,0.00067079894,0.011623979],"study_design_scores_gemma":[0.000014045004,0.00003678937,0.00010097928,0.000012446128,0.000012163426,0.00015912775,0.00010865115,0.023709895,0.01230568,0.93493426,0.028584704,0.000021212158],"about_ca_topic_score_codex":0.00096032495,"about_ca_topic_score_gemma":0.0012429185,"teacher_disagreement_score":0.012058738,"about_ca_system_score_codex":0.0012815509,"about_ca_system_score_gemma":0.000718423,"threshold_uncertainty_score":0.040340483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004650289,0.00008677169,0.98861456,0.00017309585,0.000031694555,0.00005999132,0.00017646578,0.0004067493,0.005800521],"genre_scores_gemma":[0.19736782,0.0006153909,0.7894106,0.00018018778,0.00010196146,0.00055168045,0.00064516347,0.0003649739,0.010762096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981029,0.00068374013,0.00015633355,0.00031696778,0.0005727461,0.00016721596],"domain_scores_gemma":[0.99766976,0.0011552294,0.0002108971,0.00041905328,0.00038403826,0.00016101409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026013735,0.00100386,0.00064752257,0.0017838861,0.0010969893,0.002868964,0.001655285,0.0014071875,0.007338146],"category_scores_gemma":[0.0058959075,0.0007642425,0.0026711992,0.0013077665,0.002025637,0.004875938,0.002618285,0.0017791213,0.0010162789],"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.000021994532,0.000031481053,0.00046158303,0.0000543072,0.00002799497,0.00010800091,0.0002624879,0.10665455,0.00090507045,0.8824334,0.000736661,0.008302419],"study_design_scores_gemma":[0.000032254113,0.000022634724,0.00010322763,0.000036580568,0.000040510076,0.00006382484,0.000055460023,0.4150496,0.0011755911,0.5588702,0.024527961,0.000022087146],"about_ca_topic_score_codex":0.008816258,"about_ca_topic_score_gemma":0.009641089,"teacher_disagreement_score":0.008816258,"about_ca_system_score_codex":0.0016294235,"about_ca_system_score_gemma":0.0021305094,"threshold_uncertainty_score":0.02454853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088321835,0.00045772592,0.8877969,0.00058089243,0.00014972864,0.00010797269,0.00023002166,0.0006251943,0.021729829],"genre_scores_gemma":[0.70456916,0.000495104,0.28507155,0.0005951895,0.00019712019,0.00027234384,0.00040899913,0.0002863859,0.008104194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663854,0.0009247052,0.00029112474,0.0008091798,0.00091649324,0.00041997954],"domain_scores_gemma":[0.9961281,0.0015760523,0.00028847126,0.00097477325,0.00078381196,0.00024882867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037494225,0.0007063618,0.0006252692,0.002479816,0.0015519926,0.0022078801,0.0012107828,0.0008548953,0.003831879],"category_scores_gemma":[0.0060608387,0.0005932486,0.0029039944,0.0011861048,0.0044235224,0.011838916,0.0061052972,0.0027097461,0.0005552947],"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.000018997509,0.000014528229,0.00029367866,0.00005577409,0.000014652849,0.00012362996,0.0005564773,0.0020939554,0.001774723,0.9846268,0.00024275616,0.010183973],"study_design_scores_gemma":[0.000010442063,0.000052389078,0.00036545665,0.000042239615,0.000022874352,0.00021244325,0.00023320381,0.011763961,0.002050648,0.9729777,0.012226204,0.000042275482],"about_ca_topic_score_codex":0.0010372048,"about_ca_topic_score_gemma":0.0008494112,"teacher_disagreement_score":0.003831879,"about_ca_system_score_codex":0.0013978973,"about_ca_system_score_gemma":0.0007355749,"threshold_uncertainty_score":0.019829035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07007376,0.00016174909,0.8923865,0.0006426646,0.00044858968,0.001651018,0.00046526841,0.009338814,0.024831656],"genre_scores_gemma":[0.27057257,0.000105252126,0.70702857,0.00017043359,0.000075417694,0.00073475693,0.0008556472,0.00096078357,0.019496545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99518615,0.0015452207,0.0004728905,0.0005493107,0.0020154554,0.00023091723],"domain_scores_gemma":[0.9799121,0.0068280217,0.0009390863,0.0032622297,0.008478964,0.0005795488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065185083,0.0005749585,0.0003477366,0.001540947,0.0005823036,0.0028071965,0.0013584108,0.0009842335,0.025373302],"category_scores_gemma":[0.029066665,0.00040074,0.00050192914,0.00074248057,0.00044637622,0.0009750903,0.000907407,0.00089539256,0.0058789058],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005284574,0.0005123162,0.0049778596,0.00028702972,0.000025775778,0.0004897115,0.000770045,0.018267509,0.044456176,0.016994216,0.021521617,0.89116925],"study_design_scores_gemma":[0.0007013816,0.0036043979,0.029827163,0.00039872227,0.00012739871,0.0022690448,0.0010743624,0.4064998,0.1775405,0.020980233,0.35664,0.00033706328],"about_ca_topic_score_codex":0.0010222625,"about_ca_topic_score_gemma":0.001431126,"teacher_disagreement_score":0.025373302,"about_ca_system_score_codex":0.00088083575,"about_ca_system_score_gemma":0.0014195301,"threshold_uncertainty_score":0.0848822},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2138647,0.004075854,0.59850883,0.002298555,0.00043680874,0.00009110125,0.0010539638,0.0006814876,0.17898875],"genre_scores_gemma":[0.87674135,0.001345646,0.09380933,0.00060663,0.00028937164,0.00010882247,0.00058200525,0.00008453743,0.026432185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990484,0.00017870359,0.0000673858,0.000250026,0.00034237755,0.000113066504],"domain_scores_gemma":[0.99903214,0.00024246062,0.000108362736,0.00020490146,0.0002586835,0.00015350083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078618573,0.000515458,0.00042432462,0.002122748,0.0011204686,0.002183617,0.00062062574,0.0007860007,0.0032627487],"category_scores_gemma":[0.0020442263,0.00022388506,0.0005148864,0.0013449941,0.0036722352,0.00501664,0.002220897,0.001659575,0.00069745193],"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.0000040591585,0.0000030936426,0.00009867886,0.000012273576,0.0000020494272,0.00003213389,0.00015208482,0.00023218314,0.00032192303,0.99486226,0.00039355454,0.0038856242],"study_design_scores_gemma":[0.0000024260416,0.000009975907,0.00024524188,0.000010246292,0.0000029413368,0.0001907652,0.000096127806,0.0017091157,0.0004585938,0.9768251,0.02043751,0.000011884568],"about_ca_topic_score_codex":0.0007764872,"about_ca_topic_score_gemma":0.00065519067,"teacher_disagreement_score":0.0032627487,"about_ca_system_score_codex":0.0010190567,"about_ca_system_score_gemma":0.0005804155,"threshold_uncertainty_score":0.010915041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069563955,0.0009136711,0.8520609,0.0020005833,0.00031841508,0.00010664867,0.00038881728,0.00023271231,0.07441434],"genre_scores_gemma":[0.68924296,0.0014687427,0.27689546,0.0011822148,0.00047659499,0.0004056646,0.00057452766,0.0003223309,0.029431542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987852,0.0003256089,0.00009884488,0.00012307441,0.000510282,0.00015699507],"domain_scores_gemma":[0.9987588,0.0005091442,0.00008219138,0.00028588335,0.00030176181,0.00006220944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023046131,0.00064641546,0.00066025864,0.0011725299,0.0016825092,0.002338214,0.0012121714,0.0012305704,0.004060207],"category_scores_gemma":[0.0033706035,0.00044888433,0.0014558537,0.0008394467,0.0034810698,0.007673365,0.0022428082,0.0028988943,0.00088879734],"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.0000020715904,0.0000025743282,0.000018183959,0.000007713957,0.0000015894665,0.000011483921,0.00005867067,0.00053170824,0.0001434347,0.9980305,0.00019159942,0.0010003863],"study_design_scores_gemma":[0.000005097387,0.0000041371018,0.000020322437,0.0000056985114,0.0000026540022,0.000020124176,0.0000186409,0.004764499,0.00035308895,0.9925364,0.0022635965,0.000005768775],"about_ca_topic_score_codex":0.000651285,"about_ca_topic_score_gemma":0.00075047737,"teacher_disagreement_score":0.004060207,"about_ca_system_score_codex":0.0010998715,"about_ca_system_score_gemma":0.0008965053,"threshold_uncertainty_score":0.013582766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085858,0.0005610952,0.8535584,0.0008965356,0.00013935531,0.00010060722,0.00061518647,0.0007928834,0.05747796],"genre_scores_gemma":[0.8921532,0.00024920746,0.089385696,0.00047768065,0.000160913,0.00014139306,0.00056436966,0.0002594216,0.01660814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987644,0.00021995802,0.00006872233,0.00035079053,0.00040620723,0.00018992406],"domain_scores_gemma":[0.99832875,0.0004361647,0.00017319528,0.00060677266,0.0002965234,0.00015860797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097203767,0.0004344429,0.0005605016,0.0008274481,0.0010434188,0.0022446038,0.0008953392,0.00081682834,0.009976847],"category_scores_gemma":[0.002706282,0.00036414823,0.0011374094,0.0006272269,0.0032569417,0.0052117286,0.003973602,0.0020482957,0.0010085674],"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.000021511003,0.000008427035,0.00023631491,0.000033247255,0.0000068589957,0.00010143926,0.00023234164,0.0026303742,0.0013095575,0.9905562,0.0004988479,0.004364896],"study_design_scores_gemma":[0.000008868166,0.000027902433,0.000403159,0.000014941365,0.000009246619,0.00021129854,0.000090559384,0.034364596,0.0019915618,0.9561149,0.0067477063,0.000015209054],"about_ca_topic_score_codex":0.002881581,"about_ca_topic_score_gemma":0.0014753493,"teacher_disagreement_score":0.009976847,"about_ca_system_score_codex":0.0015171617,"about_ca_system_score_gemma":0.00089960283,"threshold_uncertainty_score":0.03337586},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023749579,0.00020971394,0.9295597,0.00043023756,0.00029241227,0.00010989099,0.00020756245,0.0015449134,0.04389597],"genre_scores_gemma":[0.5104952,0.0007581326,0.44295236,0.0007407139,0.00025823934,0.00051809504,0.000456269,0.0013434346,0.042477585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.0001396178,0.000044390614,0.00013226768,0.00029803542,0.00009933486],"domain_scores_gemma":[0.99950755,0.0001481814,0.000042462696,0.00013394839,0.00012895615,0.00003892997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054919225,0.00039563098,0.00029117457,0.00087874837,0.00068165036,0.0015448432,0.00066687487,0.00068533426,0.009211989],"category_scores_gemma":[0.00176205,0.00024096845,0.00079862494,0.0005121256,0.0017520356,0.002075411,0.0012888231,0.0016525766,0.0021894523],"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.000019253697,0.000014439813,0.00005960125,0.0000283692,0.0000041446615,0.00008744123,0.00019117598,0.0026485343,0.0049785012,0.9783891,0.00082081923,0.012758608],"study_design_scores_gemma":[0.00002616888,0.000051470768,0.00012308938,0.000034317545,0.000015391977,0.00020846874,0.00009520895,0.030765139,0.016824085,0.9079524,0.04387401,0.000030107358],"about_ca_topic_score_codex":0.0010439344,"about_ca_topic_score_gemma":0.00069111754,"teacher_disagreement_score":0.009211989,"about_ca_system_score_codex":0.0008278985,"about_ca_system_score_gemma":0.0007358165,"threshold_uncertainty_score":0.030817151},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3172771,0.0010316113,0.45513624,0.0027797094,0.0011598641,0.0005326155,0.0008216413,0.0010216914,0.2202396],"genre_scores_gemma":[0.8332214,0.00045414286,0.12786202,0.0007018294,0.00035773587,0.00058538816,0.0004939552,0.0002652359,0.036058266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991392,0.00020981465,0.000083626684,0.00013170058,0.0002594878,0.00017606484],"domain_scores_gemma":[0.99951816,0.00013524096,0.000064658416,0.00008210543,0.00011980726,0.000079911726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097591424,0.0004944298,0.0003217413,0.0010747619,0.0012178017,0.0015495186,0.0007172364,0.0008271017,0.011141996],"category_scores_gemma":[0.0011016048,0.00021265082,0.0008063106,0.0005418404,0.002834703,0.0026235639,0.0020198529,0.0015847847,0.0018626356],"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.000009714252,0.000007585255,0.00005614326,0.000011728369,9.487706e-7,0.000047182235,0.00024562207,0.00015878708,0.0011579107,0.9951296,0.00057571736,0.002599032],"study_design_scores_gemma":[0.0000145918475,0.00003073332,0.0000660287,0.000010975132,0.00000316555,0.0001001469,0.00013988557,0.0023940378,0.0028853395,0.979086,0.015254598,0.000014455294],"about_ca_topic_score_codex":0.00073353446,"about_ca_topic_score_gemma":0.00055805105,"teacher_disagreement_score":0.011141996,"about_ca_system_score_codex":0.0010040681,"about_ca_system_score_gemma":0.001036854,"threshold_uncertainty_score":0.037273645},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061237807,0.07318819,0.5463569,0.020166788,0.018175777,0.00041313787,0.0027289866,0.0066739228,0.32617262],"genre_scores_gemma":[0.08158865,0.05038134,0.4561251,0.0073419623,0.008233224,0.0010124234,0.009892001,0.00403484,0.38139042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974732,0.0007010564,0.00030316436,0.0006041775,0.0007512484,0.00016712304],"domain_scores_gemma":[0.9967253,0.001342269,0.00011147558,0.00083818246,0.0007556549,0.00022706666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039820434,0.00149607,0.0016085482,0.0018126855,0.0013641098,0.00919012,0.0025509538,0.0020686,0.077991575],"category_scores_gemma":[0.006393171,0.0007803407,0.0023651347,0.0020520096,0.0024595077,0.006948858,0.0037628016,0.005891655,0.02434958],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027299684,0.00018742678,0.0006690107,0.00077641354,0.00019090592,0.0003166145,0.0004051371,0.0032746047,0.0023821576,0.31494972,0.24142575,0.43514934],"study_design_scores_gemma":[0.000034542696,0.000041547606,0.000345733,0.00040484362,0.000054819415,0.0003346705,0.00011977978,0.008405676,0.0008689513,0.15538768,0.8339743,0.000027443228],"about_ca_topic_score_codex":0.0021606158,"about_ca_topic_score_gemma":0.001878979,"teacher_disagreement_score":0.077991575,"about_ca_system_score_codex":0.0027665813,"about_ca_system_score_gemma":0.0029111388,"threshold_uncertainty_score":0.26090783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021681797,0.00016957436,0.9910581,0.00038075773,0.0001333145,0.00008248159,0.00006661711,0.0005349261,0.005406018],"genre_scores_gemma":[0.15416035,0.0008083183,0.8360066,0.0010808068,0.00042449593,0.0007007103,0.00030854385,0.00038037598,0.0061297817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636924,0.0009092138,0.00035553833,0.000676948,0.0014511608,0.00023786453],"domain_scores_gemma":[0.9960705,0.0019955395,0.00018619232,0.0011719251,0.00048256564,0.00009330357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040913615,0.001382166,0.0010995991,0.0024544413,0.002347803,0.0032777928,0.0033885303,0.0025450967,0.0072870837],"category_scores_gemma":[0.008608683,0.0010307104,0.004763776,0.0017191243,0.0077807247,0.0072835386,0.0043956744,0.0058017396,0.002590091],"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.000013942149,0.000028386217,0.00011021005,0.00012224552,0.000020470134,0.0001196523,0.00022703288,0.0040877485,0.0033018477,0.97619766,0.0013086596,0.014462192],"study_design_scores_gemma":[0.000017783512,0.000035880676,0.00004672525,0.000038054546,0.00001858001,0.00011140982,0.000029020031,0.012416249,0.004031936,0.9733617,0.009862611,0.000030169756],"about_ca_topic_score_codex":0.0013949117,"about_ca_topic_score_gemma":0.0011476617,"teacher_disagreement_score":0.0072870837,"about_ca_system_score_codex":0.0020029119,"about_ca_system_score_gemma":0.0018741115,"threshold_uncertainty_score":0.024377704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5214594,0.00057169056,0.39263391,0.0014428393,0.00025905948,0.00015118741,0.0005259368,0.0005915677,0.08236436],"genre_scores_gemma":[0.9101707,0.00014264256,0.08016321,0.00021101758,0.000119297845,0.00011453674,0.00036783595,0.00018083164,0.008529936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943698,0.0013844165,0.00039759083,0.0012488805,0.0016454493,0.00095393776],"domain_scores_gemma":[0.99423933,0.0018005671,0.00072392815,0.0009504158,0.0011808109,0.0011048745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002778357,0.0004882898,0.0008016022,0.0017266315,0.0024276474,0.007034665,0.0010811847,0.001016643,0.005236648],"category_scores_gemma":[0.006730878,0.0007591658,0.0015021855,0.00089197623,0.0064244187,0.008762075,0.0057172105,0.0034338636,0.00086576364],"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.000103484774,0.000054384578,0.0008294082,0.000031765416,0.0000073528,0.00017349886,0.0007987671,0.00078217546,0.00394222,0.989062,0.0003286488,0.0038862682],"study_design_scores_gemma":[0.000056048586,0.000073070194,0.00039042468,0.000032236498,0.000021894793,0.0004881468,0.00071560836,0.00999654,0.014152612,0.9653513,0.008674243,0.000047879807],"about_ca_topic_score_codex":0.0006311635,"about_ca_topic_score_gemma":0.0005381146,"teacher_disagreement_score":0.007034665,"about_ca_system_score_codex":0.0019848307,"about_ca_system_score_gemma":0.00091709895,"threshold_uncertainty_score":0.017518342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012225611,0.00015510136,0.9271425,0.0002627235,0.0000921318,0.00022908357,0.003579931,0.059977714,0.0073381797],"genre_scores_gemma":[0.03741816,0.00064587063,0.92556596,0.0007441643,0.00009723797,0.0014208218,0.010421835,0.012851059,0.010834932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989466,0.00031246163,0.00020898187,0.00016288739,0.00026735076,0.00010167243],"domain_scores_gemma":[0.9981589,0.00094286184,0.00018005914,0.00029075137,0.0003142477,0.00011319468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018092532,0.0016183963,0.00073449133,0.00092779857,0.0007157916,0.00306757,0.0032226895,0.0014458665,0.019890802],"category_scores_gemma":[0.0033317823,0.0014259646,0.0017252917,0.0009894464,0.0011246263,0.003029099,0.0022858526,0.003416459,0.010333335],"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.0008691216,0.00025034498,0.0009341385,0.003437715,0.00016640937,0.0012278002,0.0016576005,0.060147874,0.022161154,0.38964266,0.24699886,0.2725063],"study_design_scores_gemma":[0.0002203598,0.00012293758,0.00023561993,0.0003312197,0.00006781649,0.0011410794,0.00017060089,0.13943212,0.017891426,0.06312902,0.77711225,0.0001456092],"about_ca_topic_score_codex":0.0033342945,"about_ca_topic_score_gemma":0.003989776,"teacher_disagreement_score":0.019890802,"about_ca_system_score_codex":0.0009528734,"about_ca_system_score_gemma":0.0022884237,"threshold_uncertainty_score":0.06654143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15984277,0.0018927285,0.60128427,0.0030468344,0.0017363965,0.00079606334,0.0012734557,0.0008965168,0.22923101],"genre_scores_gemma":[0.81124437,0.0008473432,0.14653069,0.0012259947,0.00059521175,0.001115455,0.0006352377,0.0004181405,0.037387528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.0002487792,0.00006539976,0.000129463,0.00021822531,0.00019155885],"domain_scores_gemma":[0.9994886,0.00019198898,0.00007298911,0.00006629699,0.00011458677,0.00006539108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013333121,0.000668493,0.0004319509,0.0011516014,0.0015271817,0.0020387648,0.0009717025,0.0012361882,0.016098056],"category_scores_gemma":[0.0016732018,0.0003379227,0.00082750607,0.0008883405,0.0022693174,0.002609177,0.002004737,0.001904914,0.0025787912],"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.000011723568,0.000011830975,0.00004626496,0.000019578629,0.0000014276551,0.00009812205,0.00024739405,0.00027693823,0.0008282089,0.994451,0.0013738722,0.0026335048],"study_design_scores_gemma":[0.000030553972,0.000028836555,0.00006884768,0.000012908724,0.0000026736186,0.00011687876,0.00007894735,0.0026207578,0.0014187279,0.9860199,0.009585428,0.00001565753],"about_ca_topic_score_codex":0.0006373613,"about_ca_topic_score_gemma":0.0005296198,"teacher_disagreement_score":0.016098056,"about_ca_system_score_codex":0.0006823061,"about_ca_system_score_gemma":0.0008255359,"threshold_uncertainty_score":0.053853333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05169961,0.00022003293,0.91655535,0.00087817485,0.00017017167,0.000119381606,0.00070946565,0.0020049163,0.027642993],"genre_scores_gemma":[0.722253,0.00032504633,0.24820226,0.00075936376,0.00021416161,0.00045466574,0.001146792,0.00084173825,0.025802922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979513,0.00036665038,0.00015016351,0.000456774,0.0006704302,0.00040469092],"domain_scores_gemma":[0.99852633,0.00029100184,0.000121575045,0.00036573995,0.0004382898,0.00025713048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016641627,0.0005370426,0.000717867,0.0017305764,0.0017844655,0.003394021,0.002174128,0.0015759562,0.0060407617],"category_scores_gemma":[0.0022452124,0.0005351382,0.0017653989,0.0014601364,0.0045167445,0.0065712305,0.00437221,0.003452042,0.0016019142],"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.000021002943,0.000012270774,0.00011025786,0.0000145695285,0.0000027812587,0.00006468522,0.00019894548,0.0011282611,0.00073441863,0.9959507,0.00022130545,0.001540819],"study_design_scores_gemma":[0.000033028344,0.000059134814,0.00019122771,0.000020698553,0.000017751716,0.00015170076,0.0001610764,0.026018087,0.0019071121,0.9546085,0.016791664,0.000039960258],"about_ca_topic_score_codex":0.0041929577,"about_ca_topic_score_gemma":0.0024478328,"teacher_disagreement_score":0.0060407617,"about_ca_system_score_codex":0.0026455629,"about_ca_system_score_gemma":0.0018012903,"threshold_uncertainty_score":0.0202083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042059973,0.00018889201,0.9496295,0.00007157289,0.00004833645,0.000053188156,0.00006192357,0.001727152,0.0061593927],"genre_scores_gemma":[0.40753552,0.00018748737,0.58901364,0.00009468642,0.000017330298,0.00012192068,0.00017629832,0.00039739534,0.002455643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999729,0.000065312255,0.00002157731,0.000060479986,0.00008376484,0.00003983038],"domain_scores_gemma":[0.99967515,0.000108246095,0.00003396299,0.00011634805,0.00005522167,0.000011145243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026809634,0.00039976035,0.00036207936,0.0004991381,0.0004202454,0.00057097245,0.00065158925,0.00028820857,0.0031194792],"category_scores_gemma":[0.0008635897,0.00022604395,0.00038628117,0.0006138646,0.00055684283,0.0009199029,0.00068486936,0.0005422296,0.00044751505],"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.0002755623,0.0001311069,0.0008140532,0.00044213657,0.000049978542,0.00019281963,0.00023451216,0.23524247,0.10160626,0.28734875,0.003545255,0.37011704],"study_design_scores_gemma":[0.00004832368,0.00023587281,0.00032834712,0.00005558225,0.00004889731,0.0002114689,0.00006325997,0.7370437,0.13640562,0.10237525,0.023142463,0.000041248928],"about_ca_topic_score_codex":0.0009661056,"about_ca_topic_score_gemma":0.0022029947,"teacher_disagreement_score":0.0031194792,"about_ca_system_score_codex":0.00069291407,"about_ca_system_score_gemma":0.0008184115,"threshold_uncertainty_score":0.010435641},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024527943,0.0004272921,0.95131975,0.00044254417,0.00011966636,0.00008542126,0.000120439174,0.0012626859,0.021694234],"genre_scores_gemma":[0.59379536,0.00055175915,0.39695683,0.00031888435,0.00006279304,0.00018349181,0.0003093728,0.0003342689,0.0074871476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993325,0.00016223657,0.000046949208,0.00013711523,0.0002296662,0.00009147294],"domain_scores_gemma":[0.9993235,0.00035855963,0.00003978845,0.0001722237,0.00008129788,0.000024744138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051025767,0.0006307473,0.00046135427,0.0005803696,0.00071033114,0.0012878942,0.0009901267,0.0006649994,0.004842132],"category_scores_gemma":[0.0026736697,0.0002617974,0.0006613132,0.0007115853,0.0017191775,0.00211203,0.0012445688,0.0013192288,0.0006513405],"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.0000753454,0.000039508053,0.00013994178,0.0001554598,0.000015506408,0.00012844976,0.00013641572,0.047543507,0.011580926,0.85712194,0.0014575426,0.08160543],"study_design_scores_gemma":[0.000027642121,0.00004643829,0.00006222509,0.000055470802,0.000017225664,0.000083565086,0.000044313838,0.21922335,0.025743796,0.73896044,0.01571877,0.00001669255],"about_ca_topic_score_codex":0.0007247643,"about_ca_topic_score_gemma":0.001157078,"teacher_disagreement_score":0.004842132,"about_ca_system_score_codex":0.0009158458,"about_ca_system_score_gemma":0.0009720123,"threshold_uncertainty_score":0.016198575},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024710894,0.044637576,0.7179848,0.01673068,0.026762111,0.00053620245,0.0024007529,0.0053654723,0.18311137],"genre_scores_gemma":[0.052689154,0.035886623,0.4998173,0.0057943277,0.008783291,0.0013552652,0.011115265,0.0047946596,0.37976414],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99319553,0.002477279,0.0007453207,0.00092573423,0.002300207,0.00035584674],"domain_scores_gemma":[0.9942591,0.0026269848,0.0001743831,0.0013267979,0.0012573053,0.00035548018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008981409,0.00173595,0.0014756916,0.0020890892,0.0011567137,0.0076136473,0.003215529,0.0025851782,0.08034943],"category_scores_gemma":[0.010760898,0.00083368976,0.0027470838,0.0013910335,0.0024032553,0.0057853484,0.003953493,0.005935642,0.024330337],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015455714,0.0001486156,0.00039290293,0.0011201209,0.00014352953,0.0002680601,0.0010937206,0.0035128617,0.0026084022,0.33390644,0.30910152,0.34754926],"study_design_scores_gemma":[0.000020796702,0.000040493902,0.00017208113,0.00042129794,0.00002433877,0.00025186065,0.00008418433,0.0024324781,0.0007188691,0.06837271,0.9274419,0.000019195799],"about_ca_topic_score_codex":0.0023764025,"about_ca_topic_score_gemma":0.0019575283,"teacher_disagreement_score":0.08034943,"about_ca_system_score_codex":0.0027669643,"about_ca_system_score_gemma":0.0033766748,"threshold_uncertainty_score":0.2687956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020216782,0.00035194273,0.96550214,0.00037302254,0.000060218455,0.00009275212,0.000073235526,0.0051146755,0.008215227],"genre_scores_gemma":[0.4416082,0.00037052197,0.55154264,0.00049184007,0.00008293258,0.00015685665,0.0002154911,0.000785839,0.004745697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99035126,0.0039971313,0.0004784565,0.0011179809,0.0030771128,0.0009780448],"domain_scores_gemma":[0.9850734,0.009813821,0.00059978897,0.0023969235,0.0015933657,0.0005227024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009806256,0.00061865855,0.00086348277,0.0018242993,0.0017664328,0.0038644832,0.0027758307,0.00089503254,0.004473614],"category_scores_gemma":[0.019843012,0.0015658134,0.0020967526,0.00093521696,0.00501162,0.0069914595,0.007506093,0.0033379886,0.00136161],"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.00028699875,0.00013262813,0.0011905017,0.0005102458,0.00008862634,0.0006654707,0.005595415,0.014482914,0.018245857,0.8602914,0.0032944556,0.095215395],"study_design_scores_gemma":[0.00021949044,0.00023011418,0.000981089,0.0002766171,0.00017123937,0.00079519907,0.000589369,0.14048463,0.047976565,0.7336174,0.07446382,0.00019442009],"about_ca_topic_score_codex":0.006437236,"about_ca_topic_score_gemma":0.008977514,"teacher_disagreement_score":0.009806256,"about_ca_system_score_codex":0.002061984,"about_ca_system_score_gemma":0.0031212694,"threshold_uncertainty_score":0.051861107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049078693,0.00023855825,0.97812676,0.00045229407,0.00019762828,0.0002099587,0.00036804646,0.004290643,0.011208226],"genre_scores_gemma":[0.13114499,0.0005117603,0.8541294,0.0007133744,0.00019631251,0.0004003227,0.0005831467,0.0016009053,0.010719773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99053156,0.0023087817,0.0009733457,0.0016568563,0.0036061099,0.00092337147],"domain_scores_gemma":[0.9806583,0.0056870407,0.0008685498,0.008343415,0.0038384693,0.00060428004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010427186,0.0010490463,0.001328593,0.0027176426,0.002068272,0.0050478945,0.0050740587,0.001723293,0.017138554],"category_scores_gemma":[0.02371646,0.0019484181,0.0026779084,0.0025866306,0.0042401976,0.012415012,0.008773363,0.003964761,0.004716115],"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.00010780186,0.000038782146,0.0007026361,0.00018943829,0.000027063172,0.00013012603,0.0004557215,0.003699302,0.0019351075,0.9504034,0.0035125639,0.038797967],"study_design_scores_gemma":[0.00015084611,0.00013765038,0.00043176798,0.00031768542,0.00018977735,0.0005567222,0.000275526,0.048300184,0.017839396,0.658807,0.27283296,0.00016049447],"about_ca_topic_score_codex":0.0046402114,"about_ca_topic_score_gemma":0.006293035,"teacher_disagreement_score":0.017138554,"about_ca_system_score_codex":0.0018510963,"about_ca_system_score_gemma":0.003750361,"threshold_uncertainty_score":0.057334125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012327838,0.0074534854,0.83419865,0.008625202,0.0003902127,0.00011398108,0.00025849696,0.00041275405,0.13621949],"genre_scores_gemma":[0.7180332,0.0072665922,0.23601636,0.0025845987,0.0013977438,0.0006417048,0.0004936433,0.0003628984,0.03320322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555814,0.0019939053,0.00023780465,0.00082301645,0.0010246562,0.0003623644],"domain_scores_gemma":[0.9960989,0.002300709,0.0002466059,0.0006422137,0.00048685132,0.00022470283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005747254,0.0009731789,0.0010486955,0.003514518,0.0022348897,0.0071840035,0.0019686148,0.002920899,0.0065830015],"category_scores_gemma":[0.0045092017,0.00056415424,0.0022373868,0.0023313363,0.018618038,0.014853004,0.003734036,0.0053492147,0.0013720896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.93948e-7,0.0000012927339,0.000013015088,0.000009338706,0.0000015457149,0.0000063263615,0.000059572554,0.00016404367,0.000025578673,0.9992125,0.00008115624,0.0004245569],"study_design_scores_gemma":[0.0000035829903,0.000004513839,0.000017657603,0.0000134026395,0.0000026087178,0.0000148521585,0.000028126768,0.0014768663,0.000073923395,0.99218917,0.0061719385,0.000003378882],"about_ca_topic_score_codex":0.002819404,"about_ca_topic_score_gemma":0.00120645,"teacher_disagreement_score":0.0071840035,"about_ca_system_score_codex":0.005536275,"about_ca_system_score_gemma":0.0023326378,"threshold_uncertainty_score":0.040168643},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020172,0.00017628072,0.9726332,0.000618577,0.00007071684,0.000058917718,0.00019435497,0.00033024815,0.0057457197],"genre_scores_gemma":[0.6093618,0.0006344719,0.38226962,0.0005424127,0.000416832,0.00037165632,0.0007686085,0.0007171885,0.004917347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99348116,0.002125903,0.0007388312,0.0013953331,0.0016058241,0.0006530128],"domain_scores_gemma":[0.98102313,0.007852616,0.0017461885,0.005953083,0.0027217355,0.0007032889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01101409,0.00090541027,0.0013928621,0.0021789,0.0017642095,0.0071844114,0.002527773,0.002835841,0.005762929],"category_scores_gemma":[0.016317802,0.0010169385,0.002867899,0.002401988,0.009785285,0.023622757,0.0062666824,0.0070108064,0.0011923488],"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.000014730867,0.000009465927,0.00019503498,0.000039496434,0.000009319544,0.00005197073,0.00041867341,0.0019423655,0.0010378124,0.9929508,0.00018564369,0.003144645],"study_design_scores_gemma":[0.0000061700125,0.000021211697,0.000083162864,0.000022069678,0.000014438204,0.0000957395,0.00015562672,0.010481249,0.002055471,0.98356366,0.003486671,0.000014528163],"about_ca_topic_score_codex":0.00063806365,"about_ca_topic_score_gemma":0.0005160086,"teacher_disagreement_score":0.01101409,"about_ca_system_score_codex":0.0017623033,"about_ca_system_score_gemma":0.0018523592,"threshold_uncertainty_score":0.05824876},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019391883,0.010468087,0.07979924,0.040179502,0.035556007,0.004209432,0.1840944,0.028199561,0.59810185],"genre_scores_gemma":[0.04591146,0.003264993,0.072065875,0.0068956525,0.0051391646,0.0023836887,0.46947938,0.023218172,0.3716416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98165315,0.0030360147,0.0006436594,0.001523778,0.010452422,0.0026910352],"domain_scores_gemma":[0.9671011,0.0037534193,0.0005331127,0.0024606183,0.018229486,0.007922264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024616716,0.0034157906,0.0019379329,0.0038786726,0.0035786768,0.011526851,0.006229092,0.00530194,0.1605502],"category_scores_gemma":[0.027251154,0.0014025364,0.0026295634,0.0054685352,0.0011934674,0.0055693784,0.005462623,0.005760105,0.12698969],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002757692,0.0001333903,0.00013170118,0.00017459823,0.000025132396,0.00004398326,0.000027793969,0.0010056455,0.000577106,0.0048726746,0.97655255,0.016179653],"study_design_scores_gemma":[0.0006209502,0.00028911227,0.0008738373,0.00016377488,0.000032122818,0.00013493781,0.00008330404,0.007134559,0.0027832903,0.0058958344,0.98191375,0.0000745518],"about_ca_topic_score_codex":0.035067566,"about_ca_topic_score_gemma":0.036316797,"teacher_disagreement_score":0.1605502,"about_ca_system_score_codex":0.005708329,"about_ca_system_score_gemma":0.016364357,"threshold_uncertainty_score":0.53709394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019164158,0.00011070841,0.9626297,0.001230121,0.00027610653,0.00017820674,0.00022626358,0.006413969,0.009770771],"genre_scores_gemma":[0.5228057,0.0002983977,0.45277604,0.0018906876,0.00043013142,0.00052935,0.0008072413,0.0045100953,0.015952254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9724452,0.009424797,0.0027838892,0.004951629,0.0064893872,0.003905051],"domain_scores_gemma":[0.91531885,0.043615453,0.0017897877,0.03084767,0.006866462,0.0015617423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015736911,0.0013589335,0.0018634949,0.0017238016,0.003112072,0.006542044,0.0074537043,0.0039044134,0.015118042],"category_scores_gemma":[0.058591515,0.0038667086,0.0039933533,0.0020464708,0.009664278,0.025230473,0.02142752,0.012501873,0.0045751543],"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.00049918366,0.00032349632,0.0024891475,0.00046203105,0.000119832184,0.00040229928,0.0019174952,0.017031414,0.009184704,0.8824236,0.0073121046,0.07783475],"study_design_scores_gemma":[0.00011906412,0.000095398835,0.0002998915,0.00013796159,0.00017340852,0.00021264638,0.00045907355,0.07956364,0.022592913,0.8820159,0.014207588,0.00012257925],"about_ca_topic_score_codex":0.0042591994,"about_ca_topic_score_gemma":0.005323245,"teacher_disagreement_score":0.015736911,"about_ca_system_score_codex":0.0023308408,"about_ca_system_score_gemma":0.0076760785,"threshold_uncertainty_score":0.08322573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756796,0.0009680817,0.60304964,0.0008101715,0.000511018,0.00014748551,0.0004305801,0.0012717332,0.11713166],"genre_scores_gemma":[0.897659,0.00028977112,0.09438914,0.00023003855,0.000052652507,0.000103214814,0.00018893353,0.00006426477,0.007022983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997222,0.00003543333,0.000019424959,0.000059739523,0.00009587661,0.00006735554],"domain_scores_gemma":[0.9998301,0.000049636838,0.000025482133,0.000045353616,0.000033542114,0.000015851683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001933689,0.0002758708,0.00026897297,0.00031078822,0.00035930084,0.0007697725,0.0005543874,0.00046649552,0.0044696275],"category_scores_gemma":[0.0007459799,0.00016790887,0.00028206178,0.0003256419,0.00049191713,0.00082367915,0.00060849276,0.00047580624,0.0005103328],"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.00012711644,0.00006669625,0.00026361676,0.00021467752,0.000018878573,0.00023440972,0.00018081711,0.032796074,0.047491677,0.8348785,0.0030764525,0.08065107],"study_design_scores_gemma":[0.0001044065,0.0002803542,0.00046775548,0.00012750519,0.00003689786,0.00043406352,0.00009660894,0.41002813,0.14707032,0.40058866,0.04071018,0.000055105415],"about_ca_topic_score_codex":0.00047980895,"about_ca_topic_score_gemma":0.0010776807,"teacher_disagreement_score":0.0044696275,"about_ca_system_score_codex":0.0007289887,"about_ca_system_score_gemma":0.00048638126,"threshold_uncertainty_score":0.014952421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8091151,0.0002045569,0.17741874,0.00019304398,0.00007681132,0.000031930682,0.0007093816,0.0011703703,0.011080087],"genre_scores_gemma":[0.9612475,0.000103405095,0.035834134,0.000043741817,0.00003464281,0.000022957125,0.0009477621,0.00020279802,0.001563159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978966,0.00003211843,0.000017825068,0.00007270835,0.00004718457,0.000040427596],"domain_scores_gemma":[0.9986564,0.0007305541,0.0000970815,0.00030431553,0.00012960636,0.000082048646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003180053,0.0003734715,0.00058244297,0.0008286198,0.00038007615,0.0013960234,0.0005168247,0.00044093523,0.0060427748],"category_scores_gemma":[0.0026326554,0.00025944057,0.0004521402,0.0010069396,0.0008015243,0.002589794,0.00090324547,0.000600391,0.00061773474],"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.0011578611,0.00021357983,0.019284891,0.00048090486,0.00010282792,0.0004882966,0.0005839805,0.33384746,0.06191923,0.31257915,0.010629691,0.25871208],"study_design_scores_gemma":[0.000043382057,0.00015452977,0.0017327846,0.000023540639,0.000021041147,0.000083099585,0.00015360325,0.66755223,0.015193677,0.3124414,0.0025845708,0.000016140286],"about_ca_topic_score_codex":0.0007089853,"about_ca_topic_score_gemma":0.0012716013,"teacher_disagreement_score":0.0060427748,"about_ca_system_score_codex":0.00050271174,"about_ca_system_score_gemma":0.0002026039,"threshold_uncertainty_score":0.020215094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09809335,0.00044433176,0.89335597,0.00023987191,0.000058561443,0.00005470268,0.00050925283,0.0021687564,0.0050751786],"genre_scores_gemma":[0.7352693,0.0003854356,0.25934103,0.000180627,0.000043347838,0.00015159418,0.0009063518,0.0008282924,0.0028939752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995484,0.00017789278,0.000019123961,0.00010201542,0.000109807894,0.000042730477],"domain_scores_gemma":[0.99857605,0.00079557206,0.0001065016,0.00022742993,0.00018454109,0.000109941335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717954,0.0005012942,0.00050168857,0.0010043426,0.00045556793,0.0015645057,0.000617705,0.0007537201,0.003422561],"category_scores_gemma":[0.005117219,0.0003403114,0.00046904848,0.0007129666,0.00069687323,0.0010435466,0.0013896398,0.0007653397,0.0007738785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000900875,0.0001512601,0.012067412,0.0005210704,0.000093891955,0.0011767888,0.002786987,0.41308668,0.07360816,0.3270702,0.011150738,0.1573859],"study_design_scores_gemma":[0.000038040922,0.00004812057,0.0015776895,0.000047851583,0.000007051373,0.00029883918,0.00012978364,0.9198863,0.0062884665,0.06420808,0.00743993,0.00002977248],"about_ca_topic_score_codex":0.001503066,"about_ca_topic_score_gemma":0.0022041048,"teacher_disagreement_score":0.003422561,"about_ca_system_score_codex":0.0004076648,"about_ca_system_score_gemma":0.0004175209,"threshold_uncertainty_score":0.011449575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62759286,0.00055552105,0.23912488,0.0010788887,0.00028172793,0.000069859154,0.00027103335,0.00092691137,0.13009822],"genre_scores_gemma":[0.9717444,0.0002757423,0.010557685,0.00008365638,0.00011527187,0.000021690881,0.000079894024,0.00010833707,0.017013283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995459,0.000062209976,0.000017424416,0.00006508487,0.00015177531,0.00015762747],"domain_scores_gemma":[0.99935776,0.000119837154,0.00012314426,0.00012825239,0.00015493475,0.00011593435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042092317,0.00040409915,0.00040701884,0.0013814983,0.0012601069,0.0019806705,0.0007109295,0.00045355156,0.0076410747],"category_scores_gemma":[0.0022701912,0.00017916475,0.00044690244,0.0013337922,0.0025719455,0.0035626732,0.0021248094,0.0016676307,0.0017656569],"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.000023327048,0.000013602369,0.00039208724,0.000028115259,0.0000022538404,0.00017962791,0.0003059837,0.0009955227,0.0022475356,0.98850656,0.00046272538,0.006842771],"study_design_scores_gemma":[0.000011707234,0.00005489256,0.00068116636,0.000029294573,0.000009573728,0.00057364936,0.0003795773,0.011943322,0.00799483,0.9719623,0.006328455,0.000031173386],"about_ca_topic_score_codex":0.0009682564,"about_ca_topic_score_gemma":0.00089022034,"teacher_disagreement_score":0.0076410747,"about_ca_system_score_codex":0.000806185,"about_ca_system_score_gemma":0.0005863844,"threshold_uncertainty_score":0.025561929},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70060605,0.001618236,0.20025466,0.0005069392,0.00021791167,0.00019100118,0.00041993763,0.0006685611,0.0955167],"genre_scores_gemma":[0.9479982,0.0003605726,0.03764685,0.00010530353,0.00011869134,0.00010939939,0.00035988263,0.0001318122,0.013169296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988187,0.00017508626,0.00013361512,0.00027307076,0.0004419734,0.00015759934],"domain_scores_gemma":[0.9984694,0.0005007994,0.00015661158,0.00019833805,0.00044076334,0.00023403385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094847573,0.00037872704,0.0005300981,0.0010929758,0.0009902153,0.001914858,0.0004324031,0.00027919683,0.00644641],"category_scores_gemma":[0.0029544863,0.00030479077,0.0006441876,0.0004611955,0.0023999105,0.0038998576,0.001695293,0.0008700254,0.00091626705],"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.00020189722,0.00003478218,0.0013599909,0.00010625385,0.000015087198,0.0005212035,0.0012673227,0.00082807546,0.012657875,0.96312493,0.0007256792,0.019156914],"study_design_scores_gemma":[0.00010704572,0.00023930102,0.001996392,0.000047688984,0.000050425937,0.0012041472,0.00089727924,0.010146771,0.02337107,0.9189542,0.042931244,0.000054509448],"about_ca_topic_score_codex":0.00070231827,"about_ca_topic_score_gemma":0.0006261166,"teacher_disagreement_score":0.00644641,"about_ca_system_score_codex":0.00085722614,"about_ca_system_score_gemma":0.00039335148,"threshold_uncertainty_score":0.021565437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7462431,0.00086183404,0.22630669,0.00033622351,0.00017800978,0.000075674725,0.00033676103,0.00017777397,0.025483811],"genre_scores_gemma":[0.9455138,0.0007086461,0.045134492,0.00018557862,0.00030805034,0.00015078575,0.0004311375,0.00013291309,0.007434456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982317,0.00038949808,0.00015544475,0.00033336668,0.00061398617,0.0002760446],"domain_scores_gemma":[0.9960139,0.0018575016,0.0006660246,0.00042319056,0.00062548585,0.00041399177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012920346,0.00052017655,0.0006937509,0.002677403,0.0007227444,0.0020044337,0.0007193767,0.00044456765,0.0036814478],"category_scores_gemma":[0.007312487,0.00030100066,0.0005488914,0.0020091448,0.0021567086,0.004171884,0.002050523,0.0008370023,0.00036488092],"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.00012429176,0.000053205767,0.0017826204,0.00008158252,0.000019889241,0.00021406946,0.00028802155,0.0038273192,0.0065009557,0.9627617,0.00056470453,0.02378169],"study_design_scores_gemma":[0.00001972348,0.0000838062,0.0013167245,0.000038920163,0.000021472593,0.00040753905,0.00017206857,0.046469342,0.0023461166,0.94513136,0.003957974,0.00003495825],"about_ca_topic_score_codex":0.0005600917,"about_ca_topic_score_gemma":0.0005271057,"teacher_disagreement_score":0.0036814478,"about_ca_system_score_codex":0.0005508059,"about_ca_system_score_gemma":0.00051236484,"threshold_uncertainty_score":0.0123156905},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35457507,0.025589405,0.1954491,0.003915698,0.006937326,0.00013809867,0.0020051622,0.003496146,0.40789402],"genre_scores_gemma":[0.89268297,0.0054830504,0.042713262,0.0010656976,0.0012691012,0.000083849234,0.0016458653,0.0009928227,0.05406328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995116,0.000047607842,0.000029457664,0.00014047195,0.00017533041,0.000095636075],"domain_scores_gemma":[0.99886864,0.0002242378,0.000075887794,0.0005853485,0.00017197056,0.000073979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003617554,0.00039820376,0.00061732536,0.00076215697,0.0006938176,0.0021483717,0.00063932454,0.0009466575,0.025815072],"category_scores_gemma":[0.0019797676,0.0003089171,0.00031999,0.001044474,0.0014983396,0.0027034006,0.0016793453,0.0014735886,0.0041575725],"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.0009293951,0.000113736154,0.0019466482,0.0015231915,0.00005654174,0.00065450754,0.001334606,0.014933486,0.12904331,0.4138668,0.038809158,0.3967888],"study_design_scores_gemma":[0.00008580258,0.00037981643,0.0031454754,0.0002895536,0.00004823492,0.0008527601,0.0010647507,0.03298729,0.10782392,0.3875351,0.4656779,0.00010931355],"about_ca_topic_score_codex":0.00073048007,"about_ca_topic_score_gemma":0.00071267283,"teacher_disagreement_score":0.025815072,"about_ca_system_score_codex":0.00043681278,"about_ca_system_score_gemma":0.00033914024,"threshold_uncertainty_score":0.08636004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16024809,0.00017239047,0.8254555,0.00017328616,0.00013321226,0.00013581348,0.0004020192,0.0014032092,0.011876546],"genre_scores_gemma":[0.35156584,0.00017051541,0.6385956,0.00010744984,0.00004383017,0.00028295984,0.00087023125,0.0004625379,0.007901132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928194,0.000122032856,0.000068899004,0.000256036,0.0001910298,0.000080047736],"domain_scores_gemma":[0.99808794,0.0011602665,0.00020488474,0.00022968512,0.00022387927,0.00009329251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040870416,0.00037800297,0.00037150158,0.0005747585,0.00065832905,0.00082607736,0.0008058755,0.00053583394,0.0068005137],"category_scores_gemma":[0.002804376,0.00031329252,0.0004766404,0.0006297343,0.0006442364,0.001684451,0.0010152101,0.00061801914,0.0013052579],"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.0007422888,0.000274576,0.008446647,0.0008831709,0.00007498409,0.00088012463,0.0010083724,0.100810945,0.17170335,0.3982239,0.009023792,0.30792788],"study_design_scores_gemma":[0.00012788035,0.00032238735,0.0041367123,0.00012345488,0.00004515596,0.00082156574,0.0004737906,0.5971353,0.113448724,0.25051355,0.032735277,0.00011622603],"about_ca_topic_score_codex":0.0009480141,"about_ca_topic_score_gemma":0.001771092,"teacher_disagreement_score":0.0068005137,"about_ca_system_score_codex":0.00029767992,"about_ca_system_score_gemma":0.00035432098,"threshold_uncertainty_score":0.02274996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046111684,0.00011389933,0.93773824,0.00074918766,0.00015745217,0.00022854404,0.00068453414,0.003858316,0.010358109],"genre_scores_gemma":[0.25516754,0.00012020146,0.7369862,0.00051614235,0.000072731294,0.0003030557,0.0019396038,0.00048988836,0.0044045784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666995,0.0007310986,0.0002884152,0.0008468534,0.0009937537,0.00047002744],"domain_scores_gemma":[0.9936085,0.0043745,0.00042753862,0.0007630784,0.0006906091,0.00013567889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015456141,0.0016932446,0.001278448,0.0015678753,0.0010757148,0.0030710483,0.0027687068,0.0019940208,0.011462392],"category_scores_gemma":[0.011831805,0.00095009065,0.0027472472,0.0015251392,0.0026224146,0.005498385,0.0038980744,0.0026822635,0.0025007366],"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.0010578637,0.00073001394,0.016770225,0.0011821935,0.0003657373,0.00199351,0.000732454,0.25855014,0.052175947,0.33824694,0.024025382,0.30416954],"study_design_scores_gemma":[0.0001103495,0.0001603305,0.0005829638,0.000095065916,0.000076314354,0.00031333495,0.0003782281,0.6987443,0.029826287,0.26279208,0.0068708435,0.000049967482],"about_ca_topic_score_codex":0.003540161,"about_ca_topic_score_gemma":0.0055190823,"teacher_disagreement_score":0.011462392,"about_ca_system_score_codex":0.0013138996,"about_ca_system_score_gemma":0.0019696709,"threshold_uncertainty_score":0.038345516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5755056,0.00053386996,0.3565961,0.00062786037,0.00034184507,0.00014199033,0.000717285,0.00040675869,0.06512868],"genre_scores_gemma":[0.9637823,0.00028614505,0.026331445,0.00016690342,0.00023726554,0.00009495117,0.00034416627,0.00011911499,0.008637825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866354,0.0001937923,0.00011166594,0.00033991356,0.0004046018,0.00028642613],"domain_scores_gemma":[0.9972173,0.0008685776,0.00041207904,0.00053992396,0.00063916453,0.00032299824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095569505,0.0003084739,0.000538199,0.0008832297,0.001369096,0.0019034052,0.0006579179,0.00052672,0.004847907],"category_scores_gemma":[0.005243573,0.000247091,0.0006576587,0.000978991,0.0023751345,0.0033872796,0.0011779385,0.0011434349,0.0009985898],"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.000057612284,0.00001980462,0.0006997774,0.00002506532,0.0000049599075,0.00013593039,0.0003010325,0.00085449143,0.005082056,0.98387825,0.0005590946,0.008381954],"study_design_scores_gemma":[0.000022369653,0.00009805267,0.000759907,0.000019588906,0.000011973978,0.0005634411,0.00025766878,0.009529661,0.007264338,0.97326475,0.008164478,0.000043817625],"about_ca_topic_score_codex":0.001022789,"about_ca_topic_score_gemma":0.0005411808,"teacher_disagreement_score":0.004847907,"about_ca_system_score_codex":0.0009234683,"about_ca_system_score_gemma":0.000928257,"threshold_uncertainty_score":0.016217887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8130543,0.0013346899,0.15322024,0.00023918788,0.00011070123,0.00005164913,0.00031390844,0.00035813535,0.031317215],"genre_scores_gemma":[0.95927036,0.00025713467,0.03313474,0.00010771159,0.00007975886,0.000052476014,0.00027737344,0.00004523672,0.006775247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993724,0.00011738202,0.00006287353,0.00020069489,0.00013824705,0.00010839365],"domain_scores_gemma":[0.99777395,0.0007741512,0.00063112745,0.00030877342,0.00034827384,0.0001637319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041092825,0.00033390912,0.0003202241,0.00126723,0.0011231535,0.0012430275,0.00057947,0.00080349116,0.0028928805],"category_scores_gemma":[0.0021256143,0.00028233862,0.0004865069,0.0011219521,0.0019269318,0.0021346463,0.0008102703,0.00063874654,0.0005118716],"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.00028815566,0.000047031688,0.0047009895,0.00021610985,0.000034248635,0.0018065792,0.0025672396,0.005746808,0.04663083,0.9083026,0.0008476364,0.028811816],"study_design_scores_gemma":[0.00003412739,0.00027581924,0.0052372133,0.00008823013,0.00005360203,0.0032286805,0.0012602751,0.030331047,0.02221821,0.9158382,0.02131794,0.00011666254],"about_ca_topic_score_codex":0.00081379456,"about_ca_topic_score_gemma":0.00078558805,"teacher_disagreement_score":0.0028928805,"about_ca_system_score_codex":0.0006344435,"about_ca_system_score_gemma":0.00039541215,"threshold_uncertainty_score":0.009677649},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014438154,0.07106354,0.23038624,0.076237895,0.12066706,0.00059696456,0.003851502,0.003383936,0.47937477],"genre_scores_gemma":[0.056984596,0.037451286,0.0819234,0.0065346574,0.016993651,0.00054930773,0.0063180276,0.003799914,0.78944516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99515873,0.0015850118,0.00037531572,0.0007515581,0.0016935491,0.00043579302],"domain_scores_gemma":[0.99421173,0.0018665865,0.00015558352,0.0006649264,0.0021900164,0.0009110599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072782827,0.0009947347,0.0008104163,0.0021445663,0.0012616118,0.0067488016,0.0018190484,0.0020675883,0.09375617],"category_scores_gemma":[0.0117167225,0.00050109404,0.0011918707,0.0019446589,0.0015586421,0.0056194207,0.0031134984,0.0054289564,0.027864823],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018332998,0.00014139741,0.00055281323,0.00051488,0.000035407487,0.00013805715,0.0011029994,0.0007070106,0.002285605,0.040841527,0.586267,0.3672301],"study_design_scores_gemma":[0.000008362943,0.00005060363,0.00036403158,0.00024904273,0.00000790566,0.00014190095,0.00019203189,0.00041659386,0.0006904593,0.00647551,0.9913902,0.000013255357],"about_ca_topic_score_codex":0.0025403497,"about_ca_topic_score_gemma":0.0036523305,"teacher_disagreement_score":0.09375617,"about_ca_system_score_codex":0.0027599311,"about_ca_system_score_gemma":0.0033926151,"threshold_uncertainty_score":0.31364566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013608459,0.00038771934,0.9663893,0.0010201959,0.00026159378,0.00012391381,0.00052234024,0.00025258702,0.017433941],"genre_scores_gemma":[0.34424773,0.0012821013,0.6277926,0.0019771527,0.00061262894,0.000883874,0.0013576396,0.0004918503,0.02135434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969531,0.00052789104,0.0003272186,0.00037815553,0.0013415487,0.00047204748],"domain_scores_gemma":[0.99721223,0.0012707344,0.00013886493,0.00044575654,0.0008374323,0.000094912204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029768746,0.0010411162,0.0013312002,0.001959995,0.0019233586,0.0037872868,0.002244496,0.0021700386,0.0056307646],"category_scores_gemma":[0.0043595145,0.0011311544,0.004070588,0.0012106294,0.004635961,0.006501475,0.0029720059,0.0059619336,0.0019319969],"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.000007726609,0.0000144694695,0.00005487722,0.000042140717,0.00000729555,0.000047991507,0.0001662716,0.0056587546,0.000721411,0.9882471,0.0009617424,0.0040702587],"study_design_scores_gemma":[0.000018428598,0.000017861032,0.000038142032,0.000028158629,0.0000127264875,0.000047381734,0.000029948531,0.035133794,0.0017391149,0.9568537,0.006052292,0.000028508195],"about_ca_topic_score_codex":0.0021322577,"about_ca_topic_score_gemma":0.00239249,"teacher_disagreement_score":0.0056307646,"about_ca_system_score_codex":0.002992735,"about_ca_system_score_gemma":0.0023564994,"threshold_uncertainty_score":0.021713912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052264575,0.00011854502,0.98138213,0.00051013957,0.00003640805,0.00031177816,0.000072705945,0.000049305916,0.012292577],"genre_scores_gemma":[0.5119987,0.0005509057,0.47579205,0.00047692854,0.00012044247,0.0014833707,0.00015779874,0.00006594826,0.009353851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99236476,0.0046999487,0.00028624575,0.00084837293,0.0013659023,0.00043478343],"domain_scores_gemma":[0.9939622,0.004691143,0.00040589517,0.00020717962,0.00046790187,0.00026560613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007410856,0.0025141323,0.0015807947,0.0024571691,0.001368207,0.0036365185,0.0031529374,0.0025814653,0.007229936],"category_scores_gemma":[0.011399667,0.0010879672,0.0018502313,0.0014699936,0.004555597,0.004122672,0.0023776102,0.003582445,0.00056576263],"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.00007007539,0.0001292801,0.0003623757,0.00016137665,0.000101646285,0.00020208658,0.0002474836,0.480207,0.0011695287,0.5034382,0.0010695473,0.0128414],"study_design_scores_gemma":[0.00006554219,0.000116818635,0.00010764002,0.000038054583,0.000038071426,0.00008226448,0.000075905155,0.75857264,0.00038597736,0.23806608,0.0024118181,0.000039152113],"about_ca_topic_score_codex":0.0046657627,"about_ca_topic_score_gemma":0.0046209698,"teacher_disagreement_score":0.007410856,"about_ca_system_score_codex":0.0047773644,"about_ca_system_score_gemma":0.0042936313,"threshold_uncertainty_score":0.039192796},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006462547,0.034609944,0.5232682,0.03395299,0.037695862,0.00060993293,0.0051934365,0.00473611,0.35347098],"genre_scores_gemma":[0.053593975,0.024577923,0.21514522,0.0042601977,0.013927734,0.0008686527,0.01485355,0.0050926614,0.6676801],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99481446,0.0013716547,0.0004138712,0.0006833214,0.002388683,0.00032796437],"domain_scores_gemma":[0.9946905,0.0021059914,0.00011825268,0.0010055448,0.0016322101,0.0004475263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066388953,0.001177035,0.0018037587,0.0016262432,0.0012605331,0.00789582,0.0018996105,0.0014138166,0.066336915],"category_scores_gemma":[0.007136678,0.0008793913,0.0018019831,0.0024194643,0.0022841818,0.0074772225,0.0040035415,0.005965976,0.019142488],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034392337,0.00021217146,0.00044317177,0.00056333595,0.00009798969,0.00019174346,0.000581968,0.0027689785,0.0035633056,0.20989333,0.5824687,0.19887151],"study_design_scores_gemma":[0.00004550538,0.00004689846,0.00033633836,0.00018927605,0.000035190908,0.00018834262,0.00012697217,0.0038332168,0.0015340523,0.07907269,0.91455865,0.000032863118],"about_ca_topic_score_codex":0.005105277,"about_ca_topic_score_gemma":0.0068802387,"teacher_disagreement_score":0.066336915,"about_ca_system_score_codex":0.002848518,"about_ca_system_score_gemma":0.0036511251,"threshold_uncertainty_score":0.22191906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013692447,0.003330806,0.8816791,0.012074268,0.000499508,0.00024524788,0.00061040063,0.00046947127,0.08739878],"genre_scores_gemma":[0.50446576,0.00570043,0.46203628,0.004935237,0.0014166236,0.0009963623,0.001117806,0.00029291655,0.019038608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99204236,0.0028959585,0.0008017045,0.0011877086,0.0023442446,0.0007280456],"domain_scores_gemma":[0.9902868,0.0056618834,0.0008871655,0.0011554383,0.0015186669,0.00049007486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008880831,0.00076289487,0.0009127007,0.0028707571,0.0039743097,0.007141981,0.002231199,0.0032223293,0.005451767],"category_scores_gemma":[0.012796866,0.0009766592,0.0024576483,0.0021778045,0.016864106,0.012647485,0.0048708944,0.005879778,0.0012122275],"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.0000022390175,0.0000041144617,0.000027518137,0.000013310126,0.000002705932,0.00002194247,0.000104132734,0.0005336202,0.000050531227,0.99795985,0.00024105076,0.001039026],"study_design_scores_gemma":[0.000007743835,0.000004936883,0.000025114112,0.00002176042,0.000003834676,0.00002099015,0.000041915595,0.0026458018,0.000098236866,0.98969895,0.0074238284,0.000006882914],"about_ca_topic_score_codex":0.00573179,"about_ca_topic_score_gemma":0.002523009,"teacher_disagreement_score":0.008880831,"about_ca_system_score_codex":0.0052724085,"about_ca_system_score_gemma":0.004153121,"threshold_uncertainty_score":0.04696691},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028003696,0.03317921,0.7423661,0.016077437,0.015690522,0.0004505602,0.001424354,0.004724114,0.18328741],"genre_scores_gemma":[0.038663197,0.04243065,0.52662474,0.004751255,0.008858966,0.0012657822,0.0069663213,0.004517159,0.36592188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961671,0.0011904895,0.0004676322,0.0006157121,0.0013059343,0.00025313767],"domain_scores_gemma":[0.9966336,0.0015444856,0.00010500477,0.0007261364,0.0006894129,0.00030129004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004770685,0.0014595712,0.0013705571,0.001428547,0.0012140515,0.0077249277,0.002444633,0.0019168511,0.056423888],"category_scores_gemma":[0.006387849,0.0009837305,0.001831232,0.001980318,0.0024125162,0.007364047,0.0038613384,0.006318776,0.019766534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001622614,0.00015837185,0.00035765427,0.0007062865,0.0001022708,0.0003180894,0.0011362187,0.002868618,0.0032517063,0.35150748,0.3620596,0.27737147],"study_design_scores_gemma":[0.000023542689,0.00003587357,0.00016306667,0.0002564973,0.000024358797,0.0002605323,0.00009474693,0.003854116,0.0007282878,0.072754905,0.92178476,0.000019312443],"about_ca_topic_score_codex":0.002566382,"about_ca_topic_score_gemma":0.0027757145,"teacher_disagreement_score":0.056423888,"about_ca_system_score_codex":0.001863864,"about_ca_system_score_gemma":0.0030132157,"threshold_uncertainty_score":0.1887567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07081822,0.0046366253,0.78638834,0.0022615108,0.0006283814,0.000114934344,0.0004542047,0.0005638875,0.13413398],"genre_scores_gemma":[0.76345956,0.0049383296,0.20855223,0.0015554408,0.0009866072,0.00027188892,0.0004948529,0.00015680116,0.01958442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993216,0.000120988254,0.000045108885,0.00013375292,0.00024158189,0.00013699126],"domain_scores_gemma":[0.999134,0.00046066876,0.00006326338,0.00015679115,0.00014069097,0.00004470525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005298816,0.0005463257,0.00045699108,0.0013312066,0.0009342929,0.0015617954,0.0012798388,0.0011059553,0.0052680536],"category_scores_gemma":[0.0019245278,0.0004154637,0.00072818325,0.0013095165,0.0015962367,0.0020540056,0.0012990978,0.002084863,0.0007876243],"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.000053704167,0.00004206377,0.00035225681,0.00015141637,0.00001158022,0.000119711796,0.00012037155,0.013186735,0.0020595277,0.94596046,0.0024418843,0.03550018],"study_design_scores_gemma":[0.00003208029,0.000058621707,0.000266757,0.00008180536,0.000021713317,0.00019314076,0.000042037285,0.09416245,0.0051439973,0.86956805,0.030390745,0.000038577422],"about_ca_topic_score_codex":0.001133244,"about_ca_topic_score_gemma":0.0012033914,"teacher_disagreement_score":0.0052680536,"about_ca_system_score_codex":0.0015872432,"about_ca_system_score_gemma":0.0009039268,"threshold_uncertainty_score":0.017623425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48820695,0.0011278136,0.43626103,0.012086481,0.00025475223,0.00036278446,0.001045342,0.00071342004,0.059941463],"genre_scores_gemma":[0.9263107,0.0003939422,0.06529046,0.001073479,0.00021147015,0.00027431306,0.00059758493,0.00013639432,0.0057116146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844724,0.0004673546,0.00013798437,0.00039040524,0.00039531247,0.00016181977],"domain_scores_gemma":[0.9887256,0.007681696,0.00092123315,0.0012402536,0.0008475155,0.0005836171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026851122,0.00042632755,0.00081994844,0.001881893,0.0024472068,0.0034217655,0.0016652175,0.0017978076,0.0056865215],"category_scores_gemma":[0.014153178,0.00036435708,0.0016195847,0.0010136473,0.0047621513,0.0071735834,0.0028117585,0.0039106403,0.00044674697],"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.0000375987,0.000049731967,0.001436537,0.00007109225,0.000012419849,0.00012222337,0.00038106393,0.0018470187,0.00060222676,0.98611313,0.0018366554,0.0074903206],"study_design_scores_gemma":[0.000019279763,0.000018226716,0.00047709208,0.000020855541,0.00000927417,0.00017803264,0.00010268629,0.021709662,0.00035366922,0.9746821,0.0024109245,0.00001821523],"about_ca_topic_score_codex":0.0010228446,"about_ca_topic_score_gemma":0.00067061663,"teacher_disagreement_score":0.0056865215,"about_ca_system_score_codex":0.0015970118,"about_ca_system_score_gemma":0.0010845016,"threshold_uncertainty_score":0.0190233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15964898,0.0019525333,0.6713759,0.0012019324,0.00083176536,0.00011730952,0.0004615,0.00096703967,0.163443],"genre_scores_gemma":[0.803797,0.001149371,0.13047175,0.0011129754,0.0004041542,0.00018640741,0.0004149195,0.00053232483,0.061931055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773574,0.00047677578,0.00023427553,0.00063283235,0.00058691035,0.0003333784],"domain_scores_gemma":[0.9976433,0.0007361303,0.0002709595,0.00054045045,0.0005976892,0.00021148563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016693638,0.0007404524,0.00057506753,0.002154364,0.0014520427,0.002905439,0.00061634067,0.0011198636,0.007332705],"category_scores_gemma":[0.0031222086,0.00046803063,0.0015179651,0.00094470545,0.0044545988,0.005891798,0.0036563308,0.0027192275,0.0019064985],"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.000017741379,0.000011480111,0.00026457364,0.00005187568,0.000009949867,0.00015673482,0.00043317038,0.0003023642,0.0026046538,0.9850211,0.000537138,0.010589144],"study_design_scores_gemma":[0.000007798339,0.000052241434,0.0004675009,0.00003614985,0.000014378661,0.0008461337,0.00028682497,0.0016387282,0.0038396253,0.9561112,0.03665583,0.000043507087],"about_ca_topic_score_codex":0.00036849777,"about_ca_topic_score_gemma":0.0005248352,"teacher_disagreement_score":0.007332705,"about_ca_system_score_codex":0.00075814466,"about_ca_system_score_gemma":0.00042220834,"threshold_uncertainty_score":0.024530351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020506566,0.0005628568,0.94334304,0.00073749,0.0004340594,0.0004131598,0.0010995393,0.0014084906,0.031494826],"genre_scores_gemma":[0.22127391,0.0007820051,0.7495157,0.0008944532,0.00034081528,0.00090286956,0.0031927617,0.00085464935,0.022242859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965063,0.0006756514,0.0004689917,0.0007445951,0.0013331005,0.00027134357],"domain_scores_gemma":[0.9969495,0.0009410789,0.00011599707,0.0007596808,0.0011104356,0.00012332208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002065895,0.00082380715,0.0010152275,0.0013374678,0.0017719538,0.0034190738,0.0021072598,0.0012592725,0.0060305772],"category_scores_gemma":[0.0048513776,0.0007394616,0.0022080883,0.0006819496,0.0030046527,0.0035104624,0.0018694095,0.004218203,0.0034356492],"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.000047857146,0.000113472095,0.00026511354,0.00024806196,0.00004037654,0.00029264265,0.00077577017,0.00519551,0.008986048,0.9163506,0.0047497605,0.06293473],"study_design_scores_gemma":[0.000052189163,0.00007421213,0.00016199266,0.00009806769,0.00007802757,0.00032149607,0.00018060183,0.031022267,0.019921971,0.8841667,0.06383607,0.00008640242],"about_ca_topic_score_codex":0.0023814542,"about_ca_topic_score_gemma":0.002660094,"teacher_disagreement_score":0.0060305772,"about_ca_system_score_codex":0.0011386495,"about_ca_system_score_gemma":0.002105114,"threshold_uncertainty_score":0.020174325},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059016794,0.03322426,0.5946811,0.03717592,0.04740887,0.0006385489,0.003677663,0.00568671,0.2716053],"genre_scores_gemma":[0.103298046,0.03386152,0.37155914,0.007892246,0.021323042,0.0013174019,0.017719701,0.007043476,0.43598542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99174,0.002935917,0.00069968286,0.0012248746,0.0028860779,0.00051345374],"domain_scores_gemma":[0.9908064,0.004380358,0.00021502825,0.0020132319,0.0020644218,0.000520523],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008471057,0.0015962844,0.0014147963,0.0019379118,0.0015228115,0.0074133263,0.0024365135,0.002504777,0.067019336],"category_scores_gemma":[0.015626213,0.00089923054,0.002334806,0.0015608275,0.0025984528,0.0062602838,0.0038399105,0.005890901,0.023347996],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033362187,0.00014910962,0.0005157395,0.00069658115,0.00013774534,0.0003505268,0.0006854733,0.006355649,0.003564557,0.22183567,0.4833759,0.28199938],"study_design_scores_gemma":[0.00004096132,0.000056804554,0.0003210504,0.00032350427,0.00003140991,0.0002489744,0.000091706,0.0057529537,0.0021145432,0.09506473,0.89592427,0.000029072029],"about_ca_topic_score_codex":0.0025687548,"about_ca_topic_score_gemma":0.0025708473,"teacher_disagreement_score":0.9915289,"about_ca_system_score_codex":0.0029048712,"about_ca_system_score_gemma":0.0036003652,"threshold_uncertainty_score":0.22420204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20352332,0.00081626023,0.78978187,0.00047949876,0.00005903053,0.00013709652,0.000099924924,0.0026934484,0.002409615],"genre_scores_gemma":[0.8201856,0.00033012615,0.17796132,0.00017093935,0.00002610712,0.0001186899,0.00014665935,0.00020078062,0.0008597942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638474,0.0015323408,0.00017713114,0.00038323464,0.0013454937,0.00017700279],"domain_scores_gemma":[0.9909051,0.006850026,0.00076022826,0.0006310994,0.00070417655,0.00014938977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020178824,0.00075773796,0.0005060356,0.0012439644,0.0004033975,0.0006377906,0.0011905981,0.0009107127,0.0007573806],"category_scores_gemma":[0.012368875,0.00021080926,0.0006078928,0.0007357225,0.0018851991,0.0009522988,0.00083662546,0.00090071955,0.00011563826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0003883522,0.0003424264,0.011500484,0.0005548734,0.00010530093,0.0017015208,0.0005171717,0.55903476,0.0962648,0.06353067,0.0016440778,0.26441562],"study_design_scores_gemma":[0.00006747619,0.00033714346,0.0015885863,0.000069981834,0.000040992236,0.00069878495,0.00006682478,0.9003398,0.04369273,0.05011024,0.002950183,0.000037229864],"about_ca_topic_score_codex":0.00198539,"about_ca_topic_score_gemma":0.0013130934,"teacher_disagreement_score":0.0020178824,"about_ca_system_score_codex":0.00088035414,"about_ca_system_score_gemma":0.00086839334,"threshold_uncertainty_score":0.010671735},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023431806,0.040325124,0.7297508,0.021255167,0.03108974,0.0005611226,0.0025859403,0.005221564,0.16686732],"genre_scores_gemma":[0.048816137,0.03621147,0.5039343,0.0071833706,0.011983977,0.0014005878,0.013073828,0.0052338466,0.3721625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929898,0.0025514124,0.00078115636,0.0009291184,0.0023962427,0.00035233606],"domain_scores_gemma":[0.994132,0.0026978755,0.00016030684,0.0013202155,0.001341822,0.00034779843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009295497,0.0016886573,0.0013969616,0.0017159014,0.0010773588,0.0067519383,0.0033842947,0.0025494944,0.06648491],"category_scores_gemma":[0.011094948,0.0008606649,0.0026526975,0.0012475004,0.002500783,0.0059604133,0.0036874374,0.0065664076,0.023851592],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015558102,0.00015414468,0.00043960547,0.0010698633,0.00015131239,0.00024975714,0.0009599769,0.003304021,0.0024249172,0.31534576,0.3684277,0.30731732],"study_design_scores_gemma":[0.000023235309,0.00003546697,0.0001846317,0.0003951434,0.000026078109,0.00022666014,0.00008770269,0.0027256263,0.00066449767,0.07223841,0.923374,0.000018496417],"about_ca_topic_score_codex":0.0026397565,"about_ca_topic_score_gemma":0.002207665,"teacher_disagreement_score":0.06648491,"about_ca_system_score_codex":0.0027230126,"about_ca_system_score_gemma":0.0035056933,"threshold_uncertainty_score":0.2224142},"labels":[],"label_agreement":null}]}