{"meta":{"query_hash":"f65248b65cd1","filters":{"venue":"International Journal of Foundations of Computer Science"},"cohort_total":182,"direct_labels_cover":0,"predictions_cover":182,"exported":182,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f65248b65cd1","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Foundations+of+Computer+Science"},"results":[{"id":"W1501444314","doi":"10.1142/s0129054112400515","title":"QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Concatenation (mathematics); Mathematics; Regular language; Discrete mathematics; Star (game theory); Combinatorics; Pumping lemma for regular languages; Intersection (aeronautics); Computer science; Theoretical computer science; Automaton; Programming language","score_opus":0.032152299180226156,"score_gpt":0.31842170595452435,"score_spread":0.2862694067742982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501444314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29761875,0.00010705756,0.6989694,0.0008985574,0.0019466802,0.00003542665,0.000007121991,0.000012149222,0.00040485052],"genre_scores_gemma":[0.74362767,0.0000074238915,0.2560851,0.000085609936,0.00018482568,3.398501e-7,7.582203e-7,0.0000021705757,0.0000061370333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99794686,0.000047964593,0.0005700255,0.00012102021,0.0011305687,0.00018353837],"domain_scores_gemma":[0.9972538,0.00015661046,0.0007250485,0.00043795875,0.001317289,0.000109341025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013401434,0.00008493943,0.00017884128,0.0005026383,0.000067627974,0.00011629489,0.004048596,0.000018745177,0.000030050216],"category_scores_gemma":[0.00016297001,0.00007156475,0.00010804956,0.00045646075,0.0006393909,0.0022776267,0.00071312796,0.00009299091,0.000004716391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018902629,0.00062836875,0.0040845997,0.000013478898,0.00009552374,0.0000066487746,0.0027772172,0.0010008978,0.008384443,0.9170928,0.0007482899,0.06514882],"study_design_scores_gemma":[0.0032714005,0.0011136587,0.44917104,0.00063621206,0.00005482356,0.0011952154,0.00055328564,0.2515096,0.11469764,0.17154875,0.0054595913,0.0007887722],"about_ca_topic_score_codex":0.000020206955,"about_ca_topic_score_gemma":0.0000016287289,"teacher_disagreement_score":0.7455441,"about_ca_system_score_codex":0.00007452713,"about_ca_system_score_gemma":0.00023726119,"threshold_uncertainty_score":0.7523366},"labels":[],"label_agreement":null},{"id":"W1645602948","doi":"10.1142/s0129054114400097","title":"SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular language; Cardinality (data modeling); Complexity class; Abstract family of languages; Cone (formal languages); Class (philosophy); Descriptive complexity theory; Formal language","score_opus":0.019917248690145807,"score_gpt":0.3049048066592412,"score_spread":0.28498755796909536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645602948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28552452,0.00003362627,0.712607,0.001008629,0.00058719196,0.000023839022,0.0000015242738,0.000008316048,0.0002053001],"genre_scores_gemma":[0.8204939,0.000008842979,0.17929588,0.00007238687,0.00012229652,2.1641743e-7,3.8343137e-7,0.0000018427828,0.0000042450824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985259,0.00005730514,0.00043398258,0.00014510904,0.000736371,0.00010133851],"domain_scores_gemma":[0.997933,0.00024190826,0.00057580427,0.0002497214,0.00093329477,0.000066303925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969749,0.00007016123,0.00017296788,0.0004189791,0.00006709572,0.00016088446,0.00186896,0.000017842873,0.000007957616],"category_scores_gemma":[0.00020438137,0.000059992024,0.00006237602,0.00030676025,0.0007024145,0.0012229524,0.0003560897,0.00007513104,0.0000014473613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001362538,0.00014135674,0.0013461452,0.000012956597,0.00005137231,0.0000061382375,0.0006671724,0.0005499844,0.013344031,0.79452056,0.000083993116,0.18926267],"study_design_scores_gemma":[0.0014949645,0.00073018565,0.11323309,0.00037862326,0.000028665092,0.0009714073,0.00009074033,0.62439656,0.0451824,0.2116626,0.0015142645,0.0003164819],"about_ca_topic_score_codex":0.000016311753,"about_ca_topic_score_gemma":0.0000018356906,"teacher_disagreement_score":0.6238466,"about_ca_system_score_codex":0.00003100433,"about_ca_system_score_gemma":0.0001473835,"threshold_uncertainty_score":0.34730238},"labels":[],"label_agreement":null},{"id":"W1670403172","doi":"10.1142/s0129054116500088","title":"Remarks on Privileged Words","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Linguistics; Context (archaeology); Word length; Computer science; Natural language processing; Arithmetic; Mathematics; History; Philosophy","score_opus":0.016328615167978063,"score_gpt":0.30530616625986967,"score_spread":0.2889775510918916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670403172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022272928,0.000052505664,0.95848256,0.004853535,0.012456626,0.00010387296,0.0000131678635,0.000038513495,0.0017262837],"genre_scores_gemma":[0.8246572,0.000045541135,0.17401415,0.0003292661,0.0008967776,0.0000026990274,0.000002081989,0.000008682675,0.0000436077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996043,0.00009637603,0.000994577,0.00046707655,0.002152726,0.00024621858],"domain_scores_gemma":[0.994338,0.0004167826,0.0017153077,0.0009254476,0.002456433,0.00014808048],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020314506,0.00022809644,0.0003636696,0.0013716558,0.00011481336,0.0007236882,0.00936234,0.000094355426,0.00003196828],"category_scores_gemma":[0.00027173193,0.00017293067,0.00028013214,0.00041715795,0.0005160014,0.0014201298,0.002506037,0.00043885113,0.000020785503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005411848,0.0004591957,0.00032280455,0.000025358697,0.00025860203,0.00008440564,0.0010280258,0.004572727,0.0030146646,0.50962406,0.0022020303,0.478354],"study_design_scores_gemma":[0.002176415,0.00096244295,0.018371359,0.0053266953,0.00004953126,0.0007944575,0.000025220434,0.20625253,0.021352222,0.7338787,0.00967108,0.0011393897],"about_ca_topic_score_codex":0.0000038175203,"about_ca_topic_score_gemma":7.9480833e-7,"teacher_disagreement_score":0.80238426,"about_ca_system_score_codex":0.00029787398,"about_ca_system_score_gemma":0.0013965003,"threshold_uncertainty_score":0.9959975},"labels":[],"label_agreement":null},{"id":"W1854120094","doi":"10.1142/s0129054111008131","title":"PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Catenation; Mathematics; Involution (esoterism); Palindrome; Word (group theory); Combinatorics; Combinatorics on words; Commutative property; Primitive root modulo n; Arithmetic; Discrete mathematics; Modulo; Geometry","score_opus":0.03143803747516207,"score_gpt":0.25822805487195344,"score_spread":0.22679001739679136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854120094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19226237,0.00009300173,0.80651015,0.00024719007,0.0004024286,0.000060696057,0.0000023303185,0.000009991801,0.0004118544],"genre_scores_gemma":[0.85434115,0.000026372447,0.1455,0.00005945518,0.00006273859,0.000002515885,1.9940006e-7,0.0000023045427,0.0000052751534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988238,0.000028864972,0.0004572693,0.00015463616,0.00043448032,0.00010093434],"domain_scores_gemma":[0.99778664,0.000074585056,0.00053852994,0.00024661937,0.0012915205,0.00006211094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065739657,0.00008066575,0.00015044241,0.00044600962,0.00007703044,0.00010256883,0.0021241494,0.000018266082,0.0000073608508],"category_scores_gemma":[0.00004200066,0.000059492773,0.000064065134,0.00039612147,0.00065925624,0.0014476628,0.00038872033,0.00007577674,0.0000015687762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028127699,0.00041864676,0.0010286968,0.000017768421,0.0001269999,0.000003687285,0.012861469,0.00012143065,0.059914384,0.54681677,0.000031675892,0.3786303],"study_design_scores_gemma":[0.0016069859,0.00091924454,0.054552726,0.00081181683,0.000037219776,0.001157137,0.0011609002,0.17619333,0.57829916,0.18347743,0.0011845938,0.0005994309],"about_ca_topic_score_codex":0.0000121193825,"about_ca_topic_score_gemma":9.662751e-7,"teacher_disagreement_score":0.6620788,"about_ca_system_score_codex":0.000031403684,"about_ca_system_score_gemma":0.00027094927,"threshold_uncertainty_score":0.39472336},"labels":[],"label_agreement":null},{"id":"W1965531865","doi":"10.1142/s0129054105003364","title":"RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Context-free language; Combinatorics; Computer science; Automaton; Theoretical computer science; Programming language; Artificial intelligence; Rule-based machine translation","score_opus":0.01234376465392803,"score_gpt":0.30105796547958724,"score_spread":0.28871420082565924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965531865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5317529,0.00005002341,0.46692026,0.0006779559,0.0004730508,0.000034523502,0.000006340462,0.000006241436,0.00007871905],"genre_scores_gemma":[0.7320655,0.000016595206,0.26782253,0.000028274078,0.000062725085,4.6652465e-7,6.349688e-7,0.0000015478474,0.0000017238218],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99825263,0.000046719328,0.0007095843,0.00015379925,0.00073463115,0.00010261949],"domain_scores_gemma":[0.9968493,0.00036432478,0.0007028544,0.00025892648,0.0017547497,0.000069820715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965253,0.00007633667,0.00019547186,0.0005223714,0.000071507726,0.00009467403,0.001671576,0.000022985123,0.000010780148],"category_scores_gemma":[0.00015180929,0.000067738416,0.0000808679,0.00059368333,0.00058664323,0.0016209458,0.00027360884,0.00007894742,5.903384e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009869665,0.0015598905,0.019562483,0.000046453915,0.0002412826,0.000010667882,0.005031153,0.012881447,0.09676436,0.40653208,0.0003857677,0.4568857],"study_design_scores_gemma":[0.0016175269,0.0008130339,0.46860865,0.0003821379,0.000036892023,0.00054800534,0.000093294606,0.33942437,0.1312885,0.055979203,0.0009031354,0.0003052276],"about_ca_topic_score_codex":0.00001868025,"about_ca_topic_score_gemma":0.0000054653065,"teacher_disagreement_score":0.4565805,"about_ca_system_score_codex":0.000060451883,"about_ca_system_score_gemma":0.0003836555,"threshold_uncertainty_score":0.3106232},"labels":[],"label_agreement":null},{"id":"W1966140610","doi":"10.1142/s0129054107004838","title":"DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Chord (peer-to-peer); Chordal graph; Asynchronous communication; Computer science; Torus; Node (physics); Human decontamination; Upper and lower bounds; Visibility; Mathematics; Theoretical computer science; Computer network; Graph","score_opus":0.019312186715823756,"score_gpt":0.3218863398165222,"score_spread":0.30257415310069846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966140610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45025477,0.00002756003,0.54773,0.00006749676,0.0017976877,0.000029388933,2.5301472e-7,0.000006222132,0.000086604436],"genre_scores_gemma":[0.7824401,0.000016726914,0.21717174,0.00007765774,0.0002867479,2.6513368e-7,1.3884708e-7,0.0000020596851,0.00000450364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835205,0.000020716254,0.0005180026,0.00017088816,0.0007811825,0.00015717615],"domain_scores_gemma":[0.99786305,0.00013234648,0.0005338295,0.00014428455,0.0012286955,0.00009778518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016676967,0.000075449876,0.000117881864,0.00058858254,0.00018275013,0.00030701433,0.0012622754,0.000025983236,0.0000097551065],"category_scores_gemma":[0.00007804969,0.00007259803,0.000053096246,0.00050578406,0.00020985519,0.0023051854,0.00037525836,0.00012583726,0.000001236703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024239243,0.00016024412,0.004737921,0.00000721011,0.000051445375,0.000032673277,0.0019552696,0.005882518,0.010269905,0.028967643,0.00005556263,0.94785535],"study_design_scores_gemma":[0.0011155499,0.00068147125,0.06550327,0.00027967768,0.000015710055,0.0016207128,0.00009022217,0.88749254,0.028093938,0.0077816113,0.0070078955,0.00031742468],"about_ca_topic_score_codex":0.000022471148,"about_ca_topic_score_gemma":0.0000063939833,"teacher_disagreement_score":0.94753796,"about_ca_system_score_codex":0.00013379316,"about_ca_system_score_gemma":0.00015898436,"threshold_uncertainty_score":0.2960546},"labels":[],"label_agreement":null},{"id":"W1967301683","doi":"10.1142/s0129054111008623","title":"SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Self-stabilization; Time complexity; Asynchronous communication; Computer science; Connected component; Distributed algorithm; Node (physics); Spanning tree; Enhanced Data Rates for GSM Evolution; Computation; Strongly connected component; State (computer science); Upper and lower bounds; Binary logarithm; Identifier; Degree (music); Computational complexity theory; Algorithm; Mathematics; Discrete mathematics; Distributed computing; Computer network","score_opus":0.03714620429616353,"score_gpt":0.290319023698489,"score_spread":0.25317281940232544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967301683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20559345,0.00003878028,0.7912991,0.0001280873,0.0022403416,0.00007401109,0.000005131997,0.000022313767,0.0005987883],"genre_scores_gemma":[0.732218,0.000006341977,0.26767924,0.000024025947,0.00006533819,7.36336e-7,0.0000015836471,0.0000029712073,0.00000171881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739575,0.00006506264,0.0010142408,0.00022056558,0.0011371057,0.00016725296],"domain_scores_gemma":[0.9943232,0.000111457084,0.0013016721,0.00027906313,0.0038849632,0.00009964183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918176,0.000115194256,0.0002664371,0.0006351385,0.00009190457,0.00013920746,0.0027890038,0.000032578697,0.000007812419],"category_scores_gemma":[0.000089776506,0.00010617802,0.00012717691,0.00084004435,0.0002780693,0.0020183935,0.0002981388,0.000112906535,0.000005020774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022222976,0.005109981,0.033134,0.00023664354,0.0010530828,0.00012800864,0.030258514,0.016652286,0.064928524,0.55466384,0.0006351316,0.29297775],"study_design_scores_gemma":[0.002291978,0.00074240897,0.15558808,0.00065683585,0.000034019013,0.0005495008,0.000121869045,0.79589796,0.02947812,0.012984664,0.0012283707,0.00042622624],"about_ca_topic_score_codex":0.000032007007,"about_ca_topic_score_gemma":0.0000018867127,"teacher_disagreement_score":0.7792457,"about_ca_system_score_codex":0.000102943406,"about_ca_system_score_gemma":0.0003958463,"threshold_uncertainty_score":0.51827097},"labels":[],"label_agreement":null},{"id":"W1967415065","doi":"10.1142/s0129054112400709","title":"BOUNDED PARIKH AUTOMATA","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bounded function; Class (philosophy); Automaton; Set (abstract data type); Discrete mathematics; Affine transformation; Mathematics; Word (group theory); Regular language; Pure mathematics; Computer science; Theoretical computer science; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.018292456120191078,"score_gpt":0.3058326623659386,"score_spread":0.2875402062457475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967415065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10524296,0.00006296281,0.88720584,0.0013765543,0.005212948,0.000038057286,0.0000017410853,0.00003317929,0.0008257553],"genre_scores_gemma":[0.75172365,0.000012266526,0.24768084,0.00019926573,0.00036572086,6.250648e-7,6.3467724e-7,0.0000029629034,0.0000140368575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777865,0.000044182343,0.0005656846,0.00014852844,0.0012155942,0.00024736082],"domain_scores_gemma":[0.9974961,0.00017230556,0.00061117735,0.0003941491,0.0011691232,0.00015713193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017543515,0.00009864806,0.00016216542,0.00059234095,0.00012471432,0.00041611725,0.00399689,0.000025405843,0.000026708776],"category_scores_gemma":[0.00013501335,0.00008424322,0.000109858185,0.0005937494,0.00034830812,0.0048055723,0.0005564748,0.00011522747,0.000025724668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010681468,0.00049199106,0.002455009,0.000005227435,0.00008727155,0.000010655811,0.0017603956,0.00044017113,0.004479889,0.7546342,0.001041152,0.23458338],"study_design_scores_gemma":[0.0035121122,0.0008298902,0.19222873,0.00048086303,0.000058575995,0.0041392334,0.00017318182,0.5240461,0.05156025,0.17086661,0.051030852,0.0010735512],"about_ca_topic_score_codex":0.0000064196597,"about_ca_topic_score_gemma":4.2887032e-7,"teacher_disagreement_score":0.6464807,"about_ca_system_score_codex":0.0001109977,"about_ca_system_score_gemma":0.00039668015,"threshold_uncertainty_score":0.7427283},"labels":[],"label_agreement":null},{"id":"W1967770912","doi":"10.1142/s0129054112400205","title":"EXACT PARALLEL ALIGNMENT OF MEGABASE GENOMIC SEQUENCES WITH TUNABLE WORK DISTRIBUTION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Speedup; Computer science; Pairwise comparison; Quadratic equation; Heuristic; Multiple sequence alignment; Sequence (biology); Distribution (mathematics); Basis (linear algebra); Algorithm; Space (punctuation); Parallel computing; Theoretical computer science; Sequence alignment; Mathematics; Artificial intelligence; Biology","score_opus":0.017949975043012115,"score_gpt":0.28140875808261534,"score_spread":0.26345878303960324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967770912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15035205,0.00010613904,0.84791124,0.00041659642,0.0010661643,0.000057298643,0.0000122799165,0.000007582127,0.00007066717],"genre_scores_gemma":[0.721284,0.00002225384,0.27850708,0.000028374288,0.0001421278,0.0000011784537,0.0000061262904,0.000002134432,0.0000067571145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99783593,0.00004228171,0.00054671156,0.00016566718,0.0012002337,0.00020916354],"domain_scores_gemma":[0.9974689,0.000111708134,0.0008229267,0.00031286164,0.0011473062,0.00013629317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010058547,0.00010473476,0.00017943062,0.00026477847,0.00011225072,0.00017445216,0.0021506017,0.00002112213,0.000016135242],"category_scores_gemma":[0.00003928787,0.0000773872,0.000070477465,0.00054732116,0.00033393467,0.003292928,0.00040129034,0.00009334416,0.000003950994],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048291936,0.0036948815,0.077870265,0.000069292764,0.0007396796,0.00008025663,0.0051890705,0.1445089,0.034168176,0.36830446,0.0044406494,0.36045143],"study_design_scores_gemma":[0.005425061,0.0026429463,0.5384434,0.0020362413,0.00013919674,0.0020152975,0.0002698444,0.32992667,0.07733704,0.015002862,0.02530452,0.0014569112],"about_ca_topic_score_codex":0.00002750315,"about_ca_topic_score_gemma":7.187442e-7,"teacher_disagreement_score":0.5709319,"about_ca_system_score_codex":0.00015453032,"about_ca_system_score_gemma":0.0004089162,"threshold_uncertainty_score":0.3996389},"labels":[],"label_agreement":null},{"id":"W1968593409","doi":"10.1142/s0129054112400540","title":"DE BRUIJN SEQUENCES REVISITED","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"De Bruijn sequence; Combinatorics; Sequence (biology); Alphabet; Mathematics; Order (exchange); Word (group theory); Integer (computer science); Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.019679544085339343,"score_gpt":0.31379569095218235,"score_spread":0.294116146866843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968593409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10744196,0.00015799797,0.8886831,0.0011413228,0.0019317332,0.000028783385,0.0000014187667,0.000018792052,0.00059490686],"genre_scores_gemma":[0.7499826,0.00001968848,0.24935545,0.00028129327,0.00034764563,4.3314168e-7,3.9620147e-7,0.0000020141474,0.000010460306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982931,0.000052113082,0.00044854014,0.000119360855,0.0008671318,0.00021973703],"domain_scores_gemma":[0.9978526,0.00017123786,0.000508518,0.00024981875,0.0010788258,0.00013899755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020025882,0.00007758915,0.00013211345,0.0005078358,0.000095251446,0.00035567503,0.003163331,0.000020999487,0.000027428901],"category_scores_gemma":[0.00015571732,0.000065364446,0.00008904225,0.0005896131,0.00028867947,0.0036380577,0.00031701956,0.00010174269,0.000011558176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010258205,0.00028172883,0.009005977,0.000007426595,0.000078173485,0.000015577056,0.0021703173,0.0012056169,0.016792893,0.70273894,0.00083773636,0.26685536],"study_design_scores_gemma":[0.0020658204,0.0008114073,0.24406134,0.0009020779,0.000060700182,0.006481129,0.00020469239,0.45418045,0.086545184,0.16762196,0.036037095,0.0010281471],"about_ca_topic_score_codex":0.000007463904,"about_ca_topic_score_gemma":1.873765e-7,"teacher_disagreement_score":0.64254063,"about_ca_system_score_codex":0.00012133778,"about_ca_system_score_gemma":0.00040458312,"threshold_uncertainty_score":0.5878309},"labels":[],"label_agreement":null},{"id":"W1968754294","doi":"10.1142/s012905410500342x","title":"A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Concatenation (mathematics); Mathematics; Second-order arithmetic; Expressive power; Hierarchy; Class (philosophy); Analytical hierarchy; Discrete mathematics; Characterization (materials science); Property (philosophy); Axiom; Order (exchange); Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process","score_opus":0.008621856616376914,"score_gpt":0.27510471527781283,"score_spread":0.2664828586614359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968754294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26431763,0.000018825054,0.73068583,0.0040771333,0.00074495235,0.000042492404,0.000008468361,0.000007780967,0.00009686379],"genre_scores_gemma":[0.92605484,0.0000071507907,0.07348254,0.00025740016,0.00016478632,9.135289e-7,0.0000022681859,0.0000026459072,0.00002743718],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981812,0.000055078293,0.000539877,0.0001325611,0.0009784169,0.00011283768],"domain_scores_gemma":[0.9978631,0.00017445497,0.0006097142,0.0003045335,0.0009939553,0.000054238535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077437435,0.0000709874,0.00012327955,0.00032156872,0.00009398692,0.00016918012,0.0029465859,0.000021230871,0.000020703555],"category_scores_gemma":[0.00017002742,0.00005195893,0.00009992533,0.0006323509,0.0003916112,0.0015691916,0.00035342833,0.00010658392,0.000003728165],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008728871,0.0003830571,0.00033215046,0.000004652294,0.00005301203,0.0000019656702,0.002600732,0.00110615,0.47405782,0.24996729,0.00018997044,0.27129444],"study_design_scores_gemma":[0.0009501018,0.0002063887,0.018977491,0.00021076895,0.000021875525,0.00021044478,0.000055134,0.64044625,0.32516032,0.00919125,0.004334153,0.0002357939],"about_ca_topic_score_codex":0.0000051485526,"about_ca_topic_score_gemma":0.0000012800712,"teacher_disagreement_score":0.6617372,"about_ca_system_score_codex":0.00007151508,"about_ca_system_score_gemma":0.0003162503,"threshold_uncertainty_score":0.5475539},"labels":[],"label_agreement":null},{"id":"W1971882628","doi":"10.1142/s0129054111008738","title":"PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Shift register; Computer science; Control theory (sociology); Mathematics; Arithmetic; Artificial intelligence; Telecommunications; Control (management); Physics","score_opus":0.025460061474614406,"score_gpt":0.2705732151522423,"score_spread":0.2451131536776279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971882628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17248154,0.00000964542,0.8217026,0.0005425467,0.0011732198,0.00006151884,0.0000048839593,0.000020728325,0.0040032878],"genre_scores_gemma":[0.77647394,0.0000030377837,0.22325002,0.00012184104,0.00012155741,9.836451e-7,0.0000010751454,0.0000051517322,0.00002239071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781704,0.000070376685,0.0005946143,0.00026998465,0.0010619478,0.00018602127],"domain_scores_gemma":[0.9970114,0.00018728519,0.000815946,0.00046150543,0.0014077937,0.00011605352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010990788,0.00014314037,0.00022257422,0.0009972475,0.00017276817,0.00019138257,0.002875426,0.000025934189,0.00006581066],"category_scores_gemma":[0.00005642512,0.0001180669,0.00016362238,0.0010386818,0.000877137,0.0016418176,0.00027129144,0.00017989076,0.000018329587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014875913,0.0032144154,0.011827985,0.000041046984,0.0010214034,0.00012365216,0.019653793,0.020854648,0.012310874,0.65089864,0.00061308953,0.27795288],"study_design_scores_gemma":[0.017696388,0.020144295,0.23505464,0.0049977186,0.00041364116,0.003798533,0.0006461024,0.4811477,0.08293122,0.13734461,0.0124799805,0.0033451645],"about_ca_topic_score_codex":0.00001497839,"about_ca_topic_score_gemma":0.00000276613,"teacher_disagreement_score":0.6039924,"about_ca_system_score_codex":0.00006246733,"about_ca_system_score_gemma":0.00040965652,"threshold_uncertainty_score":0.5343305},"labels":[],"label_agreement":null},{"id":"W1972572665","doi":"10.1142/s0129054113400315","title":"THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Context-free language; Regular language; Computer science; String (physics); Nondeterministic finite automaton; Regular expression; Deterministic pushdown automaton; Unary operation; Formal language; Automaton; Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Programming language; Rule-based machine translation; Artificial intelligence; Automata theory","score_opus":0.007283888517623,"score_gpt":0.2653929551883784,"score_spread":0.2581090666707554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972572665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27706847,0.00048101234,0.71548635,0.005597116,0.0011073477,0.000076956094,0.000004316395,0.000018303514,0.00016013005],"genre_scores_gemma":[0.94590086,0.000026361298,0.053475175,0.00018824486,0.00036325664,0.0000021491965,6.051939e-7,0.00000324617,0.000040118637],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838525,0.000047089277,0.00042395762,0.00016532608,0.0008173523,0.00016099894],"domain_scores_gemma":[0.99768895,0.00043611016,0.0004451218,0.00047058077,0.0008679911,0.000091225396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010337917,0.00008633532,0.00013678172,0.000218878,0.0001918532,0.00077942765,0.0040126326,0.000019689369,0.000009338339],"category_scores_gemma":[0.0002512875,0.000059395275,0.000062482955,0.00032118347,0.0005567223,0.0018329156,0.0006452355,0.00011807343,0.000006890757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050982067,0.00004136154,0.00084679655,0.0000040770324,0.00006375103,0.000014940959,0.0036529466,0.0000399107,0.0029466085,0.14468646,0.0018098408,0.8458882],"study_design_scores_gemma":[0.005686214,0.0011732259,0.21533386,0.0010133132,0.00007423422,0.0014777683,0.004908857,0.32293102,0.032127365,0.3806223,0.033364747,0.0012870972],"about_ca_topic_score_codex":0.00004763717,"about_ca_topic_score_gemma":0.0000070655515,"teacher_disagreement_score":0.8446011,"about_ca_system_score_codex":0.000051387167,"about_ca_system_score_gemma":0.00017440133,"threshold_uncertainty_score":0.75160384},"labels":[],"label_agreement":null},{"id":"W1972659920","doi":"10.1142/s0129054103002059","title":"QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Turing machine; Quantum computer; Quantum Turing machine; Time hierarchy theorem; NSPACE; Polynomial; Bounded function; Super-recursive algorithm; Discrete mathematics; Computation; Quantum algorithm; Mathematics; Quantum; Computer science; Amplitude; Limit (mathematics); Algorithm; Universal Turing machine; Quantum error correction; Quantum mechanics; Mathematical analysis","score_opus":0.014772172591988519,"score_gpt":0.2881933680008781,"score_spread":0.27342119540888954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972659920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13809474,0.000029830468,0.8594268,0.00070890656,0.0014452299,0.000054473112,0.0000010388592,0.00002532132,0.00021363726],"genre_scores_gemma":[0.61524266,0.0000044614576,0.38461232,0.000059466132,0.00007409447,4.3045873e-7,5.3073654e-7,0.0000032180628,0.0000027959693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760455,0.0000791984,0.0005711682,0.0002521209,0.0012935355,0.00019941699],"domain_scores_gemma":[0.9961914,0.00024008763,0.00071438553,0.00026179862,0.0024792599,0.000113060254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007558363,0.00012734109,0.0001934597,0.0007870443,0.0001717125,0.0004548898,0.002088935,0.000024439856,0.000004287223],"category_scores_gemma":[0.0001582812,0.00009851309,0.00008098391,0.0011648595,0.00034835533,0.0011783919,0.00016191731,0.00017621869,0.0000030961578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042401447,0.0005539778,0.0021866264,0.000013109347,0.00018362197,0.000092010865,0.00158452,0.2805578,0.0040321024,0.5314194,0.00025839204,0.17907606],"study_design_scores_gemma":[0.0013727708,0.0009683377,0.026705785,0.000233612,0.000015466345,0.0017320563,0.000033992095,0.9196829,0.004282154,0.042463455,0.002187669,0.00032179896],"about_ca_topic_score_codex":0.000008477366,"about_ca_topic_score_gemma":0.0000011799373,"teacher_disagreement_score":0.6391251,"about_ca_system_score_codex":0.00008051082,"about_ca_system_score_gemma":0.00079362624,"threshold_uncertainty_score":0.4386513},"labels":[],"label_agreement":null},{"id":"W1972680079","doi":"10.1142/s0129054107004930","title":"REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Deterministic context-free grammar; Computer science; Concatenation (mathematics); Time complexity; Embedded pushdown automaton; Stateless protocol; Context-free grammar; Reduction (mathematics); Theoretical computer science; Simple (philosophy); Regular expression; Automaton; Algorithm; Rule-based machine translation; Artificial intelligence; State (computer science); Mathematics; Tree-adjoining grammar; Programming language; Arithmetic","score_opus":0.012144565599661167,"score_gpt":0.30976415250553546,"score_spread":0.2976195869058743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972680079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112514734,0.000031285916,0.8832625,0.0010243992,0.0026849497,0.000063568536,0.0000030281014,0.000015482834,0.00040003288],"genre_scores_gemma":[0.59533596,0.000015942924,0.40402183,0.00015980877,0.00045038227,4.341942e-7,0.0000036971041,0.0000036814863,0.00000828047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709755,0.00005760751,0.00091533136,0.0002821381,0.0013833822,0.00026398964],"domain_scores_gemma":[0.9966513,0.0004109125,0.0008567189,0.000360146,0.0015885588,0.00013234891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028599205,0.00011664294,0.0001890674,0.0010736068,0.00012576375,0.00044779514,0.0032005063,0.000038105554,0.000009237876],"category_scores_gemma":[0.00037309792,0.000108005836,0.00008769823,0.00083199836,0.00023596219,0.005255622,0.0007332998,0.00021434543,0.000013425705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018846676,0.0009805824,0.0006588613,0.0000062509757,0.0000993355,0.0003381194,0.0019498536,0.018846404,0.06553912,0.018631175,0.0026509946,0.89011085],"study_design_scores_gemma":[0.0035897703,0.00069698336,0.019515024,0.00048128242,0.000026399091,0.0012263488,0.0001287938,0.8899685,0.037515778,0.0047974084,0.04138098,0.000672689],"about_ca_topic_score_codex":0.00006360294,"about_ca_topic_score_gemma":0.0000048499082,"teacher_disagreement_score":0.88943815,"about_ca_system_score_codex":0.00021947216,"about_ca_system_score_gemma":0.0005657742,"threshold_uncertainty_score":0.594739},"labels":[],"label_agreement":null},{"id":"W1973982376","doi":"10.1142/s0129054103002205","title":"EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Deterministic context-free grammar; Computer science; Theoretical computer science; Finite-state machine; Discrete mathematics; Context-free language; Embedded pushdown automaton; Rule-based machine translation; Probabilistic automaton; Mathematics; Algorithm; Tree-adjoining grammar; Context-free grammar; Artificial intelligence","score_opus":0.018836019442561434,"score_gpt":0.310194326532439,"score_spread":0.2913583070898776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973982376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10337092,0.000028964287,0.8939032,0.0005559369,0.0017536728,0.00009551185,0.000008651081,0.000025597214,0.00025755222],"genre_scores_gemma":[0.62544894,0.0000012273678,0.37427145,0.0001828852,0.00008365961,0.0000025476052,0.0000017019481,0.000002973351,0.0000046177856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984316,0.0000528995,0.00045486857,0.0001945171,0.0007151154,0.00015098309],"domain_scores_gemma":[0.99640965,0.00044309653,0.0005356629,0.00021625526,0.0023210777,0.000074274365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013824445,0.00009257934,0.00014890904,0.00055015285,0.00011636353,0.00018848134,0.0014440927,0.000024889003,0.000015832502],"category_scores_gemma":[0.00040402391,0.00008049776,0.00012657138,0.00043844138,0.00023856515,0.00051219005,0.00007451292,0.0000754749,0.00000721586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009336929,0.0012526728,0.0006465871,0.000037787504,0.00021186224,0.00003616275,0.0017665536,0.13142827,0.015040203,0.500275,0.00063573977,0.34857574],"study_design_scores_gemma":[0.0010546611,0.00026349298,0.0012496136,0.00012271924,0.000011036067,0.000122009864,0.000047037083,0.94052285,0.042706396,0.012707709,0.0010451037,0.00014736556],"about_ca_topic_score_codex":0.0000029237208,"about_ca_topic_score_gemma":4.4976585e-7,"teacher_disagreement_score":0.8090946,"about_ca_system_score_codex":0.00007852052,"about_ca_system_score_gemma":0.00062600395,"threshold_uncertainty_score":0.32826033},"labels":[],"label_agreement":null},{"id":"W1974278282","doi":"10.1142/s0129054107004917","title":"ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"State (computer science); Nondeterministic algorithm; Computational complexity theory; Estimation; Computer science; Theoretical computer science; Class (philosophy); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","score_opus":0.027416478122629866,"score_gpt":0.29959842707445417,"score_spread":0.2721819489518243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974278282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37667283,0.000009087501,0.62119114,0.0015320762,0.0004609324,0.000043874526,0.0000029975827,0.0000059218464,0.000081162856],"genre_scores_gemma":[0.8948772,0.0000060239045,0.10487968,0.00019758135,0.000031985383,4.2328676e-7,8.1917625e-7,0.0000019549775,0.0000043327373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986081,0.000043441014,0.00052470516,0.00012461431,0.0005921434,0.00010699597],"domain_scores_gemma":[0.99755085,0.0005681144,0.00039422914,0.00025144345,0.0011815068,0.00005385421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001794238,0.00007820583,0.00013026824,0.00039425053,0.00015139347,0.00020964733,0.001725573,0.000013129287,0.000008063984],"category_scores_gemma":[0.00017812586,0.000050416354,0.000054538377,0.0004265444,0.00077089557,0.0010128979,0.00024170298,0.00009785334,0.0000014809134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020667227,0.00014573909,0.00007909951,0.000002637096,0.00003544663,0.0000020370771,0.0015379103,0.012443107,0.0056418045,0.90184796,0.000050576225,0.078193],"study_design_scores_gemma":[0.00036459646,0.00028116413,0.018014923,0.00008731494,0.0000030002768,0.00007764246,0.00004719025,0.74656606,0.023754293,0.21069111,0.00003739253,0.00007533051],"about_ca_topic_score_codex":0.000016107988,"about_ca_topic_score_gemma":0.0000069238126,"teacher_disagreement_score":0.73412293,"about_ca_system_score_codex":0.00004468155,"about_ca_system_score_gemma":0.00018522012,"threshold_uncertainty_score":0.32065725},"labels":[],"label_agreement":null},{"id":"W1975121090","doi":"10.1142/s012905410200145x","title":"COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Membrane; Membrane computing; Computer science; Theoretical computer science; Mathematics; Chemistry; Biochemistry","score_opus":0.016566795899129714,"score_gpt":0.2873662264388591,"score_spread":0.2707994305397294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975121090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8264701,0.0004541314,0.17222795,0.00026775736,0.00028547758,0.000028917913,0.0000014252103,0.00000140565,0.00026284726],"genre_scores_gemma":[0.98555195,0.00016167009,0.014109344,0.000068004934,0.00009459553,1.4528453e-7,0.0000054289685,0.000001847387,0.0000069930998],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991003,0.000043986103,0.00043475121,0.0000936727,0.00024472884,0.000082526225],"domain_scores_gemma":[0.99876034,0.00005865084,0.0004212433,0.00012189248,0.00061049894,0.000027352862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055811374,0.0000512804,0.00010569785,0.00013069765,0.00003854887,0.000030902087,0.0008763404,0.000031252766,0.000009299725],"category_scores_gemma":[0.00009750245,0.000043929664,0.00005397829,0.00019528593,0.00027007982,0.000024858708,0.00019339485,0.000073044925,3.6920784e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000854017,0.00088218955,0.038962923,0.000019391528,0.00012668982,0.0000047502485,0.000559059,0.12534831,0.56713367,0.0020766293,0.0012311107,0.2635699],"study_design_scores_gemma":[0.0022648785,0.0011615985,0.057570554,0.0004591375,0.000018823486,0.00021884407,0.00009150309,0.79492617,0.1352269,0.0012094288,0.0064614275,0.00039074582],"about_ca_topic_score_codex":0.0000079621595,"about_ca_topic_score_gemma":0.0000024169744,"teacher_disagreement_score":0.66957784,"about_ca_system_score_codex":0.000015306374,"about_ca_system_score_gemma":0.000031993543,"threshold_uncertainty_score":0.17913997},"labels":[],"label_agreement":null},{"id":"W1975431188","doi":"10.1142/s0129054113400285","title":"COMPLEXITY OF ATOMS OF REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Atom (system on chip); Intersection (aeronautics); Mathematics; Regular language; State (computer science); Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Computer science; Algorithm; Mathematical analysis","score_opus":0.02073960704499473,"score_gpt":0.2991157101043507,"score_spread":0.27837610305935595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975431188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4097653,0.000047231337,0.5885081,0.0007698571,0.0005863124,0.000043084066,0.0000034493926,0.0000074218387,0.00026921323],"genre_scores_gemma":[0.76986986,0.000007760933,0.22999166,0.000052096486,0.00006493499,5.2829887e-7,6.4201623e-7,0.0000020543055,0.000010461444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997999,0.000043792348,0.0006930133,0.00014083179,0.0010054335,0.00011791194],"domain_scores_gemma":[0.99608034,0.00015709594,0.0009775478,0.00035075677,0.002368852,0.000065423665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080007955,0.00007920916,0.0002193946,0.0005171333,0.00004507205,0.0001131753,0.0032230148,0.000021183352,0.000051899893],"category_scores_gemma":[0.00009937956,0.0000662299,0.0001187199,0.00048114997,0.00091402396,0.0017143401,0.0004145841,0.00007769912,0.0000053980957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097359225,0.00034172213,0.0019133904,0.00002169071,0.0001053912,0.0000067222672,0.0012268925,0.00084568124,0.05526073,0.8062221,0.0004358819,0.13361008],"study_design_scores_gemma":[0.0013064874,0.0006386149,0.17075406,0.00051100494,0.00002197445,0.0004321444,0.000221515,0.26518348,0.2313902,0.32860637,0.00061050215,0.00032366448],"about_ca_topic_score_codex":0.0000619545,"about_ca_topic_score_gemma":0.0000013855807,"teacher_disagreement_score":0.4776157,"about_ca_system_score_codex":0.000039639923,"about_ca_system_score_gemma":0.00022787211,"threshold_uncertainty_score":0.5989217},"labels":[],"label_agreement":null},{"id":"W1976120600","doi":"10.1142/s0129054100000260","title":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Clique graph; Treewidth; Split graph; Vertex (graph theory); Chordal graph; Block graph; Bounded function; Graph; Pathwidth; Line graph; Graph power; 1-planar graph","score_opus":0.02382651196834527,"score_gpt":0.33623674160293426,"score_spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976120600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37440827,0.0000502351,0.61966443,0.0039032467,0.0008907479,0.00009549627,0.0000035797173,0.00001264469,0.0009713812],"genre_scores_gemma":[0.95032835,0.00007942262,0.049126364,0.00030050386,0.000116052724,0.0000017667141,3.3876967e-7,0.000004105625,0.000043086893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717027,0.00013327085,0.00058852386,0.00021535243,0.0016952883,0.00019726862],"domain_scores_gemma":[0.99630654,0.0009641348,0.0004787083,0.000487684,0.0016786505,0.00008428536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018253544,0.00010640214,0.00017831508,0.00078667485,0.00016747255,0.00021664215,0.0051240656,0.000022934597,0.000102721315],"category_scores_gemma":[0.00025902104,0.00007300705,0.00017092827,0.0010314904,0.0009882601,0.0020103317,0.0002492574,0.00023026299,0.000014810509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049597016,0.0002085791,0.00025628592,0.0000032294267,0.000055325407,0.0000088259985,0.00033218032,0.012937823,0.0022161477,0.85488015,0.00022306415,0.1288288],"study_design_scores_gemma":[0.0007749217,0.0011839281,0.012509936,0.00025281182,0.000009521324,0.0002507737,0.000022486203,0.059721336,0.024582379,0.8988541,0.0016170484,0.00022077531],"about_ca_topic_score_codex":0.000005303869,"about_ca_topic_score_gemma":0.0000010533792,"teacher_disagreement_score":0.5759201,"about_ca_system_score_codex":0.00007083338,"about_ca_system_score_gemma":0.0004672889,"threshold_uncertainty_score":0.9521874},"labels":[],"label_agreement":null},{"id":"W1980577621","doi":"10.1142/s012905410400242x","title":"ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics on words; Set (abstract data type); Product (mathematics); Enumeration; Simple (philosophy); Combinatorics; Existential quantification; Discrete mathematics; Word (group theory); Computer science","score_opus":0.03640076233099542,"score_gpt":0.30195530541704296,"score_spread":0.26555454308604753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980577621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35859564,0.000012975364,0.6363704,0.0035431262,0.0011511953,0.000037950693,0.000002875083,0.000007745337,0.0002780675],"genre_scores_gemma":[0.91064024,0.0000075191606,0.0889467,0.00030822528,0.000090855094,5.7489063e-7,3.9642418e-7,0.0000023869288,0.0000031018183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801356,0.00004386978,0.0005748803,0.00014730134,0.0010942491,0.00012614673],"domain_scores_gemma":[0.9974175,0.0003462192,0.0007314147,0.00038387685,0.0010651085,0.000055859313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867198,0.0000868381,0.00015781978,0.00045702365,0.00011235637,0.00019057386,0.0040437886,0.000018903524,0.000021446298],"category_scores_gemma":[0.00017587145,0.0000598622,0.00011857341,0.00061465707,0.00092179596,0.00093395356,0.00035618167,0.00014209168,0.00000856442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010364247,0.00014527641,0.00008429526,0.0000018318358,0.000031697622,0.0000053176054,0.0006497346,0.008763928,0.0018456562,0.97439414,0.00004535182,0.014022384],"study_design_scores_gemma":[0.0010593276,0.0005105085,0.020517034,0.0003584225,0.000009362366,0.0003063214,0.000049636794,0.059120413,0.025700174,0.8918371,0.00035672594,0.00017492959],"about_ca_topic_score_codex":0.000017365675,"about_ca_topic_score_gemma":0.0000022851325,"teacher_disagreement_score":0.5520446,"about_ca_system_score_codex":0.00009108692,"about_ca_system_score_gemma":0.00048447048,"threshold_uncertainty_score":0.7514433},"labels":[],"label_agreement":null},{"id":"W1983758508","doi":"10.1142/s012905411450018x","title":"ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adjacency list; Combinatorics; Graph factorization; Computer science; Subgraph isomorphism problem; Vertex (graph theory); Mathematics; Adjacency matrix; Degeneracy (biology); Algorithm; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.02168548651430138,"score_gpt":0.27394579617006065,"score_spread":0.2522603096557593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983758508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33483374,0.000021648564,0.6596841,0.00066074455,0.0043022037,0.00006562462,9.84385e-7,0.000025800158,0.00040514654],"genre_scores_gemma":[0.96032774,0.0000059192307,0.039071552,0.00022899918,0.0003448478,0.0000018951558,0.0000010684939,0.0000072221555,0.000010749924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974271,0.00008270416,0.0007891811,0.00037042896,0.0010678858,0.0002627019],"domain_scores_gemma":[0.9960333,0.000704636,0.0008283022,0.0003797569,0.0019017202,0.0001522801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016833905,0.00017582774,0.00029783702,0.0011353688,0.0002868967,0.0007018773,0.002235435,0.00005426259,0.0000190813],"category_scores_gemma":[0.0004228954,0.00015295923,0.0001329493,0.00085398444,0.00031520618,0.0016782882,0.0003207488,0.00024102589,0.000009835271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005833291,0.00018579263,0.009511861,0.000011508765,0.00016009429,0.000021903174,0.0009378355,0.016222196,0.0020894604,0.83209425,0.00057748676,0.13812928],"study_design_scores_gemma":[0.00093336,0.00054445205,0.047264967,0.00039299595,0.0000109489565,0.00042857093,0.000015262005,0.9041505,0.0009341277,0.044473406,0.0006191938,0.00023223402],"about_ca_topic_score_codex":0.000036841033,"about_ca_topic_score_gemma":0.00005472729,"teacher_disagreement_score":0.8879283,"about_ca_system_score_codex":0.00010169494,"about_ca_system_score_gemma":0.00020049578,"threshold_uncertainty_score":0.6768219},"labels":[],"label_agreement":null},{"id":"W1984147068","doi":"10.1142/s0129054103002163","title":"SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Automaton; Computer science; Electronic circuit; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Arithmetic; Engineering; Electrical engineering; Programming language; Pure mathematics","score_opus":0.038866793631586294,"score_gpt":0.3409278260135017,"score_spread":0.3020610323819154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984147068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18125628,0.000024082754,0.8169434,0.00024840605,0.0010256083,0.000083732215,0.0000022705437,0.000003052574,0.00041316828],"genre_scores_gemma":[0.7174424,0.000005835723,0.2824828,0.00003902568,0.000025509175,7.6485134e-7,3.315416e-7,0.0000018599331,0.000001461864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712694,0.00018641133,0.0009495975,0.00015461161,0.0014589941,0.00012344947],"domain_scores_gemma":[0.99593556,0.00046921277,0.0010281141,0.00049442466,0.0020364758,0.00003623093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031161392,0.00008206209,0.0001806365,0.00075297663,0.00004951806,0.00008331331,0.0041278326,0.000029409912,0.000007288884],"category_scores_gemma":[0.0009786562,0.00006585504,0.00009783872,0.0012442259,0.00038432592,0.0018348353,0.00010755404,0.0001233753,9.511043e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020438023,0.0006104543,0.00304044,0.000024033603,0.000049283208,0.000004412883,0.006028092,0.31730515,0.007646062,0.5633479,0.000029952937,0.10189378],"study_design_scores_gemma":[0.0019127696,0.00055715686,0.13159321,0.0003027005,0.000019359235,0.00015074023,0.00014688403,0.7522798,0.04460158,0.067661,0.0005567967,0.00021796866],"about_ca_topic_score_codex":0.00000791625,"about_ca_topic_score_gemma":0.0000021024493,"teacher_disagreement_score":0.5361861,"about_ca_system_score_codex":0.00006977743,"about_ca_system_score_gemma":0.00039067422,"threshold_uncertainty_score":0.7670608},"labels":[],"label_agreement":null},{"id":"W1988560957","doi":"10.1142/s012905410200100x","title":"UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Concatenation (mathematics); Unary operation; Regular language; Intersection (aeronautics); State (computer science); Mathematics; Symbol (formal); Alphabet; Discrete mathematics; Function (biology); Finite-state machine; Connection (principal bundle); Automaton; Combinatorics; Computer science; Algorithm; Theoretical computer science; Programming language","score_opus":0.02369577806896057,"score_gpt":0.28019506612564216,"score_spread":0.2564992880566816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988560957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25379166,0.00017713581,0.7431424,0.0014025528,0.0012015288,0.000039930495,0.0000037120674,0.000019793955,0.00022127718],"genre_scores_gemma":[0.867025,0.00004660935,0.13250837,0.00025666514,0.00012233171,7.022726e-7,0.0000011282496,0.0000027967967,0.00003639206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984963,0.00004732483,0.0004357657,0.0001850142,0.00070844113,0.00012718677],"domain_scores_gemma":[0.998478,0.000098300676,0.00025736814,0.0002390115,0.00083958067,0.000087764165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767123,0.00008729793,0.00013227543,0.0004668607,0.00015551352,0.00044081945,0.0014656376,0.000016730708,0.000049801103],"category_scores_gemma":[0.00006087452,0.00007679475,0.000054439537,0.00040646462,0.00040645342,0.0025349811,0.00031566122,0.000107292675,0.000010373747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022050082,0.00045666657,0.0011858151,0.000011584554,0.0001253593,0.000056602465,0.0050518154,0.008758323,0.011380502,0.25491345,0.0009345284,0.7171033],"study_design_scores_gemma":[0.00073496666,0.00033127097,0.030349849,0.0000874015,0.000010648622,0.00063872995,0.00007886842,0.94260556,0.002690879,0.02115416,0.0011240048,0.00019364168],"about_ca_topic_score_codex":0.00001886329,"about_ca_topic_score_gemma":0.000003823117,"teacher_disagreement_score":0.93384725,"about_ca_system_score_codex":0.000056607547,"about_ca_system_score_gemma":0.00008977614,"threshold_uncertainty_score":0.4250832},"labels":[],"label_agreement":null},{"id":"W1992434757","doi":"10.1142/s0129054100000259","title":"FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supertree; Combinatorics; Mathematics; Tree (set theory); Vertex (graph theory); Minor (academic); Bounded function; Embedding; Discrete mathematics; Computer science; Graph; Biology; Artificial intelligence; Phylogenetic tree","score_opus":0.0312662277924988,"score_gpt":0.3391405770950674,"score_spread":0.3078743493025686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992434757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29359227,0.00004040091,0.7030054,0.0018091733,0.0007616432,0.000055770288,0.0000017629052,0.00001114456,0.0007224528],"genre_scores_gemma":[0.84227216,0.000034527926,0.15728498,0.00017800933,0.00013079053,0.0000013425384,6.376866e-7,0.0000035323433,0.00009404727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743146,0.000055615634,0.0005490343,0.00023759952,0.0014891332,0.00023715499],"domain_scores_gemma":[0.9976573,0.00025930005,0.0002739812,0.00034550112,0.0013286,0.00013530141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440452,0.000106487874,0.00016469187,0.0007137593,0.00016854134,0.00037391332,0.0040314076,0.000022869324,0.00020624617],"category_scores_gemma":[0.0000693496,0.00009344855,0.00011300502,0.00068925455,0.00052979466,0.0018898126,0.00031336173,0.0001526743,0.000024303057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067979614,0.00034078167,0.0024304686,0.0000044223566,0.00012521792,0.00005971343,0.0011449513,0.031183,0.0072552706,0.3378368,0.00021120686,0.6193402],"study_design_scores_gemma":[0.006087428,0.0024898548,0.14559828,0.00073636265,0.00004162308,0.003169481,0.00032908306,0.32069924,0.047721285,0.4524248,0.019371033,0.0013315256],"about_ca_topic_score_codex":0.000008503235,"about_ca_topic_score_gemma":0.0000047505728,"teacher_disagreement_score":0.6180087,"about_ca_system_score_codex":0.0001786867,"about_ca_system_score_gemma":0.0004554122,"threshold_uncertainty_score":0.7491425},"labels":[],"label_agreement":null},{"id":"W1993598446","doi":"10.1142/s0129054102000960","title":"AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Nondeterministic finite automaton; DFA minimization; Deterministic finite automaton; Quantum finite automata; Nested word; Regular language; Finite-state machine; Automaton; Deterministic automaton; ω-automaton; Computer science; Time complexity; Algorithm; Formal language; Timed automaton; Mathematics; Theoretical computer science; Automata theory; Two-way deterministic finite automaton","score_opus":0.019626468324232184,"score_gpt":0.3115234385093699,"score_spread":0.2918969701851377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993598446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029762989,0.000041211617,0.967342,0.0006098791,0.00194528,0.00013495385,0.00003526027,0.00003132327,0.000097065546],"genre_scores_gemma":[0.4162287,0.0000032109028,0.583382,0.00011463033,0.0002521708,0.0000032916132,0.0000021107132,0.000003752228,0.000010094727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832445,0.000026534213,0.00053429906,0.00024254473,0.00067191396,0.0002002672],"domain_scores_gemma":[0.99682206,0.00063362095,0.00059030025,0.000289866,0.0015703135,0.000093834526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010455672,0.00010474817,0.00017476229,0.00046865456,0.00016104123,0.00047160688,0.0026049868,0.00002704171,0.000017788727],"category_scores_gemma":[0.00018941988,0.000093959265,0.00013152987,0.00030493998,0.0002852047,0.0013826564,0.00016879152,0.00006669148,0.0000038048875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001196648,0.0003379331,0.00006251855,0.000008961214,0.00006025287,0.0000062987274,0.0010708723,0.015855601,0.0030703715,0.062348615,0.0004068219,0.9167598],"study_design_scores_gemma":[0.0007968201,0.00030316747,0.00020910666,0.00005241596,0.000007765319,0.00015170747,0.00005412672,0.9905261,0.004742849,0.0019137909,0.0011365281,0.00010565588],"about_ca_topic_score_codex":0.0000020703756,"about_ca_topic_score_gemma":2.3098838e-7,"teacher_disagreement_score":0.97467047,"about_ca_system_score_codex":0.00006829335,"about_ca_system_score_gemma":0.00015869369,"threshold_uncertainty_score":0.4840757},"labels":[],"label_agreement":null},{"id":"W1993821074","doi":"10.1142/s0129054107004826","title":"OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Torus; Computer science; Enhanced Data Rates for GSM Evolution; Security token; Compass; Computation; Property (philosophy); Sense (electronics); Orientation (vector space); Task (project management); Mathematics; Algorithm; Artificial intelligence; Geometry; Computer network","score_opus":0.012770053744457445,"score_gpt":0.3117274546573193,"score_spread":0.2989574009128619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993821074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27444088,0.000026138052,0.7242029,0.00015964425,0.0008942258,0.0000707393,0.0000026965176,0.000005489457,0.0001973155],"genre_scores_gemma":[0.67406934,0.0000352181,0.3258353,0.00001663107,0.000031629726,7.2856534e-7,8.840316e-7,0.0000017630633,0.000008506699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978345,0.00004413016,0.00085405423,0.00015044502,0.0009825646,0.00013429816],"domain_scores_gemma":[0.99676806,0.00014426044,0.00080680114,0.0001678359,0.0020413348,0.00007170576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016718952,0.00007047707,0.00017210162,0.0009605295,0.000040059487,0.00006963748,0.00090109435,0.00002825105,0.000013678145],"category_scores_gemma":[0.000095627795,0.00006762861,0.00007573066,0.0009249262,0.0003883626,0.0012122334,0.00016751826,0.000102892365,8.217083e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018725783,0.0015920914,0.007909157,0.000042585412,0.00014279688,0.00004127072,0.0051911925,0.29739133,0.104496986,0.06524675,0.0004360578,0.51732254],"study_design_scores_gemma":[0.003003076,0.0016341967,0.028510481,0.0004843793,0.000015595175,0.0009289095,0.00031855752,0.7783346,0.18081461,0.0031163134,0.002479254,0.0003600425],"about_ca_topic_score_codex":0.000039499453,"about_ca_topic_score_gemma":0.000005655035,"teacher_disagreement_score":0.51696247,"about_ca_system_score_codex":0.0001289216,"about_ca_system_score_gemma":0.0003466804,"threshold_uncertainty_score":0.27578148},"labels":[],"label_agreement":null},{"id":"W1994122595","doi":"10.1142/s0129054103002138","title":"COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unary operation; Mathematics; Combinatorics; Deterministic finite automaton; Upper and lower bounds; Alphabet; Discrete mathematics; Integer (computer science); Nondeterministic finite automaton; Quantum finite automata; Regular language; Automaton; Finite-state machine; Algorithm; Automata theory; Computer science; Theoretical computer science","score_opus":0.009420720844945022,"score_gpt":0.2876393450828633,"score_spread":0.2782186242379183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994122595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27298307,0.00006364044,0.7242616,0.0009913943,0.001149977,0.0000327773,0.0000027371111,0.000008717349,0.0005061388],"genre_scores_gemma":[0.8779517,0.000018410408,0.12178225,0.00016274818,0.00006297246,6.4938405e-7,7.292062e-7,0.0000031753718,0.000017353083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790365,0.000074401556,0.0006288887,0.00015822826,0.0010704075,0.00016440042],"domain_scores_gemma":[0.9968911,0.00042202973,0.000824215,0.00026121593,0.0015483616,0.000053102758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019224212,0.00009093989,0.00015633827,0.00021522079,0.00014670221,0.00028528404,0.002782609,0.000017134353,0.000032302178],"category_scores_gemma":[0.00021210575,0.000065914595,0.00009508502,0.00057318347,0.0004433037,0.0014523261,0.00021866975,0.000109118715,0.0000041737903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029448998,0.00052865007,0.009638851,0.000019178193,0.00026482082,0.000019775951,0.0051102014,0.008294003,0.03103008,0.8417147,0.0035357538,0.09981458],"study_design_scores_gemma":[0.0024362758,0.00040554284,0.015972907,0.00053286157,0.00005248146,0.0017649251,0.0008350748,0.693938,0.12056488,0.13697007,0.02584009,0.0006868625],"about_ca_topic_score_codex":0.0000145507,"about_ca_topic_score_gemma":5.124869e-7,"teacher_disagreement_score":0.7047446,"about_ca_system_score_codex":0.000057833728,"about_ca_system_score_gemma":0.00036300588,"threshold_uncertainty_score":0.51708263},"labels":[],"label_agreement":null},{"id":"W1994343490","doi":"10.1142/s0129054111008945","title":"SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Schema (genetic algorithms); Computer science; Tuple; Inverse; Regular language; Theoretical computer science; Mathematics; Algorithm; Programming language; Discrete mathematics; Automaton","score_opus":0.0348316647130958,"score_gpt":0.2930144194345859,"score_spread":0.2581827547214901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994343490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07451221,0.000070748305,0.9237387,0.00066337717,0.0007732,0.000066796216,0.0000015781023,0.0000139798685,0.000159405],"genre_scores_gemma":[0.5643983,0.000021147147,0.43536034,0.00012564087,0.00008681808,0.000001397974,6.4805744e-7,0.000001725032,0.0000039746838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988355,0.000021177875,0.00042106071,0.00016373544,0.00045220775,0.00010629285],"domain_scores_gemma":[0.9977031,0.0001005837,0.00044002596,0.00018978483,0.0014982128,0.00006832996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000921844,0.00006998107,0.000122043726,0.0004023785,0.00009798667,0.000175298,0.0014742882,0.000020971223,0.000009205584],"category_scores_gemma":[0.0001064597,0.000060880437,0.0000657459,0.00030433817,0.00022676324,0.0018601922,0.00020610758,0.000056906658,0.000001905293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054555305,0.00018853604,0.0010537623,0.000013227469,0.00008189601,0.0000073292663,0.0012231866,0.00015364934,0.005599864,0.7700448,0.00029987685,0.22127931],"study_design_scores_gemma":[0.0029161852,0.0012682057,0.0945101,0.0004985639,0.00004054992,0.0012671627,0.000076916884,0.55329436,0.0229702,0.31688225,0.00577367,0.0005018114],"about_ca_topic_score_codex":0.0000041132434,"about_ca_topic_score_gemma":4.475781e-7,"teacher_disagreement_score":0.5531407,"about_ca_system_score_codex":0.00003758584,"about_ca_system_score_gemma":0.00016400739,"threshold_uncertainty_score":0.2739619},"labels":[],"label_agreement":null},{"id":"W1994383533","doi":"10.1142/s0129054105003157","title":"STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monoid; State (computer science); Syntactic monoid; Set (abstract data type); Root (linguistics); Mathematics; Free monoid; Regular language; Finite-state machine; Finite set; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","score_opus":0.02362928073566646,"score_gpt":0.2931312758776484,"score_spread":0.269501995141982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994383533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20060815,0.00006407322,0.7958196,0.0029751617,0.0002989211,0.000057614754,0.000014609709,0.0000051251113,0.00015677908],"genre_scores_gemma":[0.8678965,0.000052712323,0.13189788,0.00010270799,0.00004291895,6.750583e-7,7.5004107e-7,0.0000015579978,0.00000432028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982924,0.00006162865,0.0007303647,0.000100762,0.0007186124,0.00009626817],"domain_scores_gemma":[0.9973412,0.00042518243,0.00075948745,0.00022771032,0.0011994716,0.00004695609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014716861,0.00007101161,0.00019426431,0.00038564316,0.00008649602,0.00011335158,0.0019775934,0.000012553436,0.000008947511],"category_scores_gemma":[0.000083843675,0.000049740956,0.00009518789,0.00041778947,0.0012003276,0.0016762345,0.00020985842,0.00008842015,0.0000010315367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000953148,0.0002713031,0.00045704746,0.000023155817,0.00014830739,0.0000020237271,0.012953534,0.037822016,0.0027847055,0.68831784,0.00014000207,0.25698477],"study_design_scores_gemma":[0.0015379424,0.00014037151,0.008499186,0.00011102908,0.0000129976015,0.00012802465,0.00006153894,0.90161705,0.009017411,0.07816547,0.00061813387,0.0000908293],"about_ca_topic_score_codex":0.000019389241,"about_ca_topic_score_gemma":0.0000059443496,"teacher_disagreement_score":0.86379504,"about_ca_system_score_codex":0.000028053124,"about_ca_system_score_gemma":0.00023599078,"threshold_uncertainty_score":0.44226575},"labels":[],"label_agreement":null},{"id":"W1996179839","doi":"10.1142/s012905410600398x","title":"PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Centre National de la Recherche Scientifique","keywords":"Corollary; Mathematics; Combinatorics; Property (philosophy); Square lattice; Lattice (music); Reentrancy; Hexagonal lattice; Hexagonal crystal system; Discrete valuation; Polyomino; Salient; Discrete mathematics; Pure mathematics; Geometry; Computer science; Statistical physics","score_opus":0.018182904026323252,"score_gpt":0.28407451216717167,"score_spread":0.2658916081408484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996179839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15022321,0.00007353654,0.84687066,0.0012944688,0.00070996716,0.00006235792,0.0000038700737,0.000013397244,0.0007485315],"genre_scores_gemma":[0.8191519,0.0000031584912,0.18074375,0.000035450434,0.000043598193,6.802622e-7,1.8459056e-7,0.0000023589803,0.000018949198],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99789006,0.000030516589,0.00068368,0.00013048854,0.0011604757,0.0001047835],"domain_scores_gemma":[0.9956515,0.000053202817,0.0011159325,0.00030741768,0.002843344,0.00002864827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063069584,0.00007937564,0.00016542837,0.0003136745,0.000059572136,0.00024458737,0.003922811,0.000016977878,0.0000015635474],"category_scores_gemma":[0.00013796175,0.00005231437,0.000114499555,0.0005198226,0.0008032223,0.0023969077,0.00058233144,0.00007956548,4.6818934e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063913525,0.0012179123,0.011198625,0.000116456096,0.00016672962,0.000016453621,0.0022127314,0.006343548,0.36675274,0.36459962,0.0017004207,0.24561085],"study_design_scores_gemma":[0.0005630734,0.00029277243,0.034010388,0.0011594897,0.000015824242,0.00025014556,0.000021578371,0.08701527,0.7987954,0.07712934,0.00054265355,0.00020403795],"about_ca_topic_score_codex":0.00003720118,"about_ca_topic_score_gemma":0.000003046769,"teacher_disagreement_score":0.6689286,"about_ca_system_score_codex":0.00005152686,"about_ca_system_score_gemma":0.0006086025,"threshold_uncertainty_score":0.7289624},"labels":[],"label_agreement":null},{"id":"W1998843387","doi":"10.1142/s0129054108006157","title":"COMPUTATION BY ANNOTATION: MODELLING EPIGENETIC REGULATION","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Genomics and Chromatin Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Modulo; Annotation; Substring; Set (abstract data type); Epigenetics; Theoretical computer science; Computation; Artificial intelligence; Programming language; Biology; Gene; Mathematics; Genetics; Discrete mathematics","score_opus":0.014117441606460578,"score_gpt":0.26748335123122624,"score_spread":0.2533659096247657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998843387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46364975,0.00004292419,0.53576267,0.00010900209,0.00034943447,0.000022756081,0.0000035333196,0.0000012155944,0.000058690373],"genre_scores_gemma":[0.89694774,0.000086592314,0.10268366,0.000041763673,0.00017650671,5.223168e-7,0.000034627214,0.000004377655,0.00002423086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989517,0.00001783468,0.00039399377,0.00012346616,0.00043453067,0.00007851871],"domain_scores_gemma":[0.997991,0.000016062635,0.00042033903,0.00009989448,0.0014284356,0.000044229688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025600256,0.000063406274,0.000081723585,0.00016019492,0.00010348814,0.000043305303,0.0004452616,0.000027962362,0.00000489138],"category_scores_gemma":[0.000025803482,0.00006494155,0.000058420726,0.0001442484,0.00022089519,0.00004020476,0.000065485794,0.000041927786,0.0000015436835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028231752,0.0001062819,0.0010275694,0.0000032584542,0.000048383157,0.0000019577737,0.0002355354,0.8048155,0.18202507,0.0005364132,0.00073382375,0.01043799],"study_design_scores_gemma":[0.000752849,0.00036384762,0.010385995,0.000034518198,0.00001193423,0.00036098892,0.000023254674,0.92698604,0.05688994,0.0022432662,0.001778498,0.00016885587],"about_ca_topic_score_codex":0.0000044853214,"about_ca_topic_score_gemma":8.216173e-7,"teacher_disagreement_score":0.43329796,"about_ca_system_score_codex":0.000036939662,"about_ca_system_score_gemma":0.00025945937,"threshold_uncertainty_score":0.26482397},"labels":[],"label_agreement":null},{"id":"W1999219034","doi":"10.1142/s0129054110007118","title":"APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Polynomial-time approximation scheme; Approximation algorithm; Job shop scheduling; Time complexity; Mathematics; Algorithm","score_opus":0.01225638514331587,"score_gpt":0.2719652398540387,"score_spread":0.2597088547107228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999219034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19200195,0.000009050653,0.80585253,0.00019135262,0.0017268924,0.00007272781,0.0000044510593,0.00002333162,0.000117709205],"genre_scores_gemma":[0.5046532,0.0000033775173,0.4951652,0.000011643724,0.0001563168,0.0000020417206,0.0000019161514,0.000004105429,0.00000217493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989245,0.000005850951,0.00036004806,0.00010046846,0.0004982339,0.00011090059],"domain_scores_gemma":[0.99765056,0.000113087335,0.00022800009,0.000109074936,0.0018337504,0.00006553792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057095767,0.00007936843,0.00011083794,0.0003689212,0.00007884981,0.00017136728,0.00062618905,0.000029584075,0.000020289914],"category_scores_gemma":[0.00018524009,0.000069580354,0.000045666606,0.00027657155,0.0003683715,0.000792212,0.000026554282,0.00014812576,0.0000015078351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003373428,0.00009795309,0.0015458114,0.000027419284,0.00011873187,0.0000021746625,0.00069681054,0.755022,0.024420021,0.021733977,0.000024070565,0.19627728],"study_design_scores_gemma":[0.0005265847,0.00007001258,0.0009638957,0.000086989356,0.000007557457,0.00011572401,0.000043595493,0.9759645,0.021350794,0.0006035814,0.00017167689,0.000095105905],"about_ca_topic_score_codex":7.020356e-7,"about_ca_topic_score_gemma":0.0000020692596,"teacher_disagreement_score":0.31265128,"about_ca_system_score_codex":0.000036228827,"about_ca_system_score_gemma":0.0002342327,"threshold_uncertainty_score":0.28374046},"labels":[],"label_agreement":null},{"id":"W1999567003","doi":"10.1142/s0129054103001790","title":"Interconnection Networks and Their Eigenvalues","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Interconnection; Hypercube; Eigenvalues and eigenvectors; Computer science; Graph; Line graph; Graph theory; Spectral graph theory; Topology (electrical circuits); Theoretical computer science; Mathematics; Parallel computing; Combinatorics; Voltage graph; Physics; Computer network","score_opus":0.015123795068053699,"score_gpt":0.26573969360016186,"score_spread":0.25061589853210814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999567003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05643754,0.0001397016,0.9360683,0.00038089,0.006255041,0.000049777354,4.5605847e-7,0.00001462331,0.00065368187],"genre_scores_gemma":[0.96480644,0.000051975305,0.03471721,0.00012689726,0.00027576674,0.0000010645051,2.5747508e-7,0.0000035375676,0.000016844022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851966,0.00009443447,0.0005880714,0.00020278421,0.000444148,0.00015087453],"domain_scores_gemma":[0.99731076,0.00018672133,0.0005283384,0.00022484858,0.001659804,0.00008952381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015605912,0.000105706145,0.00017979192,0.00053908577,0.0001436814,0.00044754843,0.0012974489,0.000033588,0.000011352615],"category_scores_gemma":[0.000133867,0.00008312525,0.00009560046,0.00047952254,0.00024665147,0.0018169876,0.00016540519,0.00013491156,0.0000018319063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020775236,0.00019884134,0.0022655944,0.00000743978,0.00018215607,0.000011946577,0.002351158,0.046246488,0.0023238398,0.75160795,0.0005857408,0.19419804],"study_design_scores_gemma":[0.0007763456,0.00051444053,0.0037652806,0.00021878946,0.00000858898,0.0021906006,0.00020234573,0.95408344,0.006866826,0.021602752,0.009503144,0.00026743708],"about_ca_topic_score_codex":0.00000883515,"about_ca_topic_score_gemma":0.0000042968595,"teacher_disagreement_score":0.9083689,"about_ca_system_score_codex":0.000083209416,"about_ca_system_score_gemma":0.00019363669,"threshold_uncertainty_score":0.431572},"labels":[],"label_agreement":null},{"id":"W2001273190","doi":"10.1142/s0129054112400461","title":"STATE COMPLEXITY AND APPROXIMATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computational complexity theory; Computer science; Theoretical computer science; Quantum complexity theory; Mathematics; Algorithm; Quantum computer","score_opus":0.0314267423021446,"score_gpt":0.3057200336348058,"score_spread":0.2742932913326612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001273190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2381769,0.000056766236,0.7595593,0.0006750331,0.0013201003,0.000029815079,0.0000015043344,0.000011496722,0.00016909587],"genre_scores_gemma":[0.72747165,0.000012121071,0.27229202,0.000094520125,0.00012301198,3.717924e-7,4.724427e-7,0.0000015801843,0.000004251585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998619,0.000035993275,0.00038865444,0.00010812606,0.0007001318,0.00014807058],"domain_scores_gemma":[0.9983174,0.00011052983,0.00044872088,0.0001815565,0.000835674,0.00010609466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013420861,0.00006805473,0.0001154314,0.0003989813,0.0000916146,0.00025558885,0.0014420301,0.000012485663,0.000007576619],"category_scores_gemma":[0.00006916944,0.00005818746,0.00004364943,0.00032866825,0.000404693,0.0036737258,0.00035190905,0.00007546242,0.0000041639573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010754506,0.00024488746,0.004678679,0.000008076308,0.000048334743,0.0000030673632,0.0025993753,0.00045123356,0.00505609,0.629798,0.00015346929,0.35694802],"study_design_scores_gemma":[0.0012291985,0.0003014278,0.2666045,0.00016698257,0.0000159049,0.0012527974,0.000077173194,0.49257642,0.021308795,0.21300696,0.0030806107,0.00037920917],"about_ca_topic_score_codex":0.000005806207,"about_ca_topic_score_gemma":4.4971108e-7,"teacher_disagreement_score":0.49212518,"about_ca_system_score_codex":0.000053829477,"about_ca_system_score_gemma":0.00013324841,"threshold_uncertainty_score":0.26796746},"labels":[],"label_agreement":null},{"id":"W2001444496","doi":"10.1142/s0129054105003030","title":"APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; McMaster University","keywords":"Job shop scheduling; Job shop; Mathematical optimization; Generalization; Approximation algorithm; Scheduling (production processes); Computer science; Scheme (mathematics); Flow shop scheduling; Algorithm; Process (computing); Mathematics","score_opus":0.027334795925260096,"score_gpt":0.2993553875880289,"score_spread":0.27202059166276876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001444496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011390247,0.00006225438,0.98544466,0.00063211273,0.0019447866,0.00009437454,0.000005879942,0.000046928337,0.00037875533],"genre_scores_gemma":[0.27113318,0.000024278455,0.72819126,0.00003769785,0.0005640781,0.000004087317,0.0000046021446,0.0000073277142,0.00003349431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873203,0.0000068158247,0.0004958325,0.00009684452,0.00054815155,0.00012031704],"domain_scores_gemma":[0.99796546,0.00007224743,0.00020165427,0.00010423729,0.0015937262,0.00006265226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760589,0.00007875459,0.00011795212,0.00048981345,0.00007088691,0.00016607583,0.0006768922,0.000026604082,0.000020453801],"category_scores_gemma":[0.00006754766,0.00007530671,0.000076494354,0.00032626174,0.000115220006,0.0010689273,0.000033766803,0.000078623765,0.0000054901834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004233199,0.00003756093,0.00005279447,0.000007390469,0.000032874446,2.1439682e-7,0.000273034,0.8612276,0.00079563435,0.0023175862,0.00017895327,0.13507217],"study_design_scores_gemma":[0.0004372624,0.00005266986,0.0002884436,0.000050204817,0.0000075401163,0.000041924188,0.000016917349,0.99001336,0.0064098686,0.00083922845,0.0017642892,0.00007827438],"about_ca_topic_score_codex":9.4622214e-7,"about_ca_topic_score_gemma":8.181965e-7,"teacher_disagreement_score":0.25974292,"about_ca_system_score_codex":0.0001223933,"about_ca_system_score_gemma":0.00013552666,"threshold_uncertainty_score":0.30709183},"labels":[],"label_agreement":null},{"id":"W2001923775","doi":"10.1142/s0129054106004467","title":"A SIMPLE ALPHABET-INDEPENDENT FM-INDEX","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Huffman coding; Substring; Alphabet; Algorithm; Computer science; Mathematics; Entropy (arrow of time); Simple (philosophy); Combinatorics; Order (exchange); Index (typography); Discrete mathematics; Data structure; Data compression; Physics","score_opus":0.010574547236751025,"score_gpt":0.28722827318768845,"score_spread":0.2766537259509374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001923775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039095156,0.000044213237,0.9572037,0.00077077595,0.0023356215,0.000051976538,0.000005812283,0.00002083924,0.00047189774],"genre_scores_gemma":[0.83074605,0.0000063875177,0.16870391,0.000097399105,0.0004194471,6.1105e-7,0.0000034116947,0.0000034963725,0.000019275074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970569,0.00003278736,0.0007023101,0.00025625684,0.0017460735,0.00020566539],"domain_scores_gemma":[0.9967092,0.00011176769,0.0007069386,0.00040859627,0.0019646361,0.0000988417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082558574,0.000115631956,0.00017942883,0.0006785233,0.00015813339,0.000552425,0.004117552,0.000030447958,0.000027330272],"category_scores_gemma":[0.000048673344,0.00009843816,0.00011646755,0.0005938465,0.00024507867,0.003054596,0.00075337116,0.00014125727,0.0000114626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057044526,0.0013591812,0.017152848,0.000013305922,0.00014893699,0.000190841,0.00047233602,0.056994807,0.01678605,0.35029328,0.008470036,0.5480613],"study_design_scores_gemma":[0.0013485291,0.000290278,0.11489531,0.0000992821,0.000010953978,0.00057410105,0.000014964874,0.7939208,0.010205282,0.06148019,0.016855847,0.000304436],"about_ca_topic_score_codex":0.00009076729,"about_ca_topic_score_gemma":0.000008424704,"teacher_disagreement_score":0.7916509,"about_ca_system_score_codex":0.00012429254,"about_ca_system_score_gemma":0.0004616664,"threshold_uncertainty_score":0.7651505},"labels":[],"label_agreement":null},{"id":"W2003022262","doi":"10.1142/s0129054108005620","title":"AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; String (physics); Combinatorics; Mathematics; Sequence (biology); Function (biology); Discrete mathematics; Mathematical analysis; Mathematical physics","score_opus":0.026011521341616408,"score_gpt":0.32900960936328133,"score_spread":0.30299808802166495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003022262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29056367,0.000018647797,0.7077126,0.00035774865,0.0012421589,0.0000612688,0.0000044138096,0.0000040324576,0.000035464935],"genre_scores_gemma":[0.76827455,0.00001784958,0.23151653,0.000044582022,0.00013688252,0.000001467297,8.6519907e-7,0.0000024296683,0.000004867499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982067,0.000023955223,0.0005693358,0.00017546372,0.00087752944,0.00014704201],"domain_scores_gemma":[0.9974739,0.00029428685,0.0004989747,0.000345438,0.0013267662,0.000060612434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497873,0.00007998155,0.0001516336,0.00032609748,0.00015948823,0.00016965615,0.0033055868,0.000020884827,0.000011147364],"category_scores_gemma":[0.00008335526,0.000058271853,0.00008774636,0.0004706735,0.00037881688,0.0024506012,0.00029822206,0.00010670949,0.0000015095095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033356418,0.003227313,0.041741535,0.0000359115,0.000280249,0.00014089592,0.006785622,0.100570805,0.017745428,0.35931963,0.0010272259,0.4687918],"study_design_scores_gemma":[0.0012599654,0.00041220908,0.13275579,0.00016902343,0.000009202214,0.00078058476,0.00003397172,0.8490372,0.0032306514,0.010871367,0.0012716283,0.00016840843],"about_ca_topic_score_codex":0.00003902504,"about_ca_topic_score_gemma":0.000005983216,"teacher_disagreement_score":0.7484664,"about_ca_system_score_codex":0.00006944196,"about_ca_system_score_gemma":0.00054161006,"threshold_uncertainty_score":0.61426574},"labels":[],"label_agreement":null},{"id":"W2010556217","doi":"10.1142/s0129054111008556","title":"BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Speedup; Matrix multiplication; Computation; Computer science; Parallel computing; Univariate; Multiplication algorithm; Symbolic computation; Bivariate analysis; Polynomial; Fast Fourier transform; Mathematics; Arithmetic; Algorithm; Combinatorics; Multivariate statistics","score_opus":0.0428232199411026,"score_gpt":0.3180081989553516,"score_spread":0.275184979014249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010556217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03666643,0.000013124806,0.96078247,0.00036916297,0.0015281537,0.0000730032,0.0000015308638,0.000057002533,0.0005091396],"genre_scores_gemma":[0.5400647,0.000010428022,0.45970795,0.0001195984,0.00008284048,0.0000011312558,5.426343e-7,0.0000026180849,0.000010221302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981974,0.000047945687,0.00059249514,0.00024350274,0.00076425786,0.00015443616],"domain_scores_gemma":[0.99674636,0.00010829121,0.00074347726,0.00037288867,0.0019343871,0.000094570125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333399,0.000111449284,0.00015811279,0.0007866977,0.00012481584,0.00018067707,0.0031388686,0.000033847762,0.000009153184],"category_scores_gemma":[0.00017280663,0.00009984373,0.00010100209,0.0005096654,0.00026274062,0.0012042559,0.00028165488,0.00012708716,0.000011042892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003899811,0.0038193366,0.0152182,0.00001914036,0.00033495546,0.00008275551,0.010820617,0.07210596,0.023968717,0.18710415,0.0045714527,0.68156475],"study_design_scores_gemma":[0.0013943373,0.0006304096,0.07519676,0.00015603169,0.000009154347,0.00020056096,0.000014686004,0.85345006,0.064898595,0.002927197,0.0008305003,0.0002917281],"about_ca_topic_score_codex":0.000018082332,"about_ca_topic_score_gemma":0.0000014299884,"teacher_disagreement_score":0.78134406,"about_ca_system_score_codex":0.00010221834,"about_ca_system_score_gemma":0.0003202995,"threshold_uncertainty_score":0.5832851},"labels":[],"label_agreement":null},{"id":"W2011276709","doi":"10.1142/s0129054114400152","title":"DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Axiom; Mathematics; Descriptive complexity theory; Complexity class; Quantum complexity theory; Discrete mathematics; Theoretical computer science; Computer science; Time complexity; Quantum; Quantum information","score_opus":0.07310804458958418,"score_gpt":0.33139587111233093,"score_spread":0.25828782652274673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011276709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11342187,0.00002237734,0.88033026,0.0031638115,0.0025275287,0.00014276175,0.000006712533,0.000029702962,0.0003549804],"genre_scores_gemma":[0.56861365,0.000004287445,0.43100402,0.00016537718,0.00020053667,0.0000020005605,0.0000021487795,0.0000034906952,0.0000045069373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576503,0.00023286632,0.0011617831,0.0004419296,0.0020585805,0.00033979522],"domain_scores_gemma":[0.9952078,0.000486014,0.00089548423,0.0005113327,0.0027152735,0.00018411144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029943387,0.00019850048,0.0003983277,0.0012222619,0.000178325,0.00065037684,0.0050289147,0.00004156247,0.00004129791],"category_scores_gemma":[0.00034644757,0.00018778612,0.00016211778,0.0012207297,0.0014821975,0.0025922377,0.00092037115,0.00028823366,0.000013874439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071381844,0.001464638,0.014064449,0.000037079797,0.00009385549,0.000032576543,0.0018480206,0.040029947,0.0017798791,0.7740274,0.0002704601,0.16628031],"study_design_scores_gemma":[0.00087817543,0.00036202717,0.07026854,0.00009100715,0.0000047430217,0.0002199948,0.000025065861,0.6964021,0.0004969799,0.22983518,0.0012035292,0.00021270917],"about_ca_topic_score_codex":0.00007569967,"about_ca_topic_score_gemma":0.00007692318,"teacher_disagreement_score":0.65637213,"about_ca_system_score_codex":0.00037089878,"about_ca_system_score_gemma":0.0007543377,"threshold_uncertainty_score":0.9345058},"labels":[],"label_agreement":null},{"id":"W2011421072","doi":"10.1142/s0129054108006327","title":"USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Black hole (networking); Ring (chemistry); Security token; Mobile agent; Node (physics); Computer science; Ring network; Token ring; Combinatorics; Physics; Topology (electrical circuits); Mathematics; Computer network; Quantum mechanics; Network topology; Routing (electronic design automation)","score_opus":0.051765157949220264,"score_gpt":0.317240406160664,"score_spread":0.26547524821144375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011421072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49046183,0.0000046387204,0.5087352,0.00019472475,0.00044046948,0.00011852405,7.483511e-7,0.000009021283,0.000034880788],"genre_scores_gemma":[0.72863907,0.000005595904,0.2709767,0.00025183614,0.00011060314,0.00000396879,9.436321e-7,0.0000053006884,0.000006000938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973514,0.000065305874,0.00063883304,0.00035525893,0.0013150751,0.00027412907],"domain_scores_gemma":[0.9975139,0.00005078492,0.00047710113,0.00045729018,0.0013154785,0.00018546995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073260965,0.00013981067,0.00019783933,0.0011940814,0.00014365099,0.00023595686,0.0028144526,0.00001835782,0.000013464395],"category_scores_gemma":[0.000020981455,0.00012852805,0.00005675098,0.0015570716,0.0003054786,0.0023640378,0.00056234084,0.00012716869,0.000008859292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030762058,0.0002322653,0.005440594,0.0000036120791,0.000035860445,0.0001480121,0.0016725375,0.96511954,0.001276551,0.0015670067,0.000053545416,0.024419695],"study_design_scores_gemma":[0.0009488238,0.00051418855,0.030350747,0.00018690964,0.000007235285,0.00016542943,0.000039227965,0.96359664,0.003243413,0.00015377923,0.00060344825,0.00019015196],"about_ca_topic_score_codex":0.00003767519,"about_ca_topic_score_gemma":0.000019545038,"teacher_disagreement_score":0.23817724,"about_ca_system_score_codex":0.00037266265,"about_ca_system_score_gemma":0.00045653834,"threshold_uncertainty_score":0.5241222},"labels":[],"label_agreement":null},{"id":"W2017338196","doi":"10.1142/s0129054111007964","title":"ORTHOGONAL SHUFFLE ON TRAJECTORIES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Corollary; Catenation; Set (abstract data type); Orthogonal array; Computer science; Literal (mathematical logic); Trajectory; Combinatorics; Mathematics; Arithmetic; Algorithm; Geometry; Programming language","score_opus":0.03615053148239461,"score_gpt":0.30310088824732984,"score_spread":0.2669503567649352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017338196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89307845,0.000016298914,0.102215275,0.00010128604,0.0012293024,0.000022692686,0.0000026260582,0.000002533884,0.0033315576],"genre_scores_gemma":[0.97192186,0.000008994779,0.0275541,0.00013781227,0.00034031962,2.7074532e-7,0.0000032301946,0.0000019217407,0.00003151566],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921983,0.000017820843,0.00025203254,0.000111116904,0.00031723434,0.00008193471],"domain_scores_gemma":[0.99888223,0.00001953095,0.00022130003,0.000091782094,0.0007413131,0.000043810483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034348635,0.000054924167,0.00007180505,0.00012216736,0.000049051454,0.000031660926,0.00070333673,0.000023774874,0.000026314256],"category_scores_gemma":[0.00009609675,0.00004141603,0.000073786505,0.00010915727,0.00025917005,0.00001984398,0.00011043551,0.000055429835,0.0000047393955],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008242139,0.0014710359,0.053878017,0.000009936191,0.000381125,0.00004429921,0.00080691685,0.0021613387,0.62036026,0.07831284,0.00235933,0.23939072],"study_design_scores_gemma":[0.0017008847,0.0063703456,0.3938976,0.00017234356,0.000029874487,0.0005530011,0.000081844366,0.00220985,0.5519253,0.007611172,0.03493026,0.00051754457],"about_ca_topic_score_codex":0.0000014868307,"about_ca_topic_score_gemma":0.00000125016,"teacher_disagreement_score":0.34001955,"about_ca_system_score_codex":0.000012908866,"about_ca_system_score_gemma":0.0001532077,"threshold_uncertainty_score":0.16888967},"labels":[],"label_agreement":null},{"id":"W2017404547","doi":"10.1142/s0129054108006200","title":"WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Watson; Alphabet; Monoid; Prefix; Suffix; Combinatorics; Mathematics; Word (group theory); DNA; Discrete mathematics; Computer science; Base pair; Linguistics; Biology; Genetics; Philosophy; Natural language processing","score_opus":0.018994772658084556,"score_gpt":0.2844391777177993,"score_spread":0.2654444050597147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017404547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415783,0.0001414248,0.15723959,0.0003677005,0.00048189156,0.000023498136,0.0000017113706,0.0000021172962,0.00016374976],"genre_scores_gemma":[0.982706,0.00012140793,0.016764347,0.00012381567,0.0002621005,2.9982579e-7,0.0000025776426,0.0000021995804,0.000017228283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992887,0.00002173282,0.00025676377,0.00012807731,0.00021214249,0.00009257779],"domain_scores_gemma":[0.99900866,0.000037573664,0.00022078265,0.000093049115,0.00058560685,0.000054329765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028332637,0.000065631946,0.00009430971,0.00011808938,0.000099409655,0.00004496349,0.0005339905,0.000025916499,0.0000052281375],"category_scores_gemma":[0.000117469994,0.000046659206,0.000056559158,0.00012147442,0.0003443369,0.000030567662,0.00019347573,0.0000616391,8.1253927e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015964833,0.0003708837,0.028411347,0.000008275426,0.00020941286,0.000025568535,0.0008108917,0.0015705063,0.78251964,0.0013627794,0.00056839763,0.18398267],"study_design_scores_gemma":[0.0035627566,0.0041477415,0.32603619,0.00027340162,0.000041796342,0.006901257,0.0004037613,0.042542562,0.5651186,0.0058126394,0.04417739,0.0009818925],"about_ca_topic_score_codex":0.000004228327,"about_ca_topic_score_gemma":9.7998e-7,"teacher_disagreement_score":0.29762483,"about_ca_system_score_codex":0.000014600488,"about_ca_system_score_gemma":0.00015268757,"threshold_uncertainty_score":0.19027072},"labels":[],"label_agreement":null},{"id":"W2021056221","doi":"10.1142/s0129054108005863","title":"AVOIDING APPROXIMATE SQUARES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alphabet; Mathematics; Combinatorics; Least-squares function approximation; Word (group theory); Variation (astronomy); Discrete mathematics; Algorithm; Statistics; Physics; Philosophy","score_opus":0.023775864139508048,"score_gpt":0.2867096296032943,"score_spread":0.2629337654637863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021056221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19217764,0.00005075161,0.80481166,0.00068609987,0.0018623414,0.000028820054,0.0000010749329,0.00002260478,0.00035898635],"genre_scores_gemma":[0.7921951,0.000033662527,0.20745613,0.00011991755,0.00017936232,5.407395e-7,3.8360037e-7,0.0000026581247,0.000012241425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980084,0.0000556969,0.00051728025,0.00017844787,0.0010822277,0.00015797971],"domain_scores_gemma":[0.9974987,0.00021726431,0.00053690735,0.000267734,0.0013939133,0.000085496315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013199003,0.00008736946,0.00015085853,0.0006420151,0.00028693787,0.00021942108,0.0035587158,0.0000189098,0.000013836995],"category_scores_gemma":[0.00017974507,0.00007504488,0.000105187486,0.00057488034,0.0004325925,0.0025779987,0.00040824208,0.00016098273,0.000009038295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003121475,0.0005525313,0.0024452775,0.000013050716,0.00014289684,0.0002606563,0.00616888,0.010293415,0.025506416,0.6721443,0.0012223048,0.28121907],"study_design_scores_gemma":[0.0015745512,0.000495749,0.028601842,0.00035744996,0.000014230165,0.008646909,0.00012730644,0.81172377,0.06856101,0.07535564,0.0040275976,0.0005139205],"about_ca_topic_score_codex":0.0000057741363,"about_ca_topic_score_gemma":2.7191248e-7,"teacher_disagreement_score":0.8014304,"about_ca_system_score_codex":0.00007570533,"about_ca_system_score_gemma":0.00041237092,"threshold_uncertainty_score":0.6613039},"labels":[],"label_agreement":null},{"id":"W2021216077","doi":"10.1142/s0129054105003704","title":"SORTING SUFFIXES OF TWO-PATTERN STRINGS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized suffix tree; Mathematics; Recursion (computer science); String (physics); Sorting; Generalization; Morphism; Suffix tree; Set (abstract data type); Lexicographical order; Iterated function; Time complexity; Combinatorics; Trie; Algorithm; Discrete mathematics; Data structure; Computer science","score_opus":0.017952371191051537,"score_gpt":0.3194346811573973,"score_spread":0.3014823099663458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021216077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13929921,0.000038667833,0.85825634,0.0010047413,0.0011589596,0.000033517168,0.0000036057588,0.000010527357,0.000194419],"genre_scores_gemma":[0.6862101,0.0000101584,0.31341955,0.00007556449,0.00027496804,3.0891516e-7,7.930567e-7,0.0000022427525,0.000006354978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975466,0.00002769154,0.00081974204,0.00019378102,0.001255657,0.00015648828],"domain_scores_gemma":[0.9964133,0.00014100765,0.0011029036,0.00032148615,0.0019348637,0.000086437416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093868683,0.000093674615,0.00018556457,0.0006045595,0.00009423726,0.00023291993,0.0035508338,0.000018536924,0.00002005619],"category_scores_gemma":[0.00009156951,0.0000805847,0.00010280405,0.0004669926,0.00025835182,0.0031965359,0.00070928334,0.00012383924,0.000005202894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007457304,0.00025104408,0.0030673814,0.000005953437,0.000046459856,0.000007978039,0.0007967012,0.016767675,0.009609021,0.032482386,0.00021811736,0.9367398],"study_design_scores_gemma":[0.0013006942,0.0003013479,0.017331725,0.0003436417,0.000013112197,0.00033929368,0.000027925156,0.91499937,0.055870198,0.006375491,0.0028583882,0.00023883613],"about_ca_topic_score_codex":0.000032021253,"about_ca_topic_score_gemma":0.0000042885185,"teacher_disagreement_score":0.93650097,"about_ca_system_score_codex":0.00007538328,"about_ca_system_score_gemma":0.00037445285,"threshold_uncertainty_score":0.6598392},"labels":[],"label_agreement":null},{"id":"W2025689196","doi":"10.1142/s0129054105003352","title":"NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Automaton; Artificial intelligence","score_opus":0.009417357858932295,"score_gpt":0.28444976987275594,"score_spread":0.27503241201382367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025689196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39574277,0.000066149725,0.6019495,0.001303026,0.0006797813,0.00003059498,0.0000013735757,0.000007636864,0.00021912798],"genre_scores_gemma":[0.79416525,0.00003398503,0.20549098,0.00014162155,0.0001567918,4.6707956e-7,3.2712268e-7,0.0000024347323,0.000008124654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838006,0.000026876978,0.00055849424,0.00016877179,0.0007419979,0.00012377316],"domain_scores_gemma":[0.9979014,0.00015360353,0.0005903274,0.00025918207,0.001011151,0.0000843788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092186616,0.000085939406,0.00017758503,0.0005989269,0.00007415248,0.00016788334,0.0023589795,0.000023207795,0.000009234563],"category_scores_gemma":[0.000048053284,0.00007509118,0.000072774565,0.00043948213,0.00045306564,0.0021556155,0.00039932216,0.000092926166,0.0000024593755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030849314,0.0004331762,0.003629134,0.000018169398,0.00011495071,0.000025574831,0.0024638567,0.008119054,0.041971497,0.28309515,0.00034812128,0.65975046],"study_design_scores_gemma":[0.0017307727,0.0005894617,0.11061036,0.00046915686,0.00002426619,0.0017107793,0.000062610015,0.7276304,0.104083896,0.049711075,0.002981706,0.0003955156],"about_ca_topic_score_codex":0.0000097818565,"about_ca_topic_score_gemma":0.0000014976335,"teacher_disagreement_score":0.71951133,"about_ca_system_score_codex":0.000057848403,"about_ca_system_score_gemma":0.0003124852,"threshold_uncertainty_score":0.43836102},"labels":[],"label_agreement":null},{"id":"W2028981459","doi":"10.1142/s0129054110007350","title":"COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hierarchy; Class (philosophy); Overhead (engineering); Resolution (logic); Collision; Theoretical computer science; Process (computing); Constant (computer programming); Parallel computing; Distributed computing; Programming language; Artificial intelligence","score_opus":0.022076746715674115,"score_gpt":0.2932556143907607,"score_spread":0.2711788676750866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028981459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06306854,0.000017884764,0.9280986,0.0023019493,0.005736331,0.00007415712,0.0000024612111,0.000009111983,0.0006909758],"genre_scores_gemma":[0.7565377,0.0000042394295,0.24305761,0.000111001784,0.0002697228,0.0000010620589,4.8135854e-7,0.000002697093,0.00001550596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974812,0.000062131476,0.00084014924,0.00017120852,0.0012998672,0.00014540149],"domain_scores_gemma":[0.9944283,0.00043870643,0.0009575247,0.00031563413,0.0037881506,0.00007168482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017161452,0.000094009236,0.00019037617,0.0005100189,0.00018679358,0.0003298139,0.0034178114,0.00003271836,0.000014003446],"category_scores_gemma":[0.000109209206,0.0000678696,0.00014723687,0.00065518625,0.00057688606,0.0017883056,0.0003118382,0.00023579823,0.0000023660377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001370523,0.000103072576,0.00023872998,0.0000034372788,0.000059095088,0.0000036264864,0.0010853505,0.40504923,0.0017524404,0.57106674,0.00045620496,0.020168373],"study_design_scores_gemma":[0.00033377673,0.00009816889,0.0017827353,0.000053640684,0.0000045332213,0.0003536141,0.000024223338,0.9245087,0.00054469646,0.071304165,0.0009176323,0.00007414642],"about_ca_topic_score_codex":0.000021290552,"about_ca_topic_score_gemma":0.000010141445,"teacher_disagreement_score":0.69346917,"about_ca_system_score_codex":0.000047042235,"about_ca_system_score_gemma":0.00064804795,"threshold_uncertainty_score":0.6351201},"labels":[],"label_agreement":null},{"id":"W2030063053","doi":"10.1142/s0129054102001497","title":"CONSTRUCTING RED-BLACK TREE SHAPES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tree (set theory); Correctness; Binary tree; Mathematics; Combinatorics; Sequence (biology); Optimal binary search tree; Random binary tree; K-ary tree; Range tree; Algorithm; Ternary search tree; Weight-balanced tree; Interval tree; Discrete mathematics; Binary search tree; Tree structure; Chemistry","score_opus":0.03742748328499703,"score_gpt":0.30269494474112313,"score_spread":0.2652674614561261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030063053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015472008,0.000030884188,0.9779466,0.0027118283,0.0012806824,0.00003668886,0.0000010460104,0.00026796316,0.002252291],"genre_scores_gemma":[0.57532775,0.000007819819,0.42442408,0.0000905254,0.00013486344,3.5227833e-7,1.488792e-7,0.0000022524066,0.000012185146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980405,0.000032373555,0.0005689518,0.00019987441,0.0009980077,0.00016027717],"domain_scores_gemma":[0.99679077,0.00034034895,0.00065555645,0.00025120133,0.0018765144,0.00008561745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007931378,0.00009526921,0.00015969586,0.0006948585,0.0001066958,0.00040047982,0.0032010777,0.000024859366,0.0000262806],"category_scores_gemma":[0.0005431979,0.0000865906,0.0000956853,0.00066268025,0.00051523175,0.0017171503,0.0003697842,0.00013828247,0.000009428954],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004047915,0.00015156255,0.006466536,0.000004963716,0.000045339693,0.00003131118,0.0008620359,0.000757698,0.00059469347,0.054917492,0.0056698234,0.9304945],"study_design_scores_gemma":[0.00059584226,0.00033333976,0.008835312,0.00031386098,0.000011078328,0.00150699,0.000015463776,0.8908471,0.0041198675,0.09153701,0.001613971,0.00027015118],"about_ca_topic_score_codex":0.0000066352786,"about_ca_topic_score_gemma":0.0000010166498,"teacher_disagreement_score":0.93022436,"about_ca_system_score_codex":0.000115554874,"about_ca_system_score_gemma":0.00014831978,"threshold_uncertainty_score":0.59484524},"labels":[],"label_agreement":null},{"id":"W2030143386","doi":"10.1142/s0129054107005133","title":"REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Assertion; TRACE (psycholinguistics); Automaton; Computer science; Representation (politics); Canonical form; Programming language; Theoretical computer science; Finite-state machine; Software; Formal specification; Automata theory; Focus (optics); Expressive power; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.03604204822379109,"score_gpt":0.3274862886789105,"score_spread":0.2914442404551194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030143386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17775965,0.00014666503,0.8204787,0.00022398746,0.0011525095,0.00006778045,0.0000027087785,0.000010423024,0.0001576221],"genre_scores_gemma":[0.8816725,0.00004468689,0.11810201,0.000015190074,0.00013713312,5.4685904e-7,0.0000032010196,0.0000025224213,0.000022203356],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974313,0.00003801537,0.00096188596,0.00021828857,0.0012009732,0.00014955467],"domain_scores_gemma":[0.9964084,0.00027575434,0.0012509903,0.0002894775,0.001687882,0.00008750713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020724712,0.00008568522,0.0002146772,0.0004782416,0.00008954963,0.000107510474,0.0016248433,0.000039889233,0.0000063361717],"category_scores_gemma":[0.00021802801,0.00007517319,0.00007508199,0.0007052914,0.0005525577,0.0012309909,0.00033242904,0.00009025245,6.395425e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062205276,0.00058507593,0.03350936,0.000054474647,0.00013968714,0.000011137325,0.0033164697,0.0009840543,0.019434074,0.39470813,0.00074737763,0.54644793],"study_design_scores_gemma":[0.004633532,0.0033966026,0.29516402,0.0008048812,0.000114341965,0.0013291202,0.00095499563,0.10399715,0.44929144,0.12239809,0.016720857,0.00119498],"about_ca_topic_score_codex":0.000057179728,"about_ca_topic_score_gemma":0.00001212399,"teacher_disagreement_score":0.70391285,"about_ca_system_score_codex":0.00006990093,"about_ca_system_score_gemma":0.000263701,"threshold_uncertainty_score":0.30654737},"labels":[],"label_agreement":null},{"id":"W2032261263","doi":"10.1142/s0129054107005303","title":"SOLITON AUTOMATA BASED ON TREES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Molecular Junctions and Nanostructures","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monoid; Automaton; Tree (set theory); Mathematics; Quantum finite automata; Discrete mathematics; Soliton; Tree automaton; Automata theory; Set (abstract data type); Combinatorics; Computer science; Physics; Theoretical computer science; Nonlinear system; Quantum mechanics","score_opus":0.007971116984417567,"score_gpt":0.26671703578532424,"score_spread":0.2587459188009067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032261263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16492313,0.000013502089,0.8300462,0.00017160752,0.0029361623,0.000024489458,0.0000026595455,0.000019300547,0.0018629474],"genre_scores_gemma":[0.95566964,0.000004343564,0.044028636,0.000059569073,0.00022805107,1.731432e-7,0.0000012739425,0.0000039922816,0.0000043146783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893177,0.0000060220423,0.0002998794,0.00006429627,0.0006056012,0.00009240713],"domain_scores_gemma":[0.9991429,0.00006914785,0.00011080552,0.00012431352,0.000500817,0.000052017873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004355561,0.000057910755,0.000074923315,0.0006487774,0.000046035442,0.00007287474,0.00056574575,0.000017505738,0.000021454734],"category_scores_gemma":[0.000042569198,0.00005028497,0.000061323626,0.0002720185,0.000119077245,0.00026768353,0.000024062896,0.000078690224,0.0000029213447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048869406,0.00014162624,0.0007349943,0.00000732567,0.000073660565,0.00003436532,0.00014020971,0.62954724,0.044097103,0.008332564,0.0013869463,0.3154551],"study_design_scores_gemma":[0.0009747737,0.0003342161,0.10382926,0.00014518465,0.000015273476,0.00016647094,0.000014200587,0.79344475,0.088652425,0.0021810532,0.010053299,0.0001891004],"about_ca_topic_score_codex":0.0000026140747,"about_ca_topic_score_gemma":0.0000037078232,"teacher_disagreement_score":0.7907465,"about_ca_system_score_codex":0.000077376535,"about_ca_system_score_gemma":0.00009438191,"threshold_uncertainty_score":0.20505616},"labels":[],"label_agreement":null},{"id":"W2034751457","doi":"10.1142/s0129054107004978","title":"THE STRUCTURE OF FACTOR ORACLES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Oracle; Factor (programming language); Trie; Suffix; Set (abstract data type); Computer science; String (physics); Simple (philosophy); Generalized suffix tree; Matching (statistics); Quotient; Theoretical computer science; Data structure; Mathematics; Suffix tree; Algorithm; Combinatorics; Programming language; Statistics","score_opus":0.01426481259880297,"score_gpt":0.3138316890843494,"score_spread":0.2995668764855464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034751457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13632408,0.000059020214,0.8605396,0.0005057146,0.0024695157,0.000032148175,0.0000074351015,0.000005555289,0.000056945195],"genre_scores_gemma":[0.79083455,0.000017383323,0.20894246,0.000035003115,0.00016341328,4.2449376e-8,5.5170096e-7,0.0000016765507,0.000004957279],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997879,0.00002154812,0.0006044656,0.00012867345,0.0012272922,0.00013901714],"domain_scores_gemma":[0.9962382,0.00035008672,0.00080053735,0.00032711017,0.0022134231,0.00007069799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079006515,0.00007176904,0.000118178126,0.0003431598,0.00016822788,0.00024816138,0.0039866925,0.000021218833,0.000008402202],"category_scores_gemma":[0.00013753262,0.000045711353,0.00007394431,0.00048060983,0.00040675842,0.0015881615,0.000503912,0.00011530609,0.0000011071909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031527077,0.000112387315,0.0015443832,0.0000041093654,0.00006304162,0.000011047883,0.00075810595,0.0012971598,0.049261134,0.11918448,0.00031072964,0.8274219],"study_design_scores_gemma":[0.0018372865,0.0009044193,0.3025775,0.00041908203,0.000021951744,0.00090972055,0.00015617187,0.20816581,0.38206834,0.073587626,0.028830767,0.0005213387],"about_ca_topic_score_codex":0.0000105240815,"about_ca_topic_score_gemma":0.0000065563754,"teacher_disagreement_score":0.82690054,"about_ca_system_score_codex":0.00005158924,"about_ca_system_score_gemma":0.00034551785,"threshold_uncertainty_score":0.74083334},"labels":[],"label_agreement":null},{"id":"W2046033718","doi":"10.1142/s0129054103002151","title":"LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Concatenation (mathematics); Prefix; Prime (order theory); Mathematics; Discrete mathematics; Regular language; Combinatorics; Linear code; Automaton; Computer science; Algorithm; Theoretical computer science; Block code; Decoding methods","score_opus":0.009870597442700342,"score_gpt":0.29530844546629664,"score_spread":0.2854378480235963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046033718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17555076,0.000049078204,0.8225799,0.00038255236,0.0009837509,0.00004840969,0.000002961615,0.000014100689,0.00038845188],"genre_scores_gemma":[0.6478011,0.000009047689,0.35205284,0.00004968327,0.00006584531,4.7294995e-7,0.0000010052338,0.0000027651342,0.000017229779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978506,0.00008688815,0.00069065386,0.00019082638,0.0010373787,0.00014368122],"domain_scores_gemma":[0.99660206,0.0001973282,0.00084037404,0.0003450682,0.0019345642,0.000080635094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014835024,0.00009876275,0.00021160801,0.000568913,0.00008627393,0.00015381255,0.0024077462,0.00002910886,0.000029806672],"category_scores_gemma":[0.00015584014,0.00008794754,0.00012437609,0.0005697915,0.0003704482,0.0017942284,0.00020685245,0.00009416793,0.000009472639],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004245389,0.0008694023,0.0010681237,0.000018477285,0.00021586777,0.000025753856,0.001228986,0.012692018,0.25275642,0.6150313,0.000422914,0.11562826],"study_design_scores_gemma":[0.0013562812,0.000687817,0.011583237,0.000427276,0.000029388395,0.0010213039,0.000024940624,0.3706021,0.5291335,0.08227029,0.0025203563,0.00034348483],"about_ca_topic_score_codex":0.0000041078533,"about_ca_topic_score_gemma":3.0307163e-7,"teacher_disagreement_score":0.53276104,"about_ca_system_score_codex":0.00007891784,"about_ca_system_score_gemma":0.00042510114,"threshold_uncertainty_score":0.44742316},"labels":[],"label_agreement":null},{"id":"W2048193893","doi":"10.1142/s0129054103002035","title":"SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"Centre National de la Recherche Scientifique","keywords":"Tensor product; Qubit; Separable space; Dimension (graph theory); Mathematics; State (computer science); Hilbert space; Product (mathematics); Basis (linear algebra); Tensor (intrinsic definition); Quantum; Discrete mathematics; Combinatorics; Quantum mechanics; Pure mathematics; Physics; Mathematical analysis; Algorithm","score_opus":0.013622401063982013,"score_gpt":0.301575586761963,"score_spread":0.287953185697981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048193893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17304596,0.000014404164,0.8240103,0.00057824864,0.001468082,0.00006642896,0.000007390236,0.000012761519,0.0007963984],"genre_scores_gemma":[0.86888355,0.000021933878,0.13087828,0.00016092151,0.000043111093,0.0000013319273,0.0000028128031,0.0000024878816,0.000005585335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975055,0.00006809166,0.00096713234,0.00015933816,0.001146565,0.00015337505],"domain_scores_gemma":[0.99480146,0.00013508838,0.001069733,0.00036591582,0.0035204636,0.000107331936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012609215,0.000102929036,0.00019890434,0.0008880709,0.000110165434,0.00023776625,0.0022833091,0.000022666563,0.000049700586],"category_scores_gemma":[0.00018511452,0.0000920145,0.00015501685,0.0012405395,0.00043126525,0.0031345473,0.00014957415,0.00011662349,0.0000069100693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015793717,0.0004365637,0.005032151,0.00001529938,0.000093620954,0.0000037581583,0.0025634342,0.010038187,0.004853694,0.9480855,0.00019337452,0.028668666],"study_design_scores_gemma":[0.0052884184,0.0013531146,0.10285241,0.0004947031,0.000060455142,0.0010565385,0.00042042273,0.53893024,0.096866526,0.22303818,0.0286545,0.0009844957],"about_ca_topic_score_codex":0.000004214421,"about_ca_topic_score_gemma":0.0000017896804,"teacher_disagreement_score":0.7250473,"about_ca_system_score_codex":0.000060688897,"about_ca_system_score_gemma":0.0006608601,"threshold_uncertainty_score":0.42429945},"labels":[],"label_agreement":null},{"id":"W2048819748","doi":"10.1142/s0129054102000947","title":"VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Algorithm; Bit array; String (physics); String searching algorithm; Matching (statistics); Automaton; Computation; Bounded function; Computer science; Focus (optics); Mathematics; Pattern matching; Theoretical computer science; Type (biology); Artificial intelligence","score_opus":0.04030689551270782,"score_gpt":0.3145119637821279,"score_spread":0.2742050682694201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048819748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00759615,0.0000659057,0.987943,0.0010331773,0.0031280823,0.00008804799,0.0000098717555,0.000021528009,0.000114224065],"genre_scores_gemma":[0.38220137,0.00001988291,0.61735475,0.00007668826,0.00032582926,0.0000019962188,0.000001311259,0.0000037470559,0.000014421936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979995,0.000020554995,0.00057334214,0.00023337986,0.0009799224,0.00019329367],"domain_scores_gemma":[0.9972534,0.000188292,0.0006026107,0.00030994054,0.0015450859,0.0001006826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007718863,0.000103946666,0.00017220371,0.0005185831,0.00019003122,0.0005208173,0.0033273848,0.000024019446,0.000017284194],"category_scores_gemma":[0.00008498149,0.00008962546,0.00011605447,0.00042293128,0.00015594227,0.003031478,0.00048258828,0.0001101934,0.000004669474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015955997,0.0003997002,0.00011924166,0.000017941198,0.0000962799,0.000019440988,0.0015682279,0.010554235,0.007332327,0.18042,0.0011595731,0.79829705],"study_design_scores_gemma":[0.0006309115,0.000176644,0.00082971127,0.00011655302,0.0000062913678,0.00019298584,0.000014404965,0.97807556,0.0038231227,0.0129409395,0.003055441,0.00013740874],"about_ca_topic_score_codex":0.000006960326,"about_ca_topic_score_gemma":4.2629003e-7,"teacher_disagreement_score":0.96752137,"about_ca_system_score_codex":0.0000901706,"about_ca_system_score_gemma":0.00013013242,"threshold_uncertainty_score":0.6183164},"labels":[],"label_agreement":null},{"id":"W2053288014","doi":"10.1142/s0129054109007005","title":"AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS","year":2009,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Strong","keywords":"Indeterminate; Algorithm; Matching (statistics); Computer science; String searching algorithm; Pattern matching; Hybrid algorithm (constraint satisfaction); Successor cardinal; Mathematics; Artificial intelligence","score_opus":0.015010037028539204,"score_gpt":0.30523978877455843,"score_spread":0.2902297517460192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053288014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06609552,0.000011337025,0.9312893,0.0006750014,0.0017177757,0.000056692654,0.000010816638,0.000024595885,0.00011895366],"genre_scores_gemma":[0.6796204,0.0000074593913,0.31978372,0.00032886773,0.00025143754,4.1053593e-7,0.0000021989874,0.0000027949457,0.0000027004164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973045,0.000054215903,0.000600274,0.0003260962,0.0015035002,0.00021140062],"domain_scores_gemma":[0.9971134,0.000112023925,0.00071786204,0.00046067397,0.0014304987,0.00016553362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008407883,0.00014747448,0.00020163572,0.00077723095,0.00018282536,0.0006104696,0.004345744,0.00002470986,0.000008316587],"category_scores_gemma":[0.000032270666,0.00012604728,0.00009704135,0.00038509848,0.00016122675,0.0046032215,0.00029022977,0.00022916483,0.000006847742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001155339,0.00022987256,0.00002786442,6.33225e-7,0.0000141692435,0.000053200376,0.00031420536,0.0041323598,0.0010456636,0.006365125,0.00006154732,0.9877438],"study_design_scores_gemma":[0.00070067175,0.0019814488,0.014706286,0.00024374003,0.0000066746757,0.00047978628,0.000022304483,0.9451463,0.010620386,0.025433354,0.000414612,0.00024442872],"about_ca_topic_score_codex":0.000017283226,"about_ca_topic_score_gemma":5.0671196e-7,"teacher_disagreement_score":0.98749936,"about_ca_system_score_codex":0.00013605153,"about_ca_system_score_gemma":0.00031900764,"threshold_uncertainty_score":0.8075546},"labels":[],"label_agreement":null},{"id":"W2055930907","doi":"10.1142/s0129054112400503","title":"CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Transducer; Communication source; Computer science; Channel (broadcasting); Encoder; Encoding (memory); ENCODE; Binary number; Relation (database); Algorithm; Topology (electrical circuits); Theoretical computer science; Decidability; Acoustics; Mathematics; Telecommunications; Physics; Arithmetic; Artificial intelligence","score_opus":0.02610543362871547,"score_gpt":0.2999545621229074,"score_spread":0.2738491284941919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055930907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022015626,0.00006159761,0.9721703,0.0017219699,0.00380723,0.000062076295,0.0000063853918,0.000015993484,0.00013883042],"genre_scores_gemma":[0.8023758,0.000012080646,0.19704814,0.00016170554,0.00038769006,0.0000034932254,4.9366326e-7,0.000003396697,0.000007190026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847853,0.000027983184,0.00044936463,0.00013283893,0.00069525663,0.0002160462],"domain_scores_gemma":[0.99749625,0.00063662755,0.00042851092,0.00022494086,0.0010961316,0.0001175385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015737497,0.00008637951,0.0001517731,0.0005479519,0.00011074746,0.0002025195,0.002671693,0.000022279888,0.00001203589],"category_scores_gemma":[0.00025496312,0.0000745925,0.0001482446,0.00038782306,0.00021866836,0.0028897428,0.00014510883,0.00006566791,0.0000050738217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060749786,0.0007811263,0.00057231,0.000026518604,0.00025154292,0.0000061007136,0.0053610443,0.013126247,0.0094544,0.40418786,0.0010151396,0.56515694],"study_design_scores_gemma":[0.0015430872,0.0004851968,0.014338878,0.00037748183,0.00006013518,0.00047378286,0.0001482175,0.8144838,0.10186805,0.053375166,0.012258522,0.0005876617],"about_ca_topic_score_codex":0.000002739365,"about_ca_topic_score_gemma":2.735501e-7,"teacher_disagreement_score":0.80135757,"about_ca_system_score_codex":0.00007307856,"about_ca_system_score_gemma":0.00024506846,"threshold_uncertainty_score":0.49647146},"labels":[],"label_agreement":null},{"id":"W2057447340","doi":"10.1142/s0129054107005145","title":"INVOLUTIVELY BORDERED WORDS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Prefix; Suffix; Alphabet; Mathematics; Combinatorics on words; Combinatorics; Watson; Word (group theory); Involution (esoterism); Discrete mathematics; Computer science; Biology; Linguistics; Natural language processing","score_opus":0.017188576571058888,"score_gpt":0.32330077500854654,"score_spread":0.30611219843748766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057447340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6174587,0.0000369743,0.38107523,0.00016150446,0.0008007608,0.00001688892,0.0000011442244,0.0000016400577,0.00044714147],"genre_scores_gemma":[0.95262426,0.000017138687,0.0467266,0.00014412796,0.0004656954,1.5523847e-7,0.0000028232994,0.000001917656,0.000017306504],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990557,0.000014445584,0.00033809486,0.00011287756,0.00036410827,0.00011481368],"domain_scores_gemma":[0.9983782,0.000035148736,0.0002851007,0.00008899085,0.0011553376,0.000057193225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452687,0.000054288776,0.00007618862,0.00018117347,0.0000569677,0.00004536053,0.0007801834,0.000025572419,0.0000071714912],"category_scores_gemma":[0.00018537368,0.000043574517,0.000069978116,0.0001983094,0.00029135827,0.00002685621,0.00018588833,0.00006027134,0.0000014630351],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001725704,0.00025521565,0.01740126,0.0000032139033,0.00010869701,0.000014777271,0.00016653854,0.0010777602,0.676206,0.0051226444,0.00041026282,0.29906103],"study_design_scores_gemma":[0.0017976612,0.002173893,0.49708223,0.00013828627,0.000022210188,0.00052423344,0.00014845355,0.0037239087,0.4346405,0.003958044,0.05535631,0.0004342543],"about_ca_topic_score_codex":0.0000038388976,"about_ca_topic_score_gemma":0.000004013386,"teacher_disagreement_score":0.479681,"about_ca_system_score_codex":0.000024487457,"about_ca_system_score_gemma":0.00018072488,"threshold_uncertainty_score":0.17769171},"labels":[],"label_agreement":null},{"id":"W2058305583","doi":"10.1142/s0129054106004418","title":"RECONSTRUCTING A SUFFIX ARRAY","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Suffix array; Compressed suffix array; Suffix tree; Generalized suffix tree; Suffix; Computer science; String (physics); Data structure; Alphabet; Simple (philosophy); Construct (python library); Algorithm; Mathematics; Theoretical computer science; Combinatorics; Programming language","score_opus":0.01205037815274377,"score_gpt":0.2796258498087055,"score_spread":0.2675754716559617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058305583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05123765,0.000034503137,0.9436024,0.0008094556,0.003293236,0.0000328117,0.0000028839124,0.000017029177,0.00097002025],"genre_scores_gemma":[0.5254032,0.000004517166,0.4741986,0.000039828632,0.00033995544,3.283346e-7,0.0000010367138,0.0000018743855,0.000010654683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979684,0.000028154682,0.00062667544,0.0001983068,0.0010248758,0.00015358739],"domain_scores_gemma":[0.99695635,0.00013007398,0.00072667364,0.00029830716,0.0018231521,0.0000654635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007991678,0.00008661222,0.00014590801,0.0005930062,0.00014260726,0.00045078786,0.0031067466,0.000021355074,0.000015331076],"category_scores_gemma":[0.00007495401,0.000074131065,0.000089579844,0.00056667975,0.00028212482,0.0029536826,0.00033844114,0.000119080476,0.0000065322515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002367518,0.0004985578,0.008741543,0.000009059233,0.00007822462,0.00005783187,0.00059995335,0.010593657,0.046433978,0.35042775,0.0020363522,0.5804994],"study_design_scores_gemma":[0.0025177354,0.00061506155,0.044719346,0.00060700986,0.000025243602,0.0038454705,0.000072038674,0.7017835,0.08808294,0.13103163,0.02595063,0.0007493932],"about_ca_topic_score_codex":0.000038278286,"about_ca_topic_score_gemma":0.0000019591228,"teacher_disagreement_score":0.6911898,"about_ca_system_score_codex":0.000082161525,"about_ca_system_score_gemma":0.00044695177,"threshold_uncertainty_score":0.577316},"labels":[],"label_agreement":null},{"id":"W2060731856","doi":"10.1142/s0129054104002443","title":"SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Binary number; Mathematics; Combinatorics; Hierarchy; Cube (algebra); Word (group theory); Discrete mathematics; Arithmetic; Computer science; Geometry","score_opus":0.00849638401482924,"score_gpt":0.28992859198748816,"score_spread":0.28143220797265894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060731856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46630555,0.000073713905,0.5319072,0.0008839816,0.0007262428,0.000030032947,0.0000040470754,0.0000064287187,0.00006278723],"genre_scores_gemma":[0.9062451,0.00004114415,0.09348793,0.00014935902,0.000068445974,5.575228e-7,7.6961356e-7,0.0000026937387,0.000003975176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981932,0.000032219887,0.00058718846,0.00018425762,0.00085201144,0.00015109137],"domain_scores_gemma":[0.9979435,0.00038563806,0.0005596354,0.00019328002,0.0008506482,0.00006725573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009125499,0.00009066392,0.00017295712,0.0008470195,0.00007024715,0.00013429788,0.0015664581,0.000027631968,0.000009469271],"category_scores_gemma":[0.00022246418,0.00008388985,0.00006165041,0.00066922745,0.00035501667,0.0018382312,0.00031736912,0.00014926655,0.000001923909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012713547,0.0013499323,0.00953675,0.00003283526,0.000115116716,0.00022947376,0.0066667963,0.32770982,0.022568932,0.53186476,0.000059897022,0.09973857],"study_design_scores_gemma":[0.005008093,0.0012339104,0.17450328,0.0012390807,0.000016007427,0.0013635413,0.00036744183,0.6573185,0.012566671,0.14406927,0.0017511827,0.00056302245],"about_ca_topic_score_codex":0.00002234677,"about_ca_topic_score_gemma":0.0000064905475,"teacher_disagreement_score":0.43993956,"about_ca_system_score_codex":0.000105307685,"about_ca_system_score_gemma":0.00046853372,"threshold_uncertainty_score":0.34209287},"labels":[],"label_agreement":null},{"id":"W2061015906","doi":"10.1142/s0129054102001461","title":"SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Prince Edward Island","funders":"","keywords":"Undecidable problem; Closure (psychology); Regular language; Equivalence (formal languages); Quotient; Decomposition; Mathematics; Context-free language; Abstract family of languages; Discrete mathematics; Context (archaeology); Computer science; Combinatorics; Decidability; Theoretical computer science; Automaton; Programming language; Rule-based machine translation; Natural language processing","score_opus":0.013496929104036635,"score_gpt":0.2898611299835407,"score_spread":0.27636420087950403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061015906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11265409,0.00015296497,0.8834867,0.0016559515,0.0010434181,0.00003516528,0.0000042243414,0.000016180045,0.0009512967],"genre_scores_gemma":[0.76315296,0.000024344836,0.23660149,0.0000875176,0.00010786611,4.5364266e-7,5.4913005e-7,0.0000023018288,0.000022546366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829316,0.000036048255,0.00054068945,0.00014584245,0.00086286647,0.00012138142],"domain_scores_gemma":[0.9975571,0.00016214684,0.00058385084,0.00032316742,0.001304204,0.00006954689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061135716,0.00007598498,0.00015925485,0.0006139447,0.000081679245,0.00015791281,0.0028619883,0.000020185153,0.00006590666],"category_scores_gemma":[0.00007585286,0.000067413675,0.00011616786,0.0005656933,0.0003546831,0.0015832332,0.00029006612,0.00008285399,0.000008938781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011138674,0.00080944615,0.000953524,0.00001483048,0.00016163728,0.000050667055,0.002602369,0.005843768,0.051758323,0.5976181,0.0021874206,0.3379888],"study_design_scores_gemma":[0.0018166581,0.000833056,0.027947081,0.0005755881,0.00004147326,0.0017470288,0.00017598724,0.76959693,0.13013537,0.06140414,0.00523096,0.00049569894],"about_ca_topic_score_codex":0.0000074394625,"about_ca_topic_score_gemma":8.648648e-7,"teacher_disagreement_score":0.7637532,"about_ca_system_score_codex":0.000052047802,"about_ca_system_score_gemma":0.00009781468,"threshold_uncertainty_score":0.5318334},"labels":[],"label_agreement":null},{"id":"W2062377295","doi":"10.1142/s0129054111008970","title":"THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Conjecture; Simple (philosophy); Automaton; Mathematics; Scheme (mathematics); Computer science; Discrete mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Theoretical computer science; Epistemology; Philosophy","score_opus":0.014411216565540718,"score_gpt":0.25365818394005857,"score_spread":0.23924696737451784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062377295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04719476,0.00021967187,0.9453818,0.0043379567,0.0021606206,0.000057757043,5.8677733e-7,0.00001112602,0.0006356815],"genre_scores_gemma":[0.9522575,0.00007530387,0.047225412,0.00028620017,0.00013437864,9.165996e-7,1.01906e-7,0.0000019752904,0.000018179953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865174,0.0000699046,0.00037733678,0.00012359413,0.0006575418,0.00011988502],"domain_scores_gemma":[0.9979682,0.0005277852,0.00046447263,0.00027024932,0.0007213804,0.000047931106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020407874,0.00006922822,0.000106710024,0.00018732212,0.0003143021,0.00048475896,0.003371925,0.000013298497,0.000005265541],"category_scores_gemma":[0.00014548094,0.000035566267,0.00007245093,0.0003378291,0.0010172263,0.0010564139,0.000447903,0.00012774636,0.0000029279788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025826332,0.000030460518,0.00028812914,0.0000010192772,0.000047399055,0.0000071015415,0.0028760915,0.00012680661,0.000119746044,0.8155006,0.00014062037,0.1808362],"study_design_scores_gemma":[0.0033543273,0.00028640393,0.03927005,0.00014448061,0.00003061924,0.002138756,0.00023624134,0.40994057,0.0042455094,0.5306881,0.009382836,0.00028209673],"about_ca_topic_score_codex":0.000013898436,"about_ca_topic_score_gemma":0.0000016295913,"teacher_disagreement_score":0.9050628,"about_ca_system_score_codex":0.000030000165,"about_ca_system_score_gemma":0.00020519737,"threshold_uncertainty_score":0.6265932},"labels":[],"label_agreement":null},{"id":"W2066454279","doi":"10.1142/s0129054106004194","title":"SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; McMaster University","keywords":"Mathematics; Social connectedness; Combinatorics; Permutation (music); Sorting; Parity of a permutation; Sign (mathematics); Discrete mathematics; Cyclic permutation; Algorithm; Symmetric group; Physics","score_opus":0.006583382107404011,"score_gpt":0.27276763834056134,"score_spread":0.26618425623315733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066454279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4880419,0.000097773256,0.50999165,0.0006292023,0.0006405345,0.00005216557,0.000011518547,0.0000032009657,0.00053203275],"genre_scores_gemma":[0.95603657,0.000016311335,0.043367613,0.00005907181,0.00036646408,0.0000010818337,0.000027451888,0.000004770393,0.000120671444],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880093,0.00002146713,0.0004139533,0.00013500062,0.00051727745,0.00011135357],"domain_scores_gemma":[0.99818015,0.000023924067,0.0004303027,0.00012120445,0.0012038331,0.000040559487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043903038,0.0000679742,0.000086468244,0.00019592686,0.00008371772,0.000092997245,0.00067535473,0.000024121906,0.000021221136],"category_scores_gemma":[0.00008713226,0.00006598588,0.00007722531,0.00017411009,0.00020084534,0.000049077422,0.00010356781,0.000048851027,0.000003525676],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016696778,0.00018614353,0.003243521,0.0000037065176,0.00008427081,0.0000037565892,0.00009704444,0.0057290415,0.9704975,0.0014475867,0.004583904,0.014106869],"study_design_scores_gemma":[0.004439203,0.0016134303,0.052287742,0.00020816519,0.000119306664,0.0006062855,0.00027410654,0.026725484,0.84514964,0.009366341,0.058278065,0.0009322471],"about_ca_topic_score_codex":0.0000148478,"about_ca_topic_score_gemma":0.000003631293,"teacher_disagreement_score":0.46799463,"about_ca_system_score_codex":0.000040959752,"about_ca_system_score_gemma":0.00021849817,"threshold_uncertainty_score":0.26908258},"labels":[],"label_agreement":null},{"id":"W2067033580","doi":"10.1142/s0129054107004784","title":"NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Human decontamination; Vertex (graph theory); Upper and lower bounds; Computer science; Tree (set theory); Mathematical proof; Binary tree; Constructive; Node (physics); Protocol (science); Binary number; Theoretical computer science; Distributed computing; Graph; Mathematics; Combinatorics; Algorithm; Medicine; Arithmetic; Engineering; Process (computing)","score_opus":0.014115939800737214,"score_gpt":0.29136790856882744,"score_spread":0.2772519687680902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067033580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36475483,0.000043064792,0.63393486,0.000045038087,0.00079649966,0.000045166304,8.692584e-7,0.000005387588,0.00037425407],"genre_scores_gemma":[0.9760816,0.00000874174,0.023775106,0.0000073802003,0.00011820683,9.905991e-7,0.0000010692513,0.000003907815,0.0000030031847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985383,0.000018155575,0.0007773449,0.00006349849,0.00048432345,0.000118387456],"domain_scores_gemma":[0.99822134,0.00021122111,0.00031813202,0.00014904299,0.0010652127,0.00003505126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016066977,0.000056052155,0.00012874493,0.00046983798,0.000037923914,0.000028988105,0.00082459324,0.000024020652,0.000008176914],"category_scores_gemma":[0.000066340086,0.000058352576,0.0000409891,0.000613825,0.00028091564,0.0006447017,0.00007247115,0.00011335541,0.0000023124878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025524372,0.00015228125,0.006866717,0.000015430749,0.000045294204,0.0000050231592,0.0011853979,0.72977376,0.025159372,0.027107904,0.00013465129,0.20952865],"study_design_scores_gemma":[0.00064944115,0.00014662807,0.55246544,0.0004145994,0.000012102948,0.00011687461,0.0003631716,0.38540867,0.051961415,0.0072403797,0.0010165505,0.0002047132],"about_ca_topic_score_codex":0.00006537862,"about_ca_topic_score_gemma":0.00011913156,"teacher_disagreement_score":0.61132675,"about_ca_system_score_codex":0.0001563147,"about_ca_system_score_gemma":0.00012130379,"threshold_uncertainty_score":0.23795488},"labels":[],"label_agreement":null},{"id":"W2067149955","doi":"10.1142/s0129054104002297","title":"WORD COMPLEXITY AND REPETITIONS IN WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Repetition (rhetorical device); Word (group theory); De Bruijn sequence; Mathematics; Combinatorics on words; Prefix; Iterated function; Logarithm; Complexity class; Time complexity; Morphism; Computational complexity theory; Combinatorics; Discrete mathematics; Arithmetic; Algorithm","score_opus":0.027779165371465343,"score_gpt":0.3161795475744101,"score_spread":0.2884003822029447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067149955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113316186,0.00004096213,0.8826652,0.0026436395,0.001077293,0.000039858387,0.0000033684344,0.00000922616,0.00020426247],"genre_scores_gemma":[0.6172416,0.00002698388,0.3825739,0.00007750017,0.000074808086,5.42625e-7,8.83907e-7,0.0000013586218,0.0000024034402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984451,0.000022768489,0.0004835849,0.00019267938,0.0007283875,0.00012747312],"domain_scores_gemma":[0.99847937,0.00007494478,0.0003392622,0.00025156038,0.0007691528,0.00008569527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068072195,0.000074658674,0.00013740029,0.0006859122,0.00009971902,0.0002844565,0.001846052,0.00001928453,0.0000073608066],"category_scores_gemma":[0.000083104336,0.000066378925,0.000043800952,0.0006351602,0.0004484296,0.002417167,0.00054461975,0.00013204763,0.0000024031438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020678308,0.0004689803,0.0024302162,0.000006460196,0.00002933369,0.00006811994,0.0016238148,0.008560763,0.0017912204,0.76059645,0.00008530145,0.22431867],"study_design_scores_gemma":[0.003808968,0.00050972385,0.34512722,0.0009170689,0.000010948641,0.0016413825,0.000095896474,0.15058723,0.0035190394,0.48920318,0.0041086404,0.0004706695],"about_ca_topic_score_codex":0.00005148278,"about_ca_topic_score_gemma":0.000019878391,"teacher_disagreement_score":0.50392544,"about_ca_system_score_codex":0.00011517978,"about_ca_system_score_gemma":0.0004097366,"threshold_uncertainty_score":0.34304547},"labels":[],"label_agreement":null},{"id":"W2071236098","doi":"10.1142/s0129054106004182","title":"QUANTUM OCTAL GAMES","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum pseudo-telepathy; Computer science; Quantum entanglement; Combinatorial game theory; Theoretical computer science; Quantum; Qubit; Quantum information; Quantum computer; Game theory; Quantum information science; Mathematical economics; Mathematics; Sequential game; Quantum mechanics; Physics","score_opus":0.010892600125300578,"score_gpt":0.28781016949384797,"score_spread":0.2769175693685474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071236098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.338485,0.000008306719,0.659342,0.0005443233,0.000725579,0.000026890042,0.000008917988,0.0000032627156,0.00085574493],"genre_scores_gemma":[0.98593926,0.0000011950344,0.013395659,0.000020309542,0.0006162304,0.0000012515662,0.0000047891103,0.000003032622,0.000018249531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989279,0.000008384862,0.0003844107,0.000094754316,0.00049198954,0.00009255075],"domain_scores_gemma":[0.9983516,0.000045982928,0.00040090777,0.0001143374,0.0010487792,0.000038443566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027977664,0.000057696674,0.00009369797,0.00023664844,0.00008254715,0.00012753918,0.00076530746,0.000008259432,0.00009140192],"category_scores_gemma":[0.000005946327,0.00005140084,0.00008864088,0.00024375934,0.0001581086,0.0004521686,0.00007699279,0.00006785038,0.00001006535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030836397,0.00015358157,0.0015799031,5.6381816e-7,0.000020355512,7.0020354e-7,0.0000358509,0.0006791243,0.004470252,0.97757095,0.0004753087,0.015010348],"study_design_scores_gemma":[0.0006169018,0.00011284894,0.02000941,0.000057799338,0.000019340287,0.000039747618,0.000056580284,0.087681934,0.013100262,0.8685326,0.009606431,0.00016613782],"about_ca_topic_score_codex":0.00005471253,"about_ca_topic_score_gemma":9.589086e-7,"teacher_disagreement_score":0.64745426,"about_ca_system_score_codex":0.000026542333,"about_ca_system_score_gemma":0.00023196972,"threshold_uncertainty_score":0.20960654},"labels":[],"label_agreement":null},{"id":"W2071427315","doi":"10.1142/s0129054103002023","title":"QUANTUM SOFTWARE REUSABILITY","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"Computer science; Quantum circuit; Quantum Fourier transform; Quantum algorithm; Quantum phase estimation algorithm; Quantum network; Theoretical computer science; Quantum gate; Quantum; Quantum computer; Quantum error correction; Algorithm; Mathematics; Topology (electrical circuits); Quantum mechanics; Physics","score_opus":0.014623804691528124,"score_gpt":0.2890170193050417,"score_spread":0.27439321461351357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071427315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11902763,0.00004241578,0.8761456,0.00093757827,0.0036288558,0.000042367577,0.0000014743345,0.000024966923,0.00014907961],"genre_scores_gemma":[0.5398838,0.00000445934,0.45991394,0.000084679225,0.000105409374,3.2087e-7,2.1378318e-7,0.0000024568421,0.000004717941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758697,0.00008756949,0.0006480173,0.00026168508,0.0012116642,0.00020411324],"domain_scores_gemma":[0.99635535,0.00028047833,0.00059858465,0.00045241162,0.002189418,0.00012375505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017057863,0.00011474948,0.0001918658,0.00053801015,0.00016425198,0.00033187514,0.0034660206,0.000027691098,0.000014156613],"category_scores_gemma":[0.0007074609,0.00009706753,0.00014362686,0.00079056644,0.00040505442,0.0011926107,0.00032575298,0.00019546942,0.000006258638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016131906,0.00061380316,0.004296458,0.000014862098,0.000115356386,0.00005338537,0.0015795627,0.056674827,0.0023818773,0.47961456,0.00051489274,0.45412427],"study_design_scores_gemma":[0.001452939,0.0008457347,0.028719276,0.00027218772,0.000017688439,0.0021747842,0.000036269004,0.7191947,0.01290596,0.2145431,0.019288128,0.0005492243],"about_ca_topic_score_codex":0.0000057794164,"about_ca_topic_score_gemma":7.0861006e-7,"teacher_disagreement_score":0.6625199,"about_ca_system_score_codex":0.000092741095,"about_ca_system_score_gemma":0.0008004375,"threshold_uncertainty_score":0.6440786},"labels":[],"label_agreement":null},{"id":"W2071898078","doi":"10.1142/s0129054106004492","title":"FAST BROADCASTING WITH BYZANTINE FAULTS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Correctness; Broadcasting (networking); Quantum Byzantine agreement; Computer science; Binary logarithm; Byzantine fault tolerance; Robustness (evolution); Log-log plot; Node (physics); Algorithm; Blocking (statistics); Distributed computing; Computer network; Fault tolerance; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.008157644065646001,"score_gpt":0.2592890208855335,"score_spread":0.2511313768198875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071898078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08739621,0.00003165545,0.9090262,0.0008243803,0.0012859375,0.000045572233,0.000005072772,0.000018086097,0.0013668826],"genre_scores_gemma":[0.8068914,0.0000019313036,0.19274467,0.000042465777,0.00028019477,5.472072e-7,0.0000017237066,0.0000029302887,0.000034155997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767333,0.000022868391,0.00063799444,0.00021280297,0.0012692196,0.00018378191],"domain_scores_gemma":[0.9960634,0.00008014338,0.0008068959,0.00025936298,0.0027219295,0.00006826202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063760043,0.00010609044,0.00018073,0.0004324758,0.00012607616,0.0003685376,0.0025351332,0.00001979176,0.000005010785],"category_scores_gemma":[0.000039173316,0.000083112805,0.00007106357,0.00081147434,0.00027449254,0.0020873314,0.00020680328,0.00010986554,0.0000056273775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008623649,0.0010048104,0.019831885,0.000029798804,0.00018582557,0.00032280487,0.0009968458,0.15202107,0.017111422,0.43991685,0.0019197114,0.36657274],"study_design_scores_gemma":[0.0037833615,0.0009661683,0.15775481,0.0010584872,0.000026460959,0.00535786,0.000067212415,0.7871905,0.014096013,0.005285088,0.023688974,0.0007250786],"about_ca_topic_score_codex":0.00004814681,"about_ca_topic_score_gemma":0.000007373745,"teacher_disagreement_score":0.7194952,"about_ca_system_score_codex":0.000053264466,"about_ca_system_score_gemma":0.00039317255,"threshold_uncertainty_score":0.47109506},"labels":[],"label_agreement":null},{"id":"W2073495011","doi":"10.1142/s0129054110007441","title":"FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial; Time complexity; Context (archaeology); Context-free language; Context-free grammar; Rule-based machine translation; Mathematics; Square-free polynomial; Matrix polynomial; Monic polynomial; Order (exchange); Discrete mathematics; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009884880501276559,"score_gpt":0.2769687651552374,"score_spread":0.2670838846539608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073495011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77801967,0.00002019512,0.21676578,0.0033091,0.0016542544,0.00006337473,0.000004675146,0.000009248428,0.00015372272],"genre_scores_gemma":[0.94957894,0.000003338092,0.050016135,0.00018008417,0.0001832204,8.3403523e-7,4.5721254e-7,0.0000030729311,0.00003393469],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984976,0.000064510634,0.00055719505,0.00015174097,0.00058934925,0.00013959578],"domain_scores_gemma":[0.9976817,0.0004791261,0.0006104179,0.00042470839,0.0007540943,0.00004995419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021620567,0.000082487866,0.00016829744,0.0005411503,0.000075080265,0.0002177626,0.0051678848,0.00002632347,0.000037133526],"category_scores_gemma":[0.0005531813,0.00005438738,0.00008381386,0.0006179709,0.00047452445,0.001320189,0.000576056,0.00019879911,0.00000463643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018400252,0.0005215862,0.002231265,0.000016280483,0.00013628167,0.00013020218,0.00969018,0.0009586442,0.38471094,0.37879807,0.0026083826,0.22001418],"study_design_scores_gemma":[0.0059036077,0.0009036319,0.11373544,0.00072422303,0.000034166624,0.0019660275,0.00044743944,0.53165084,0.26359385,0.07794864,0.0024208713,0.0006712669],"about_ca_topic_score_codex":0.00005235769,"about_ca_topic_score_gemma":0.000033658383,"teacher_disagreement_score":0.5306922,"about_ca_system_score_codex":0.000042163912,"about_ca_system_score_gemma":0.00041460677,"threshold_uncertainty_score":0.9603301},"labels":[],"label_agreement":null},{"id":"W2074221742","doi":"10.1142/s0129054108005838","title":"STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Finite-state machine; Deterministic finite automaton; Alphabet; Intersection (aeronautics); Regular language; Nondeterministic finite automaton; Mathematics; Upper and lower bounds; Automaton; State (computer science); Discrete mathematics; Finite state; Quantum finite automata; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm","score_opus":0.029569320463496206,"score_gpt":0.2988042262286668,"score_spread":0.2692349057651706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074221742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46445036,0.000027324055,0.5347907,0.00020490689,0.00041334576,0.000019677202,0.0000036154959,0.000004705409,0.00008536787],"genre_scores_gemma":[0.90394676,0.000037529087,0.09593567,0.00002925218,0.00004093069,2.0297425e-7,7.84653e-7,0.0000018031602,0.0000070483384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986169,0.000051824845,0.00051519775,0.00012114521,0.0006135324,0.00008144152],"domain_scores_gemma":[0.99764335,0.00017734343,0.00073979114,0.00017970434,0.0012138461,0.000045939207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000759491,0.00006534955,0.00016702357,0.0005483414,0.000060190814,0.000043959626,0.0011928674,0.000014336922,0.0000068494805],"category_scores_gemma":[0.00009083493,0.00005721477,0.00006228087,0.00038949598,0.000925938,0.0011846455,0.0002861537,0.00007319982,5.8705905e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012893001,0.0010287139,0.019637663,0.00008302794,0.00031750614,0.000065599546,0.017062297,0.016503135,0.102121234,0.41946146,0.00030190276,0.42328852],"study_design_scores_gemma":[0.0018222029,0.0012009435,0.35011128,0.0005765039,0.000019187162,0.0014403356,0.00025434335,0.42792147,0.14103736,0.07494493,0.00035406047,0.00031738012],"about_ca_topic_score_codex":0.00004869755,"about_ca_topic_score_gemma":0.0000042208976,"teacher_disagreement_score":0.43949643,"about_ca_system_score_codex":0.000037710357,"about_ca_system_score_gemma":0.00019986172,"threshold_uncertainty_score":0.34116572},"labels":[],"label_agreement":null},{"id":"W2075877008","doi":"10.1142/s0129054110007386","title":"ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Communication complexity; Logarithm; Regular language; Time complexity; Constant (computer programming); Cover (algebra); Probabilistic logic; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Formal language; Range (aeronautics); Discrete mathematics; Algorithm; Automaton; Artificial intelligence; Programming language","score_opus":0.02129091006112265,"score_gpt":0.31408380027596616,"score_spread":0.2927928902148435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075877008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45800003,0.000010118157,0.53719294,0.0030806165,0.0009834777,0.00005352204,0.0000035561145,0.000008679304,0.00066707045],"genre_scores_gemma":[0.8778037,0.000005081415,0.12193681,0.00016976552,0.000073363844,8.5442747e-7,8.7675477e-7,0.0000023978873,0.0000071551704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984205,0.00005770737,0.00047202996,0.0001238471,0.00082726945,0.00009866574],"domain_scores_gemma":[0.9967601,0.0005843932,0.0007351503,0.00066840305,0.001205566,0.000046415847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015346089,0.000076062024,0.00013891608,0.00031497164,0.00013873576,0.00019258201,0.0049109547,0.000021904338,0.000026749034],"category_scores_gemma":[0.00028435982,0.000053051746,0.000088662804,0.00035737143,0.0011538174,0.0007359395,0.00041351482,0.00020173818,0.0000049758028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008019262,0.00013798696,0.00010492201,0.0000029746893,0.000025075282,0.0000032983303,0.000620753,0.00030950093,0.02016709,0.9466775,0.00021874801,0.03172413],"study_design_scores_gemma":[0.00083936506,0.00050028344,0.061194185,0.0003478669,0.000019071793,0.00041926693,0.00013457389,0.40015575,0.06670451,0.46859232,0.0008282706,0.00026453254],"about_ca_topic_score_codex":0.000013678652,"about_ca_topic_score_gemma":0.0000046792857,"teacher_disagreement_score":0.4780852,"about_ca_system_score_codex":0.00002606245,"about_ca_system_score_gemma":0.00020915005,"threshold_uncertainty_score":0.91258574},"labels":[],"label_agreement":null},{"id":"W2075936685","doi":"10.1142/s0129054104002352","title":"IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Mathematics; Pairwise comparison; Upper and lower bounds; Quantum finite automata; Finite-state machine; Regular language; DFA minimization; Discrete mathematics; Automaton; Finite set; Nondeterministic finite automaton; Combinatorics; Computer science; Automata theory; Theoretical computer science; Algorithm; Statistics","score_opus":0.015615832947582784,"score_gpt":0.31805585924589436,"score_spread":0.30244002629831157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075936685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2905454,0.0000117455975,0.704482,0.0030993256,0.0010445801,0.00004430696,0.0000033404685,0.000018109631,0.0007511399],"genre_scores_gemma":[0.8839644,0.000007769985,0.11554535,0.00031928465,0.0001479243,8.833516e-7,5.7324525e-7,0.0000033723527,0.000010453018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820423,0.000037705606,0.0005350542,0.00016246944,0.0009164812,0.00014407582],"domain_scores_gemma":[0.99736494,0.00043549904,0.0007456368,0.00039964003,0.0010031025,0.000051210613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012593002,0.00009372413,0.0001469748,0.00029755555,0.00013095238,0.00033438287,0.0038407801,0.000021721913,0.000028016466],"category_scores_gemma":[0.00029142553,0.00006448875,0.000113772,0.0005368698,0.0003962793,0.0013120004,0.00042159832,0.00013702114,0.0000091386255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023376064,0.00040039272,0.00058880745,0.000008480725,0.00010962383,0.000019199579,0.0023982788,0.011371469,0.015441517,0.8231219,0.00013106741,0.14638588],"study_design_scores_gemma":[0.0038481168,0.0010285596,0.046511885,0.0012521347,0.000040260165,0.0012093566,0.00054086634,0.6081579,0.13937482,0.19563188,0.001710347,0.00069391617],"about_ca_topic_score_codex":0.00002293213,"about_ca_topic_score_gemma":0.0000014337733,"teacher_disagreement_score":0.62749004,"about_ca_system_score_codex":0.00008529568,"about_ca_system_score_gemma":0.00042126435,"threshold_uncertainty_score":0.7137189},"labels":[],"label_agreement":null},{"id":"W2076953942","doi":"10.1142/s0129054112400199","title":"CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Suffix; Time complexity; Extension (predicate logic); Suffix array; Factorization; Suffix tree; Parallel algorithm; Compressed suffix array; Running time; Mathematics; Data structure","score_opus":0.015845256807878592,"score_gpt":0.31258860627660084,"score_spread":0.2967433494687223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076953942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00619703,0.0001780582,0.9884154,0.0007942127,0.003744386,0.00005871828,0.000010055693,0.000030354233,0.0005717873],"genre_scores_gemma":[0.37915677,0.000031586304,0.61987484,0.00015995106,0.0007567853,4.7404222e-7,0.0000047473604,0.000004002335,0.000010834683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972554,0.000051297473,0.0007737878,0.00023178464,0.0013904134,0.00029735913],"domain_scores_gemma":[0.9959214,0.00018831067,0.00085497246,0.00048545675,0.0023339377,0.00021592823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015310152,0.00013405496,0.00022080835,0.0007248781,0.0002595344,0.0004383457,0.0034911947,0.00003546491,0.0000297786],"category_scores_gemma":[0.00014965497,0.00011771866,0.00014032517,0.000854994,0.00031475874,0.0046723164,0.0009614854,0.00019878795,0.000018265937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075226276,0.00057141023,0.0016588405,0.000009540127,0.00009149204,0.000020399684,0.0013472632,0.0009979589,0.00326253,0.11947101,0.0021453598,0.8704167],"study_design_scores_gemma":[0.0017183382,0.0004315377,0.05116097,0.0009370505,0.00004796808,0.0029504758,0.00010554542,0.8677851,0.014441512,0.010831842,0.048832767,0.00075687707],"about_ca_topic_score_codex":0.0000101603355,"about_ca_topic_score_gemma":2.1486375e-7,"teacher_disagreement_score":0.8696598,"about_ca_system_score_codex":0.0001294167,"about_ca_system_score_gemma":0.00035734824,"threshold_uncertainty_score":0.6487566},"labels":[],"label_agreement":null},{"id":"W2076994310","doi":"10.1142/s0129054103001741","title":"A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Connected dominating set; Dominating set; Mobile ad hoc network; Wireless ad hoc network; Computer science; Cluster analysis; Vertex (graph theory); Graph; Algorithm; Mathematics; Theoretical computer science; Computer network; Wireless; Artificial intelligence","score_opus":0.01905439722890007,"score_gpt":0.3031961872650348,"score_spread":0.2841417900361347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076994310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028116375,0.00010076343,0.9914932,0.0002651509,0.0050157383,0.00012955407,0.000002444948,0.00002015208,0.00016133007],"genre_scores_gemma":[0.26520708,0.000024159937,0.73410153,0.00017395742,0.00046870808,0.0000048931406,0.0000014761764,0.00000602492,0.000012151383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976816,0.00006578741,0.00069700106,0.00029882684,0.000981158,0.00027560152],"domain_scores_gemma":[0.9960702,0.00024501304,0.0006637498,0.00038443043,0.0024624516,0.00017414185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017695455,0.0001314377,0.00020619707,0.0004756667,0.00017767862,0.00055606634,0.0034340085,0.00004159473,0.000013422376],"category_scores_gemma":[0.000093237635,0.00012499558,0.0001418305,0.00060405943,0.000268382,0.0029424322,0.0002579538,0.00015857081,0.0000017661539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010157211,0.00017620107,0.000093667586,0.000002164945,0.00005291402,0.000010103127,0.00023592234,0.12884228,0.00016718876,0.07897159,0.00018862987,0.79124916],"study_design_scores_gemma":[0.0005953546,0.0003654289,0.00053324795,0.000047915928,0.0000064902074,0.00037326541,0.000008714524,0.9874247,0.00037672726,0.0056471615,0.0044932044,0.00012781122],"about_ca_topic_score_codex":0.000002286679,"about_ca_topic_score_gemma":0.000004454487,"teacher_disagreement_score":0.8585824,"about_ca_system_score_codex":0.00014039618,"about_ca_system_score_gemma":0.0005982197,"threshold_uncertainty_score":0.6381299},"labels":[],"label_agreement":null},{"id":"W2077005773","doi":"10.1142/s0129054111008763","title":"UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Adversary; Adversarial system; Computer science; Key (lock); Adversary model; Computer security; Protocol (science); Key distribution; Construct (python library); Theoretical computer science; Provable security; Public-key cryptography; Cryptography; Computer network; Encryption; Artificial intelligence","score_opus":0.019485605838634658,"score_gpt":0.261422321712517,"score_spread":0.24193671587388235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077005773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11452958,0.000064341126,0.8795476,0.001423656,0.0032733674,0.00008295207,0.000047108028,0.000034104753,0.000997272],"genre_scores_gemma":[0.8652694,0.00005933352,0.13431144,0.00010802266,0.00023008579,0.000001997982,0.000010804655,0.0000038053545,0.0000050847643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975217,0.000069599155,0.00074490573,0.00031066427,0.0011300202,0.0002231025],"domain_scores_gemma":[0.9944416,0.00017857096,0.0007585956,0.00035653266,0.0040803333,0.00018435936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343815,0.0001571321,0.00023026273,0.00046010021,0.00029774016,0.0004719882,0.0024191653,0.00006333517,0.000069907765],"category_scores_gemma":[0.00014287913,0.00015452082,0.00010808723,0.00071849406,0.0014243353,0.002875719,0.00046740982,0.00028250413,0.0000064413616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013245823,0.00018660387,0.0013691616,0.000005304584,0.0000772188,0.000021547088,0.002439221,0.0002836902,0.00020457362,0.9859258,0.00041823735,0.009055383],"study_design_scores_gemma":[0.0029243561,0.0009921965,0.10865919,0.00061396864,0.0000986779,0.008427443,0.0004902123,0.25911865,0.007476643,0.59796757,0.012144368,0.0010867333],"about_ca_topic_score_codex":0.000025839428,"about_ca_topic_score_gemma":0.000016439337,"teacher_disagreement_score":0.7507399,"about_ca_system_score_codex":0.00013989172,"about_ca_system_score_gemma":0.00077208964,"threshold_uncertainty_score":0.6301176},"labels":[],"label_agreement":null},{"id":"W2077220764","doi":"10.1142/s0129054110007155","title":"SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Ambiguity; Word (group theory); Matrix (chemical analysis); Alphabet; Image (mathematics); Combinatorics; Binary number; Mathematics; Palindrome; Variance (accounting); Logical matrix; Characterization (materials science); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Arithmetic; Linguistics; Geometry","score_opus":0.008635601422458672,"score_gpt":0.28601269267096646,"score_spread":0.2773770912485078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077220764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34173205,0.00006511209,0.65246713,0.0017161819,0.0037126213,0.00004488883,0.0000033815083,0.000018794311,0.00023986922],"genre_scores_gemma":[0.79100126,0.000034082746,0.20866086,0.00008635032,0.00020844577,6.589054e-7,4.74147e-7,0.0000019271245,0.000005938294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837697,0.00002535186,0.00044387134,0.00019979179,0.0008106646,0.00014335218],"domain_scores_gemma":[0.9977621,0.0002314543,0.000534521,0.00025252902,0.001117452,0.00010196145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011190267,0.00009106497,0.00014174038,0.00056417333,0.00012343684,0.0006552318,0.002878756,0.00002504658,0.000021316875],"category_scores_gemma":[0.0001309832,0.000074953314,0.000060389866,0.00047180982,0.0005354435,0.002684236,0.00044882367,0.00018275196,0.000004676676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014411337,0.00021742051,0.0071065435,0.000011242495,0.000055319673,0.000030249392,0.0007333723,0.00017907892,0.034686595,0.25545987,0.00094418577,0.7005617],"study_design_scores_gemma":[0.00266887,0.00088875234,0.24017699,0.00037372363,0.000051127758,0.0046409653,0.00011307041,0.46190494,0.08112489,0.18461761,0.022434644,0.0010043974],"about_ca_topic_score_codex":0.000015776479,"about_ca_topic_score_gemma":0.0000039387933,"teacher_disagreement_score":0.6995573,"about_ca_system_score_codex":0.000020626321,"about_ca_system_score_gemma":0.00033138832,"threshold_uncertainty_score":0.63184154},"labels":[],"label_agreement":null},{"id":"W2079344815","doi":"10.1142/s0129054106004042","title":"AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Distributed algorithm; Asynchronous communication; Computer science; Enhanced Data Rates for GSM Evolution; Time complexity; Algorithm; Binary logarithm; Message passing; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Distributed computing; Computer network; Artificial intelligence","score_opus":0.011182936591719284,"score_gpt":0.29382614801252016,"score_spread":0.2826432114208009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079344815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051032994,0.000028436936,0.94511086,0.00050436176,0.0030264251,0.00012138084,0.00008389558,0.00002498239,0.00006667486],"genre_scores_gemma":[0.69255596,9.053973e-7,0.30704162,0.000028626735,0.0003508991,0.0000031377986,0.000011700686,0.0000029583075,0.0000042023635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977773,0.000040632363,0.0006934328,0.0002835034,0.0009875151,0.0002176126],"domain_scores_gemma":[0.9951161,0.00016498905,0.00071859703,0.00035821006,0.003539233,0.00010283817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232801,0.00011860369,0.00021799658,0.00040005674,0.00018340745,0.0005392055,0.0029588514,0.00003280499,0.0000030771487],"category_scores_gemma":[0.00006674944,0.00010650066,0.00014306816,0.0006525654,0.00025583166,0.001558154,0.0001476246,0.0000893511,0.0000024108977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029722549,0.0017129162,0.000805135,0.000012740887,0.00009191075,0.000026453552,0.00039330317,0.21272102,0.006498683,0.22287297,0.0013396661,0.55349547],"study_design_scores_gemma":[0.0006914124,0.00022300144,0.011039623,0.000047601825,0.0000058662654,0.00013310072,0.000009354546,0.9775371,0.0035184654,0.0039982293,0.002666345,0.00012987609],"about_ca_topic_score_codex":0.00003658237,"about_ca_topic_score_gemma":0.000003985689,"teacher_disagreement_score":0.7648161,"about_ca_system_score_codex":0.00016067771,"about_ca_system_score_gemma":0.00043984485,"threshold_uncertainty_score":0.5498331},"labels":[],"label_agreement":null},{"id":"W2082796216","doi":"10.1142/s0129054108006169","title":"STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Prince Edward Island","funders":"","keywords":"Closure (psychology); Constraint (computer-aided design); Upper and lower bounds; State (computer science); Coding (social sciences); Regular language; Computer science; Set (abstract data type); Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Automaton; Programming language","score_opus":0.03906646804155322,"score_gpt":0.3068749110862771,"score_spread":0.2678084430447239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082796216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63303643,0.0000069700177,0.36618555,0.00047988177,0.00014676955,0.00006280395,0.0000040766113,0.0000011493204,0.000076388365],"genre_scores_gemma":[0.9646301,0.000009311423,0.035074003,0.00013248446,0.00013530506,0.0000013250097,0.0000035557837,0.0000019641607,0.000011893408],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912596,0.000027091439,0.00029330852,0.00011294074,0.0003659438,0.00007475135],"domain_scores_gemma":[0.99832875,0.000019812564,0.00029417695,0.0001393926,0.0011773551,0.00004053323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028727058,0.000053990545,0.00008502962,0.00008272071,0.00013726918,0.000034468547,0.00079724647,0.000015573969,0.000003449634],"category_scores_gemma":[0.000044497614,0.000034065106,0.000054119195,0.00022992367,0.00052531064,0.000027427075,0.00018016876,0.000052804124,7.0247074e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001648294,0.0003063009,0.046216458,0.000008639641,0.00011657077,0.0000027927824,0.00038982707,0.029197255,0.8942733,0.0093139075,0.00024281973,0.01976731],"study_design_scores_gemma":[0.0009531896,0.0012170157,0.4022348,0.00012431474,0.000017941737,0.0004611239,0.00004750199,0.0044894014,0.58242244,0.0014796811,0.0063151973,0.00023742956],"about_ca_topic_score_codex":0.0000059172335,"about_ca_topic_score_gemma":0.00000934287,"teacher_disagreement_score":0.35601833,"about_ca_system_score_codex":0.000019478526,"about_ca_system_score_gemma":0.0002517972,"threshold_uncertainty_score":0.1935529},"labels":[],"label_agreement":null},{"id":"W2083735143","doi":"10.1142/s012905410300214x","title":"A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University; University of Prince Edward Island","funders":"","keywords":"Regular expression; Regular language; Computer science; Pumping lemma for regular languages; Context-free language; Context (archaeology); Theoretical computer science; Programming language; Artificial intelligence; Automaton; Biology; Rule-based machine translation; Programming paradigm; Fifth-generation programming language","score_opus":0.02637070741872171,"score_gpt":0.3423945622337794,"score_spread":0.3160238548150577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3509693,0.000012325089,0.64728135,0.0003126385,0.001082198,0.000057324658,7.320129e-7,0.000007524959,0.00027659198],"genre_scores_gemma":[0.7733172,0.0000037925404,0.2265732,0.000041667423,0.000053248805,0.0000010540944,1.5781481e-7,0.0000023053317,0.000007349495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975227,0.00010807824,0.00070479384,0.0001794959,0.0013232558,0.00016166121],"domain_scores_gemma":[0.99673617,0.00027438844,0.00079888396,0.00039143296,0.0017052323,0.00009387257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431756,0.00008719952,0.00018660605,0.0005686728,0.000119492535,0.00017996396,0.0021985555,0.000021428694,0.000021011665],"category_scores_gemma":[0.00034852372,0.00007135206,0.000089179266,0.0006029476,0.0002578607,0.0032028153,0.00036781686,0.00012830576,0.00000250341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004110778,0.0033490388,0.0021735567,0.000008345903,0.00017871973,0.000074965195,0.005135695,0.0043559386,0.019275373,0.91703564,0.00041380376,0.047957793],"study_design_scores_gemma":[0.013570419,0.009559941,0.10047321,0.0011988636,0.00018024261,0.0077434042,0.0046205265,0.43559173,0.17595302,0.23711698,0.012444829,0.0015468526],"about_ca_topic_score_codex":0.0000054224056,"about_ca_topic_score_gemma":0.0000010030378,"teacher_disagreement_score":0.6799187,"about_ca_system_score_codex":0.00005013187,"about_ca_system_score_gemma":0.0005836465,"threshold_uncertainty_score":0.40855},"labels":[],"label_agreement":null},{"id":"W2084473191","doi":"10.1142/s0129054107005200","title":"SOLITON LANGUAGES ARE NEARLY AN ANTI-AFL","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Molecular Junctions and Nanostructures","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Linguistics; Computer science; Pure mathematics; Discrete mathematics; Philosophy","score_opus":0.007870986350351038,"score_gpt":0.2833468441456931,"score_spread":0.27547585779534206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084473191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6008106,0.000048482387,0.3970928,0.000061319224,0.0015593367,0.000016860087,0.0000023865648,0.000012778825,0.0003954275],"genre_scores_gemma":[0.9674879,0.000011746291,0.03206542,0.000033925317,0.00038929036,1.2170868e-7,0.0000015100035,0.0000046268497,0.000005489378],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99906534,0.0000072010357,0.00028377832,0.00006963996,0.00047339284,0.00010062236],"domain_scores_gemma":[0.99896926,0.000028410854,0.00014291692,0.00011517734,0.00067827,0.00006595453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038722964,0.00005731536,0.000085539985,0.00045748366,0.000052625284,0.00011701463,0.0005702289,0.000020201234,0.000019716606],"category_scores_gemma":[0.0000315457,0.000051396077,0.000049334325,0.00024797168,0.00012764869,0.00062880106,0.00003401928,0.0000867881,0.0000024408898],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004091628,0.00027266008,0.015475737,0.000025137793,0.00027281162,0.00019174223,0.001609079,0.17414391,0.31397608,0.014270255,0.0015414513,0.4781802],"study_design_scores_gemma":[0.0010058985,0.00033559446,0.7525851,0.00019036424,0.000033424134,0.0010086138,0.00030330927,0.06120558,0.17019844,0.0029645427,0.00978052,0.00038862374],"about_ca_topic_score_codex":0.000008454077,"about_ca_topic_score_gemma":0.000009321839,"teacher_disagreement_score":0.73710936,"about_ca_system_score_codex":0.000050930896,"about_ca_system_score_gemma":0.000061855775,"threshold_uncertainty_score":0.20958711},"labels":[],"label_agreement":null},{"id":"W2084584786","doi":"10.1142/s0129054106004200","title":"COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Transient (computer programming); Converse; Electronic circuit; Mathematics; Function (biology); Logic gate; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Arithmetic; Combinatorics; Physics; Quantum mechanics","score_opus":0.011948986209768113,"score_gpt":0.27855024646066934,"score_spread":0.26660126025090125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084584786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28866258,0.00005666777,0.7104401,0.00021867781,0.00042413746,0.000035709912,0.000009200222,0.000005891362,0.00014706238],"genre_scores_gemma":[0.9336311,0.000009069903,0.06626082,0.000024461764,0.000059189657,4.1317023e-7,0.0000033461054,0.000002537891,0.000009010229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975415,0.000034271467,0.0008835244,0.00019455256,0.0012150261,0.00013116076],"domain_scores_gemma":[0.9963571,0.00022174127,0.0011030379,0.00034412532,0.0019228393,0.000051173894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005432254,0.00009647762,0.0002714082,0.0010191274,0.000063057974,0.000076292854,0.002510062,0.000025821424,0.000011527454],"category_scores_gemma":[0.000073330724,0.00008924071,0.00020330086,0.001658673,0.0003202392,0.0016456471,0.00021312886,0.00007884063,6.298052e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009143123,0.00023002882,0.0017276063,0.0000068235418,0.000113181595,0.0000033809033,0.0002237927,0.94202226,0.023723362,0.015282875,0.00005673229,0.016600814],"study_design_scores_gemma":[0.0008311442,0.00030830113,0.07666167,0.000083212464,0.000068477115,0.000026702714,0.000014554231,0.88576233,0.02120825,0.014623931,0.00025548236,0.00015591258],"about_ca_topic_score_codex":0.000025767544,"about_ca_topic_score_gemma":0.000004151193,"teacher_disagreement_score":0.64496857,"about_ca_system_score_codex":0.00007917539,"about_ca_system_score_gemma":0.00021492688,"threshold_uncertainty_score":0.46643612},"labels":[],"label_agreement":null},{"id":"W2085042840","doi":"10.1142/s0129054105003200","title":"THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Hierarchy; Conjecture; Mathematics; Upper and lower bounds; Polynomial; Combinatorics; Polynomial hierarchy; Discrete mathematics; Time complexity; Mathematical analysis","score_opus":0.018719036039273374,"score_gpt":0.28599908382975253,"score_spread":0.26728004779047915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085042840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26489317,0.0002502306,0.63153476,0.09944663,0.0029181913,0.00014471733,0.000005024648,0.000016609885,0.00079065195],"genre_scores_gemma":[0.9823413,0.00005727626,0.015787758,0.0011901475,0.0005625481,0.0000020779369,1.5595609e-7,0.0000028899822,0.000055875273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981487,0.00014551444,0.00043645842,0.00015006673,0.000960851,0.00015841897],"domain_scores_gemma":[0.9963133,0.0022112932,0.0004513563,0.00038435782,0.00058733777,0.000052381853],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029756923,0.00009374538,0.00011420358,0.00021097742,0.0006100114,0.0010613607,0.0044223596,0.0000148225,0.000007245902],"category_scores_gemma":[0.00030348732,0.000041928142,0.00008929728,0.0003400475,0.0016420273,0.0010257422,0.000539423,0.0001916625,0.000006299542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064959386,0.000029914354,0.00006111552,4.40149e-7,0.00003949051,0.0000020816008,0.0012925373,0.0011913549,0.0002557133,0.5761297,0.0011498854,0.41978282],"study_design_scores_gemma":[0.0028376651,0.00039812629,0.04490463,0.0001889713,0.000022381633,0.0009993726,0.00024479302,0.783146,0.006258903,0.08796944,0.07271885,0.00031086305],"about_ca_topic_score_codex":0.000011515404,"about_ca_topic_score_gemma":0.000011891939,"teacher_disagreement_score":0.78195465,"about_ca_system_score_codex":0.000054083677,"about_ca_system_score_gemma":0.0002951878,"threshold_uncertainty_score":0.9999756},"labels":[],"label_agreement":null},{"id":"W2086380781","doi":"10.1142/s0129054107005078","title":"ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Computer science; Decidability; Delegation; Property (philosophy); Nondeterministic finite automaton; Deterministic finite automaton; Finite-state machine; Automaton; Theoretical computer science; Büchi automaton; Discrete mathematics; Deterministic automaton; Programming language; Mathematics; Automata theory","score_opus":0.02257258117667414,"score_gpt":0.31746810412455884,"score_spread":0.2948955229478847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086380781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23422536,0.000016005353,0.7628941,0.0010744062,0.0014862875,0.00006651556,0.0000024423757,0.000006255473,0.000228602],"genre_scores_gemma":[0.8439761,0.0000032946432,0.15562077,0.0002574048,0.00012678692,8.716782e-7,2.8543118e-7,0.0000024124665,0.000012078034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980704,0.000024762416,0.0006130249,0.00015506067,0.0009777617,0.00015895565],"domain_scores_gemma":[0.9958905,0.0011688822,0.0007318599,0.00032515623,0.0018201404,0.00006344772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028729585,0.00008127848,0.00014000727,0.0004630613,0.00011304855,0.00014621663,0.0036753893,0.00002002651,0.000009246107],"category_scores_gemma":[0.00034740526,0.00005575993,0.0001313491,0.0005117958,0.00046304413,0.0009143201,0.00020800895,0.00009243684,0.000003054075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024535397,0.000110556146,0.00014340486,0.0000034282991,0.000028792561,0.0000032241646,0.00039498383,0.00077611307,0.0030927672,0.941723,0.00023076878,0.053468406],"study_design_scores_gemma":[0.0016467934,0.0016744139,0.02483654,0.00061488175,0.000025425594,0.00044194967,0.00016394598,0.25040388,0.17842978,0.5373617,0.003989152,0.00041154915],"about_ca_topic_score_codex":0.0000065181566,"about_ca_topic_score_gemma":0.0000022352037,"teacher_disagreement_score":0.60975075,"about_ca_system_score_codex":0.000067044646,"about_ca_system_score_gemma":0.00027088306,"threshold_uncertainty_score":0.6829849},"labels":[],"label_agreement":null},{"id":"W2087043915","doi":"10.1142/s0129054102001527","title":"THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Asymmetry; Join (topology); Computer science; Greedy algorithm; Line (geometry); Routing (electronic design automation); Combinatorics; Mathematics; Graph; Mathematical optimization; Algorithm; Distributed computing; Computer network","score_opus":0.01958417640857618,"score_gpt":0.2819924232331981,"score_spread":0.26240824682462194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087043915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070419095,0.00004813392,0.9108269,0.015041088,0.0022929062,0.0001631679,0.0000014399005,0.000015236088,0.001192],"genre_scores_gemma":[0.9886464,0.000013889871,0.010827093,0.00021364479,0.00026196224,0.0000025292436,1.2095373e-7,0.0000029450343,0.000031427742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978042,0.00013064832,0.00055171043,0.00015959286,0.0011941693,0.00015964963],"domain_scores_gemma":[0.9955929,0.0023771862,0.000672484,0.00033917505,0.00096215174,0.00005608852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001998012,0.00010073264,0.00014904437,0.0002235199,0.00028288612,0.0003042733,0.0031836454,0.000019184008,0.000010651438],"category_scores_gemma":[0.00036334063,0.00005335011,0.0001240861,0.00053297635,0.0004147234,0.00045495087,0.00018374855,0.00020958511,0.000015599398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031209176,0.00010057207,0.00026064907,0.0000017458896,0.00006581624,0.0000044642366,0.00019367502,0.036758583,0.00014131988,0.2104559,0.00047728082,0.7515088],"study_design_scores_gemma":[0.00058011553,0.0009978925,0.00086865976,0.00014469476,0.000008007131,0.000056015204,0.000006207897,0.9934584,0.001953319,0.00082422036,0.0010362003,0.000066265806],"about_ca_topic_score_codex":0.0000024410244,"about_ca_topic_score_gemma":9.751769e-7,"teacher_disagreement_score":0.9566998,"about_ca_system_score_codex":0.00005853944,"about_ca_system_score_gemma":0.00008304029,"threshold_uncertainty_score":0.59160584},"labels":[],"label_agreement":null},{"id":"W2087738591","doi":"10.1142/s0129054108005528","title":"IDENTIFYING RHYTHMS IN MUSICAL TEXTS","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Music and Audio Processing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rhythm; Substring; Duration (music); Sequence (biology); Musical; Speech recognition; Computer science; Mathematics; Literature; Data structure; Art; Physics; Acoustics","score_opus":0.04141102091982669,"score_gpt":0.32450685140621205,"score_spread":0.28309583048638537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087738591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25225097,0.000034046127,0.74435556,0.0012944937,0.0016868225,0.000023391898,2.8992096e-7,0.000008187225,0.00034626553],"genre_scores_gemma":[0.7722766,0.000016935628,0.22724648,0.0002392002,0.00020486208,4.425695e-7,1.8796185e-7,0.000001987177,0.000013306449],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979036,0.000026700647,0.00058821077,0.00019582409,0.0011240843,0.00016157278],"domain_scores_gemma":[0.9980656,0.0000958046,0.00047553927,0.00020048248,0.0010861545,0.000076420285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075519114,0.00007811128,0.00015539255,0.0008343511,0.00013063005,0.00023451702,0.0023650366,0.00002104742,0.000013376646],"category_scores_gemma":[0.00011498042,0.0000706612,0.000075509124,0.0008636685,0.00038552293,0.0028914092,0.00037407642,0.00015137257,0.0000076485385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035269528,0.0008568012,0.013768001,0.000025070682,0.000082889026,0.0008415246,0.01213283,0.013877176,0.01732396,0.12750629,0.001589788,0.8119604],"study_design_scores_gemma":[0.0030496072,0.00038922738,0.48092982,0.0009941328,0.000011601795,0.008864829,0.00007125713,0.42891186,0.020397479,0.050030444,0.0056703635,0.0006793433],"about_ca_topic_score_codex":0.000008671757,"about_ca_topic_score_gemma":0.000002361609,"teacher_disagreement_score":0.8112811,"about_ca_system_score_codex":0.00010319957,"about_ca_system_score_gemma":0.00066535146,"threshold_uncertainty_score":0.4394866},"labels":[],"label_agreement":null},{"id":"W2089455626","doi":"10.1142/s0129054112400047","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Combined operations; Continuation; State (computer science); Star (game theory); Computer science; Mathematics; Algorithm; Programming language; History","score_opus":0.03211804920181332,"score_gpt":0.3122282846005669,"score_spread":0.28011023539875357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089455626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40334675,0.0000698458,0.59354055,0.0014928924,0.0013858295,0.00007134617,0.000009481128,0.00001302628,0.00007025867],"genre_scores_gemma":[0.80161035,0.000024508208,0.19812803,0.00011595037,0.00010232247,0.0000012726955,0.0000037556113,0.0000035823537,0.000010255429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978066,0.00007412477,0.0007539628,0.00017087112,0.0009999283,0.00019450195],"domain_scores_gemma":[0.9963664,0.0001947973,0.0005904261,0.0002653165,0.0024479376,0.00013512498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579767,0.00011614643,0.00021715918,0.0006853878,0.00015463697,0.00024150603,0.0017728718,0.00002015831,0.000016770076],"category_scores_gemma":[0.00014623285,0.0001022432,0.00007270243,0.0005806124,0.00076994294,0.0039683273,0.0003833986,0.000110870795,0.0000039110496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029710593,0.0006154487,0.0067697857,0.000016574815,0.00015392127,0.0000047890608,0.004397068,0.0074734753,0.018595329,0.9208919,0.00018274583,0.040869284],"study_design_scores_gemma":[0.0028610993,0.00044734558,0.18449408,0.00020543368,0.00003540411,0.00043182322,0.00012418925,0.6918846,0.033982944,0.08460457,0.0005031788,0.0004253527],"about_ca_topic_score_codex":0.000092419396,"about_ca_topic_score_gemma":0.0000115027615,"teacher_disagreement_score":0.8362873,"about_ca_system_score_codex":0.0000997401,"about_ca_system_score_gemma":0.0003857812,"threshold_uncertainty_score":0.41693565},"labels":[],"label_agreement":null},{"id":"W2090919369","doi":"10.1142/s0129054103002229","title":"EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; De Bruijn sequence; Computer science; Sorting; Hypercube; Cardinality (data modeling); Algorithm; Set (abstract data type); Sorting algorithm; Communication complexity; Selection (genetic algorithm); Selection algorithm; Node (physics); Theoretical computer science; Parallel computing; Mathematics; Discrete mathematics; Data mining","score_opus":0.015521792565095482,"score_gpt":0.3087336153858631,"score_spread":0.2932118228207676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090919369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30065605,0.00004060356,0.698584,0.00019328976,0.00041991356,0.000056306733,0.000028179616,0.00000447166,0.000017163124],"genre_scores_gemma":[0.8639729,0.0000047250137,0.13593069,0.000032642893,0.0000519361,0.0000013087868,0.0000017377971,0.0000020463565,0.0000019895758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873215,0.000035534256,0.0004444279,0.00017067551,0.00047159966,0.00014559063],"domain_scores_gemma":[0.9980038,0.00017641655,0.00050131266,0.00010029326,0.0011495415,0.00006865508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477245,0.00007859015,0.00015671336,0.0002486274,0.00013815265,0.00017456431,0.00053848716,0.000025224354,0.0000017612456],"category_scores_gemma":[0.00025119534,0.00006783749,0.00004851238,0.00030155777,0.00013371796,0.00031611553,0.00007093487,0.000071051545,1.0701071e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005160047,0.0004403312,0.00537686,0.000056548542,0.00013748414,0.0000063495613,0.0015878772,0.12574042,0.013848699,0.75495946,0.00027801504,0.09751634],"study_design_scores_gemma":[0.00088218105,0.0003069264,0.024987742,0.00013332682,0.0000090012,0.00031465146,0.000049400503,0.95644456,0.008720854,0.0070438124,0.0009952028,0.00011234638],"about_ca_topic_score_codex":0.000006940774,"about_ca_topic_score_gemma":0.00000189224,"teacher_disagreement_score":0.83070415,"about_ca_system_score_codex":0.00005952153,"about_ca_system_score_gemma":0.00022286951,"threshold_uncertainty_score":0.27663326},"labels":[],"label_agreement":null},{"id":"W2091155243","doi":"10.1142/s0129054112400679","title":"UNARY PATTERNS WITH INVOLUTION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Involution (esoterism); Mathematics; Alphabet; Combinatorics; Existential quantification; Discrete mathematics; Biology; Linguistics","score_opus":0.014145822113634738,"score_gpt":0.2763654520099963,"score_spread":0.26221962989636155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091155243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26191843,0.00004371596,0.7355516,0.0006125645,0.0016597173,0.000027946873,0.0000014298364,0.000014426529,0.0001701606],"genre_scores_gemma":[0.84627676,0.0000106232055,0.1532409,0.00015582511,0.00030486623,6.940107e-7,8.4575817e-7,0.0000028339623,0.000006641426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982775,0.00003541147,0.0003789543,0.00012552648,0.000992811,0.00018981389],"domain_scores_gemma":[0.9979419,0.00010178033,0.00048716812,0.00026114954,0.0010911627,0.00011679951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908243,0.00008391883,0.00012028756,0.0005118478,0.000091044036,0.00019653547,0.0022847832,0.000018234603,0.000014807264],"category_scores_gemma":[0.000037717473,0.00006420534,0.000060228587,0.0004735529,0.00023589478,0.004186811,0.00029599856,0.00009898035,0.0000078024705],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051787767,0.0009318251,0.08307901,0.0000161321,0.00018782199,0.000032585816,0.0036522888,0.003865652,0.007442463,0.5724582,0.00053700595,0.3277452],"study_design_scores_gemma":[0.0023730963,0.0012313143,0.71618354,0.0007085524,0.00004544651,0.00409846,0.00021298502,0.21355756,0.030627707,0.024539933,0.0056766835,0.0007447479],"about_ca_topic_score_codex":0.0000094122715,"about_ca_topic_score_gemma":0.0000010748051,"teacher_disagreement_score":0.6331045,"about_ca_system_score_codex":0.00010139555,"about_ca_system_score_gemma":0.0002764423,"threshold_uncertainty_score":0.42457336},"labels":[],"label_agreement":null},{"id":"W2091969952","doi":"10.1142/s0129054111008295","title":"UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Grid; Asynchronous communication; Occupancy grid mapping; Mobile robot; Constructive proof; Distributed computing; Artificial intelligence; Mathematics; Computer network; Geometry","score_opus":0.035633509501549594,"score_gpt":0.30527993390190744,"score_spread":0.26964642440035785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091969952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06217171,0.00001713053,0.9347096,0.00029509366,0.0016987048,0.00008453686,0.0000016368998,0.000009609679,0.0010119452],"genre_scores_gemma":[0.655788,0.000017195054,0.34408957,0.00004056538,0.000052689906,0.0000016324288,4.220177e-7,0.0000021247693,0.000007816337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982107,0.000031370626,0.0007071073,0.00015597261,0.0007439344,0.00015090032],"domain_scores_gemma":[0.99757946,0.0000618313,0.00055827777,0.00023937241,0.00148304,0.00007805174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845681,0.0000749787,0.00016239974,0.001065643,0.00004452371,0.000109724846,0.0026967328,0.000020788568,0.00003558811],"category_scores_gemma":[0.00005015195,0.00006904388,0.00007060815,0.00078534294,0.00032959713,0.0020934592,0.0003974027,0.00011073442,0.000003962083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006748098,0.0017057855,0.014810319,0.00004341396,0.00013281372,0.00007238142,0.016587805,0.45783666,0.011178769,0.19165854,0.00023250653,0.30567354],"study_design_scores_gemma":[0.0015410346,0.00090040755,0.054779667,0.00038437766,0.0000068393692,0.0003600334,0.000092063645,0.90849584,0.02243109,0.00988723,0.00082864176,0.00029278328],"about_ca_topic_score_codex":0.000044128796,"about_ca_topic_score_gemma":0.000007366124,"teacher_disagreement_score":0.59361625,"about_ca_system_score_codex":0.00010295218,"about_ca_system_score_gemma":0.00055718166,"threshold_uncertainty_score":0.50112456},"labels":[],"label_agreement":null},{"id":"W2096151535","doi":"10.1142/s0129054101000485","title":"EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE","year":2001,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; McMaster University; National Aeronautics and Space Administration","keywords":"Computer science; Dynamic priority scheduling; Rate-monotonic scheduling; Scheduling (production processes); Gang scheduling; Fair-share scheduling; Two-level scheduling; Distributed computing; Multiprocessor scheduling; Workload; Bin packing problem; Earliest deadline first scheduling; Mathematical optimization; Parallel computing; Algorithm; Mathematics; Bin; Quality of service","score_opus":0.02467930034830723,"score_gpt":0.29136593413513984,"score_spread":0.2666866337868326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096151535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41325513,0.000038861832,0.58481556,0.00018303697,0.0015199417,0.000019565414,7.750677e-7,0.000017071156,0.00015006549],"genre_scores_gemma":[0.5537039,0.000013459732,0.44601545,0.000052560492,0.00020687,2.2053435e-7,5.578268e-7,0.0000048639886,0.0000021155226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986398,0.000011533024,0.0004459992,0.00009523876,0.00067482225,0.00013256253],"domain_scores_gemma":[0.99791276,0.000054643784,0.00018923302,0.00011554553,0.0016481571,0.00007966589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044944364,0.00008213948,0.00011854948,0.00050749746,0.00008648701,0.00015425532,0.00074435864,0.00002389448,0.000030688476],"category_scores_gemma":[0.00005414421,0.00008057695,0.00005892487,0.00067544694,0.00009525741,0.00035086804,0.000063186526,0.00011275315,0.0000073438728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049995874,0.000025894247,0.0004816288,0.000002915293,0.000027837652,0.0000060709253,0.00021564314,0.99164575,0.0015535025,0.00048064403,0.000004258236,0.0055508562],"study_design_scores_gemma":[0.00029903496,0.000015454238,0.002107014,0.000083502826,0.00000823666,0.00023172017,0.00004651882,0.9965653,0.0003769169,0.00012630512,0.00006256024,0.00007747171],"about_ca_topic_score_codex":0.000007482572,"about_ca_topic_score_gemma":0.0000015385369,"teacher_disagreement_score":0.14044878,"about_ca_system_score_codex":0.00012490372,"about_ca_system_score_gemma":0.00016948667,"threshold_uncertainty_score":0.32858327},"labels":[],"label_agreement":null},{"id":"W2096361394","doi":"10.1142/s0129054114400267","title":"ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Queen's University","funders":"Russian Foundation for Basic Research","keywords":"Bijection, injection and surjection; Abelian group; Connection (principal bundle); Combinatorics on words; Mathematics; Alphabet; Combinatorics; Lattice (music); Word (group theory); Discrete mathematics; Bijection; Geometry; Linguistics","score_opus":0.017819204113933944,"score_gpt":0.28490041943164074,"score_spread":0.2670812153177068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096361394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45115906,0.0000034912691,0.5474225,0.0005478325,0.00042510577,0.000043164364,0.0000013853294,0.000009357908,0.00038807603],"genre_scores_gemma":[0.8546105,0.000002128503,0.14515808,0.00015238652,0.00006448149,0.000001090327,5.9056333e-7,0.000004332972,0.0000063981174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976786,0.00012504376,0.00062045915,0.00019597643,0.0012369952,0.000142957],"domain_scores_gemma":[0.99619627,0.0007314658,0.0010413898,0.00059407257,0.0013685883,0.000068211244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021585869,0.000109109045,0.00021685028,0.00035561953,0.00010002489,0.00017996396,0.0037275425,0.000021442413,0.000045987963],"category_scores_gemma":[0.00017409193,0.00006754723,0.000083072584,0.0006169645,0.00065251114,0.0011701699,0.00023615894,0.000112273345,0.000003819381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020393247,0.00025117144,0.00057323056,0.000009060273,0.0000509463,0.0000019876638,0.0012853462,0.0019655086,0.0015820739,0.8991667,0.0000463251,0.095047235],"study_design_scores_gemma":[0.0008880012,0.0010612953,0.020028787,0.0005346657,0.000018975416,0.0002702897,0.0001059384,0.74364,0.013380185,0.21959884,0.00026815763,0.00020482758],"about_ca_topic_score_codex":0.000066836554,"about_ca_topic_score_gemma":0.0000052905984,"teacher_disagreement_score":0.74167454,"about_ca_system_score_codex":0.000039247152,"about_ca_system_score_gemma":0.0003433725,"threshold_uncertainty_score":0.6926763},"labels":[],"label_agreement":null},{"id":"W2097880459","doi":"10.1142/s0129054112400035","title":"STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Finite-state machine; State (computer science); Turing machine; Encoding (memory); Mathematics; Time hierarchy theorem; Computable function; Deterministic finite automaton; Computational complexity theory; Finite state; Theoretical computer science; Discrete mathematics; Computer science; Algorithm; Universal Turing machine; Computation; Artificial intelligence","score_opus":0.03892250258857448,"score_gpt":0.3235433376829667,"score_spread":0.28462083509439223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097880459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09359268,0.00005277895,0.90136874,0.0012571469,0.0034676497,0.0000902144,0.000016598053,0.000022814822,0.00013137265],"genre_scores_gemma":[0.6479993,0.000010304447,0.35148722,0.00024793737,0.00022290887,0.0000019234747,0.0000011907363,0.000003750879,0.000025478686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978562,0.000049839407,0.00064785965,0.00018191276,0.0009567586,0.00030745874],"domain_scores_gemma":[0.9960831,0.00095084414,0.000674171,0.00031824724,0.0017993748,0.0001742556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979737,0.000117584736,0.00019934602,0.00046666912,0.00016431979,0.00036094646,0.0032959967,0.000018099969,0.000019723899],"category_scores_gemma":[0.0003939997,0.00010247159,0.00014842297,0.0005011373,0.0005107099,0.0034364273,0.0004304009,0.00011644949,0.000009217802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010863141,0.0010125306,0.0030645682,0.000028337463,0.00022628417,0.000018691084,0.005840024,0.011389717,0.0059051663,0.50972015,0.0015683973,0.46111754],"study_design_scores_gemma":[0.0023220077,0.00066444813,0.04732715,0.00020572168,0.000021466129,0.0005794817,0.00004803929,0.5352207,0.021352837,0.37303832,0.018655587,0.0005642602],"about_ca_topic_score_codex":0.000008027862,"about_ca_topic_score_gemma":0.0000013114853,"teacher_disagreement_score":0.5544066,"about_ca_system_score_codex":0.00011227127,"about_ca_system_score_gemma":0.00037704076,"threshold_uncertainty_score":0.6124837},"labels":[],"label_agreement":null},{"id":"W2098402986","doi":"10.1142/s0129054105003091","title":"FORMAL MODELLING OF VIRAL GENE COMPRESSION","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Genome; sort; Gene; Computer science; Computational biology; Formal language; Human genome; Biology; Theoretical computer science; Artificial intelligence; Genetics; Programming language; Information retrieval","score_opus":0.028339105833077364,"score_gpt":0.297394017972588,"score_spread":0.26905491213951066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098402986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07284003,0.00007153221,0.9250421,0.00051685184,0.0013159433,0.000042159587,0.000005736238,0.000010382769,0.00015529897],"genre_scores_gemma":[0.5303222,0.000016698423,0.46941537,0.000039847735,0.00019766047,2.848714e-7,0.0000013601322,0.0000018631857,0.000004695138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975078,0.000028556044,0.00077883963,0.0001850722,0.0013241062,0.00017562663],"domain_scores_gemma":[0.9967365,0.00009237971,0.0008519719,0.0003363503,0.0018874303,0.00009531672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008165857,0.00009885316,0.0001941535,0.0005884157,0.00012530915,0.00017672032,0.003383328,0.000028265611,0.000012494627],"category_scores_gemma":[0.00002798468,0.00008194171,0.00011185952,0.00035820715,0.00024546508,0.005098827,0.000787651,0.00012825287,0.000003859533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038804505,0.00037179978,0.00023317094,0.0000068361473,0.000048759208,0.00000772394,0.00074686995,0.50322837,0.018828044,0.058675174,0.0002575267,0.41755694],"study_design_scores_gemma":[0.00044519038,0.0001287008,0.0009006835,0.00009990671,0.0000044540493,0.00012107484,0.0000047871044,0.95976067,0.034054924,0.0030131121,0.0013828696,0.000083611536],"about_ca_topic_score_codex":0.000012890266,"about_ca_topic_score_gemma":4.8840127e-7,"teacher_disagreement_score":0.4574822,"about_ca_system_score_codex":0.00007298845,"about_ca_system_score_gemma":0.00034822748,"threshold_uncertainty_score":0.6287122},"labels":[],"label_agreement":null},{"id":"W2099378738","doi":"10.1142/s0129054105003467","title":"BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Decidability; Discrete mathematics; Characterization (materials science); Property (philosophy); Mathematics; Context (archaeology); Hamming code; Hamming distance; Computer science; Combinatorics; Algorithm; Block code","score_opus":0.015434950500011336,"score_gpt":0.36066984633973614,"score_spread":0.34523489583972483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099378738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41013142,0.000114705006,0.5884967,0.000578036,0.00028911952,0.000022651926,0.0000030078158,0.0000024485873,0.00036191588],"genre_scores_gemma":[0.56208444,0.000032807504,0.43751925,0.0001102208,0.00024250627,2.1540117e-7,0.0000032928997,0.0000011676103,0.000006064419],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992835,0.000032691998,0.00029199204,0.000107547006,0.00021006042,0.000074212985],"domain_scores_gemma":[0.9988658,0.000030347634,0.00025817667,0.000114731454,0.000687899,0.00004308307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070747884,0.000051351522,0.000076709606,0.00011887742,0.000069055444,0.00006744118,0.0005168265,0.000027878694,0.0000071731524],"category_scores_gemma":[0.000246245,0.000041653606,0.000044247026,0.0001098527,0.00031803883,0.000048428097,0.00023684476,0.000047461286,4.2818476e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055293236,0.00012149645,0.010054303,0.0000065789036,0.000081618826,0.0000020064829,0.0001435779,0.0010664253,0.19656698,0.021580122,0.00042686242,0.7698947],"study_design_scores_gemma":[0.0040163253,0.0018879441,0.14491701,0.00020640755,0.00008298495,0.0031522845,0.00047089902,0.045253552,0.6665817,0.018995821,0.113668874,0.00076621026],"about_ca_topic_score_codex":0.0000028657016,"about_ca_topic_score_gemma":0.000002181959,"teacher_disagreement_score":0.7691285,"about_ca_system_score_codex":0.00001738915,"about_ca_system_score_gemma":0.00009897824,"threshold_uncertainty_score":0.16985847},"labels":[],"label_agreement":null},{"id":"W2099641843","doi":"10.1142/s0129054103002011","title":"EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Quantum error correction; Quantum; Computer science; Error detection and correction; Theoretical computer science; Mathematics; Topology (electrical circuits); Quantum mechanics; Algorithm; Physics; Combinatorics","score_opus":0.020391253009062395,"score_gpt":0.30380964273272787,"score_spread":0.28341838972366545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099641843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26731783,0.000034647084,0.72588277,0.00060372177,0.00593651,0.000116613635,0.0000036867611,0.000022825163,0.000081402446],"genre_scores_gemma":[0.78670174,0.0000029177393,0.21290553,0.00010955896,0.00026176573,0.000002606653,7.3766876e-7,0.0000075085286,0.000007617675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704903,0.00007337891,0.00087406306,0.00039100376,0.0012504514,0.00036209443],"domain_scores_gemma":[0.99520314,0.0006001118,0.00096544257,0.00038237846,0.0026904189,0.00015849636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022570177,0.00018650803,0.00030591033,0.0008623585,0.0003680297,0.00050202577,0.0031079208,0.00004203771,0.00000533531],"category_scores_gemma":[0.0005727069,0.00016474524,0.00023457175,0.00089959137,0.0003224761,0.0005409116,0.00026361033,0.00023075331,0.000004652884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019607998,0.00056444947,0.0006343296,0.000032310494,0.00014113088,0.000027657708,0.002733308,0.5711983,0.006735516,0.21022145,0.00034000236,0.20735194],"study_design_scores_gemma":[0.00060457824,0.00029850352,0.0014781073,0.00015855768,0.000008969041,0.0005420659,0.000044698147,0.98089504,0.0051458715,0.0098892795,0.00075177616,0.00018257687],"about_ca_topic_score_codex":0.000009256491,"about_ca_topic_score_gemma":0.0000016867599,"teacher_disagreement_score":0.51938397,"about_ca_system_score_codex":0.00013071441,"about_ca_system_score_gemma":0.00092540827,"threshold_uncertainty_score":0.67181164},"labels":[],"label_agreement":null},{"id":"W2103582037","doi":"10.1142/s0129054107005224","title":"INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Western University","funders":"","keywords":"Intramolecular force; Closure (psychology); Recombination; Computer science; Molecular evolution; Algorithm; Biological system; Gene; Chemistry; Biology; Genetics; Stereochemistry; Genome","score_opus":0.014222193630403395,"score_gpt":0.3394265452310127,"score_spread":0.3252043516006093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103582037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4554365,0.000015395945,0.5435729,0.0002824801,0.0004144711,0.00002300866,0.0000011689239,0.000003628151,0.0002504444],"genre_scores_gemma":[0.86642355,0.000024347777,0.1332432,0.00012439014,0.00015972105,1.5778079e-7,0.000007155247,0.0000033147007,0.000014166697],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988345,0.000016736416,0.00043745525,0.00013503394,0.00047219562,0.00010407137],"domain_scores_gemma":[0.99745876,0.0000201122,0.00042788545,0.00014505643,0.001896158,0.00005200311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010618313,0.0000671191,0.00009337765,0.00036513555,0.000052427386,0.000052305833,0.00058501883,0.000037651054,0.0000020796892],"category_scores_gemma":[0.00016319884,0.000059851565,0.00009048865,0.00026533127,0.00025396637,0.000036955524,0.000094734394,0.00006209997,7.1383147e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030581377,0.00008038699,0.0005910198,0.0000013442888,0.00005389902,0.000008571209,0.000022063638,0.00019959242,0.92901254,0.0013097617,0.00017820807,0.06851202],"study_design_scores_gemma":[0.00025210515,0.00021894222,0.002962975,0.00002951116,0.000010620605,0.00020144666,0.000011094916,0.00045072514,0.99188435,0.0013357322,0.0025605035,0.00008197235],"about_ca_topic_score_codex":0.0000033705855,"about_ca_topic_score_gemma":0.000003079006,"teacher_disagreement_score":0.41098705,"about_ca_system_score_codex":0.00004438137,"about_ca_system_score_gemma":0.00015109759,"threshold_uncertainty_score":0.2440676},"labels":[],"label_agreement":null},{"id":"W2105159972","doi":"10.1142/s0129054114500129","title":"EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Security token; Node (physics); Computer science; Grid; Port (circuit theory); Degree (music); Traverse; Computer network; Topology (electrical circuits); Mathematics; Combinatorics; Geography; Engineering; Geometry; Physics","score_opus":0.020309873665442287,"score_gpt":0.2950705856064975,"score_spread":0.2747607119410552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105159972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014829524,0.000007337495,0.97946084,0.0036926155,0.0012818269,0.00008099595,0.0000017087331,0.000020505771,0.00062465214],"genre_scores_gemma":[0.58984303,0.000006397106,0.40980205,0.00017304329,0.0001558964,0.0000018733183,0.0000022060904,0.0000029443895,0.000012581515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758804,0.00006865982,0.0004972242,0.00019438866,0.0015043454,0.00014731767],"domain_scores_gemma":[0.9955053,0.00015639576,0.00053463015,0.0002552029,0.0034373808,0.000111129775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012078868,0.00008811618,0.00013081313,0.00072550273,0.00013706589,0.00038033925,0.0019483946,0.000017128554,0.000014876405],"category_scores_gemma":[0.00012535224,0.00007018076,0.000051838822,0.00076734327,0.0002739513,0.0018256181,0.00020969837,0.00010279091,0.000009586118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002414379,0.00020487896,0.00026434346,0.000004578931,0.00003379722,0.000004967631,0.0011865548,0.77173156,0.0005926234,0.14472567,0.00024569902,0.0809812],"study_design_scores_gemma":[0.00062296423,0.00038170748,0.0024703909,0.000063416264,0.0000038178323,0.000100246376,0.000021747948,0.9899451,0.0009879762,0.003314682,0.0019883316,0.000099582714],"about_ca_topic_score_codex":0.0000049990476,"about_ca_topic_score_gemma":0.0000016339459,"teacher_disagreement_score":0.5750135,"about_ca_system_score_codex":0.000087836575,"about_ca_system_score_gemma":0.0005429475,"threshold_uncertainty_score":0.366762},"labels":[],"label_agreement":null},{"id":"W2111476730","doi":"10.1142/s0129054113400248","title":"GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Generosity; Diligence; Wife; Computer science; Friendship; Sociology; Conversation; Law; Psychology; Political science; Social science","score_opus":0.012607172487750945,"score_gpt":0.2786848954411714,"score_spread":0.26607772295342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111476730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105798475,0.000036051926,0.86537033,0.024805004,0.003401745,0.00016502517,0.0000017854986,0.00002514369,0.00039645558],"genre_scores_gemma":[0.8893818,0.0000052980704,0.109156236,0.0009815142,0.00039347177,0.0000058019264,6.5193404e-7,0.000004498156,0.000070684604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976406,0.0000651265,0.0005756701,0.00022542,0.0012640285,0.00022915791],"domain_scores_gemma":[0.99675554,0.00022170806,0.00043986048,0.0004656947,0.0019713414,0.00014588445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012458016,0.00011344714,0.00015416171,0.0005300515,0.0001964085,0.0008548025,0.004954802,0.000024084125,0.00006766598],"category_scores_gemma":[0.00014198545,0.00007769434,0.000103843755,0.0008538635,0.00025566563,0.0034136088,0.00063453434,0.00014505313,0.00009364136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001437798,0.00046581536,0.0014559445,0.000008975588,0.00014483163,0.000015067813,0.0042783227,0.01025487,0.015353031,0.23193581,0.020319412,0.71575356],"study_design_scores_gemma":[0.0012627128,0.00073106814,0.13806185,0.00037338134,0.000023588807,0.0010079728,0.00016271423,0.7309295,0.014135838,0.053874105,0.058832157,0.0006050981],"about_ca_topic_score_codex":0.000031065356,"about_ca_topic_score_gemma":0.0000045911943,"teacher_disagreement_score":0.78358334,"about_ca_system_score_codex":0.0000897804,"about_ca_system_score_gemma":0.00036839012,"threshold_uncertainty_score":0.9207337},"labels":[],"label_agreement":null},{"id":"W2119388436","doi":"10.1142/s0129054107005479","title":"SC-EXPRESSIONS IN OBJECT-ORIENTED LANGUAGES","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Programming language; Synchronization (alternating current); Object (grammar); Object-oriented programming; Inheritance (genetic algorithm); Automaton; Theoretical computer science; Artificial intelligence","score_opus":0.01770261419507057,"score_gpt":0.3274741712441289,"score_spread":0.30977155704905834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119388436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05513222,0.000065873646,0.9398836,0.0004342137,0.0025690116,0.00006345178,4.3601514e-7,0.000017500695,0.0018337213],"genre_scores_gemma":[0.90800095,0.000007003406,0.09163899,0.00007517268,0.00024144417,7.2475154e-7,6.941846e-7,0.0000025769002,0.000032429234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99790084,0.000035642726,0.0006434209,0.00018956089,0.001019501,0.00021104747],"domain_scores_gemma":[0.9976832,0.00017816346,0.000510142,0.00025861862,0.0012712309,0.00009861295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019596172,0.00008580886,0.0001541158,0.0009920744,0.000085426596,0.00021004147,0.002319189,0.000030754436,0.000009243786],"category_scores_gemma":[0.00018896209,0.00007047109,0.00008015669,0.00093096483,0.00023122646,0.0014176216,0.00031747483,0.00014374038,0.000008269647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026713142,0.00049342396,0.016946249,0.000007555642,0.000050535684,0.00017110432,0.0036481882,0.0013402214,0.011529996,0.7637052,0.00025284215,0.20182794],"study_design_scores_gemma":[0.0075961277,0.0023620983,0.61914706,0.0006312619,0.000038192917,0.003212422,0.0013972609,0.1096427,0.09073868,0.1016977,0.061979067,0.0015574439],"about_ca_topic_score_codex":0.00005139658,"about_ca_topic_score_gemma":0.000031100568,"teacher_disagreement_score":0.85286874,"about_ca_system_score_codex":0.00012004598,"about_ca_system_score_gemma":0.000349905,"threshold_uncertainty_score":0.43096688},"labels":[],"label_agreement":null},{"id":"W2122692551","doi":"10.1142/s0129054112400394","title":"RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología; McMaster University","keywords":"Preference; Computer science; Leader election; Bandwidth (computing); Theoretical computer science; Mathematics; Statistics; Computer network","score_opus":0.03817242970142039,"score_gpt":0.3004254805165874,"score_spread":0.26225305081516703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122692551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11651591,0.00012912128,0.87833697,0.00070578395,0.0036897243,0.00012825313,0.0000012697567,0.000023178725,0.0004697901],"genre_scores_gemma":[0.91501814,0.000010784922,0.08464368,0.000076800025,0.00023030251,0.0000051478173,0.000001012595,0.0000032346813,0.00001087974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748725,0.00014884454,0.0008648674,0.0001857739,0.001054298,0.00025899656],"domain_scores_gemma":[0.9973032,0.000230824,0.0007314989,0.00024398087,0.0013851365,0.0001053674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026792253,0.00011801978,0.00032726114,0.0007776485,0.00008377267,0.00029859543,0.0018450604,0.000038653976,0.000007420541],"category_scores_gemma":[0.0002005594,0.00009830363,0.0001427177,0.00091716973,0.00023931792,0.003021206,0.00012127061,0.00017008063,0.0000050116514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050463774,0.00672055,0.067145705,0.00012652681,0.00063812523,0.000056303386,0.019728912,0.100258335,0.018646784,0.46705866,0.0014326324,0.31314108],"study_design_scores_gemma":[0.040362738,0.00022937018,0.04517936,0.0004882524,0.000024165656,0.00027672458,0.0000621183,0.8988021,0.0083638225,0.0029246295,0.0028897915,0.00039695323],"about_ca_topic_score_codex":0.000031509946,"about_ca_topic_score_gemma":0.0000101671585,"teacher_disagreement_score":0.79854375,"about_ca_system_score_codex":0.00022577215,"about_ca_system_score_gemma":0.00057877944,"threshold_uncertainty_score":0.40087056},"labels":[],"label_agreement":null},{"id":"W2131225295","doi":"10.1142/s0129054107004905","title":"INFORMATION DISTANCE AND ITS APPLICATIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Universality (dynamical systems); Computer science; Information theory; Theoretical computer science; Tracing; Range (aeronautics); Triangle inequality; Mathematics; Discrete mathematics; Programming language","score_opus":0.012182284036929059,"score_gpt":0.2975188154901351,"score_spread":0.28533653145320603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131225295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018403223,0.00007981578,0.9784797,0.0011458803,0.0012968283,0.00012832702,0.000003417995,0.000024205554,0.00043863748],"genre_scores_gemma":[0.74497396,0.000020029855,0.2547104,0.00012483603,0.00016203149,0.0000016732823,0.0000010415761,0.0000017180561,0.0000042966076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775726,0.000020675112,0.0007844627,0.00015644023,0.0011008659,0.0001803224],"domain_scores_gemma":[0.9954164,0.00030691107,0.0006944146,0.00027857727,0.003168103,0.00013559179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018506875,0.00009968043,0.00014789304,0.00074133294,0.00014879789,0.0004095431,0.0024959869,0.000028025659,0.00000514923],"category_scores_gemma":[0.00018645244,0.000092671165,0.00006386054,0.0008831727,0.00029111706,0.0047269235,0.0005088689,0.00012974405,0.000008415884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011989971,0.00014002582,0.0008268501,0.000010924343,0.000028492826,0.000004710665,0.00091997173,0.002280711,0.0006844893,0.36672133,0.000049692913,0.6283208],"study_design_scores_gemma":[0.0018615257,0.0005967111,0.10497521,0.00017097045,0.000024439254,0.0013853267,0.00015192133,0.73901546,0.01251598,0.088496275,0.050159227,0.0006469547],"about_ca_topic_score_codex":0.000004340306,"about_ca_topic_score_gemma":0.0000030118688,"teacher_disagreement_score":0.73673475,"about_ca_system_score_codex":0.00014693182,"about_ca_system_score_gemma":0.0003363434,"threshold_uncertainty_score":0.4638206},"labels":[],"label_agreement":null},{"id":"W2134525515","doi":"10.1142/s0129054107004863","title":"IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Range (aeronautics); Set (abstract data type); Power consumption; Computer science; Mathematics; Simple (philosophy); Mathematical optimization; Power (physics)","score_opus":0.03364534168025078,"score_gpt":0.3541425856134184,"score_spread":0.3204972439331676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134525515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051975244,0.00010073009,0.99446684,0.0020277086,0.002098,0.00068804866,0.000008748723,0.000021130176,0.00006906771],"genre_scores_gemma":[0.18622144,0.00004264558,0.8128236,0.00012900066,0.0006947309,0.000030018236,0.000006292688,0.000009154963,0.000043143114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715495,0.000049700073,0.0009912539,0.00029587254,0.0011026408,0.00040556348],"domain_scores_gemma":[0.9921791,0.0012240557,0.00088980776,0.00051769667,0.0049955356,0.00019380922],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0047964277,0.00014119703,0.00024684166,0.00070606166,0.000268644,0.00041313196,0.0054130265,0.00005731823,0.0000044411368],"category_scores_gemma":[0.00015618194,0.00013019188,0.00020035947,0.0007226506,0.0003782241,0.0015314806,0.000542185,0.00020563159,0.000001019114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006507562,0.0002842826,0.00008649447,0.0000079229985,0.00009888709,0.000002816718,0.00027780313,0.027129322,0.0010598899,0.015403822,0.00096052367,0.95462316],"study_design_scores_gemma":[0.0013596335,0.000357793,0.00055566465,0.00007056232,0.0000072222488,0.00005732449,0.000011171705,0.98651445,0.0017406357,0.001395636,0.0078022415,0.00012766742],"about_ca_topic_score_codex":0.000005596054,"about_ca_topic_score_gemma":0.0000056319495,"teacher_disagreement_score":0.9593851,"about_ca_system_score_codex":0.00032573374,"about_ca_system_score_gemma":0.0006804478,"threshold_uncertainty_score":0.9999682},"labels":[],"label_agreement":null},{"id":"W2141618567","doi":"10.1142/s012905410500311x","title":"AN AUTOMATA APPROACH TO MATCH GAPPED SEQUENCE TAGS AGAINST PROTEIN DATABASE","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Sequence (biology); Sequence database; String (physics); Computer science; Protein sequencing; Database; Computational biology; Peptide sequence; Biology; Genetics; Mathematics; Data structure; Programming language","score_opus":0.028705751240357107,"score_gpt":0.34873401197349724,"score_spread":0.3200282607331401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141618567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2422123,0.0000050800477,0.7547562,0.0012551467,0.0000699268,0.00010904762,0.000042642052,0.0000357158,0.0015139121],"genre_scores_gemma":[0.4926895,0.000005552207,0.5069438,0.00010702873,0.00018974581,0.000012828702,0.000015279173,0.000005188604,0.000031065592],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99820274,0.0000106194,0.0005558846,0.00025292372,0.00081569277,0.0001621332],"domain_scores_gemma":[0.9975354,0.000027211916,0.00047672528,0.00046787717,0.0013294592,0.00016329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256522,0.00011066453,0.00013942219,0.00029104907,0.0001277727,0.0001873672,0.0023098367,0.00003024347,0.000032467768],"category_scores_gemma":[0.000067168054,0.00010626208,0.00005794328,0.00035099278,0.00023792294,0.0015038498,0.00022419024,0.000167752,0.0000091194115],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023613811,0.00048155768,0.00007323172,0.000010982391,0.000019306819,0.0000026150253,0.0002356623,0.014910568,0.8763298,0.020266784,0.00017570828,0.087470174],"study_design_scores_gemma":[0.0006318503,0.0001058796,0.00016685325,0.00026859838,0.000011181194,0.00021563187,0.000064548105,0.28240985,0.69445175,0.00412661,0.017213043,0.00033421928],"about_ca_topic_score_codex":0.000009222045,"about_ca_topic_score_gemma":0.0000014460469,"teacher_disagreement_score":0.2674993,"about_ca_system_score_codex":0.00019647091,"about_ca_system_score_gemma":0.00034325683,"threshold_uncertainty_score":0.4333242},"labels":[],"label_agreement":null},{"id":"W2142901839","doi":"10.1142/s0129054115500197","title":"Automatic Sets of Rational Numbers","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closure (psychology); Rational number; Set (abstract data type); Set theory; Rational point; Algebra over a field","score_opus":0.027225692747738194,"score_gpt":0.31808074829621114,"score_spread":0.29085505554847296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142901839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23322742,0.000031044292,0.7626878,0.0011424619,0.002332074,0.000041402305,0.00000309399,0.00001635645,0.00051834073],"genre_scores_gemma":[0.72256404,0.0000032190073,0.2772329,0.00009402811,0.00009430736,5.461758e-7,0.000001055352,0.0000023593213,0.000007568536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733496,0.000052413503,0.0007303279,0.00015616753,0.0015962595,0.00012989604],"domain_scores_gemma":[0.99564135,0.00019489617,0.00088039617,0.0002910867,0.002861189,0.00013110893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016160216,0.000089140376,0.00019137833,0.0006043689,0.000053112424,0.00019012523,0.0030782528,0.000023320967,0.000024479446],"category_scores_gemma":[0.00025156164,0.000077896264,0.00010242587,0.0006348613,0.00040141647,0.002347102,0.00035115593,0.00008788793,0.000009521417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029741528,0.00063218427,0.0029053336,0.000019351433,0.00019507634,0.00003626988,0.004327978,0.015506086,0.0056334543,0.608738,0.0031179306,0.3588586],"study_design_scores_gemma":[0.0012675673,0.0003736122,0.014124458,0.00020626112,0.000014328981,0.00069819076,0.00009675031,0.87264895,0.010610646,0.098638885,0.0011133025,0.00020702071],"about_ca_topic_score_codex":0.000011798779,"about_ca_topic_score_gemma":0.0000012456926,"teacher_disagreement_score":0.85714287,"about_ca_system_score_codex":0.00011227582,"about_ca_system_score_gemma":0.0011680346,"threshold_uncertainty_score":0.57202107},"labels":[],"label_agreement":null},{"id":"W2144782101","doi":"10.1142/s0129054111008647","title":"OVERLAP-FREE LANGUAGES AND SOLID CODES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Undecidable problem; Decidability; Prefix code; Property (philosophy); Computer science; Linear code; Mathematics; Prime (order theory); Regular language; Discrete mathematics; Block code; Algorithm; Theoretical computer science; Combinatorics; Automaton","score_opus":0.018678284295213607,"score_gpt":0.30702943961086426,"score_spread":0.28835115531565064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144782101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18287152,0.00008889167,0.81426275,0.00053520006,0.0010597535,0.000027983015,0.0000030239287,0.000017914314,0.0011329608],"genre_scores_gemma":[0.7524049,0.000024372854,0.2473252,0.00013679199,0.000096464704,3.493662e-7,2.2525894e-7,0.0000019789134,0.000009715966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.000025208858,0.00035495436,0.00014995712,0.00062747573,0.00011703064],"domain_scores_gemma":[0.9983093,0.000107561595,0.0003746248,0.0003087596,0.0008226325,0.000077126024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007408486,0.000073302755,0.00012869478,0.00042069607,0.000077234516,0.00021870322,0.003060969,0.00001752423,0.000017411037],"category_scores_gemma":[0.00012208002,0.00006116345,0.00005353617,0.0002713669,0.00038392193,0.0018488246,0.0006230033,0.00007665598,0.0000032639164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022033659,0.0002595083,0.0040641646,0.000007937346,0.00010414194,0.00006365486,0.004398961,0.00014569736,0.008480542,0.7472579,0.00051028735,0.2346852],"study_design_scores_gemma":[0.0028519118,0.0012337924,0.28605378,0.0005118232,0.000043915414,0.003284777,0.00054451515,0.203564,0.09107722,0.4078821,0.0022118494,0.00074031693],"about_ca_topic_score_codex":0.00001804469,"about_ca_topic_score_gemma":0.0000022395345,"teacher_disagreement_score":0.5695334,"about_ca_system_score_codex":0.000030898413,"about_ca_system_score_gemma":0.00018151742,"threshold_uncertainty_score":0.5688093},"labels":[],"label_agreement":null},{"id":"W2146051038","doi":"10.1142/s0129054108005954","title":"COMPLEXITY, INFORMATION, ENERGY","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Connection (principal bundle); Computer science; Energy (signal processing); Theoretical computer science; Mathematics","score_opus":0.034401421306920775,"score_gpt":0.28782088795968747,"score_spread":0.2534194666527667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146051038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025071794,0.000025787505,0.96796805,0.002263144,0.0036331224,0.00004835668,0.0000038027206,0.000037117967,0.0009488264],"genre_scores_gemma":[0.63756216,0.0000208345,0.36187008,0.00032199998,0.0002115463,9.1450823e-7,0.0000018430788,0.0000022023553,0.000008405994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965757,0.00005818653,0.0010182535,0.00020718914,0.0019174605,0.00022317094],"domain_scores_gemma":[0.99311596,0.00019966495,0.0008979475,0.0004782437,0.0051512783,0.00015688433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009113247,0.00013897027,0.00024260959,0.0010942385,0.00024964724,0.00035997655,0.0053314934,0.00003327082,0.00002754475],"category_scores_gemma":[0.00020278913,0.00012746899,0.00015787913,0.0011199336,0.001028602,0.0061112996,0.0009948568,0.00014002288,0.00001682721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025336112,0.000573881,0.0032693876,0.000008927384,0.0001234221,0.00006748785,0.0024571843,0.014923657,0.00062907883,0.6672218,0.0024909112,0.30820894],"study_design_scores_gemma":[0.0017744479,0.00071411056,0.10046233,0.00009480503,0.000012742943,0.005080101,0.000034510016,0.72657686,0.0057521155,0.12854324,0.030411828,0.00054287235],"about_ca_topic_score_codex":0.00005169202,"about_ca_topic_score_gemma":0.0000043225987,"teacher_disagreement_score":0.71165323,"about_ca_system_score_codex":0.00019904361,"about_ca_system_score_gemma":0.001093808,"threshold_uncertainty_score":0.990733},"labels":[],"label_agreement":null},{"id":"W2146148441","doi":"10.1142/s0129054112400059","title":"FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Decidability; Property (philosophy); Formal language; Computer science; Regular language; Programming language; Code (set theory); Coding (social sciences); Mathematics; Theoretical computer science; Automaton","score_opus":0.07281263454795484,"score_gpt":0.35218667728933695,"score_spread":0.2793740427413821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146148441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3507104,0.000040319108,0.6470787,0.0004983698,0.001468452,0.0000730738,0.00000760164,0.000011309793,0.00011179986],"genre_scores_gemma":[0.80458045,0.0000066383054,0.19516724,0.00008032284,0.00015537249,0.0000019489946,0.0000017686839,0.0000029463777,0.0000033381186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99757123,0.000062457926,0.0008518749,0.00014000926,0.0011263852,0.00024802436],"domain_scores_gemma":[0.9966839,0.00010957306,0.00081629364,0.00031241195,0.0019608526,0.0001169788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019569574,0.00009873394,0.00018817153,0.00057037047,0.00014343797,0.00018782153,0.0026198442,0.000021626107,0.00004316606],"category_scores_gemma":[0.00009064209,0.000083148334,0.00012296512,0.00055527326,0.00059695716,0.005780163,0.0006219483,0.0000938359,0.0000047353883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038973503,0.0009947184,0.020700201,0.000029547598,0.00015198083,0.0000023549806,0.006048269,0.0014875856,0.040924247,0.66432863,0.00036486812,0.26492864],"study_design_scores_gemma":[0.003354927,0.0014435379,0.47371158,0.00051372877,0.00007943999,0.0012105017,0.0010952636,0.2246967,0.1893483,0.0999705,0.0038158519,0.0007596727],"about_ca_topic_score_codex":0.000030336725,"about_ca_topic_score_gemma":0.000009405591,"teacher_disagreement_score":0.5643581,"about_ca_system_score_codex":0.0001416856,"about_ca_system_score_gemma":0.0004286028,"threshold_uncertainty_score":0.48683655},"labels":[],"label_agreement":null},{"id":"W2146441371","doi":"10.1142/s0129054114400103","title":"NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Monomial; Mathematics; Combinatorics; Upper and lower bounds; Time complexity; Polynomial; State (computer science); PSPACE; Matching (statistics); Discrete mathematics; Constant (computer programming); Regular language; NP; Computational complexity theory; Automaton; Computer science; Algorithm; Turing machine; Theoretical computer science","score_opus":0.029026363745375795,"score_gpt":0.3105459000499086,"score_spread":0.2815195363045328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146441371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17881542,0.00000953694,0.8185256,0.00076167844,0.0014784344,0.00004427631,0.0000052246796,0.000012433606,0.00034740425],"genre_scores_gemma":[0.7412499,0.0000039940305,0.25852248,0.000094349205,0.000113456794,4.5986826e-7,0.0000010713866,0.000002624307,0.000011678372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973267,0.00006925968,0.00088624726,0.00019939289,0.0013656527,0.00015278503],"domain_scores_gemma":[0.9957126,0.00023439743,0.0012258985,0.00035405243,0.002381303,0.00009175515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018900769,0.00009922141,0.00023653398,0.00057231117,0.000086440086,0.00017707505,0.0031847926,0.000018644221,0.000021907314],"category_scores_gemma":[0.00025270387,0.00008519683,0.00012195308,0.0004727074,0.0009964786,0.0013636327,0.00040094552,0.00010195223,0.000005657768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032663367,0.00040886042,0.0013341364,0.000021831278,0.00008441136,0.00001619534,0.0007233202,0.0041322345,0.017377062,0.72626036,0.0001992523,0.24940968],"study_design_scores_gemma":[0.0009182829,0.00059481413,0.05570187,0.00024441327,0.000013422278,0.00066368654,0.000013074408,0.5578869,0.027338166,0.35496214,0.0014233658,0.00023987802],"about_ca_topic_score_codex":0.000008707123,"about_ca_topic_score_gemma":0.0000013328756,"teacher_disagreement_score":0.5624345,"about_ca_system_score_codex":0.00006224561,"about_ca_system_score_gemma":0.00051352935,"threshold_uncertainty_score":0.591819},"labels":[],"label_agreement":null},{"id":"W2155847630","doi":"10.1142/s0129054102001254","title":"A DYNAMICS RECOMMENDATION SYSTEM BASED ON LOG MINING","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University; Chinese Academy of Sciences; University of Saskatchewan; National Science Foundation","keywords":"Computer science; Recommender system; Classifier (UML); Web page; Web mining; Data mining; Information retrieval; Search engine; World Wide Web; Artificial intelligence","score_opus":0.025673810077958128,"score_gpt":0.28154205429292,"score_spread":0.2558682442149619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155847630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012037768,0.0000055313385,0.9798696,0.004723019,0.0017181875,0.000029514582,0.000008339052,0.000026009868,0.0015820246],"genre_scores_gemma":[0.76920426,0.0000032763633,0.2304719,0.00016438139,0.00013276582,7.078959e-7,0.00000483997,0.0000029341206,0.000014925044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795055,0.000059316066,0.00060677243,0.00023603269,0.0009979936,0.00014934695],"domain_scores_gemma":[0.99722964,0.00024210713,0.0007464717,0.00034785928,0.0013433292,0.000090591115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001072252,0.00010129857,0.00017568246,0.0011606687,0.00014936566,0.00045637213,0.0026568999,0.000025258323,0.00003080189],"category_scores_gemma":[0.00015244797,0.00009136249,0.00011758257,0.0009135031,0.00015260182,0.0015680554,0.00019056667,0.00011284511,0.000016881191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001922991,0.0005630628,0.0023871732,0.000017322518,0.00013785732,0.000045979366,0.00081411394,0.06665834,0.00033259412,0.08528682,0.0018233192,0.8419142],"study_design_scores_gemma":[0.00030926385,0.00016260539,0.0008632172,0.00013687262,0.000008970003,0.00008207137,0.000033948694,0.9974914,0.00024581712,0.00013288682,0.00044833802,0.00008456305],"about_ca_topic_score_codex":0.00000728363,"about_ca_topic_score_gemma":0.0000025079598,"teacher_disagreement_score":0.9308331,"about_ca_system_score_codex":0.00030009446,"about_ca_system_score_gemma":0.00016847439,"threshold_uncertainty_score":0.4937225},"labels":[],"label_agreement":null},{"id":"W2163125260","doi":"10.1142/s0129054113400339","title":"UNAMBIGUOUS CONSTRAINED AUTOMATA","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Decidability; Class (philosophy); Automaton; Closure (psychology); Set (abstract data type); Bounded function; Discrete mathematics; Mathematics; Tree automaton; Computer science; Combinatorics; Theoretical computer science; Programming language","score_opus":0.011032883667456058,"score_gpt":0.2731136558638009,"score_spread":0.2620807721963448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163125260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09923722,0.000021477686,0.8933226,0.003793476,0.002569963,0.00006799653,0.0000018782019,0.0000390302,0.0009463749],"genre_scores_gemma":[0.7605737,0.000007918684,0.23900817,0.0002515588,0.00013511298,0.0000010601173,6.069706e-7,0.0000027788274,0.000019099396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979044,0.000036567642,0.00061340193,0.0001924235,0.0010712856,0.00018191853],"domain_scores_gemma":[0.9965689,0.00016258711,0.0005936859,0.00037740343,0.0021771141,0.00012028853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329541,0.00010036138,0.00016979646,0.0006216578,0.00010060828,0.00062616775,0.0042786575,0.000024604271,0.00007696269],"category_scores_gemma":[0.00013121798,0.0000847545,0.00010399725,0.0005634089,0.00051376445,0.0033468544,0.00045685537,0.00011025823,0.000049425347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005960536,0.00030399367,0.0004673874,0.0000059138683,0.00009339132,0.00003019486,0.0007187536,0.0015930237,0.01563457,0.38964224,0.0015267825,0.5899778],"study_design_scores_gemma":[0.0014707275,0.0004541539,0.039324276,0.0002033887,0.000012533024,0.001590274,0.000057053974,0.7839461,0.01261235,0.15788695,0.0020854191,0.00035675286],"about_ca_topic_score_codex":0.00002578276,"about_ca_topic_score_gemma":5.652059e-7,"teacher_disagreement_score":0.7823531,"about_ca_system_score_codex":0.000079239675,"about_ca_system_score_gemma":0.00052009494,"threshold_uncertainty_score":0.7950882},"labels":[],"label_agreement":null},{"id":"W2164666293","doi":"10.1142/s0129054106004364","title":"ERRATA: \"REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES\"","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Representation (politics); Non canonical; Mathematics; Algebra over a field; Computer science; Pure mathematics; Linguistics; Philosophy; Biology; Political science","score_opus":0.03642338316837041,"score_gpt":0.38992975772581817,"score_spread":0.35350637455744777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164666293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3691026,0.00004250074,0.6294933,0.00038726977,0.00036668425,0.0000526994,0.000010903355,0.000007404303,0.0005366467],"genre_scores_gemma":[0.78186965,0.000012691361,0.21796688,0.000010142409,0.000092569906,8.1653263e-7,0.000001569659,0.0000039010347,0.00004176189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980851,0.000032296903,0.0007366774,0.00012436107,0.0009152738,0.00010632083],"domain_scores_gemma":[0.9972711,0.0007350336,0.0007690396,0.00016351644,0.0010127032,0.000048568865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000637988,0.000079587815,0.00022346803,0.000232127,0.00005290486,0.00007617807,0.00072103634,0.000024125504,0.000025013285],"category_scores_gemma":[0.00055908074,0.0000674062,0.00005872237,0.00032079167,0.00083858153,0.0009357301,0.0001816324,0.00008475017,6.880408e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036156554,0.00033852097,0.0014565312,0.000047176254,0.000061857056,0.000004658014,0.00055609987,0.00064855325,0.020730564,0.96683294,0.0010536895,0.008233261],"study_design_scores_gemma":[0.0004898855,0.00011863942,0.0011266911,0.00020291141,0.000024949284,0.00011577421,0.00010143048,0.006224523,0.03252231,0.9588023,0.00017199895,0.00009861372],"about_ca_topic_score_codex":0.000012170768,"about_ca_topic_score_gemma":0.0000035153223,"teacher_disagreement_score":0.41276708,"about_ca_system_score_codex":0.000060183083,"about_ca_system_score_gemma":0.00020269056,"threshold_uncertainty_score":0.30897886},"labels":[],"label_agreement":null},{"id":"W2165734290","doi":"10.1142/s0129054105003145","title":"OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Substitution (logic); Computer science; Generalization; Closure (psychology); Coding (social sciences); Theoretical computer science; Cryptanalysis; Algorithm; Mathematics; Cryptography; Programming language","score_opus":0.016088233679205848,"score_gpt":0.3034733916116786,"score_spread":0.2873851579324727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165734290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3637076,0.0000085187985,0.6349248,0.00092156156,0.000093873066,0.00005200821,0.0000030132696,0.000001987737,0.0002866196],"genre_scores_gemma":[0.7929815,0.000010701706,0.20649472,0.00026507652,0.00022375592,0.0000014230017,0.000003377079,0.0000013676627,0.000018075196],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994189,0.0000071062914,0.00021119205,0.00008174688,0.00021832723,0.00006271813],"domain_scores_gemma":[0.9991477,0.000020895808,0.00009355263,0.00007650325,0.00060835405,0.000052956202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039539,0.000047862115,0.00005904578,0.00013245323,0.00008873378,0.00008829607,0.00033339582,0.0000144751975,0.0000027824321],"category_scores_gemma":[0.000043587155,0.000034286615,0.000020426596,0.00013605814,0.00014916193,0.00003196573,0.000077087636,0.000038371676,0.0000024993954],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001871352,0.00043160733,0.003951639,0.000011920079,0.00016048749,0.0000020807909,0.00074561086,0.124120675,0.2644287,0.036401443,0.0008198463,0.5687388],"study_design_scores_gemma":[0.003947925,0.010802641,0.07538555,0.0005760021,0.00008174982,0.0012375525,0.0004949692,0.14910889,0.50837415,0.00088189804,0.24787636,0.0012323238],"about_ca_topic_score_codex":6.976638e-7,"about_ca_topic_score_gemma":0.0000041031212,"teacher_disagreement_score":0.5675065,"about_ca_system_score_codex":0.000016479435,"about_ca_system_score_gemma":0.00010119407,"threshold_uncertainty_score":0.13981676},"labels":[],"label_agreement":null},{"id":"W2167511304","doi":"10.1142/s0129054109006486","title":"ON SPANNERS OF GEOMETRIC GRAPHS","year":2009,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Mathematics; Upper and lower bounds; Graph; Discrete mathematics; Geometric graph theory; Graph power; Line graph; Computer science","score_opus":0.015589209680839705,"score_gpt":0.3018274943960976,"score_spread":0.28623828471525786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167511304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16753477,0.00004018536,0.82865304,0.0014127691,0.0018039865,0.000046385354,0.0000019134259,0.000009397707,0.0004975447],"genre_scores_gemma":[0.84434044,0.000017804286,0.15528266,0.0002362096,0.000107901076,2.952448e-7,0.0000014074627,0.0000016436682,0.0000116286465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742836,0.00003512164,0.0006788218,0.00019549175,0.0015268786,0.00013535145],"domain_scores_gemma":[0.99588436,0.0002512002,0.000790436,0.00025680207,0.002726986,0.00009020898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009498012,0.000097681426,0.00018413698,0.002611527,0.00008175672,0.00015660019,0.002319537,0.000024999177,0.000011558756],"category_scores_gemma":[0.00027115372,0.00008808978,0.00014175469,0.0024590413,0.00017950486,0.0014410064,0.00011522066,0.00010864116,0.000004441821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030044206,0.0004080939,0.00016656275,0.0000030544172,0.000045421337,0.000008553197,0.00024419252,0.10039481,0.005283048,0.5489275,0.0005278991,0.34396085],"study_design_scores_gemma":[0.0027825101,0.004642044,0.14351563,0.00036464643,0.00003546886,0.00057085353,0.000029517332,0.3510478,0.09767773,0.39653122,0.0022201065,0.0005824401],"about_ca_topic_score_codex":0.000002932983,"about_ca_topic_score_gemma":3.3966705e-7,"teacher_disagreement_score":0.6768057,"about_ca_system_score_codex":0.00007691457,"about_ca_system_score_gemma":0.00045767345,"threshold_uncertainty_score":0.43103155},"labels":[],"label_agreement":null},{"id":"W2168854371","doi":"10.1142/s0129054107005443","title":"STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Quantum finite automata; Automaton; Mathematics; Regular language; DFA minimization; ω-automaton; Simple (philosophy); Upper and lower bounds; State (computer science); Discrete mathematics; Finite state; Automata theory; Combinatorics; Theoretical computer science; Computer science; Algorithm","score_opus":0.02620600082371652,"score_gpt":0.3086807984164208,"score_spread":0.28247479759270433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168854371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13535255,0.000019051635,0.8617227,0.0006296475,0.0016857467,0.00005041515,0.000020202933,0.000022146263,0.00049756083],"genre_scores_gemma":[0.72643983,0.000012537241,0.273335,0.000099253215,0.00009816668,2.6562637e-7,0.000002349521,0.0000029351388,0.0000096879085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972603,0.00004667627,0.0009132524,0.0002073123,0.0013624817,0.00021002592],"domain_scores_gemma":[0.99508286,0.00053679117,0.0011683956,0.00036748685,0.002729306,0.000115135575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022313176,0.00011290477,0.00023289748,0.0009179149,0.00009697848,0.00017036716,0.0036775363,0.000023831199,0.00002991386],"category_scores_gemma":[0.00015915248,0.00009919692,0.00012679453,0.00088142144,0.001006946,0.0020121688,0.0005275743,0.00013609004,0.00000728101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008253764,0.0006560145,0.0010261324,0.000012641504,0.00018604283,0.00007277405,0.0022734574,0.0018118406,0.0089869555,0.4464275,0.00044181367,0.5380223],"study_design_scores_gemma":[0.0018357686,0.0007051087,0.12270364,0.0003857941,0.000018716051,0.0004686891,0.00006560821,0.5846027,0.09874997,0.1873728,0.0027136826,0.00037749624],"about_ca_topic_score_codex":0.000018623277,"about_ca_topic_score_gemma":0.0000053279314,"teacher_disagreement_score":0.5910873,"about_ca_system_score_codex":0.00009942073,"about_ca_system_score_gemma":0.00046450022,"threshold_uncertainty_score":0.6833839},"labels":[],"label_agreement":null},{"id":"W2169267790","doi":"10.1142/s0129054111009045","title":"STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Intersection (aeronautics); State (computer science); Combined operations; Mathematics; Computer science; Algorithm; Engineering; Law","score_opus":0.041020828804904735,"score_gpt":0.29559549966654275,"score_spread":0.254574670861638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169267790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32418427,0.000017565326,0.6738212,0.00049024745,0.0012219284,0.00006945009,0.00000489815,0.000015050097,0.00017535969],"genre_scores_gemma":[0.82864565,0.000020549227,0.17120236,0.00006395491,0.000049497652,0.0000015461402,0.000002949491,0.0000036310098,0.000009851207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980027,0.000089447116,0.0007759699,0.00021479564,0.00078402436,0.00013307732],"domain_scores_gemma":[0.9959652,0.00010144114,0.00065327185,0.00026398498,0.0029304724,0.00008562864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622923,0.00011208028,0.00020021034,0.00086723646,0.0001449436,0.00019449573,0.0016672802,0.000021256572,0.000020619145],"category_scores_gemma":[0.000105282845,0.00010009154,0.000074202406,0.00058534596,0.00074046734,0.0028281445,0.0003186696,0.000107509186,0.0000026028051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060449365,0.00067906844,0.003584518,0.000018922165,0.0001738431,0.000011845517,0.0089402925,0.005799653,0.025333304,0.86178905,0.00008370907,0.093525335],"study_design_scores_gemma":[0.0020060537,0.0007096214,0.10978885,0.00021051847,0.000022845226,0.00038172753,0.00014633728,0.64631623,0.060220398,0.1798487,0.00006584158,0.000282869],"about_ca_topic_score_codex":0.00024050102,"about_ca_topic_score_gemma":0.000040105944,"teacher_disagreement_score":0.6819404,"about_ca_system_score_codex":0.000098493634,"about_ca_system_score_gemma":0.00032943752,"threshold_uncertainty_score":0.40816146},"labels":[],"label_agreement":null},{"id":"W2178095809","doi":"10.1142/s0129054115500124","title":"State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Intersection (aeronautics); Upper and lower bounds; Alphabet; Combinatorics; Mathematics; State (computer science); Discrete mathematics; Deterministic finite automaton; Nondeterministic finite automaton; Finite-state machine; Binary number; Automaton; Automata theory; Computer science; Arithmetic; Theoretical computer science; Algorithm","score_opus":0.03549565474146355,"score_gpt":0.3102429891193492,"score_spread":0.2747473343778857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178095809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18507746,0.00006687178,0.812347,0.0011527509,0.001140768,0.00007390632,0.000012118358,0.000013266752,0.0001158611],"genre_scores_gemma":[0.74465007,0.000009690506,0.25516307,0.000065423716,0.000094743766,0.000001084463,0.0000015533742,0.0000029819673,0.00001138234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998419,0.000054008917,0.0005017084,0.00017453206,0.0007306187,0.00012014254],"domain_scores_gemma":[0.99668956,0.00014079959,0.0006668297,0.0003162226,0.0020887956,0.0000978129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017434251,0.00008549099,0.00018213839,0.00043801704,0.000060725208,0.00017004988,0.0020114298,0.000019473333,0.0000016677964],"category_scores_gemma":[0.00022207916,0.00007499052,0.00007529179,0.00030389306,0.0005627273,0.0016282503,0.00045431042,0.00006698945,4.6455983e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002049498,0.0005847831,0.0017705859,0.0000658032,0.00023040915,0.000014711825,0.006690939,0.0058796178,0.035633724,0.61983675,0.002992611,0.32609513],"study_design_scores_gemma":[0.0039518513,0.0016516617,0.015273522,0.00040468364,0.000031625135,0.00071675365,0.0003614617,0.34974822,0.07868938,0.54583573,0.002973583,0.00036154754],"about_ca_topic_score_codex":0.000028764085,"about_ca_topic_score_gemma":0.000007081035,"teacher_disagreement_score":0.55957264,"about_ca_system_score_codex":0.00007263243,"about_ca_system_score_gemma":0.00028374905,"threshold_uncertainty_score":0.37377706},"labels":[],"label_agreement":null},{"id":"W2214007724","doi":"10.1142/s0129054115500288","title":"Shortest, Fastest, and Foremost Broadcast in Dynamic Networks","year":2015,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bounded function; Graph; Upper and lower bounds; Shortest path problem; Class (philosophy); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.026783227500746628,"score_gpt":0.3116693806386324,"score_spread":0.2848861531378858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214007724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028025363,0.00047045152,0.964691,0.001023768,0.0051185996,0.00013658496,0.000008164252,0.000016970205,0.00050911464],"genre_scores_gemma":[0.8688583,0.00020051905,0.13045645,0.00013170668,0.00031652383,0.000002108769,0.000008066044,0.000007923028,0.000018399798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966613,0.00006890674,0.0011646674,0.0004689773,0.0013450471,0.00029108993],"domain_scores_gemma":[0.99517167,0.00023107501,0.0011887209,0.000511892,0.0026498556,0.00024680825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019412969,0.00024067484,0.00045426682,0.0010918687,0.000078280435,0.0008018622,0.004139568,0.00012709168,0.0000048556767],"category_scores_gemma":[0.000048733462,0.00022789779,0.00011820739,0.00059142546,0.00059040816,0.0013308966,0.0024919396,0.00064368924,0.0000015260075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031256557,0.00023339539,0.0026694871,0.000014750247,0.00008712364,0.00018735554,0.00079406076,0.17306566,0.000023041523,0.010248033,0.0005425984,0.8121032],"study_design_scores_gemma":[0.00042772596,0.00012231,0.003828831,0.0004120726,0.0000116765295,0.00050873717,0.000014400087,0.9797185,0.0000045545407,0.014502801,0.00025524048,0.0001931565],"about_ca_topic_score_codex":0.000029726618,"about_ca_topic_score_gemma":0.000018817738,"teacher_disagreement_score":0.84083295,"about_ca_system_score_codex":0.00028010563,"about_ca_system_score_gemma":0.0018106793,"threshold_uncertainty_score":0.9293402},"labels":[],"label_agreement":null},{"id":"W2219863946","doi":"10.1142/s0129054118500089","title":"On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash function; Universal hashing; Hash chain; Cryptography; Perfect hash function; Integer (computer science); Secrecy; Information-theoretic security; Double hashing","score_opus":0.01575639365929202,"score_gpt":0.28787025731881577,"score_spread":0.2721138636595237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219863946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24372004,0.0000041806597,0.7548873,0.0005842855,0.00042178656,0.00007795403,0.0000019491808,0.000017010203,0.000285499],"genre_scores_gemma":[0.8416671,0.0000026120188,0.15787135,0.00028751258,0.0001590549,0.0000028218196,0.0000011661919,0.0000027754995,0.000005576672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987175,0.000039560273,0.0002561383,0.00023775705,0.00063871127,0.00011034103],"domain_scores_gemma":[0.9973842,0.00010956558,0.000263661,0.00029533374,0.0018171159,0.00013016148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063910877,0.00008332357,0.00009685984,0.00074654876,0.00023672725,0.00034545665,0.0014189093,0.000018070898,0.0000074513964],"category_scores_gemma":[0.00002710905,0.00007139496,0.00003288524,0.0007814733,0.00045572873,0.0015619107,0.00015464352,0.0000737531,0.000007910105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009851004,0.00017552072,0.0003199228,0.0000017459037,0.000038896695,0.0000013463844,0.0010837899,0.00048133577,0.0067205587,0.835677,0.000049063423,0.1553523],"study_design_scores_gemma":[0.0028713336,0.015429035,0.19385743,0.00051991985,0.00010650714,0.0005434119,0.0004890897,0.19575809,0.012762938,0.5634133,0.013336621,0.0009123241],"about_ca_topic_score_codex":0.000005641158,"about_ca_topic_score_gemma":0.0000058916635,"teacher_disagreement_score":0.59794706,"about_ca_system_score_codex":0.000048585287,"about_ca_system_score_gemma":0.00020684094,"threshold_uncertainty_score":0.33312464},"labels":[],"label_agreement":null},{"id":"W2234017799","doi":"10.1142/s0129054118500053","title":"Arbitrary Overlap Constraints in Graph Packing Problems","year":2018,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Function (biology); Discrete mathematics; Vertex (graph theory)","score_opus":0.03772099834689924,"score_gpt":0.352113442025102,"score_spread":0.31439244367820274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234017799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08723027,0.0001026769,0.9059225,0.00091905275,0.004811277,0.0002113957,0.000011464584,0.000023535842,0.00076784065],"genre_scores_gemma":[0.7199014,0.00006725442,0.2796281,0.00009361222,0.00028843505,0.0000044943927,0.000002706865,0.000008224988,0.0000058007795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951488,0.0001524175,0.0012848893,0.0005780556,0.0024480785,0.00038775694],"domain_scores_gemma":[0.9932474,0.00035204136,0.0014946556,0.00075393345,0.003979479,0.00017251533],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0031639563,0.00024372104,0.00042217853,0.0031965955,0.00011693176,0.0007422168,0.009024988,0.00010485738,0.000025346224],"category_scores_gemma":[0.0003300962,0.00023477517,0.00024945673,0.0013499501,0.002307264,0.0024539707,0.0029947772,0.00085848244,0.000008441695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117062904,0.0013814657,0.020238748,0.00017173094,0.0005298219,0.00039450973,0.005316678,0.08054822,0.0058793165,0.5765149,0.00037387188,0.30853364],"study_design_scores_gemma":[0.0010510633,0.00035141603,0.01865901,0.0018805801,0.000010591897,0.0005299178,0.000035827077,0.104161456,0.0034812225,0.8690251,0.0003425613,0.0004712186],"about_ca_topic_score_codex":0.00001476307,"about_ca_topic_score_gemma":0.000008104966,"teacher_disagreement_score":0.6326711,"about_ca_system_score_codex":0.0003143722,"about_ca_system_score_gemma":0.0022690324,"threshold_uncertainty_score":0.99633664},"labels":[],"label_agreement":null},{"id":"W2274293958","doi":"10.1142/s0129054116500313","title":"Exploration of Faulty Hamiltonian Graphs","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Computer science; Node (physics); Overhead (engineering); Competitive analysis; Situated; Hamiltonian path; Algorithm; Mathematics; Theoretical computer science; Graph; Engineering; Upper and lower bounds; Artificial intelligence","score_opus":0.05308547114641386,"score_gpt":0.3491501009345286,"score_spread":0.2960646297881147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274293958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054267687,0.000047357782,0.98461276,0.0042694425,0.004748333,0.00015721751,0.000019238641,0.00002147427,0.00069743476],"genre_scores_gemma":[0.6539325,0.00016428337,0.34559622,0.00007976717,0.0001771939,0.0000036077593,0.0000049923933,0.0000065388244,0.000034882694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958836,0.0001053566,0.0012843148,0.0003604034,0.0021635846,0.00020272906],"domain_scores_gemma":[0.9896031,0.00017556663,0.0021215186,0.0006333791,0.0073229345,0.00014348769],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0016397566,0.0001811818,0.0003564312,0.0017569198,0.00009934555,0.00044949685,0.005825776,0.00008668114,0.000022578435],"category_scores_gemma":[0.00022990159,0.00014768656,0.0002504672,0.0006880499,0.0006396945,0.003717748,0.0016669581,0.00029240508,0.0000060000034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005252797,0.00070893497,0.0010084779,0.00008779481,0.00037756818,0.000023524086,0.0041714036,0.123707354,0.006989647,0.59164166,0.0011973218,0.2700338],"study_design_scores_gemma":[0.001930632,0.0006827607,0.0073287375,0.0019465801,0.000036402882,0.00015375509,0.000044300195,0.4502169,0.01854598,0.5150799,0.0033807682,0.000653282],"about_ca_topic_score_codex":0.00001239234,"about_ca_topic_score_gemma":0.000003392717,"teacher_disagreement_score":0.64850575,"about_ca_system_score_codex":0.00016161503,"about_ca_system_score_gemma":0.0017480683,"threshold_uncertainty_score":0.9995532},"labels":[],"label_agreement":null},{"id":"W2278164876","doi":"10.1142/s012905411540016x","title":"Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Word (group theory); Complement (music); Generalization; Combinatorics; Binary number; Measure (data warehouse); Similarity (geometry); Natural number; Discrete mathematics; Morse code; Arithmetic; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.01973837594558339,"score_gpt":0.2763361209495411,"score_spread":0.2565977450039577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278164876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4294693,0.000057755362,0.5652406,0.0039031256,0.0011486647,0.0000970243,0.00000933784,0.000008286225,0.000065865366],"genre_scores_gemma":[0.84158355,0.000008933899,0.15803285,0.00024549212,0.000110054876,0.0000019356785,3.5731017e-7,0.0000040723926,0.0000127370295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788076,0.000059972146,0.00046610183,0.00020558466,0.001218565,0.00016903608],"domain_scores_gemma":[0.99582267,0.0005894387,0.0007127215,0.00083524163,0.0019487463,0.00009119087],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020210156,0.00012328847,0.00019558451,0.00024762415,0.00023694328,0.00039378018,0.0058798594,0.000029230634,0.0000024642418],"category_scores_gemma":[0.00047471526,0.00007063238,0.00010712325,0.00059209624,0.0011526268,0.0015187277,0.0015648731,0.00016923435,3.7464284e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010863083,0.0013897097,0.043175463,0.00005442887,0.0008767565,0.0000536257,0.017185604,0.082442775,0.00433575,0.7222955,0.008338452,0.11876561],"study_design_scores_gemma":[0.0048481147,0.0015725004,0.23776099,0.00046643039,0.000087812514,0.0011685116,0.0005228512,0.6258518,0.0048525482,0.11875194,0.0036643445,0.00045216296],"about_ca_topic_score_codex":0.000022456967,"about_ca_topic_score_gemma":0.0000150201995,"teacher_disagreement_score":0.6035436,"about_ca_system_score_codex":0.00007399914,"about_ca_system_score_gemma":0.0007480562,"threshold_uncertainty_score":0.9994988},"labels":[],"label_agreement":null},{"id":"W2336446049","doi":"10.1142/s0129054115400067","title":"Large Aperiodic Semigroups","year":2015,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Semigroup; Mathematics; Unitary state; Special classes of semigroups; Tree (set theory); Quotient; Krohn–Rhodes theory; Discrete mathematics; State (computer science); Bicyclic semigroup; Pure mathematics; Combinatorics; Monoid; Algorithm","score_opus":0.02200527659450329,"score_gpt":0.30170178542708187,"score_spread":0.27969650883257857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336446049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10543408,0.00007857922,0.8887631,0.0014906191,0.0035357706,0.000035556208,0.0000027253004,0.000025742978,0.00063377776],"genre_scores_gemma":[0.8443097,0.00000879043,0.15505998,0.0003195798,0.00027782726,6.53802e-7,9.1006433e-7,0.0000032316634,0.000019360781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760675,0.000045078843,0.00055067,0.0001920444,0.0014102798,0.00019517702],"domain_scores_gemma":[0.9964823,0.00011183551,0.0005454384,0.00035079382,0.0023258603,0.00018376572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019599474,0.00009675832,0.00016963744,0.0006151729,0.00009147012,0.00044440164,0.004120604,0.000025234162,0.0000150461365],"category_scores_gemma":[0.00020817723,0.000082899656,0.0001012626,0.00067987764,0.0002765793,0.0027680127,0.0006005139,0.00012178188,0.000023491246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003811053,0.00071892753,0.0030373894,0.000007923307,0.00013528549,0.00010697689,0.0072082044,0.0039453576,0.0054553184,0.80758256,0.0046344385,0.16712952],"study_design_scores_gemma":[0.004299678,0.0011205977,0.018469328,0.00034781554,0.00002905582,0.0028230548,0.00049709214,0.74236894,0.014816186,0.1585864,0.055932984,0.00070889865],"about_ca_topic_score_codex":0.0000054988113,"about_ca_topic_score_gemma":0.000001361886,"teacher_disagreement_score":0.73887557,"about_ca_system_score_codex":0.00013050153,"about_ca_system_score_gemma":0.00082221883,"threshold_uncertainty_score":0.7657177},"labels":[],"label_agreement":null},{"id":"W2396714452","doi":"10.1142/s0129054105003327","title":"REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Prefix; Rewriting; Mathematics; Canonical form; Equivalence (formal languages); State (computer science); Word (group theory); Set (abstract data type); Discrete mathematics; Computer science; Algorithm; Pure mathematics; Programming language","score_opus":0.022387374634667168,"score_gpt":0.35223913773278087,"score_spread":0.3298517630981137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396714452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36871248,0.000108582026,0.6290815,0.0015124158,0.0004955128,0.000031470416,0.0000022555819,0.000011483565,0.000044317807],"genre_scores_gemma":[0.8168624,0.0000461699,0.1829482,0.000023742328,0.00010295874,6.561293e-7,5.764187e-7,0.0000021013723,0.000013188706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978691,0.000031817726,0.0005058139,0.00017683904,0.0012871833,0.00012928678],"domain_scores_gemma":[0.997576,0.0005946598,0.00036322378,0.00024031216,0.0011364922,0.00008934019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000887818,0.00006669697,0.00014855711,0.00050488603,0.000048220725,0.00018800428,0.0022232295,0.000021701959,0.000010157401],"category_scores_gemma":[0.0005277018,0.000060903698,0.000050552513,0.00069792906,0.00039777064,0.0019457572,0.00043571804,0.00010896348,0.000001540406],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041170042,0.0005221475,0.05850488,0.00003773151,0.00020661714,0.000017281674,0.0035240538,0.027810471,0.058078542,0.048784748,0.0026841664,0.7997882],"study_design_scores_gemma":[0.0018670991,0.0007589043,0.15068617,0.0005048872,0.000021763919,0.000768238,0.00007663499,0.6725761,0.16351922,0.005419069,0.0033731745,0.00042871764],"about_ca_topic_score_codex":0.000018012584,"about_ca_topic_score_gemma":0.000001911022,"teacher_disagreement_score":0.7993595,"about_ca_system_score_codex":0.00008572928,"about_ca_system_score_gemma":0.00041924167,"threshold_uncertainty_score":0.41313505},"labels":[],"label_agreement":null},{"id":"W2439381154","doi":"10.1142/s0129054112400436","title":"ABELIAN PRIMITIVE WORDS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Abelian group; Rank of an abelian group; Arithmetic of abelian varieties; Combinatorics on words; Mathematics; Word (group theory); Elementary abelian group; Context (archaeology); Free abelian group; Alphabet; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Biology; Linguistics; Philosophy","score_opus":0.016539528795581793,"score_gpt":0.30270130491401165,"score_spread":0.28616177611842986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2439381154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10858277,0.00008074846,0.8849778,0.0011722338,0.004253777,0.00003521361,0.000001645131,0.000018185274,0.0008775801],"genre_scores_gemma":[0.7786738,0.000012215771,0.22070257,0.00021323597,0.0003808136,5.829589e-7,4.2353668e-7,0.000002544067,0.000013804771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981197,0.000038316717,0.00046659078,0.00013183153,0.0010280652,0.00021546765],"domain_scores_gemma":[0.9976429,0.00016121387,0.0005284103,0.0002708819,0.0012547742,0.00014181995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064132,0.000086596316,0.00013762046,0.00060855976,0.0000968128,0.0002588137,0.0031105597,0.000021116755,0.000023009652],"category_scores_gemma":[0.00011387066,0.00007329657,0.00009728703,0.00061194436,0.00031786188,0.0040159714,0.00042232728,0.00011088217,0.00001850279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001191786,0.00042776,0.0043394505,0.000004155026,0.00009039682,0.000010580873,0.003320895,0.00057411764,0.0082048485,0.5957612,0.0005460433,0.38670862],"study_design_scores_gemma":[0.003720166,0.0012191354,0.47637102,0.000871162,0.000072644434,0.003852742,0.0004473518,0.2486142,0.12062598,0.1010597,0.041744605,0.0014012802],"about_ca_topic_score_codex":0.000004689574,"about_ca_topic_score_gemma":3.3804216e-7,"teacher_disagreement_score":0.67009103,"about_ca_system_score_codex":0.00010535192,"about_ca_system_score_gemma":0.00032756987,"threshold_uncertainty_score":0.5780245},"labels":[],"label_agreement":null},{"id":"W2480249651","doi":"10.1142/s0129054119500060","title":"Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph; Combinatorics; Running time; Vertex (graph theory); Binary logarithm; Time complexity; Graph algorithms; Mathematics; Algorithm; Path (computing); Computer science; Discrete mathematics","score_opus":0.030500637376295502,"score_gpt":0.3227517377298996,"score_spread":0.29225110035360413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480249651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03936523,0.00018090183,0.9518365,0.0012288755,0.007006009,0.00024995374,0.000027636288,0.000017511493,0.000087359695],"genre_scores_gemma":[0.41112158,0.000048422327,0.58818656,0.000095187956,0.0004908114,0.000005790179,0.000012839581,0.0000060812595,0.00003272892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970923,0.00004908579,0.00092999206,0.00047909608,0.0012396278,0.00020987517],"domain_scores_gemma":[0.9940036,0.0004375729,0.0014198639,0.00036843066,0.0036587596,0.00011178049],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015330923,0.00020666773,0.00034945065,0.001205033,0.00015003285,0.0010435433,0.0028580222,0.000076044525,0.0000046681694],"category_scores_gemma":[0.00021032184,0.00019942809,0.00021488844,0.00039116954,0.00023802911,0.0015700505,0.0015321751,0.00024168481,0.000002175489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027837785,0.00023475307,0.00048813573,0.00006129091,0.00023700895,0.000007708595,0.0010366722,0.35806367,0.002495421,0.025588932,0.00032056044,0.61143804],"study_design_scores_gemma":[0.0006755376,0.00031137164,0.005893986,0.00027872444,0.000027769458,0.00012523396,0.000014870089,0.97454894,0.0021229219,0.014703928,0.0010552708,0.00024144736],"about_ca_topic_score_codex":0.0000073357037,"about_ca_topic_score_gemma":0.000002393248,"teacher_disagreement_score":0.6164853,"about_ca_system_score_codex":0.00014133946,"about_ca_system_score_gemma":0.0011940734,"threshold_uncertainty_score":0.99999344},"labels":[],"label_agreement":null},{"id":"W2570053645","doi":"10.1142/s0129054112400448","title":"ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Decidability; Enumeration; Recursively enumerable language; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Function (biology); Sequence (biology); Computer science; Biology; Artificial intelligence","score_opus":0.023064990121982428,"score_gpt":0.27846263967602103,"score_spread":0.2553976495540386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570053645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49919805,0.00020125868,0.4994515,0.00035860934,0.0006896254,0.00003195227,5.470461e-7,0.000008560097,0.000059892718],"genre_scores_gemma":[0.8366163,0.000020981548,0.16320205,0.000050346585,0.00010180278,8.2332326e-7,1.7810576e-7,0.0000016456322,0.000005912007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854124,0.000038560323,0.00048102043,0.00009677353,0.00071821833,0.00012417565],"domain_scores_gemma":[0.9981824,0.00009410113,0.0005497794,0.00016272537,0.0009412133,0.00006976682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038834,0.000066949266,0.00013923288,0.00039985438,0.000079302954,0.00018822895,0.0012823776,0.00001680524,0.000008062646],"category_scores_gemma":[0.00012027437,0.000051793555,0.00004425035,0.00033584255,0.00037072552,0.0036700962,0.00022931708,0.000055237713,0.0000019161375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018732513,0.00056370866,0.018632201,0.00006832753,0.00016259005,0.0000048813413,0.00938771,0.0025064752,0.20326614,0.38325697,0.00017717193,0.3819551],"study_design_scores_gemma":[0.000862866,0.0004301498,0.0871254,0.0007837439,0.000027094924,0.0009542365,0.00018998371,0.5713896,0.31330156,0.023886753,0.00072279514,0.00032577786],"about_ca_topic_score_codex":0.000012003597,"about_ca_topic_score_gemma":6.957993e-7,"teacher_disagreement_score":0.5688832,"about_ca_system_score_codex":0.000043420692,"about_ca_system_score_gemma":0.0002579687,"threshold_uncertainty_score":0.2660731},"labels":[],"label_agreement":null},{"id":"W2570565098","doi":"10.1142/s0129054105003273","title":"WORDS AVOIDING $\\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Complement (music); Morse code; Word (group theory); Combinatorics; Identity (music); Term (time); Combinatorics on words; Binary number; Discrete mathematics; Pure mathematics; Arithmetic; Computer science; Physics; Geometry","score_opus":0.009880745572070696,"score_gpt":0.27315879649748337,"score_spread":0.2632780509254127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570565098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15051557,0.00016558614,0.83644724,0.010748296,0.001646429,0.000055118086,0.0000010388612,0.000017168271,0.00040354763],"genre_scores_gemma":[0.8798725,0.000058227673,0.11907877,0.00060204574,0.0003575184,9.99693e-7,2.4154363e-7,0.000003140772,0.000026568601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998053,0.000083137405,0.00053003366,0.00019137487,0.0009800162,0.00016241484],"domain_scores_gemma":[0.99777865,0.00048199153,0.00053798215,0.0003105455,0.0008050872,0.00008574913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026825564,0.000101425896,0.0001772642,0.00044700672,0.00024957032,0.0005738232,0.0031643624,0.000021522363,0.000017229224],"category_scores_gemma":[0.00020782494,0.00006900472,0.00010085581,0.00047083694,0.0009193281,0.0025582346,0.0005420473,0.00020164538,0.0000074549653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037012465,0.00010440884,0.00032996215,0.0000030147828,0.00007669744,0.000012791321,0.004455645,0.00453608,0.001564295,0.63933986,0.00046771351,0.3490725],"study_design_scores_gemma":[0.0026260451,0.00014477472,0.008331837,0.00019269637,0.000022358183,0.0012405472,0.00016532135,0.9079983,0.0036264502,0.06769151,0.007690698,0.00026942446],"about_ca_topic_score_codex":0.000009312165,"about_ca_topic_score_gemma":0.0000018116071,"teacher_disagreement_score":0.90346223,"about_ca_system_score_codex":0.00007983556,"about_ca_system_score_gemma":0.0002448783,"threshold_uncertainty_score":0.58802253},"labels":[],"label_agreement":null},{"id":"W2570765932","doi":"10.1142/s0129054111008052","title":"CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closure (psychology); Mathematics; Complement (music); Separation axiom; Axiom; Discrete mathematics; Regular language; Partition (number theory); Formal language; Abstract family of languages; Concatenation (mathematics); Topological space; Pure mathematics; Combinatorics; Computer science; Algorithm; Theoretical computer science; Second-generation programming language","score_opus":0.018727166221951738,"score_gpt":0.3057454771416453,"score_spread":0.28701831091969354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570765932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29020074,0.00006421842,0.70776373,0.00024506325,0.0005255592,0.000028061077,5.697078e-7,0.0000070927176,0.0011649905],"genre_scores_gemma":[0.80743724,0.000021108752,0.19239065,0.00008896311,0.000055507164,4.7013833e-7,1.4009642e-7,0.00000139362,0.000004543061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989042,0.000026262347,0.00035329952,0.00013094775,0.00045251707,0.0001327164],"domain_scores_gemma":[0.9989033,0.000084915,0.00028764523,0.00014624905,0.0005223436,0.000055563967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684194,0.000065502005,0.000110056004,0.00050198665,0.00005404817,0.000109800545,0.001592682,0.00001656801,0.000012820781],"category_scores_gemma":[0.00007458822,0.000052242285,0.000038086313,0.00034904003,0.0003055514,0.0026862791,0.0003142306,0.000092609356,0.0000016884201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283544,0.00010722877,0.005683525,0.000002573686,0.000016252583,0.000043231896,0.0026008957,0.00029233127,0.0012607874,0.76918054,0.000013857585,0.2207825],"study_design_scores_gemma":[0.0019947067,0.0010008595,0.50522965,0.00023702988,0.000010777868,0.0015288995,0.00033720312,0.059849154,0.023140581,0.4053552,0.0008895273,0.00042644487],"about_ca_topic_score_codex":0.000009577647,"about_ca_topic_score_gemma":0.0000054211023,"teacher_disagreement_score":0.5172365,"about_ca_system_score_codex":0.00003121253,"about_ca_system_score_gemma":0.00015091142,"threshold_uncertainty_score":0.29596257},"labels":[],"label_agreement":null},{"id":"W2577580961","doi":"10.1142/s0129054112400023","title":"ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Boolean function; Computer science; And-inverter graph; Boolean circuit; Product term; Transient (computer programming); Boolean expression; Mathematics; Theoretical computer science; Calculus (dental); Algorithm; Two-element Boolean algebra; Algebra over a field; Programming language; Medicine; Pure mathematics","score_opus":0.12915129891804625,"score_gpt":0.3521225510733017,"score_spread":0.22297125215525546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577580961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40402746,0.000038602182,0.58979505,0.002729405,0.002971135,0.00016558699,0.000011930615,0.0000042778233,0.0002565634],"genre_scores_gemma":[0.9595082,0.0000035594494,0.040295552,0.0000707013,0.000112025875,0.0000022441095,7.957451e-7,0.0000032025973,0.0000037460254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953925,0.0002923447,0.0010199016,0.00018202669,0.002937044,0.00017618944],"domain_scores_gemma":[0.99108267,0.0007714585,0.0013716797,0.000719115,0.005978332,0.00007673817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046785716,0.00011784633,0.00024976418,0.0004371788,0.00017293397,0.000054379267,0.0033420206,0.000028549757,0.000046635825],"category_scores_gemma":[0.0007760449,0.00007373867,0.00026810734,0.0010761588,0.0017473862,0.0009112951,0.00047367456,0.0001837517,0.000001914795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005746668,0.002967491,0.004242052,0.00002654748,0.0002775398,7.311705e-7,0.0053347885,0.13354106,0.017242199,0.6977024,0.00072700484,0.13788068],"study_design_scores_gemma":[0.0007971698,0.0004323221,0.42616758,0.00024228217,0.00008325328,0.0001067678,0.00012741872,0.4981849,0.017720226,0.055763464,0.00022475484,0.00014986767],"about_ca_topic_score_codex":0.000031156746,"about_ca_topic_score_gemma":0.00000901519,"teacher_disagreement_score":0.641939,"about_ca_system_score_codex":0.00015289677,"about_ca_system_score_gemma":0.000739845,"threshold_uncertainty_score":0.64383173},"labels":[],"label_agreement":null},{"id":"W2582188091","doi":"10.1142/s0129054116500349","title":"State Complexity of Insertion","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.032465811927913014,"score_gpt":0.3026928864660438,"score_spread":0.2702270745381308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582188091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27587596,0.000012821432,0.72112596,0.0016575676,0.0011802604,0.00002577953,0.000004342734,0.0000097718685,0.00010752409],"genre_scores_gemma":[0.85756314,0.000017761537,0.14226393,0.00006919315,0.00007202513,3.4130113e-7,2.5858506e-7,0.0000020666268,0.000011286086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809605,0.00004398945,0.00062620157,0.00014992457,0.0009613325,0.00012247605],"domain_scores_gemma":[0.99665624,0.00017945979,0.0008197125,0.00028750606,0.0019888089,0.00006827078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010419165,0.00007336555,0.00015783716,0.0005425964,0.0000552492,0.00010232406,0.002799925,0.000014557076,0.000020530795],"category_scores_gemma":[0.00012321067,0.000050083516,0.00009315049,0.0004366815,0.0007675724,0.0022280293,0.00035547573,0.000051437688,0.0000062613144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031680574,0.00024965606,0.0019379643,0.0000063217303,0.00006405297,0.000008585762,0.00055665104,0.0005069138,0.10706078,0.39841893,0.00017336043,0.4909851],"study_design_scores_gemma":[0.0020941284,0.0007560176,0.18630467,0.0006410636,0.000013168255,0.0004425851,0.00002283148,0.0828098,0.23492533,0.48993456,0.0017232299,0.00033261662],"about_ca_topic_score_codex":0.000010964355,"about_ca_topic_score_gemma":0.0000019336446,"teacher_disagreement_score":0.58168715,"about_ca_system_score_codex":0.000081942664,"about_ca_system_score_gemma":0.00035921158,"threshold_uncertainty_score":0.5203004},"labels":[],"label_agreement":null},{"id":"W2590512199","doi":"10.1142/s0129054116500386","title":"Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties","year":2016,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Enumeration; Abelian group; Representation (politics); Mathematics; Word (group theory); Combinatorics; Discrete mathematics; Class (philosophy); State (computer science); Function (biology); Algorithm; Computer science; Artificial intelligence","score_opus":0.022275286274606947,"score_gpt":0.2935118611464839,"score_spread":0.27123657487187697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590512199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15172972,0.00008444921,0.8442184,0.0021799626,0.0016546142,0.00009609648,0.0000030415372,0.000018773433,0.0000149708085],"genre_scores_gemma":[0.6707301,0.00003397508,0.32897007,0.00009068251,0.00015100221,0.000003243499,3.3470963e-7,0.0000031075792,0.000017492266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828553,0.000025636033,0.0005725693,0.00021641767,0.00075119693,0.0001486283],"domain_scores_gemma":[0.9974959,0.00036749785,0.00048092514,0.00023350299,0.0013399016,0.000082279774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098777,0.0000990374,0.0001626516,0.00051893113,0.00015139743,0.00040904013,0.0016632092,0.000025340281,0.000008408732],"category_scores_gemma":[0.00021866272,0.0000632543,0.00007284769,0.0002888722,0.00028105418,0.0027775532,0.00027032712,0.000044981785,0.0000029677426],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013590594,0.000055365756,0.00010644595,0.0000043998575,0.000024998553,0.0000018848108,0.00044480275,0.00010867367,0.011579376,0.02576748,0.00013883041,0.96175414],"study_design_scores_gemma":[0.0029354517,0.0006852758,0.011353327,0.0011527657,0.000020957954,0.00053043955,0.000050446866,0.8360527,0.037357427,0.10609108,0.0034064045,0.0003636924],"about_ca_topic_score_codex":0.000004735481,"about_ca_topic_score_gemma":0.000001782272,"teacher_disagreement_score":0.96139044,"about_ca_system_score_codex":0.00007934516,"about_ca_system_score_gemma":0.00029155912,"threshold_uncertainty_score":0.39443836},"labels":[],"label_agreement":null},{"id":"W2592757846","doi":"10.1142/s0129054113400182","title":"AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Shuffling; Mathematics; Combinatorics; Combinatorics on words; Discrete mathematics; Function (biology); Algorithm; Word (group theory)","score_opus":0.011031482350575644,"score_gpt":0.2717489781803248,"score_spread":0.2607174958297491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592757846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4710107,0.000016878666,0.5244253,0.0015644033,0.002185553,0.00007892604,4.6732575e-7,0.000021182386,0.00069652667],"genre_scores_gemma":[0.92936134,0.000006489334,0.07028926,0.0002392828,0.00008645948,0.0000024917358,3.0723882e-7,0.0000036859,0.000010689038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997855,0.000059447666,0.00062581216,0.00019139898,0.0010845342,0.00018382004],"domain_scores_gemma":[0.9977524,0.00033524985,0.0005263994,0.0003330774,0.0009707537,0.00008208482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407292,0.00010297259,0.00017545086,0.0010020629,0.00007365808,0.000497013,0.0035413571,0.000025401916,0.000045159784],"category_scores_gemma":[0.00019669726,0.00008560594,0.000077688645,0.00085421867,0.00025018997,0.0025174916,0.00035454688,0.00016478474,0.000029280367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034236398,0.00029634856,0.001271389,0.0000052482415,0.00002103499,0.000016142692,0.00094530254,0.0020470137,0.0012552232,0.6546852,0.00017093927,0.33928275],"study_design_scores_gemma":[0.0006015841,0.00024782072,0.040676486,0.0002509,0.000002583118,0.00012155809,0.000045976238,0.72048116,0.002330745,0.23495963,0.0001339506,0.00014761202],"about_ca_topic_score_codex":0.000021207954,"about_ca_topic_score_gemma":0.000001117683,"teacher_disagreement_score":0.71843415,"about_ca_system_score_codex":0.00017673065,"about_ca_system_score_gemma":0.00033763176,"threshold_uncertainty_score":0.65807813},"labels":[],"label_agreement":null},{"id":"W2603214747","doi":"10.1142/s012905411750006x","title":"Deterministic Rendezvous with Detection Using Beeps","year":2017,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Computer science; Node (physics); Mobile agent; Computer network; Real-time computing; Distributed computing","score_opus":0.04234109411602974,"score_gpt":0.35111037560664526,"score_spread":0.30876928149061555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603214747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06756075,0.0000056050767,0.92991346,0.0006652826,0.001446726,0.00005317099,9.64966e-7,0.000011161935,0.00034287327],"genre_scores_gemma":[0.70450866,0.0000060771163,0.29532808,0.000036397465,0.00010633286,4.784725e-7,1.6479939e-7,0.0000027185913,0.000011102572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981564,0.000029765279,0.00040415672,0.00018529907,0.0010751911,0.00014913673],"domain_scores_gemma":[0.99589175,0.000064463,0.0009665264,0.00046470857,0.0025100242,0.00010252727],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007556087,0.00008319491,0.00013248938,0.00053024245,0.0004848919,0.0012015746,0.0035834764,0.000020990208,0.0000070404626],"category_scores_gemma":[0.00018847393,0.00006876129,0.00005710902,0.0002408555,0.00052415003,0.0033113568,0.000390339,0.00011723834,0.0000028339543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010132282,0.00045376166,0.00453642,0.00001923603,0.00020323234,0.00015982526,0.0017144142,0.15632674,0.019603148,0.050821465,0.000039085764,0.7660214],"study_design_scores_gemma":[0.0006600825,0.00035941615,0.012466948,0.00011169624,0.000009091161,0.00074906833,0.000009234369,0.97650295,0.005841513,0.0028021075,0.00036070342,0.00012715602],"about_ca_topic_score_codex":0.000020284904,"about_ca_topic_score_gemma":0.000010174713,"teacher_disagreement_score":0.82017624,"about_ca_system_score_codex":0.00010986734,"about_ca_system_score_gemma":0.0006060476,"threshold_uncertainty_score":0.99983525},"labels":[],"label_agreement":null},{"id":"W2605900390","doi":"10.1142/s0129054118420030","title":"Counting, Generating, Analyzing and Sampling Tree Alignments","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Tree (set theory); Mathematics; Pairwise comparison; Probabilistic logic; Combinatorics; Equivalence (formal languages); Gibbs sampling; Theoretical computer science; Computer science; Algorithm; Discrete mathematics; Statistics; Bayesian probability","score_opus":0.020921866871416166,"score_gpt":0.31344064021825496,"score_spread":0.2925187733468388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605900390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5407411,0.000044690816,0.45827726,0.00007496515,0.0006548018,0.00001937255,0.0000011877021,0.0000010284269,0.00018561316],"genre_scores_gemma":[0.8330715,0.00003349779,0.16603778,0.000086622975,0.0007408499,4.167056e-7,0.0000013976858,0.0000028259924,0.000025134817],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991969,0.000017524271,0.00026063994,0.00011939505,0.00032547186,0.000080069985],"domain_scores_gemma":[0.99834186,0.00001578632,0.00030793095,0.00009727511,0.0011952987,0.00004186412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059003,0.00005332242,0.000071056296,0.00013447995,0.00010180387,0.00011169868,0.00045154986,0.000020652338,0.000014359634],"category_scores_gemma":[0.00014590315,0.000047939124,0.00003633177,0.000075936565,0.00023928664,0.00003578329,0.0001278372,0.000026920878,0.0000022518452],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015103287,0.000021408034,0.0016035927,0.000001401554,0.000040553146,6.005704e-7,0.000055453387,0.00009570451,0.9463148,0.0005227872,0.00008234639,0.051246237],"study_design_scores_gemma":[0.00054507866,0.00074355473,0.006153169,0.00012065587,0.000019065807,0.00016186143,0.00002071174,0.008656355,0.968732,0.0011711719,0.013500852,0.00017551126],"about_ca_topic_score_codex":0.000004210726,"about_ca_topic_score_gemma":0.0000029755113,"teacher_disagreement_score":0.29233038,"about_ca_system_score_codex":0.000013915399,"about_ca_system_score_gemma":0.00012293088,"threshold_uncertainty_score":0.19549008},"labels":[],"label_agreement":null},{"id":"W2616617106","doi":"10.1142/s0129054117500137","title":"Worst Case Branching and Other Measures of Nondeterminism","year":2017,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; TRACE (psycholinguistics); Mathematics; Computation; Upper and lower bounds; Nondeterministic finite automaton; Tree (set theory); Bounded function; Discrete mathematics; Branching (polymer chemistry); Automaton; Combinatorics; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.04300114367963864,"score_gpt":0.3331492841058865,"score_spread":0.29014814042624787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616617106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32089856,0.000034050936,0.67711127,0.00050907384,0.0011418028,0.00002572673,0.0000025612362,0.000005177873,0.0002717524],"genre_scores_gemma":[0.8612262,0.000006392598,0.13854977,0.00008642252,0.00012292458,2.9720192e-7,5.40752e-8,0.0000025524942,0.000005367361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986098,0.000024342964,0.0004440435,0.00015417571,0.0006629068,0.00010472866],"domain_scores_gemma":[0.99757224,0.00013858022,0.0009782676,0.00042452218,0.00081643136,0.000069950496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012010952,0.00007674192,0.0001598174,0.0003741667,0.0002572821,0.0005745097,0.0027332678,0.000019591138,0.000004568964],"category_scores_gemma":[0.00017305682,0.00006459718,0.000069699905,0.00010479904,0.000635166,0.0021260572,0.00051448564,0.00008521849,9.613385e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018658537,0.00016466845,0.004267951,0.00001247905,0.00009708275,0.00028276263,0.0029164962,0.00041019326,0.011598787,0.22364691,0.00004817061,0.7565358],"study_design_scores_gemma":[0.003905788,0.00094222766,0.099396914,0.0013516222,0.000061579034,0.033499915,0.00021847137,0.6107164,0.054807413,0.18968846,0.004594459,0.0008167749],"about_ca_topic_score_codex":0.000043266085,"about_ca_topic_score_gemma":0.0000075027233,"teacher_disagreement_score":0.75571907,"about_ca_system_score_codex":0.000024656974,"about_ca_system_score_gemma":0.00019711611,"threshold_uncertainty_score":0.55400103},"labels":[],"label_agreement":null},{"id":"W2754500190","doi":"10.1142/s0129054114400048","title":"HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hypergraph; Automaton; Mobile automaton; Computer science; Expressive power; Regular language; Büchi automaton; Theoretical computer science; Automata theory; Discrete mathematics; Deterministic automaton; Mathematics","score_opus":0.011402478454349137,"score_gpt":0.2961747853438949,"score_spread":0.28477230688954575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754500190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43271717,0.000005230557,0.5664541,0.00035003468,0.00034133202,0.00002946573,0.000002250634,0.0000035799549,0.000096799326],"genre_scores_gemma":[0.8728822,0.000007796872,0.12652512,0.00024883225,0.0003222122,0.0000011745861,0.000004610159,0.0000029723174,0.0000051036864],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990901,0.00002547144,0.0003132262,0.00015018883,0.0003047102,0.00011633828],"domain_scores_gemma":[0.99849665,0.000063486965,0.0002389599,0.00012301804,0.0010210052,0.000056873178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074489496,0.00006851946,0.00010452249,0.00011842293,0.00006677385,0.00007605236,0.0008450301,0.00003567358,0.000001821685],"category_scores_gemma":[0.00017440977,0.00005206731,0.00011577113,0.000085321444,0.00024313433,0.000022870163,0.00015942498,0.00004558501,7.1684934e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025949627,0.0007531214,0.0036724184,0.00002042545,0.0002549617,0.0000024721912,0.0002274465,0.02667224,0.6000915,0.22228414,0.00073274656,0.14502901],"study_design_scores_gemma":[0.0007152097,0.00067598576,0.0025093295,0.000029066186,0.000013479477,0.00006306769,0.000004181803,0.95393836,0.029295761,0.01134641,0.0012995318,0.00010960604],"about_ca_topic_score_codex":4.977906e-7,"about_ca_topic_score_gemma":4.4271397e-7,"teacher_disagreement_score":0.9272661,"about_ca_system_score_codex":0.000014922566,"about_ca_system_score_gemma":0.0001449003,"threshold_uncertainty_score":0.21232432},"labels":[],"label_agreement":null},{"id":"W2786516640","doi":"10.1142/s0129054113400133","title":"IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Regular language; Combinatorics; Concatenation (mathematics); State (computer science); Quotient; Alphabet; Permutation (music); Discrete mathematics; Integer (computer science); Binary logarithm; Automaton; Algorithm; Computer science; Physics","score_opus":0.020012000271576177,"score_gpt":0.32110049861142975,"score_spread":0.30108849833985357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786516640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42258662,0.000034314977,0.573899,0.002458834,0.0005802387,0.00005927449,0.0000018452997,0.0000068379086,0.0003730448],"genre_scores_gemma":[0.83891344,0.000009175461,0.16081744,0.00016009403,0.00008009828,7.7537965e-7,6.601872e-7,0.0000021984001,0.000016112706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814874,0.000049658713,0.00056480535,0.00014591604,0.00094913517,0.0001417357],"domain_scores_gemma":[0.997526,0.00016989089,0.0003758504,0.0002792968,0.0015871804,0.0000617874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009455902,0.000070507456,0.00016689491,0.00063153706,0.00003926563,0.00018815146,0.0030560037,0.000019027213,0.00007609857],"category_scores_gemma":[0.000079940684,0.00006078355,0.00006137758,0.000758235,0.00037044505,0.0023138553,0.0004061298,0.00009921287,0.000010360782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017541079,0.0006864331,0.006036578,0.000026310901,0.00009491568,0.000056389636,0.0035919785,0.010686307,0.16202486,0.506346,0.0022303383,0.3082024],"study_design_scores_gemma":[0.0014644129,0.00042180863,0.24201359,0.000346461,0.000006511012,0.00051328185,0.00028942022,0.633272,0.06449486,0.05578048,0.0010967605,0.00030039743],"about_ca_topic_score_codex":0.00011082703,"about_ca_topic_score_gemma":0.000002991134,"teacher_disagreement_score":0.6225857,"about_ca_system_score_codex":0.00006472368,"about_ca_system_score_gemma":0.00029488484,"threshold_uncertainty_score":0.5678866},"labels":[],"label_agreement":null},{"id":"W2797999682","doi":"10.1142/s0129054118400099","title":"State Complexity of Neighbourhoods and Approximate Pattern Matching","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Neighbourhood (mathematics); Mathematics; Combinatorics; Upper and lower bounds; Deterministic finite automaton; State (computer science); Nondeterministic algorithm; String (physics); Discrete mathematics; Finite-state machine; Set (abstract data type); Computer science; Algorithm","score_opus":0.026187599199695585,"score_gpt":0.303750500253681,"score_spread":0.2775629010539854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797999682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3292669,0.000015440079,0.66912466,0.0005234512,0.00086578086,0.000028262471,0.000004126139,0.000008990116,0.00016240968],"genre_scores_gemma":[0.8246814,0.000010624426,0.17503724,0.00013767205,0.00012626202,2.8738734e-7,4.3281833e-7,0.0000028100674,0.0000032871865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825495,0.000043701883,0.0005821967,0.00018339956,0.0007892393,0.0001465346],"domain_scores_gemma":[0.99730337,0.00011701125,0.00075299205,0.00026273087,0.0014823723,0.00008152422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011224555,0.00009128337,0.0001880898,0.00045646337,0.00010953481,0.00026371132,0.0022194537,0.00001560261,0.000017460257],"category_scores_gemma":[0.000043545435,0.00007819444,0.00006199276,0.00036357864,0.0011945682,0.001667572,0.0006040419,0.00008920567,0.0000024911922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034569235,0.00035566228,0.0044153854,0.00003300895,0.00015056746,0.000018797115,0.006764596,0.0010891557,0.020262009,0.31869805,0.000106727704,0.64807147],"study_design_scores_gemma":[0.00089279993,0.0005460739,0.07168898,0.00029694638,0.000011088697,0.00052018807,0.00006613698,0.59078616,0.02884301,0.30592543,0.00019180383,0.00023139229],"about_ca_topic_score_codex":0.000037950147,"about_ca_topic_score_gemma":0.000004739445,"teacher_disagreement_score":0.6478401,"about_ca_system_score_codex":0.000038627823,"about_ca_system_score_gemma":0.00020481258,"threshold_uncertainty_score":0.44014364},"labels":[],"label_agreement":null},{"id":"W2798699651","doi":"10.1142/s0129054120410014","title":"Additive Number Theory via Approximation by Regular Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Base (topology); Formal language; Regular language; Number theory; Discrete mathematics; Automaton; Representation (politics); Combinatorics; Computer science; Theoretical computer science; Algorithm","score_opus":0.008711594732859467,"score_gpt":0.27563610870373884,"score_spread":0.26692451397087935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798699651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010087765,0.00003807862,0.9853322,0.0031169748,0.00060917286,0.000051850177,0.00003016389,0.00003098261,0.0007028402],"genre_scores_gemma":[0.79633117,0.000010707399,0.20246838,0.00086929067,0.00028062725,0.0000016551814,0.00001288232,0.0000047176104,0.000020569092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816644,0.00007726128,0.00045250877,0.00021076262,0.00096007047,0.00013297485],"domain_scores_gemma":[0.99770993,0.00026769502,0.00058119645,0.0002066967,0.0011191756,0.00011531691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077487057,0.000097849224,0.0001536581,0.00017591377,0.000088626315,0.00028819763,0.0027022099,0.00002531869,0.00020594904],"category_scores_gemma":[0.00022430837,0.00008545482,0.00009425154,0.00052273844,0.000304056,0.002275766,0.0003301242,0.00011958368,0.00003305873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004024476,0.0002274015,0.00013982679,0.000009521921,0.00014000903,0.00003257778,0.0034477673,0.00073311466,0.020492557,0.35824108,0.01654659,0.5999493],"study_design_scores_gemma":[0.0018858996,0.00062190555,0.003486561,0.0002989977,0.000038624443,0.00089206925,0.00042536302,0.68654567,0.11255618,0.16236015,0.030197788,0.00069079734],"about_ca_topic_score_codex":0.0000026901964,"about_ca_topic_score_gemma":1.3804548e-7,"teacher_disagreement_score":0.78624344,"about_ca_system_score_codex":0.00006010813,"about_ca_system_score_gemma":0.0002071676,"threshold_uncertainty_score":0.5021423},"labels":[],"label_agreement":null},{"id":"W2802228513","doi":"10.1142/s0129054118420017","title":"Rigidity and Substitutive Dendric Words","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Aperiodic graph; Rigidity (electromagnetism); Algebraic number; Word (group theory); Extension (predicate logic); Discrete mathematics; Class (philosophy); Graph; Computer science; Artificial intelligence","score_opus":0.014958775711966481,"score_gpt":0.29957644344810586,"score_spread":0.2846176677361394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802228513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26092732,0.000032414722,0.7357432,0.00063597364,0.0021692358,0.000024096616,0.0000012191813,0.000011664929,0.00045481618],"genre_scores_gemma":[0.82897484,0.00001528765,0.17053787,0.00013467918,0.00032591922,3.2468193e-7,2.0936311e-7,0.0000016338503,0.000009194607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985679,0.000030365289,0.00036386083,0.0001790128,0.000730482,0.00012838272],"domain_scores_gemma":[0.9975157,0.0001395505,0.00039305424,0.00022161764,0.0016422061,0.00008791511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069304,0.00007546583,0.00012193093,0.00049413403,0.00014600718,0.00034556,0.002229369,0.000018357643,0.000017039029],"category_scores_gemma":[0.00011278465,0.00006367622,0.00005001445,0.0005417106,0.00096593855,0.002156683,0.00043505718,0.00008352398,0.000008422018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022670902,0.00019317873,0.0029106122,0.000004308973,0.00008346934,0.000029035387,0.0024737234,0.0001819679,0.005967417,0.6520903,0.0004726304,0.33557066],"study_design_scores_gemma":[0.002152795,0.0013968601,0.21332052,0.0004285699,0.000035217974,0.0028497272,0.00012175866,0.46164203,0.059533197,0.24685372,0.011015512,0.0006500726],"about_ca_topic_score_codex":0.000008452205,"about_ca_topic_score_gemma":0.000002700599,"teacher_disagreement_score":0.5680475,"about_ca_system_score_codex":0.00006326645,"about_ca_system_score_gemma":0.00033721284,"threshold_uncertainty_score":0.4142759},"labels":[],"label_agreement":null},{"id":"W2802872846","doi":"10.1142/s0129054120420010","title":"Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Regular language; Regular expression; Invariant (physics); Automaton; Alphabet; String (physics); Prefix; Decision problem; Discrete mathematics; Formal language; Mathematics; Graph; Predicate (mathematical logic); Word (group theory); Decidability; Computer science; Theoretical computer science; Algorithm; Programming language","score_opus":0.016306984253055712,"score_gpt":0.26942994187874125,"score_spread":0.25312295762568554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802872846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2710294,0.00010763445,0.7196356,0.008594756,0.00051180937,0.00004382711,0.0000043608975,0.000016667309,0.000055937544],"genre_scores_gemma":[0.8248911,0.00005509476,0.17422363,0.00070037995,0.00012093993,6.258732e-7,4.538308e-7,0.0000033777899,0.000004423232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983421,0.00004145756,0.0004117152,0.00023912147,0.00083530036,0.00013028781],"domain_scores_gemma":[0.99850565,0.0001747237,0.0003161676,0.00017837246,0.000643495,0.0001815683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066914916,0.000097098186,0.00016818775,0.00025711575,0.0001223739,0.00039031068,0.0015106008,0.00002425046,0.000014640697],"category_scores_gemma":[0.00012916714,0.00008198377,0.000051724513,0.00036543884,0.00036396197,0.001978613,0.00038113713,0.00010764572,0.0000012782849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006374723,0.00024155782,0.001940042,0.000030325056,0.0002015228,0.0000903145,0.0064986576,0.0015119348,0.19580865,0.62452984,0.0017825376,0.16730085],"study_design_scores_gemma":[0.0050798375,0.001260282,0.091423765,0.00069607445,0.00007270069,0.0011424484,0.0002204968,0.7813693,0.04520326,0.05381927,0.018875536,0.00083698786],"about_ca_topic_score_codex":0.0000067535902,"about_ca_topic_score_gemma":6.7506295e-7,"teacher_disagreement_score":0.7798574,"about_ca_system_score_codex":0.00003216623,"about_ca_system_score_gemma":0.00025634325,"threshold_uncertainty_score":0.37637746},"labels":[],"label_agreement":null},{"id":"W2805215296","doi":"10.1142/s0129054119500102","title":"Tight Bounds for Restricted Grid Scheduling","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Villum Fonden; Velux Fonden; Natur og Univers, Det Frie Forskningsråd","keywords":"Computer science; Grid; Scheduling (production processes); Parallel computing; Distributed computing; Mathematics; Mathematical optimization; Geometry","score_opus":0.021411712199889535,"score_gpt":0.32111725181519885,"score_spread":0.2997055396153093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805215296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028208265,0.00002130067,0.96415263,0.0025927797,0.0043848,0.00014440395,0.00000337977,0.000018136727,0.0004743115],"genre_scores_gemma":[0.44285527,0.000016417534,0.55668795,0.00015502033,0.00021570982,0.000001701217,0.0000023767936,0.0000033939473,0.00006213728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979645,0.000029426737,0.0005660776,0.00020831166,0.0010513568,0.00018030024],"domain_scores_gemma":[0.9951502,0.00021874307,0.00053188734,0.00027966427,0.0037178926,0.0001015888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009004794,0.000082772014,0.0001532883,0.00080618955,0.000116845724,0.0005547534,0.002963441,0.00002679444,0.000026887748],"category_scores_gemma":[0.00018907647,0.000073602954,0.00010911283,0.0007869072,0.00016678387,0.0024202229,0.00028252706,0.00011429942,0.000014329817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007936201,0.00050407357,0.003497326,0.000033549888,0.00018721638,0.000010171295,0.0014135014,0.2587599,0.01813031,0.6063657,0.0017476138,0.1092713],"study_design_scores_gemma":[0.0011113908,0.00038295402,0.0036368936,0.00010113719,0.0000047320896,0.00008817467,0.000012188061,0.97333324,0.0031127096,0.007807722,0.0102700405,0.00013884647],"about_ca_topic_score_codex":0.0000034453599,"about_ca_topic_score_gemma":6.27686e-7,"teacher_disagreement_score":0.7145733,"about_ca_system_score_codex":0.0001039819,"about_ca_system_score_gemma":0.00086542405,"threshold_uncertainty_score":0.550686},"labels":[],"label_agreement":null},{"id":"W2888233883","doi":"10.1142/s012905411842008x","title":"Operations on Unambiguous Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Concatenation (mathematics); Mathematics; Combinatorics; Nondeterministic finite automaton; Quotient; Closure (psychology); Discrete mathematics; String (physics); Regular language; Deterministic finite automaton; Upper and lower bounds; Alphabet; Finite-state machine; Automaton; Computer science; Automata theory; Algorithm","score_opus":0.017999668340575658,"score_gpt":0.30974991188201595,"score_spread":0.2917502435414403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888233883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08562258,0.000009216716,0.9067809,0.0025809444,0.003905834,0.00004632562,0.000004113044,0.000035959358,0.0010141213],"genre_scores_gemma":[0.8119062,0.000007897255,0.18705566,0.00054479926,0.0004501743,8.613443e-7,9.654206e-7,0.0000035663754,0.00002983349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978902,0.00004466472,0.00054980925,0.0002261191,0.0011210256,0.0001681911],"domain_scores_gemma":[0.9966116,0.0001912125,0.0003265667,0.0004697745,0.0023018622,0.0000990043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071674,0.00010392777,0.00014774573,0.000775533,0.00022235472,0.0005406014,0.0039917254,0.00002515508,0.000037702193],"category_scores_gemma":[0.00023512622,0.00008812381,0.00009115908,0.0007106008,0.0005789047,0.0020335254,0.000406926,0.000114785435,0.00006317549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028399578,0.00053461804,0.00019633994,0.0000033589426,0.000089649206,0.000032184667,0.0013849059,0.015884172,0.006731672,0.65399504,0.0011258344,0.31999385],"study_design_scores_gemma":[0.00077788136,0.0009937957,0.0092843445,0.00016796691,0.000008171871,0.0003093744,0.000016551152,0.94522434,0.019394426,0.019924788,0.00369216,0.00020619828],"about_ca_topic_score_codex":0.000011047105,"about_ca_topic_score_gemma":0.0000027762264,"teacher_disagreement_score":0.9293402,"about_ca_system_score_codex":0.000094323674,"about_ca_system_score_gemma":0.00052272505,"threshold_uncertainty_score":0.74176854},"labels":[],"label_agreement":null},{"id":"W2890948056","doi":"10.1142/s0129054119500308","title":"Cobham’s Theorem and Automaticity","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada; Université de Liège","keywords":"Aperiodic graph; Automaticity; Prefix; Sequence (biology); Mathematics; Discrete mathematics; Combinatorics; Philosophy; Linguistics","score_opus":0.016367887227190753,"score_gpt":0.29745463307549835,"score_spread":0.2810867458483076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890948056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1228172,0.00012843066,0.8689256,0.0017312067,0.005791266,0.000107611755,0.000008778373,0.00003154925,0.00045835765],"genre_scores_gemma":[0.7322463,0.000054484433,0.26728407,0.00017718505,0.00021844156,0.0000010757338,0.0000016321354,0.0000051392058,0.000011690413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971223,0.000081845224,0.0008360358,0.00037004595,0.0014037247,0.00018603724],"domain_scores_gemma":[0.9954352,0.00035634675,0.0014202024,0.0006288274,0.0020453907,0.00011403557],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0019696774,0.00018900711,0.00037312502,0.00087702996,0.00009034192,0.00091817114,0.005651017,0.00007886686,0.000014936367],"category_scores_gemma":[0.00017493367,0.00016187484,0.00016038932,0.00031994926,0.00060551544,0.001492188,0.003114048,0.00037004714,0.000008442572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020321351,0.0002942566,0.0012836185,0.00008262682,0.00027682225,0.000035652887,0.002426191,0.017803868,0.0014735505,0.7369327,0.0007281118,0.23864229],"study_design_scores_gemma":[0.00048230085,0.00015774614,0.01427389,0.0005939709,0.0000216393,0.00041039925,0.000021637683,0.7745961,0.0019611914,0.20659097,0.0006200384,0.00027014012],"about_ca_topic_score_codex":0.000012632989,"about_ca_topic_score_gemma":8.272724e-7,"teacher_disagreement_score":0.75679225,"about_ca_system_score_codex":0.00013799556,"about_ca_system_score_gemma":0.0011201665,"threshold_uncertainty_score":0.99972886},"labels":[],"label_agreement":null},{"id":"W2950107561","doi":"10.1142/s0129054118400051","title":"On the Density of Context-Free and Counter Languages","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of British Columbia","funders":"","keywords":"Undecidable problem; Deterministic pushdown automaton; Context-free language; Decidability; Mathematics; Regular language; Pushdown automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Word (group theory); Pumping lemma for regular languages; Combinatorics; Bounded function; Automaton; Nondeterministic finite automaton; Computer science; Finite-state machine; Automata theory; Quantum finite automata; Algorithm; Theoretical computer science; Rule-based machine translation; Programming language","score_opus":0.011998211497109624,"score_gpt":0.2856617002251832,"score_spread":0.2736634887280736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950107561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5107301,0.000028159035,0.48531145,0.0028370584,0.00075733,0.00002921082,0.0000024797694,0.0000055040614,0.00029873085],"genre_scores_gemma":[0.97276914,0.000007729574,0.02645699,0.0006117483,0.0001427303,2.801745e-7,1.3366882e-7,0.0000016733633,0.0000095918795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876726,0.00003715814,0.0003090105,0.00011886025,0.000684272,0.00008343224],"domain_scores_gemma":[0.9973803,0.0004040639,0.00040433725,0.00034840257,0.001424747,0.000038112645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010245937,0.000060702776,0.000109576176,0.00023718497,0.00009555204,0.00016712004,0.0027058523,0.000013921108,0.000017574137],"category_scores_gemma":[0.0002721385,0.00003956069,0.000047492525,0.00023155747,0.0008714819,0.00070656376,0.0004662006,0.0000719804,0.0000034121304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023580205,0.00009781341,0.0015337243,0.0000029101477,0.000051740073,0.000006689732,0.001426017,0.00004976435,0.004239843,0.9001661,0.0014088029,0.09099301],"study_design_scores_gemma":[0.0025216916,0.002252145,0.20816259,0.000829689,0.000034605633,0.0011727376,0.00046505925,0.2868055,0.1276774,0.3661542,0.0034546051,0.00046976822],"about_ca_topic_score_codex":0.000014236184,"about_ca_topic_score_gemma":0.0000052376186,"teacher_disagreement_score":0.5340119,"about_ca_system_score_codex":0.000027361919,"about_ca_system_score_gemma":0.00014183727,"threshold_uncertainty_score":0.5028192},"labels":[],"label_agreement":null},{"id":"W2950450215","doi":"10.1142/s0129054121500209","title":"Search on a Line by Byzantine Robots","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"National Science Foundation","keywords":"Robot; Line (geometry); Computer science; Algorithm; Fault tolerance; Mobile robot; Distributed computing; Artificial intelligence; Mathematics; Geometry","score_opus":0.050519827703159915,"score_gpt":0.3664393369516543,"score_spread":0.3159195092484944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950450215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011375961,0.00010523796,0.96963847,0.014025494,0.004239809,0.00012997627,0.000013037913,0.000024914581,0.000447094],"genre_scores_gemma":[0.5210837,0.0002938765,0.47717953,0.0010356025,0.00027713337,0.0000029988214,0.000025854824,0.000010479443,0.00009083062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952184,0.00013339354,0.0009907106,0.0005041111,0.0028841202,0.00026924233],"domain_scores_gemma":[0.99136305,0.00021699833,0.0008898349,0.0006715733,0.0066521675,0.00020637401],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018421299,0.00020424527,0.00035798937,0.0011974231,0.00013699835,0.0015550769,0.006376937,0.00007849989,0.00005102158],"category_scores_gemma":[0.00024240106,0.00018935776,0.00022049526,0.00086537976,0.00038747373,0.0013923474,0.0025320186,0.0007000273,0.000009555809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025388115,0.0009673322,0.00018480809,0.00002705758,0.00019581337,0.00006449849,0.0010033896,0.8733783,0.0028780042,0.021314003,0.0045496635,0.09541177],"study_design_scores_gemma":[0.0007954487,0.0004410817,0.00043885477,0.0006486674,0.000008890485,0.00015458507,0.000016498509,0.98004925,0.013122445,0.0012558051,0.0027898063,0.0002786556],"about_ca_topic_score_codex":0.000020566138,"about_ca_topic_score_gemma":0.0000015576891,"teacher_disagreement_score":0.50970775,"about_ca_system_score_codex":0.00015557598,"about_ca_system_score_gemma":0.0022396608,"threshold_uncertainty_score":0.9994814},"labels":[],"label_agreement":null},{"id":"W2950888016","doi":"10.1142/s012905412050001x","title":"Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS","year":2020,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Secure multi-party computation; Computation; Computer network; Algorithm","score_opus":0.0368566705093553,"score_gpt":0.33961078080682344,"score_spread":0.3027541102974681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950888016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029805742,0.0001571268,0.9579253,0.0044822134,0.0070142974,0.00026813734,0.00012476597,0.00007841531,0.00014398666],"genre_scores_gemma":[0.487817,0.000055805995,0.5113705,0.0002513313,0.00046327786,0.0000047074345,0.000027535649,0.0000087044455,0.0000011693894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943525,0.00015399724,0.0015663264,0.00081180315,0.0027563348,0.0003590386],"domain_scores_gemma":[0.99120647,0.00026287316,0.0021821395,0.00088217127,0.00510814,0.00035822214],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014052369,0.00039632194,0.0006430807,0.0014297508,0.00027434863,0.0018237304,0.009589424,0.00015583131,0.000022051698],"category_scores_gemma":[0.0004041361,0.00037578022,0.0005273055,0.0011959951,0.00089787185,0.0032386805,0.004059445,0.0009969063,0.000014716803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002490843,0.0023184048,0.0034481885,0.00023164539,0.0015749009,0.00028606254,0.022722567,0.29566503,0.0015755516,0.41211993,0.004361519,0.25544712],"study_design_scores_gemma":[0.0015043352,0.00037500734,0.012597739,0.0006217058,0.00007114956,0.00038254666,0.000075856435,0.92721707,0.001040458,0.049107835,0.0063645486,0.0006417369],"about_ca_topic_score_codex":0.00009797258,"about_ca_topic_score_gemma":0.000015424783,"teacher_disagreement_score":0.63155204,"about_ca_system_score_codex":0.00025797833,"about_ca_system_score_gemma":0.0027995117,"threshold_uncertainty_score":0.9998694},"labels":[],"label_agreement":null},{"id":"W2951629521","doi":"10.1142/s0129054119400239","title":"Most Complex Non-Returning Regular Languages","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Concatenation (mathematics); Upper and lower bounds; Regular language; State (computer science); Semigroup; Discrete mathematics; Star (game theory); Mathematics; Combinatorics; Binary number; Automaton; Computer science; Algorithm; Theoretical computer science; Arithmetic","score_opus":0.02039698106508405,"score_gpt":0.31923168493430226,"score_spread":0.29883470386921823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951629521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07412583,0.00011497985,0.9167832,0.0018860061,0.0060785566,0.00012485069,0.000014742553,0.00003414512,0.0008376791],"genre_scores_gemma":[0.73393494,0.00003075625,0.26518056,0.00029935292,0.0004948668,0.0000014050444,0.00001115236,0.000008544518,0.000038437327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645036,0.000070336246,0.0009552232,0.0004445554,0.0018286749,0.00025082915],"domain_scores_gemma":[0.993739,0.00024597728,0.0017489225,0.00087550137,0.0032698025,0.000120760276],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0016316628,0.00023151486,0.00043201723,0.0008923899,0.000119445875,0.0010122919,0.008796656,0.00009084279,0.00003330401],"category_scores_gemma":[0.00016972012,0.00020996638,0.00021659913,0.0006078006,0.00042933668,0.0015465267,0.003168081,0.00048434507,0.000020596292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066115164,0.0008786859,0.003447446,0.00021978197,0.0010108724,0.00030029053,0.006619499,0.22096184,0.050949555,0.21710421,0.010705406,0.4877363],"study_design_scores_gemma":[0.00080838753,0.00022039344,0.021641167,0.001086594,0.00003204486,0.00052223314,0.00008190617,0.94044477,0.007667143,0.023824904,0.003169625,0.0005008598],"about_ca_topic_score_codex":0.00002886372,"about_ca_topic_score_gemma":0.0000013835206,"teacher_disagreement_score":0.7194829,"about_ca_system_score_codex":0.0002079279,"about_ca_system_score_gemma":0.0014590676,"threshold_uncertainty_score":0.99656624},"labels":[],"label_agreement":null},{"id":"W2951958096","doi":"10.1142/s0129054120410075","title":"The Intersection Problem for Finite Semigroups","year":2020,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Decidability; Special classes of semigroups; Intersection (aeronautics); Mathematics; Commutative property; Semigroup; Complexity class; Monoid; Bounded function; Class (philosophy); Word problem (mathematics education); Discrete mathematics; Morphism; Order (exchange); Krohn–Rhodes theory; Pure mathematics; Time complexity; Computer science; Arithmetic","score_opus":0.026329324620930957,"score_gpt":0.30822186272285923,"score_spread":0.28189253810192827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951958096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038180917,0.00010090983,0.97716045,0.009301853,0.009141371,0.00024244409,0.000015344667,0.00003725436,0.00018230351],"genre_scores_gemma":[0.63315654,0.000056536886,0.36564678,0.00026589417,0.00082884775,0.000013316596,0.0000053558356,0.000008697428,0.000018060908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971196,0.00006782874,0.0010079275,0.00038707445,0.0011969947,0.00022058745],"domain_scores_gemma":[0.99364346,0.0008952591,0.0017275673,0.000518803,0.003102147,0.000112756374],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020248895,0.00018928084,0.0002786378,0.00037748436,0.0002865948,0.0013975503,0.0077969977,0.00006848982,0.0000031190598],"category_scores_gemma":[0.00040247935,0.00014156627,0.00032898865,0.00043878725,0.00046096655,0.0012176413,0.0021178033,0.0004087227,0.0000041383832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009225533,0.00019187303,0.000090814916,0.00006183752,0.00038501972,0.0000134831935,0.0027048718,0.029928919,0.0022749382,0.4819533,0.0034658478,0.47883686],"study_design_scores_gemma":[0.0004206474,0.00027484202,0.00056503573,0.00033132415,0.000021448854,0.00010134776,0.00003901832,0.69607884,0.002210208,0.29175824,0.0080045955,0.000194459],"about_ca_topic_score_codex":0.00001006214,"about_ca_topic_score_gemma":0.0000041323783,"teacher_disagreement_score":0.6661499,"about_ca_system_score_codex":0.0002364924,"about_ca_system_score_gemma":0.0011972061,"threshold_uncertainty_score":0.9996391},"labels":[],"label_agreement":null},{"id":"W2952369254","doi":"10.1142/s0129054103002047","title":"ANALYSIS OF QUANTUM FUNCTIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Quantum algorithm; Quantum; Quantum operation; Quantum computer; Quantum capacity; Mathematics; Oracle; Computer science; Theoretical computer science; Quantum network; Open quantum system; Quantum mechanics; Physics","score_opus":0.013466439627247716,"score_gpt":0.2863128427988463,"score_spread":0.2728464031715986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952369254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16509849,0.000036331134,0.8320607,0.00042258008,0.0020924832,0.00002739548,0.0000038961803,0.000010282553,0.000247846],"genre_scores_gemma":[0.82365,0.0000066339144,0.17621532,0.000049128663,0.00006516642,3.27183e-7,8.605609e-7,0.0000023027262,0.000010278393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770486,0.00006849781,0.0007365568,0.00021067163,0.0011238188,0.00015556377],"domain_scores_gemma":[0.99607277,0.00024345178,0.0008587153,0.00037280127,0.0023604396,0.00009184866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012110835,0.000097993965,0.0002750571,0.0020024274,0.000117212796,0.00016831305,0.0023578792,0.000023693943,0.000021279702],"category_scores_gemma":[0.00022010712,0.00008398897,0.00027205376,0.0028982009,0.0003367071,0.0008079545,0.00020030796,0.00013450345,0.0000024177714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001119632,0.0004843455,0.006007177,0.0000065333943,0.001125218,0.000015259317,0.0012913023,0.5216978,0.003194601,0.3652637,0.0001668886,0.100735955],"study_design_scores_gemma":[0.00026888237,0.00018269735,0.0205498,0.000038213235,0.00007960214,0.00011000679,0.000019154155,0.9704711,0.0019151694,0.004950425,0.0013117434,0.00010323638],"about_ca_topic_score_codex":0.000011311789,"about_ca_topic_score_gemma":0.0000018576432,"teacher_disagreement_score":0.6585515,"about_ca_system_score_codex":0.000054397227,"about_ca_system_score_gemma":0.00055536354,"threshold_uncertainty_score":0.43815652},"labels":[],"label_agreement":null},{"id":"W2964048382","doi":"10.1142/s0129054112400655","title":"THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Tulane University","keywords":"Exponent; Infimum and supremum; Mathematics; Critical exponent; Rational number; Computation; Constant (computer programming); Discrete mathematics; Sequence (biology); Diophantine equation; Diophantine approximation; Combinatorics; Computer science; Algorithm","score_opus":0.028626477348128468,"score_gpt":0.3462912195548554,"score_spread":0.31766474220672697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964048382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04117853,0.00021781537,0.94579834,0.007512244,0.0051011015,0.00007802085,0.0000034279024,0.000019631829,0.00009087301],"genre_scores_gemma":[0.7164978,0.000014109667,0.28284088,0.00030421466,0.00032751766,0.0000031797463,3.00161e-7,0.000002662766,0.0000093344215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979418,0.000046641584,0.0005852923,0.00013991277,0.0010002947,0.0002860917],"domain_scores_gemma":[0.99635905,0.0012247731,0.00042472995,0.0002913616,0.0015735279,0.0001265741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022977896,0.00009283841,0.00014657773,0.00025470462,0.00035688665,0.00062602636,0.003434743,0.000020642181,0.000011772327],"category_scores_gemma":[0.0003276847,0.00006344116,0.0001277312,0.00035559566,0.00060103583,0.0027670972,0.00034714333,0.00008682131,0.000007731157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009631956,0.00024666885,0.0008315755,0.000011391282,0.00007482772,0.0000024031106,0.0018280594,0.00078590517,0.001563082,0.7500067,0.0019211067,0.24271867],"study_design_scores_gemma":[0.00052386266,0.0002849025,0.0077377497,0.00016212341,0.00001713621,0.00047634754,0.00010546573,0.8639601,0.010855648,0.10023253,0.01542639,0.00021776477],"about_ca_topic_score_codex":0.000004468085,"about_ca_topic_score_gemma":2.988755e-7,"teacher_disagreement_score":0.8631742,"about_ca_system_score_codex":0.00009478074,"about_ca_system_score_gemma":0.00035210102,"threshold_uncertainty_score":0.6382664},"labels":[],"label_agreement":null},{"id":"W2964084228","doi":"10.1142/s0129054112400096","title":"<font>L</font>-SYSTEMS IN GEOMETRIC MODELING","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Bézier curve; Context (archaeology); Parametric equation; Parametric statistics; Font; Computer science; Geometric design; Subdivision; Geometric modeling; Algorithm; Parametric model; Mathematics; Interpretation (philosophy); Pure mathematics; Geometry; Artificial intelligence","score_opus":0.022264680893232927,"score_gpt":0.3062847088080332,"score_spread":0.2840200279148003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964084228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18850209,0.00029829086,0.8098235,0.00005454295,0.0010635761,0.000029323992,0.0000010137836,0.000019587298,0.000208052],"genre_scores_gemma":[0.9141342,0.000062093466,0.08555613,0.000013030539,0.00022449752,0.0000014589419,6.673843e-7,0.0000051742363,0.0000027659262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985182,0.000013477054,0.00056421297,0.000071285525,0.0006680807,0.00016470495],"domain_scores_gemma":[0.9989224,0.00007128228,0.00017136689,0.000112538284,0.0006447933,0.000077602395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006673272,0.000073867166,0.00016713628,0.001477826,0.000026606469,0.00006880797,0.0007662507,0.000021002343,0.0000081568505],"category_scores_gemma":[0.00009141733,0.0000676029,0.00006554531,0.0011388761,0.00007927039,0.0015993059,0.00007175885,0.00012944572,0.000003994911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030692393,0.00006580109,0.0025538206,0.000003957224,0.000028674684,0.0000019434417,0.00014069153,0.95974535,0.0018668148,0.0015222386,0.000036235866,0.034031432],"study_design_scores_gemma":[0.0001412793,0.000026511943,0.003093889,0.000058328562,0.0000058349738,0.000051096347,0.000014754216,0.9935918,0.0013719281,0.0009398517,0.00062124874,0.000083464955],"about_ca_topic_score_codex":0.000021942813,"about_ca_topic_score_gemma":0.0000015235138,"teacher_disagreement_score":0.7256321,"about_ca_system_score_codex":0.00023637156,"about_ca_system_score_gemma":0.00004773032,"threshold_uncertainty_score":0.27567664},"labels":[],"label_agreement":null},{"id":"W2971864569","doi":"10.1142/s0129054121420041","title":"Descriptional Complexity of Semi-Simple Splicing Systems","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Regular language; RNA splicing; Axiom; Mathematics; Set (abstract data type); Recursively enumerable language; Simple (philosophy); Focus (optics); Combinatorics; Discrete mathematics; Computer science; Theoretical computer science; Physics; Automaton; Genetics; RNA","score_opus":0.04492041818409099,"score_gpt":0.30748736289904227,"score_spread":0.2625669447149513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971864569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18806268,0.00010479941,0.8084679,0.00059735955,0.0024399075,0.000034757955,0.000008679803,0.000012238079,0.00027168368],"genre_scores_gemma":[0.85513806,0.000014748023,0.14454237,0.00009007425,0.00019582726,6.086027e-7,0.0000031965392,0.0000030821318,0.000012061063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974222,0.00007231261,0.0008109781,0.00021419178,0.0013216366,0.00015869224],"domain_scores_gemma":[0.99484545,0.00019849632,0.0008315017,0.00036000586,0.0036739514,0.00009058158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011404045,0.00009694349,0.00024545545,0.00045837453,0.00010980829,0.00032241145,0.0025101597,0.000025621672,0.000026914604],"category_scores_gemma":[0.00014921608,0.00009045327,0.00013489499,0.00072964816,0.0005389802,0.0017227662,0.00053217553,0.00011718785,0.0000037852608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013945825,0.00030721072,0.0016385434,0.000022397044,0.000109468696,0.000041528943,0.0006161269,0.013252804,0.045536343,0.9130967,0.00038035514,0.024984537],"study_design_scores_gemma":[0.0010861602,0.0003008611,0.03901005,0.0004976432,0.000022538352,0.0022690021,0.00017830278,0.80020124,0.056948055,0.09698366,0.0021970076,0.00030547602],"about_ca_topic_score_codex":0.000030725245,"about_ca_topic_score_gemma":0.0000029572805,"teacher_disagreement_score":0.81611305,"about_ca_system_score_codex":0.000115522285,"about_ca_system_score_gemma":0.0008424818,"threshold_uncertainty_score":0.46645433},"labels":[],"label_agreement":null},{"id":"W2973381442","doi":"10.1142/s0129054119400367","title":"State Complexity of the Quotient Operation on Input-Driven Pushdown Automata","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Quotient; Context-free language; Nested word; Discrete mathematics; String (physics); Regular language; Mathematics; Closure (psychology); Computer science; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Finite-state machine; Automata theory; Automaton; Rule-based machine translation; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.022675386170567174,"score_gpt":0.2866288769865917,"score_spread":0.2639534908160245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973381442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5194796,0.000006031843,0.47425058,0.002689581,0.0031439255,0.000105587686,0.0000074552445,0.000012642303,0.00030463046],"genre_scores_gemma":[0.95112544,0.0000048135057,0.048493482,0.00027059947,0.000069936075,7.0110616e-7,0.0000015122073,0.000003369538,0.00003014623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746096,0.00008343249,0.00064922933,0.00020937096,0.0014554787,0.00014152756],"domain_scores_gemma":[0.9970633,0.00014624708,0.0008591311,0.0005674189,0.0013057783,0.00005813962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094523974,0.000103136386,0.000187061,0.00039951163,0.00010591944,0.00025116952,0.0043329727,0.000019540974,0.0000270042],"category_scores_gemma":[0.00007222238,0.000071945724,0.00012959108,0.0005161255,0.0005070777,0.0015099824,0.0006630397,0.00014037648,0.000018871177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005629561,0.0007942997,0.005995624,0.000020703825,0.00013536713,0.0000064675332,0.002618473,0.13369332,0.03607821,0.7336194,0.0005401432,0.08644172],"study_design_scores_gemma":[0.0010099397,0.0005345697,0.104750834,0.00030494537,0.0000074960653,0.0001233962,0.000024924475,0.83528864,0.029475167,0.027054423,0.0012491053,0.00017654775],"about_ca_topic_score_codex":0.00001692959,"about_ca_topic_score_gemma":0.0000034986174,"teacher_disagreement_score":0.70656496,"about_ca_system_score_codex":0.00012393395,"about_ca_system_score_gemma":0.0004798539,"threshold_uncertainty_score":0.8051813},"labels":[],"label_agreement":null},{"id":"W2973570009","doi":"10.1142/s0129054119400306","title":"Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Suffix; Prefix; Factor (programming language); Regular language; Star (game theory); Computer science; Mathematics; Complementation; Discrete mathematics; Linguistics; Artificial intelligence; Programming language; Automaton","score_opus":0.01206863278707973,"score_gpt":0.2887628517587392,"score_spread":0.27669421897165947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973570009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6519817,0.00017852892,0.34576866,0.001377737,0.00054214563,0.00006442973,0.000014558564,0.000014069437,0.00005813615],"genre_scores_gemma":[0.93138856,0.000055376517,0.06808362,0.0003772576,0.00006615289,7.206993e-7,0.0000057444204,0.000004373187,0.000018192679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983997,0.000050531547,0.00042448216,0.00023892889,0.0007397187,0.00014668949],"domain_scores_gemma":[0.9983289,0.00017190522,0.0004185994,0.00026709237,0.0007223412,0.000091152426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005134446,0.00011075822,0.00016223779,0.0003525108,0.00009516077,0.0005213818,0.0015267745,0.00002410519,0.00003232584],"category_scores_gemma":[0.00003584072,0.00009617975,0.00003590585,0.00030979936,0.00024300067,0.0020381846,0.00047312435,0.000095576615,0.0000035337168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056654753,0.00044673815,0.019429334,0.000044767905,0.00035064702,0.00002096715,0.0036862777,0.0015106514,0.2235777,0.5698454,0.0028726435,0.17815825],"study_design_scores_gemma":[0.007015265,0.0015883285,0.3545784,0.00045709917,0.00004971593,0.00087098836,0.000854943,0.4670569,0.08145461,0.08088586,0.004147021,0.0010408816],"about_ca_topic_score_codex":0.00002469587,"about_ca_topic_score_gemma":0.000004614911,"teacher_disagreement_score":0.48895952,"about_ca_system_score_codex":0.000059997183,"about_ca_system_score_gemma":0.00017725494,"threshold_uncertainty_score":0.50276965},"labels":[],"label_agreement":null},{"id":"W3028589106","doi":"10.1142/s0129054121410094","title":"An Inequality for the Number of Periods in a Word","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Waterloo","funders":"","keywords":"Word (group theory); Mathematics; Prefix; Square-free integer; Inequality; Exponent; Representation (politics); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Linguistics; Geometry; Law","score_opus":0.03514299275799944,"score_gpt":0.3783249735212547,"score_spread":0.3431819807632553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028589106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32513884,0.00006319877,0.67104304,0.0010197498,0.0026030894,0.000090577014,0.000008714251,0.0000057953475,0.000027033366],"genre_scores_gemma":[0.7392375,0.000029421652,0.26043156,0.000100019926,0.00018680994,0.000005214385,0.0000032752816,0.0000036731856,0.0000025498985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973011,0.000115041505,0.0010299468,0.00030987943,0.00108609,0.00015794781],"domain_scores_gemma":[0.994482,0.0005833374,0.001278582,0.0007212578,0.0028721665,0.00006269153],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003084899,0.00013678405,0.00033038433,0.00043151004,0.00007885067,0.0006262268,0.006578164,0.00005926189,0.000018932642],"category_scores_gemma":[0.0002471863,0.00010547543,0.00022478883,0.00052908587,0.00043924953,0.0013741935,0.0012546391,0.00028771424,5.0441764e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009835682,0.0016002733,0.015022568,0.00013327895,0.00038028334,0.00003822381,0.012661786,0.09127832,0.004371302,0.25361133,0.00013010782,0.6206742],"study_design_scores_gemma":[0.0007470794,0.000122020625,0.09066268,0.0006916401,0.000022819891,0.00020017872,0.00023960738,0.84973246,0.0031906064,0.053865306,0.0002703952,0.00025517997],"about_ca_topic_score_codex":0.00007688514,"about_ca_topic_score_gemma":0.00001762508,"teacher_disagreement_score":0.75845414,"about_ca_system_score_codex":0.00012732213,"about_ca_system_score_gemma":0.0014980286,"threshold_uncertainty_score":0.9987967},"labels":[],"label_agreement":null},{"id":"W3116871471","doi":"10.1142/s0129054120420095","title":"Semilinearity of Families of Languages","year":2020,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Linguistics; Computer science; Sociology; Philosophy","score_opus":0.017634115768495644,"score_gpt":0.30219732675415434,"score_spread":0.2845632109856587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116871471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.294772,0.000068645175,0.7029871,0.0013986113,0.00047980034,0.000026701415,0.000006423333,0.000008640421,0.0002521374],"genre_scores_gemma":[0.83708864,0.000024385356,0.16263528,0.00014336951,0.00010329399,1.7377683e-7,5.7642563e-7,0.0000017811849,0.0000024638673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827975,0.000032618365,0.0006011507,0.00013184334,0.00086806394,0.000086595996],"domain_scores_gemma":[0.9972961,0.0001808415,0.0007267398,0.00020185189,0.0015271661,0.000067317975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206656,0.000067563706,0.00020002412,0.00031327596,0.000032140753,0.0000633458,0.0027351698,0.000018251943,0.000013387675],"category_scores_gemma":[0.00022258727,0.00005788681,0.00010610757,0.00057029986,0.00040566284,0.0010494323,0.00040020215,0.00008443459,0.0000016873342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079872596,0.00063922396,0.009813723,0.00009743542,0.00026556075,0.000036692963,0.0110138785,0.014878901,0.19573322,0.39785784,0.0008197177,0.36876392],"study_design_scores_gemma":[0.0014328634,0.0009864875,0.04848224,0.00039160842,0.000028436096,0.00019850739,0.0004604512,0.5606331,0.37020066,0.015299148,0.001582441,0.00030401847],"about_ca_topic_score_codex":0.00001752164,"about_ca_topic_score_gemma":8.5679915e-7,"teacher_disagreement_score":0.54575425,"about_ca_system_score_codex":0.000021449912,"about_ca_system_score_gemma":0.00032545725,"threshold_uncertainty_score":0.50826716},"labels":[],"label_agreement":null},{"id":"W3120557648","doi":"10.1142/s0129054121500106","title":"Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Bounded function; Computer science; Decidability; Timed automaton; Automaton; Word (group theory); Discretization; Upper and lower bounds; Regular language; Discrete mathematics; Mathematics; Algorithm; Theoretical computer science","score_opus":0.0166647698265721,"score_gpt":0.3381901749490095,"score_spread":0.3215254051224374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120557648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090384476,0.000036588564,0.9048935,0.0017337946,0.0019830728,0.00010111367,0.000006665979,0.000023021688,0.0008377648],"genre_scores_gemma":[0.52424985,0.0000070140454,0.47549212,0.00013920155,0.00007850719,0.0000017915806,0.000007808126,0.000004324931,0.00001937651],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962121,0.00021929543,0.0009751103,0.00033066375,0.0020761548,0.0001866395],"domain_scores_gemma":[0.99424183,0.00032720444,0.0012835956,0.00073564524,0.0033018421,0.00010989453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022200174,0.00014461516,0.0002795635,0.00082458335,0.00024559523,0.00028707794,0.0030819243,0.000055051398,0.0000470261],"category_scores_gemma":[0.00090677396,0.00013522521,0.00016585545,0.0012805257,0.00047150435,0.0016373852,0.00074243575,0.00018921336,0.0000086338505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034731257,0.0017302352,0.00054941385,0.000055632714,0.00016611352,0.000059796854,0.0058220243,0.015588756,0.36569664,0.35509378,0.00028524277,0.25460505],"study_design_scores_gemma":[0.0013168993,0.00031512824,0.008459785,0.0002347397,0.00001671669,0.00008565257,0.000039516606,0.6898941,0.28991714,0.008683908,0.00085231755,0.00018411281],"about_ca_topic_score_codex":0.000012351527,"about_ca_topic_score_gemma":0.0000023343673,"teacher_disagreement_score":0.6743053,"about_ca_system_score_codex":0.00026805926,"about_ca_system_score_gemma":0.0013837587,"threshold_uncertainty_score":0.5727033},"labels":[],"label_agreement":null},{"id":"W3126750858","doi":"10.1142/s0129054121410033","title":"Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Separable space; Mathematics; Partition (number theory); Zero (linguistics); Embedding; Word (group theory); Constructive; Rational number; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.011756043757670224,"score_gpt":0.26541966523242494,"score_spread":0.25366362147475474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126750858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038192146,0.00034272426,0.9514493,0.008131992,0.0010926934,0.00007168786,0.0000029533371,0.0000157641,0.0007007945],"genre_scores_gemma":[0.8488767,0.00010452723,0.15063417,0.00023139885,0.00010404285,0.000002386089,0.0000027012884,0.0000029605008,0.000041108742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979188,0.00016321999,0.00058941124,0.00021382813,0.00097593584,0.00013883554],"domain_scores_gemma":[0.9968547,0.00069548556,0.00047959003,0.0002291767,0.0016733691,0.00006763261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024343983,0.000090064874,0.00016265822,0.00044715797,0.00035153524,0.0006120102,0.0012647273,0.000025437703,0.000017832734],"category_scores_gemma":[0.00028618926,0.000068197616,0.000100565005,0.0010525654,0.00044869995,0.002469807,0.0002164718,0.00018412166,0.000004842688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017931441,0.00009837301,0.00038178085,0.0000045044744,0.00006971513,0.000010159099,0.0010232324,0.0060863164,0.0016698061,0.932225,0.00044769578,0.05796548],"study_design_scores_gemma":[0.0029762713,0.00013636319,0.011084563,0.00022507146,0.000043903703,0.0014114046,0.00013398028,0.53189933,0.013487602,0.43430972,0.0040265303,0.0002652253],"about_ca_topic_score_codex":0.0000068745967,"about_ca_topic_score_gemma":0.00000184098,"teacher_disagreement_score":0.81068456,"about_ca_system_score_codex":0.00008487739,"about_ca_system_score_gemma":0.0006554364,"threshold_uncertainty_score":0.5901629},"labels":[],"label_agreement":null},{"id":"W3130094013","doi":"10.1142/s0129054121410057","title":"Generalizations of Code Languages with Marginal Errors","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Prefix; Suffix; String (physics); Prefix code; Context-free language; Regular language; Mathematics; Combinatorics; Discrete mathematics; Compressed suffix array; Computer science; Suffix tree; Automaton; Algorithm; Theoretical computer science; Linguistics; Linear code; Natural language processing; Rule-based machine translation","score_opus":0.014953662195514748,"score_gpt":0.31410213911426543,"score_spread":0.2991484769187507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130094013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.705405,0.000072359966,0.2936597,0.0003306,0.00021800002,0.000014020084,0.00000633713,0.0000011967788,0.0002928089],"genre_scores_gemma":[0.9224157,0.000023463517,0.077267654,0.0000837668,0.00015948236,2.0754767e-7,0.00001267298,0.0000019441204,0.00003510618],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992528,0.000023903242,0.00024885964,0.00010262683,0.000304447,0.00006739633],"domain_scores_gemma":[0.9978917,0.000019007088,0.0002718892,0.00010064072,0.0016830482,0.000033679167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021005892,0.000047177145,0.000085472144,0.000093889765,0.000039930885,0.000032058746,0.00044549283,0.000019356228,0.000015761832],"category_scores_gemma":[0.000090842426,0.000035361903,0.000051651194,0.00019252925,0.00024329801,0.000018803374,0.00012411649,0.00003839757,3.6214226e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006625829,0.00025579362,0.023082208,0.000008476162,0.00014984258,0.000026619387,0.0001144156,0.018472811,0.9326807,0.0064702025,0.00026584038,0.01840678],"study_design_scores_gemma":[0.001188812,0.0010990106,0.08013802,0.00018045773,0.000037367343,0.0009329649,0.00019073322,0.0068605016,0.89909,0.0006506945,0.009397012,0.00023443565],"about_ca_topic_score_codex":0.000002962097,"about_ca_topic_score_gemma":0.00000751832,"teacher_disagreement_score":0.2170107,"about_ca_system_score_codex":0.000010573238,"about_ca_system_score_gemma":0.00031754022,"threshold_uncertainty_score":0.14420167},"labels":[],"label_agreement":null},{"id":"W3152988225","doi":"10.1142/s0129054111009148","title":"APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Euclidean geometry; Geometric networks; Approximation algorithm; Time complexity; Network planning and design; Computer science; Polynomial; Geometric design; Euclidean space; Algorithm; Mathematical optimization; Polynomial-time approximation scheme; Discrete mathematics; Theoretical computer science; Mathematics; Graph theory; Combinatorics; Geometry","score_opus":0.09136408144728773,"score_gpt":0.34830072277790397,"score_spread":0.2569366413306162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152988225","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028814594,0.00006507061,0.99412847,0.00028143497,0.0021832704,0.00022526129,0.0000030206904,0.000021957416,0.0002100331],"genre_scores_gemma":[0.24031377,0.000016669213,0.7593308,0.000060206472,0.00023529107,0.000007925274,0.0000011377825,0.000005597767,0.000028562163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972969,0.000079035584,0.0006862341,0.0002898329,0.0013322941,0.00031568875],"domain_scores_gemma":[0.99448824,0.0005615578,0.00079270155,0.0003815213,0.0036354444,0.00014051396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030832987,0.00012245897,0.0002002885,0.0014235266,0.0002557469,0.00021327741,0.0042800508,0.000034810906,0.000022053548],"category_scores_gemma":[0.00036781654,0.00011090425,0.00014204402,0.0019438594,0.00043219118,0.0026011427,0.00056467653,0.00012833891,0.000009291066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021754953,0.0005001686,0.00060093566,0.000015899928,0.0001934111,0.00002136182,0.0015266276,0.083152816,0.002315436,0.40801486,0.0009590283,0.5024819],"study_design_scores_gemma":[0.0011599254,0.0009196166,0.0044854633,0.00008706725,0.000014132822,0.00034204338,0.000012525129,0.6906188,0.022084871,0.2787917,0.0012227903,0.00026107012],"about_ca_topic_score_codex":0.0000034750065,"about_ca_topic_score_gemma":6.827626e-7,"teacher_disagreement_score":0.607466,"about_ca_system_score_codex":0.00021758792,"about_ca_system_score_gemma":0.0004507694,"threshold_uncertainty_score":0.7953471},"labels":[],"label_agreement":null},{"id":"W3158013313","doi":"10.1142/s0129054121410045","title":"Generalizations of Checking Stack Automata: Characterizations and Hierarchies","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Decidability; Turing machine; Computer science; Automaton; Stack (abstract data type); Theoretical computer science; Bounded function; Expressive power; Pushdown automaton; Automata theory; PSPACE; Discrete mathematics; Mathematics; Computational complexity theory; Programming language; Algorithm; Computation","score_opus":0.014366912644291241,"score_gpt":0.28497822296240233,"score_spread":0.2706113103181111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158013313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22379476,0.00007456706,0.7733001,0.001644046,0.0010104082,0.00002782264,0.00000886396,0.000013761371,0.00012566218],"genre_scores_gemma":[0.7551937,0.000117222946,0.24445143,0.00010813032,0.00010399323,6.6663483e-7,0.000004457499,0.000003257134,0.00001714072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983303,0.00005021593,0.00060644624,0.000181924,0.00071286847,0.000118232376],"domain_scores_gemma":[0.996624,0.00014976853,0.00061257544,0.00029082573,0.0022507769,0.000072039176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052621344,0.00008344631,0.00018168737,0.0005562095,0.00012768361,0.00031934705,0.0013961854,0.000020958936,0.00001431665],"category_scores_gemma":[0.000173368,0.00007909733,0.000071187,0.00081764633,0.00038849362,0.0020445285,0.000501653,0.00007708318,9.4993925e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007402383,0.0003362848,0.0024052188,0.00002306923,0.00012853202,0.000030919768,0.002391385,0.00393437,0.09999858,0.774386,0.000116724914,0.11624154],"study_design_scores_gemma":[0.0017268467,0.00029663436,0.14031596,0.0006063897,0.000045420333,0.0017102138,0.00016092858,0.6531101,0.13965619,0.057956234,0.003963265,0.00045184392],"about_ca_topic_score_codex":0.0000043653336,"about_ca_topic_score_gemma":0.0000015677304,"teacher_disagreement_score":0.71642977,"about_ca_system_score_codex":0.00003761402,"about_ca_system_score_gemma":0.0006209204,"threshold_uncertainty_score":0.32254952},"labels":[],"label_agreement":null},{"id":"W3169850973","doi":"10.1142/s0129054121420028","title":"Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lexicographical order; Regular language; Mathematics; State (computer science); Combinatorics; Word (group theory); Discrete mathematics; Computer science; Automaton; Artificial intelligence; Algorithm","score_opus":0.012540010066171578,"score_gpt":0.2983123553723818,"score_spread":0.28577234530621026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169850973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5214005,0.00017182187,0.47608078,0.001561971,0.0005985225,0.00001977,6.8574474e-7,0.000009239744,0.00015671695],"genre_scores_gemma":[0.7888292,0.00004966511,0.2108567,0.00016104846,0.00009502386,2.267452e-7,7.574066e-7,0.0000025311983,0.000004843437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833226,0.000067032415,0.0005377183,0.00023702206,0.0006679937,0.00015798262],"domain_scores_gemma":[0.9980848,0.00026820615,0.0003880581,0.00021705493,0.00096580153,0.00007610061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013239185,0.00008670634,0.00017585643,0.00068643806,0.00008561063,0.00043267928,0.0015948266,0.000027376485,0.000007945368],"category_scores_gemma":[0.00021514155,0.000082201346,0.00006606272,0.0009797541,0.00029034246,0.0011085476,0.00056298333,0.00015313257,8.303572e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017571829,0.0003133932,0.03504903,0.000019499186,0.000095061565,0.00043867575,0.003667397,0.0038511027,0.016066449,0.23945902,0.00004589292,0.7009769],"study_design_scores_gemma":[0.0029119242,0.000369831,0.3788392,0.0018396464,0.00002565728,0.0040730224,0.0010583361,0.48794764,0.031113574,0.09017645,0.00090182346,0.0007429093],"about_ca_topic_score_codex":0.000014640516,"about_ca_topic_score_gemma":0.000016319142,"teacher_disagreement_score":0.700234,"about_ca_system_score_codex":0.000047465215,"about_ca_system_score_gemma":0.0003323632,"threshold_uncertainty_score":0.41723362},"labels":[],"label_agreement":null},{"id":"W3199131588","doi":"10.1142/s0129054121420090","title":"Space Complexity of Stack Automata Models","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decidability; Automaton; Measure (data warehouse); Stack (abstract data type); Bounded function; Computer science; Word (group theory); Discrete mathematics; Function (biology); Mathematics; Pushdown automaton; Theoretical computer science; Programming language","score_opus":0.051088884067070364,"score_gpt":0.31622316539600487,"score_spread":0.2651342813289345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199131588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080399424,0.00006807042,0.9142918,0.0026489976,0.0017408971,0.000033328055,0.000009191063,0.000018866467,0.00078943354],"genre_scores_gemma":[0.6471613,0.000022707247,0.35262802,0.00009113832,0.00007769825,2.764861e-7,0.0000013568798,0.0000025669815,0.000014887641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974704,0.00006601137,0.00070454075,0.00022737842,0.0013707547,0.000160925],"domain_scores_gemma":[0.9949333,0.00018360738,0.0008010519,0.0005138468,0.0034720947,0.000096111085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280322,0.00010078465,0.00024398397,0.00044974912,0.00008444416,0.00026503883,0.0034422847,0.000025155994,0.000027357186],"category_scores_gemma":[0.00012668657,0.000093323164,0.00014276126,0.0008002124,0.0006770081,0.0026630359,0.00080036424,0.00011725585,0.00000398321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009485984,0.00030854307,0.00013771112,0.000010132244,0.00006883455,0.00003331388,0.0006873613,0.013164955,0.010807064,0.94034445,0.00029953115,0.03412864],"study_design_scores_gemma":[0.0005735988,0.000121799436,0.0041825688,0.00015553889,0.000008595559,0.00045104828,0.000042057,0.737878,0.040895704,0.21502294,0.0005386059,0.00012950873],"about_ca_topic_score_codex":0.0000134124875,"about_ca_topic_score_gemma":0.000002853246,"teacher_disagreement_score":0.7253215,"about_ca_system_score_codex":0.00008395932,"about_ca_system_score_gemma":0.0010066058,"threshold_uncertainty_score":0.63966787},"labels":[],"label_agreement":null},{"id":"W4230315400","doi":"10.1142/s0129054113400364","title":"MULTIPSEUDOPERIODIC WORDS","year":2013,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Alphabet; Generalization; Simple (philosophy); Word (group theory); Mathematics; Palindrome; Natural number; Combinatorics; Discrete mathematics; Computer science; Linguistics","score_opus":0.01158208468288874,"score_gpt":0.2736022467836538,"score_spread":0.26202016210076506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230315400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19486865,0.000031818206,0.80040556,0.0018745722,0.0023673428,0.000051251016,7.2645304e-7,0.00001922004,0.0003808548],"genre_scores_gemma":[0.740793,0.000009590416,0.2587888,0.0002212729,0.00016397028,0.000001405124,2.9794006e-7,0.0000023839189,0.000019329073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811465,0.00003177538,0.00053438434,0.00017285986,0.000986018,0.00016032126],"domain_scores_gemma":[0.9970272,0.00013703099,0.00048525148,0.00032328494,0.0019201179,0.00010712303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072775723,0.00008786098,0.00014468284,0.00060008647,0.00010138838,0.0006510362,0.004114349,0.000020427618,0.00008009941],"category_scores_gemma":[0.00011155221,0.00007189651,0.00009870619,0.0005704845,0.0003728081,0.0036685704,0.00045382528,0.00010751557,0.00005563375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007161229,0.00030509272,0.0019193302,0.000005207242,0.00008226913,0.000020891097,0.0018384336,0.002408902,0.021627774,0.17294696,0.0013989735,0.797439],"study_design_scores_gemma":[0.0014514648,0.00045598898,0.07991493,0.00025427286,0.000012095777,0.0011046154,0.00011532154,0.81981534,0.020575365,0.07065511,0.0052054212,0.00044006266],"about_ca_topic_score_codex":0.00002263017,"about_ca_topic_score_gemma":6.119253e-7,"teacher_disagreement_score":0.8174065,"about_ca_system_score_codex":0.00007493572,"about_ca_system_score_gemma":0.0003675128,"threshold_uncertainty_score":0.7645552},"labels":[],"label_agreement":null},{"id":"W4232417187","doi":"10.1142/s0129054105003054","title":"PREFACE","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Computer science; Mathematics; Philosophy","score_opus":0.02243732172748708,"score_gpt":0.3440244698782949,"score_spread":0.3215871481508078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232417187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57050043,0.000050121365,0.42136857,0.0031969598,0.0023563143,0.00006610247,0.000010795454,0.000021120482,0.0024296169],"genre_scores_gemma":[0.8252256,0.000006076495,0.17401645,0.00010692204,0.00059415714,4.1685732e-7,8.8265233e-7,0.0000064690325,0.00004300892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974326,0.00002778635,0.0006329599,0.00013564453,0.0016244175,0.00014662549],"domain_scores_gemma":[0.99525744,0.00010000465,0.0007606601,0.000192691,0.0035863079,0.000102916565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011609689,0.0000818649,0.00013381588,0.00087180827,0.00008498851,0.0002042747,0.0021262083,0.000017079961,0.00014024107],"category_scores_gemma":[0.00020165589,0.00007338417,0.00010028333,0.0005639633,0.0005469258,0.002475304,0.00019196479,0.00012241046,0.00021202517],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019034144,0.0014371083,0.008804983,0.000007669027,0.0003547452,0.000028652992,0.0029364887,0.17512597,0.13437939,0.081458785,0.00975815,0.5855177],"study_design_scores_gemma":[0.0052502006,0.0010024343,0.19915862,0.00057471753,0.00009588022,0.0033026699,0.00012733383,0.34429777,0.16405442,0.013072217,0.26821342,0.00085028715],"about_ca_topic_score_codex":0.000005439846,"about_ca_topic_score_gemma":0.0000053400017,"teacher_disagreement_score":0.58466744,"about_ca_system_score_codex":0.0002721287,"about_ca_system_score_gemma":0.00062123797,"threshold_uncertainty_score":0.39510593},"labels":[],"label_agreement":null},{"id":"W4234130960","doi":"10.1142/s012905411940032x","title":"Branching Measures and Nearly Acyclic NFAs","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Nondeterministic algorithm; Nondeterministic finite automaton; Path (computing); String (physics); Discrete mathematics; Computation; Finite-state machine; Directed acyclic graph; Automaton; Algorithm; Computer science; Automata theory","score_opus":0.010147681627145586,"score_gpt":0.27040780591959834,"score_spread":0.26026012429245277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234130960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4339985,0.000060677616,0.5631788,0.0008822163,0.0015652713,0.000031940795,6.04203e-7,0.0000109974235,0.000271032],"genre_scores_gemma":[0.89445305,0.000019721652,0.105172664,0.00020609828,0.00012884273,2.9198335e-7,2.1671195e-7,0.0000026817045,0.000016428412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832785,0.000034759094,0.00039750428,0.00018703684,0.00092280685,0.00013003922],"domain_scores_gemma":[0.9982365,0.00017282275,0.00040374266,0.00025659733,0.00085238676,0.00007795535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010943545,0.000079560414,0.00014622688,0.0004809948,0.000083604034,0.00055559044,0.002330883,0.000018886614,0.000012596204],"category_scores_gemma":[0.00008075392,0.00006749231,0.000065685315,0.00036128878,0.0002159389,0.0028273985,0.00039034046,0.00011299769,0.000011906261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019351422,0.0001432138,0.008738894,0.000009799884,0.000093791714,0.000015540796,0.0023302727,0.0026107505,0.036396924,0.27157593,0.00014400555,0.67792153],"study_design_scores_gemma":[0.0027817627,0.0008663106,0.24567221,0.0006351763,0.000024852734,0.0020460896,0.00012771093,0.5966804,0.023789573,0.11780937,0.008913635,0.00065292104],"about_ca_topic_score_codex":0.000010629324,"about_ca_topic_score_gemma":9.2244227e-7,"teacher_disagreement_score":0.6772686,"about_ca_system_score_codex":0.000044667482,"about_ca_system_score_gemma":0.00024396375,"threshold_uncertainty_score":0.5357572},"labels":[],"label_agreement":null},{"id":"W4245962026","doi":"10.1142/s012905411402002x","title":"PREFACE","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Library science; Computer science; Download; World Wide Web","score_opus":0.010147234711187279,"score_gpt":0.27748372626392215,"score_spread":0.26733649155273487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245962026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04025454,0.000012787605,0.95465386,0.0011838219,0.0029764168,0.00002621302,6.531998e-7,0.0000143342895,0.0008773863],"genre_scores_gemma":[0.724063,0.0000038948915,0.2756027,0.0001347224,0.00017868375,3.155257e-7,1.9029866e-7,0.0000016240759,0.0000148758845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983335,0.00005175516,0.0004226315,0.00015593805,0.000908782,0.00012738358],"domain_scores_gemma":[0.9973727,0.00016456748,0.00045916057,0.00028680597,0.0016295864,0.00008717763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014710705,0.000071804454,0.00012412539,0.0005455661,0.00009919163,0.00028183087,0.0037881474,0.000016536003,0.000010621127],"category_scores_gemma":[0.00015556223,0.000061125706,0.000093451774,0.0005473554,0.00032484342,0.0019723575,0.00031733688,0.000098098666,0.000010748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006374859,0.00012213095,0.00040004848,0.0000023535642,0.00003292427,0.0000043398472,0.0005222622,0.0045922194,0.0031077377,0.69918686,0.00012285175,0.2918999],"study_design_scores_gemma":[0.0012450307,0.00070456055,0.02280074,0.00016928944,0.000013227079,0.00067319174,0.000022469349,0.6083848,0.028027527,0.32410172,0.013530381,0.00032705892],"about_ca_topic_score_codex":0.0000018982696,"about_ca_topic_score_gemma":3.3400772e-7,"teacher_disagreement_score":0.68380845,"about_ca_system_score_codex":0.00003684849,"about_ca_system_score_gemma":0.00022206426,"threshold_uncertainty_score":0.7039383},"labels":[],"label_agreement":null},{"id":"W4245987390","doi":"10.1142/s0129054118020033","title":"Preface","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Computer science","score_opus":0.02693178093746129,"score_gpt":0.35803170331140144,"score_spread":0.33109992237394015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245987390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5437891,0.000015038143,0.4480259,0.00088873954,0.004348999,0.000051514256,0.000008532784,0.000016255812,0.002855892],"genre_scores_gemma":[0.88782066,0.0000027681533,0.11119021,0.00008908545,0.00085347256,3.454744e-7,7.278854e-7,0.0000068335016,0.000035885383],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99755263,0.000030650895,0.00056835596,0.00014344421,0.0015572801,0.00014761124],"domain_scores_gemma":[0.99197567,0.00009067827,0.0007610422,0.00021201548,0.0068626786,0.000097940545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012280239,0.000078551515,0.00012768872,0.00086522114,0.00011976773,0.00021202376,0.0022487778,0.00001714923,0.00017217582],"category_scores_gemma":[0.00028344494,0.00006907761,0.00008393132,0.000713585,0.001415563,0.0017909101,0.00023537633,0.00009699002,0.0002717075],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054678455,0.0018707721,0.025589008,0.000014463277,0.0007359702,0.00006458709,0.007231491,0.009725961,0.40384817,0.17196444,0.022415707,0.35599265],"study_design_scores_gemma":[0.004959231,0.0031960022,0.3384799,0.00078423135,0.000105652834,0.0033338459,0.00017933986,0.16158088,0.31694844,0.042227007,0.12730306,0.000902417],"about_ca_topic_score_codex":0.000009265343,"about_ca_topic_score_gemma":0.0000053117424,"teacher_disagreement_score":0.35509023,"about_ca_system_score_codex":0.00017717012,"about_ca_system_score_gemma":0.00068878115,"threshold_uncertainty_score":0.5215701},"labels":[],"label_agreement":null},{"id":"W4252967799","doi":"10.1142/s0129054119400355","title":"State Complexity of Suffix Distance","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Suffix; Prefix; Regular language; Mathematics; Upper and lower bounds; Neighbourhood (mathematics); Combinatorics; State (computer science); Discrete mathematics; Automaton; Computer science; Algorithm; Theoretical computer science","score_opus":0.020896797954858718,"score_gpt":0.29279449418749776,"score_spread":0.27189769623263904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252967799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32584623,0.000028930292,0.67132866,0.00055706705,0.001734117,0.00004277431,0.00000590614,0.000009205582,0.0004471417],"genre_scores_gemma":[0.8695776,0.000014419782,0.13024819,0.000063151376,0.0000579788,2.9118564e-7,7.9096696e-7,0.0000026717478,0.000034912173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782276,0.000039800478,0.00066048367,0.00018745061,0.0011427647,0.00014676423],"domain_scores_gemma":[0.99663144,0.00016795156,0.0009066584,0.0003910934,0.0018319449,0.000070909715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232885,0.00008866883,0.00021604047,0.0004510499,0.0000498923,0.00017295424,0.0037187287,0.000015080102,0.000046956895],"category_scores_gemma":[0.000059486632,0.00007693814,0.000111665715,0.00057571096,0.00062021986,0.0019348471,0.00042923103,0.0001025291,0.00001286421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039553626,0.0003748806,0.0062098247,0.000021974125,0.00009325271,0.00000856704,0.0013966801,0.0073383297,0.014966362,0.8595643,0.00023889169,0.10974735],"study_design_scores_gemma":[0.0018977277,0.00095976435,0.12239692,0.00050656794,0.000013159537,0.0002777268,0.00006662895,0.56827044,0.049754295,0.2508883,0.0045407973,0.00042765136],"about_ca_topic_score_codex":0.000013166332,"about_ca_topic_score_gemma":0.0000023554771,"teacher_disagreement_score":0.608676,"about_ca_system_score_codex":0.00007492911,"about_ca_system_score_gemma":0.00040090038,"threshold_uncertainty_score":0.6910385},"labels":[],"label_agreement":null},{"id":"W4253673406","doi":"10.1142/s0129054108006145","title":"PREFACE","year":2008,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Library science; Queen (butterfly); Download; Computer science; World Wide Web; Ecology","score_opus":0.0378022316468655,"score_gpt":0.3347702542418501,"score_spread":0.29696802259498456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253673406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71756643,0.000029298568,0.27802968,0.00063067704,0.002298033,0.000047095116,0.0000075663606,0.000015125936,0.0013760852],"genre_scores_gemma":[0.9016875,0.000014847818,0.09786269,0.00006532597,0.00031430676,4.5117815e-7,0.0000010413094,0.0000070312753,0.000046801266],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9973003,0.000030525025,0.00060560677,0.00013747369,0.0017831891,0.00014289183],"domain_scores_gemma":[0.9946977,0.00010853058,0.000758799,0.0001968234,0.004133583,0.00010458097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082457415,0.000082357736,0.00014702704,0.00088801,0.00014778075,0.00009236842,0.0020565114,0.000017097198,0.000085376414],"category_scores_gemma":[0.00024169695,0.000073698066,0.00010711665,0.0006727656,0.0009949361,0.0018917699,0.00019117953,0.00012336629,0.00012838676],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006854935,0.0042024245,0.11868003,0.000025580512,0.0011649259,0.00066577544,0.014132279,0.15916932,0.36038202,0.12677577,0.034991212,0.17912516],"study_design_scores_gemma":[0.004899471,0.0012430117,0.7070799,0.0004564897,0.00006549128,0.0155923925,0.00011008939,0.096113704,0.10648407,0.012664431,0.054496005,0.0007949473],"about_ca_topic_score_codex":0.000010298054,"about_ca_topic_score_gemma":0.0000017100689,"teacher_disagreement_score":0.5883999,"about_ca_system_score_codex":0.00018896669,"about_ca_system_score_gemma":0.0009175997,"threshold_uncertainty_score":0.3821544},"labels":[],"label_agreement":null},{"id":"W4317402046","doi":"10.1142/s0129054122460078","title":"Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Nash equilibrium; Computer science; Scheduling (production processes); Price of anarchy; Mathematical optimization; Best response; Schedule; Single-machine scheduling; Game theory; Job shop scheduling; Mathematical economics; Mathematics; Price of stability; Economics","score_opus":0.046164140740085784,"score_gpt":0.29706401677237637,"score_spread":0.2508998760322906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317402046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51007164,0.000005526991,0.48709863,0.0010798351,0.0013296504,0.00009219204,0.000029432344,0.000009640676,0.00028348382],"genre_scores_gemma":[0.96689296,0.000010654003,0.032556288,0.00008436047,0.0003653168,0.0000062290446,0.000012969877,0.000009239299,0.00006200452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.000005946125,0.00056654227,0.00019418138,0.00011805993,0.00014262897],"domain_scores_gemma":[0.9983567,0.00016268234,0.0008185057,0.00014730133,0.00046526318,0.00004954864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011151228,0.00008290996,0.00019935175,0.00063328445,0.000115475865,0.00030971353,0.00067462696,0.000022801092,0.000018508945],"category_scores_gemma":[0.00015187314,0.000078720215,0.00007877531,0.00028851445,0.00017293173,0.0011018951,0.00007983824,0.00007376928,0.000014136016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015436998,0.00007051733,0.0010089458,0.0000102715,0.000083466184,9.368766e-7,0.0006410438,0.17733131,0.0009837624,0.8103378,0.00008244592,0.009295131],"study_design_scores_gemma":[0.0014236709,0.00036484588,0.0037638142,0.00014174625,0.000005398988,0.000022226592,0.00004443764,0.7842298,0.002188909,0.20419897,0.0034255097,0.00019065787],"about_ca_topic_score_codex":0.000011257938,"about_ca_topic_score_gemma":0.0000022855156,"teacher_disagreement_score":0.6068985,"about_ca_system_score_codex":0.00011148576,"about_ca_system_score_gemma":0.0001401248,"threshold_uncertainty_score":0.32101172},"labels":[],"label_agreement":null},{"id":"W4318303117","doi":"10.1142/s0129054122460029","title":"Graph Algorithm Based Submodular Function for Sparsest Cut Problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Minimum cut; Combinatorics; Subroutine; Graph partition; Maximum flow problem; Maximum cut; Partition (number theory); Graph; Weight function; Cut; Discrete mathematics; Minimum weight; Algorithm; Segmentation; Computer science; Image segmentation; Artificial intelligence","score_opus":0.03254517234860851,"score_gpt":0.3020471426313973,"score_spread":0.2695019702827888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318303117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005050615,0.000017374156,0.98782444,0.0021290442,0.0046592625,0.00015767888,0.000014306497,0.00006459496,0.00008269521],"genre_scores_gemma":[0.24583553,0.000013239327,0.75352055,0.00019974391,0.00038349905,0.000009202051,0.000009330371,0.0000066986036,0.000022234595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974748,0.000037153204,0.0006421134,0.00030281543,0.0012864554,0.00025665405],"domain_scores_gemma":[0.9958621,0.00028488124,0.00057224004,0.00034260613,0.0028248732,0.0001132727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015873447,0.00012888208,0.00019565006,0.0016470146,0.00025663848,0.00044562216,0.0030295735,0.00003366049,0.00000915595],"category_scores_gemma":[0.00009374308,0.00012230448,0.00023037771,0.0020115105,0.00037165705,0.0018739516,0.00029162545,0.00012852282,0.000010144306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036528494,0.00036383208,0.00044865158,0.00002163788,0.00014233221,0.000022768265,0.00033685195,0.03878653,0.0017585595,0.17740902,0.0022433316,0.7784299],"study_design_scores_gemma":[0.00075606274,0.00040289684,0.005109477,0.00008741727,0.000012672556,0.00006845995,0.000010889862,0.8775856,0.0022849934,0.10700103,0.006524959,0.0001555579],"about_ca_topic_score_codex":0.000009113349,"about_ca_topic_score_gemma":0.0000034310963,"teacher_disagreement_score":0.83879906,"about_ca_system_score_codex":0.000079884485,"about_ca_system_score_gemma":0.00058947876,"threshold_uncertainty_score":0.56297517},"labels":[],"label_agreement":null},{"id":"W4378837733","doi":"10.1142/s0129054123470019","title":"Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hamiltonian path; Control reconfiguration; Hamiltonian (control theory); Transpose; Vertex (graph theory); Mathematics; Combinatorics; Grid; Lattice graph; Cycle basis; Graph; Discrete mathematics; Line graph; Computer science; Geometry; Voltage graph; Physics; Graph power; Quantum mechanics; Mathematical optimization","score_opus":0.017912321683965504,"score_gpt":0.302799428054932,"score_spread":0.2848871063709665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378837733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4495915,0.00002855867,0.54650617,0.0019223364,0.0014955391,0.00008323006,0.0000061382407,0.000027173504,0.00033938003],"genre_scores_gemma":[0.9346809,0.000051035382,0.065136604,0.000034300832,0.00007564604,0.0000025546406,0.0000051039196,0.0000031874793,0.000010665058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810684,0.000038162812,0.0007182201,0.00018539888,0.00081502105,0.00013634353],"domain_scores_gemma":[0.9978483,0.00014692938,0.00058967725,0.00031032992,0.0010490232,0.00005577505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010885607,0.000076275486,0.00016284338,0.0014893283,0.000066857036,0.00014130097,0.0022710548,0.000025561068,0.000008755439],"category_scores_gemma":[0.00010330526,0.00007366545,0.000097209486,0.002056289,0.00024203691,0.0013600353,0.00020626915,0.00009568363,0.000010224494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002274957,0.00049744727,0.0078073884,0.000025281359,0.00009792367,0.000050414557,0.0035590925,0.020625925,0.15475105,0.43310532,0.0010665456,0.37839088],"study_design_scores_gemma":[0.0011331899,0.00027372607,0.36419052,0.0003438453,0.000012919532,0.00026185755,0.00009971369,0.47915903,0.07545712,0.07555842,0.003199407,0.00031022995],"about_ca_topic_score_codex":0.000028643582,"about_ca_topic_score_gemma":0.000015610638,"teacher_disagreement_score":0.4850894,"about_ca_system_score_codex":0.00006652733,"about_ca_system_score_gemma":0.00037025,"threshold_uncertainty_score":0.42202225},"labels":[],"label_agreement":null},{"id":"W4387377762","doi":"10.1142/s0129054123410083","title":"Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Monotone polygon; Streaming algorithm; Time complexity; Set (abstract data type); Ideal (ethics); Algorithm; Function (biology); Computer science; Running time; Approximation algorithm; Integer (computer science); Mathematics; Discrete mathematics; Upper and lower bounds","score_opus":0.046945529046224205,"score_gpt":0.333160625608366,"score_spread":0.28621509656214184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387377762","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021732915,0.0000145404965,0.9722796,0.0022449868,0.003343725,0.00016429259,0.000043252316,0.000076912635,0.00009975456],"genre_scores_gemma":[0.42893183,0.0000129648615,0.57024413,0.00008737522,0.0005936281,0.000009673578,0.000017575805,0.0000086214395,0.00009419388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976048,0.000043524236,0.0007774711,0.00034070117,0.0009278258,0.0003056962],"domain_scores_gemma":[0.99580836,0.000484418,0.00061431085,0.00037927783,0.0025770536,0.00013657563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017449667,0.00015281375,0.0002760355,0.001216769,0.0003660458,0.00042476217,0.0027773231,0.000039804814,0.000011602359],"category_scores_gemma":[0.00025998216,0.00014921234,0.0002810349,0.0015780795,0.00045242702,0.0018631029,0.00052178744,0.00017064193,0.000013977214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000739476,0.00041574397,0.0004227534,0.000039654613,0.00060955784,0.000049341113,0.0021529095,0.046256207,0.030105563,0.06788132,0.0013701234,0.8506229],"study_design_scores_gemma":[0.0006995448,0.00022529713,0.0017050405,0.00007415492,0.000016256032,0.00016370388,0.00005621565,0.9841359,0.002313956,0.008734109,0.0017124244,0.00016338883],"about_ca_topic_score_codex":0.000020532303,"about_ca_topic_score_gemma":0.0000019136364,"teacher_disagreement_score":0.9378797,"about_ca_system_score_codex":0.00011841895,"about_ca_system_score_gemma":0.00060781563,"threshold_uncertainty_score":0.60847026},"labels":[],"label_agreement":null},{"id":"W4390744696","doi":"10.1142/s0129054123020057","title":"Special Issue: Articles Dedicated to the Memory of Magnus Steinby — Preface","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Crafts, Textile, and Design","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Cognitive science; Psychology","score_opus":0.034559884771927084,"score_gpt":0.29568275041471953,"score_spread":0.26112286564279247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390744696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6646878,0.0005624758,0.2058538,0.034257434,0.045164827,0.00048623083,0.00009498421,0.00006946064,0.04882295],"genre_scores_gemma":[0.98865646,0.000012185002,0.0028419155,0.00019294964,0.0072520766,0.0000011432228,9.212291e-7,0.000004590831,0.0010377734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985066,0.000025568674,0.00044452638,0.0001078295,0.0008181313,0.00009731442],"domain_scores_gemma":[0.998307,0.00016220604,0.00018529748,0.00012959668,0.0011598511,0.000056044908],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065568776,0.00006471149,0.000108064225,0.0003971132,0.00012163154,0.000456823,0.00096780964,0.000010413332,0.0012198013],"category_scores_gemma":[0.00007665225,0.000043717922,0.00007261661,0.00018332369,0.00058150286,0.00067126675,0.00010337916,0.00008902467,0.00006310362],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009921423,0.0003107963,0.000056054207,0.00003122253,0.00021981438,0.000033363143,0.06353373,0.005014812,0.0037477054,0.21464556,0.17355128,0.53875643],"study_design_scores_gemma":[0.00034087495,0.00047335358,0.0016993784,0.0003011247,0.000043977994,0.000098561046,0.0012976914,0.015755972,0.0058524176,0.005785806,0.96820277,0.00014804641],"about_ca_topic_score_codex":0.00003747492,"about_ca_topic_score_gemma":0.000060156424,"teacher_disagreement_score":0.7946515,"about_ca_system_score_codex":0.000048323138,"about_ca_system_score_gemma":0.0002963256,"threshold_uncertainty_score":0.9996932},"labels":[],"label_agreement":null},{"id":"W4401198969","doi":"10.1142/s0129054124430019","title":"Repetition Factorization of Automatic Sequences","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Factorization; Repetition (rhetorical device); Computer science; Mathematics; Theoretical computer science; Algorithm; Linguistics","score_opus":0.016683348424025496,"score_gpt":0.3159330991453174,"score_spread":0.2992497507212919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401198969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02278771,0.00011643334,0.97197956,0.0007837436,0.00410703,0.000042975666,0.0000071108525,0.00002797551,0.0001474596],"genre_scores_gemma":[0.7562137,0.000037899852,0.24356207,0.000018536952,0.00015503443,5.4269793e-7,0.0000028029674,0.0000021905084,0.0000071898003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788004,0.00003333685,0.00063818897,0.00018204963,0.001170544,0.00009586766],"domain_scores_gemma":[0.99753845,0.00016317706,0.000477457,0.00024327618,0.0015225746,0.000055069944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856324,0.00007657374,0.00013993324,0.00077614334,0.00006416417,0.0003868375,0.0020088272,0.000023336199,0.000025358237],"category_scores_gemma":[0.000105617786,0.00006158586,0.00008640621,0.0008033937,0.0002406431,0.003667485,0.00027435002,0.00009025944,0.000004918022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007550743,0.0002022466,0.00081693067,0.000071134935,0.000111649824,0.000039509403,0.0016450685,0.007505513,0.030846648,0.3353862,0.0005142347,0.62285334],"study_design_scores_gemma":[0.00020663759,0.00025541813,0.008626707,0.00082267233,0.0000111970085,0.00028191003,0.000018632583,0.9345309,0.01965296,0.033461884,0.0020065627,0.00012450965],"about_ca_topic_score_codex":0.000013330043,"about_ca_topic_score_gemma":6.6393085e-7,"teacher_disagreement_score":0.9270254,"about_ca_system_score_codex":0.00008728619,"about_ca_system_score_gemma":0.00062738586,"threshold_uncertainty_score":0.3732934},"labels":[],"label_agreement":null},{"id":"W4403341864","doi":"10.1142/s0129054124430044","title":"Language Acceptors with a Pushdown: Characterizations and Complexity","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Pushdown automaton; Programming language; Theoretical computer science; Discrete mathematics; Mathematics; Finite-state machine","score_opus":0.024407691971876783,"score_gpt":0.34573292049519483,"score_spread":0.321325228523318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403341864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8774484,0.00018756319,0.11331037,0.0057176934,0.0014941896,0.00007848223,0.000010634074,0.000026823083,0.0017258778],"genre_scores_gemma":[0.98882675,0.000047578276,0.010563589,0.00006746344,0.00040676017,7.063423e-7,0.0000034932834,0.0000022038612,0.00008143354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99896663,0.000030472662,0.00019501982,0.000094420364,0.0006246306,0.0000888363],"domain_scores_gemma":[0.99897254,0.00005736418,0.00013049612,0.00005406079,0.0007197719,0.0000657857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045915626,0.000046322555,0.0000734458,0.0002467098,0.00019031648,0.00040713017,0.0004339883,0.000015770425,0.00011521284],"category_scores_gemma":[0.000069842215,0.00003330052,0.00003294409,0.0004396399,0.00079030386,0.0015334387,0.0000519733,0.00007247846,0.000003882687],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057054946,0.00019870322,0.0041195997,0.000027354621,0.0002228555,0.000096297794,0.1098947,0.0002501843,0.018370174,0.52169156,0.0007167566,0.34435478],"study_design_scores_gemma":[0.0038311037,0.0019953544,0.64786994,0.0035540194,0.0003910656,0.002631447,0.034144957,0.056938276,0.012841191,0.036476295,0.19743024,0.0018960839],"about_ca_topic_score_codex":0.00015881618,"about_ca_topic_score_gemma":0.00011941087,"teacher_disagreement_score":0.64375037,"about_ca_system_score_codex":0.0000843401,"about_ca_system_score_gemma":0.0004203102,"threshold_uncertainty_score":0.39259654},"labels":[],"label_agreement":null},{"id":"W4405697651","doi":"10.1142/s0129054124420061","title":"Compressed Structures for Partial Derivative Automata Constructions","year":2024,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Discrete mathematics; Star (game theory); Expression (computer science); Computer science; Geometry; Mathematical analysis","score_opus":0.019820882502079015,"score_gpt":0.3248887273504064,"score_spread":0.3050678448483274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405697651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02308543,0.00009329598,0.9677165,0.0019964552,0.006801367,0.00009489952,0.000021429425,0.00006263512,0.00012796721],"genre_scores_gemma":[0.6945466,0.000008389559,0.30502456,0.000079686615,0.00032571316,0.0000027119925,0.0000021643395,0.0000038242524,0.000006387508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982677,0.00003182041,0.0005520437,0.00024029265,0.00074603845,0.00016208449],"domain_scores_gemma":[0.9975063,0.00044047396,0.00032000476,0.0002634967,0.001389562,0.000080162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006752704,0.00010633887,0.00016811333,0.000660108,0.00015485816,0.00083046546,0.002570937,0.000026780435,0.000018181765],"category_scores_gemma":[0.00012615915,0.00008940491,0.0001441843,0.0005669706,0.00052712223,0.002297537,0.00028742146,0.000111827496,0.000003480159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011344176,0.000054323064,0.000035671863,0.000011977109,0.000109472625,0.000010298195,0.00062132627,0.0031437685,0.006008257,0.84139436,0.0008087384,0.14779043],"study_design_scores_gemma":[0.0004970052,0.0001858555,0.0015724569,0.00016001209,0.00001693909,0.0005231523,0.000034184774,0.822782,0.019887337,0.14598078,0.00821333,0.00014697047],"about_ca_topic_score_codex":0.0000048303514,"about_ca_topic_score_gemma":6.1823476e-7,"teacher_disagreement_score":0.8196382,"about_ca_system_score_codex":0.000083483406,"about_ca_system_score_gemma":0.0006965889,"threshold_uncertainty_score":0.80081975},"labels":[],"label_agreement":null},{"id":"W4406786949","doi":"10.1142/s0129054125500029","title":"Almost Perfect <i>c</i>-Nonlinear Permutations with Trace Functions over 𝔽2n","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Gansu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"TRACE (psycholinguistics); Mathematics; Nonlinear system; Combinatorics; Discrete mathematics; Physics; Philosophy; Quantum mechanics","score_opus":0.005174225003495601,"score_gpt":0.24993348897042472,"score_spread":0.24475926396692912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406786949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4062769,0.000070587426,0.5890309,0.00024963077,0.0021469975,0.000052988657,0.000010716959,0.000022839082,0.0021384018],"genre_scores_gemma":[0.99033254,0.000011325351,0.0093506295,0.000041360257,0.00015074636,0.0000024692326,0.0000028403465,0.0000054310603,0.00010267484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890167,0.000021639498,0.0003903316,0.000102262595,0.00047546005,0.00010865962],"domain_scores_gemma":[0.9985358,0.000120513425,0.00017794348,0.00014652548,0.0009681944,0.000051004787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038487688,0.00008906268,0.00013166641,0.0006549594,0.0001318683,0.0001474119,0.00063547987,0.000022117396,0.000039536142],"category_scores_gemma":[0.000042251268,0.000075558564,0.00008186593,0.0007276406,0.00026740527,0.00076748943,0.000034156827,0.00013512619,0.000005851857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012838113,0.0004998818,0.011186893,0.00007294554,0.00097521755,0.000035383608,0.0022367078,0.7994343,0.029019637,0.08777952,0.003188089,0.065443054],"study_design_scores_gemma":[0.004898443,0.0010167462,0.13341722,0.0018396167,0.00032338843,0.0016249367,0.0011597658,0.72980446,0.024635766,0.011042715,0.08924931,0.0009876246],"about_ca_topic_score_codex":0.0000043380023,"about_ca_topic_score_gemma":0.0000070404362,"teacher_disagreement_score":0.5840556,"about_ca_system_score_codex":0.00008535329,"about_ca_system_score_gemma":0.0002544313,"threshold_uncertainty_score":0.30811888},"labels":[],"label_agreement":null},{"id":"W4409442370","doi":"10.1142/s0129054125430026","title":"Language Quotients Revisited","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Quotient; Mathematics; Computer science; Linguistics; Programming language; Pure mathematics; Discrete mathematics; Philosophy","score_opus":0.008207469668431198,"score_gpt":0.3085720398270894,"score_spread":0.3003645701586582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409442370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07902198,0.00009627231,0.9156285,0.0014294196,0.0025228905,0.000037753645,0.0000018028287,0.000019347912,0.0012420593],"genre_scores_gemma":[0.8514156,0.000012525389,0.14801419,0.00040100224,0.000096982236,4.4285517e-7,7.903005e-7,0.0000015751563,0.00005693067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984853,0.00003423764,0.00047473828,0.00016012877,0.0007267561,0.000118785014],"domain_scores_gemma":[0.99776936,0.00013554058,0.00039353504,0.0003165691,0.0013343696,0.0000506571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000882873,0.00007146635,0.00013720687,0.00087581703,0.00008221769,0.0003146542,0.003540557,0.000018006023,0.000013820519],"category_scores_gemma":[0.00015372824,0.00006157215,0.00008933757,0.0009295407,0.00021185225,0.0014912816,0.00046539525,0.00009187892,0.0000070628353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014685316,0.00023595808,0.0014217235,0.000010402388,0.00009969488,0.000028528779,0.0011510194,0.0008928959,0.0131613305,0.5860351,0.0015489658,0.39539975],"study_design_scores_gemma":[0.0041175443,0.00066438026,0.12020283,0.002023637,0.00006301277,0.00072245876,0.00027544223,0.5864124,0.10663881,0.1560001,0.022103125,0.0007763251],"about_ca_topic_score_codex":0.000006430519,"about_ca_topic_score_gemma":4.884283e-7,"teacher_disagreement_score":0.7723936,"about_ca_system_score_codex":0.00008484392,"about_ca_system_score_gemma":0.00040275292,"threshold_uncertainty_score":0.6579295},"labels":[],"label_agreement":null},{"id":"W4409898124","doi":"10.1142/s0129054125500054","title":"Efficiently Enumerating Spanning Trees of <i>k</i> -Trees","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Bangladesh University of Engineering and Technology","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum degree spanning tree; Weight-balanced tree; Tree (set theory); Discrete mathematics; Trémaux tree; Graph; Binary tree; Binary search tree; Line graph; Pathwidth","score_opus":0.017781280910574723,"score_gpt":0.3485295082599452,"score_spread":0.3307482273493705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409898124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09611526,0.00011368211,0.9004197,0.00095396757,0.0015489968,0.000058686088,0.000002031245,0.000012302046,0.0007753877],"genre_scores_gemma":[0.75025916,0.000011640022,0.24956697,0.000067768684,0.00005941514,8.444605e-7,3.638898e-7,0.0000022723882,0.00003153004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974107,0.000071488415,0.0007727151,0.00022947439,0.0013169431,0.00019863466],"domain_scores_gemma":[0.9952984,0.00049182517,0.0006938919,0.00036836282,0.003079068,0.00006848068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015935902,0.000102034566,0.00022220596,0.0015014063,0.00015753346,0.00025882284,0.004229794,0.000023263165,0.000006711785],"category_scores_gemma":[0.00042873583,0.00009236283,0.00013292811,0.0016622613,0.00066178857,0.0017647913,0.00070368533,0.0001716996,0.0000019423164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004227172,0.00032669978,0.005036994,0.000015030221,0.00013366321,0.000016298067,0.0011986736,0.077183284,0.057006367,0.5618893,0.00017930272,0.29697216],"study_design_scores_gemma":[0.0019874962,0.00069635926,0.047680993,0.0012232456,0.00002681608,0.00021073023,0.00017851162,0.6472641,0.1933834,0.1045153,0.0024511917,0.0003818225],"about_ca_topic_score_codex":0.0000070255473,"about_ca_topic_score_gemma":0.0000052198106,"teacher_disagreement_score":0.6541439,"about_ca_system_score_codex":0.000091135196,"about_ca_system_score_gemma":0.00074998004,"threshold_uncertainty_score":0.78600794},"labels":[],"label_agreement":null},{"id":"W4413382085","doi":"10.1142/s0129054125400040","title":"Note on Two-Stage BP Maximization","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Stage (stratigraphy); Maximization; Mathematics; Computer science; Combinatorics; Mathematical economics; Mathematical optimization; Biology","score_opus":0.008774879941117864,"score_gpt":0.2911984750217288,"score_spread":0.28242359508061093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413382085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0560607,0.00002045068,0.9326001,0.00053263386,0.005984,0.000048534996,0.0000030539338,0.000026395033,0.004724138],"genre_scores_gemma":[0.9932375,0.000009236906,0.00634662,0.00013352436,0.00016078416,0.0000010594301,7.4730144e-7,0.0000031499694,0.00010739166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900997,0.000013773382,0.00036945284,0.00007280553,0.00046012932,0.0000738741],"domain_scores_gemma":[0.9989942,0.00006433444,0.00013694614,0.0001088613,0.0006629505,0.000032726497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032478958,0.00005934404,0.00009870326,0.0006610095,0.00005273574,0.00012752488,0.0005580656,0.000016517046,0.000020092391],"category_scores_gemma":[0.000052848405,0.00005529213,0.00005883729,0.0003883771,0.00008094713,0.00041110176,0.000029181298,0.00008801744,0.000008698031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026385933,0.00004849623,0.00021150947,0.000008749544,0.00006408434,0.000004177522,0.0001430687,0.86090356,0.010954743,0.022362325,0.00046082324,0.104812056],"study_design_scores_gemma":[0.0007526928,0.00006151726,0.0024001328,0.000131147,0.000006647341,0.000022936405,0.000014029029,0.9711615,0.009047782,0.00080241944,0.015529286,0.00006992615],"about_ca_topic_score_codex":0.000006252746,"about_ca_topic_score_gemma":0.000004792528,"teacher_disagreement_score":0.93717676,"about_ca_system_score_codex":0.00014619384,"about_ca_system_score_gemma":0.00012061047,"threshold_uncertainty_score":0.22547476},"labels":[],"label_agreement":null}]}