{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":131,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":131,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"9d0a9cf466be","filters":{"venue":"Electronic Proceedings in Theoretical Computer Science"}},"results":[{"id":"W2803889673","doi":"10.4204/eptcs.287.1","title":"Towards Large-scale Functional Verification of Universal Quantum Circuits","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Quantum computer; Formal equivalence checking; Boolean function; Qubit; Boolean circuit; Theoretical computer science; Formal verification; Algorithm; Polynomial; Quantum circuit; Electronic circuit; Quantum algorithm; Quantum; Mathematics; Quantum error correction; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.004568378535353583,"gpt":0.2092226567603188,"spread":0.2046542782249653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001768888,0.000201041,0.0002669401,0.0003852154,0.0001670997,0.000164802,0.002025558,0.00008034333,0.00002804619],"category_scores_gemma":[0.00005780095,0.0001814398,0.00007718102,0.002165434,0.0006323933,0.0006393691,0.000668475,0.0004969099,0.0000258456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002208189,"about_ca_system_score_gemma":0.0005210615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003177201,"about_ca_topic_score_gemma":4.681988e-7,"domain_scores_codex":[0.9969707,0.00002769471,0.0003443582,0.0008943332,0.0008211471,0.0009417876],"domain_scores_gemma":[0.9989872,0.00008745113,0.000144366,0.0003667491,0.0002834657,0.0001307944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008575355,0.00009310482,0.0004401645,0.00001836397,0.000003618304,8.745379e-7,0.0008066338,0.0006726928,0.003354815,0.982384,0.00002310924,0.01219405],"study_design_scores_gemma":[0.0003976743,0.0003676531,0.006545435,0.00005242393,0.000002155005,0.00002676495,0.00002794737,0.8614362,0.0051746,0.1256165,0.0001509236,0.0002016564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4443012,0.00002892471,0.5525963,0.0004811148,0.000439541,0.0001578572,7.407909e-7,0.0001008476,0.001893472],"genre_scores_gemma":[0.9855087,0.000005929314,0.01421185,0.0001628647,0.00008566553,0.000003868191,8.908432e-7,0.000009451761,0.00001082933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8607635,"threshold_uncertainty_score":0.73989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078639733","doi":"10.4204/eptcs.172.1","title":"Dilation of states and processes in operational-probabilistic theories","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Key Research and Development Program of China; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Government of Canada; Foundational Questions Institute","keywords":"Probabilistic logic; Dilation (metric space); Computer science; Mathematical economics; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.003445579069430531,"gpt":0.2273131135587382,"spread":0.2238675344893077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008128801,0.0000788795,0.0001149615,0.00009003891,0.00007878437,0.00006539205,0.0002189973,0.00001470586,0.00001480112],"category_scores_gemma":[0.00006199401,0.0000664986,0.000009009076,0.0006256656,0.0005593924,0.000197936,0.00008438467,0.0001108608,8.440314e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002671528,"about_ca_system_score_gemma":0.0001130849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008100106,"about_ca_topic_score_gemma":0.000002387984,"domain_scores_codex":[0.9991195,0.000008162887,0.0001904966,0.0002694892,0.0001531843,0.0002591579],"domain_scores_gemma":[0.9996007,0.000113953,0.00004949515,0.00006255686,0.0001381454,0.00003511911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004487323,0.00004382511,0.003235724,0.00001669265,8.357233e-7,9.438997e-9,0.0003466721,0.00005844695,0.0004827698,0.993414,6.223627e-7,0.002395929],"study_design_scores_gemma":[0.0001097665,0.00007194863,0.001117166,0.00002491875,0.000001378608,3.915651e-7,0.0000296276,0.2073914,0.00353505,0.7876418,0.00001481711,0.00006175321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8094588,0.00001833713,0.1891856,0.000244567,0.00001384983,0.000146735,0.000001196925,0.00000867144,0.0009222124],"genre_scores_gemma":[0.9988072,0.000005573732,0.001088112,0.00002616608,0.00003495099,0.00003103395,0.000001851004,0.000004075075,0.000001033265],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2073329,"threshold_uncertainty_score":0.2711734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1961267274","doi":"10.4204/eptcs.195.22","title":"Logical pre- and post-selection paradoxes are proofs of contextuality","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Foundational Questions Institute","keywords":"Kochen–Specker theorem; Postselection; Von Neumann architecture; Mathematical proof; Selection (genetic algorithm); Class (philosophy); Mathematics; Theoretical physics; Quantum; Pure mathematics; Physics; Computer science; Quantum mechanics; Epistemology; Philosophy; Quantum entanglement; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01099038170597284,"gpt":0.2629665755079771,"spread":0.2519761938020043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009739684,0.000107533,0.0001728603,0.00007012524,0.00009210005,0.0000721559,0.0003042146,0.00003064511,0.00001193447],"category_scores_gemma":[0.00004066565,0.00008786721,0.00002523033,0.0004996335,0.0007126142,0.0001840909,0.0001515432,0.0002132083,0.000001878941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005035497,"about_ca_system_score_gemma":0.0001512523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001203097,"about_ca_topic_score_gemma":8.630829e-7,"domain_scores_codex":[0.9987668,0.00001269635,0.0002163361,0.0003675192,0.0002511002,0.0003855961],"domain_scores_gemma":[0.9993824,0.00003801992,0.0001021044,0.00007769632,0.0002727761,0.0001269857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002210078,0.0001006941,0.003996806,0.000005268769,0.000002800148,4.61524e-8,0.0003131372,0.000002618591,0.001848017,0.9902512,0.000007473415,0.003449854],"study_design_scores_gemma":[0.0002730388,0.0003598112,0.005132811,0.00002073098,0.000004769719,0.00000435294,0.0001322559,0.0573088,0.007409,0.929199,0.00003994151,0.000115526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9128398,0.00003675433,0.08557139,0.0003453635,0.00002662438,0.0002312103,0.000002197914,0.00002148562,0.0009251867],"genre_scores_gemma":[0.9988588,0.000001302541,0.0009916603,0.00004498581,0.00006485872,0.00002970116,7.630566e-7,0.000004817154,0.000003129463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08601899,"threshold_uncertainty_score":0.3583121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2792585849","doi":"10.4204/eptcs.266.11","title":"A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; U.S. Air Force","keywords":"Morphism; Categorical variable; Categorical quantum mechanics; Programming language specification; Object language; State (computer science); Quantum circuit; Type (biology); Quantum","retraction":null,"screen_n_in":null,"score":{"opus":0.01144769719817932,"gpt":0.254595512339921,"spread":0.2431478151417417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002211447,0.000299137,0.0002998569,0.0004032361,0.0005217746,0.0006687852,0.002676327,0.0001121678,0.000005444072],"category_scores_gemma":[0.0002038974,0.0002579208,0.0001018522,0.001641208,0.00144901,0.0007844164,0.0006091144,0.0005446454,0.00001540247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003338396,"about_ca_system_score_gemma":0.0004776712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005524993,"about_ca_topic_score_gemma":0.000003093415,"domain_scores_codex":[0.9960315,0.00001513155,0.0004236535,0.001243044,0.0006619478,0.001624678],"domain_scores_gemma":[0.9987587,0.000122538,0.0001263876,0.0003869692,0.0003634186,0.0002419726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002003026,0.00009760955,0.000009214514,0.00001549269,0.00000370734,0.000003211978,0.00302857,0.0002879243,0.004586621,0.9597483,0.0000476385,0.03215174],"study_design_scores_gemma":[0.0002641589,0.0003832205,0.0001556314,0.00002068129,0.000002355472,0.00005522589,0.00001052176,0.5831244,0.00203565,0.4137228,0.0000204647,0.0002048822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1810084,0.00004919134,0.8169522,0.0005926584,0.000294168,0.0003329646,8.222466e-7,0.00027448,0.0004951528],"genre_scores_gemma":[0.9216868,0.000003081867,0.07744589,0.0004272622,0.0003697,0.00003823006,7.093282e-7,0.00001811032,0.00001023274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7406784,"threshold_uncertainty_score":0.9999873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152635269","doi":"10.4204/eptcs.77.1","title":"Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University","keywords":"Coinduction; Recursion (computer science); Type (biology); Fixed point; Computer science; Productivity; Mathematics; Programming language; Economics; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.009176382782976196,"gpt":0.2414956572258375,"spread":0.2323192744428613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002189779,0.0002077167,0.0002096802,0.0003326549,0.0002778979,0.0002967676,0.0009826676,0.00009989989,0.00000899998],"category_scores_gemma":[0.0002491609,0.0001740914,0.00003005385,0.00161157,0.001129775,0.001735657,0.0004258628,0.000358267,0.00002500852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002480473,"about_ca_system_score_gemma":0.0002816985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005066558,"about_ca_topic_score_gemma":0.000001161333,"domain_scores_codex":[0.9976054,0.00004873565,0.0002782449,0.0006239525,0.0005061167,0.0009375797],"domain_scores_gemma":[0.9990022,0.0001303444,0.0001199492,0.0002171872,0.0003339766,0.0001964128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008645815,0.00007485404,0.008194267,0.000012724,0.000004140355,0.000001017188,0.0009205444,0.000002719423,0.0003530888,0.9732361,0.00002113028,0.01717076],"study_design_scores_gemma":[0.0006858236,0.0007349428,0.04549713,0.00002849694,0.00001096541,0.0001333109,0.00006067714,0.09484731,0.0145409,0.8415197,0.001296785,0.0006440267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5118445,0.0004314202,0.4791616,0.001352544,0.001156752,0.0006377952,2.879847e-7,0.0002979226,0.005117164],"genre_scores_gemma":[0.9823375,0.000005071065,0.01721511,0.0001932168,0.000206227,0.00002251265,7.728904e-7,0.000009586655,0.000009954716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.470493,"threshold_uncertainty_score":0.709924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125182723","doi":"10.4204/eptcs.195.3","title":"Quantum Alternation: Prospects and Problems","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Chinese Academy of Sciences","keywords":"Denotational semantics; Statement (logic); Quantum; Semantics (computer science); Computer science; Mathematics; Quantum algorithm; Programming language; Algebra over a field; Discrete mathematics; Theoretical computer science; Operational semantics; Pure mathematics; Quantum mechanics; Physics; Linguistics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.007612402115275471,"gpt":0.2305862753071317,"spread":0.2229738731918562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002459863,0.0002325048,0.0002302103,0.0003317401,0.0002316016,0.0007564992,0.001906934,0.00005864708,0.000001463691],"category_scores_gemma":[0.0001561154,0.0001925303,0.00002984177,0.001754728,0.001100249,0.0008486871,0.001133577,0.0005038243,0.000009134086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002143223,"about_ca_system_score_gemma":0.0003566693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005136415,"about_ca_topic_score_gemma":0.000001027405,"domain_scores_codex":[0.9968085,0.00002317441,0.0003024462,0.001000071,0.0008036766,0.001062173],"domain_scores_gemma":[0.9989719,0.00006308946,0.00009410515,0.0002658023,0.0002611554,0.0003439521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004327365,0.00004505503,0.0003704111,0.0000106519,0.000002078686,0.000005438448,0.001276558,0.0003211159,0.0001465785,0.9801153,0.00002367576,0.01767883],"study_design_scores_gemma":[0.0002798401,0.0003500326,0.0003818723,0.00003528156,9.285109e-7,0.0001430269,0.000006259727,0.5889209,0.000551502,0.4089959,0.0001684817,0.0001659706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4148917,0.0003410209,0.5786076,0.003030572,0.0004412671,0.0003645501,2.093208e-7,0.0003455884,0.001977546],"genre_scores_gemma":[0.9576363,0.00001230129,0.04187123,0.0002795836,0.0001688923,0.00001505678,1.693478e-7,0.00001028529,0.000006184704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5885997,"threshold_uncertainty_score":0.7851159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570901353","doi":"10.4204/eptcs.266.5","title":"A Finite Presentation of CNOT-Dihedral Operators","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Controlled NOT gate; Dihedral angle; Dihedral group; Unitary state; Mathematics; Pure mathematics; Discrete mathematics; Computer science; Algebra over a field; Topology (electrical circuits); Combinatorics; Physics; Quantum gate; Quantum; Quantum mechanics; Quantum computer; Law; Group (periodic table)","retraction":null,"screen_n_in":null,"score":{"opus":0.004989352581409593,"gpt":0.2452646718012964,"spread":0.2402753192198868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577799,0.0001994943,0.0002401302,0.0004137844,0.0002656518,0.0002897021,0.002489961,0.00006201274,0.00001234554],"category_scores_gemma":[0.000198344,0.0001673349,0.0000568295,0.002737267,0.002292934,0.0006885534,0.0009170264,0.0003682494,0.00001225439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001086838,"about_ca_system_score_gemma":0.0003222096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004985674,"about_ca_topic_score_gemma":0.000001296435,"domain_scores_codex":[0.997146,0.00003152445,0.000390201,0.0007952472,0.0006811873,0.0009558771],"domain_scores_gemma":[0.9989062,0.0001414773,0.0001228812,0.0003130306,0.0003743079,0.0001421242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001076109,0.00005640081,0.0002550802,0.000009956504,0.000003221286,0.000001640326,0.001602518,0.0002456994,0.002145279,0.9759472,0.00001741592,0.0197048],"study_design_scores_gemma":[0.0002491918,0.000701698,0.0006520966,0.00004943255,0.000001717611,0.0000265084,0.000009247556,0.8193792,0.03448436,0.1442075,0.000063302,0.0001757941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4620057,0.00002921114,0.535549,0.000533312,0.00029255,0.00016374,3.336301e-7,0.0001142639,0.00131192],"genre_scores_gemma":[0.9248412,0.000003269892,0.07470185,0.0002167514,0.0002173568,0.000006698575,2.058126e-7,0.0000084662,0.000004149745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8317397,"threshold_uncertainty_score":0.8448409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044654785","doi":"10.4204/eptcs.3.11","title":"State Complexity Approximation","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Theoretical computer science; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006796178078751685,"gpt":0.2484712954851694,"spread":0.2416751174064177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284794,0.0002044759,0.0002162025,0.0003291267,0.0003152234,0.0006117024,0.002366552,0.00004301484,0.000009681764],"category_scores_gemma":[0.0001157028,0.0001785596,0.00004642914,0.002134,0.0008850008,0.001121214,0.0003560929,0.0006035061,0.00002590055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002337941,"about_ca_system_score_gemma":0.0001806184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002997024,"about_ca_topic_score_gemma":4.551284e-7,"domain_scores_codex":[0.9969963,0.00003025993,0.0003111952,0.0008392629,0.0007025775,0.001120395],"domain_scores_gemma":[0.9992276,0.00004927366,0.00009693162,0.0002892427,0.0001634994,0.0001734486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004818851,0.00006316804,0.00007712327,0.000003616499,8.852917e-7,0.00000198162,0.0004510252,0.00008415743,0.0003622394,0.8934048,0.00001632492,0.1055299],"study_design_scores_gemma":[0.0001519157,0.0002662203,0.002037891,0.00001375276,5.532814e-7,0.00002665679,0.000001891679,0.5159615,0.001393584,0.4799438,0.00006392931,0.0001383491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07988627,0.00003641198,0.9097891,0.003253795,0.000153347,0.0001890047,1.796029e-7,0.0003550786,0.006336757],"genre_scores_gemma":[0.8887738,0.000005797529,0.1104684,0.0006522094,0.00007776985,0.000005120991,3.879502e-7,0.000004771057,0.0000117033],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8088875,"threshold_uncertainty_score":0.7281448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2329299806","doi":"10.4204/eptcs.158.0","title":"Proceedings 9th Workshop on Quantum Physics and Logic","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Quantum logic; Physics; Engineering physics; Quantum; Quantum mechanics; Quantum computer","retraction":null,"screen_n_in":null,"score":{"opus":0.005988836414477809,"gpt":0.2299726511338213,"spread":0.2239838147193435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002434727,0.0003885033,0.0003730273,0.0003137555,0.0005060111,0.0009410408,0.002447811,0.0001069411,0.000002657307],"category_scores_gemma":[0.0002887529,0.0003137071,0.00006419945,0.002206339,0.001555641,0.0006676948,0.001137309,0.0009747767,0.00001549907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001585881,"about_ca_system_score_gemma":0.0001254388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001237211,"about_ca_topic_score_gemma":3.083654e-7,"domain_scores_codex":[0.9957682,0.00002397463,0.000356253,0.001492845,0.0008223454,0.00153636],"domain_scores_gemma":[0.9988111,0.000262487,0.0001382169,0.0002965263,0.0002058344,0.0002858414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001022532,0.00007337525,0.000098845,0.00001678332,0.000002647242,0.000001401004,0.0005729508,0.0001923162,0.0002467774,0.9150593,0.00003803465,0.0836874],"study_design_scores_gemma":[0.0002128499,0.0004558108,0.0003268148,0.00008681558,0.000001768786,0.00004109111,0.000006303371,0.5598689,0.0006787851,0.4378603,0.0002149875,0.0002454861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.272502,0.00006239759,0.7203174,0.002953449,0.0003846728,0.0002767217,2.111273e-7,0.0003919288,0.003111269],"genre_scores_gemma":[0.9558569,0.00001744734,0.04264678,0.001100893,0.0003368466,0.00001412533,1.819374e-7,0.00001842856,0.000008369406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6833549,"threshold_uncertainty_score":0.9999315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2552403574","doi":"10.4204/eptcs.229.8","title":"Developing a Practical Reactive Synthesis Tool: Experience and Lessons Learned","year":2016,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Debugger; Key (lock); Computer science; Software engineering; Software; Process management; Debugging; Programming language; Engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02934835107537552,"gpt":0.3277130819157738,"spread":0.2983647308403982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002712414,0.000243403,0.0002577426,0.0004095208,0.0002679613,0.0005253142,0.00184054,0.00009076561,0.000009005102],"category_scores_gemma":[0.007138005,0.0001758528,0.00003401111,0.001870418,0.002013649,0.002079573,0.001512891,0.0004470241,0.00001913197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007278006,"about_ca_system_score_gemma":0.00073576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002559891,"about_ca_topic_score_gemma":4.2637e-7,"domain_scores_codex":[0.9959962,0.0000409712,0.0002976383,0.00128989,0.0008959326,0.001479384],"domain_scores_gemma":[0.9967625,0.002317479,0.00006907234,0.0003747317,0.0002540391,0.0002222459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001554676,0.00002516029,0.0008259512,0.000007943738,0.000003511509,0.00001082252,0.000599117,7.074406e-7,0.004159746,0.9242161,0.000006271065,0.07012913],"study_design_scores_gemma":[0.0007422889,0.0005023956,0.0225707,0.0005385149,0.000006514641,0.000639866,0.00006761657,0.0775054,0.1578455,0.7377229,0.0006920422,0.00116624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2812508,0.00002352267,0.7065434,0.01147998,0.00009242221,0.0001591371,2.400576e-7,0.0002382429,0.000212268],"genre_scores_gemma":[0.8865612,0.00006007019,0.1131071,0.0001220015,0.00004845587,0.00008150662,2.25762e-8,0.00001341789,0.000006227095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6053104,"threshold_uncertainty_score":0.8545374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052351054","doi":"10.4204/eptcs.9.12","title":"How Creative Should Creators Be To Optimize the Evolution of Ideas? A Computational Model","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Vlaamse regering","keywords":"Creativity; Function (biology); Diversity (politics); Population; Fitness function; Ideal (ethics); Sociology; Psychology; Epistemology; Computer science; Social psychology; Demography; Biology; Philosophy; Evolutionary biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01133373887865297,"gpt":0.2871389603538102,"spread":0.2758052214751572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727443,0.0001267854,0.0001636029,0.0001374998,0.0005514898,0.0002206293,0.00083538,0.00006824431,0.00001340988],"category_scores_gemma":[0.0004834894,0.00008542499,0.00005673392,0.001688869,0.001767376,0.0006403163,0.00009463581,0.0002480847,0.000001567933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009178907,"about_ca_system_score_gemma":0.0005772875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008155326,"about_ca_topic_score_gemma":0.00002544979,"domain_scores_codex":[0.9978213,0.00004077877,0.0001895212,0.0003840102,0.0009029154,0.0006614628],"domain_scores_gemma":[0.9991906,0.00007646631,0.00008254214,0.0000891568,0.0004226648,0.0001385838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002974561,0.00004035984,0.00003652001,0.000001546785,0.000002298219,2.593521e-7,0.01064936,0.005701737,0.0003436404,0.981305,0.00009330348,0.001796254],"study_design_scores_gemma":[0.0001712338,0.0002766735,0.0007081314,0.00002955518,0.000007700465,0.000003009086,0.002345767,0.3665249,0.0003730441,0.6293744,0.00004587616,0.0001396889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4722232,0.0001899779,0.4773841,0.03092014,0.00008186333,0.0007424469,0.000002286797,0.0001034458,0.01835264],"genre_scores_gemma":[0.9871474,0.000007190982,0.01198318,0.0006978287,0.00008040263,0.00001231346,5.193397e-7,0.000003611677,0.00006756223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5149242,"threshold_uncertainty_score":0.651197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966076725","doi":"10.4204/eptcs.31.21","title":"Nondeterministic State Complexity for Suffix-Free Regular Languages","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Catenation; Regular language; Suffix; Upper and lower bounds; Discrete mathematics; Computer science; State (computer science); String (physics); Intersection (aeronautics); Automaton; Mathematics; Theoretical computer science; Algorithm; Automata theory","retraction":null,"screen_n_in":null,"score":{"opus":0.006249754356745859,"gpt":0.2532547907464555,"spread":0.2470050363897097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003216656,0.0002926164,0.0003265916,0.000319958,0.0003814079,0.0007035984,0.005577061,0.00008983253,0.00001969063],"category_scores_gemma":[0.0005425535,0.0002560073,0.00009209058,0.001220907,0.002719294,0.0009312659,0.001373998,0.000655103,0.00001304551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001311686,"about_ca_system_score_gemma":0.0003239345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004171263,"about_ca_topic_score_gemma":0.000009775415,"domain_scores_codex":[0.996326,0.00002125359,0.0004003629,0.001116929,0.0006230579,0.001512385],"domain_scores_gemma":[0.9982553,0.0003084487,0.0001304421,0.0008143393,0.0002497796,0.0002417557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001620014,0.00007612072,0.00007172394,0.00002141585,0.000003318758,0.000005051446,0.0004205849,0.00000281308,0.008724066,0.9739639,0.00008712539,0.01660766],"study_design_scores_gemma":[0.0004496342,0.0003072535,0.000524415,0.0000214062,0.000002842514,0.00007450857,0.00001151987,0.2868819,0.01454032,0.6966116,0.0002968615,0.0002777646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.374899,0.00004127393,0.6203756,0.001442882,0.0004974168,0.0004896202,0.000005290987,0.0003829516,0.001865942],"genre_scores_gemma":[0.8810781,0.000003643908,0.1182159,0.0004606725,0.0001563805,0.000047991,0.000001029203,0.00001699678,0.00001931198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5061791,"threshold_uncertainty_score":0.9999948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1824826039","doi":"10.4204/eptcs.186.5","title":"Systematic Verification of the Modal Logic Cube in Isabelle/HOL","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"HOL; Cube (algebra); Higher-order logic; Computer science; Modal; Modal logic; Programming language; Embedding; Multimodal logic; Automation; Normal modal logic; Accessibility relation; Automated theorem proving; Dynamic logic (digital electronics); Algorithm; Theoretical computer science; Description logic; Mathematics; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01391705845651953,"gpt":0.2437346175284077,"spread":0.2298175590718882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004819211,0.0001849503,0.0003519783,0.0002428123,0.0001109677,0.0002309749,0.003380995,0.0000859217,0.000001429677],"category_scores_gemma":[0.0004643737,0.000120057,0.00006286479,0.002705015,0.001077578,0.0006130105,0.0007045133,0.0003628849,0.00001412579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004305721,"about_ca_system_score_gemma":0.0004415447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001356501,"about_ca_topic_score_gemma":0.000004137676,"domain_scores_codex":[0.996994,0.00009691939,0.0005898253,0.0006461253,0.0008808204,0.0007922738],"domain_scores_gemma":[0.9987665,0.00009580729,0.0002365053,0.0004934254,0.0002838933,0.0001238569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004973675,0.0000832249,0.0005686454,0.0002420352,0.000002363752,0.000001021905,0.001623261,0.00006645291,0.0003693413,0.9965488,0.000009852532,0.0004799984],"study_design_scores_gemma":[0.0003817568,0.0002748494,0.0004180772,0.0001714856,0.000003800779,0.00004835639,0.00008016672,0.3064934,0.004233045,0.6876973,0.00001843569,0.0001792949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1221164,0.0006040513,0.8649558,0.001403635,0.000965594,0.00172539,1.645036e-7,0.0001744965,0.008054422],"genre_scores_gemma":[0.9970472,0.00000427661,0.002715687,0.0001176603,0.00004359169,0.00005091347,1.043309e-7,0.000006580589,0.0000139246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8749309,"threshold_uncertainty_score":0.6282786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385342865","doi":"10.4204/eptcs.380.5","title":"Compositional Modeling with Stock and Flow Diagrams","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Saskatchewan","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Public Health Agency of Canada; Foundation for the National Institutes of Health","keywords":"Principle of compositionality; Computer science; Story-driven modeling; Programming language; Interaction overview diagram; Semantics (computer science); Theoretical computer science; Stock (firearms); Syntax; Software; Class diagram; Unified Modeling Language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0424166694482239,"gpt":0.3349286603871206,"spread":0.2925119909388967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007237358,0.0001964993,0.0003266717,0.0007904728,0.0005493516,0.001107503,0.001275287,0.00005204017,0.0000397179],"category_scores_gemma":[0.0005199489,0.000130652,0.0000452075,0.00462814,0.001194904,0.0006473596,0.0008269275,0.0003492596,0.00006040543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001253383,"about_ca_system_score_gemma":0.0001862913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002792994,"about_ca_topic_score_gemma":0.000005748278,"domain_scores_codex":[0.9948835,0.00003552364,0.0005495469,0.001080958,0.002390649,0.001059784],"domain_scores_gemma":[0.9982547,0.0007035892,0.00009798951,0.0002555932,0.000472059,0.0002160437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003973757,0.00001814062,0.001126503,0.00000286642,0.000002086446,0.000006544068,0.0004138132,0.004162662,0.0002307787,0.9788151,0.0001088901,0.01507289],"study_design_scores_gemma":[0.0001915977,0.0001529733,0.001073378,0.0000354684,0.000001153823,0.00006657241,0.00006348515,0.5873541,0.00003804123,0.4108577,0.00004783691,0.0001177321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5762234,0.00006891088,0.4213369,0.0004486826,0.0001051795,0.0001822439,9.322862e-7,0.00009877183,0.001534951],"genre_scores_gemma":[0.9906911,0.000003577538,0.009003227,0.0001418277,0.0001102611,0.00001813372,3.627711e-7,0.00001123012,0.0000203007],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5831914,"threshold_uncertainty_score":0.9999294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964707275","doi":"10.4204/eptcs.63.29","title":"The Critical Exponent is Computable for Automatic Sequences","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Tulane University","keywords":"Exponent; Infimum and supremum; Critical exponent; Mathematics; Constant (computer programming); Computation; Sequence (biology); Rational number; Discrete mathematics; Combinatorics; Computer science; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01378765320324307,"gpt":0.2557944034789316,"spread":0.2420067502756885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00411149,0.0002765163,0.0002797343,0.0001970189,0.0009718986,0.0008605607,0.004654208,0.00007877019,0.00002599139],"category_scores_gemma":[0.0003654287,0.0001897057,0.000102795,0.001365312,0.003247507,0.001230584,0.0009185738,0.0003695397,0.00002439818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002445003,"about_ca_system_score_gemma":0.000356884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005593585,"about_ca_topic_score_gemma":8.028891e-7,"domain_scores_codex":[0.9959944,0.00003804331,0.0004972695,0.0009880112,0.0006989068,0.001783402],"domain_scores_gemma":[0.9981195,0.0007790917,0.0001060901,0.0004812637,0.0002932678,0.0002207642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001031132,0.00007303542,0.00007228342,0.00001809917,0.00000480987,0.000002113916,0.001618768,0.000002189951,0.0002081838,0.9711426,0.000124576,0.02672306],"study_design_scores_gemma":[0.0001424042,0.0003029656,0.0001884424,0.00003627658,0.000002756736,0.00003948231,0.00003559254,0.4544704,0.006285405,0.538096,0.0002257097,0.000174624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0586062,0.0003252832,0.9335961,0.003379517,0.0006404557,0.0005513324,0.000001021356,0.0003841674,0.002515918],"genre_scores_gemma":[0.8931097,0.00002131874,0.1057858,0.0008711873,0.00008669771,0.0001035691,1.397167e-7,0.00001277772,0.000008812407],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8345035,"threshold_uncertainty_score":0.9994651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145158997","doi":"10.4204/eptcs.14.6","title":"An Efficient Explicit-time Description Method for Timed Model Checking","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Model checking; Process (computing); Rendezvous; Synchronization (alternating current); Modularity (biology); Automaton; State (computer science); Variable (mathematics); Semaphore","retraction":null,"screen_n_in":null,"score":{"opus":0.01322371411625222,"gpt":0.3050697146368014,"spread":0.2918460005205492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007441346,0.0002818835,0.0003068641,0.0004755076,0.0004038056,0.0006728304,0.003233,0.0001194076,0.000003299958],"category_scores_gemma":[0.0003032305,0.0002649051,0.00007928073,0.001928685,0.0003837135,0.001831307,0.0002398481,0.0003949522,0.000009578302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006106552,"about_ca_system_score_gemma":0.0002956556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.883182e-7,"about_ca_topic_score_gemma":8.769245e-8,"domain_scores_codex":[0.9960464,0.00005918654,0.000487697,0.001287144,0.0007334945,0.001386049],"domain_scores_gemma":[0.9985925,0.00009858051,0.0001652653,0.0005289553,0.0003793866,0.000235323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000280238,0.0001258493,0.000002038942,0.000006024149,0.000001287717,2.547958e-7,0.000693442,0.009448635,0.04874284,0.8851853,0.000009095104,0.05575719],"study_design_scores_gemma":[0.0002363388,0.0006839351,0.00007209963,0.00002220956,0.000003196514,0.00001810169,0.000005055825,0.6676424,0.03731676,0.2937649,0.000009954147,0.0002251094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03762836,0.00002453473,0.9598686,0.000469519,0.0001404479,0.0006267653,4.575442e-7,0.0003422297,0.0008991605],"genre_scores_gemma":[0.4880915,0.000001419964,0.5115241,0.0002840556,0.00005272032,0.00003466929,5.016699e-7,0.00000741167,0.000003636212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6581937,"threshold_uncertainty_score":0.9999803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2216433683","doi":"10.4204/eptcs.185.3","title":"A Case Study on Logical Relations using Contextual Types","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; ENCODE; Equivalence (formal languages); Operational semantics; Computer science; Abstract syntax; Normalization (sociology); Logical consequence; Exploit; Logical equivalence; Theoretical computer science; Mathematics; Algebra over a field; Programming language; Semantics (computer science); Discrete mathematics; Pure mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0424867910284814,"gpt":0.296455703992082,"spread":0.2539689129636006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003222834,0.0002247301,0.0002687246,0.0003077998,0.0003372946,0.0005807764,0.001472108,0.00008242244,0.000004808972],"category_scores_gemma":[0.0003002505,0.000172521,0.00004684234,0.001836617,0.0008678789,0.0007181728,0.0006198444,0.0005010622,0.00004973359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000480053,"about_ca_system_score_gemma":0.0004625255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003033825,"about_ca_topic_score_gemma":0.000006600721,"domain_scores_codex":[0.9969316,0.00007356777,0.0003677019,0.0009069991,0.0007770518,0.0009431421],"domain_scores_gemma":[0.9988323,0.0001260966,0.000103973,0.0003252994,0.0003178942,0.0002944179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001156584,0.0002872858,0.001443881,0.000002004025,0.000005148423,0.0002978636,0.00341453,0.00009208766,0.00002868244,0.9915342,0.0000164643,0.002866268],"study_design_scores_gemma":[0.001087959,0.003610403,0.0002040632,0.00001100824,0.00001029934,0.00427192,0.000957813,0.5443816,0.000214008,0.4446468,0.0001650417,0.0004390485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4935545,0.00004448386,0.5011441,0.0001621508,0.0003223729,0.0004685842,7.770441e-8,0.0001855437,0.004118243],"genre_scores_gemma":[0.9943139,3.895028e-7,0.005360384,0.0001488118,0.0001336005,0.00002092155,1.082096e-7,0.00000899305,0.00001290871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5468874,"threshold_uncertainty_score":0.7035201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967571653","doi":"10.4204/eptcs.151.10","title":"Maximally Atomic Languages","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Mathematics; Regular language; Combinatorics; Semigroup; Rank (graph theory); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.002605956503864343,"gpt":0.217047875537888,"spread":0.2144419190340237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003221784,0.0002311116,0.0002501162,0.0003865735,0.000226359,0.0005740521,0.003697032,0.00007110531,0.00002104752],"category_scores_gemma":[0.0001858766,0.0001968643,0.00005984211,0.001761649,0.001163374,0.001040072,0.0009998527,0.0004206399,0.00007330548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002150834,"about_ca_system_score_gemma":0.0001723711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003416678,"about_ca_topic_score_gemma":0.000001022391,"domain_scores_codex":[0.9968207,0.00003496678,0.0003025438,0.0009486016,0.0006093046,0.001283908],"domain_scores_gemma":[0.9990266,0.0001578715,0.0000839519,0.0004302383,0.000115924,0.0001854075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004855099,0.00003808744,0.0002370367,0.000007403892,0.000001793594,0.00000250314,0.0002855336,0.000006323648,0.001314905,0.9564934,0.00003099818,0.04157714],"study_design_scores_gemma":[0.0002553065,0.0002170713,0.0009568033,0.0000316119,0.000001577027,0.00006898239,0.00001148227,0.4480433,0.005920815,0.5438238,0.0004239714,0.0002453089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2969601,0.00007336809,0.6856353,0.0011147,0.0001919363,0.0001491007,1.773804e-7,0.0004109047,0.01546436],"genre_scores_gemma":[0.9595912,0.00001216228,0.03923868,0.0009830659,0.0001389257,0.000013551,2.407117e-7,0.00001222448,0.000009999809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.662631,"threshold_uncertainty_score":0.8027894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076858065","doi":"10.4204/eptcs.71.3","title":"Multi-level Contextual Type Theory","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Type (biology); Dependency (UML); Type theory; Substitution (logic); Dependent type; Scheme (mathematics); Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.03317835845757754,"gpt":0.2572329000264598,"spread":0.2240545415688822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003600681,0.0002790026,0.0002969887,0.0003101679,0.0002801332,0.0003544814,0.003564338,0.0001147767,0.00004250489],"category_scores_gemma":[0.0002490026,0.0002226394,0.00006859221,0.001920564,0.001826194,0.0010073,0.000924031,0.0005085593,0.0001277672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002229672,"about_ca_system_score_gemma":0.0003670716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001264775,"about_ca_topic_score_gemma":0.000004764488,"domain_scores_codex":[0.9964846,0.00005709269,0.0004008058,0.001039704,0.0005898773,0.00142797],"domain_scores_gemma":[0.9987535,0.00009621146,0.000124975,0.0004222731,0.0003629425,0.0002400483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002330804,0.0001369446,0.000468235,0.00000878112,0.000006272302,0.000008450766,0.002450758,5.163644e-7,0.0004190259,0.9699094,0.00001968331,0.02654857],"study_design_scores_gemma":[0.0006242023,0.0008990933,0.002927265,0.0000144475,0.000005240075,0.0001084169,0.00007053957,0.06865618,0.005421846,0.9203873,0.0004129007,0.0004725196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01393667,0.0002060963,0.9710188,0.00008550623,0.0006997722,0.000345147,1.517025e-7,0.0003201076,0.01338774],"genre_scores_gemma":[0.9479357,0.00001071551,0.05153353,0.0003174878,0.00009601648,0.00002056285,2.198952e-7,0.00001372833,0.00007204687],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.933999,"threshold_uncertainty_score":0.9078971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058755347","doi":"10.4204/eptcs.161.15","title":"A Formulation of the Potential for Communication Condition using C2KA","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Covert; Computer science; Channel (broadcasting); Covert channel; Communications system; Path (computing); Theoretical computer science; Distributed computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.008343097245646705,"gpt":0.2616747680868401,"spread":0.2533316708411935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002543514,0.0001035371,0.0001351361,0.0001531471,0.0004602348,0.0001848454,0.002074685,0.00005533523,0.000001771687],"category_scores_gemma":[0.0002356885,0.00008482795,0.00006227269,0.001123173,0.0006477663,0.0007062306,0.000469232,0.000201027,6.331854e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001813249,"about_ca_system_score_gemma":0.0001577783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003006142,"about_ca_topic_score_gemma":6.132736e-7,"domain_scores_codex":[0.9984223,0.00004366689,0.0003372047,0.0003800119,0.0003901547,0.0004267007],"domain_scores_gemma":[0.998857,0.0001700027,0.0002206317,0.0003642289,0.0003456817,0.00004246228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005664816,0.00002823695,0.00008399124,0.00001352811,0.000001413184,8.860317e-9,0.0003550053,0.0009863905,0.003843936,0.9893935,0.000004005139,0.005284272],"study_design_scores_gemma":[0.000175323,0.00006131772,0.000690247,0.00003482326,0.000002321046,0.000007514152,0.000005482692,0.610639,0.009822079,0.3784684,0.00002931637,0.00006411481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2247127,0.00001719251,0.7741082,0.0004858318,0.000153078,0.0002587081,2.512211e-7,0.0000383806,0.0002257353],"genre_scores_gemma":[0.9205675,0.000002180558,0.07920964,0.0001462912,0.0000568312,0.00001169545,5.291245e-7,0.000004656401,7.310499e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6958548,"threshold_uncertainty_score":0.3855315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386093908","doi":"10.4204/eptcs.384.8","title":"Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amplitude; Mathematics; Theoretical physics; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.008348149584011729,"gpt":0.2482284254280993,"spread":0.2398802758440876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002999149,0.0002773212,0.000261932,0.0002860489,0.0009405402,0.000830319,0.003252464,0.0000514228,0.000004775162],"category_scores_gemma":[0.000209231,0.0001700238,0.00007472556,0.003368594,0.001999138,0.0004690422,0.000823691,0.0004503154,0.00001089297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001448705,"about_ca_system_score_gemma":0.0003804483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003720457,"about_ca_topic_score_gemma":0.000003213456,"domain_scores_codex":[0.9963939,0.00002686693,0.0003111269,0.0009625016,0.0008884933,0.001417097],"domain_scores_gemma":[0.9978102,0.001285795,0.0001151664,0.0003913217,0.0002750953,0.0001223994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002732309,0.00002504714,0.0001843646,0.00001352155,0.00001157273,0.000001944927,0.0007178862,0.001904763,0.0003560119,0.9793283,0.00003112691,0.01739818],"study_design_scores_gemma":[0.0002695339,0.0002748661,0.001679227,0.00003023261,0.000002985505,0.00001986289,0.00001310088,0.5278766,0.0002290103,0.4692264,0.0002214813,0.0001566266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0530608,0.00006800727,0.9416912,0.003754327,0.0002830947,0.0005103309,0.000004143787,0.0003924427,0.0002356449],"genre_scores_gemma":[0.9627135,0.00001266183,0.03643175,0.000504372,0.0002168259,0.00009325184,0.000002199708,0.00001627776,0.000009134142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9096527,"threshold_uncertainty_score":0.8006785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950537761","doi":"10.4204/eptcs.280.11","title":"Smtlink 2.0","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability modulo theories; Soundness; Python (programming language); Satisfiability; Extension (predicate logic); Modulo; Translation (biology); Extensibility; Solver","retraction":null,"screen_n_in":null,"score":{"opus":0.008010546611672423,"gpt":0.2430261120248299,"spread":0.2350155654131575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002787332,0.000227899,0.0002425555,0.0003326436,0.0003963736,0.0007392142,0.003568033,0.00009271107,0.00002465916],"category_scores_gemma":[0.0001448137,0.0001853168,0.00005842638,0.002605849,0.002686503,0.001032587,0.0009781066,0.0004030378,0.0001898785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002725964,"about_ca_system_score_gemma":0.0003418975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006224529,"about_ca_topic_score_gemma":0.000003271454,"domain_scores_codex":[0.9963211,0.00002483949,0.000354915,0.001055924,0.0007296334,0.001513587],"domain_scores_gemma":[0.9988254,0.0000630886,0.00009947997,0.0004202607,0.0003708163,0.0002209025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005209031,0.0000465236,0.0003563105,0.00000638671,0.000002466304,0.000003259356,0.0007017007,6.527156e-7,0.0003753973,0.9708875,0.00006987913,0.02754471],"study_design_scores_gemma":[0.0002749689,0.0008130015,0.0004411536,0.000009030507,0.000001937889,0.00009416969,0.0000114805,0.1572501,0.007377589,0.8302208,0.003207562,0.0002981552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02139224,0.00009005568,0.9448469,0.0008135977,0.0007863097,0.0002777212,5.025651e-8,0.0003914584,0.0314017],"genre_scores_gemma":[0.9825808,0.000006456759,0.01636159,0.0005004745,0.0004878603,0.00001969442,1.383285e-7,0.00001047893,0.00003249706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9611886,"threshold_uncertainty_score":0.9898533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3108616151","doi":"10.4204/eptcs.329.1","title":"How to Formally Model Human in Collaborative Robotics","year":2020,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Robotics; Robot; Workspace; Artificial intelligence; Computer science; Human–robot interaction; Human–computer interaction; Risk analysis (engineering); Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01573372877370271,"gpt":0.277300833355258,"spread":0.2615671045815553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147362,0.000244454,0.0002924541,0.0003814777,0.0002060632,0.0008290237,0.003577765,0.00008465543,0.000001375613],"category_scores_gemma":[0.0004989982,0.0002355078,0.00003499798,0.005552056,0.0006828378,0.002270001,0.001146942,0.0005960719,0.000008796838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004693143,"about_ca_system_score_gemma":0.0004362728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.691199e-7,"about_ca_topic_score_gemma":0.000001963659,"domain_scores_codex":[0.9965906,0.00003857491,0.0003912385,0.001033776,0.0007533733,0.001192496],"domain_scores_gemma":[0.9988655,0.00004833283,0.0001062813,0.0002976411,0.0003439552,0.0003382857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001657025,0.00003003004,0.00006523372,0.00001189441,0.000001190473,0.000002010211,0.002959792,0.007830185,0.003717495,0.979213,0.00002069599,0.006131924],"study_design_scores_gemma":[0.0002517911,0.0005406752,0.0001546453,0.00002427019,0.000001070163,0.000005106828,0.00003331202,0.8035916,0.009532715,0.1855665,0.00005524915,0.0002430562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02053754,0.00002055171,0.9623436,0.01415684,0.00008157913,0.0004921153,4.614921e-7,0.0001494489,0.002217802],"genre_scores_gemma":[0.5598618,0.000002152144,0.4390523,0.001001571,0.00004667511,0.000024698,1.490969e-7,0.000007226652,0.000003410147],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7957614,"threshold_uncertainty_score":0.960373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062936109","doi":"10.4204/eptcs.57.8","title":"Analysis of Non-Linear Probabilistic Hybrid Systems","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford","keywords":"Probabilistic logic; Class (philosophy); Variable (mathematics); Probabilistic analysis of algorithms; Phase portrait; Process (computing); Computer science; Linear approximation; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Nonlinear system; Artificial intelligence; Bifurcation; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0162888522950719,"gpt":0.2676564201870438,"spread":0.2513675678919719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004535983,0.0002059324,0.000438714,0.001040494,0.0001273227,0.0001281397,0.003444729,0.00005832391,0.0000103345],"category_scores_gemma":[0.0003307151,0.0001804165,0.0001010842,0.00659454,0.001664043,0.0009987296,0.0006305444,0.0003369068,0.000008274697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000279516,"about_ca_system_score_gemma":0.000269647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001480509,"about_ca_topic_score_gemma":5.686691e-7,"domain_scores_codex":[0.9967919,0.00004639446,0.0006217754,0.0008936217,0.000746832,0.0008994491],"domain_scores_gemma":[0.9984715,0.00008892487,0.0002509264,0.0005801669,0.0004588166,0.000149671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001262725,0.0001007777,0.000717718,0.00002697109,0.00002766436,0.000001474697,0.0008720456,0.0004212881,0.0004852454,0.9940786,0.000001876118,0.003253702],"study_design_scores_gemma":[0.0001207482,0.000349694,0.004351517,0.00003090179,0.00004110813,0.00001811605,0.00001141169,0.9286829,0.009832373,0.05635821,0.00000787206,0.0001951267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1801093,0.00003372828,0.8157606,0.00001947921,0.000238279,0.0002878792,6.387758e-7,0.00008911849,0.003461067],"genre_scores_gemma":[0.7645832,0.000005575312,0.2353203,0.0000299606,0.00002458417,0.00002721648,3.296616e-7,0.000006288114,0.000002588329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9377204,"threshold_uncertainty_score":0.7357172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394987214","doi":"10.4204/eptcs.402.10","title":"CHC-COMP 2023: Competition Report","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Competition (biology); French horn; Class (philosophy); Computer science; Operations research; Engineering; Sociology; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007252410397899102,"gpt":0.276505250815857,"spread":0.2692528404179579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005416739,0.0002499045,0.0002399771,0.0006299296,0.0002573658,0.001209462,0.002716271,0.0000974635,0.00003336165],"category_scores_gemma":[0.0002684277,0.0002264334,0.00007788172,0.004124702,0.001388677,0.002304049,0.0007605042,0.0007362615,0.0001198254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006793249,"about_ca_system_score_gemma":0.000528986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004400724,"about_ca_topic_score_gemma":8.763806e-7,"domain_scores_codex":[0.9959771,0.00004086886,0.0005371296,0.001349232,0.0009511526,0.001144513],"domain_scores_gemma":[0.9988815,0.0001201357,0.0000887315,0.0005022562,0.0002299221,0.000177494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004425795,0.00003719134,0.00003563533,0.00003193117,0.000003395653,0.00004263132,0.0003344217,0.00002146006,0.001298947,0.9750249,0.00006812618,0.02309697],"study_design_scores_gemma":[0.00007793094,0.0001656563,0.0003061036,0.000100394,0.000002558632,0.0006728234,0.000006225117,0.6161463,0.006054076,0.3745488,0.00169743,0.0002216465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01976401,0.0002526059,0.9605352,0.001300816,0.001276594,0.0002838933,4.365615e-7,0.0006222476,0.01596425],"genre_scores_gemma":[0.74966,0.00002184563,0.2498852,0.0001752258,0.0001814392,0.00003346464,0.000001002747,0.00001183565,0.0000299846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.729896,"threshold_uncertainty_score":0.9998274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029618677","doi":"10.4204/eptcs.31.8","title":"State Complexity of Catenation Combined with Star and Reversal","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Catenation; Combined operations; State (computer science); Continuation; Star (game theory); Computer science; Algorithm; Mathematics; Political science; Chemistry; Programming language; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.005197979451632736,"gpt":0.2117304940349313,"spread":0.2065325145832985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001863685,0.0001659087,0.0002262254,0.0002397243,0.0001523224,0.0002100109,0.001373284,0.00004356598,0.000006846815],"category_scores_gemma":[0.00006934484,0.0001271877,0.00002007316,0.001168284,0.003735062,0.0009086076,0.0005103669,0.0004535319,0.000001642722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006354681,"about_ca_system_score_gemma":0.0002075444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001014769,"about_ca_topic_score_gemma":0.00001180405,"domain_scores_codex":[0.9979643,0.00001720667,0.0002593856,0.0006052356,0.0005085904,0.0006452794],"domain_scores_gemma":[0.9991655,0.00009110605,0.0001220896,0.0002558239,0.0002332079,0.000132279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003739704,0.00005750451,0.0005316274,0.00001470874,0.000002925748,0.000001729708,0.0006102658,0.000002931055,0.01122074,0.9823444,0.000004127718,0.00517167],"study_design_scores_gemma":[0.0005012217,0.0007566999,0.00714423,0.00002949002,0.00000239963,0.00005288274,0.00001200992,0.3197439,0.02477163,0.6467859,0.00001552889,0.0001841356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8566418,0.0000139033,0.1416784,0.0008136101,0.00009722924,0.0001877594,7.135545e-7,0.00009448456,0.0004721262],"genre_scores_gemma":[0.9413003,0.000005915893,0.05853767,0.0001217997,0.0000184793,0.000006138125,3.50797e-7,0.000006756865,0.000002545519],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3355585,"threshold_uncertainty_score":0.9989762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062744773","doi":"10.4204/eptcs.24.6","title":"Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Ergodic theory; Computable analysis; Computable number; Invariant measure; Invariant (physics); Dynamical systems theory; Pseudorandom number generator; Metric space; Computable function","retraction":null,"screen_n_in":null,"score":{"opus":0.003661521673900922,"gpt":0.2232164987631307,"spread":0.2195549770892298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.006496115,0.0003225796,0.000692067,0.0004678495,0.0001868287,0.0002836848,0.003505723,0.0001351933,0.000007138921],"category_scores_gemma":[0.00045056,0.0002453997,0.00007814567,0.003029747,0.004222062,0.0006329981,0.002001818,0.001074994,0.000002021764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001557636,"about_ca_system_score_gemma":0.0003623662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007399388,"about_ca_topic_score_gemma":0.00001264602,"domain_scores_codex":[0.9956617,0.0001198333,0.0009906261,0.001102344,0.0009690871,0.00115643],"domain_scores_gemma":[0.9975361,0.0009787587,0.0003317609,0.0005535717,0.0004242672,0.0001755116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003089362,0.0001669539,0.0112268,0.00008811188,0.00000605405,0.000005635912,0.0009675708,0.001295768,0.003645427,0.9779972,0.00000311883,0.004566417],"study_design_scores_gemma":[0.0007799601,0.0002828786,0.009174676,0.0001010793,0.000004035581,0.0001749135,0.00003876448,0.8799568,0.002274849,0.1069735,0.000007185561,0.0002313725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6899687,0.0001525516,0.3082107,0.0004160439,0.0004950731,0.0004535477,6.671087e-7,0.00005608942,0.0002465935],"genre_scores_gemma":[0.9794701,0.00002699099,0.02035882,0.00005832794,0.00006724099,0.000005338664,2.546328e-7,0.00001131112,0.000001640601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.878661,"threshold_uncertainty_score":0.9999998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2563256558","doi":"10.4204/eptcs.236.6","title":"Picturing Indefinite Causal Structure","year":2017,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Commission; McGill University","keywords":"Causality (physics); Separable space; Equivalence (formal languages); Characterization (materials science); Causal structure; Diagrammatic reasoning; Order (exchange); Computer science; Generalization; Mathematics; Pure mathematics; Physics; Economics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.006052872662043915,"gpt":0.2495472309305121,"spread":0.2434943582684682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004489905,0.0001412031,0.0001384632,0.00008615305,0.0008111724,0.0005527984,0.001297957,0.00003308146,0.00009812992],"category_scores_gemma":[0.00001922057,0.0001228763,0.00003436362,0.0002138172,0.0007724601,0.0003610721,0.0004364132,0.0004124085,0.0000112395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000659381,"about_ca_system_score_gemma":0.0001319005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008367253,"about_ca_topic_score_gemma":0.000001085761,"domain_scores_codex":[0.9984291,0.000003651322,0.0001656691,0.0004615587,0.0002619961,0.0006780493],"domain_scores_gemma":[0.9993899,0.00002061509,0.0001068313,0.0002956181,0.00008227787,0.0001047836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002923227,0.00002145008,0.002417573,0.000002173379,0.000002772474,2.385254e-7,0.00009761511,0.000003135333,0.001524949,0.9912463,0.000007611811,0.004673257],"study_design_scores_gemma":[0.0001877478,0.00005150901,0.00251226,0.00001596506,0.000003757579,0.00000272455,0.00001195652,0.04441004,0.009362784,0.9431635,0.0001243107,0.00015348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9111459,0.000008836525,0.0804014,0.0005794231,0.0001464763,0.0001697496,0.000003857565,0.00003327467,0.007511039],"genre_scores_gemma":[0.9984366,0.000001085644,0.001226737,0.00004920478,0.0002565625,0.00001431266,9.427399e-7,0.000009737068,0.000004824096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08729064,"threshold_uncertainty_score":0.6238964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388667449","doi":"10.4204/eptcs.394.18","title":"Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Controlled NOT gate; Qubit; Quantum circuit; Computer science; Quantum; Physics; Topology (electrical circuits); Quantum gate; Quantum error correction; Quantum mechanics; Electrical engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.006984824673843871,"gpt":0.2344121889240587,"spread":0.2274273642502148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003098265,0.0003234277,0.0003606913,0.0006446027,0.0007007231,0.0006703505,0.002508519,0.00008511103,0.000002810722],"category_scores_gemma":[0.0002956121,0.0002649001,0.00008459496,0.004257158,0.0009112277,0.0006444113,0.0006373667,0.0004955071,0.00001780674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003118366,"about_ca_system_score_gemma":0.000365189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002705318,"about_ca_topic_score_gemma":0.00000212,"domain_scores_codex":[0.9956909,0.00003070865,0.0004167302,0.001299022,0.0007976551,0.001764956],"domain_scores_gemma":[0.9983627,0.0006617496,0.0001615611,0.0003729048,0.0002594662,0.000181634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001734057,0.00003807652,0.0001665328,0.00002816147,0.000006815534,0.000004601494,0.0007104719,0.002736263,0.0006998472,0.9593244,0.00001437141,0.03625317],"study_design_scores_gemma":[0.0002766235,0.0003776805,0.001475486,0.0001246028,0.00000487451,0.00005493478,0.00001843148,0.7726675,0.001123873,0.2235244,0.00004360517,0.0003080499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2048315,0.00002091943,0.7920173,0.001525719,0.0002189707,0.0004502478,0.000002061191,0.0006454496,0.0002877736],"genre_scores_gemma":[0.9549712,0.000005881065,0.04465543,0.0001644278,0.00008859528,0.00008035274,0.000001769803,0.00002619933,0.00000616844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7699312,"threshold_uncertainty_score":0.9999803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2734725460","doi":"10.4204/eptcs.266.18","title":"The Category CNOT","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Commutative property; Vector space; Enriched category; Set (abstract data type); Algebra over a field; Category of groups; Closed category","retraction":null,"screen_n_in":null,"score":{"opus":0.009449337264278233,"gpt":0.2734722393144782,"spread":0.2640229020502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00189899,0.0001549048,0.0001528437,0.00007815782,0.000680737,0.0002637388,0.00139927,0.00006074031,0.00002868291],"category_scores_gemma":[0.0004209513,0.00009708061,0.00004107343,0.0008306735,0.003824741,0.0001971349,0.0003927179,0.0003724388,0.00001428488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000209915,"about_ca_system_score_gemma":0.0002174864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002215304,"about_ca_topic_score_gemma":0.000002821552,"domain_scores_codex":[0.9977651,0.00001564727,0.000254962,0.0004432411,0.0005376539,0.0009834282],"domain_scores_gemma":[0.9990926,0.0002658129,0.00007124354,0.0002330626,0.0002384955,0.00009878929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002109014,0.00001616725,0.00003286573,0.000003481733,0.000002824937,3.53759e-7,0.0003834453,1.519237e-7,0.0001048568,0.9957555,0.0001411891,0.003538105],"study_design_scores_gemma":[0.0001781907,0.0003001917,0.00009007098,0.00001340878,0.000003689674,0.00001808685,0.00002575091,0.0104322,0.003983087,0.9844218,0.0003967175,0.0001368387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9548064,0.0001014211,0.02403219,0.001324582,0.001196615,0.0003511908,1.24294e-7,0.0001546866,0.01803274],"genre_scores_gemma":[0.9977896,0.000008638335,0.001481715,0.0001739783,0.0004962018,0.00001487198,3.629966e-8,0.00001274413,0.00002220953],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04298316,"threshold_uncertainty_score":0.9988863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2219497026","doi":"10.4204/eptcs.185.2","title":"An Open Challenge Problem Repository for Systems Supporting Binders","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Ottawa","funders":"","keywords":"Computer science; Variety (cybernetics); Set (abstract data type); Field (mathematics); Syntax; Software engineering; Key (lock); Data science; Programming language; Artificial intelligence; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02314822109730651,"gpt":0.2881608817737966,"spread":0.2650126606764901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.007910719,0.000277548,0.0003909156,0.0002684114,0.0004232186,0.002694251,0.006240113,0.0001247407,8.210556e-7],"category_scores_gemma":[0.0001356328,0.0002314968,0.00004884982,0.001207639,0.000767962,0.002609682,0.001134285,0.0003487192,0.000007818887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005256459,"about_ca_system_score_gemma":0.000985416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004295391,"about_ca_topic_score_gemma":0.000003754184,"domain_scores_codex":[0.995534,0.00006282503,0.0006204183,0.001376761,0.0007888834,0.001617099],"domain_scores_gemma":[0.9980453,0.00008222948,0.0002887073,0.0005170677,0.000589781,0.0004768744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001848053,0.0001430045,0.0002082648,0.00004257312,0.000005420839,0.000005639519,0.001893546,0.00006613986,0.0002640719,0.9913339,0.00008286806,0.005936118],"study_design_scores_gemma":[0.0006904205,0.00238522,0.00002200503,0.00002353175,0.00000435935,0.0001327252,0.0002141806,0.4730845,0.001079143,0.5207865,0.001202403,0.0003750951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008206698,0.0002203556,0.971136,0.0005694878,0.0009272064,0.001938712,2.133525e-7,0.0003646277,0.01663668],"genre_scores_gemma":[0.9755665,0.000003029329,0.02375042,0.0001014207,0.0002664582,0.0002561996,8.980799e-7,0.00001989946,0.00003514067],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9673598,"threshold_uncertainty_score":0.9991366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386095606","doi":"10.4204/eptcs.384.1","title":"Graphical CSS Code Transformation Using ZX Calculus","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Clarendon Fund; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Ministry of Colleges and Universities","keywords":"Transformation (genetics); Code (set theory); Computer science; Programming language; Calculus (dental); Mathematics; Algebra over a field; Arithmetic; Pure mathematics; Chemistry; Dentistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01129253635800418,"gpt":0.2745351148492931,"spread":0.2632425784912889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004402493,0.0002253729,0.0002346402,0.0007630782,0.0006136079,0.0007086396,0.00219259,0.0001031014,0.000003682153],"category_scores_gemma":[0.0001800438,0.0002055261,0.00008231009,0.005543127,0.001019525,0.001283694,0.0004676856,0.0009097647,0.00003162158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002962704,"about_ca_system_score_gemma":0.0002630614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009519624,"about_ca_topic_score_gemma":0.000001885647,"domain_scores_codex":[0.9962695,0.00005464582,0.0003849599,0.0008526064,0.0008661912,0.001572048],"domain_scores_gemma":[0.9991917,0.0001186956,0.00008279578,0.0002645521,0.0001329788,0.000209249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005701917,0.00003061403,0.0001505637,0.00001319809,0.000002660971,0.000007060143,0.002424158,0.0004773338,0.0006882517,0.929576,0.000008372627,0.06661604],"study_design_scores_gemma":[0.0002837789,0.00021125,0.0007903844,0.00005913166,0.000003481811,0.00008398674,0.00004137553,0.9316376,0.0009233336,0.06468559,0.001000846,0.0002791813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2429006,0.00002767237,0.7541915,0.001331196,0.0002459507,0.0001749426,2.215481e-7,0.0007655545,0.0003623198],"genre_scores_gemma":[0.9652327,0.000009575705,0.03447522,0.0001642226,0.00008519757,0.00001407677,7.205859e-7,0.00001373625,0.000004589627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9311603,"threshold_uncertainty_score":0.8381111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2803006329","doi":"10.4204/eptcs.270.2","title":"Using Elm to Introduce Algebraic Thinking to K-8 Students","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Curriculum; Computer graphics; Syntax; Graphics; Domain (mathematical analysis); Focus (optics); Recursion (computer science); Inclusion (mineral)","retraction":null,"screen_n_in":null,"score":{"opus":0.01075330660325884,"gpt":0.3088138043659593,"spread":0.2980604977627005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005942356,0.0002951869,0.0002886472,0.0007707495,0.0008561134,0.001791038,0.006204195,0.00007317774,0.000009002537],"category_scores_gemma":[0.0005690402,0.0002756389,0.00005189407,0.004480008,0.0007316066,0.000889552,0.003098374,0.0007377336,0.0001099025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006393164,"about_ca_system_score_gemma":0.0002820692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001584234,"about_ca_topic_score_gemma":0.000003299365,"domain_scores_codex":[0.9946634,0.00005797243,0.0003945379,0.001540616,0.001423896,0.001919597],"domain_scores_gemma":[0.9985437,0.00007938314,0.00008728985,0.0005076287,0.0003265179,0.0004554782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001392906,0.00006933663,0.001159212,0.000005202338,0.000004427583,0.000002908008,0.007811329,0.00011744,0.001479537,0.9307945,0.00004425754,0.05849791],"study_design_scores_gemma":[0.001419212,0.007026182,0.01091168,0.0008697929,0.00002492063,0.0004088432,0.0002371371,0.6368842,0.02622964,0.2959563,0.01722202,0.002810186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3838692,0.00001408779,0.6136193,0.001256411,0.0004083082,0.0002557957,5.301633e-8,0.0002735404,0.0003033531],"genre_scores_gemma":[0.6721051,4.728496e-7,0.3261056,0.001398695,0.00035602,0.00001131623,5.918116e-8,0.00001415614,0.000008508488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6367667,"threshold_uncertainty_score":0.9999696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056248271","doi":"10.4204/eptcs.122.1","title":"Formal Probabilistic Analysis of a Wireless Sensor Network for Forest Fire Detection","year":2013,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Wireless sensor network; Probabilistic logic; Scheduling (production processes); Fire detection; Disjoint sets; Probabilistic analysis of algorithms; Upper and lower bounds; Efficient energy use","retraction":null,"screen_n_in":null,"score":{"opus":0.004363880737275489,"gpt":0.2098156737022676,"spread":0.2054517929649921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001954017,0.0003002529,0.0005469765,0.0005629309,0.0003574163,0.0003715346,0.002204983,0.0001381762,0.000007826328],"category_scores_gemma":[0.0001686855,0.0002657914,0.0002050556,0.007367231,0.001260201,0.00123124,0.0005900546,0.0003676504,0.000003585268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003387638,"about_ca_system_score_gemma":0.0001727915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002470757,"about_ca_topic_score_gemma":0.00003560019,"domain_scores_codex":[0.9956542,0.00003373706,0.0006607639,0.001069439,0.0007037686,0.001878083],"domain_scores_gemma":[0.9979529,0.0004328638,0.0002764718,0.0004526084,0.0006870152,0.0001981226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001967423,0.00008391048,0.0007086006,0.00002613345,0.00004191005,4.745478e-7,0.0002060243,0.1089044,0.0007630333,0.8664415,0.00001015351,0.02279419],"study_design_scores_gemma":[0.0002839874,0.000483095,0.003801693,0.00004361531,0.00005164818,0.00001038494,0.000009048726,0.9321788,0.001852664,0.060986,0.00001375791,0.0002853109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4465919,0.00002709536,0.552371,0.0001371407,0.0001481536,0.0004763201,4.78879e-7,0.00009882383,0.0001490548],"genre_scores_gemma":[0.9509242,0.000008462789,0.04863543,0.0001127305,0.0001271589,0.0001686894,0.00000161712,0.00001604808,0.000005635082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8232744,"threshold_uncertainty_score":0.9999794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007252203","doi":"10.4204/eptcs.31.3","title":"L-systems in Geometric Modeling","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Geometric design; Context (archaeology); Parametric equation; Bézier curve; Geometric modeling; Subdivision; Parametric statistics; Interpretation (philosophy); Computer science; Parametric model; Mathematics; Algorithm; Geometry; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.003667448773009969,"gpt":0.2219284354216459,"spread":0.2182609866486359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176427,0.0001678162,0.0002399797,0.0009106816,0.00005707801,0.000122315,0.0008226003,0.00008275354,0.00001016062],"category_scores_gemma":[0.0001432777,0.0001535321,0.00003316225,0.004517149,0.0004545446,0.000452328,0.0001461903,0.000963459,0.000007915359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002750365,"about_ca_system_score_gemma":0.00003931102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006538206,"about_ca_topic_score_gemma":0.000003847967,"domain_scores_codex":[0.9979477,0.00000462268,0.0003286569,0.0004286547,0.0003794308,0.0009109157],"domain_scores_gemma":[0.9995858,0.00005014976,0.00002306672,0.0001499146,0.00008192929,0.0001091254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003465876,0.00002933352,0.0003828396,0.00001495595,0.000001971673,0.000002038518,0.00008413116,0.04222641,0.01153241,0.9346979,0.000004574928,0.01102001],"study_design_scores_gemma":[0.00008388302,0.00004292526,0.00007457109,0.00001699496,0.000001394791,0.00001202327,0.000004723249,0.8719109,0.004124316,0.1235086,0.00004912881,0.0001705821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5189245,0.0001106729,0.4785886,0.00003737086,0.0001203892,0.0001221864,1.185365e-7,0.0002824052,0.001813778],"genre_scores_gemma":[0.9855784,0.00003330583,0.014239,0.00002514473,0.00007325537,0.00003195142,1.943965e-7,0.00001759823,0.000001150306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8296845,"threshold_uncertainty_score":0.6260858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986858569","doi":"10.4204/eptcs.61.2","title":"Specification and Verification of Context-dependent Services","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Formal verification; Formal methods; Formal specification; Model checking; Service (business); Automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.01316253735538987,"gpt":0.2424480778157749,"spread":0.229285540460385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002693072,0.0001400982,0.0001853046,0.0002916334,0.0001144676,0.000116919,0.001778926,0.00006264305,0.000008318293],"category_scores_gemma":[0.00006730847,0.0001300304,0.00002717398,0.001104083,0.001113948,0.001368825,0.000387864,0.0002188325,0.000006271933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336528,"about_ca_system_score_gemma":0.00009459034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001110853,"about_ca_topic_score_gemma":9.727144e-7,"domain_scores_codex":[0.9979466,0.00003152134,0.000389509,0.0006710012,0.0004819707,0.0004793881],"domain_scores_gemma":[0.9990429,0.00003855703,0.0001819774,0.0003846802,0.0002575773,0.00009425985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001509968,0.00005576792,0.0006531675,0.00002525999,0.000002462781,2.177105e-7,0.002443335,0.000001408334,0.002956317,0.9296107,5.091574e-7,0.0642358],"study_design_scores_gemma":[0.0003405502,0.0005160239,0.02881443,0.00006497462,0.000006328177,0.00004090114,0.0001393992,0.4205707,0.1572277,0.3919255,0.00007458643,0.0002788657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2251779,0.0002277145,0.7701325,0.00008826503,0.0001555652,0.0002678146,3.019103e-7,0.00008963179,0.003860196],"genre_scores_gemma":[0.7855147,0.00004670197,0.2143438,0.00005412105,0.000019289,0.00001485815,1.739847e-7,0.000004869164,0.000001554259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5603367,"threshold_uncertainty_score":0.5302485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055102535","doi":"10.4204/eptcs.13.6","title":"Verifying Real-Time Systems using Explicit-time Description Methods","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Process (computing); Modularity (biology); Rotation formalisms in three dimensions; Synchronization (alternating current); Model checking; Rendezvous; Semaphore; Asynchronous communication","retraction":null,"screen_n_in":null,"score":{"opus":0.02040135599401856,"gpt":0.319022635246982,"spread":0.2986212792529634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009158017,0.0003459638,0.0004400417,0.0006377742,0.0004681787,0.001132307,0.003185112,0.0001566656,0.000009560172],"category_scores_gemma":[0.0003870013,0.0003307269,0.00007932509,0.003467491,0.000668012,0.003238748,0.000513279,0.0005663034,0.00004401069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152104,"about_ca_system_score_gemma":0.0003303506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008054637,"about_ca_topic_score_gemma":3.772426e-8,"domain_scores_codex":[0.9953965,0.0002044191,0.0006750887,0.001275786,0.0008788636,0.001569376],"domain_scores_gemma":[0.9984178,0.0001449856,0.0002565205,0.0005926925,0.0003454974,0.0002425022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000121406,0.00004548062,0.000009242552,0.000009376062,0.000002241575,0.000001519448,0.0003580636,0.0002587566,0.176878,0.799394,0.000008834569,0.02302227],"study_design_scores_gemma":[0.0001897149,0.000487673,0.0002405577,0.00009128092,0.000005488732,0.000127677,0.00001060334,0.8653564,0.02542162,0.1076767,0.00004501704,0.0003473412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09468475,0.00009549349,0.900193,0.0001483554,0.0003926718,0.0004181103,2.010359e-7,0.0004254597,0.00364198],"genre_scores_gemma":[0.4617221,0.00001467221,0.5380511,0.00008294488,0.00009921555,0.0000110148,2.632632e-7,0.000009945995,0.000008781411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8650976,"threshold_uncertainty_score":0.9999145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2581616143","doi":"10.4204/eptcs.95.16","title":"Symmetry constraints on temporal order in measurement-based quantum computation","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Randomness; Computation; Quantum; State (computer science); Symmetry (geometry); Quantum state; Outcome (game theory); Quantum operation; Transformation (genetics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01242068531893349,"gpt":0.2494952600691535,"spread":0.23707457475022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004918619,0.0002557561,0.000245454,0.001066605,0.0001921807,0.0003531837,0.001385473,0.00008898817,0.00002011485],"category_scores_gemma":[0.0002099598,0.000229629,0.00005885611,0.004359656,0.001281935,0.001671577,0.00020052,0.0005554212,0.00004628658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000503465,"about_ca_system_score_gemma":0.0004537603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003256685,"about_ca_topic_score_gemma":0.000001432174,"domain_scores_codex":[0.9961147,0.00005076765,0.0005208215,0.0005441699,0.001360281,0.001409288],"domain_scores_gemma":[0.99894,0.00009897108,0.0001459314,0.0002163255,0.0003526745,0.0002460816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001718206,0.0002186587,0.003155453,0.00001476382,0.000002174486,9.134504e-7,0.00043722,0.0001089775,0.000136485,0.9788562,0.0000330667,0.01701889],"study_design_scores_gemma":[0.000969323,0.0004329333,0.00853298,0.0001158147,0.000002031225,0.0000186061,0.00004907894,0.873611,0.003028504,0.1127659,0.00008415795,0.0003896324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1498106,0.00004940065,0.84326,0.0008452777,0.0003865432,0.000329646,3.620233e-7,0.0001771294,0.005140977],"genre_scores_gemma":[0.9778973,0.000002323788,0.02077773,0.001239741,0.00005009605,0.00002301674,8.535771e-7,0.000008619966,2.578786e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.873502,"threshold_uncertainty_score":0.9363999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141280064","doi":"10.4204/eptcs.171.7","title":"Completely positive projections and biproducts","year":2014,"lang":"en","type":"preprint","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Embedding; Equivalence (formal languages); Categorical variable; Pure mathematics; Quantum; Theoretical physics; Mathematics; Computer science; Algebra over a field; Discrete mathematics; Quantum mechanics; Physics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007197205011977849,"gpt":0.2504117138744894,"spread":0.2432145088625115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001013634,0.0002774002,0.0003085371,0.0002366506,0.0003488582,0.0003835094,0.000768385,0.00007396631,0.00002986563],"category_scores_gemma":[0.00002043546,0.0002587617,0.00005504328,0.0006287366,0.001150203,0.000125729,0.001219131,0.0009937609,0.000009223446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000123324,"about_ca_system_score_gemma":0.0003326575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000254009,"about_ca_topic_score_gemma":7.113925e-7,"domain_scores_codex":[0.9975321,0.00001678935,0.0002915382,0.001092108,0.0003113158,0.00075617],"domain_scores_gemma":[0.9991742,0.00005749713,0.0001393936,0.0002506266,0.0002410562,0.0001372723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004345698,0.00006962269,0.000142838,0.00001682447,0.000008641768,1.070118e-7,0.0002013842,0.00001175377,0.000294394,0.9943227,0.00004036223,0.004887007],"study_design_scores_gemma":[0.0001234357,0.0001107518,0.000338862,0.000078099,0.00001225641,0.000004716104,0.00001629581,0.1827175,0.001602571,0.8145466,0.0001946154,0.000254334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5558485,0.00007273394,0.4343919,0.002271063,0.000315437,0.00104968,0.00002096158,0.0001024122,0.005927285],"genre_scores_gemma":[0.9959552,0.000007425833,0.003310215,0.00009495176,0.0004123171,0.0001878953,0.000008119102,0.0000187063,0.000005149594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4401067,"threshold_uncertainty_score":0.9999865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997470409","doi":"10.4204/eptcs.17.6","title":"Virtual Machine Support for Many-Core Architectures: Decoupling Abstract from Concrete Concurrency Models","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Concurrency; Non-lock concurrency control; Isolation (microbiology); Concurrent computing; Distributed concurrency control; Abstraction; Virtual machine; Multiversion concurrency control; Concurrent object-oriented programming; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.0126023249041503,"gpt":0.2592350687552572,"spread":0.2466327438511069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002643755,0.0003965526,0.0004456264,0.0003032986,0.0004145239,0.0007561784,0.003757998,0.0001878797,0.00003365488],"category_scores_gemma":[0.0002308649,0.0003286725,0.0001390316,0.0008626996,0.001436758,0.0007838083,0.0007008446,0.001111008,0.00001950015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001387206,"about_ca_system_score_gemma":0.0005367353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002819749,"about_ca_topic_score_gemma":0.0000126213,"domain_scores_codex":[0.9955202,0.00001076842,0.0006115776,0.001442105,0.0007713043,0.001644061],"domain_scores_gemma":[0.9982597,0.0003748626,0.0002232488,0.0004977381,0.0003038589,0.0003405811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000023774,0.00002697101,0.0001912087,0.00001523622,0.00000857563,0.000004484125,0.0009328018,0.00007268436,0.00388699,0.9697874,0.00001888781,0.02503104],"study_design_scores_gemma":[0.000427111,0.0004007735,0.00009067423,0.000008612579,0.000004497051,0.00003630901,0.0000087892,0.5022068,0.003538705,0.4927513,0.0002491492,0.0002772232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1702576,0.00008621893,0.8256195,0.0001935779,0.001038614,0.0006257469,0.000003651192,0.0002711001,0.00190403],"genre_scores_gemma":[0.9661516,0.000006692421,0.0330734,0.0002686448,0.0003772179,0.00008145851,0.00000531774,0.00002331846,0.0000123746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.795894,"threshold_uncertainty_score":0.9999166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072635954","doi":"10.4204/eptcs.34.3","title":"Explicit Substitutions for Contextual Type Theory","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Soundness; Substitution (logic); Normalization (sociology); Type (biology); Type theory; Modal; Computer science; Type inference; Mathematics; Inference; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01084458306697359,"gpt":0.2559854188274706,"spread":0.245140835760497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003399029,0.0002190236,0.0002434163,0.0002560406,0.0004523146,0.0005702792,0.002710749,0.0001182414,0.00001837402],"category_scores_gemma":[0.0004746129,0.0001784691,0.00007441711,0.001510016,0.001453462,0.0008425851,0.0004463952,0.0005678009,0.0000368256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251982,"about_ca_system_score_gemma":0.0004592282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004045221,"about_ca_topic_score_gemma":0.000009612428,"domain_scores_codex":[0.9971203,0.00002084457,0.0003286894,0.0008731076,0.0004425862,0.001214462],"domain_scores_gemma":[0.9986379,0.0002471919,0.00009565343,0.0003832161,0.0004344644,0.0002015413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001753695,0.00006678034,0.0001416963,0.000009426729,0.000004006353,0.000001274648,0.0005115049,0.000001956136,0.003369773,0.9822531,0.0000432392,0.0135797],"study_design_scores_gemma":[0.0003830515,0.0004655772,0.0001824138,0.000005311158,0.000003987667,0.0000597991,0.0000224899,0.06355185,0.005765568,0.9259307,0.003358515,0.0002707169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03832665,0.00007481485,0.953023,0.0004222697,0.001259234,0.000558226,2.657409e-7,0.0002664957,0.006069042],"genre_scores_gemma":[0.9817435,0.000004361799,0.01757787,0.0002718203,0.0002719079,0.00007799068,5.902337e-7,0.00001090227,0.00004107995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9434168,"threshold_uncertainty_score":0.7277761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388652902","doi":"10.4204/eptcs.394.2","title":"Generators and Relations for 2-Qubit Clifford+T Operators","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Qubit; Mathematics; Computer science; Physics; Quantum; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.005236406282705447,"gpt":0.2392558016829437,"spread":0.2340193954002383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127414,0.0002094176,0.0002151314,0.0005171269,0.0006573764,0.0005811231,0.00143024,0.00007398851,0.00000246314],"category_scores_gemma":[0.0001906985,0.00017977,0.00005155609,0.003248355,0.000851242,0.0005401146,0.0007902469,0.0003662441,0.00001293629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001185481,"about_ca_system_score_gemma":0.00025481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001306998,"about_ca_topic_score_gemma":8.215852e-7,"domain_scores_codex":[0.9971744,0.00001711389,0.0003019475,0.0009422576,0.0004027052,0.001161521],"domain_scores_gemma":[0.999139,0.0002144146,0.0000607739,0.0002304963,0.0001598602,0.0001954245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003471162,0.00001629999,0.0002785891,0.000008730647,0.000002843329,0.000001618009,0.0005826969,0.0005590752,0.0004152401,0.9715014,0.0001396454,0.0264904],"study_design_scores_gemma":[0.0002398977,0.0002308675,0.0008196238,0.00002271625,0.000001810365,0.00002529995,0.000009130841,0.7332126,0.00107105,0.2637662,0.0004131533,0.0001876668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4928974,0.00006876262,0.5030195,0.002623853,0.0003198866,0.0003610259,0.000001068973,0.0004149523,0.0002936107],"genre_scores_gemma":[0.9220425,0.00001525027,0.07739184,0.0003224285,0.0001565083,0.00004389717,7.979621e-7,0.00001353775,0.00001317395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7326536,"threshold_uncertainty_score":0.733081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396945312","doi":"10.4204/eptcs.406.2","title":"Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits","year":2024,"lang":"en","type":"preprint","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Catalytic Cross-Coupling Reactions","field":"Chemistry","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Electronic circuit; Computer science; Mathematics; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007500263343795225,"gpt":0.2688134216711506,"spread":0.2613131583273554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001880249,0.0005341872,0.0007599855,0.0006130651,0.0001602538,0.0005175617,0.002487479,0.0004679826,0.0001610556],"category_scores_gemma":[0.0009197835,0.0005271407,0.0002912688,0.001128042,0.003602615,0.0001612652,0.003242484,0.002880854,0.00004069731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001659,"about_ca_system_score_gemma":0.001410481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003166858,"about_ca_topic_score_gemma":0.000003560864,"domain_scores_codex":[0.9949849,0.000001529637,0.0008928571,0.001764582,0.0009826245,0.001373482],"domain_scores_gemma":[0.9979528,0.0005129353,0.0003153839,0.0006694698,0.0003363862,0.0002130613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004679403,0.0003357953,0.0003247816,0.002085598,0.00007376466,0.00001459304,0.0007405243,0.0001907057,0.1975886,0.7798625,0.00005175037,0.01868457],"study_design_scores_gemma":[0.000204586,0.00004467875,0.00008689397,0.001706779,0.00008406381,0.00009251771,0.00003448798,0.1646324,0.5509521,0.2815608,0.00005155531,0.0005491181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9908862,0.0004263898,0.0009038175,0.0002899657,0.0004959996,0.0003086614,0.00003108051,0.0003413861,0.006316525],"genre_scores_gemma":[0.9988695,0.0001052159,0.000413165,0.00002046915,0.000344743,0.0001360215,0.000004597995,0.00007057407,0.00003564578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4983017,"threshold_uncertainty_score":0.999718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3200821764","doi":"10.4204/eptcs.343.2","title":"Generators and Relations for Real Stabilizer Operators","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Stabilizer (aeronautics); Set (abstract data type); Operator (biology); Hadamard transform; Pauli exclusion principle; Electronic circuit; Real number; Tensor (intrinsic definition)","retraction":null,"screen_n_in":null,"score":{"opus":0.004367914828980769,"gpt":0.2321516839981695,"spread":0.2277837691691887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360518,0.0001921361,0.0002170147,0.0001939345,0.0004938574,0.0006043451,0.000958084,0.00006952717,0.000005685838],"category_scores_gemma":[0.000202721,0.0001694132,0.00004993006,0.001658946,0.0007902941,0.0005029432,0.0007243237,0.0003561644,0.0000022033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000154812,"about_ca_system_score_gemma":0.000588044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001763092,"about_ca_topic_score_gemma":0.000002381196,"domain_scores_codex":[0.9974125,0.00002637376,0.00028899,0.001002175,0.0003681772,0.0009017609],"domain_scores_gemma":[0.9989927,0.0001909467,0.00005418186,0.0002552149,0.000319281,0.0001876202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003167498,0.00003597608,0.0003825984,0.000008500549,0.000003140851,0.000003055296,0.0006043654,0.0002418534,0.001563034,0.9800988,0.00002906139,0.01702645],"study_design_scores_gemma":[0.0002963504,0.0001902814,0.0007941765,0.00002425536,0.000002752561,0.00007164695,0.00001450915,0.752474,0.006706106,0.2389413,0.0002733759,0.000211277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4968693,0.0001516605,0.500252,0.001671027,0.0002163431,0.0001851035,8.157671e-7,0.0001213244,0.0005324499],"genre_scores_gemma":[0.8102351,0.00002353058,0.1893279,0.0002648978,0.0001116223,0.00001859709,5.296453e-7,0.000009472371,0.000008370206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7522321,"threshold_uncertainty_score":0.6908472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3174770175","doi":"10.4204/eptcs.343.11","title":"Generators and Relations for the Group On(Z[1/2])","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Integer (computer science); Mathematics; Group (periodic table); Prime power; Toffoli gate; Dimension (graph theory); Order (exchange); Discrete mathematics; Root of unity; Prime (order theory); Quantum gate; Physics; Quantum computer; Quantum; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.004478205023977122,"gpt":0.2232835871599188,"spread":0.2188053821359417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413367,0.0001579137,0.0001439439,0.0001285962,0.000722575,0.000575451,0.001202246,0.00004653749,0.000003135027],"category_scores_gemma":[0.0002183797,0.0001087721,0.000048719,0.001401267,0.0008294893,0.0002561955,0.0005849242,0.0004125487,0.000002836061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009305691,"about_ca_system_score_gemma":0.0002212655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.012694e-7,"about_ca_topic_score_gemma":0.000001241881,"domain_scores_codex":[0.9979177,0.00002057553,0.0002034322,0.0007649924,0.0003640834,0.0007292803],"domain_scores_gemma":[0.9988742,0.0005394328,0.00004968699,0.0002730089,0.0001571086,0.00010651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003281604,0.00002986762,0.00005198745,0.000003714626,0.000003374537,0.000001795418,0.0002998242,0.0004125166,0.0002909618,0.9542026,0.00005035978,0.04464975],"study_design_scores_gemma":[0.0001873691,0.0001968861,0.000723905,0.00001971118,0.000002407175,0.00005925352,0.000007713099,0.7087705,0.001400174,0.2878296,0.000681978,0.0001205237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1030259,0.000351654,0.8884693,0.007084263,0.0003136148,0.0002247454,5.443131e-7,0.0001015384,0.0004284341],"genre_scores_gemma":[0.9104066,0.0000189018,0.08835824,0.001015428,0.0001599876,0.00002510709,2.576306e-7,0.000007521361,0.00000796753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8073807,"threshold_uncertainty_score":0.5557536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388667510","doi":"10.4204/eptcs.394.17","title":"Symbolic Synthesis of Clifford Circuits and Beyond","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; McGill University; Simon Fraser University","funders":"","keywords":"Electronic circuit; Computer science; Theoretical computer science; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.00466237897613747,"gpt":0.2245449037376794,"spread":0.219882524761542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002355705,0.0002078116,0.0003209017,0.0006608589,0.0002431255,0.0002406969,0.001985065,0.00006856534,0.000002551982],"category_scores_gemma":[0.0002690519,0.0001789004,0.00005278062,0.003926515,0.001488282,0.0004071241,0.001180803,0.0003791472,0.000008680699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006977327,"about_ca_system_score_gemma":0.0001943627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002095389,"about_ca_topic_score_gemma":3.709098e-7,"domain_scores_codex":[0.9970406,0.00002547831,0.0003604304,0.0008489217,0.0006188033,0.001105767],"domain_scores_gemma":[0.9989461,0.0003576815,0.0001044038,0.0002875346,0.0001341028,0.0001701953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002028213,0.00002486341,0.0002710119,0.00002442809,0.000003375942,0.00000366315,0.0007030701,0.00008312208,0.0009682769,0.8592544,0.00001498149,0.1386468],"study_design_scores_gemma":[0.0001307801,0.0001896827,0.003009198,0.0000622322,0.000002654798,0.00005747324,0.00001400063,0.6951214,0.007501437,0.2936899,0.00003562836,0.0001856399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8712371,0.0001077435,0.1236827,0.001634795,0.0002487794,0.0002231273,9.578054e-7,0.0003752204,0.002489592],"genre_scores_gemma":[0.9887525,0.00004108222,0.0109581,0.000151779,0.00006864461,0.00001309374,1.464687e-7,0.00001088792,0.000003708049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6950383,"threshold_uncertainty_score":0.7295347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3209644401","doi":"10.4204/eptcs.351.5","title":"A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Nautical Research Society","funders":"Conseil Régional, Île-de-France","keywords":"Mathematics; Finitary; Cartesian closed category; Type (biology); Homotopy; Algebra over a field; Pure mathematics; Closure (psychology); Type theory; Polynomial; Categorical variable; Functor; Generalization; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01059184188387806,"gpt":0.2753249278970062,"spread":0.2647330860131281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002542599,0.0001907855,0.0004175592,0.0003259407,0.0000845972,0.00003458563,0.0008061604,0.0001676547,0.0002072213],"category_scores_gemma":[0.001017794,0.0001733797,0.00006236797,0.001833816,0.002847505,0.0001648074,0.0003454431,0.0006140135,0.0000086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002075949,"about_ca_system_score_gemma":0.0007629028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000328909,"about_ca_topic_score_gemma":0.0000131095,"domain_scores_codex":[0.9975597,0.0001045425,0.0004751415,0.0006096313,0.0003163179,0.0009346387],"domain_scores_gemma":[0.9988421,0.00049484,0.0001057878,0.0002622407,0.0001954222,0.00009967091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000789496,0.0001835966,0.001901473,0.00002905234,0.000007921367,0.00002458653,0.001242723,9.502336e-7,0.003464079,0.99079,0.00002869711,0.002247966],"study_design_scores_gemma":[0.0004494312,0.000380319,0.001166201,0.00004328877,0.000009873195,0.0001355788,0.000158723,0.001324412,0.03237824,0.9637304,0.00004122619,0.0001823098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.985823,0.0002006369,0.0061712,0.000534392,0.000289328,0.0001923579,5.415686e-7,0.00005042891,0.006738107],"genre_scores_gemma":[0.9952934,0.00001679457,0.0043667,0.0001812386,0.00007868966,0.00001362383,4.858684e-7,0.0000144839,0.00003460678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02891416,"threshold_uncertainty_score":0.9998662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977514759","doi":"10.4204/eptcs.35.1","title":"Optimizing Computation of Recovery Plans for BPEL Applications","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Liveness; Business Process Execution Language; Computer science; Correctness; Bounded function; Web service; Automaton; Finite-state machine; Computation; Property (philosophy); Distributed computing; Service (business); Model checking; Service-oriented architecture; Programming language; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.003878688703389407,"gpt":0.2373018440889445,"spread":0.2334231553855551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271405,0.0001738046,0.0002185708,0.0003892306,0.0002363042,0.0002110153,0.002222413,0.00008051353,0.000002499337],"category_scores_gemma":[0.00002999873,0.0001577753,0.00006649485,0.00172313,0.0005829478,0.0007145687,0.0004208802,0.0004112113,0.000003066182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005883912,"about_ca_system_score_gemma":0.0002514725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004839813,"about_ca_topic_score_gemma":0.00001630821,"domain_scores_codex":[0.9977756,0.00000975471,0.0003706127,0.0007152845,0.0004077706,0.0007209562],"domain_scores_gemma":[0.9988819,0.0002218948,0.0001586956,0.0002738078,0.000343988,0.0001197579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001554175,0.00006487493,0.00006236832,0.00003869707,0.000004116059,1.721672e-7,0.0008448049,0.0003829261,0.01132813,0.9539536,0.000003773087,0.03330095],"study_design_scores_gemma":[0.0003448406,0.0003207147,0.0002317079,0.00003525633,0.000005080222,0.00002221527,0.00002573475,0.4990946,0.02765458,0.4717343,0.0003275525,0.0002034306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.068622,0.00003265445,0.928422,0.0006318594,0.0002470215,0.0005071843,0.000001948908,0.0001118813,0.00142339],"genre_scores_gemma":[0.7579815,0.000004315503,0.2415586,0.0002757545,0.00009794504,0.0000719017,0.000001364231,0.000007598155,0.000001000401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6893595,"threshold_uncertainty_score":0.6433888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011926166","doi":"10.4204/eptcs.45.5","title":"Untangling Typechecking of Intersections and Unions","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Carnegie Mellon University; National Science Foundation","keywords":"Soundness; Intersection (aeronautics); Term (time); Position (finance); Type (biology); Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.01475602053628695,"gpt":0.2361652184078919,"spread":0.2214091978716049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001366431,0.0001219781,0.0001690472,0.0002812214,0.0001609826,0.0001172069,0.001093304,0.00005205896,0.000006566112],"category_scores_gemma":[0.00008053866,0.000103146,0.00003172654,0.001359945,0.001076361,0.0005586793,0.0005469903,0.0002601191,0.000003208454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009703079,"about_ca_system_score_gemma":0.0001207777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002183975,"about_ca_topic_score_gemma":0.00000580301,"domain_scores_codex":[0.9984291,0.00001647431,0.000257876,0.0004793726,0.0002561266,0.0005610989],"domain_scores_gemma":[0.9994249,0.00004557473,0.00009053067,0.0001838442,0.0001567444,0.00009843616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003532287,0.00003912805,0.001468878,0.00001103036,0.000003196375,0.000001407974,0.002781338,8.438098e-7,0.0004389907,0.9871463,0.000001710053,0.008103656],"study_design_scores_gemma":[0.0002175095,0.0005047411,0.001678887,0.00002630939,0.000004719078,0.0001036725,0.0001442906,0.07700173,0.01148255,0.9085448,0.00008327683,0.00020756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09433801,0.0001191367,0.8902732,0.00008165249,0.0002769244,0.0001640821,6.365893e-8,0.0001200745,0.01462692],"genre_scores_gemma":[0.9824911,0.00001197677,0.01739594,0.00004714035,0.00003537866,0.000007890522,6.126978e-8,0.00000533242,0.000005111196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8881531,"threshold_uncertainty_score":0.4206173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1704961025","doi":"10.4204/eptcs.31","title":"Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems","year":2010,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Library science; Computer science; Operations research; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02232007085100891,"gpt":0.2888146064640826,"spread":0.2664945356130737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006941369,0.0008003882,0.001040445,0.001401457,0.0005227668,0.0009541129,0.008090923,0.000731853,0.00007702224],"category_scores_gemma":[0.0005328782,0.0007301244,0.0001962714,0.003735989,0.006245657,0.0031433,0.002007063,0.003514548,0.0002201238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00103168,"about_ca_system_score_gemma":0.001237814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008416226,"about_ca_topic_score_gemma":0.000001046366,"domain_scores_codex":[0.9914774,0.00006076632,0.001350797,0.002133076,0.002495878,0.002482102],"domain_scores_gemma":[0.9961506,0.0002007894,0.0009445791,0.0007090999,0.001610688,0.0003842867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009810999,0.0002088036,0.00001070299,0.0002078084,0.00001343873,0.000001028612,0.0007227926,0.00008630189,0.0005705213,0.9914713,0.00194651,0.004662677],"study_design_scores_gemma":[0.001038081,0.002569115,0.0005374331,0.001653409,0.00002562517,0.000285067,0.0001254502,0.8076882,0.009954948,0.1648226,0.009439739,0.001860346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02372735,0.000387164,0.8946527,0.0005349265,0.00681659,0.001822903,0.00004283265,0.0003002803,0.07171529],"genre_scores_gemma":[0.8025776,0.00009836486,0.1958161,0.000199881,0.0007524618,0.0001466311,0.00001034782,0.0000524749,0.00034616],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8266487,"threshold_uncertainty_score":0.999515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}