{"meta":{"query_hash":"b418dfbd2b2b","filters":{"venue":"Theoretical Computer Science"},"cohort_total":797,"direct_labels_cover":0,"predictions_cover":797,"exported":797,"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/b418dfbd2b2b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Theoretical+Computer+Science"},"results":[{"id":"W1051752637","doi":"10.1016/j.tcs.2015.07.033","title":"Efficient operations on discrete paths","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear space; Intersection (aeronautics); Time complexity; Convex hull; Discrete geometry; Quadtree; Jordan curve theorem; Combinatorics; Intersection graph; Graph; Data structure; Discrete mathematics; Regular polygon; Algorithm; Computer science; Geometry; Line graph","score_opus":0.018063704667419335,"score_gpt":0.2739309740895367,"score_spread":0.25586726942211735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1051752637","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.066584885,0.000013773416,0.9256225,0.0018901221,0.0010460356,0.00014301843,0.0000014529148,0.00016739381,0.004530804],"genre_scores_gemma":[0.8384652,4.014354e-7,0.16040133,0.0009117923,0.00018201252,0.000007766456,0.0000018199191,0.000004082417,0.00002560226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976985,0.000105875835,0.00021977568,0.00061848166,0.0009813438,0.0003760561],"domain_scores_gemma":[0.99845713,0.00012764435,0.000027955362,0.0006165391,0.00034349563,0.00042726094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386469,0.00014751378,0.00012546452,0.00023416609,0.00041924592,0.0005445132,0.0013469375,0.000032222695,0.000013876389],"category_scores_gemma":[0.00016931671,0.000116724674,0.000045716963,0.0014107388,0.0007467245,0.00027163152,0.00056592573,0.00013430277,0.00029125687],"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.0000034826555,0.000047486086,0.000002630929,6.142227e-7,0.0000010367239,0.00000397943,0.00026078068,0.27355322,0.00014135594,0.71568066,0.00007931576,0.0102253985],"study_design_scores_gemma":[0.00021689727,0.0003001456,0.00021158584,0.000009432175,0.0000016816437,0.000020714107,0.0000051677707,0.950102,0.0024346889,0.046300486,0.00023425874,0.0001629952],"about_ca_topic_score_codex":0.000001920101,"about_ca_topic_score_gemma":3.0437164e-7,"teacher_disagreement_score":0.7718803,"about_ca_system_score_codex":0.00009155711,"about_ca_system_score_gemma":0.00029303713,"threshold_uncertainty_score":0.5250754},"labels":[],"label_agreement":null},{"id":"W1093958314","doi":"10.1016/j.tcs.2015.07.009","title":"Improved algorithms for computing minmax regret sinks on dynamic path and tree networks","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regret; Minimax; Sink (geography); Vertex (graph theory); Computer science; Algorithm; Path (computing); Time complexity; Mathematical optimization; Mathematics; Graph; Combinatorics; Theoretical computer science; Computer network","score_opus":0.023975796748059622,"score_gpt":0.25654134736209067,"score_spread":0.23256555061403106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1093958314","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.048930664,0.000022244441,0.9446347,0.0016618059,0.0011360198,0.00043307088,0.0000012319243,0.00014168,0.0030385794],"genre_scores_gemma":[0.98378503,0.0000022028241,0.013506171,0.002247577,0.0003971973,0.000008059496,0.00000942151,0.000010731813,0.0000335782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847996,0.000013344859,0.00024152758,0.00051993004,0.0003185385,0.00042669012],"domain_scores_gemma":[0.9992888,0.00005177414,0.00005284307,0.0003085957,0.00023399471,0.000063967156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013112599,0.00017074693,0.00016838645,0.00014947302,0.0003183911,0.00040116865,0.0004694359,0.00004422609,0.000013701525],"category_scores_gemma":[0.00012936162,0.00014110105,0.000042106847,0.0004911694,0.00081084477,0.00039942923,0.00045294475,0.00010859242,0.000025214713],"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.0000545976,0.0000730078,0.00007995714,0.000043702137,0.0000062220133,0.0000015141961,0.00009789853,0.0050321138,0.000016936727,0.76420754,0.0007023531,0.22968417],"study_design_scores_gemma":[0.00046856148,0.000089419205,0.0007869564,0.000025573532,0.000012056936,7.910633e-7,0.000041646384,0.9801331,0.0000051968545,0.017063119,0.0011830869,0.00019050496],"about_ca_topic_score_codex":0.00002864215,"about_ca_topic_score_gemma":0.0000086259415,"teacher_disagreement_score":0.975101,"about_ca_system_score_codex":0.0000446114,"about_ca_system_score_gemma":0.000021012958,"threshold_uncertainty_score":0.5753933},"labels":[],"label_agreement":null},{"id":"W1201605537","doi":"10.1016/j.tcs.2015.08.008","title":"FM-index of alignment: A compressed index for similar strings","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Information and Communications Technology Promotion; Ministry of Education, Science and Technology; Ministère des Affaires Etrangères; Providence Health Care; Ministry of Science, ICT and Future Planning; National Research Foundation of Korea","keywords":"Suffix; Index (typography); Suffix array; Computer science; Compressed suffix array; Inverted index; Suffix tree; Algorithm; Search engine indexing; Mathematics; Artificial intelligence; Data structure","score_opus":0.02091421018035305,"score_gpt":0.2700424881084069,"score_spread":0.24912827792805387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1201605537","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.007787489,0.000036809444,0.9898665,0.00049113756,0.00061014964,0.00033005353,0.000013128142,0.00013086162,0.0007338511],"genre_scores_gemma":[0.806307,0.0000013862413,0.19330385,0.00026443248,0.00009903347,0.000008268126,0.0000022516892,0.000007825992,0.00000590971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705774,0.00007252324,0.00040602207,0.00076141674,0.0011098565,0.00059243845],"domain_scores_gemma":[0.9975021,0.00027822517,0.00015624655,0.0011215643,0.00046759725,0.00047430064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016156136,0.00021528383,0.0003273181,0.0001983556,0.00022637294,0.0002880437,0.0035169595,0.0000715066,0.000010050405],"category_scores_gemma":[0.00011407591,0.0001718092,0.0000846303,0.00082630134,0.0015808959,0.0009196678,0.002028946,0.0001380351,0.000010407293],"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.00004059156,0.00012873887,0.00014802054,0.000016376722,0.000006720881,0.000004713175,0.00041015356,0.001660671,0.00049672736,0.9593083,0.0005252641,0.03725371],"study_design_scores_gemma":[0.000775897,0.0002798424,0.00041381828,0.000036778918,0.00000407338,0.000010127116,0.0000109295515,0.83136344,0.0074279266,0.15851438,0.00096359185,0.00019920821],"about_ca_topic_score_codex":0.0000115472785,"about_ca_topic_score_gemma":2.8654466e-7,"teacher_disagreement_score":0.82970273,"about_ca_system_score_codex":0.000059934686,"about_ca_system_score_gemma":0.00021684605,"threshold_uncertainty_score":0.7006176},"labels":[],"label_agreement":null},{"id":"W1484474385","doi":"10.1016/j.tcs.2015.08.010","title":"Limit behaviour of μ-equicontinuous cellular automata","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Equicontinuity; Ergodic theory; Limit (mathematics); Mathematics; Measure (data warehouse); Cellular automaton; Bernoulli's principle; Sequence (biology); Discrete mathematics; Uniform limit theorem; Pure mathematics; Mathematical analysis; Computer science; Algorithm; Physics; Data mining","score_opus":0.017775764243146655,"score_gpt":0.25038534269210844,"score_spread":0.2326095784489618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484474385","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.19942874,0.00003261407,0.79574686,0.00055685337,0.00030940998,0.00014380987,0.0000018333594,0.00027706177,0.0035028264],"genre_scores_gemma":[0.872839,0.0000011231183,0.12694803,0.00011936426,0.000056124903,0.000007607008,0.0000015790501,0.0000070693495,0.0000201457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976431,0.000050619543,0.0003531745,0.00061806897,0.00086713856,0.00046789998],"domain_scores_gemma":[0.99758077,0.000092743794,0.00011134336,0.0014753841,0.00031283,0.0004269161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014198017,0.00016232274,0.00023564421,0.0001726513,0.00016276448,0.00022824822,0.0035824387,0.000052938773,0.000015949492],"category_scores_gemma":[0.00006696197,0.00014023205,0.00007545628,0.0012491593,0.001888711,0.0005041048,0.001558617,0.00013500023,0.00014049107],"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.000001964079,0.00012898131,0.00016171634,0.0000036991448,0.0000021397889,0.0000104647015,0.00041527787,0.000039243994,0.0026848572,0.9861963,0.00017146458,0.01018394],"study_design_scores_gemma":[0.0004698549,0.00030617265,0.0014540096,0.000022882874,0.000012327303,0.000057345598,0.00001439117,0.75894773,0.074735954,0.16319594,0.0004568256,0.0003265454],"about_ca_topic_score_codex":0.000007875199,"about_ca_topic_score_gemma":2.5673862e-7,"teacher_disagreement_score":0.8230003,"about_ca_system_score_codex":0.00004521465,"about_ca_system_score_gemma":0.00024478073,"threshold_uncertainty_score":0.6959035},"labels":[],"label_agreement":null},{"id":"W1484691446","doi":"10.1016/j.tcs.2016.08.016","title":"The complexity of dominating set reconfiguration","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Dominating set; Mathematics; Discrete mathematics; Bipartite graph; Vertex (graph theory); Bounded function; Time complexity; Sequence (biology); Existential quantification; Maximal independent set; Split graph; Pathwidth; Graph; Line graph","score_opus":0.04426428454903826,"score_gpt":0.31935977987283914,"score_spread":0.2750954953238009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484691446","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.02336185,0.000015018659,0.9692996,0.004288799,0.0002889384,0.00015554248,0.0000020316027,0.00007958104,0.002508594],"genre_scores_gemma":[0.9195939,0.0000069187313,0.08026369,0.00006498636,0.000042034084,0.000006139303,1.0395656e-7,0.0000042384268,0.000018007371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759763,0.00027211936,0.00032005366,0.0004830846,0.0007888245,0.00053826725],"domain_scores_gemma":[0.9967221,0.0015569959,0.000121585785,0.001043247,0.0003990272,0.00015703475],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0038323998,0.000117634336,0.00014849224,0.00011888388,0.00070780393,0.00020227164,0.0034440698,0.000028058608,0.00002319916],"category_scores_gemma":[0.0005431488,0.000058353868,0.00005717654,0.001031274,0.015136472,0.00077871466,0.0009921949,0.00011655215,0.000038927024],"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.000009993165,0.000009516185,0.000016849759,0.0000019610377,0.0000017008581,0.0000010373748,0.00017499612,0.000004613526,0.008526814,0.8315347,0.0000107489395,0.15970708],"study_design_scores_gemma":[0.00017800448,0.00013450306,0.0005584643,0.000028778171,7.8964996e-7,0.000013805053,0.000009565657,0.07089428,0.056275997,0.87172824,0.00007937582,0.000098199016],"about_ca_topic_score_codex":9.642398e-7,"about_ca_topic_score_gemma":9.828897e-7,"teacher_disagreement_score":0.896232,"about_ca_system_score_codex":0.000053458956,"about_ca_system_score_gemma":0.0001084955,"threshold_uncertainty_score":0.98754376},"labels":[],"label_agreement":null},{"id":"W1521364747","doi":"10.1016/j.tcs.2005.03.055","title":"Resource bounded immunity and simplicity","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Simplicity; Immunity; Bounded function; Simple (philosophy); Computer science; Mathematics; Immune system; Biology; Immunology; Epistemology; Philosophy; Mathematical analysis","score_opus":0.007459870606219056,"score_gpt":0.22743826371698556,"score_spread":0.2199783931107665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521364747","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.58352834,0.00004482403,0.40460387,0.0003423705,0.00005351613,0.000112405796,0.0000010609144,0.00028373208,0.011029883],"genre_scores_gemma":[0.98826283,0.00000177852,0.011517511,0.000100297264,0.00009721441,0.000006082923,4.3681752e-7,0.000008272034,0.000005553999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923795,0.00002474262,0.0001534114,0.00017040028,0.00016417872,0.0002493215],"domain_scores_gemma":[0.99938446,0.000082434985,0.000011883033,0.00037488117,0.000033338103,0.00011299403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005178813,0.00008413622,0.00009540486,0.000051774874,0.00031378423,0.00011827139,0.0003704377,0.00002844996,0.00002284666],"category_scores_gemma":[0.000019578594,0.000077693854,0.000015442009,0.0003070563,0.0015093334,0.00015540807,0.00019699807,0.00013018472,0.00007322883],"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.0000014076234,0.00001237229,0.000022480053,0.0000049167575,0.0000021645087,2.3652896e-7,0.00041893058,0.0014267705,0.008458331,0.9508291,0.00009246624,0.038730845],"study_design_scores_gemma":[0.00009252784,0.000027364438,0.0030121948,0.000011916353,0.0000041253666,0.00002181882,0.000020805228,0.9381249,0.017506292,0.03209777,0.0088756345,0.00020467622],"about_ca_topic_score_codex":0.000004753965,"about_ca_topic_score_gemma":0.0000019935235,"teacher_disagreement_score":0.9366981,"about_ca_system_score_codex":0.00004583909,"about_ca_system_score_gemma":0.0000111632,"threshold_uncertainty_score":0.55612016},"labels":[],"label_agreement":null},{"id":"W1532642937","doi":"10.1016/j.tcs.2009.07.049","title":"On NFAs where all states are final, initial, or both","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nondeterministic algorithm; Automaton; Nondeterministic finite automaton; Finite-state machine; Regular language; Computer science; Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Programming language; Automata theory","score_opus":0.024796216736811667,"score_gpt":0.2909578726236236,"score_spread":0.26616165588681195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532642937","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.073281534,0.00006987732,0.9152896,0.0066957134,0.00060838007,0.00019899009,0.0000046591485,0.00060272915,0.0032485523],"genre_scores_gemma":[0.93659395,0.0000227073,0.05231048,0.010864838,0.00015132318,0.0000040648033,0.0000011689117,0.00000971442,0.000041752133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679923,0.00014606283,0.00032970903,0.00097341405,0.00089086907,0.00086069515],"domain_scores_gemma":[0.99763215,0.0005528256,0.000115783805,0.001200713,0.00011684036,0.00038168495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252354,0.00030062185,0.00030516167,0.00021166363,0.00041549414,0.0009111338,0.0035552077,0.00007172767,0.00018591998],"category_scores_gemma":[0.000103845494,0.00020684524,0.00008423516,0.0010460089,0.0015396642,0.00085605175,0.0006061164,0.00028897883,0.00020539305],"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.000035264708,0.0001506566,0.0000046000737,0.000005201363,0.000003295105,0.00011742518,0.00035592867,0.00020173375,0.00012993475,0.9420714,0.0017568935,0.05516767],"study_design_scores_gemma":[0.00035951324,0.0012425308,0.00078639167,0.000122023484,0.0000045051875,0.000079469144,0.000016046492,0.3579614,0.0020168473,0.6362441,0.0007775985,0.0003895806],"about_ca_topic_score_codex":0.0000024675453,"about_ca_topic_score_gemma":0.0000010002318,"teacher_disagreement_score":0.8633124,"about_ca_system_score_codex":0.000066205874,"about_ca_system_score_gemma":0.00013474234,"threshold_uncertainty_score":0.87860835},"labels":[],"label_agreement":null},{"id":"W1541587921","doi":"10.1016/j.tcs.2015.06.056","title":"Indeterminate strings, prefix arrays &amp; undirected graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); String (physics); Prefix; Indeterminate; Alphabet; Discrete mathematics; Graph; Upper and lower bounds; Computer science","score_opus":0.025247949617459544,"score_gpt":0.26912634536172153,"score_spread":0.24387839574426198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541587921","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.04111393,0.000037565827,0.9532031,0.0003417902,0.001112352,0.0001552638,0.0000030871213,0.00046845505,0.003564452],"genre_scores_gemma":[0.67046016,0.0000031604334,0.32914847,0.0002589221,0.000090012974,0.0000056640188,0.000002964875,0.000008012797,0.00002265541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667484,0.00013953073,0.0003179729,0.00096990855,0.0011557029,0.00074202],"domain_scores_gemma":[0.9972315,0.00014356029,0.0001026566,0.0014399048,0.00035297842,0.0007294178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016200452,0.0002501345,0.00025312733,0.00028601347,0.00038460814,0.0007768405,0.0039145937,0.0000769871,0.0000208582],"category_scores_gemma":[0.00014697798,0.00019449115,0.00006406356,0.0017360129,0.0017787224,0.0014674524,0.0025535098,0.00028428965,0.0001918754],"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.000008965918,0.00007087536,0.00010877055,0.0000033768392,0.000003241734,0.000016572227,0.00046748863,0.00012373483,0.0003878469,0.9391414,0.00050852954,0.059159227],"study_design_scores_gemma":[0.00053979136,0.00026688277,0.0011761282,0.0000565383,0.000005703855,0.00010043481,0.0000065007716,0.5634215,0.0034753794,0.42692167,0.003535789,0.0004937006],"about_ca_topic_score_codex":0.000012198277,"about_ca_topic_score_gemma":0.0000012930961,"teacher_disagreement_score":0.6293462,"about_ca_system_score_codex":0.00008156509,"about_ca_system_score_gemma":0.00025237235,"threshold_uncertainty_score":0.79311186},"labels":[],"label_agreement":null},{"id":"W1580076017","doi":"10.1016/s0304-3975(01)00395-4","title":"Sense of direction in distributed computing","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"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":"Computability; Computer science; Property (philosophy); Theoretical computer science; Graph; Object (grammar); Data science; Epistemology; Artificial intelligence","score_opus":0.010645526194863385,"score_gpt":0.23267844186754535,"score_spread":0.22203291567268196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580076017","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.10831862,0.000047449972,0.88808256,0.00032457508,0.0004952171,0.000118648495,0.000005578108,0.00011895791,0.0024883754],"genre_scores_gemma":[0.9765786,0.00000382901,0.023275845,0.00007895333,0.00005137782,0.0000016934388,0.0000010176182,0.0000041362114,0.000004536947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978043,0.0001174005,0.00045496502,0.0005649414,0.0005654837,0.00049293134],"domain_scores_gemma":[0.9987551,0.00017430866,0.000118902564,0.0006262002,0.00017281805,0.00015267462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011441233,0.00014927951,0.00027619395,0.00019511668,0.00015958761,0.00016467947,0.00089271954,0.00005166391,0.000020879996],"category_scores_gemma":[0.00008603558,0.00013111661,0.000058346697,0.0023346825,0.0010924311,0.000485053,0.00047750017,0.00017037908,0.000031923602],"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.0000027042518,0.00013164023,0.00039830717,0.000013344236,0.0000022000959,0.0000350446,0.00049385277,0.0014353475,0.0006615291,0.95580643,0.000084583175,0.040935006],"study_design_scores_gemma":[0.00026996376,0.000083824154,0.007249863,0.000073518924,0.0000012025993,0.00006922077,0.000006029456,0.9841682,0.0012468377,0.0065009585,0.00016667729,0.00016370231],"about_ca_topic_score_codex":0.000012906839,"about_ca_topic_score_gemma":0.0000010777492,"teacher_disagreement_score":0.98273283,"about_ca_system_score_codex":0.000070482834,"about_ca_system_score_gemma":0.000024177425,"threshold_uncertainty_score":0.534678},"labels":[],"label_agreement":null},{"id":"W1584364430","doi":"10.1016/j.tcs.2015.04.037","title":"The interval constrained 3-coloring problem","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundacja na rzecz Nauki Polskiej","keywords":"Interval (graph theory); Mathematics; Combinatorics; Time complexity; Discrete mathematics","score_opus":0.031286921797765155,"score_gpt":0.30748014581150407,"score_spread":0.2761932240137389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584364430","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.008566035,0.000045251225,0.9730824,0.0028690023,0.00068621244,0.0002636313,4.864547e-7,0.00028528483,0.014201691],"genre_scores_gemma":[0.8150383,0.0000026365217,0.1845812,0.00022516552,0.00009275796,0.000017802435,1.2508936e-7,0.0000071950603,0.00003478185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996588,0.00025079132,0.00029967254,0.00069268723,0.0011947246,0.0009741226],"domain_scores_gemma":[0.99699086,0.00072390353,0.00006596711,0.0011346189,0.0004834391,0.00060118205],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0057018613,0.00018153794,0.00017259177,0.00015140782,0.00084354,0.0010294656,0.005694907,0.00003789244,0.0000062963654],"category_scores_gemma":[0.0004090553,0.000114384726,0.00006529785,0.0017082635,0.008509192,0.0009643737,0.0027658714,0.00035424592,0.00013696877],"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.000016118098,0.0000206337,0.000024715211,0.0000017282313,0.000003227045,0.000013678731,0.00042790076,0.00014519769,0.0001767911,0.9313487,0.000056601617,0.067764744],"study_design_scores_gemma":[0.0002455174,0.00026843173,0.000050670948,0.000014081442,0.0000011409837,0.0000692914,0.000031300304,0.26899225,0.0019946122,0.72735184,0.00082698534,0.00015389927],"about_ca_topic_score_codex":0.0000015455561,"about_ca_topic_score_gemma":8.4838393e-7,"teacher_disagreement_score":0.8064723,"about_ca_system_score_codex":0.00011970535,"about_ca_system_score_gemma":0.00039128205,"threshold_uncertainty_score":0.99968475},"labels":[],"label_agreement":null},{"id":"W1592957478","doi":"10.1016/j.tcs.2009.02.006","title":"Periodicity, repetitions, and orbits of an automatic sequence","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"","keywords":"Decidability; Sequence (biology); Mathematics; Lexicographical order; Simple (philosophy); Quotient; Closure (psychology); Combinatorics; Discrete mathematics","score_opus":0.010897308510883006,"score_gpt":0.2616924037423216,"score_spread":0.2507950952314386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592957478","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.5447168,0.000034778306,0.45308575,0.00079302833,0.000112318005,0.00009210124,0.0000015544645,0.00022152699,0.0009421636],"genre_scores_gemma":[0.7992152,0.000005021388,0.2000561,0.00068459904,0.00003238347,0.0000014140148,4.968316e-7,0.000002881683,0.000001928014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980543,0.00011409138,0.00029745733,0.0006061535,0.0005436991,0.00038425],"domain_scores_gemma":[0.9984839,0.0001371258,0.00008822846,0.00089545303,0.00012884442,0.00026647717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001408421,0.00015337752,0.00022551404,0.00017570012,0.00030882104,0.00034154594,0.0018340951,0.00004264034,0.000026194697],"category_scores_gemma":[0.00008138558,0.0001251654,0.000036321417,0.0008273093,0.0026053623,0.001164846,0.00046473293,0.00012412516,0.000010727647],"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.0000014108455,0.00005512064,0.000014626032,0.000005507811,9.0272704e-7,0.000011085396,0.00037822325,0.0000081046555,0.0042655207,0.8477492,0.0000040123896,0.14750633],"study_design_scores_gemma":[0.00011213693,0.0004118939,0.0043580416,0.000048068203,0.0000027913063,0.00015372733,0.00000792835,0.5983232,0.0053606876,0.3910698,0.000007994084,0.00014373829],"about_ca_topic_score_codex":0.0000032768135,"about_ca_topic_score_gemma":2.2998587e-7,"teacher_disagreement_score":0.5983151,"about_ca_system_score_codex":0.000024790184,"about_ca_system_score_gemma":0.000104716564,"threshold_uncertainty_score":0.9599566},"labels":[],"label_agreement":null},{"id":"W1603144785","doi":"10.1016/j.tcs.2009.09.008","title":"A new linear time algorithm to compute the genomic distance via the double cut and join distance","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"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":"Bundesministerium für Bildung und Forschung; Alexander von Humboldt-Stiftung","keywords":"Join (topology); Algorithm; Edit distance; Simple (philosophy); Computer science; Time complexity; Genome; Tree (set theory); Mathematics; Combinatorics; Biology; Genetics","score_opus":0.005246742315466484,"score_gpt":0.2288864844595042,"score_spread":0.22363974214403773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603144785","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.036693618,0.00029269088,0.9579825,0.003919294,0.00014988834,0.0003849361,0.000005057766,0.000023697809,0.0005483337],"genre_scores_gemma":[0.87088305,0.000031631724,0.12562838,0.0023814524,0.0007026976,0.0000072391304,0.0000063974344,0.000015814037,0.00034335552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840164,0.000055303713,0.00018731585,0.0005738956,0.00032194637,0.00045992457],"domain_scores_gemma":[0.9989237,0.000030621693,0.000046409725,0.0006843881,0.000076637334,0.00023824726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000655079,0.00019130396,0.00015387546,0.00003008409,0.00039988136,0.00018621604,0.0011123583,0.000044736003,0.000018156516],"category_scores_gemma":[0.000011927278,0.00011381205,0.000051789528,0.0003513922,0.001079267,0.000010366101,0.0005036612,0.00012953857,0.00006555853],"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.0002489899,0.00013170061,0.00006968416,0.000009968219,0.000049328024,0.000015195387,0.0010750323,0.0013096292,0.1644535,0.21985547,0.0032459374,0.6095356],"study_design_scores_gemma":[0.0025797877,0.002530795,0.010716347,0.000069732116,0.00007100099,0.0002381806,0.000033995297,0.7986152,0.05214871,0.053565647,0.07795575,0.0014748515],"about_ca_topic_score_codex":0.0000045378297,"about_ca_topic_score_gemma":0.0000022908441,"teacher_disagreement_score":0.8341894,"about_ca_system_score_codex":0.00002399731,"about_ca_system_score_gemma":0.0000712475,"threshold_uncertainty_score":0.46411207},"labels":[],"label_agreement":null},{"id":"W1607134907","doi":"10.1016/s0304-3975(02)00364-x","title":"A new logic for electronic commerce protocols","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":39,"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é Laval; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Atomicity; Programming language; Modal logic; Theoretical computer science; Anonymity; TRACE (psycholinguistics); Secrecy; Modular design; Protocol (science); Semantics (computer science); Modal; Computer security; Database transaction","score_opus":0.030027469508678534,"score_gpt":0.32201351239564024,"score_spread":0.2919860428869617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607134907","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.000045691828,0.000013036272,0.972841,0.0035397068,0.000111741,0.02140972,0.0000010517869,0.0003611393,0.0016769164],"genre_scores_gemma":[0.4027894,0.0000010179916,0.5859443,0.0015407174,0.00013163369,0.0094858,4.109601e-7,0.000012305454,0.00009440873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701566,0.00008201546,0.0003460543,0.0009240666,0.0006159329,0.001016304],"domain_scores_gemma":[0.99770147,0.00029615048,0.000118026925,0.0012737733,0.00023154714,0.00037903344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009967447,0.0002239909,0.0002453601,0.00013954741,0.00048109397,0.0004830148,0.0040042913,0.000058242353,0.00016595134],"category_scores_gemma":[0.00016055972,0.00019103572,0.0000946481,0.001169271,0.001099317,0.00095607986,0.0008010546,0.00023694492,0.00020072047],"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.0000055853434,0.00008055803,0.000006505625,0.0000093489125,0.0000019410131,8.5517195e-7,0.0002633235,0.000033432647,0.00021302668,0.9238177,0.00017483046,0.07539287],"study_design_scores_gemma":[0.00034772608,0.00032584305,0.00002687187,0.000015797252,0.000001482201,0.000015149072,0.0000010684086,0.42180157,0.0015573102,0.5736064,0.002136447,0.00016436928],"about_ca_topic_score_codex":6.2363296e-7,"about_ca_topic_score_gemma":3.0532098e-7,"teacher_disagreement_score":0.42176813,"about_ca_system_score_codex":0.00012929464,"about_ca_system_score_gemma":0.00015545228,"threshold_uncertainty_score":0.7790211},"labels":[],"label_agreement":null},{"id":"W1625693084","doi":"10.1016/j.tcs.2016.05.005","title":"Correlation bounds and #SAT algorithms for small linear-size circuits","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Mathematics; Correlation; Electronic circuit; Computer science","score_opus":0.013558984464381517,"score_gpt":0.24609904038473077,"score_spread":0.23254005592034924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625693084","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.041797217,0.000041082818,0.9538607,0.002583791,0.0009922995,0.0002497806,0.000004806155,0.00025922726,0.00021108058],"genre_scores_gemma":[0.6611784,0.0000035481085,0.3381028,0.0003839908,0.00027099386,0.000007682361,3.964869e-7,0.000009539018,0.00004269353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758714,0.0000740213,0.00028867376,0.0009457599,0.000427932,0.0006764487],"domain_scores_gemma":[0.9973297,0.001410742,0.00008901425,0.00062548235,0.00022444592,0.00032057372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014242582,0.00022706843,0.0002301941,0.00012708317,0.00061765703,0.00038316174,0.0014780303,0.000076204946,0.000006894026],"category_scores_gemma":[0.00030095346,0.00014535862,0.00007327823,0.0005966996,0.001905837,0.00039067207,0.0008366224,0.00013985277,0.000021460508],"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.0000033939107,0.000021830629,0.000053509466,0.0000062777635,0.0000031482289,0.0000031724537,0.00022311676,0.00015001341,0.0005270411,0.57032746,0.00001698338,0.42866403],"study_design_scores_gemma":[0.00045249864,0.0003038316,0.0014035505,0.000055298715,0.000004081414,0.0000710862,0.00000126146,0.79935217,0.00084406696,0.19696642,0.00031268166,0.00023306404],"about_ca_topic_score_codex":0.0000013411722,"about_ca_topic_score_gemma":3.22155e-7,"teacher_disagreement_score":0.79920214,"about_ca_system_score_codex":0.00004473171,"about_ca_system_score_gemma":0.00012212445,"threshold_uncertainty_score":0.7022136},"labels":[],"label_agreement":null},{"id":"W1644292110","doi":"10.1016/j.tcs.2008.11.001","title":"A new characteristic property of rich words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":37,"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":"Palindrome; Suffix; Property (philosophy); Prefix; Class (philosophy); Combinatorics; Mathematics; Pure mathematics; Computer science; Linguistics; Philosophy; Artificial intelligence; Biology","score_opus":0.01267596089827406,"score_gpt":0.22429627106657327,"score_spread":0.2116203101682992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644292110","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.10740822,0.00002588669,0.8887289,0.00062407576,0.000449101,0.00011645113,8.5804885e-7,0.00019241712,0.002454104],"genre_scores_gemma":[0.8123718,0.000006372523,0.18701732,0.00039712765,0.00011531219,0.0000023806374,3.0657853e-7,0.0000061701408,0.00008322442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774545,0.000079175734,0.00033244202,0.00060992653,0.0007255957,0.000507432],"domain_scores_gemma":[0.9982892,0.00016589656,0.00010087831,0.0009877163,0.0001417137,0.00031459602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480889,0.00017724387,0.00027571592,0.00017528025,0.00028179926,0.00011773312,0.003040685,0.000044274184,0.000090771486],"category_scores_gemma":[0.00008939193,0.00011090897,0.00006740368,0.0013888868,0.0021928253,0.00065937423,0.0010695738,0.00015412834,0.000093755414],"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.000007673909,0.000058335027,0.000111487745,0.000007041554,0.0000032943808,0.000027054552,0.0010426324,0.000009039867,0.0026989991,0.93214965,0.00024745968,0.06363732],"study_design_scores_gemma":[0.0007647064,0.0007888239,0.01554941,0.00013343575,0.000010953733,0.00075821683,0.000011820317,0.66655767,0.0371165,0.27662382,0.00090186973,0.00078277953],"about_ca_topic_score_codex":0.000011524489,"about_ca_topic_score_gemma":1.401991e-7,"teacher_disagreement_score":0.70496356,"about_ca_system_score_codex":0.000033101707,"about_ca_system_score_gemma":0.00033845374,"threshold_uncertainty_score":0.8079556},"labels":[],"label_agreement":null},{"id":"W1749523692","doi":"10.1016/j.tcs.2015.02.037","title":"Classic Nintendo games are (computationally) hard","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Games and Media","field":"Social Sciences","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Science Foundation","keywords":"Donkey; Legend; Computer science; Combinatorics; Video game; Advertising; Mathematical economics; Mathematics; Art; Computer graphics (images); Art history; History; Multimedia; Business; Archaeology","score_opus":0.03732331860853443,"score_gpt":0.30301576651067835,"score_spread":0.2656924479021439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749523692","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10198277,0.000084004816,0.181845,0.011207952,0.0029205324,0.0002906839,0.0000056780273,0.000358953,0.70130444],"genre_scores_gemma":[0.9838991,0.0000043515342,0.012920151,0.0011716743,0.0004987315,0.0000040299906,9.948955e-7,0.000006527991,0.0014944142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777615,0.00009251928,0.0001628669,0.00037104206,0.0010860309,0.0005114081],"domain_scores_gemma":[0.99842674,0.00018376969,0.000059336333,0.00020193822,0.0004210961,0.0007070971],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015556989,0.000104759754,0.00014996986,0.00009401719,0.00018885202,0.00045708317,0.0008413266,0.00004281187,0.000081919876],"category_scores_gemma":[0.000659116,0.00008567081,0.000054344,0.0006497691,0.0069712177,0.00048153396,0.00024187539,0.000116380565,0.00029265377],"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.0000060761417,0.00003410008,0.00031823103,0.0000013297812,0.0000018407987,0.000008330978,0.0024739425,0.000050403818,0.000005136204,0.91836566,0.0012362214,0.07749876],"study_design_scores_gemma":[0.0007748672,0.00035146356,0.01150555,0.00010969523,0.000015468322,0.000018199149,0.0025981967,0.035092812,0.00020990976,0.64294165,0.3057361,0.0006461071],"about_ca_topic_score_codex":0.000009754344,"about_ca_topic_score_gemma":0.000010881851,"teacher_disagreement_score":0.88191634,"about_ca_system_score_codex":0.00011163092,"about_ca_system_score_gemma":0.000502846,"threshold_uncertainty_score":0.99573123},"labels":[],"label_agreement":null},{"id":"W1768118166","doi":"10.1016/j.tcs.2014.04.016","title":"Theory of átomata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Regional Development Fund; Haridus- ja Teadusministeerium; Natural Sciences and Engineering Research Council of Canada; Eesti Teadusfondi","keywords":"Nondeterministic finite automaton; Deterministic finite automaton; Regular language; Deterministic automaton; Büchi automaton; Nondeterministic algorithm; Finite-state machine; Mathematics; Discrete mathematics; DFA minimization; Quotient; Automaton; Regular expression; Combinatorics; Two-way deterministic finite automaton; Computer science; Algorithm; Automata theory; Theoretical computer science; Programming language","score_opus":0.008109070715470214,"score_gpt":0.22572407714878318,"score_spread":0.21761500643331297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768118166","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.0393731,0.000020418298,0.95007545,0.00040468873,0.0004624536,0.00007467416,7.997906e-7,0.00025033185,0.009338075],"genre_scores_gemma":[0.85128456,0.0000014405433,0.14807418,0.0005424862,0.00008024972,0.0000021931883,2.600588e-7,0.00000599867,0.00000861605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977653,0.0002373028,0.00030210408,0.0005819786,0.00063893764,0.00047439514],"domain_scores_gemma":[0.99747825,0.00069720496,0.000097510485,0.0013803284,0.00014127884,0.00020543963],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0041513317,0.00015772459,0.00024128593,0.00018780076,0.00020488417,0.00018216862,0.00399438,0.000043459648,0.00006135212],"category_scores_gemma":[0.00020549426,0.00012041695,0.00007598566,0.0009792264,0.0032845521,0.0005897746,0.0013989311,0.00012388063,0.000087749504],"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.0000035629885,0.00003551892,0.000021979386,0.0000063722596,0.000002184247,0.0000012923902,0.00016711866,0.000015938755,0.0014175312,0.86766183,0.000026310274,0.13064034],"study_design_scores_gemma":[0.0001168939,0.00012668944,0.0006389722,0.000020378151,0.0000022802326,0.00001867391,0.0000034829895,0.35247713,0.014066767,0.6322647,0.00013820002,0.00012586985],"about_ca_topic_score_codex":7.0170086e-7,"about_ca_topic_score_gemma":5.7868633e-8,"teacher_disagreement_score":0.81191146,"about_ca_system_score_codex":0.00001852634,"about_ca_system_score_gemma":0.00006479108,"threshold_uncertainty_score":0.9994279},"labels":[],"label_agreement":null},{"id":"W1784462007","doi":"10.1016/j.tcs.2015.09.009","title":"Games on interval and permutation graph representations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Combinatorics; Interval graph; Graph; Mathematics; Permutation graph; Discrete mathematics; Combinatorial game theory; PSPACE; Permutation (music); Time complexity; Representation (politics); Computer science; Theoretical computer science; Pathwidth; Computational complexity theory; Line graph; Algorithm; Sequential game; Game theory; Mathematical economics","score_opus":0.034296970045577184,"score_gpt":0.3413963523780636,"score_spread":0.3070993823324864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784462007","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.08712724,0.000022996786,0.9063892,0.0016319976,0.0002877709,0.00014624713,0.0000010271705,0.000158559,0.004234972],"genre_scores_gemma":[0.8923686,0.0000031992308,0.107165314,0.00037947154,0.000049366987,0.00000962397,5.831252e-7,0.0000056439585,0.000018170931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997656,0.00019251452,0.00018491116,0.000706934,0.00083485997,0.0004248011],"domain_scores_gemma":[0.9981446,0.00036686758,0.000042555697,0.00071558496,0.000284513,0.00044587895],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016423302,0.0001344818,0.00013651543,0.0003574977,0.0002828767,0.0004499349,0.0014510225,0.000030098754,0.000007840116],"category_scores_gemma":[0.00035315356,0.00010957996,0.00003676421,0.0013061978,0.0033498036,0.00096877216,0.00091884745,0.0001978561,0.000059874987],"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.00001575019,0.00003391198,0.00011494437,0.000001962817,0.0000020788038,0.000010452544,0.00088333024,0.00030733662,0.00015387262,0.96811956,0.000054526896,0.030302254],"study_design_scores_gemma":[0.00024753652,0.00038627116,0.0017745628,0.000015073176,0.0000014926994,0.000044331744,0.000046404857,0.20222549,0.0016571066,0.7934142,0.000052012892,0.00013551237],"about_ca_topic_score_codex":0.0000029594491,"about_ca_topic_score_gemma":4.961779e-7,"teacher_disagreement_score":0.8052414,"about_ca_system_score_codex":0.00004704734,"about_ca_system_score_gemma":0.00009903915,"threshold_uncertainty_score":0.9993625},"labels":[],"label_agreement":null},{"id":"W1800138911","doi":"10.1016/j.tcs.2015.01.053","title":"Excuse me! or the courteous theatregoers' problem","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Courtesy; Set (abstract data type); Excuse; Mathematics; Row; Mathematical proof; Combinatorics; Space (punctuation); Computer science; Law; Philosophy; Geometry; Programming language; Linguistics","score_opus":0.022670644685306603,"score_gpt":0.2678674716029356,"score_spread":0.245196826917629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800138911","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.0058414713,0.00004342188,0.97999126,0.0076716105,0.00088640815,0.00024805742,8.351327e-7,0.00020823069,0.0051087267],"genre_scores_gemma":[0.81850404,0.0000033354522,0.17964616,0.0013875103,0.00028726252,0.000012959157,8.7905113e-7,0.000005926635,0.00015195558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739593,0.00017732522,0.00025916347,0.00059997325,0.0010872523,0.00048033398],"domain_scores_gemma":[0.99797374,0.0003845573,0.00006758471,0.00080168765,0.00041108276,0.0003613493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024785134,0.00017424634,0.00015283785,0.00014739024,0.0005296087,0.0007537259,0.0027774216,0.000040007755,0.000029041985],"category_scores_gemma":[0.00013784472,0.00008459066,0.000052261334,0.0019206558,0.0015391064,0.0007258559,0.000991937,0.00018263755,0.00016210676],"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.000015755135,0.000048339803,0.000009490554,0.0000023781768,0.0000036170966,0.000013231042,0.0009813936,0.004278169,0.00009142183,0.93941796,0.0011166009,0.054021634],"study_design_scores_gemma":[0.00029383015,0.00031080065,0.00012776753,0.0000112026455,0.000005045536,0.00017999051,0.000025136782,0.73650753,0.0010980635,0.25755808,0.0036930442,0.0001895459],"about_ca_topic_score_codex":0.000003943332,"about_ca_topic_score_gemma":0.0000017397949,"teacher_disagreement_score":0.81266254,"about_ca_system_score_codex":0.000078045894,"about_ca_system_score_gemma":0.0005907488,"threshold_uncertainty_score":0.7268196},"labels":[],"label_agreement":null},{"id":"W1802748673","doi":"10.1016/j.tcs.2015.09.018","title":"Autonomous mobile robots with lights","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"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; Ministero dell’Istruzione, dell’Università e della Ricerca; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Computer science; Mobile robot; Distributed computing; Artificial intelligence","score_opus":0.016159626412135412,"score_gpt":0.2576801945142401,"score_spread":0.2415205681021047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802748673","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.0038433708,0.000018818302,0.97980106,0.0009918768,0.000297022,0.00023557559,3.2108784e-7,0.0003454881,0.014466476],"genre_scores_gemma":[0.6118338,0.0000011800337,0.38763818,0.0004133408,0.000047564226,0.000012913271,3.709993e-7,0.000005245649,0.000047400794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976414,0.00008973702,0.00018571543,0.0006322242,0.0008912695,0.00055969],"domain_scores_gemma":[0.998017,0.00007663977,0.000045648732,0.0007857056,0.00041032583,0.0006646811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189816,0.00015269789,0.00016031085,0.00016801819,0.0002651146,0.0006782161,0.0022770818,0.00003642001,0.000026174117],"category_scores_gemma":[0.00003188966,0.000103718325,0.000026979964,0.0013282124,0.0018179037,0.0009817744,0.0008180934,0.00015670495,0.00021763348],"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.000005378344,0.000057082783,0.000022787683,0.0000018863294,0.0000019542513,0.000017119204,0.00077165687,0.023400942,0.000026324555,0.9622304,0.00013542364,0.013329064],"study_design_scores_gemma":[0.00035729914,0.0007193605,0.00005825181,0.000013978066,0.0000015457931,0.00006701438,0.000008123763,0.9412308,0.0011685834,0.055269495,0.0008934426,0.00021211736],"about_ca_topic_score_codex":0.0000030879378,"about_ca_topic_score_gemma":5.9268103e-7,"teacher_disagreement_score":0.9178299,"about_ca_system_score_codex":0.00007822368,"about_ca_system_score_gemma":0.00045605018,"threshold_uncertainty_score":0.6698142},"labels":[],"label_agreement":null},{"id":"W1829289780","doi":"10.1016/j.tcs.2016.05.031","title":"A 13k-kernel for planar feedback vertex set via region decomposition","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki; Agence Nationale de la Recherche","keywords":"Vertex (graph theory); Kernel (algebra); Mathematics; Set (abstract data type); Planar; Feedback vertex set; Algorithm; Combinatorics; Computer science; Graph","score_opus":0.021215364685179622,"score_gpt":0.3082908469589348,"score_spread":0.28707548227375523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829289780","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.012741038,0.00001769574,0.9820627,0.0034079247,0.0005383443,0.00044668687,0.000006074163,0.00027833224,0.0005012266],"genre_scores_gemma":[0.82498676,0.000006131253,0.17432183,0.00049852894,0.00010337377,0.000034921708,0.0000012768114,0.000014637504,0.00003255334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996522,0.00017510925,0.00032028183,0.0011487384,0.00080778764,0.0010261033],"domain_scores_gemma":[0.99675053,0.0011148925,0.00009093654,0.0012446659,0.00035167174,0.0004473244],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016152391,0.0002498542,0.0002567729,0.00031302654,0.00058424403,0.00029888228,0.0035233374,0.000080453574,0.000017930246],"category_scores_gemma":[0.00016106608,0.00016815828,0.00012232753,0.0011032405,0.0031755448,0.0013396626,0.0007610809,0.00014803314,0.00017099975],"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.00006413011,0.000042662108,0.000045760655,0.000008146798,0.0000049507926,0.000013616869,0.00013125362,0.000014249048,0.0075685945,0.9052664,0.00022313882,0.086617105],"study_design_scores_gemma":[0.0007199444,0.0005057429,0.00046070843,0.00007288685,0.0000036171434,0.00013013641,0.0000027242138,0.14909445,0.013779398,0.83469796,0.00023055436,0.0003018835],"about_ca_topic_score_codex":0.0000012571297,"about_ca_topic_score_gemma":5.480195e-7,"teacher_disagreement_score":0.8122457,"about_ca_system_score_codex":0.00015672955,"about_ca_system_score_gemma":0.00012334756,"threshold_uncertainty_score":0.9995372},"labels":[],"label_agreement":null},{"id":"W1834492313","doi":"10.1016/j.tcs.2009.03.040","title":"Hierarchy and equivalence of multi-letter quantum finite automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"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":"Equivalence (formal languages); Quantum finite automata; Mathematics; Regular language; Discrete mathematics; Nondeterministic finite automaton; Hierarchy; Automata theory; Computer science; Combinatorics; Algebra over a field; Automaton; Pure mathematics; Theoretical computer science; Law","score_opus":0.011783895480650222,"score_gpt":0.2564132395831067,"score_spread":0.24462934410245646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834492313","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.106273495,0.00006741329,0.8892044,0.0036015622,0.0003266468,0.000117736075,0.000001909582,0.00021790035,0.00018897043],"genre_scores_gemma":[0.688789,0.0000063530456,0.30976823,0.0013508165,0.00007736231,8.024688e-7,2.2985189e-7,0.000004172455,0.0000030427684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997356,0.0001166056,0.00036422748,0.00083201047,0.00068165024,0.00064951624],"domain_scores_gemma":[0.99814415,0.0003751686,0.00011061227,0.0009481859,0.00014001585,0.0002818803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381318,0.00023413722,0.00029660267,0.0002613308,0.00033012117,0.00029657272,0.0024962225,0.000056351444,0.000006110791],"category_scores_gemma":[0.000119654695,0.00018276552,0.00006836485,0.001046733,0.002531114,0.0004606212,0.0011427432,0.0002850906,0.000011618467],"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.000004856325,0.000087052,0.00003036635,0.000010768681,0.0000024039607,0.000018498076,0.0005321742,0.00091929594,0.0014772259,0.8124335,0.000026891028,0.18445699],"study_design_scores_gemma":[0.00028976012,0.00043828133,0.004527914,0.00006557469,0.0000028001348,0.000053126445,0.0000011299804,0.8945235,0.0019211214,0.097899176,0.000058080976,0.00021953927],"about_ca_topic_score_codex":0.000002193306,"about_ca_topic_score_gemma":7.825209e-8,"teacher_disagreement_score":0.8936042,"about_ca_system_score_codex":0.00001728099,"about_ca_system_score_gemma":0.00008243007,"threshold_uncertainty_score":0.93259954},"labels":[],"label_agreement":null},{"id":"W1863587147","doi":"10.1016/j.tcs.2015.12.017","title":"Towards tight bounds on theta-graphs: More is not always better","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Carleton University","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Discrete mathematics; Disjoint sets; Indifference graph; Matching (statistics); Graph","score_opus":0.027910979404374602,"score_gpt":0.27928977332233107,"score_spread":0.2513787939179565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863587147","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.060766358,0.000025150519,0.91366166,0.013514263,0.0014064693,0.00016522512,0.000004071934,0.00022466661,0.010232146],"genre_scores_gemma":[0.8725687,0.0000020122043,0.11444293,0.012613295,0.0002867559,0.000009386486,0.0000028572115,0.000008995835,0.00006502329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634916,0.00011767606,0.0003211337,0.00095346064,0.0016669477,0.0005916472],"domain_scores_gemma":[0.9978454,0.0001519722,0.00008073896,0.0009559585,0.0004444847,0.00052146375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001646509,0.0002644155,0.00023572904,0.00038887665,0.0004252992,0.0008067334,0.0023499557,0.000074538584,0.00005284907],"category_scores_gemma":[0.00008801377,0.0002056759,0.00011330267,0.0018441295,0.0014986846,0.0008518922,0.00082788494,0.00024213013,0.00031822923],"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.000014577961,0.00007497815,0.000020210548,0.0000025534998,0.000006140733,0.000011416774,0.0010160436,0.0008054794,0.0001847158,0.9349078,0.0020890355,0.06086703],"study_design_scores_gemma":[0.00038336066,0.00044844183,0.00096137344,0.000018137704,0.0000060554526,0.000041679206,0.000006661318,0.57000786,0.017998671,0.40505543,0.0047320877,0.0003402608],"about_ca_topic_score_codex":0.0000036121364,"about_ca_topic_score_gemma":2.41775e-7,"teacher_disagreement_score":0.8118024,"about_ca_system_score_codex":0.00009673403,"about_ca_system_score_gemma":0.00034562495,"threshold_uncertainty_score":0.838722},"labels":[],"label_agreement":null},{"id":"W1886146870","doi":"10.1016/j.tcs.2015.09.007","title":"Successor rules for flipping pancakes and burnt pancakes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Successor cardinal; Sequence (biology); Stack (abstract data type); Combinatorics; Mathematics; Minification; Simple (philosophy); Discrete mathematics; Algorithm; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.018123366519930503,"score_gpt":0.2678905162861136,"score_spread":0.24976714976618308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886146870","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.7009838,0.00032952407,0.29747662,0.0003455292,0.00020621513,0.00018276137,0.000006015472,0.000017640787,0.0004518898],"genre_scores_gemma":[0.94373524,0.000017145758,0.055729914,0.00017026378,0.00029319798,0.000014958534,0.000008176675,0.0000090342655,0.00002205334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998904,0.000028032537,0.00012445234,0.0004111867,0.00020442289,0.00032794074],"domain_scores_gemma":[0.9993267,0.000026322003,0.00003236602,0.000247401,0.0001631907,0.00020400497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070954935,0.00011529029,0.00011703961,0.000044546592,0.00013922804,0.00011557645,0.0003600003,0.000046445744,0.0000041025364],"category_scores_gemma":[0.0000763167,0.00009363162,0.00003220622,0.000100741025,0.0012646089,0.000009953702,0.00029603337,0.000040602674,0.00000643463],"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.00018199426,0.00015631528,0.0033086252,0.00008807092,0.0000547639,0.0000068821537,0.00085275027,0.00017900467,0.2235088,0.6242378,0.0007618293,0.14666319],"study_design_scores_gemma":[0.006501995,0.00609757,0.021618353,0.00017033519,0.0001277608,0.00022009529,0.0004717096,0.22039202,0.3912117,0.30424923,0.04631921,0.0026200346],"about_ca_topic_score_codex":0.0000012387737,"about_ca_topic_score_gemma":6.130628e-7,"teacher_disagreement_score":0.31998855,"about_ca_system_score_codex":0.000011817837,"about_ca_system_score_gemma":0.00006149353,"threshold_uncertainty_score":0.46595043},"labels":[],"label_agreement":null},{"id":"W1896187825","doi":"10.1016/j.tcs.2015.11.004","title":"Growth rate of binary words avoiding xxx","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Binary number; Mathematics; Combinatorics; Computer science; Arithmetic","score_opus":0.01801672403630301,"score_gpt":0.25971368786202886,"score_spread":0.24169696382572586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896187825","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.89199704,0.000058165082,0.10507717,0.00015436459,0.0002436345,0.000055769557,0.0000011217352,0.000017910217,0.0023948504],"genre_scores_gemma":[0.9916398,0.0000040667987,0.007822003,0.00030553484,0.00020678183,0.0000010412696,0.0000032626817,0.00000478917,0.000012745338],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988475,0.00014619934,0.00017585017,0.0003658824,0.0001661734,0.00029842512],"domain_scores_gemma":[0.9992716,0.0000517235,0.000051629366,0.00024264996,0.0001936071,0.00018882725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017909757,0.00010699262,0.000131843,0.00004438956,0.00011507639,0.000034847417,0.00059174973,0.0000621493,0.00000765272],"category_scores_gemma":[0.00037061374,0.00007608663,0.000050457445,0.00031767657,0.0017242345,0.000006355159,0.00070135854,0.0000987785,0.000010015866],"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.00010183632,0.00008484294,0.0016059529,0.000010463585,0.00000805157,0.000007165397,0.00013150292,0.0001551619,0.65023255,0.3432247,0.0002315143,0.0042062365],"study_design_scores_gemma":[0.00083254994,0.0031247821,0.004365426,0.000058220332,0.000014057752,0.000043114094,0.00007723293,0.039257992,0.86950374,0.08146855,0.00070359063,0.00055075134],"about_ca_topic_score_codex":0.0000019876798,"about_ca_topic_score_gemma":1.1965439e-7,"teacher_disagreement_score":0.26175615,"about_ca_system_score_codex":0.00000977811,"about_ca_system_score_gemma":0.00007881781,"threshold_uncertainty_score":0.6353014},"labels":[],"label_agreement":null},{"id":"W1903527885","doi":"10.1016/j.tcs.2016.05.015","title":"A dichotomy theorem for circular colouring reconfiguration","year":2016,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University; McGill University","keywords":"Control reconfiguration; Vertex (graph theory); Combinatorics; Mathematics; Graph; PSPACE; Discrete mathematics; Computational complexity theory; Computer science; Algorithm","score_opus":0.010654360260838465,"score_gpt":0.22518936423400743,"score_spread":0.21453500397316896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903527885","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.09495067,0.00009409695,0.8923206,0.00010063375,0.0030331418,0.0008053866,0.000029578816,0.0004892241,0.008176707],"genre_scores_gemma":[0.9953416,0.000008457266,0.003820137,0.00005091966,0.0005508436,0.00017369213,0.0000059659533,0.00003890047,0.0000094735715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997984,0.000089517904,0.0003808144,0.0006303814,0.00035065875,0.00056462124],"domain_scores_gemma":[0.99854046,0.00029016635,0.0000701251,0.0007392217,0.00015736872,0.0002026608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018687163,0.0003141966,0.00036474297,0.00020421541,0.00024238172,0.0002976769,0.0011549839,0.00021050853,0.000050973948],"category_scores_gemma":[0.00006129614,0.00024448233,0.00017804804,0.0002121539,0.0014712613,0.00015904759,0.00031681327,0.00030595402,0.000039141574],"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.000013496264,0.000010163172,0.000006581255,0.00020885642,0.000023390987,0.000003016621,0.00026010882,0.0018038664,0.0043357536,0.98607844,0.000054718694,0.0072015775],"study_design_scores_gemma":[0.00019475847,0.000046756868,0.000045792414,0.00032675805,0.00001759205,0.00001306978,0.000005913834,0.25652948,0.01403433,0.72813195,0.00030284884,0.00035075602],"about_ca_topic_score_codex":3.4369944e-7,"about_ca_topic_score_gemma":1.5077336e-7,"teacher_disagreement_score":0.9003909,"about_ca_system_score_codex":0.00011688984,"about_ca_system_score_gemma":0.00007084111,"threshold_uncertainty_score":0.99697006},"labels":[],"label_agreement":null},{"id":"W1963604719","doi":"10.1016/j.tcs.2004.12.020","title":"Uniformity of quantum circuit families for error-free algorithms","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Algorithm; Computer science; Quantum; Quantum circuit; Quantum computer; Mathematics; Quantum error correction; Physics; Quantum mechanics","score_opus":0.014477741345417574,"score_gpt":0.2552957478506123,"score_spread":0.24081800650519475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963604719","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.054385636,0.000048811846,0.9418678,0.0017458667,0.0006462535,0.00028200046,0.000012433092,0.00025319465,0.00075798057],"genre_scores_gemma":[0.6109427,0.0000026308726,0.38852003,0.0002782951,0.00023519546,0.00000602272,7.267675e-7,0.000008634926,0.000005730257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968692,0.000075743,0.00050669484,0.0008736482,0.0008398724,0.0008348266],"domain_scores_gemma":[0.997123,0.0005191005,0.00016165226,0.0015449809,0.00036250713,0.0002887325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872628,0.00027686174,0.00038643926,0.00030528448,0.00049897475,0.00023093268,0.0052178493,0.000078411234,0.000009713269],"category_scores_gemma":[0.00020295291,0.00022265915,0.0001768693,0.0012302926,0.0026736371,0.00055844424,0.0016842313,0.00024463536,0.0000143468],"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.0000054231155,0.00007705299,0.000015360032,0.000016883865,0.0000054087377,0.0000017099102,0.00058351434,0.0031973014,0.00024827445,0.82694954,0.000069877366,0.16882968],"study_design_scores_gemma":[0.00035513405,0.0002926283,0.0003445131,0.00003006134,0.0000044583476,0.000031360145,0.0000066294283,0.7205299,0.003675006,0.27417505,0.00033412693,0.00022111821],"about_ca_topic_score_codex":0.000005585581,"about_ca_topic_score_gemma":9.841438e-7,"teacher_disagreement_score":0.7173326,"about_ca_system_score_codex":0.000056016386,"about_ca_system_score_gemma":0.00021827959,"threshold_uncertainty_score":0.9851127},"labels":[],"label_agreement":null},{"id":"W1963717362","doi":"10.1016/j.tcs.2005.08.035","title":"On the power of non-local boxes","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":41,"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é de Montréal","funders":"","keywords":"Qubit; Computer science; Bipartite graph; Quantum nonlocality; Quantum; Alice and Bob; Physics; Mathematics; Discrete mathematics; Quantum mechanics; Theoretical computer science; Quantum entanglement","score_opus":0.005879393768026078,"score_gpt":0.24234067306318863,"score_spread":0.23646127929516256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963717362","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.27064237,9.253811e-7,0.7194217,0.0012213994,0.000039728544,0.000060317077,0.0000026425223,0.0000062017402,0.008604742],"genre_scores_gemma":[0.9975715,9.272972e-8,0.0020708921,0.00026935674,0.00007425785,0.000005756298,3.1241825e-7,0.0000030595045,0.000004739543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993674,0.000012717974,0.00010340939,0.00015832571,0.00019704874,0.00016106543],"domain_scores_gemma":[0.9994389,0.00013116373,0.000028985927,0.00029865908,0.00004618026,0.000056119537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003412153,0.00005962546,0.00006744288,0.000021950696,0.00015884009,0.000033476426,0.0004767289,0.000008600804,0.00050851074],"category_scores_gemma":[0.0000029655941,0.00003506667,0.00003791778,0.00021134542,0.0010435003,0.00004159527,0.00011782073,0.000080630954,0.000103181614],"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.0000015661815,0.000054145854,0.000005480752,2.3976276e-7,0.0000015363966,2.8575212e-8,0.00008468355,0.000065286404,0.000420532,0.9865278,0.00012139953,0.012717279],"study_design_scores_gemma":[0.000050205465,0.000057143905,0.00012386785,0.000006701222,0.0000018307817,2.0476377e-7,0.000019098292,0.25051153,0.013896366,0.735098,0.00018583299,0.00004923444],"about_ca_topic_score_codex":0.0000018980201,"about_ca_topic_score_gemma":4.3206548e-8,"teacher_disagreement_score":0.7269291,"about_ca_system_score_codex":0.0000060925217,"about_ca_system_score_gemma":0.00002823146,"threshold_uncertainty_score":0.5567836},"labels":[],"label_agreement":null},{"id":"W1963731267","doi":"10.1016/j.tcs.2009.09.037","title":"On a special class of primitive words","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"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":"Class (philosophy); Mathematics; Algebra over a field; Computer science; Linguistics; Combinatorics; Pure mathematics; Artificial intelligence; Philosophy","score_opus":0.007007482571960792,"score_gpt":0.2378683292514425,"score_spread":0.2308608466794817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963731267","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.10666211,0.000007640523,0.85265243,0.0011835241,0.0006205625,0.00012085478,0.0000013482249,0.00014660203,0.038604897],"genre_scores_gemma":[0.9483996,0.0000014999757,0.049559806,0.0016754924,0.0003498178,0.0000011884866,2.465904e-7,0.0000036088431,0.000008755367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778104,0.00008926036,0.00026991047,0.0006057144,0.00077567366,0.00047837605],"domain_scores_gemma":[0.99844456,0.00032760363,0.00008793807,0.0008243344,0.000121431745,0.00019415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010826553,0.00016875727,0.00023642852,0.00021006675,0.00018039506,0.00018400415,0.0025545647,0.000047915706,0.00006011049],"category_scores_gemma":[0.000099015066,0.00013144338,0.000083878665,0.0011094607,0.0018808283,0.00043978874,0.000422416,0.0001783085,0.00006600326],"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.000014445943,0.00010421056,0.0000025528066,0.0000014020189,0.0000015261215,0.0000098168985,0.0004364284,0.000047074802,0.0008417547,0.88295525,0.0001098036,0.11547576],"study_design_scores_gemma":[0.00023731674,0.0008385378,0.002133367,0.000047669626,0.000002366968,0.000017792287,0.000006309588,0.17519182,0.014562942,0.8066954,0.00007621372,0.0001902329],"about_ca_topic_score_codex":4.5537777e-7,"about_ca_topic_score_gemma":6.4940274e-8,"teacher_disagreement_score":0.84173745,"about_ca_system_score_codex":0.000049387207,"about_ca_system_score_gemma":0.000105666804,"threshold_uncertainty_score":0.692999},"labels":[],"label_agreement":null},{"id":"W1963743620","doi":"10.1016/j.tcs.2013.01.024","title":"Correctness of concurrent executions of closed nested transactions in transactional memory systems","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Nested transaction; Software transactional memory; Correctness; Database transaction; Transactional memory; Consistency (knowledge bases); Class (philosophy); Serialization; Transaction processing; Distributed transaction; Programming language; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.00876243527131157,"score_gpt":0.2329234691236317,"score_spread":0.22416103385232014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963743620","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.07271711,0.00006686631,0.9244107,0.0001710691,0.0014175805,0.00040265254,0.000017660488,0.000054331205,0.00074206124],"genre_scores_gemma":[0.9949176,0.0000034245056,0.004971754,0.000020794081,0.000024780678,0.00004173737,0.000001508962,0.000004706515,0.000013745471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763227,0.00015424012,0.0006853512,0.00045776792,0.0006877822,0.00038258894],"domain_scores_gemma":[0.9984269,0.00024500286,0.00016204905,0.0005250362,0.00046965078,0.00017134042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077972555,0.0001606844,0.00038565972,0.00026085012,0.00012432408,0.00011153257,0.0013574917,0.00006675525,0.00006760666],"category_scores_gemma":[0.000017948041,0.00013824925,0.00009414807,0.0017153638,0.0017633495,0.00072265154,0.00005272782,0.00018287693,0.000014548817],"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.0000059311956,0.00033046748,0.000060742528,0.000075863965,0.000008761467,0.0000028906252,0.000923816,0.013516929,0.0038813106,0.9424234,0.000022700495,0.038747154],"study_design_scores_gemma":[0.0005139718,0.00014124627,0.0041160462,0.00017679375,0.000005374773,0.000039428327,0.00008498258,0.987449,0.004590341,0.0026619374,0.000031345615,0.00018951649],"about_ca_topic_score_codex":0.00015772012,"about_ca_topic_score_gemma":0.0000035801509,"teacher_disagreement_score":0.9739321,"about_ca_system_score_codex":0.000060575687,"about_ca_system_score_gemma":0.00023226693,"threshold_uncertainty_score":0.64971346},"labels":[],"label_agreement":null},{"id":"W1964432965","doi":"10.1016/j.tcs.2014.09.003","title":"Less space: Indexing for queries with wildcards","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Canada Research Chairs","keywords":"Substring; Search engine indexing; Combinatorics; String (physics); Mathematics; Character (mathematics); Set (abstract data type); Space (punctuation); Alphabet; Upper and lower bounds; Computer science; Discrete mathematics; Information retrieval","score_opus":0.008467994323228173,"score_gpt":0.23809036300949935,"score_spread":0.22962236868627117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964432965","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.011076478,0.000012092572,0.98525417,0.001032006,0.00043945567,0.00019035958,0.0000023981925,0.00021300938,0.0017800201],"genre_scores_gemma":[0.5655341,8.517425e-7,0.4339766,0.00031692442,0.00014533527,0.000010637847,9.163564e-7,0.00000625801,0.0000083576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777085,0.00006534742,0.00018023534,0.0007576666,0.00065471296,0.0005712123],"domain_scores_gemma":[0.9981872,0.000315434,0.0000694089,0.00095432525,0.00022666935,0.0002470017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343437,0.00018862858,0.00022012078,0.00012299903,0.0006253521,0.00067669555,0.0022885299,0.000046003952,0.000004290329],"category_scores_gemma":[0.00007522884,0.00012762196,0.000044590626,0.0006534213,0.0019584156,0.0010473025,0.0010625053,0.00013921665,0.0000083707855],"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.00001116115,0.000019821538,0.00006014248,0.0000073425335,0.0000020115492,0.0000014449298,0.0001668765,0.0001965172,0.00011692983,0.8948182,0.00007470358,0.10452488],"study_design_scores_gemma":[0.0003620817,0.0004568212,0.0005739342,0.000058620644,0.000003723129,0.000029341818,0.000012583092,0.8660874,0.0030578629,0.12649135,0.002597908,0.0002684161],"about_ca_topic_score_codex":0.000005267127,"about_ca_topic_score_gemma":9.28049e-7,"teacher_disagreement_score":0.86589086,"about_ca_system_score_codex":0.000032237545,"about_ca_system_score_gemma":0.00012066812,"threshold_uncertainty_score":0.7215864},"labels":[],"label_agreement":null},{"id":"W1964758092","doi":"10.1016/s0304-3975(99)00085-7","title":"Semantic distance between specifications","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":12,"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é de Sherbrooke; Université Laval","funders":"","keywords":"Computer science; Reuse; Programming language; Semantic similarity; Semantic computing; Software; Software engineering; Theoretical computer science; Information retrieval; Semantic Web; Engineering","score_opus":0.023179762486844023,"score_gpt":0.2687739268575994,"score_spread":0.24559416437075535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964758092","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.05378791,0.000023596393,0.9408744,0.0010528588,0.00018302034,0.00012662495,0.0000017389978,0.0004973153,0.0034525136],"genre_scores_gemma":[0.88352877,0.000007313515,0.1161019,0.000086550455,0.00017210464,0.000007005329,6.84797e-7,0.000008145918,0.00008753812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741066,0.000058206322,0.00022902181,0.0007302928,0.00089660403,0.0006752202],"domain_scores_gemma":[0.99738634,0.00079938775,0.000021198937,0.0013273184,0.00011984021,0.00034592196],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001021122,0.00014999165,0.00016433926,0.000165384,0.00038281988,0.0005216801,0.003765197,0.00003728705,0.00024906787],"category_scores_gemma":[0.0001605023,0.0001323889,0.00004934419,0.0020450705,0.0018945766,0.00062892307,0.00044260325,0.00023882493,0.0009545272],"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":[9.947522e-7,0.000020745152,0.0010092182,0.0000035683697,0.0000020733257,0.0000071517766,0.0001390811,0.00015557861,0.00003105132,0.8213228,0.00007722026,0.17723054],"study_design_scores_gemma":[0.00040759172,0.00025504373,0.19719338,0.00008020236,0.000007731647,0.000050757855,0.0000027875735,0.5751271,0.0030174076,0.211533,0.011473462,0.00085153425],"about_ca_topic_score_codex":0.0000020332711,"about_ca_topic_score_gemma":1.3041543e-7,"teacher_disagreement_score":0.8297408,"about_ca_system_score_codex":0.00007810597,"about_ca_system_score_gemma":0.000098491575,"threshold_uncertainty_score":0.99982333},"labels":[],"label_agreement":null},{"id":"W1964943343","doi":"10.1016/j.tcs.2004.12.024","title":"The Thue–Morse word contains circular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>5</mml:mn><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msup></mml:math> power free words of every length","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Morse code; Mathematics; Scroll; Computer science; Geometry; Theology; Philosophy","score_opus":0.012849458332719037,"score_gpt":0.23156772215589969,"score_spread":0.21871826382318066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964943343","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.75552547,0.0026321318,0.03493507,0.0028721548,0.0062834765,0.00018652363,0.00048782225,0.00077167986,0.19630565],"genre_scores_gemma":[0.9783744,0.0009569347,0.011797578,0.0040680435,0.0029197459,0.00065680395,0.00026973448,0.00070549315,0.00025124793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9801861,0.0012510766,0.0033004736,0.004095531,0.0060749943,0.0050918427],"domain_scores_gemma":[0.9841675,0.0045141694,0.0026885306,0.005781773,0.0005770635,0.002270937],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0073251873,0.001765839,0.00086531136,0.0009276203,0.00382525,0.004416766,0.010510419,0.0025357201,0.062206455],"category_scores_gemma":[0.0027967552,0.0026097768,0.0027928413,0.0033188644,0.010839832,0.0037491561,0.008562696,0.0031573968,0.0026791203],"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.0012020142,0.0006933162,0.000013195262,0.00056335516,0.001049556,0.0013517865,0.0042206245,0.0021244364,0.0022288433,0.9141551,0.060959417,0.011438303],"study_design_scores_gemma":[0.002332357,0.0023698187,0.00017836322,0.0013637794,0.00087187864,0.0022607818,0.001293427,0.5466937,0.43232977,0.0033498714,0.004616989,0.0023392509],"about_ca_topic_score_codex":0.0007417898,"about_ca_topic_score_gemma":0.00031360652,"teacher_disagreement_score":0.9108053,"about_ca_system_score_codex":0.000074693,"about_ca_system_score_gemma":0.0029739921,"threshold_uncertainty_score":0.99950874},"labels":[],"label_agreement":null},{"id":"W1965935527","doi":"10.1016/j.tcs.2005.09.042","title":"Solving <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>7</mml:mn><mml:mo>×</mml:mo><mml:mn>7</mml:mn></mml:math> Hex with domination, fill-in, and virtual connections","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Scroll; Algorithm; Computer science; Artificial intelligence; Theology; Philosophy","score_opus":0.01570695631548021,"score_gpt":0.25018469921805636,"score_spread":0.23447774290257614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965935527","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.74241155,0.00030802592,0.24892823,0.0018907276,0.0018258954,0.00016514622,0.00006925881,0.0003129725,0.004088194],"genre_scores_gemma":[0.9629217,0.00019201657,0.033430986,0.0018172906,0.0012065837,0.00015837558,0.000031829873,0.00014635213,0.00009487376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906165,0.0004313149,0.0016123229,0.0025148967,0.002552459,0.0022724872],"domain_scores_gemma":[0.99333537,0.0024065287,0.0008578326,0.0018958418,0.00049751316,0.0010069187],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.0038432174,0.00087004306,0.0005509196,0.0005794411,0.0024617417,0.0028335983,0.003556855,0.000760357,0.00061166467],"category_scores_gemma":[0.0012505952,0.0010436622,0.000474815,0.0021911557,0.008162032,0.002861672,0.0031071939,0.0013905757,0.0013045957],"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.00024840157,0.00035586275,0.000020102196,0.000101760466,0.00011217722,0.00024578403,0.005646348,0.0064227735,0.0010994846,0.96565706,0.0014169185,0.018673321],"study_design_scores_gemma":[0.00059594074,0.0015447494,0.00011276969,0.00066830654,0.00013739888,0.00078500295,0.00077220774,0.9076576,0.07644876,0.008910097,0.001314464,0.0010526653],"about_ca_topic_score_codex":0.00026460612,"about_ca_topic_score_gemma":0.00029681533,"teacher_disagreement_score":0.956747,"about_ca_system_score_codex":0.00009959855,"about_ca_system_score_gemma":0.0011850656,"threshold_uncertainty_score":0.999473},"labels":[],"label_agreement":null},{"id":"W1966045745","doi":"10.1016/j.tcs.2005.11.044","title":"On linear complexity of sequences over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"","keywords":"Scroll; Mathematics; Algorithm; Computer science; Theology; Philosophy","score_opus":0.019594513761659143,"score_gpt":0.24566742363757352,"score_spread":0.22607290987591439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966045745","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.80471176,0.0010816532,0.021100292,0.0013937044,0.00464714,0.000127702,0.0005859108,0.000629361,0.16572246],"genre_scores_gemma":[0.9790492,0.00053740066,0.0132228285,0.002567644,0.002846811,0.0005567481,0.0004830901,0.0006482993,0.000087947294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98041373,0.0013046713,0.003297328,0.0043092375,0.005942989,0.004732022],"domain_scores_gemma":[0.985859,0.0040104254,0.002889103,0.0044851094,0.0005628242,0.002193552],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0057401056,0.0017657474,0.00082643994,0.0012278436,0.0035880632,0.0039329133,0.008150856,0.002793329,0.091706805],"category_scores_gemma":[0.0018957442,0.002961716,0.0030266726,0.003984679,0.013386203,0.0031706966,0.006177713,0.0031789849,0.0024908087],"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.0017798257,0.00084040145,0.000026924463,0.0009192102,0.0009679523,0.0013352439,0.0025277245,0.0043377276,0.0021535263,0.93387884,0.04451171,0.0067209234],"study_design_scores_gemma":[0.002096602,0.0039650667,0.00015036759,0.0016219296,0.0009513655,0.0014571644,0.00076316786,0.37214404,0.58565146,0.027467197,0.001234897,0.002496763],"about_ca_topic_score_codex":0.0017967662,"about_ca_topic_score_gemma":0.0006179989,"teacher_disagreement_score":0.90641165,"about_ca_system_score_codex":0.000049188893,"about_ca_system_score_gemma":0.0025817368,"threshold_uncertainty_score":0.9995088},"labels":[],"label_agreement":null},{"id":"W1967306786","doi":"10.1016/j.tcs.2005.01.007","title":"Generalised fine and Wilf's theorem for arbitrary number of periods","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"Mathematics; Word (group theory); Divisor (algebraic geometry); Combinatorics; Upper and lower bounds; Word length; Greatest common divisor; Discrete mathematics; Computer science; Geometry","score_opus":0.008713460936695415,"score_gpt":0.25609400636327656,"score_spread":0.24738054542658114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967306786","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.2709786,0.00005595673,0.7252318,0.0015225589,0.00017812329,0.00015783064,0.0000045322877,0.000109224835,0.0017613842],"genre_scores_gemma":[0.6200247,0.0000035891885,0.37920174,0.0006123652,0.00013397455,0.0000068060112,6.388904e-7,0.000006246191,0.000009982446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981535,0.00006813257,0.00030830925,0.00061071396,0.00038914967,0.00047017346],"domain_scores_gemma":[0.99854237,0.00034976014,0.00008388832,0.00068205554,0.00013430644,0.00020764457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393395,0.0001840492,0.00026267784,0.000097513286,0.0002457608,0.00022615354,0.0016314631,0.000053257478,0.000057341036],"category_scores_gemma":[0.00005659481,0.00014292971,0.000080262645,0.00049477245,0.0027139275,0.00069339486,0.0006983348,0.00010521954,0.000013062728],"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.000011540487,0.000047470265,0.00005981379,0.0000113637,0.000003981191,0.0000016820619,0.00040738503,0.000022397584,0.0016776734,0.92228645,0.000055517285,0.07541474],"study_design_scores_gemma":[0.00037773835,0.00011447642,0.00054845365,0.000024140316,0.000005151427,0.00007604809,0.000004604096,0.5695231,0.014520489,0.4142174,0.00039030105,0.00019806296],"about_ca_topic_score_codex":0.0000019850372,"about_ca_topic_score_gemma":3.6338201e-7,"teacher_disagreement_score":0.56950074,"about_ca_system_score_codex":0.000021968455,"about_ca_system_score_gemma":0.00008496801,"threshold_uncertainty_score":0.9999579},"labels":[],"label_agreement":null},{"id":"W1967372194","doi":"10.1016/j.tcs.2007.01.020","title":"On critical exponents in fixed points of non-erasing morphisms","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Morphism; Alphabet; Exponent; Eigenvalues and eigenvectors; Fixed point; Finite field; Degree (music); Combinatorics; Algebraic number; Discrete mathematics; Field (mathematics); Matrix (chemical analysis); Critical exponent; Pure mathematics; Mathematical analysis; Geometry; Scaling","score_opus":0.00930701070768034,"score_gpt":0.27711712124310667,"score_spread":0.2678101105354263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967372194","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.35948882,0.00000747323,0.63833386,0.00035997355,0.00045344047,0.00007732626,5.749371e-7,0.00005680392,0.0012217324],"genre_scores_gemma":[0.82484025,6.7586296e-7,0.1744444,0.00065873814,0.00004611855,0.0000013959863,2.2824135e-7,0.000006655982,0.0000015435221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971254,0.00009039305,0.00046589487,0.0006908529,0.0008664109,0.0007610406],"domain_scores_gemma":[0.99745643,0.001275682,0.00006700916,0.0008198802,0.00011691217,0.0002640947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038688288,0.00018840832,0.0002749678,0.00045481004,0.00015974547,0.00014827194,0.0022557538,0.00006840658,0.000036898782],"category_scores_gemma":[0.0003471618,0.00015979563,0.00006782463,0.0013451083,0.0024255349,0.00056725007,0.0007953026,0.00024484267,0.000054859884],"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.000022238071,0.00016750494,0.0001418661,0.0000076195533,0.0000011732009,0.000058857746,0.0004138983,0.000041734093,0.0063018734,0.9672902,0.000011042386,0.025541984],"study_design_scores_gemma":[0.00039927237,0.00031913482,0.011448901,0.0001645738,0.0000017767669,0.000032122203,0.000012923485,0.37910306,0.05112093,0.55715185,0.000003905645,0.00024151681],"about_ca_topic_score_codex":0.0000051008574,"about_ca_topic_score_gemma":4.9306766e-7,"teacher_disagreement_score":0.46535143,"about_ca_system_score_codex":0.000076348,"about_ca_system_score_gemma":0.0000679557,"threshold_uncertainty_score":0.8936984},"labels":[],"label_agreement":null},{"id":"W1967410222","doi":"10.1016/j.tcs.2009.12.006","title":"Algorithmic properties of ciliate sequence alignment","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Ciliate; Sequence (biology); Mathematics; Algorithm; Computer science; Combinatorics; Biology; Genetics","score_opus":0.015454636341603344,"score_gpt":0.23388028509365982,"score_spread":0.21842564875205647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967410222","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.9176801,0.00008402755,0.0810076,0.00026611303,0.00009165515,0.00011689505,0.0000047020562,0.000009766105,0.00073914917],"genre_scores_gemma":[0.99174654,0.000010633155,0.007786401,0.0003839125,0.00005629227,9.2965496e-7,0.0000014055277,0.0000016217351,0.000012232482],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992261,0.00002917217,0.00009738275,0.0002494381,0.00020262953,0.0001952742],"domain_scores_gemma":[0.99956685,0.0000028445013,0.000028077808,0.00024712182,0.00007935316,0.00007576624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030576967,0.00007237839,0.00007897963,0.000024948013,0.000096615164,0.0000200797,0.0004931579,0.000033384214,0.000008723042],"category_scores_gemma":[0.000019976032,0.00005822727,0.000033821587,0.00011945633,0.0014232367,0.0000055621995,0.00018623465,0.00003899353,0.000007651326],"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.000029340363,0.000044968478,0.00013818093,0.000005230888,0.0000035201535,0.0000020990433,0.00007822541,0.0000589338,0.86602986,0.1249046,0.000023550956,0.00868148],"study_design_scores_gemma":[0.00014015968,0.00053600833,0.0016089879,0.000018661012,0.0000040491177,0.000011899303,0.0000050106246,0.0041299937,0.98322314,0.010129182,0.00007960786,0.000113309616],"about_ca_topic_score_codex":0.0000016678963,"about_ca_topic_score_gemma":9.473455e-8,"teacher_disagreement_score":0.11719326,"about_ca_system_score_codex":0.00000947111,"about_ca_system_score_gemma":0.00005790653,"threshold_uncertainty_score":0.5243975},"labels":[],"label_agreement":null},{"id":"W1967439097","doi":"10.1016/j.tcs.2015.03.022","title":"The complexity of zero-visibility cops and robber","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Visibility; Zero (linguistics); Class (philosophy); Tree (set theory); Mathematics; Zero-sum game; Discrete mathematics; Computational complexity theory; Combinatorics; Theoretical computer science; Complexity class; Computer science; Time complexity; Algorithm; Game theory; Artificial intelligence; Mathematical economics; Geography","score_opus":0.07225129867103225,"score_gpt":0.31593751795210256,"score_spread":0.24368621928107032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967439097","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.089910015,0.000071191156,0.9046563,0.0022867478,0.0005199123,0.00014942104,8.818441e-7,0.00008200055,0.002323552],"genre_scores_gemma":[0.9079699,0.0000041029284,0.091793865,0.00018043946,0.000038435137,0.0000024759515,8.934236e-8,0.0000034409604,0.0000072444273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767184,0.00018236779,0.00036626344,0.00054985983,0.0007800143,0.0004496506],"domain_scores_gemma":[0.99746305,0.00055563357,0.00009706738,0.00107092,0.00048144304,0.00033189266],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037766164,0.00013767573,0.00019327164,0.00005991097,0.0004158541,0.0003857525,0.0026835043,0.000037478396,0.0000054310904],"category_scores_gemma":[0.000497717,0.00008733077,0.000040858824,0.00076851354,0.02191307,0.00052036665,0.0018795981,0.00016262448,0.00003063047],"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.000008237007,0.000028158634,0.0003332558,0.0000022763138,0.0000018465826,0.0000013871978,0.0007238074,0.000064234126,0.00012623462,0.9605416,0.000081520564,0.038087424],"study_design_scores_gemma":[0.00004308552,0.00012968943,0.0010204145,0.000007220237,0.0000015047615,0.000012651141,0.000023626884,0.32378298,0.0069082915,0.66785663,0.00012605492,0.00008783358],"about_ca_topic_score_codex":0.000021240605,"about_ca_topic_score_gemma":0.000003836885,"teacher_disagreement_score":0.81805986,"about_ca_system_score_codex":0.00004672535,"about_ca_system_score_gemma":0.00018725259,"threshold_uncertainty_score":0.9807487},"labels":[],"label_agreement":null},{"id":"W1968405302","doi":"10.1016/j.tcs.2008.03.017","title":"On stabilizers of infinite words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Word (group theory); Monoid; Mathematics; Alphabet; Invertible matrix; Combinatorics on words; Free monoid; Characterization (materials science); Discrete mathematics; Pure mathematics; Linguistics","score_opus":0.012084624867511811,"score_gpt":0.2342318309442782,"score_spread":0.2221472060767664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968405302","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.357702,0.000014217791,0.63638675,0.00022808785,0.00032829773,0.00007176993,0.0000010072245,0.00014016383,0.0051276986],"genre_scores_gemma":[0.9308144,0.0000054848206,0.0685846,0.00053809525,0.000040406838,0.0000026541813,1.8903498e-7,0.000005859996,0.000008336198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977759,0.00009371626,0.00029322522,0.0005650359,0.0008121852,0.00045994023],"domain_scores_gemma":[0.9979413,0.00057495217,0.00008318273,0.0010644048,0.00012578866,0.00021038497],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010901048,0.00016166731,0.0002282237,0.00023783187,0.00028532755,0.00007600969,0.0026084788,0.000041459327,0.00006695231],"category_scores_gemma":[0.00013055664,0.00012529832,0.00007916982,0.0013548255,0.0044131675,0.00046352978,0.0007684949,0.00016188278,0.00007766176],"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.000009131309,0.00007548977,0.000057294474,0.0000038333333,0.0000021505612,0.000014909837,0.00075287465,0.00018509512,0.0006810759,0.9839382,0.000051851308,0.014228101],"study_design_scores_gemma":[0.00038729407,0.0006611347,0.0023327218,0.000051966395,0.000002485331,0.00008854905,0.000010632249,0.38740706,0.021202905,0.5874238,0.000115350165,0.00031613433],"about_ca_topic_score_codex":0.000002125686,"about_ca_topic_score_gemma":7.196892e-8,"teacher_disagreement_score":0.57311237,"about_ca_system_score_codex":0.00003473994,"about_ca_system_score_gemma":0.00014091458,"threshold_uncertainty_score":0.99829626},"labels":[],"label_agreement":null},{"id":"W1968885544","doi":"10.1016/s0304-3975(03)00141-5","title":"On polynomial-time approximation algorithms for the variable length scheduling problem","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Approximation algorithm; Mathematics; Algorithm; Extension (predicate logic); Approximation error; Scheduling (production processes); Polynomial-time approximation scheme; Variable (mathematics); Discrete mathematics; Combinatorics; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.016075939359333716,"score_gpt":0.2594672765588951,"score_spread":0.2433913371995614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968885544","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.00016401432,0.000015280506,0.9890692,0.001736695,0.00038339332,0.00074225944,0.0000015456396,0.00017843461,0.0077091255],"genre_scores_gemma":[0.1393297,0.0000032456403,0.8595841,0.00086790795,0.00006900813,0.00005686034,0.0000010398445,0.000010166205,0.00007799782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761724,0.00016363415,0.00027885506,0.0006594496,0.00064861105,0.0006322049],"domain_scores_gemma":[0.9976789,0.0010204258,0.000078026766,0.00073727506,0.00028931227,0.00019606347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00388973,0.00017401343,0.00016265211,0.00014415671,0.0010050384,0.00088719,0.0019101634,0.00005422862,0.00006306524],"category_scores_gemma":[0.00034972365,0.00011523586,0.00005977938,0.0012084552,0.0009754163,0.00064101,0.00028668717,0.00019792905,0.000091929476],"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.000005056211,0.000057231595,6.336284e-7,0.0000058567366,0.000004224315,3.0805143e-7,0.00018502973,0.03939682,0.00023842603,0.94628674,0.00014142248,0.013678278],"study_design_scores_gemma":[0.0002878521,0.0001874856,0.0000029577138,0.00001668158,0.000002885526,0.000007706201,0.0000034402772,0.79422903,0.0014924947,0.20309901,0.0005327253,0.00013770665],"about_ca_topic_score_codex":0.0000012396554,"about_ca_topic_score_gemma":4.2559915e-8,"teacher_disagreement_score":0.7548322,"about_ca_system_score_codex":0.00006698177,"about_ca_system_score_gemma":0.00026174216,"threshold_uncertainty_score":0.85551935},"labels":[],"label_agreement":null},{"id":"W1969276875","doi":"10.1016/j.tcs.2014.09.029","title":"Near-optimal PAC bounds for discounted MDPs","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Upper and lower bounds; Markov decision process; Logarithm; Sample complexity; Mathematics; Reinforcement learning; State space; Stochastic matrix; Markov chain; Matrix (chemical analysis); Space (punctuation); Markov process; Mathematical optimization; Applied mathematics; Combinatorics; Computer science; Statistics; Mathematical analysis","score_opus":0.04680964409173786,"score_gpt":0.418173190851378,"score_spread":0.3713635467596401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969276875","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.046652883,0.000007926085,0.9491842,0.0015220989,0.0006470817,0.00029101424,0.000010755567,0.0000805261,0.001603544],"genre_scores_gemma":[0.8297389,6.9427887e-7,0.16941223,0.0003263806,0.00033047242,0.000018666844,0.0000014333084,0.000012861399,0.0001583384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940432,0.00021557519,0.00051189656,0.0011200448,0.0031095252,0.0009997865],"domain_scores_gemma":[0.99340814,0.0039376426,0.00010505873,0.0011627853,0.0009205782,0.00046577532],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010265895,0.00020104888,0.00034049148,0.00025771288,0.0011284942,0.0018953658,0.0032673571,0.00006454327,0.00029511933],"category_scores_gemma":[0.0056388164,0.00013179636,0.00012774473,0.001898443,0.010014843,0.000813044,0.0009645198,0.0002417086,0.00041579295],"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.000072042625,0.00005991242,0.000094118324,0.0000030854665,0.0000031061581,0.000002604752,0.0002976786,0.0038541218,0.00025268478,0.86099905,0.00076847157,0.13359313],"study_design_scores_gemma":[0.00027540931,0.00031733487,0.00060714444,0.0000063213247,0.0000019482572,0.000009042983,0.000017840961,0.6586541,0.0009045144,0.33227184,0.0067890165,0.00014551691],"about_ca_topic_score_codex":0.0000019633912,"about_ca_topic_score_gemma":8.480578e-7,"teacher_disagreement_score":0.78308606,"about_ca_system_score_codex":0.00007674432,"about_ca_system_score_gemma":0.0002144769,"threshold_uncertainty_score":0.99914074},"labels":[],"label_agreement":null},{"id":"W1969389934","doi":"10.1016/j.tcs.2014.11.030","title":"Interactive proofs with quantum finite automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Quantum; Automaton; Bounded function; Probabilistic logic; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Artificial intelligence; Quantum mechanics","score_opus":0.0047482486649775306,"score_gpt":0.22477091848971115,"score_spread":0.22002266982473362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969389934","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.0439933,0.0000058051837,0.9501994,0.0018387304,0.00055710715,0.0001637861,7.728793e-7,0.0005885479,0.002652501],"genre_scores_gemma":[0.7377092,4.559474e-7,0.26145703,0.00065095484,0.00015985347,0.000005218688,4.81736e-7,0.000010266126,0.0000065191934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968782,0.00018434932,0.00026472262,0.001043084,0.0008585704,0.00077105046],"domain_scores_gemma":[0.9973853,0.00070451153,0.00011137278,0.0012398866,0.00021863599,0.00034029112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435839,0.00028340955,0.000279367,0.00023890281,0.00056214666,0.0007610874,0.003286676,0.000047205656,0.000013554858],"category_scores_gemma":[0.00015397684,0.00018960473,0.00006204163,0.0013524037,0.0022005874,0.0006454622,0.0014311145,0.00039474288,0.00010749964],"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.000011454946,0.00006455323,0.000028246328,0.000006656611,0.0000048750358,0.000012672408,0.0005192208,0.004181126,0.000069359005,0.8656645,0.000022913497,0.12941444],"study_design_scores_gemma":[0.00030504528,0.0007599379,0.00084808754,0.00007368993,0.0000033785088,0.00008978916,0.0000024687065,0.8886421,0.0009900017,0.10763346,0.0003574572,0.00029461348],"about_ca_topic_score_codex":0.0000035931466,"about_ca_topic_score_gemma":4.3252052e-7,"teacher_disagreement_score":0.8844609,"about_ca_system_score_codex":0.000040776733,"about_ca_system_score_gemma":0.00013853636,"threshold_uncertainty_score":0.8108156},"labels":[],"label_agreement":null},{"id":"W1969770235","doi":"10.1016/j.tcs.2005.01.004","title":"Pattern avoidance: themes and variations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Mathematics; Psychology; Artificial intelligence","score_opus":0.00609221224695569,"score_gpt":0.22810185740351413,"score_spread":0.22200964515655844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969770235","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.027830886,0.0000815842,0.96509826,0.0040340847,0.00024424214,0.00008247797,0.0000012164658,0.00025462732,0.0023726115],"genre_scores_gemma":[0.848543,0.000007996278,0.14956336,0.0016869056,0.00017762954,0.000004383024,2.4756415e-7,0.0000047584927,0.000011712493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983329,0.0000661776,0.00019096726,0.0005697252,0.0004131966,0.00042702095],"domain_scores_gemma":[0.9987742,0.00023642513,0.000045968245,0.0006616026,0.00007711947,0.00020473787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091266166,0.00014134569,0.0001364299,0.0001195292,0.00042966925,0.0005400221,0.0016297876,0.00003488096,0.000054191303],"category_scores_gemma":[0.000041930674,0.00011048779,0.000032868185,0.00055914646,0.0014880196,0.0009477434,0.0009896827,0.00013515119,0.00010093794],"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":[5.0551284e-7,0.000022372345,0.000042517157,0.0000016531933,0.0000014056728,0.0000016832877,0.00047772264,0.000022796918,0.00025088864,0.72235787,0.000035042303,0.27678555],"study_design_scores_gemma":[0.00013876756,0.000052841406,0.00223518,0.000014007747,0.0000022943427,0.0000444626,0.000005548325,0.77280223,0.0017889892,0.22232182,0.00042597333,0.00016788524],"about_ca_topic_score_codex":0.0000020579018,"about_ca_topic_score_gemma":5.1426645e-7,"teacher_disagreement_score":0.82071215,"about_ca_system_score_codex":0.000029714825,"about_ca_system_score_gemma":0.00005377902,"threshold_uncertainty_score":0.548267},"labels":[],"label_agreement":null},{"id":"W1970322539","doi":"10.1016/j.tcs.2008.10.005","title":"Gathering few fat mobile robots in the plane","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":141,"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 en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Robot; Asynchronous communication; Mobile robot; Computer science; Plane (geometry); Artificial intelligence; Combinatorics; Mathematics; Geometry; Telecommunications","score_opus":0.020414413547268855,"score_gpt":0.260438264394177,"score_spread":0.24002385084690814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970322539","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.034523346,0.00002939739,0.9589333,0.0010210725,0.00020150465,0.00025732617,3.2506514e-7,0.00011381068,0.004919931],"genre_scores_gemma":[0.9007551,0.000021085702,0.09817092,0.0009598405,0.0000552092,0.000018304803,3.908847e-7,0.000004099161,0.000015015104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979109,0.00016654764,0.0002088561,0.00046875636,0.0007274841,0.0005174425],"domain_scores_gemma":[0.9988297,0.00024087877,0.00003213323,0.00068471045,0.0000736612,0.00013891526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013443086,0.00012224556,0.00013036201,0.0001479813,0.0004458744,0.0002924493,0.0030587562,0.000032378048,0.000039718925],"category_scores_gemma":[0.000037787337,0.0000793042,0.000035472473,0.0014633966,0.0016992794,0.0005515664,0.000613329,0.00023002694,0.00009621276],"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.000002236766,0.00006725981,0.00014382241,0.0000029134296,8.0264357e-7,0.000050434617,0.0032256455,0.016890813,0.00013652323,0.97100544,0.00007749901,0.008396606],"study_design_scores_gemma":[0.00023441817,0.00019011126,0.0015482784,0.000018287174,5.777833e-7,0.00017498227,0.000020135016,0.9716216,0.00055796414,0.025159387,0.0002986756,0.00017558245],"about_ca_topic_score_codex":0.0000052586142,"about_ca_topic_score_gemma":9.496126e-7,"teacher_disagreement_score":0.9547308,"about_ca_system_score_codex":0.000033967815,"about_ca_system_score_gemma":0.00007767962,"threshold_uncertainty_score":0.62610656},"labels":[],"label_agreement":null},{"id":"W1970529854","doi":"10.1016/s0304-3975(02)00135-4","title":"Strand design for biomolecular computation","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":101,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DNA computing; DNA; Computation; Computer science; Theoretical computer science; Computational biology; Algorithm; Biology; Genetics","score_opus":0.01792685408095541,"score_gpt":0.28421216132173666,"score_spread":0.26628530724078125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970529854","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.033572193,0.00004073037,0.96570957,0.00019320853,0.000055224547,0.00016764765,0.000002995374,0.00003911537,0.0002193467],"genre_scores_gemma":[0.722925,0.000009354596,0.27676064,0.00020571463,0.00007672802,0.0000034534771,0.00000494822,0.000005596807,0.0000085526735],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990436,0.00004109534,0.00012735139,0.00038464673,0.00016201362,0.00024133411],"domain_scores_gemma":[0.99950457,0.000028757615,0.000035152003,0.00020564644,0.00014054948,0.00008534811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004195501,0.00010307281,0.00009510662,0.000056299137,0.00018874601,0.00006219151,0.00023894203,0.000053258656,0.000002721648],"category_scores_gemma":[0.000054705823,0.000083661966,0.00006289943,0.0002219057,0.0011071133,0.0000054209763,0.00007499421,0.0000353698,0.0000030523875],"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.000042941796,0.00008021309,0.0000081325215,0.000006131048,0.000014421756,0.0000023193654,0.00002498891,0.00039075196,0.91599005,0.028518993,0.000570489,0.05435054],"study_design_scores_gemma":[0.000207765,0.00052994053,0.000014581659,0.0000068934514,0.000011501912,0.000014454981,0.0000021521398,0.26393682,0.72493994,0.00986148,0.0003193371,0.00015516869],"about_ca_topic_score_codex":1.9782453e-7,"about_ca_topic_score_gemma":8.950138e-8,"teacher_disagreement_score":0.6893528,"about_ca_system_score_codex":0.000009103015,"about_ca_system_score_gemma":0.000012557749,"threshold_uncertainty_score":0.4079205},"labels":[],"label_agreement":null},{"id":"W1970607503","doi":"10.1016/j.tcs.2013.02.032","title":"Impartial coloring games","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"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é de Sherbrooke","funders":"","keywords":"Greedy coloring; Graph coloring; Complete coloring; Fractional coloring; List coloring; Combinatorics; Edge coloring; Mathematics; Graph; Discrete mathematics; Combinatorial game theory; Computer science; Graph power; Sequential game; Game theory; Mathematical economics; Line graph","score_opus":0.017884919955491116,"score_gpt":0.27568016414118746,"score_spread":0.2577952441856963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970607503","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.14892806,0.000014482564,0.84271157,0.0018999627,0.00096734683,0.00021521529,2.0647774e-7,0.00035191863,0.004911263],"genre_scores_gemma":[0.8611244,0.000001980024,0.13796674,0.0006504143,0.00020323647,0.000024791172,1.0296798e-7,0.0000068809113,0.000021465257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971972,0.00007859791,0.00034667284,0.00076824246,0.0007583562,0.0008509079],"domain_scores_gemma":[0.99797595,0.00029070873,0.00006706615,0.00096654333,0.00030285804,0.00039685625],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009199941,0.0001931992,0.00019772744,0.00018087847,0.00043557785,0.0011854164,0.0036651292,0.000051712726,0.0003243977],"category_scores_gemma":[0.00016009188,0.00015632776,0.000071373244,0.0011688949,0.0033268924,0.0018915444,0.0015979488,0.00020665486,0.0020415531],"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.0000012501717,0.000029874058,0.000115894276,0.0000016709621,0.0000018326731,0.0000047858384,0.00041682375,0.00016265553,0.0022014594,0.89287615,0.0001971383,0.10399044],"study_design_scores_gemma":[0.000039331862,0.0001385191,0.0011304928,0.000012236239,0.0000015166657,0.000022810285,0.000013546799,0.65604925,0.04861878,0.29355496,0.00019962376,0.00021895948],"about_ca_topic_score_codex":0.000026759239,"about_ca_topic_score_gemma":7.5332025e-7,"teacher_disagreement_score":0.71219635,"about_ca_system_score_codex":0.000071012124,"about_ca_system_score_gemma":0.00012760935,"threshold_uncertainty_score":0.99985147},"labels":[],"label_agreement":null},{"id":"W1972308905","doi":"10.1016/s0304-3975(02)00044-0","title":"Optimal three-dimensional orthogonal graph drawing in the general position model","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Grid; Graph drawing; Mathematics; Lattice graph; Position (finance); General position; Enhanced Data Rates for GSM Evolution; Graph; Upper and lower bounds; Geometry; Computer science; Line graph; Artificial intelligence; Mathematical analysis; Voltage graph","score_opus":0.013384602360184827,"score_gpt":0.2546917651174501,"score_spread":0.2413071627572653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972308905","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.3053157,0.000022121014,0.69270086,0.0008595813,0.0002494218,0.00011917567,7.575759e-7,0.00004078328,0.0006915694],"genre_scores_gemma":[0.6761947,6.012205e-7,0.32261333,0.0011111575,0.000063157546,0.000008150882,0.0000022356235,0.0000032530538,0.0000034165012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739707,0.00020581072,0.00028961946,0.0006233226,0.001005918,0.0004782805],"domain_scores_gemma":[0.998979,0.00022073828,0.000053210984,0.00045399924,0.00016589859,0.00012718517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024778133,0.00017094197,0.00013610083,0.0002862793,0.0005561354,0.00043191793,0.0013184685,0.000047402333,0.000016123038],"category_scores_gemma":[0.00005720771,0.00012498426,0.00007544685,0.0018136092,0.00076117425,0.00077643926,0.0002559422,0.00022638516,0.000020062334],"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.0000032019757,0.000048633137,0.000028607688,9.574399e-7,0.0000011197485,0.0000080188065,0.00013758319,0.3461746,0.0004048226,0.65117073,0.000019921023,0.002001782],"study_design_scores_gemma":[0.0001651365,0.00006617828,0.0012486668,0.0000072165567,0.0000019950273,0.00010219986,0.0000015602523,0.7387579,0.0007401282,0.25876334,0.000013626966,0.000132006],"about_ca_topic_score_codex":0.0000017619649,"about_ca_topic_score_gemma":0.000002291473,"teacher_disagreement_score":0.3925833,"about_ca_system_score_codex":0.000050535687,"about_ca_system_score_gemma":0.000275596,"threshold_uncertainty_score":0.50967103},"labels":[],"label_agreement":null},{"id":"W1972483293","doi":"10.1016/s0304-3975(01)00092-5","title":"On two-sided infinite fixed points of morphisms","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Fixed point; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.014840616386578827,"score_gpt":0.24063132006135882,"score_spread":0.22579070367478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972483293","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.08217196,0.000012422561,0.9052111,0.0014740076,0.0002051722,0.0001432536,0.0000021132141,0.00017612016,0.010603838],"genre_scores_gemma":[0.90102386,0.0000021652938,0.09823941,0.0006677962,0.000034496283,0.0000065263753,6.0035916e-7,0.0000054430852,0.000019676087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998019,0.000065297456,0.0002971041,0.0005684753,0.0006541974,0.0003959187],"domain_scores_gemma":[0.9979618,0.00042585604,0.00008914169,0.0011946133,0.00012255661,0.000206005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206962,0.00014917401,0.00018999862,0.00020287187,0.00023099793,0.00016878522,0.002395398,0.000032921467,0.00021119523],"category_scores_gemma":[0.000100209225,0.00012443254,0.000072803254,0.0013550814,0.001729631,0.0003372966,0.0006870849,0.00014525936,0.00043650955],"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.0000014073566,0.00010376925,0.000008934382,0.0000022647703,0.000001953068,0.0000045513975,0.00023341876,0.00015820531,0.0029287608,0.9770909,0.00015002157,0.019315818],"study_design_scores_gemma":[0.00025734966,0.0001375609,0.00034540152,0.000024335905,0.0000025360916,0.000017957587,0.0000010707686,0.75287926,0.019411327,0.2266907,0.00008469907,0.00014781945],"about_ca_topic_score_codex":0.00000246913,"about_ca_topic_score_gemma":1.695381e-7,"teacher_disagreement_score":0.81885195,"about_ca_system_score_codex":0.000026929914,"about_ca_system_score_gemma":0.0000288315,"threshold_uncertainty_score":0.63728976},"labels":[],"label_agreement":null},{"id":"W1972876322","doi":"10.1016/s0304-3975(00)00080-3","title":"Sokoban: improving the search with relevance cuts","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Relevance (law); Computer science; Context (archaeology); Reduction (mathematics); Sequence (biology); Current (fluid); Measure (data warehouse); Incremental heuristic search; State (computer science); Artificial intelligence; Algorithm; Search algorithm; Theoretical computer science; Mathematics; Machine learning; Beam search; Data mining","score_opus":0.011189001344637992,"score_gpt":0.2382632445281641,"score_spread":0.22707424318352612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972876322","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.011143938,0.000024603107,0.9763979,0.0043372344,0.0003703,0.0002057134,6.2344014e-7,0.00021904377,0.0073006637],"genre_scores_gemma":[0.8261445,0.000012913124,0.17242487,0.0010787847,0.00017481094,0.000007351163,5.729623e-7,0.0000077539935,0.00014840293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711347,0.00008381652,0.00017917251,0.00079630467,0.0010652359,0.00076199207],"domain_scores_gemma":[0.9979159,0.00023596748,0.000047197056,0.0014577087,0.00015568109,0.000187551],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018476133,0.00017548558,0.00013610916,0.00011791916,0.00076440186,0.0013250752,0.005285604,0.00002297624,0.000023459224],"category_scores_gemma":[0.000045973637,0.000098315046,0.000035048393,0.0019400758,0.002805902,0.0016265906,0.002259094,0.0002537299,0.00013855932],"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.000006032539,0.000027010075,0.00006678984,0.0000032649482,0.0000028823508,0.000042191314,0.00016882057,0.00012739899,0.000110385896,0.8054389,0.00017730442,0.19382903],"study_design_scores_gemma":[0.00024249348,0.00027128312,0.0011756396,0.000025840953,0.000005098149,0.00011204416,0.0000163239,0.97648436,0.001249368,0.016966507,0.0031791423,0.00027191345],"about_ca_topic_score_codex":0.000008654913,"about_ca_topic_score_gemma":0.0000014195931,"teacher_disagreement_score":0.9763569,"about_ca_system_score_codex":0.00004066769,"about_ca_system_score_gemma":0.00010109471,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null},{"id":"W1973037646","doi":"10.1016/j.tcs.2003.05.004","title":"Space-efficient planar convex hull algorithms","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Convex hull; Algorithm; Orthogonal convex hull; Planar; Output-sensitive algorithm; Convex set; Convex polytope; Hull; Space (punctuation); Point (geometry); Regular polygon; Convex combination; Mathematics; Set (abstract data type); Computer science; Combinatorics; Convex body; Convex optimization; Geometry; Engineering","score_opus":0.009997889783895464,"score_gpt":0.24463024862667818,"score_spread":0.23463235884278272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973037646","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.037257053,0.000040618434,0.9557079,0.0031434891,0.0011750945,0.00017454095,0.0000017264575,0.0002499517,0.0022495945],"genre_scores_gemma":[0.6996235,0.0000020235168,0.2994786,0.0006869979,0.00018694828,0.0000048071406,0.0000016878106,0.000004867716,0.000010549036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727106,0.000058985846,0.00027682705,0.0008122354,0.0010003726,0.0005805169],"domain_scores_gemma":[0.99853605,0.00013677777,0.000069381436,0.00064621586,0.00025944263,0.0003521554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011128003,0.00019875292,0.0001906844,0.00029937123,0.00054305926,0.0004893106,0.0017923838,0.000052932355,0.000027190463],"category_scores_gemma":[0.00006392615,0.00017178619,0.00007139888,0.00183911,0.0013476454,0.00044079134,0.00050715427,0.00018271277,0.00027422182],"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.000003277324,0.00008604465,0.000003308475,0.0000028827417,0.0000028572063,0.0000184259,0.0003211837,0.04701877,0.0010403747,0.9390397,0.00003484434,0.012428337],"study_design_scores_gemma":[0.0004136304,0.00020450604,0.00046368025,0.000018274697,0.0000031074567,0.00009340591,0.000004930808,0.7582689,0.013219667,0.22674121,0.00031310134,0.00025562162],"about_ca_topic_score_codex":0.000004288762,"about_ca_topic_score_gemma":3.683934e-7,"teacher_disagreement_score":0.7122985,"about_ca_system_score_codex":0.00012971583,"about_ca_system_score_gemma":0.00033096896,"threshold_uncertainty_score":0.70052373},"labels":[],"label_agreement":null},{"id":"W1973204071","doi":"10.1016/j.tcs.2014.04.019","title":"Locating a backtracking robber on a tree","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Vertex (graph theory); Backtracking; Combinatorics; Graph; Mathematics; Game tree; Computer science; Algorithm; Mathematical economics; Game theory; Sequential game","score_opus":0.009239208138844948,"score_gpt":0.23010799290770806,"score_spread":0.22086878476886312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973204071","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.041456748,0.000009897694,0.9407775,0.0015992159,0.00059797225,0.00008951885,1.3342795e-7,0.00035687373,0.015112184],"genre_scores_gemma":[0.7988077,4.4197463e-7,0.19909456,0.0020395217,0.00003742413,0.000003602315,1.7524292e-7,0.000007071367,0.000009515058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728096,0.0001381213,0.00028057268,0.00086562906,0.000784008,0.0006507151],"domain_scores_gemma":[0.9979786,0.0003992389,0.00007462383,0.0010619531,0.0001805546,0.00030501225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025126624,0.00019333606,0.00019230334,0.00023398336,0.00053513877,0.0005558438,0.0021522448,0.000048353213,0.000016684457],"category_scores_gemma":[0.00020854529,0.00014925849,0.00006718692,0.0012770424,0.001520595,0.0004129217,0.0007086035,0.00023787572,0.00027917072],"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.0000022610484,0.000041098276,0.000023452418,0.000003626427,0.0000011971699,0.0000023527991,0.00018498246,0.00079463,0.0007555119,0.8832781,0.000038104736,0.1148747],"study_design_scores_gemma":[0.00016271793,0.0002178245,0.00022019437,0.000042669835,0.0000016820464,0.000015699346,0.000001437131,0.6156619,0.003490983,0.37993878,0.00008202313,0.00016407088],"about_ca_topic_score_codex":0.0000029690325,"about_ca_topic_score_gemma":4.7986794e-7,"teacher_disagreement_score":0.7573509,"about_ca_system_score_codex":0.000030551455,"about_ca_system_score_gemma":0.00006223509,"threshold_uncertainty_score":0.6086585},"labels":[],"label_agreement":null},{"id":"W1973245383","doi":"10.1016/j.tcs.2012.04.005","title":"Choosing the best among peers","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 en Outaouais","funders":"","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.027247813925103392,"score_gpt":0.2297254077473563,"score_spread":0.20247759382225292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973245383","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.79731816,0.00021210601,0.14573874,0.00047592644,0.0016162536,0.00012642195,0.0000032322364,0.000052634587,0.054456536],"genre_scores_gemma":[0.9979633,0.0000018582159,0.0012051492,0.00026947923,0.00045974544,0.0000041441895,2.8205645e-7,0.00000867595,0.00008737769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987752,0.000043831093,0.00028617456,0.00026966454,0.00008236134,0.0005427827],"domain_scores_gemma":[0.9991068,0.00016399557,0.000109843255,0.000420712,0.000026776761,0.00017184694],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004544037,0.000104417166,0.0001708461,0.00008970795,0.00046146513,0.00020743997,0.0007627077,0.00003696881,0.00014701454],"category_scores_gemma":[0.00014944881,0.0000774022,0.00005979261,0.00043193492,0.0026110485,0.00041384692,0.00020790218,0.00016353595,0.0010774795],"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.0000016668668,0.000026102052,0.02756486,0.0000030935917,0.0000028545535,2.6751476e-7,0.0008399918,0.000025959305,0.000011786302,0.9707042,0.00002349837,0.0007956975],"study_design_scores_gemma":[0.000444381,0.00019461878,0.099094875,0.00009274422,0.0000135252585,0.00006276412,0.00041471273,0.101582535,0.0011770236,0.7908248,0.005285302,0.00081274007],"about_ca_topic_score_codex":0.000013950895,"about_ca_topic_score_gemma":2.0530703e-7,"teacher_disagreement_score":0.20064513,"about_ca_system_score_codex":0.000043469416,"about_ca_system_score_gemma":0.000008754475,"threshold_uncertainty_score":0.9997003},"labels":[],"label_agreement":null},{"id":"W1973736970","doi":"10.1016/j.tcs.2013.08.014","title":"Generation of Combinatorial Structures","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Design Education and Practice","field":"Engineering","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":"Computer science; Mathematics; Combinatorics","score_opus":0.018945886962782123,"score_gpt":0.25999069165725186,"score_spread":0.24104480469446973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973736970","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.45879075,0.000016627442,0.525403,0.0001770583,0.0031468302,0.00011141859,4.3591436e-7,0.00008976363,0.012264055],"genre_scores_gemma":[0.98202944,0.0000013452108,0.017714137,0.00005817782,0.0001886265,0.0000023029897,4.7339964e-7,0.0000032705607,0.0000022422698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995375,0.000021121783,0.00009167647,0.00008159147,0.00016344694,0.00010463066],"domain_scores_gemma":[0.9996454,0.00006412339,0.000012233288,0.00013382641,0.000083038256,0.00006139215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020506362,0.0000436749,0.000052165484,0.00004242131,0.000045362667,0.00006921173,0.0001976663,0.000017891218,0.00044953308],"category_scores_gemma":[0.000035981375,0.00003642272,0.0000104825585,0.0001939702,0.00041985046,0.0002437071,0.000024261803,0.000054637443,0.000055753346],"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":[5.0411325e-7,0.0000066229636,0.0000070127703,0.0000031183692,0.0000011485222,5.9539637e-8,0.0001279343,0.0007693203,0.017470488,0.9704089,0.000559305,0.010645559],"study_design_scores_gemma":[0.00010761234,0.000045845325,0.0016433303,0.0000028852223,0.0000030211124,0.0000044212397,0.0000072204407,0.7188028,0.07080086,0.20819263,0.000295234,0.00009409809],"about_ca_topic_score_codex":0.0000020884065,"about_ca_topic_score_gemma":2.7299182e-8,"teacher_disagreement_score":0.76221627,"about_ca_system_score_codex":0.000012156411,"about_ca_system_score_gemma":0.00001946458,"threshold_uncertainty_score":0.4922072},"labels":[],"label_agreement":null},{"id":"W1973769779","doi":"10.1016/j.tcs.2009.01.026","title":"Dejean’s conjecture holds for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:mn>30</mml:mn></mml:math>","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Conjecture; Scroll; Mathematics; Combinatorics; Computer science; Algorithm; Theology; Philosophy","score_opus":0.022104437405474686,"score_gpt":0.2592753729149596,"score_spread":0.23717093550948493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973769779","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.8505045,0.00010073914,0.13958639,0.0009912649,0.0014831574,0.0001108499,0.00011461089,0.0002829077,0.0068255574],"genre_scores_gemma":[0.96778136,0.00004661797,0.028852312,0.0018439653,0.0010370583,0.0001406224,0.000089051886,0.00011947711,0.00008953262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952153,0.00013270986,0.0008439632,0.0011126599,0.0013784437,0.0013169115],"domain_scores_gemma":[0.9961877,0.0012936216,0.00046261735,0.0012619618,0.00017287591,0.00062126166],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018383426,0.0004953648,0.0003390308,0.00018274387,0.0013009127,0.00068664114,0.0015241109,0.00061414705,0.0007968701],"category_scores_gemma":[0.0009244237,0.0005725566,0.00060059957,0.00065629627,0.0023004855,0.000555887,0.00079102104,0.00072910317,0.00074858643],"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.00020375589,0.00025791334,0.000002655574,0.00018124814,0.00011177044,0.0001096792,0.00079819106,0.00035601942,0.00067758193,0.98620605,0.008762848,0.002332303],"study_design_scores_gemma":[0.0009679706,0.0013791466,0.000037148257,0.00036633926,0.00034833106,0.0005000962,0.00014882172,0.8515557,0.027603539,0.11435838,0.0020420975,0.0006924018],"about_ca_topic_score_codex":0.000035692934,"about_ca_topic_score_gemma":0.000019235593,"teacher_disagreement_score":0.8718476,"about_ca_system_score_codex":0.00002430353,"about_ca_system_score_gemma":0.00044501148,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W1973843421","doi":"10.1016/j.tcs.2004.04.017","title":"Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"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 en Outaouais","funders":"","keywords":"Broadcasting (networking); Upper and lower bounds; Computer science; Constant (computer programming); Network topology; Time complexity; Randomized algorithm; Matching (statistics); Node (physics); Algorithm; Mathematics; Discrete mathematics; Combinatorics; Theoretical computer science; Topology (electrical circuits); Computer network","score_opus":0.028965389273668086,"score_gpt":0.26659885829739577,"score_spread":0.23763346902372767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973843421","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.096060865,0.00011004462,0.90099335,0.0015137095,0.00012065603,0.0002071878,0.000001020163,0.00011475574,0.00087842136],"genre_scores_gemma":[0.87761897,0.00005272203,0.1219379,0.00029751437,0.00006903076,0.000005068144,9.436102e-7,0.000006238537,0.000011586561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979783,0.00033173646,0.0003859287,0.000519643,0.00043590696,0.0003484824],"domain_scores_gemma":[0.99813473,0.00046078247,0.00013977029,0.0007480534,0.00032356285,0.00019311484],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017511193,0.00017870282,0.00035178542,0.00017717644,0.00046733694,0.00024408095,0.0018493645,0.000043997985,0.00004193472],"category_scores_gemma":[0.0001220455,0.0001555463,0.00005058295,0.0009126103,0.0046438007,0.00074728986,0.0014191638,0.00015442143,0.000019461011],"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.000056590558,0.00006337762,0.000057775862,0.0000071644968,0.000004292004,0.0000012920244,0.0010881068,0.00060958514,0.0010544895,0.8616571,0.000016518692,0.13538374],"study_design_scores_gemma":[0.0010534659,0.00014748848,0.0023771024,0.00006196535,0.000005253716,0.00003535005,0.0000029384212,0.98396295,0.0038657794,0.008117934,0.00016723758,0.00020251876],"about_ca_topic_score_codex":9.210241e-7,"about_ca_topic_score_gemma":0.000001181294,"teacher_disagreement_score":0.9833534,"about_ca_system_score_codex":0.00004680288,"about_ca_system_score_gemma":0.00010243543,"threshold_uncertainty_score":0.998065},"labels":[],"label_agreement":null},{"id":"W1974431732","doi":"10.1016/j.tcs.2006.12.025","title":"A fibrational framework for possible-world semantics of Algol-like languages","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"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":"Programming language; Semantics (computer science); Computer science","score_opus":0.010800591204830524,"score_gpt":0.27910980784303674,"score_spread":0.2683092166382062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974431732","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.014134446,0.000050445404,0.98111427,0.0019015366,0.00043534156,0.00017453679,0.0000036584024,0.00013963517,0.0020461334],"genre_scores_gemma":[0.5179386,5.785604e-7,0.48167992,0.00024675074,0.00010245257,0.000004217912,8.542764e-7,0.0000034225422,0.000023213423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981914,0.00004129321,0.0003040904,0.0004881454,0.00053890195,0.00043617724],"domain_scores_gemma":[0.998172,0.00085106137,0.00010250066,0.00061406015,0.0001769327,0.00008344459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067619834,0.0001491553,0.00022637424,0.00018125933,0.0002171579,0.00023183892,0.0017585556,0.000055149263,0.000031496606],"category_scores_gemma":[0.00011922357,0.000118960204,0.00008841395,0.0010202805,0.0017473234,0.0003724147,0.000596532,0.000104904604,0.000014656304],"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.000006065011,0.000051915118,0.00048247504,0.000014123914,0.0000029348182,0.0000037935772,0.000102241014,0.00029606887,0.00032670205,0.99338186,0.00038930273,0.0049425466],"study_design_scores_gemma":[0.00013846754,0.00011265858,0.0055716345,0.00003440634,0.0000050107315,0.000011919244,0.000005673999,0.28365278,0.009642104,0.7005639,0.00011379794,0.00014761671],"about_ca_topic_score_codex":0.000011234285,"about_ca_topic_score_gemma":0.000005460934,"teacher_disagreement_score":0.50380415,"about_ca_system_score_codex":0.000022282422,"about_ca_system_score_gemma":0.000106214706,"threshold_uncertainty_score":0.6438086},"labels":[],"label_agreement":null},{"id":"W1974556260","doi":"10.1016/j.tcs.2007.07.030","title":"Regulated RNA rewriting: Modelling RNA editing with guided insertion","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA regulation and disease","field":"Biochemistry, Genetics and Molecular Biology","cited_by":33,"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":"Rewriting; RNA editing; String (physics); Computer science; RNA; Hierarchy; Expressive power; Programming language; Computational biology; Theoretical computer science; Biology; Genetics; Mathematics; Gene","score_opus":0.01282860748196446,"score_gpt":0.2558930196954486,"score_spread":0.24306441221348413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974556260","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.49313542,0.000010690169,0.50294983,0.00013675609,0.00006274235,0.00005392867,4.011515e-7,0.000023481602,0.0036267228],"genre_scores_gemma":[0.968343,0.0000028200038,0.030835552,0.00040500707,0.00036664683,0.0000012377341,0.000009518038,0.000010251,0.000025951502],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998675,0.000029861343,0.0002078936,0.00040265612,0.00033443514,0.0003501897],"domain_scores_gemma":[0.9991507,0.00001709073,0.00006245771,0.00031084317,0.00022496167,0.00023395389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009136104,0.0001145819,0.000085001964,0.00007680622,0.00023542586,0.00008234834,0.0002830002,0.000059197067,0.0000152212715],"category_scores_gemma":[0.000054867476,0.00009274117,0.000035600704,0.00034327104,0.0009716211,0.000014853239,0.00012901596,0.00006715096,0.0000059706927],"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.0004296606,0.00013575975,0.0007498593,0.000021683883,0.000017391345,0.00003200951,0.00014521614,0.043668237,0.52781826,0.39526495,0.00027363404,0.031443324],"study_design_scores_gemma":[0.00073969766,0.00030604893,0.0022760157,0.00006032185,0.000012942348,0.000049445094,0.000029979836,0.66585064,0.32252955,0.007482295,0.00033083282,0.00033224086],"about_ca_topic_score_codex":0.0000029876828,"about_ca_topic_score_gemma":7.946744e-7,"teacher_disagreement_score":0.62218237,"about_ca_system_score_codex":0.00001831951,"about_ca_system_score_gemma":0.00006618924,"threshold_uncertainty_score":0.3781875},"labels":[],"label_agreement":null},{"id":"W1975186848","doi":"10.1016/s0304-3975(99)00184-x","title":"New applications of the incompressibility method: Part II","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum chaos and dynamical systems","field":"Physics and Astronomy","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Elegance; Mathematical proof; Simple (philosophy); Calculus (dental); Mathematics; Computer science; Algebra over a field; Pure mathematics; Philosophy; Epistemology; Geometry","score_opus":0.0059439218548182834,"score_gpt":0.2633709874255664,"score_spread":0.2574270655707481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975186848","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.10224946,0.0000052192686,0.8772365,0.0002441499,0.00009446213,0.0001939465,0.0000070292785,0.000016404048,0.019952849],"genre_scores_gemma":[0.97926027,1.12366294e-7,0.020290185,0.000046186367,0.00022788644,0.000008216911,5.7297905e-7,0.0000029052092,0.000163659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999001,0.000076516,0.00020839325,0.0002607481,0.0002605652,0.00019273361],"domain_scores_gemma":[0.9991646,0.00009793667,0.000045975157,0.0005225331,0.000042719264,0.00012626176],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004985702,0.00007598262,0.0001294982,0.000013413674,0.00029712595,0.000034596414,0.0007503771,0.000015608643,0.0015800144],"category_scores_gemma":[0.0000024988187,0.00004441324,0.00007439353,0.00043057444,0.0009468003,0.00006661094,0.0002546386,0.000094945666,0.000022982951],"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.000002170412,0.000038295897,0.00053886685,0.0000016824179,0.0000019539514,1.26559385e-8,0.00006859891,0.00018169571,0.000084385916,0.85281175,0.00004961581,0.14622097],"study_design_scores_gemma":[0.00014498792,0.000040042403,0.0026730539,0.00002171963,0.000007993841,7.7207545e-7,0.0000062978866,0.18388626,0.0021033913,0.80684066,0.004165846,0.00010897175],"about_ca_topic_score_codex":0.00007320464,"about_ca_topic_score_gemma":3.4249592e-7,"teacher_disagreement_score":0.8770108,"about_ca_system_score_codex":0.000008727334,"about_ca_system_score_gemma":0.000066061664,"threshold_uncertainty_score":0.99933267},"labels":[],"label_agreement":null},{"id":"W1975387410","doi":"10.1016/j.tcs.2003.09.012","title":"Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Game theory; Mathematical economics; Mathematics","score_opus":0.05169847140430342,"score_gpt":0.3529689354392122,"score_spread":0.30127046403490876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975387410","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.171807,0.00011829053,0.44760284,0.004398869,0.0037590626,0.0031503513,0.000045020326,0.00021590349,0.36890268],"genre_scores_gemma":[0.9944786,0.0000034528066,0.0020319764,0.0010937847,0.00015591574,0.00007299058,0.0000017358176,0.000016803082,0.002144771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993753,0.0014790898,0.0006269825,0.0012749424,0.002103838,0.00076213595],"domain_scores_gemma":[0.9923289,0.004562246,0.00021659491,0.002230106,0.0003010691,0.00036113092],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.022447132,0.0002869486,0.00036315736,0.00016764957,0.0016044622,0.0014041848,0.007364889,0.000084757776,0.0045509604],"category_scores_gemma":[0.0016599596,0.0001595008,0.00011903044,0.0020908809,0.007738893,0.00046079722,0.00206341,0.00038935602,0.0097884815],"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.00004459143,0.00014931765,0.000018838004,9.228364e-7,0.000004294424,0.0000032735174,0.0005735854,0.00021610424,0.0002909441,0.9807497,0.0023789362,0.015569449],"study_design_scores_gemma":[0.0004540539,0.00027721268,0.000128821,0.000019384752,0.000008923255,0.000050900147,0.00009856287,0.0057505644,0.0050596944,0.95485294,0.03305077,0.00024817686],"about_ca_topic_score_codex":0.0000020082746,"about_ca_topic_score_gemma":8.631217e-7,"teacher_disagreement_score":0.8226716,"about_ca_system_score_codex":0.00010441431,"about_ca_system_score_gemma":0.0001674056,"threshold_uncertainty_score":0.9996953},"labels":[],"label_agreement":null},{"id":"W1975531816","doi":"10.1016/j.tcs.2008.07.026","title":"Arbitrary pattern formation by asynchronous, anonymous, oblivious robots","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":false,"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":"Robot; Task (project management); Asynchronous communication; Set (abstract data type); Computer science; Mobile robot; Compass; Point (geometry); Artificial intelligence; Mathematics; Engineering; Geography; Geometry; Programming language","score_opus":0.011354233580310269,"score_gpt":0.22968399274611032,"score_spread":0.21832975916580005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975531816","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.0083896,0.000050388604,0.98465955,0.0015905767,0.00030641974,0.00023935088,0.0000027180024,0.00038372647,0.0043776967],"genre_scores_gemma":[0.8455457,0.000043620767,0.15243077,0.0018637753,0.0000634902,0.000009900119,0.0000055275555,0.000009324222,0.00002785949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717176,0.00014132216,0.0003453802,0.00065915,0.0009624618,0.0007199518],"domain_scores_gemma":[0.9984288,0.00011861402,0.00008308946,0.00075801386,0.000215606,0.00039588386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319247,0.00020439594,0.00019782482,0.00021299774,0.00078570715,0.0004251479,0.0023511215,0.0000648234,0.00008717705],"category_scores_gemma":[0.0000366599,0.00017554729,0.000061690094,0.0011700409,0.0018663896,0.002069125,0.00080769946,0.00025014198,0.00023447683],"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.0000053412314,0.00025413194,0.00024174567,0.000017989392,0.00000576817,0.000055545417,0.0018621123,0.0024667934,0.0009579968,0.8919352,0.0041014594,0.09809588],"study_design_scores_gemma":[0.00029226745,0.00024099309,0.00042799354,0.000018160528,0.000001426021,0.00023280598,0.000002902508,0.9799327,0.0032819558,0.015015024,0.00027144796,0.00028232805],"about_ca_topic_score_codex":0.000006660031,"about_ca_topic_score_gemma":5.597788e-7,"teacher_disagreement_score":0.9774659,"about_ca_system_score_codex":0.000090032954,"about_ca_system_score_gemma":0.00019223681,"threshold_uncertainty_score":0.7158611},"labels":[],"label_agreement":null},{"id":"W1975687894","doi":"10.1016/j.tcs.2012.11.024","title":"Generating bracelets with fixed content","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Mathematics; Combinatorics; Constant (computer programming); Content (measure theory); Fixed point; Discrete mathematics; Computer science; Algorithm; Data structure; Programming language","score_opus":0.02246921449861843,"score_gpt":0.24451280825694888,"score_spread":0.22204359375833044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975687894","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.08810658,0.00006727284,0.9097724,0.0003617901,0.0005562043,0.00011363183,0.0000010342636,0.00017533904,0.00084577035],"genre_scores_gemma":[0.58623326,0.0000010803964,0.41302034,0.0005379919,0.00018948082,0.0000041152557,6.9652356e-7,0.000004447323,0.000008596128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976952,0.00007896228,0.00020144004,0.0005105595,0.00074149494,0.0007723193],"domain_scores_gemma":[0.99834216,0.00013581512,0.000068805784,0.0008543293,0.00015529168,0.00044357943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595938,0.00017514592,0.00016930852,0.00009419239,0.00052623847,0.00047340733,0.0018559237,0.00003480888,0.00003262364],"category_scores_gemma":[0.00003818954,0.000112510264,0.000032835724,0.00065766624,0.0011517062,0.0018514307,0.0013127167,0.00016927846,0.00007896845],"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.0000048325724,0.00007216443,0.00048008983,0.0000029441671,0.000002785722,0.0000063436255,0.0002984771,0.00011571557,0.003333998,0.93429846,0.000105348205,0.061278857],"study_design_scores_gemma":[0.0003564657,0.00026196172,0.004191547,0.00004550683,0.0000044153044,0.00015813866,0.000011420429,0.9787627,0.012064718,0.0031246226,0.0006474094,0.0003711231],"about_ca_topic_score_codex":0.000004507545,"about_ca_topic_score_gemma":2.3042341e-7,"teacher_disagreement_score":0.97864693,"about_ca_system_score_codex":0.000040066265,"about_ca_system_score_gemma":0.00007425308,"threshold_uncertainty_score":0.45880353},"labels":[],"label_agreement":null},{"id":"W1976525036","doi":"10.1016/j.tcs.2012.12.025","title":"Weak near-unanimity functions and digraph homomorphism problems","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Digraph; Unanimity; Homomorphism; Mathematics; Combinatorics; Conjecture; Algebraic number; Context (archaeology); Discrete mathematics; Constraint satisfaction problem; Measure (data warehouse); Computer science","score_opus":0.013713714101190025,"score_gpt":0.24758432885136222,"score_spread":0.2338706147501722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976525036","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.0965171,0.00007090514,0.89500046,0.0018935085,0.00033139854,0.0004682768,0.0000015015554,0.0003287174,0.005388164],"genre_scores_gemma":[0.8977809,0.00001052455,0.10175448,0.0002618945,0.000050024617,0.000051162544,5.256496e-7,0.0000108225095,0.00007968724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966635,0.0001385789,0.00028557886,0.0011206274,0.0008509414,0.0009407915],"domain_scores_gemma":[0.9973427,0.00032028375,0.00006290417,0.0012951709,0.0003613168,0.00061759533],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001418593,0.00024109302,0.00023757594,0.00026211192,0.0011891312,0.0014691399,0.0024742584,0.00006486375,0.00011855037],"category_scores_gemma":[0.000105831146,0.00019190535,0.000069712594,0.0021539908,0.008800505,0.001984971,0.002042435,0.0003886626,0.0003822318],"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.0000023860857,0.00005510635,0.0004477643,0.0000071454947,0.0000042207275,0.0000031472368,0.00022570837,0.000077762714,0.00096080836,0.9542558,0.0001273515,0.043832798],"study_design_scores_gemma":[0.00020962619,0.00024772904,0.008115592,0.00002024437,0.0000027650049,0.000079965255,0.000012233211,0.33899698,0.00045906327,0.65121675,0.00036998876,0.00026907978],"about_ca_topic_score_codex":0.000017641387,"about_ca_topic_score_gemma":0.000001426577,"teacher_disagreement_score":0.8012638,"about_ca_system_score_codex":0.000041481475,"about_ca_system_score_gemma":0.00011503427,"threshold_uncertainty_score":0.99956745},"labels":[],"label_agreement":null},{"id":"W1976939532","doi":"10.1016/j.tcs.2015.03.042","title":"Finding median in read-only memory on integer input","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sequence (biology); Integer (computer science); Logarithm; Algorithm; Binary number; Mathematics; Combinatorics; Selection (genetic algorithm); Simple (philosophy); Upper and lower bounds; Space (punctuation); Time complexity; Binary logarithm; Computer science; Discrete mathematics; Arithmetic; Artificial intelligence","score_opus":0.035885963671493847,"score_gpt":0.2864995203129722,"score_spread":0.2506135566414784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976939532","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.048979666,0.000021051002,0.9169729,0.0035653878,0.0019314976,0.00018699338,0.000001258208,0.00024585717,0.02809544],"genre_scores_gemma":[0.8810693,0.0000018338744,0.11731174,0.0013979458,0.00018136289,0.0000055476194,6.1327484e-7,0.000007765221,0.000023871029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966947,0.00018263551,0.00035224477,0.00090061815,0.0011090288,0.0007607724],"domain_scores_gemma":[0.9977831,0.0004166936,0.00006507597,0.0010409332,0.00016095045,0.00053320476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030842407,0.0002320113,0.00026878587,0.0006221012,0.00022092875,0.0004340941,0.0036349907,0.000073893585,0.00003633712],"category_scores_gemma":[0.00031771747,0.00019451292,0.00006622672,0.0023536007,0.002497015,0.00077513006,0.0014955217,0.00047882568,0.00019651004],"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.000008462273,0.0000772399,0.00010833281,0.0000026954972,0.000001421281,0.00005557469,0.0014031987,0.00022760911,0.000017367745,0.89776736,0.00014018058,0.100190565],"study_design_scores_gemma":[0.00038849533,0.0003349211,0.0008374221,0.00007747268,0.0000012697105,0.00006657669,0.00003174299,0.5107821,0.0007558133,0.4861541,0.00027948033,0.00029055364],"about_ca_topic_score_codex":0.000017542961,"about_ca_topic_score_gemma":0.000008539628,"teacher_disagreement_score":0.83208966,"about_ca_system_score_codex":0.00016592794,"about_ca_system_score_gemma":0.00036770952,"threshold_uncertainty_score":0.9200356},"labels":[],"label_agreement":null},{"id":"W1976985540","doi":"10.1016/j.tcs.2012.01.001","title":"Monoidal indeterminates and categories of possible worlds","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Enriched category; Symmetric monoidal category; Mathematics; Functor; Closed monoidal category; Monoidal category; Higher category theory; Monad (category theory); Pure mathematics; Closed category; Algebra over a field","score_opus":0.012543163790986496,"score_gpt":0.24814296194040109,"score_spread":0.2355997981494146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976985540","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.11292259,0.00024309497,0.8822609,0.00013755546,0.0006579807,0.000112854745,2.2041208e-7,0.00009531475,0.003569448],"genre_scores_gemma":[0.97119325,0.0000035454498,0.028582176,0.0000712299,0.00011757268,0.0000043451837,1.7448482e-7,0.000004305018,0.000023388517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984096,0.00006998806,0.00023008604,0.00034067465,0.00040433634,0.00054527883],"domain_scores_gemma":[0.99894786,0.00012662532,0.000081439386,0.00046597508,0.00011638873,0.0002616951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013452438,0.00013681971,0.00020291003,0.00014749602,0.00021226698,0.00025510826,0.0011406756,0.00004789561,0.000008381083],"category_scores_gemma":[0.000042315638,0.0000996258,0.00003551772,0.00069374865,0.0025228765,0.0009189906,0.0008722442,0.000106949985,0.000017110373],"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.000002129512,0.000039694798,0.005056811,0.000013940058,0.000002352733,0.0000015948407,0.0014791465,0.0000017936087,0.00026370367,0.9408665,0.0000073998426,0.052264974],"study_design_scores_gemma":[0.0004222162,0.00060228567,0.026387034,0.000015871834,0.000012871027,0.00019092677,0.00006683632,0.13372572,0.0435882,0.7939531,0.00045599532,0.00057893054],"about_ca_topic_score_codex":0.0000118365715,"about_ca_topic_score_gemma":5.0540245e-7,"teacher_disagreement_score":0.85827065,"about_ca_system_score_codex":0.000018484816,"about_ca_system_score_gemma":0.000056817757,"threshold_uncertainty_score":0.92956436},"labels":[],"label_agreement":null},{"id":"W1977603728","doi":"10.1016/j.tcs.2008.04.034","title":"Memoryless search algorithms in a network with faulty advice","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Advice (programming); Node (physics); Shortest path problem; Computer science; Network topology; Graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Path (computing); Discrete mathematics; Mathematics; Randomized algorithm; Algorithm; Theoretical computer science; Computer network; Artificial intelligence","score_opus":0.01864963886820921,"score_gpt":0.2649793731140586,"score_spread":0.24632973424584942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977603728","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.020740531,0.000017711074,0.9728495,0.0011326128,0.000170771,0.00025711692,4.6456992e-7,0.00024058476,0.0045907185],"genre_scores_gemma":[0.6049069,0.000010530281,0.39445662,0.0005177963,0.000066430206,0.000008172669,4.930879e-7,0.000006285919,0.000026742468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966659,0.00020424734,0.00026251172,0.00079579256,0.0011325489,0.00093899976],"domain_scores_gemma":[0.9983534,0.00020099817,0.000037445174,0.0007501576,0.00028820886,0.00036977237],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018314454,0.00017687066,0.00022202822,0.00022469356,0.00052757177,0.00026933008,0.0024781635,0.00004842264,0.000037988997],"category_scores_gemma":[0.00002765921,0.00013263516,0.000032168824,0.0033900929,0.0028755292,0.0008467724,0.00096605526,0.00035246296,0.00007033955],"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.00001505799,0.0001023079,0.00073295046,0.000005825206,0.0000025952531,0.00013879796,0.0014762135,0.06366836,0.000015474136,0.9208301,0.00009002022,0.012922303],"study_design_scores_gemma":[0.0004694206,0.00024384807,0.0029502122,0.00003467224,7.0979934e-7,0.00015726977,0.000008668375,0.9877713,0.00020329728,0.007863367,0.00007983658,0.00021740455],"about_ca_topic_score_codex":0.000015548265,"about_ca_topic_score_gemma":0.000004161977,"teacher_disagreement_score":0.92410296,"about_ca_system_score_codex":0.00007250013,"about_ca_system_score_gemma":0.00036363673,"threshold_uncertainty_score":0.99983805},"labels":[],"label_agreement":null},{"id":"W1977833242","doi":"10.1016/s0304-3975(01)00345-0","title":"On the non-termination of MDG-based abstract state enumeration","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Formalism (music); Class (philosophy); Computer science; Mathematics; Theoretical computer science; Set (abstract data type); Algorithm; Discrete mathematics; Artificial intelligence; Programming language","score_opus":0.015227341185832211,"score_gpt":0.2818545029618386,"score_spread":0.2666271617760064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977833242","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.10742956,0.0000021406163,0.8886534,0.00033446032,0.0003600766,0.00018677248,0.0000011263411,0.000044094006,0.002988406],"genre_scores_gemma":[0.72103363,4.5986596e-7,0.2786382,0.00030382434,0.000010731134,0.000006939427,3.1981995e-7,0.0000033065062,0.0000025699585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981407,0.00020918711,0.00028919603,0.0003863738,0.00069909485,0.0002754606],"domain_scores_gemma":[0.99813795,0.0005681037,0.00015015529,0.00083008537,0.00023270579,0.0000809813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038280098,0.000120970544,0.000114980685,0.00014326221,0.0002753068,0.00020773828,0.0014090863,0.000032427484,0.000036923713],"category_scores_gemma":[0.0004859678,0.000081363796,0.00004448847,0.0008909742,0.0013152342,0.00046590003,0.0000978157,0.00015394068,0.00005262068],"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.0000045539978,0.000051124694,0.000009425245,0.0000048941965,9.172171e-7,8.3185813e-7,0.00016757414,0.0015704934,0.0027588003,0.97514457,0.0000134221455,0.020273421],"study_design_scores_gemma":[0.00009365103,0.00015586909,0.0017016315,0.000019264366,0.0000012041761,0.000002925564,0.0000016052566,0.6271143,0.21315233,0.15764405,0.000025548185,0.00008761175],"about_ca_topic_score_codex":9.5543e-7,"about_ca_topic_score_gemma":1.108932e-7,"teacher_disagreement_score":0.8175005,"about_ca_system_score_codex":0.00005194407,"about_ca_system_score_gemma":0.00014650838,"threshold_uncertainty_score":0.48460352},"labels":[],"label_agreement":null},{"id":"W1977986119","doi":"10.1016/j.tcs.2007.07.041","title":"Optimal lower bounds for rank and select indexes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Eidgenössische Technische Hochschule Zürich","keywords":"Rank (graph theory); Data structure; Upper and lower bounds; Computer science; Word (group theory); Combinatorics; Binary logarithm; Space (punctuation); Index (typography); Order (exchange); Algorithm; Mathematics; Discrete mathematics","score_opus":0.007316668029087797,"score_gpt":0.2601985053427479,"score_spread":0.2528818373136601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977986119","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.055953927,0.000053763593,0.94220525,0.0003415271,0.00062637,0.00018589874,0.000002560322,0.00013644545,0.00049426896],"genre_scores_gemma":[0.58222663,0.0000026408757,0.41730988,0.00031295035,0.00013216872,0.0000030202264,6.8558353e-7,0.0000045494517,0.0000074881636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784076,0.00002695037,0.00023437881,0.000724851,0.0004973995,0.0006756825],"domain_scores_gemma":[0.99847806,0.00041218672,0.00005126259,0.00057357317,0.00017367206,0.0003112525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023693503,0.0001681062,0.00017900298,0.00016066847,0.00058389554,0.00062447716,0.0016088652,0.0000597811,0.0000102357835],"category_scores_gemma":[0.00007121933,0.00012906302,0.000045865152,0.00065570156,0.0017539539,0.00087233895,0.0011659589,0.00014401364,0.000009061354],"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.000030393188,0.000041433814,0.000045372715,0.0000052052524,0.0000024649369,0.000008041648,0.00016988991,0.000038948863,0.00059566204,0.9013503,0.00014539769,0.09756687],"study_design_scores_gemma":[0.00060599786,0.0006197638,0.0019622939,0.000029545927,0.000004913131,0.00008241127,0.000004050008,0.91044116,0.0063582603,0.07727003,0.0022830027,0.00033855307],"about_ca_topic_score_codex":0.000002326927,"about_ca_topic_score_gemma":4.3765812e-7,"teacher_disagreement_score":0.91040224,"about_ca_system_score_codex":0.00003169372,"about_ca_system_score_gemma":0.00008935645,"threshold_uncertainty_score":0.6462516},"labels":[],"label_agreement":null},{"id":"W1978012637","doi":"10.1016/s0304-3975(00)00081-5","title":"Multi-cut αβ-pruning in game-tree search","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Tree (set theory); Search tree; Computer science; Mathematics; Artificial intelligence; Algorithm; Theoretical computer science; Machine learning; Combinatorics; Search algorithm; Horticulture","score_opus":0.04424988244330528,"score_gpt":0.32716459449050206,"score_spread":0.28291471204719676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978012637","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.19398218,0.000027491613,0.80094886,0.001170833,0.00047662738,0.00017156749,2.6118434e-7,0.0002145538,0.0030076017],"genre_scores_gemma":[0.797716,0.00001166416,0.20165806,0.00046962962,0.00009412576,0.0000063798007,1.9045682e-7,0.000009535187,0.000034414858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613833,0.00019739929,0.00045654314,0.0010601291,0.0010022586,0.0011453623],"domain_scores_gemma":[0.99778813,0.00042252333,0.000054534958,0.0011483022,0.00022699678,0.00035951234],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025289399,0.00023662529,0.0002616131,0.00048584945,0.0002888455,0.0006527061,0.004674426,0.0000802196,0.00007152627],"category_scores_gemma":[0.0002222664,0.00020907073,0.00007045722,0.0029455593,0.0035121709,0.0011839775,0.0019811755,0.00045036772,0.00047166485],"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.000008226563,0.00012534611,0.0019384143,0.0000031042784,0.0000016669669,0.000105996536,0.0020725934,0.0023649815,0.0020622876,0.8469458,0.000011116918,0.14436047],"study_design_scores_gemma":[0.00012364198,0.00012131793,0.004890015,0.00004448416,0.0000011046338,0.00006495232,0.000042210137,0.9390355,0.010766026,0.04448883,0.00014479319,0.0002771732],"about_ca_topic_score_codex":0.00004324199,"about_ca_topic_score_gemma":0.000034297183,"teacher_disagreement_score":0.9366705,"about_ca_system_score_codex":0.00014742745,"about_ca_system_score_gemma":0.00019981217,"threshold_uncertainty_score":0.9991997},"labels":[],"label_agreement":null},{"id":"W1978312982","doi":"10.1016/j.tcs.2003.08.013","title":"Periodicity and arithmetic-periodicity in hexadecimal games","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Arithmetic; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.01535544461742095,"score_gpt":0.26707115867993225,"score_spread":0.2517157140625113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978312982","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.38485542,0.00007176559,0.6110252,0.00061594055,0.0003067017,0.00013418868,4.86739e-7,0.00009560476,0.0028946376],"genre_scores_gemma":[0.85261756,0.000011247089,0.146703,0.00061245885,0.00003556645,0.0000074398836,8.129961e-8,0.000006301986,0.0000063533253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676377,0.00024721754,0.00042167396,0.0010290508,0.0007280896,0.0008101884],"domain_scores_gemma":[0.9982882,0.0003762019,0.000064573986,0.0007770027,0.00014360195,0.00035039693],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024640223,0.00024253687,0.00030653575,0.00030669014,0.0004109012,0.00081230036,0.0018113665,0.00008039272,0.000066288965],"category_scores_gemma":[0.00058550114,0.0002090903,0.00005068042,0.001471432,0.006464244,0.0009003158,0.00079851603,0.00034638747,0.000062654726],"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.000003994764,0.00006743034,0.0031027424,0.0000041718154,0.0000012887451,0.000026403703,0.0013234203,0.00008182816,0.00042992336,0.9611204,0.000008275413,0.033830117],"study_design_scores_gemma":[0.00021120337,0.00031088435,0.016121812,0.00005173845,0.00000366641,0.00017063174,0.0000934539,0.5101954,0.02558046,0.4461759,0.000536952,0.00054792274],"about_ca_topic_score_codex":0.00002173771,"about_ca_topic_score_gemma":0.000007467654,"teacher_disagreement_score":0.5149445,"about_ca_system_score_codex":0.00008496594,"about_ca_system_score_gemma":0.00020938234,"threshold_uncertainty_score":0.9962396},"labels":[],"label_agreement":null},{"id":"W1978562199","doi":"10.1016/j.tcs.2007.10.003","title":"Change of order for regular chains in positive dimension","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"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":"Dimension (graph theory); Mathematics; Modular design; Subroutine; Algebraic number; Variable (mathematics); Order (exchange); Zero (linguistics); Chain (unit); Computation; Symbolic computation; Algebra over a field; Applied mathematics; Pure mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.013504122682615272,"score_gpt":0.26307325647754887,"score_spread":0.2495691337949336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978562199","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.17785215,0.000020135267,0.8203125,0.00095334527,0.00034373882,0.00028065703,0.0000010698029,0.000041144394,0.00019524294],"genre_scores_gemma":[0.83444506,9.663679e-7,0.16505088,0.00039647723,0.00009382085,0.000005376335,8.002249e-7,0.0000037569382,0.0000028675609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983925,0.000037228016,0.0002864597,0.00045654608,0.0003677875,0.00045945495],"domain_scores_gemma":[0.99889517,0.00034349295,0.00007497279,0.00033302014,0.00022287799,0.00013046886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019653374,0.000116022115,0.00017779852,0.00028965026,0.00012022338,0.000054633703,0.00092931127,0.00004188433,0.0000022384017],"category_scores_gemma":[0.00007359554,0.00009808916,0.00004510945,0.0013699812,0.0008601127,0.00044679426,0.00047149236,0.0000802069,0.0000038219855],"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.000018346122,0.00005635376,0.000049638726,0.0000060828747,0.0000011351558,0.000004124294,0.0010840284,0.00004628198,0.0020202887,0.8965161,0.0000038602075,0.10019377],"study_design_scores_gemma":[0.0005283034,0.0004422773,0.017262401,0.000077223056,0.0000024011294,0.000010155946,0.000010124237,0.7601482,0.03523023,0.18605354,0.00002986879,0.00020523787],"about_ca_topic_score_codex":0.000011714896,"about_ca_topic_score_gemma":0.000004216891,"teacher_disagreement_score":0.7601019,"about_ca_system_score_codex":0.000055957804,"about_ca_system_score_gemma":0.00006596444,"threshold_uncertainty_score":0.39999595},"labels":[],"label_agreement":null},{"id":"W1978592724","doi":"10.1016/s0304-3975(02)00574-1","title":"Weak repetitions in Sturmian strings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Mathematics; String (physics); Quadratic equation; Combinatorics; Encoding (memory); Discrete mathematics; Algorithm; Computer science","score_opus":0.007899106622770134,"score_gpt":0.23426777702779686,"score_spread":0.22636867040502673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978592724","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.070305906,0.00003090373,0.8968337,0.00076117326,0.0005209872,0.0001318688,7.5111444e-7,0.00023511634,0.031179601],"genre_scores_gemma":[0.886992,0.0000037996647,0.11246513,0.00047327369,0.000034013472,0.0000068063487,2.3397905e-7,0.00000566931,0.000019090707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976884,0.00015820189,0.00028057516,0.0007266286,0.00051534444,0.00063081225],"domain_scores_gemma":[0.9984837,0.00022328069,0.000048201447,0.00093845674,0.000076304306,0.0002300185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020947428,0.000160263,0.00017762686,0.00028433348,0.00027226764,0.00039604836,0.0020369773,0.000046950645,0.0000699068],"category_scores_gemma":[0.00016104817,0.00013722948,0.000052505355,0.0017978814,0.0014772082,0.0007835573,0.00050429197,0.00022726107,0.000111908055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.903164e-7,0.000058772242,0.00013030857,0.000002320156,9.0029204e-7,0.000016404372,0.00019485388,0.000050743132,0.00036816087,0.98782337,0.000027927412,0.011325253],"study_design_scores_gemma":[0.00034706932,0.000108235734,0.004670815,0.00005175716,0.0000018117963,0.000102856415,0.00002833724,0.12584512,0.005238453,0.8620648,0.0012066162,0.0003341598],"about_ca_topic_score_codex":0.0000039161996,"about_ca_topic_score_gemma":0.0000018589767,"teacher_disagreement_score":0.8166861,"about_ca_system_score_codex":0.00007686179,"about_ca_system_score_gemma":0.00014160041,"threshold_uncertainty_score":0.5596056},"labels":[],"label_agreement":null},{"id":"W1978707564","doi":"10.1016/j.tcs.2012.04.011","title":"Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Suffix; Prefix; Regular language; Cardinality (data modeling); Mathematics; Combinatorics; Discrete mathematics; Conjecture; Upper and lower bounds; Computer science; Linguistics; Artificial intelligence; Automaton","score_opus":0.020163731806501314,"score_gpt":0.2615775143125849,"score_spread":0.24141378250608359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978707564","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.46932036,0.00031048057,0.52759427,0.0005915266,0.00036970017,0.00014314607,0.0000083514315,0.0002022778,0.001459909],"genre_scores_gemma":[0.890584,0.000008567746,0.10904553,0.0002275181,0.00011491271,0.0000031587597,6.70644e-7,0.000009397969,0.000006282673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974474,0.00018343348,0.00032994745,0.0005639564,0.00072166964,0.00075363973],"domain_scores_gemma":[0.9974046,0.00042227373,0.00013086022,0.0015094789,0.000120108896,0.00041272485],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015866605,0.0002334236,0.00033547197,0.00020083415,0.00027001122,0.00022434151,0.0027618653,0.00006783159,0.00005996203],"category_scores_gemma":[0.00020754365,0.00018309864,0.00006933842,0.0007866374,0.0050821365,0.001323844,0.002314207,0.0001891402,0.000021894453],"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.000005713192,0.00009534347,0.0008403189,0.000026589558,0.0000068938994,0.0000032387222,0.0010645861,0.0000020288921,0.0033382776,0.9802919,0.0000319789,0.014293135],"study_design_scores_gemma":[0.0008270251,0.0005136412,0.09061481,0.00015471742,0.00002707642,0.00028689875,0.00014604536,0.1431511,0.083146326,0.680051,0.00017924634,0.0009020601],"about_ca_topic_score_codex":0.000012632529,"about_ca_topic_score_gemma":5.199546e-7,"teacher_disagreement_score":0.4212636,"about_ca_system_score_codex":0.000038827657,"about_ca_system_score_gemma":0.000058179776,"threshold_uncertainty_score":0.99762547},"labels":[],"label_agreement":null},{"id":"W1979205601","doi":"10.1016/s0304-3975(00)00365-0","title":"Approximate periods of strings","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Variety (cybernetics); Mathematics; Time complexity; Algorithm; Data compression; Computer science; Theoretical computer science; Combinatorics; Discrete mathematics; Artificial intelligence","score_opus":0.009637200902656283,"score_gpt":0.2481852492509679,"score_spread":0.23854804834831161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979205601","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.064251445,0.000025919933,0.93220204,0.00028977226,0.00032139444,0.00008279265,0.0000013516388,0.00012540785,0.0026999011],"genre_scores_gemma":[0.71987194,0.00000814847,0.27994406,0.000110799876,0.00005215423,0.0000018591376,4.4050415e-7,0.0000033863519,0.0000072227317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805236,0.000044332253,0.00025852202,0.00054612645,0.0006652388,0.00043344888],"domain_scores_gemma":[0.9985137,0.000090469395,0.00007881759,0.00095011166,0.00016309465,0.00020382006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008949214,0.00013394981,0.00019004561,0.00014946006,0.00024719982,0.0002262535,0.002872232,0.00003589827,0.000051229807],"category_scores_gemma":[0.00003774165,0.00010166451,0.000051452374,0.0011193571,0.0017959006,0.00087510847,0.0018024478,0.00012291569,0.000025535355],"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.000004394512,0.00004598685,0.0001073828,0.000004194594,0.0000012867802,0.000009336063,0.00017288819,0.000052603737,0.0010223781,0.8886875,0.000027217184,0.10986482],"study_design_scores_gemma":[0.00019792287,0.00014832015,0.002067257,0.000033505326,0.0000020748118,0.00007461429,0.0000050512226,0.90492636,0.007066433,0.084765606,0.00053237786,0.00018049887],"about_ca_topic_score_codex":0.0000060696134,"about_ca_topic_score_gemma":8.728206e-8,"teacher_disagreement_score":0.9048737,"about_ca_system_score_codex":0.000022955688,"about_ca_system_score_gemma":0.00008115748,"threshold_uncertainty_score":0.66170704},"labels":[],"label_agreement":null},{"id":"W1979358057","doi":"10.1016/j.tcs.2008.06.009","title":"Rich, Sturmian, and trapezoidal words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"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","score_opus":0.010044828997486724,"score_gpt":0.2248701033556216,"score_spread":0.21482527435813487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979358057","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.37073547,0.0000742274,0.62572336,0.00067454675,0.0003337678,0.00007737086,5.684583e-7,0.00025142223,0.0021292993],"genre_scores_gemma":[0.8955997,0.000020262589,0.10323611,0.0009941796,0.00011909391,0.000003803158,2.0999119e-7,0.000006633072,0.00002001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771255,0.000086632266,0.000224796,0.00075963506,0.0006262248,0.0005901696],"domain_scores_gemma":[0.99855494,0.00023135183,0.000047214606,0.00074644806,0.000081345526,0.00033869347],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009740757,0.00019307676,0.00021001977,0.00017472751,0.0006680042,0.00028842175,0.0020656951,0.000050957828,0.000024720715],"category_scores_gemma":[0.000045805507,0.00015138007,0.000045262503,0.0010433863,0.004305505,0.0008466484,0.0011172948,0.00019590573,0.00006159516],"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.0000034864543,0.000039347196,0.00019896572,0.0000029600624,0.0000025721645,0.000050472427,0.0009970558,0.000009630706,0.0005536423,0.9568436,0.00007259386,0.041225653],"study_design_scores_gemma":[0.00060842966,0.0004144965,0.017629554,0.000033462067,0.0000062044764,0.0011951085,0.000025162304,0.5912363,0.0071993642,0.38044637,0.0005560029,0.0006495307],"about_ca_topic_score_codex":0.0000019391525,"about_ca_topic_score_gemma":2.100815e-7,"teacher_disagreement_score":0.5912267,"about_ca_system_score_codex":0.000028246646,"about_ca_system_score_gemma":0.00009982246,"threshold_uncertainty_score":0.9984042},"labels":[],"label_agreement":null},{"id":"W1979524717","doi":"10.1016/j.tcs.2003.10.019","title":"Realizability models for BLL-like languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Realizability; Programming language; Syntax; Linear logic; Computer science; Algebra over a field; Bounded function; Theoretical computer science; Discrete mathematics; Calculus (dental); Mathematics; Pure mathematics; Artificial intelligence","score_opus":0.02178323658350501,"score_gpt":0.2772463831187192,"score_spread":0.2554631465352142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979524717","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.0014130954,0.00007372461,0.9797473,0.00021174003,0.00080870744,0.00038848643,8.2084415e-7,0.00027731663,0.01707881],"genre_scores_gemma":[0.8539523,0.0000017971511,0.14554077,0.00035520218,0.00007680275,0.000026768386,6.522562e-7,0.0000069605812,0.000038777514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975465,0.00015694574,0.00027499438,0.00083094736,0.0005171279,0.0006735112],"domain_scores_gemma":[0.99811816,0.0002723919,0.000068208465,0.0010376937,0.00024130355,0.0002622572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002781386,0.0001815104,0.00022984615,0.00009733505,0.00039899666,0.00046253763,0.0018894009,0.00006650278,0.00001321154],"category_scores_gemma":[0.00014434835,0.00013675609,0.000100056,0.000694302,0.0014494408,0.00060786586,0.00034805652,0.00010816462,0.00003067702],"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.000002733243,0.000053979456,0.00003766956,0.000014188447,0.0000028746447,0.000003344153,0.00042517795,0.00018127322,0.00005528739,0.98769194,0.00008586904,0.011445642],"study_design_scores_gemma":[0.00017254982,0.00015145773,0.000038242524,0.0000023793973,0.0000028539628,0.000024395973,0.000012285855,0.2971133,0.0011028585,0.69992274,0.0012885483,0.00016838977],"about_ca_topic_score_codex":0.000011802504,"about_ca_topic_score_gemma":0.0000014012336,"teacher_disagreement_score":0.8525392,"about_ca_system_score_codex":0.00005512354,"about_ca_system_score_gemma":0.00014857878,"threshold_uncertainty_score":0.5576751},"labels":[],"label_agreement":null},{"id":"W1979831715","doi":"10.1016/j.tcs.2005.02.004","title":"Computing unsatisfiable<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-SAT instances with few occurrences per variable","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Mathematics; Function (biology); Combinatorics; Variable (mathematics); Discrete mathematics; Exponential function; Exponential time hypothesis; Time complexity; Mathematical analysis","score_opus":0.011480185867683814,"score_gpt":0.2327873710725958,"score_spread":0.221307185204912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979831715","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.43808833,0.00004885755,0.55634063,0.00044722346,0.0005993101,0.00005094037,0.000005178838,0.0001959512,0.004223597],"genre_scores_gemma":[0.76861787,0.000023683446,0.23012966,0.0009462879,0.00023401271,0.000012886845,0.0000066221205,0.000018631343,0.000010321509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964684,0.00011387546,0.0005001186,0.00096378016,0.0011419324,0.00081187004],"domain_scores_gemma":[0.99795943,0.00045187597,0.00029627976,0.00080102246,0.00015706467,0.00033430543],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013587658,0.00030711072,0.00021676492,0.00017595569,0.0010600445,0.0012322861,0.0015545319,0.00016386356,0.00015401108],"category_scores_gemma":[0.00011485401,0.00030229668,0.000116456744,0.0010861426,0.0021594192,0.0015648638,0.00083859224,0.00040074333,0.00038659893],"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.000026852525,0.000055621407,0.00006148568,0.000029743425,0.00002151892,0.000018369048,0.00088235876,0.019756507,0.00010470113,0.95576686,0.00008720539,0.023188777],"study_design_scores_gemma":[0.0003803981,0.0003001358,0.00021352177,0.00018839372,0.000024671624,0.00019347921,0.00007438609,0.9921981,0.001525758,0.0039917766,0.0005422042,0.0003671492],"about_ca_topic_score_codex":0.000037965492,"about_ca_topic_score_gemma":0.000027462362,"teacher_disagreement_score":0.9724416,"about_ca_system_score_codex":0.000034570963,"about_ca_system_score_gemma":0.0006167982,"threshold_uncertainty_score":0.9999429},"labels":[],"label_agreement":null},{"id":"W1980155648","doi":"10.1016/j.tcs.2004.07.031","title":"Optimal graph exploration without good maps","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":66,"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 en Outaouais","funders":"","keywords":"Graph; Computer science; Mathematics; Theoretical computer science","score_opus":0.018372535556696407,"score_gpt":0.2655600713819139,"score_spread":0.2471875358252175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980155648","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.0042936285,0.000009379895,0.98646426,0.0037522286,0.00040760232,0.00021666054,8.689895e-7,0.00035238717,0.004502983],"genre_scores_gemma":[0.56136256,0.0000055216533,0.43810856,0.00044922912,0.000049599592,0.000008042871,0.0000011514483,0.000005086997,0.0000102350805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750745,0.000082204126,0.0002576732,0.0006907246,0.00087776134,0.0005842068],"domain_scores_gemma":[0.99855566,0.00005171568,0.000056764697,0.0007229359,0.00025961225,0.00035333133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012040782,0.00016813369,0.00015817423,0.00025604598,0.0004953691,0.00079413847,0.0021273063,0.00004880665,0.000025306234],"category_scores_gemma":[0.000049077244,0.00013960515,0.000057441124,0.0016347823,0.0017627333,0.0021251577,0.0007582953,0.00019740216,0.00019540881],"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.0000033574026,0.00006172967,0.000015918633,0.0000027333924,0.0000018548349,0.000005531776,0.00063489703,0.04910685,0.00021393945,0.94490033,0.000017078208,0.0050357906],"study_design_scores_gemma":[0.0005564593,0.00030803753,0.000099121185,0.000025513633,0.0000020800076,0.00003239748,0.000011153607,0.5301095,0.0043775844,0.46407613,0.0001458346,0.0002561374],"about_ca_topic_score_codex":0.0000031716027,"about_ca_topic_score_gemma":5.7850104e-7,"teacher_disagreement_score":0.55706894,"about_ca_system_score_codex":0.00007014372,"about_ca_system_score_gemma":0.00023271162,"threshold_uncertainty_score":0.76578957},"labels":[],"label_agreement":null},{"id":"W1980595063","doi":"10.1016/j.tcs.2010.07.003","title":"Cops and Robbers from a distance","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Upper and lower bounds; Graph; Zigzag; Function (biology); Discrete mathematics; Geometry","score_opus":0.0074750399545815875,"score_gpt":0.26657268459215955,"score_spread":0.25909764463757795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980595063","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.15275301,0.000027387588,0.84356886,0.0009095842,0.0005408269,0.000117513686,0.0000025170475,0.00017643026,0.0019038769],"genre_scores_gemma":[0.71646184,0.000003418821,0.2831563,0.000283398,0.000074922005,0.0000050606764,3.7210827e-7,0.000006007577,0.000008650533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974127,0.00008150727,0.00019148891,0.0009441683,0.0007196384,0.00065049645],"domain_scores_gemma":[0.997582,0.0005698314,0.00004516578,0.0011752115,0.00015043849,0.00047733937],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012181301,0.00017642808,0.00018294013,0.00015112103,0.00047716836,0.0005861487,0.0029800958,0.000055187727,0.00005770409],"category_scores_gemma":[0.00018333661,0.00014491353,0.000037934413,0.0010842565,0.007100645,0.0009827573,0.001672703,0.0005004308,0.000060973158],"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.0000075233274,0.000022461494,0.00024083769,0.000001409073,0.0000019565098,0.000012807643,0.0002515036,0.00000849239,0.0066861995,0.94901675,0.000013429966,0.04373661],"study_design_scores_gemma":[0.00018523358,0.00007323963,0.0019399639,0.000009257766,0.0000014066784,0.000023281404,0.0000041237413,0.24294737,0.005124346,0.74910086,0.00039422823,0.000196699],"about_ca_topic_score_codex":0.000005973558,"about_ca_topic_score_gemma":0.0000060413226,"teacher_disagreement_score":0.56370884,"about_ca_system_score_codex":0.000021220572,"about_ca_system_score_gemma":0.00009460628,"threshold_uncertainty_score":0.9956015},"labels":[],"label_agreement":null},{"id":"W1980615207","doi":"10.1016/j.tcs.2008.09.018","title":"Gravitational wave signal templates, pattern recognition, and reciprocal Eulerian gamma functions","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Pulsars and Gravitational Waves Research","field":"Physics and Astronomy","cited_by":3,"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":"LIGO; Gravitational wave; Eulerian path; Noise (video); SIGNAL (programming language); Physics; Computer science; Algorithm; Computation; Detector; Astrophysics; Optics; Theoretical physics; Artificial intelligence","score_opus":0.03050457431170279,"score_gpt":0.2845907923559332,"score_spread":0.2540862180442304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980615207","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.6842124,0.0000112469115,0.31165335,0.00065777753,0.00015629122,0.00017513227,0.00027308424,0.00001732339,0.0028433825],"genre_scores_gemma":[0.9928298,9.82198e-7,0.0063942717,0.00013017278,0.00030101227,0.0000132054165,0.00015221235,0.000006967609,0.00017136638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867547,0.00005661835,0.00017564556,0.00031681792,0.00045079624,0.00032467],"domain_scores_gemma":[0.9991415,0.00021575861,0.000032387637,0.00012332133,0.00025385787,0.0002331354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003391419,0.00011374028,0.00011216762,0.000106097636,0.0006843338,0.00010947187,0.00017568193,0.000022352597,0.00079150154],"category_scores_gemma":[0.000011525098,0.00009688725,0.000041253883,0.00034750067,0.002254315,0.00023663853,0.00014011092,0.00016609962,0.00014592108],"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.000077878554,0.00039815248,0.008208827,0.000014456757,0.000049485334,0.000035770743,0.0016035787,0.000075329175,0.0032347802,0.6957887,0.0015530323,0.28896],"study_design_scores_gemma":[0.0005153182,0.00025762848,0.04673283,0.000026694319,0.000008249109,0.00007959838,0.00007943865,0.034091726,0.0007311785,0.91682184,0.00035318974,0.0003023056],"about_ca_topic_score_codex":0.000008895275,"about_ca_topic_score_gemma":2.1861099e-7,"teacher_disagreement_score":0.30861738,"about_ca_system_score_codex":0.000016886994,"about_ca_system_score_gemma":0.00011195033,"threshold_uncertainty_score":0.8666387},"labels":[],"label_agreement":null},{"id":"W1981314990","doi":"10.1016/s0304-3975(00)00197-3","title":"Loop checks for logic programs with functions","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Key (lock); Computer science; Loop (graph theory); Series (stratigraphy); Arithmetic; Algorithm; Theoretical computer science; Programming language; Mathematics; Operating system; Combinatorics","score_opus":0.026606039594996866,"score_gpt":0.25761974298176854,"score_spread":0.23101370338677168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981314990","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.0038181217,0.0000343332,0.98690397,0.00080894225,0.0006710014,0.00060709234,2.7770767e-7,0.00045229323,0.006703952],"genre_scores_gemma":[0.88870335,0.0000019661313,0.11043889,0.00034842736,0.00021702447,0.000081080405,0.0000019252432,0.000009195976,0.00019816103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749714,0.000053006002,0.0002401259,0.00083626306,0.00057080225,0.0008026571],"domain_scores_gemma":[0.99833804,0.00012019845,0.00008180598,0.00082064467,0.00033833232,0.00030098122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720572,0.0002109985,0.00022287817,0.00012865275,0.00060444686,0.00076850154,0.0019253696,0.000063829895,0.000017135195],"category_scores_gemma":[0.000038323873,0.0001371038,0.000080877435,0.0014275956,0.0020390118,0.00055733486,0.000403826,0.00014406438,0.00010205085],"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.000013519123,0.000108016706,0.00031783938,0.000007773543,0.0000055769674,0.00001251638,0.0001631652,0.000036564277,0.000033864806,0.89734006,0.000048282673,0.101912804],"study_design_scores_gemma":[0.0010076317,0.0032006374,0.0005526091,0.000018574596,0.000020558009,0.00051985285,0.00003675379,0.40890247,0.00048769175,0.56719965,0.017362079,0.0006915183],"about_ca_topic_score_codex":0.000006313338,"about_ca_topic_score_gemma":0.00000319374,"teacher_disagreement_score":0.8848852,"about_ca_system_score_codex":0.000051363142,"about_ca_system_score_gemma":0.00013977055,"threshold_uncertainty_score":0.7512824},"labels":[],"label_agreement":null},{"id":"W1981403153","doi":"10.1016/j.tcs.2008.02.021","title":"Learning recursive functions: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Learnability; Randomness; Algorithmic learning theory; Computer science; Set (abstract data type); Limit (mathematics); Focus (optics); Function (biology); Field (mathematics); Artificial intelligence; Mathematics; Theoretical computer science; Active learning (machine learning); Pure mathematics; Statistics","score_opus":0.014483351408562984,"score_gpt":0.2498447219833575,"score_spread":0.2353613705747945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981403153","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.0676018,0.00002482873,0.9263136,0.0004932037,0.00078483677,0.000076965785,7.127266e-7,0.00039287342,0.004311229],"genre_scores_gemma":[0.8984689,0.000007783981,0.100860015,0.000289227,0.00015259144,0.000004232799,0.000001877973,0.000007314404,0.00020804313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997318,0.00040794915,0.00022138415,0.00075614755,0.0007149686,0.00058153877],"domain_scores_gemma":[0.9982178,0.0005097498,0.00007217911,0.00062787015,0.00028559362,0.00028677634],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022473114,0.00017275053,0.00019156585,0.0002036072,0.0013173951,0.0002529227,0.0019120199,0.000045131957,0.000044704073],"category_scores_gemma":[0.00055123196,0.00014321378,0.00006219881,0.001800343,0.0022531722,0.0005707105,0.00079768675,0.00049261557,0.00038923806],"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.000008099967,0.000067458495,0.0040219687,0.0000026553823,0.0000051809784,0.000046633293,0.0011342072,0.0018285749,0.000048313406,0.9302047,0.00028660372,0.06234564],"study_design_scores_gemma":[0.00025667588,0.0005535364,0.042664785,0.000018836014,0.0000021728447,0.000332927,0.000008105285,0.93551755,0.00025812408,0.01917551,0.00086216413,0.00034959926],"about_ca_topic_score_codex":0.000029108107,"about_ca_topic_score_gemma":7.357664e-7,"teacher_disagreement_score":0.933689,"about_ca_system_score_codex":0.000044693028,"about_ca_system_score_gemma":0.00017579521,"threshold_uncertainty_score":0.9999828},"labels":[],"label_agreement":null},{"id":"W1981629634","doi":"10.1016/s0304-3975(02)00073-7","title":"Deterministic broadcasting time with partial knowledge of the network","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Theoretical computer science","score_opus":0.008588091882672011,"score_gpt":0.22306216494164066,"score_spread":0.21447407305896865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981629634","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.027425477,0.000025292125,0.9514172,0.000077388526,0.0011985163,0.00015411573,2.511105e-7,0.00006508561,0.019636646],"genre_scores_gemma":[0.9767232,2.581799e-7,0.022909358,0.00012053431,0.00018760427,0.0000046576083,4.238505e-8,0.0000060338643,0.000048311525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807876,0.00028398688,0.00030809292,0.00045321736,0.00036506407,0.0005108652],"domain_scores_gemma":[0.9984297,0.00034211893,0.00012494993,0.00076987647,0.00020104185,0.0001322831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016886417,0.0001476401,0.00020940638,0.00003706408,0.0004874973,0.00021268777,0.0016858667,0.000038428218,0.000035739562],"category_scores_gemma":[0.000092244474,0.00008481988,0.00006798605,0.0013163147,0.0018024932,0.00022647712,0.00043723843,0.00015705547,0.000034675984],"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.0000039529605,0.000026987376,0.00016043652,0.0000044551616,0.0000036589545,0.0000020555897,0.0003225763,0.0031289586,0.00009148071,0.9921148,0.0000641438,0.0040764823],"study_design_scores_gemma":[0.00018133648,0.00024582833,0.00023816321,0.00012404744,0.000006041123,0.0001692581,0.00000434965,0.97358006,0.0016576658,0.022803467,0.00081721676,0.00017253988],"about_ca_topic_score_codex":0.0000011973653,"about_ca_topic_score_gemma":7.59378e-7,"teacher_disagreement_score":0.9704511,"about_ca_system_score_codex":0.00003127771,"about_ca_system_score_gemma":0.00018642747,"threshold_uncertainty_score":0.6641362},"labels":[],"label_agreement":null},{"id":"W1981776739","doi":"10.1016/j.tcs.2005.10.032","title":"Syntactic control of concurrency","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Finitary; Concurrency; Decidability; Undecidable problem; Observational equivalence; Game semantics; Computer science; Equivalence (formal languages); Recursion (computer science); Mathematics; Semaphore; Programming language; Discrete mathematics; Semantics (computer science); Operational semantics; Theoretical computer science; Denotational semantics","score_opus":0.011667922731239233,"score_gpt":0.2516900121329037,"score_spread":0.24002208940166447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981776739","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.002540346,0.00010779479,0.98843014,0.0010203678,0.0006996762,0.00018233615,4.4758315e-7,0.00015374535,0.0068651363],"genre_scores_gemma":[0.9691616,0.0000024270453,0.030246316,0.00036391013,0.00020379007,0.000005630084,1.6475559e-7,0.0000045284633,0.000011577133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784863,0.00011404791,0.00035764676,0.00052326947,0.0006521412,0.0005042842],"domain_scores_gemma":[0.9984121,0.00023997299,0.00012938664,0.000749629,0.00024298967,0.00022595705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001450048,0.00015259546,0.00026704208,0.00013765194,0.0001853598,0.00021249555,0.0022957367,0.000048392114,0.000042916923],"category_scores_gemma":[0.000102887825,0.00011391228,0.000079772195,0.00075830385,0.00234657,0.0006885618,0.0004016522,0.00014241523,0.00015328245],"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.0000030418714,0.000060832837,0.00012294407,0.000007782466,0.0000039747806,0.0000033003914,0.00024371286,0.000040600065,0.00038456405,0.8978686,0.00002380384,0.10123688],"study_design_scores_gemma":[0.0008839909,0.0005077275,0.0006788714,0.000012157602,0.000011372215,0.0000948192,0.0000070970978,0.69530576,0.008269853,0.2913625,0.002524616,0.0003412704],"about_ca_topic_score_codex":0.0000046562695,"about_ca_topic_score_gemma":5.068918e-7,"teacher_disagreement_score":0.96662134,"about_ca_system_score_codex":0.000043512824,"about_ca_system_score_gemma":0.00013796314,"threshold_uncertainty_score":0.86460346},"labels":[],"label_agreement":null},{"id":"W1981971424","doi":"10.1016/j.tcs.2006.04.003","title":"Weighted multirecombination evolution strategies","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.005149068878092617,"score_gpt":0.23049791992071902,"score_spread":0.22534885104262642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981971424","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.021412402,0.00003001929,0.96864086,0.0012688845,0.00032729417,0.00014579346,0.0000010953413,0.00036356316,0.007810108],"genre_scores_gemma":[0.7376535,8.4324586e-7,0.2621403,0.000048815582,0.00011813743,0.000013014304,0.0000024720339,0.0000033974795,0.00001951434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982188,0.000052756004,0.00023880195,0.000563616,0.00052869535,0.00039734988],"domain_scores_gemma":[0.99892837,0.00009730651,0.000063607105,0.0005515131,0.00025323816,0.000105977364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802673,0.00013334403,0.000107610525,0.00018095471,0.0006438031,0.00048397612,0.0014074912,0.000043839886,0.000020768231],"category_scores_gemma":[0.000009123352,0.00011687214,0.000045960358,0.0014156449,0.0013450912,0.0014811804,0.0003760146,0.00011772702,0.000116948366],"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":[7.6434577e-7,0.0001009858,0.000038829585,0.0000015740044,7.983283e-7,0.0000013638393,0.00003188668,0.00041331458,0.0008187148,0.9890114,0.000083638886,0.009496708],"study_design_scores_gemma":[0.00009527599,0.000034422654,0.008094009,0.0000038140884,0.0000010517724,0.0000106641,0.000003298301,0.5100461,0.00051787525,0.48099434,0.000104489816,0.00009467388],"about_ca_topic_score_codex":0.000030462781,"about_ca_topic_score_gemma":0.000001544875,"teacher_disagreement_score":0.7162411,"about_ca_system_score_codex":0.0001273549,"about_ca_system_score_gemma":0.00017274955,"threshold_uncertainty_score":0.49560446},"labels":[],"label_agreement":null},{"id":"W1982015000","doi":"10.1016/j.tcs.2009.02.015","title":"Matrix columns allocation problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"David and Lucile Packard Foundation","keywords":"Orthogonal frequency-division multiple access; Matrix (chemical analysis); Combinatorics; Mathematical proof; Transmission (telecommunications); Mathematics; Computer science; Element (criminal law); Mathematical optimization; Discrete mathematics; Orthogonal frequency-division multiplexing; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.004906022925432091,"score_gpt":0.21023301304130262,"score_spread":0.20532699011587052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982015000","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.24570903,0.00007562033,0.735456,0.00022475558,0.0006292261,0.00021499934,9.859846e-7,0.00057682814,0.017112555],"genre_scores_gemma":[0.9964883,0.00000292789,0.0033052547,0.00008727632,0.000092656424,0.0000037411692,6.559528e-7,0.0000055617143,0.000013637241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990743,0.000027812339,0.00015364065,0.00020781491,0.00024022828,0.000296216],"domain_scores_gemma":[0.99949723,0.00003088718,0.000012519095,0.00029236724,0.00004501938,0.000121983634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069023325,0.00009506024,0.000102838676,0.0000797349,0.00013508252,0.00011921166,0.00044503107,0.00003434364,0.000036586236],"category_scores_gemma":[0.0000100659545,0.000083991734,0.00003059812,0.00051941694,0.0005695245,0.00018533212,0.000028797931,0.0000937647,0.000104004685],"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.0000015530179,0.000012756118,0.0000098803675,0.0000079185065,0.0000014203016,0.0000012100456,0.00019891825,0.006986481,0.0057192086,0.9782055,0.00006345103,0.0087916795],"study_design_scores_gemma":[0.00012449156,0.00014268387,0.001003925,0.00003780714,0.000004182777,0.000026118474,0.000007790745,0.67437774,0.005283975,0.31842133,0.00037172798,0.00019820308],"about_ca_topic_score_codex":4.3653148e-7,"about_ca_topic_score_gemma":1.977908e-7,"teacher_disagreement_score":0.7507793,"about_ca_system_score_codex":0.000028091112,"about_ca_system_score_gemma":0.00001205809,"threshold_uncertainty_score":0.34250835},"labels":[],"label_agreement":null},{"id":"W1982358125","doi":"10.1016/j.tcs.2015.03.026","title":"On hardness of several string indexing problems","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"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; Danmarks Grundforskningsfond","keywords":"String (physics); Search engine indexing; Computer science; Mathematics; Combinatorics; Information retrieval","score_opus":0.023988290326781455,"score_gpt":0.2594345300040363,"score_spread":0.23544623967725486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982358125","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.02773302,0.000013252006,0.9687911,0.00018953413,0.0009812304,0.00011292593,0.0000018373648,0.000112554015,0.002064543],"genre_scores_gemma":[0.8512925,6.727915e-7,0.14846732,0.00015774545,0.00006468554,0.000002488791,6.365259e-7,0.000004561239,0.0000094123925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763995,0.000076067394,0.0002634376,0.00060210243,0.0010036238,0.00041481323],"domain_scores_gemma":[0.9983327,0.00010603954,0.00009048063,0.0009037331,0.00024225155,0.00032482215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016014725,0.00014530966,0.00019889006,0.00017423366,0.00017425562,0.00025154292,0.00248202,0.00004135567,0.000007989565],"category_scores_gemma":[0.00010969477,0.00010943911,0.00003969905,0.000872408,0.0010203535,0.0008893655,0.0016958027,0.00017895384,0.00002800976],"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.000007271007,0.00005590876,0.000029748111,0.00000563763,0.0000016158324,0.0000051675665,0.00042428946,0.0036029853,0.00011375227,0.977191,0.000113547285,0.018449128],"study_design_scores_gemma":[0.0002848996,0.0002790083,0.00026898345,0.000079548394,0.0000012472867,0.000014554779,0.0000047470235,0.7795235,0.0025114228,0.2167784,0.00010841666,0.00014527564],"about_ca_topic_score_codex":0.000007003111,"about_ca_topic_score_gemma":1.3312787e-7,"teacher_disagreement_score":0.82355946,"about_ca_system_score_codex":0.000054681233,"about_ca_system_score_gemma":0.0001855438,"threshold_uncertainty_score":0.4612252},"labels":[],"label_agreement":null},{"id":"W1982912460","doi":"10.1016/s0304-3975(99)00300-x","title":"Algebraic characterizations of trace and decorated trace equivalences over tree-like structures","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Homomorphism; TRACE (psycholinguistics); Bisimulation; Mathematics; Algebraic number; Equivalence (formal languages); Bounded function; Tree (set theory); Transition system; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Algorithm","score_opus":0.018357430765140563,"score_gpt":0.29063311651850593,"score_spread":0.27227568575336536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982912460","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.36604816,0.00005260208,0.6328161,0.00019874792,0.00033583297,0.00011306235,0.000001790823,0.00008478615,0.00034891782],"genre_scores_gemma":[0.6456568,0.000025294814,0.354155,0.000110029505,0.000036295267,0.0000035475446,5.833331e-7,0.0000048293596,0.000007580429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775535,0.00018174088,0.00038752603,0.000641874,0.0006104896,0.00042299568],"domain_scores_gemma":[0.9984862,0.0002257895,0.00017187027,0.00070048467,0.00020476562,0.00021088611],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012140888,0.00018642185,0.00023561974,0.00023696174,0.0002941522,0.0002946302,0.0017936849,0.00007007859,0.000052986696],"category_scores_gemma":[0.00015167122,0.00015423239,0.000042435768,0.0017743473,0.0028808396,0.0013776845,0.00048247894,0.00015703417,0.0000064440155],"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.0000103610855,0.00003773414,0.00034960048,0.000009493085,0.000003334292,0.000003044732,0.00083308754,0.000059178594,0.008067123,0.9063686,0.0000052420023,0.08425317],"study_design_scores_gemma":[0.0002395883,0.00026068944,0.10621125,0.000031289124,0.000008596962,0.00009211514,0.0000126469495,0.75417316,0.013393214,0.12516877,0.0001403908,0.00026831267],"about_ca_topic_score_codex":0.0000045204347,"about_ca_topic_score_gemma":0.000001053575,"teacher_disagreement_score":0.7811999,"about_ca_system_score_codex":0.000027763437,"about_ca_system_score_gemma":0.00008750698,"threshold_uncertainty_score":0.99983275},"labels":[],"label_agreement":null},{"id":"W1983239548","doi":"10.1016/j.tcs.2004.12.032","title":"On properties of bond-free DNA languages","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"DNA; DNA computing; Construct (python library); Property (philosophy); Characterization (materials science); Formal language; Computer science; Discrete mathematics; Mathematics; Algorithm; Theoretical computer science; Programming language; Genetics; Biology; Physics","score_opus":0.009223273731269854,"score_gpt":0.23893363602633283,"score_spread":0.22971036229506298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983239548","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.9829989,0.00009667698,0.01079143,0.00039224472,0.000060349154,0.00006168926,0.0000015913657,0.000017907394,0.0055792285],"genre_scores_gemma":[0.991765,0.0000032697892,0.0073390165,0.00064910523,0.00021683019,0.0000012241721,0.0000011578647,0.0000038009675,0.0000205766],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913204,0.00003115708,0.00013112318,0.0002913242,0.00018631562,0.00022802487],"domain_scores_gemma":[0.999449,0.000019213005,0.00003276283,0.00036460077,0.000063864994,0.0000705601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037902457,0.000089920075,0.00009811601,0.000030375539,0.000084549574,0.00002531788,0.0006753921,0.000047494508,0.000014312881],"category_scores_gemma":[0.00017124687,0.00005637013,0.00004466331,0.00011930173,0.0014502561,0.0000037720852,0.00049235154,0.000059582922,0.0000122350975],"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.00004391862,0.00006719914,0.000048250797,0.000005439106,0.000003355838,8.60576e-7,0.00003404921,0.000072809766,0.6793841,0.3026946,0.00017177408,0.017473668],"study_design_scores_gemma":[0.00018517647,0.0006482001,0.00040643863,0.000025528081,0.0000024972119,0.000007119969,0.000008260929,0.0031637927,0.9907972,0.0042456654,0.00038691706,0.00012315816],"about_ca_topic_score_codex":6.814737e-7,"about_ca_topic_score_gemma":4.2025778e-7,"teacher_disagreement_score":0.31141314,"about_ca_system_score_codex":0.000006090847,"about_ca_system_score_gemma":0.000025947396,"threshold_uncertainty_score":0.5343529},"labels":[],"label_agreement":null},{"id":"W1983244685","doi":"10.1016/s0304-3975(00)00382-0","title":"Restriction categories I: categories of partial maps","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":165,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Coproduct; Mathematics; Closed category; Limit (mathematics); 2-category; Context (archaeology); Distributive property; Concrete category; Enriched category; Category theory; Derived category; Triangulated category; Dual (grammatical number); Pure mathematics; Algebra over a field; Linguistics; Functor","score_opus":0.028297649230790367,"score_gpt":0.28077438400242166,"score_spread":0.2524767347716313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983244685","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.6535591,0.00005719281,0.32572997,0.0017803259,0.0014123643,0.00020312818,0.0000047184467,0.00018604964,0.01706718],"genre_scores_gemma":[0.98862326,0.000010912413,0.011079826,0.000080217345,0.00014564184,0.000006482154,5.6961943e-7,0.000006548572,0.000046544083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985792,0.00012356299,0.00030593114,0.0003040069,0.00031559594,0.00037168388],"domain_scores_gemma":[0.9988261,0.00045059816,0.000088531226,0.00041256254,0.00011963996,0.000102555256],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006436536,0.00012130647,0.00023294482,0.00010897893,0.00024082857,0.00003090987,0.00054536393,0.00008991432,0.00049366045],"category_scores_gemma":[0.00031692142,0.000097394535,0.00004842258,0.0005036764,0.0070010577,0.00014293428,0.00020688184,0.00016605933,0.000055968943],"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.000009500458,0.00008118476,0.00016317517,0.000011425503,0.00000545105,0.000009351261,0.0008570644,0.000002840858,0.00022098575,0.9961151,0.00029042183,0.0022334934],"study_design_scores_gemma":[0.00014166629,0.00025191926,0.00015238169,0.0000062045447,0.0000144509295,0.000052311036,0.00003528077,0.0051771034,0.013690038,0.9802344,0.00013350019,0.000110750174],"about_ca_topic_score_codex":0.0000059571657,"about_ca_topic_score_gemma":9.5103405e-7,"teacher_disagreement_score":0.33506417,"about_ca_system_score_codex":0.000024149369,"about_ca_system_score_gemma":0.000034066958,"threshold_uncertainty_score":0.9957013},"labels":[],"label_agreement":null},{"id":"W1983278039","doi":"10.1016/j.tcs.2004.03.002","title":"On the number of nonterminals in linear conjunctive grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"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":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Context-free grammar; Computer science; Natural language processing","score_opus":0.00953662867562726,"score_gpt":0.262570027593138,"score_spread":0.25303339891751075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983278039","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.37197983,0.000004476271,0.62386066,0.0013829244,0.00031205572,0.00012419067,9.59128e-7,0.00004908715,0.002285806],"genre_scores_gemma":[0.9560714,0.0000015943289,0.04257351,0.0013033609,0.000034091903,0.0000062447157,1.4789583e-7,0.0000050850654,0.0000045816305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981133,0.00011703892,0.00028487443,0.0004875602,0.0005774156,0.00041986268],"domain_scores_gemma":[0.9982009,0.0006856254,0.00008152941,0.0008218176,0.000105095794,0.00010502506],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018713743,0.00015317148,0.0002077678,0.00011592947,0.00014699892,0.00010851314,0.0025367034,0.00004027842,0.00004239397],"category_scores_gemma":[0.00015825575,0.00009377547,0.00006798595,0.0011198401,0.002869136,0.00033264264,0.0006650636,0.00021847805,0.00011145278],"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.000011074443,0.00009586157,0.000055781376,0.0000026526513,0.000001927471,0.000016312773,0.0005785733,0.00035700746,0.00023137261,0.9931764,0.000007464099,0.0054655564],"study_design_scores_gemma":[0.0003054267,0.0001521078,0.0011337096,0.00008420089,0.0000014581866,0.000032207765,0.000017534338,0.098600045,0.008064074,0.8914698,0.0000073944598,0.0001320889],"about_ca_topic_score_codex":0.00001366407,"about_ca_topic_score_gemma":8.071539e-7,"teacher_disagreement_score":0.58409154,"about_ca_system_score_codex":0.00006085512,"about_ca_system_score_gemma":0.00012057198,"threshold_uncertainty_score":0.9998445},"labels":[],"label_agreement":null},{"id":"W1983693678","doi":"10.1016/j.tcs.2010.01.004","title":"Fast radio broadcasting with advice","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":53,"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 en Outaouais","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Broadcasting (networking); Advice (programming); Computer science; Constant (computer programming); Radio broadcasting; Radio networks; Computer network; Broadcast communication network; Theoretical computer science; Telecommunications; Wireless network; Wireless","score_opus":0.006882577268605463,"score_gpt":0.23766120430507173,"score_spread":0.23077862703646626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983693678","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.010912126,0.0000030769295,0.97136533,0.0014094482,0.0004347651,0.00014251485,4.1563817e-7,0.00042834476,0.015303973],"genre_scores_gemma":[0.5422846,6.295224e-7,0.4572464,0.00036116623,0.00007318702,0.0000033750764,2.445312e-7,0.000005102803,0.000025309011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976819,0.000058586305,0.00019140623,0.00066606305,0.00078445626,0.0006175567],"domain_scores_gemma":[0.9982364,0.00017234255,0.000054467073,0.00081885216,0.0003106295,0.00040729012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001272418,0.00015600992,0.00014294569,0.00017306834,0.0005238982,0.00080827135,0.002568799,0.00004278743,0.00009322182],"category_scores_gemma":[0.000082830826,0.00011203962,0.000030157977,0.001511045,0.0024996689,0.0009959606,0.00077655754,0.00042060745,0.000106821826],"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.000003611187,0.000033671935,0.000086508604,0.0000033103452,0.0000016038391,0.00001047087,0.0003836634,0.0010708843,0.0010956378,0.9566171,0.000034345165,0.0406592],"study_design_scores_gemma":[0.00025246025,0.00018038218,0.00044520426,0.000015280035,0.0000014683447,0.00013293752,0.000004680618,0.9831795,0.0014941624,0.013721055,0.00036712678,0.00020573362],"about_ca_topic_score_codex":0.0000033206877,"about_ca_topic_score_gemma":0.000002054211,"teacher_disagreement_score":0.98210865,"about_ca_system_score_codex":0.000018936276,"about_ca_system_score_gemma":0.0002033296,"threshold_uncertainty_score":0.9210134},"labels":[],"label_agreement":null},{"id":"W1984264511","doi":"10.1016/j.tcs.2005.09.028","title":"H-Coloring dichotomy revisited","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Greedy coloring; Complete coloring; Combinatorics; Discrete mathematics; Complexity of constraint satisfaction; Computational complexity theory; Automaton; Constraint (computer-aided design); Fractional coloring; List coloring; Constraint satisfaction; Graph coloring; Time complexity; Computer science; Local consistency; Theoretical computer science; Algorithm; Graph","score_opus":0.015057328051587939,"score_gpt":0.29933949641029667,"score_spread":0.28428216835870873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984264511","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.023811955,0.00005890368,0.96277,0.001721215,0.00022020821,0.00022588654,6.718613e-7,0.00044989522,0.010741277],"genre_scores_gemma":[0.69588387,0.0000062484664,0.30323738,0.0006440771,0.00018478734,0.000010286055,2.3389343e-7,0.000007929609,0.000025180187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646163,0.00014995891,0.0003065983,0.0009754897,0.0011094655,0.0009968862],"domain_scores_gemma":[0.99742424,0.0003654603,0.000059860376,0.0014053156,0.0002651778,0.00047993433],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00248951,0.00020853993,0.00022472024,0.00039331426,0.00059121265,0.00056012056,0.0047234083,0.000048470138,0.00009769015],"category_scores_gemma":[0.00018288646,0.00017441002,0.000080562,0.0027257765,0.003075098,0.0018338722,0.0020349578,0.00035714186,0.00049826305],"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.000006219807,0.00003580035,0.00004994603,0.0000033922026,0.0000022788995,0.000011883096,0.00016213796,0.00019545223,0.0012511607,0.88965267,0.00003456055,0.108594485],"study_design_scores_gemma":[0.0003089225,0.00016082155,0.0006830332,0.00003433129,0.0000022980912,0.0000665386,0.0000028315758,0.59506047,0.014967431,0.38531166,0.0030617102,0.00033993064],"about_ca_topic_score_codex":5.179318e-7,"about_ca_topic_score_gemma":1.7676668e-7,"teacher_disagreement_score":0.67207193,"about_ca_system_score_codex":0.00012510786,"about_ca_system_score_gemma":0.0001130466,"threshold_uncertainty_score":0.99963796},"labels":[],"label_agreement":null},{"id":"W1984779023","doi":"10.1016/j.tcs.2010.09.018","title":"The three column Bandpass problem is solvable in linear time","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Band-pass filter; Column (typography); Mathematics; Stacking; Time complexity; Combinatorics; Algorithm; Physics; Geometry; Engineering; Electronic engineering","score_opus":0.0035244790066319394,"score_gpt":0.18918575694195033,"score_spread":0.1856612779353184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984779023","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.88112354,0.000053580854,0.08736142,0.00061096763,0.0020555337,0.00046943623,0.0000040355512,0.00036487548,0.027956579],"genre_scores_gemma":[0.99597347,0.0000017628299,0.0037536754,0.00007252213,0.00011871528,0.000014062067,2.477805e-7,0.000011885165,0.000053685162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987648,0.00003107768,0.0002070423,0.00023944741,0.00028045478,0.00047714898],"domain_scores_gemma":[0.99920523,0.00016331766,0.000016427744,0.0004454878,0.000048183396,0.0001213258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041325,0.000121830875,0.00013304251,0.000062266416,0.00029153362,0.00018587615,0.00090315257,0.00006142447,0.000115719246],"category_scores_gemma":[0.000021011712,0.000083426145,0.000038998107,0.0005692717,0.0017117305,0.00015687122,0.00013860209,0.00034803076,0.00027460657],"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.0000070002625,0.000016054893,0.0002003641,0.0000107469805,0.000003672137,0.0000036585488,0.00024764592,0.0007776081,0.0083307205,0.98564225,0.00040893714,0.004351359],"study_design_scores_gemma":[0.00013945777,0.000042168165,0.0006507049,0.000020638443,0.0000020885445,0.000013924518,0.000004123696,0.79561406,0.0040630745,0.19740124,0.0018953753,0.0001531368],"about_ca_topic_score_codex":0.0000034042268,"about_ca_topic_score_gemma":0.000016701728,"teacher_disagreement_score":0.79483646,"about_ca_system_score_codex":0.00001568288,"about_ca_system_score_gemma":0.00002700115,"threshold_uncertainty_score":0.63069427},"labels":[],"label_agreement":null},{"id":"W1984900662","doi":"10.1016/j.tcs.2012.03.045","title":"A study of Jacobi–Perron boundary words for the generation of discrete planes","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mathematics; Generalization; Simple (philosophy); Dimension (graph theory); Boundary (topology); Focus (optics); Social connectedness; Fraction (chemistry); Plane (geometry); Line (geometry); Complex plane; Duality (order theory); Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.028766549078336763,"score_gpt":0.28509171070294637,"score_spread":0.2563251616246096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984900662","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.39302805,0.00009692049,0.60580087,0.00014457415,0.0005289431,0.00027611692,0.0000023325824,0.000029829023,0.0000923254],"genre_scores_gemma":[0.9721154,0.0000024131712,0.027526446,0.00010575972,0.00021998344,0.000019932237,7.7008656e-7,0.0000055405876,0.0000037792233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983325,0.00011549364,0.0003172195,0.00031203942,0.00053647166,0.00038624712],"domain_scores_gemma":[0.9983217,0.00055340433,0.0001280367,0.0007820099,0.0001144235,0.00010039943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432961,0.00012882508,0.00020277772,0.00009350321,0.0003342271,0.00012926233,0.0018897705,0.000029136214,0.0000096868225],"category_scores_gemma":[0.00006249289,0.00007723414,0.00005971497,0.0005513344,0.0015280949,0.0006116095,0.0006243093,0.00008042766,0.0000027510075],"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.000013322376,0.0002220478,0.00038084737,0.000009927254,0.000010095024,3.9262216e-7,0.006220094,0.00019250641,0.0024930038,0.9695396,0.000034888202,0.020883303],"study_design_scores_gemma":[0.00060487905,0.0011844421,0.007941484,0.00003032214,0.000030817926,0.000024257102,0.00045680444,0.9386253,0.016780468,0.033950377,0.00011914506,0.0002517529],"about_ca_topic_score_codex":0.0000069829907,"about_ca_topic_score_gemma":0.0000016563395,"teacher_disagreement_score":0.93843275,"about_ca_system_score_codex":0.000017789302,"about_ca_system_score_gemma":0.00006061193,"threshold_uncertainty_score":0.5630329},"labels":[],"label_agreement":null},{"id":"W1984969896","doi":"10.1016/j.tcs.2008.02.037","title":"Cleaning a network with brushes","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Brush; Vertex (graph theory); Graph; Enhanced Data Rates for GSM Evolution; Computer science; Combinatorics; Traverse; Mathematics; Artificial intelligence; Engineering; Electrical engineering","score_opus":0.00811646038885474,"score_gpt":0.22615958601625125,"score_spread":0.2180431256273965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984969896","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.2053003,0.0000064696046,0.77592033,0.000070875554,0.000034539837,0.00006353296,3.01997e-7,0.0001110747,0.018492557],"genre_scores_gemma":[0.89821935,5.2133424e-7,0.10117846,0.0001066633,0.00046950387,0.000004437384,9.2659786e-7,0.000007784809,0.0000123772425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987253,0.000037262475,0.00013858626,0.00034568514,0.00032370712,0.00042945638],"domain_scores_gemma":[0.9992928,0.0000911546,0.000044011016,0.00035595387,0.00008395304,0.00013214647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035825587,0.00012328061,0.00016973508,0.000048666843,0.0005576381,0.000078358906,0.0005457186,0.000011206245,0.00028797137],"category_scores_gemma":[0.0000019756226,0.00008994685,0.000051380568,0.0008347996,0.0024305165,0.00014734193,0.00026711533,0.00013581474,0.000027809077],"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.000007590606,0.00002494409,0.011293809,4.743378e-7,0.000008709615,0.0000045845986,0.00011147542,0.0011952784,0.000019175666,0.9755451,0.00031613506,0.011472733],"study_design_scores_gemma":[0.00034949172,0.00039137702,0.015479014,0.000078823075,0.00003497259,0.00004575039,0.00002141581,0.5019256,0.0018335443,0.47818285,0.0010395115,0.0006176606],"about_ca_topic_score_codex":0.000011352254,"about_ca_topic_score_gemma":4.7812193e-7,"teacher_disagreement_score":0.692919,"about_ca_system_score_codex":0.000014169242,"about_ca_system_score_gemma":0.000057144767,"threshold_uncertainty_score":0.895534},"labels":[],"label_agreement":null},{"id":"W1985300487","doi":"10.1016/j.tcs.2014.06.026","title":"Following a curve with the discrete Fréchet distance","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.005718607776081057,"score_gpt":0.2320523624921879,"score_spread":0.22633375471610687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985300487","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.030617535,0.000021274498,0.9615997,0.0046781804,0.0004055902,0.00012994235,4.836114e-7,0.00012781782,0.0024194485],"genre_scores_gemma":[0.8782331,5.8785525e-7,0.12052737,0.0010393901,0.00016149803,0.000009221196,9.788769e-7,0.0000050959743,0.000022808006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792624,0.00015558652,0.00016222258,0.0005990568,0.0007375524,0.00041934394],"domain_scores_gemma":[0.9984759,0.00043673164,0.0000615027,0.00073060347,0.00013164744,0.00016362287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001840092,0.00015843067,0.00014751927,0.0000871104,0.00076047116,0.0006644744,0.0019994592,0.000024013269,0.0000073033634],"category_scores_gemma":[0.000075704025,0.000090278896,0.00006500975,0.0014654613,0.0011599021,0.0006924017,0.0005127507,0.00015956008,0.000036834583],"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.0000044320254,0.0000136268745,0.000054312237,0.0000018048455,0.000003746225,0.0000026995651,0.0002626115,0.0026931525,0.00011525514,0.9753233,0.0000662632,0.021458775],"study_design_scores_gemma":[0.00019588174,0.00019351055,0.0014674861,0.000018146486,0.0000053453123,0.000020571923,0.0000046346154,0.8798138,0.0010652554,0.115047865,0.0019710974,0.00019641004],"about_ca_topic_score_codex":0.0000016986316,"about_ca_topic_score_gemma":0.0000022690865,"teacher_disagreement_score":0.8771206,"about_ca_system_score_codex":0.00003202412,"about_ca_system_score_gemma":0.000087943576,"threshold_uncertainty_score":0.6407542},"labels":[],"label_agreement":null},{"id":"W1985614194","doi":"10.1016/j.tcs.2005.09.016","title":"Simple permutations mix well","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Random permutation; Mathematics; Combinatorics; Permutation (music); Simple (philosophy); Independence (probability theory); Closeness; Mixing (physics); Random graph; Discrete mathematics; Derangement; Graph; Symmetric group; Statistics","score_opus":0.008061903686414422,"score_gpt":0.2620267867829475,"score_spread":0.2539648830965331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985614194","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.72733015,0.000035424546,0.25984535,0.00044741525,0.0000979032,0.0000662549,0.0000017576049,0.000031340667,0.012144382],"genre_scores_gemma":[0.98230326,0.0000036156082,0.015898388,0.0012473214,0.00049834105,0.0000019070077,0.000009214436,0.000004599292,0.00003335862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989524,0.0000407194,0.00013399444,0.00038660396,0.00016108762,0.00032519325],"domain_scores_gemma":[0.9994786,0.000027959259,0.000024888355,0.0002515067,0.00008053869,0.0001365368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039498266,0.00009747281,0.00007914471,0.0000302837,0.00024677793,0.00006976952,0.00048510105,0.0000518086,0.00010384641],"category_scores_gemma":[0.000062966115,0.00007217366,0.000051068586,0.00019158659,0.0012729089,0.0000060245666,0.000373509,0.00007284952,0.0001149994],"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.000036295045,0.00017193802,0.0012435018,0.0000053208996,0.000010225408,0.000004446244,0.00008617554,0.0016471236,0.299162,0.58745307,0.0009216612,0.10925824],"study_design_scores_gemma":[0.0010334969,0.0019230397,0.01953916,0.00002234893,0.000023628074,0.00012439278,0.00004338404,0.31451556,0.5179607,0.059194814,0.08444992,0.0011695557],"about_ca_topic_score_codex":6.772004e-7,"about_ca_topic_score_gemma":7.977366e-7,"teacher_disagreement_score":0.52825826,"about_ca_system_score_codex":0.000010318092,"about_ca_system_score_gemma":0.000038309317,"threshold_uncertainty_score":0.46900856},"labels":[],"label_agreement":null},{"id":"W1985734068","doi":"10.1016/j.tcs.2014.02.026","title":"The Covering Canadian Traveller Problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Shortest path problem; Routing (electronic design automation); Competitive analysis; Computer science; Mathematical optimization; A priori and a posteriori; Set (abstract data type); Path (computing); Variation (astronomy); Operations research; Mathematics; Upper and lower bounds; Theoretical computer science; Computer network","score_opus":0.006748960221634481,"score_gpt":0.21944515269249248,"score_spread":0.212696192470858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985734068","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.00049120537,0.000007459466,0.9477107,0.0062043667,0.000353154,0.00015282509,2.9112047e-7,0.000107160035,0.04497286],"genre_scores_gemma":[0.85304415,0.0000063442144,0.14551349,0.0012883795,0.00006773992,0.000006800523,2.2215444e-7,0.0000052568603,0.00006761875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793285,0.00012774197,0.00018665074,0.0004436464,0.0005574198,0.0007516862],"domain_scores_gemma":[0.99827224,0.0002619723,0.000031477502,0.0006994912,0.00018192023,0.00055288355],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026020189,0.00011485802,0.00009493804,0.00012473369,0.0013837377,0.0012439395,0.00294189,0.000032737928,0.000026368607],"category_scores_gemma":[0.000095281204,0.00007416559,0.00003534173,0.0009258762,0.0017246732,0.00042620106,0.0005030858,0.0001763203,0.00015128209],"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":[6.5677335e-7,0.000005080237,0.000015449228,0.0000012626621,0.0000010237588,9.091128e-7,0.00020951322,0.0011925108,0.00003057776,0.93477064,0.00013147967,0.06364089],"study_design_scores_gemma":[0.00008995572,0.000070372094,0.00024828166,0.0000075175494,5.549247e-7,0.0000099238505,0.0000024291176,0.8529435,0.00026000015,0.13596255,0.01028789,0.000117068426],"about_ca_topic_score_codex":0.00028279104,"about_ca_topic_score_gemma":0.00031311772,"teacher_disagreement_score":0.85255295,"about_ca_system_score_codex":0.00007367177,"about_ca_system_score_gemma":0.00032521848,"threshold_uncertainty_score":0.9999163},"labels":[],"label_agreement":null},{"id":"W1985933202","doi":"10.1016/j.tcs.2008.09.011","title":"A palindromization map for the free group","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Group (periodic table); Chemistry","score_opus":0.0340092894968032,"score_gpt":0.28234975369344556,"score_spread":0.24834046419664235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985933202","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.033310123,0.000021875896,0.962925,0.0024561123,0.0004913969,0.00024078158,0.0000022173497,0.00006103976,0.0004914203],"genre_scores_gemma":[0.8788372,0.0000024122892,0.12052974,0.00030866495,0.00025511172,0.000014061958,4.8630966e-7,0.0000061270784,0.000046140376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989779,0.000036507532,0.00016226861,0.00024181853,0.00028200928,0.00029947268],"domain_scores_gemma":[0.99756944,0.0017473476,0.0000444318,0.00047749744,0.000087849985,0.00007344618],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009610706,0.000083148785,0.00012363028,0.00008112845,0.0005317442,0.000034069493,0.00094019,0.00003733457,0.000098125536],"category_scores_gemma":[0.00078594935,0.000048990565,0.000052506166,0.00052142644,0.0030194542,0.00007308385,0.000283638,0.00008095828,0.000021494232],"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.000006970591,0.000031824486,0.000019421015,0.0000054824245,0.0000031737934,0.0000018025931,0.00029877105,0.00000733225,0.000011453309,0.9958443,0.001539643,0.0022298256],"study_design_scores_gemma":[0.00031092667,0.00012192879,0.0002934687,0.000004331051,0.000009018185,0.000048913666,0.000015480853,0.054359995,0.00015256875,0.9441975,0.000409598,0.00007626444],"about_ca_topic_score_codex":0.0000016844509,"about_ca_topic_score_gemma":3.5353307e-7,"teacher_disagreement_score":0.8455271,"about_ca_system_score_codex":0.000016112786,"about_ca_system_score_gemma":0.00003501173,"threshold_uncertainty_score":0.99969375},"labels":[],"label_agreement":null},{"id":"W1986197414","doi":"10.1016/s0304-3975(03)00099-9","title":"Lyndon words, permutations and trees","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":65,"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":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.007157902298393804,"score_gpt":0.23160806403191803,"score_spread":0.22445016173352422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986197414","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.08667138,0.00008140658,0.9039443,0.0006130493,0.00031754503,0.00008418306,6.5543884e-7,0.00019849656,0.0080889575],"genre_scores_gemma":[0.87088054,0.0000068965296,0.12852731,0.0005268582,0.000032123615,0.000004291493,2.1093346e-7,0.0000047865146,0.000016956035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983041,0.00011763088,0.0001748932,0.00058001897,0.00039135345,0.0004319908],"domain_scores_gemma":[0.9987844,0.0002782905,0.000037141224,0.0005897539,0.00006936124,0.00024104568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011581792,0.00014209907,0.0001423983,0.00014769132,0.00045279373,0.00053042197,0.001106643,0.000033225886,0.00005431369],"category_scores_gemma":[0.00011718781,0.000113215494,0.000035209567,0.00085652067,0.0021063425,0.000687151,0.0003947959,0.00011631641,0.000044425324],"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":[8.3350034e-7,0.000025596451,0.00006363233,0.0000018527885,0.0000015513377,0.000006556457,0.0004856518,0.000018055707,0.00045326486,0.97130114,0.00003127664,0.02761056],"study_design_scores_gemma":[0.00019788883,0.000100553494,0.0021003282,0.000015906262,0.00000331756,0.00012804303,0.000025784731,0.32858056,0.0029933613,0.6652718,0.00036677477,0.00021567925],"about_ca_topic_score_codex":0.0000015065348,"about_ca_topic_score_gemma":4.88722e-7,"teacher_disagreement_score":0.7842092,"about_ca_system_score_codex":0.00002304536,"about_ca_system_score_gemma":0.00008056855,"threshold_uncertainty_score":0.7760906},"labels":[],"label_agreement":null},{"id":"W1986510459","doi":"10.1016/j.tcs.2011.05.044","title":"Nature-inspired framework for measuring visual image resemblance: A near rough set approach","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Disjoint sets; Metric (unit); Artificial intelligence; Fuzzy set; Object (grammar); Set (abstract data type); Representation (politics); Mathematics; Computer science; Fuzzy logic; Visualization; Pattern recognition (psychology); Similarity (geometry); Image (mathematics); Computer vision; Theoretical computer science; Discrete mathematics","score_opus":0.0417213330136382,"score_gpt":0.2970657582240786,"score_spread":0.25534442521044043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986510459","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.01071819,0.000059727587,0.97684634,0.00029313788,0.0008679126,0.00045415832,0.0000038443245,0.0003793051,0.010377409],"genre_scores_gemma":[0.49268726,0.0000021534718,0.50656176,0.0005577103,0.00015483281,0.000023306618,9.4143e-7,0.000010458076,0.0000015575606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610823,0.00013182925,0.00037564608,0.0013265029,0.00094376516,0.0011140297],"domain_scores_gemma":[0.9976411,0.00030454723,0.00011807759,0.0012381718,0.00030899036,0.000389105],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0022490574,0.00031925805,0.00036266804,0.00015179737,0.0008932914,0.0009651655,0.004313164,0.00023243652,0.000017267259],"category_scores_gemma":[0.00027167777,0.00024790986,0.0001564994,0.0014523058,0.002723067,0.001041831,0.001436556,0.00063256535,0.000049268405],"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.000038478167,0.00013156964,0.00004245562,0.0000213593,0.000007200761,0.000012850983,0.0015844295,0.00003556898,0.000085398075,0.9854543,0.000095714604,0.012490678],"study_design_scores_gemma":[0.00022244123,0.0003143247,0.00056707294,0.000030247258,0.0000050101494,0.00002723183,0.000011220356,0.6057875,0.0017091316,0.39094403,0.00008827084,0.00029349304],"about_ca_topic_score_codex":0.0000058451683,"about_ca_topic_score_gemma":1.7317471e-7,"teacher_disagreement_score":0.60575193,"about_ca_system_score_codex":0.000069796624,"about_ca_system_score_gemma":0.00018239813,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W1986652500","doi":"10.1016/j.tcs.2004.01.002","title":"Representing recursively enumerable languages by iterated deletion","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"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":"Recursively enumerable language; Iterated function; Decidability; Closure (psychology); Recursively enumerable set; Characterization (materials science); Mathematics; Maximal set; Discrete mathematics; Combinatorics; Algorithm; Computer science; Programming language; Set (abstract data type); Physics","score_opus":0.004844094767187674,"score_gpt":0.23947911913918926,"score_spread":0.2346350243720016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986652500","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.1324933,0.00010758577,0.86202806,0.0016245494,0.00030840756,0.00011080306,0.000002009935,0.00038483855,0.0029404196],"genre_scores_gemma":[0.8955535,0.0000060621373,0.10339807,0.00091383245,0.00008759813,0.00000524995,0.0000028784657,0.00000828327,0.000024486502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976304,0.000096830176,0.0002572385,0.0007953004,0.0005898597,0.0006303245],"domain_scores_gemma":[0.9986227,0.00014027947,0.00008388536,0.0007758854,0.00015854841,0.00021869387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013056999,0.00018031657,0.00017272172,0.0001401792,0.0004811829,0.00072572526,0.0021081108,0.00005563862,0.00003496659],"category_scores_gemma":[0.00012107531,0.00015246867,0.000056863624,0.0011782236,0.0011255392,0.0010824635,0.00074634916,0.00019952904,0.00012515669],"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.0000033114648,0.000054269865,0.000019490662,0.000003734242,0.0000030172384,0.000021240581,0.0004764296,0.00021074669,0.015697652,0.95965165,0.00018275126,0.023675695],"study_design_scores_gemma":[0.00075200055,0.0002651132,0.0004801957,0.00013042788,0.0000069485723,0.0001636876,0.00004326766,0.25866705,0.18370567,0.5546453,0.0005353739,0.00060495693],"about_ca_topic_score_codex":0.000019662284,"about_ca_topic_score_gemma":2.360479e-7,"teacher_disagreement_score":0.7630602,"about_ca_system_score_codex":0.00008219075,"about_ca_system_score_gemma":0.000089689405,"threshold_uncertainty_score":0.69981855},"labels":[],"label_agreement":null},{"id":"W1987108302","doi":"10.1016/s0304-3975(00)00067-0","title":"Repetitive perhaps, but certainly not boring","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Work (physics); Mathematical economics; Theoretical computer science; Mathematics; Calculus (dental); Algebra over a field; Engineering; Pure mathematics; Mechanical engineering","score_opus":0.008705978987782583,"score_gpt":0.23941056217111675,"score_spread":0.23070458318333417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987108302","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.03895312,0.000027345368,0.940929,0.0012877971,0.00051767105,0.00014101135,0.000004256189,0.0003424258,0.017797355],"genre_scores_gemma":[0.7856544,0.000016804763,0.21269692,0.001269635,0.0002264694,0.0000061376886,0.0000014046668,0.00000817574,0.00012004222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968191,0.000097762284,0.00029970866,0.0010808307,0.0009589336,0.0007436585],"domain_scores_gemma":[0.99788743,0.000196609,0.0000513104,0.0013181892,0.0001625266,0.00038393744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389695,0.00022658959,0.00022459324,0.00013338179,0.00071398204,0.00071952475,0.0033877713,0.00005888409,0.00046443005],"category_scores_gemma":[0.000050956478,0.00017906488,0.00007611563,0.0008905736,0.0017633818,0.0014117683,0.0012221959,0.0002673426,0.00042135792],"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.000008717109,0.000037854952,0.0000132195355,0.0000021624314,0.0000018034514,0.000033217122,0.00023719657,0.00007909463,0.00043017179,0.73037875,0.00009066175,0.26868713],"study_design_scores_gemma":[0.0003002156,0.00023848511,0.0018418159,0.00006720807,0.000004350073,0.000120485,0.000008631369,0.93556726,0.009512144,0.046644833,0.005251909,0.00044266006],"about_ca_topic_score_codex":0.000023640681,"about_ca_topic_score_gemma":3.6032623e-7,"teacher_disagreement_score":0.93548816,"about_ca_system_score_codex":0.00006503431,"about_ca_system_score_gemma":0.00013138082,"threshold_uncertainty_score":0.7302054},"labels":[],"label_agreement":null},{"id":"W1987374824","doi":"10.1016/j.tcs.2005.03.036","title":"Palindromic factors of billiard words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"Dynamical billiards; Palindrome; Dimension (graph theory); Mathematics; Prefix; Fourth Dimension; Combinatorics; Pure mathematics; Physics; Geometry; Linguistics; Philosophy; Spacetime","score_opus":0.009619744018541267,"score_gpt":0.23842521909478898,"score_spread":0.2288054750762477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987374824","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.3814632,0.000024798117,0.6162395,0.0004573176,0.0003190973,0.00006653887,0.0000013709833,0.00014870832,0.001279493],"genre_scores_gemma":[0.8680679,0.000003748181,0.1315224,0.00028779337,0.00010079662,0.0000015926388,4.054497e-7,0.000006448749,0.00000886937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977563,0.000078213074,0.0003527598,0.0005980153,0.0006827653,0.0005319406],"domain_scores_gemma":[0.9982569,0.00028287934,0.000100564255,0.0010121258,0.00010814517,0.00023939137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012667443,0.00018528996,0.000259277,0.00022209118,0.00019145611,0.000190281,0.0032895498,0.000054442626,0.00008811366],"category_scores_gemma":[0.00006235651,0.00013536027,0.00009949879,0.0011055445,0.0024144792,0.00075512746,0.001021449,0.00015392335,0.00007952971],"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.000002409204,0.000057786896,0.00018740982,0.0000037398365,0.000003075499,0.0000021088786,0.0006394457,0.00015324076,0.0016394982,0.94383043,0.0000264045,0.053454477],"study_design_scores_gemma":[0.00029024694,0.00022949286,0.0044864863,0.000046753128,0.000005863434,0.000029750705,0.00001967068,0.7160932,0.080447316,0.19758935,0.000383412,0.00037848018],"about_ca_topic_score_codex":0.0000031529946,"about_ca_topic_score_gemma":3.5383977e-7,"teacher_disagreement_score":0.74624103,"about_ca_system_score_codex":0.000050225877,"about_ca_system_score_gemma":0.000103632796,"threshold_uncertainty_score":0.8896249},"labels":[],"label_agreement":null},{"id":"W1987608226","doi":"10.1016/j.tcs.2006.07.020","title":"Incremental construction of minimal deterministic finite cover automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Deterministic finite automaton; Cover (algebra); DFA minimization; Deterministic automaton; Nondeterministic finite automaton; Automaton; Finite-state machine; Quantum finite automata; Regular language; ω-automaton; Büchi automaton; Two-way deterministic finite automaton; Computer science; Nested word; Algorithm; Mathematics; Discrete mathematics; Automata theory; Theoretical computer science","score_opus":0.005976703962465163,"score_gpt":0.2199071007742895,"score_spread":0.21393039681182432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987608226","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.23908252,0.00001127872,0.7554189,0.0001377303,0.0004880059,0.00009620809,0.0000061171,0.000183267,0.004575987],"genre_scores_gemma":[0.8042331,9.987046e-7,0.19551712,0.00013905953,0.00009293064,0.0000028419188,0.0000014344783,0.000005738808,0.0000067870214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977141,0.000091725306,0.00043012222,0.0005864743,0.00071143,0.00046612532],"domain_scores_gemma":[0.9984519,0.00038610137,0.00015065387,0.00076481607,0.00012168626,0.00012486547],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009782008,0.00018414065,0.00024088858,0.00020393931,0.00024040074,0.0002503019,0.0019238587,0.000052341653,0.00006939721],"category_scores_gemma":[0.000058147798,0.0001585357,0.000076305085,0.00082697795,0.003913573,0.0006729653,0.0009688875,0.00011495635,0.00007759108],"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.00000898094,0.000076951284,0.0001548839,0.0000098696955,0.000002530875,0.000010219362,0.000059419734,0.00012699045,0.0044360836,0.9734037,0.000058843805,0.021651542],"study_design_scores_gemma":[0.00033794684,0.00022429683,0.0029045588,0.000033563472,0.0000062583463,0.000094509145,0.000004901187,0.7235513,0.028247453,0.24433182,0.00005501642,0.00020838996],"about_ca_topic_score_codex":0.000008248891,"about_ca_topic_score_gemma":2.1109773e-7,"teacher_disagreement_score":0.72907186,"about_ca_system_score_codex":0.000048590846,"about_ca_system_score_gemma":0.00012253987,"threshold_uncertainty_score":0.9987972},"labels":[],"label_agreement":null},{"id":"W1987699222","doi":"10.1016/j.tcs.2012.03.005","title":"Succinct representations of permutations and functions","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Royal Society","keywords":"Combinatorics; Upper and lower bounds; Integer (computer science); Permutation (music); Mathematics; Constant (computer programming); Redundancy (engineering); Discrete mathematics; Binary logarithm; Time complexity; Function (biology); Computer science","score_opus":0.011512410575846524,"score_gpt":0.27473259320581783,"score_spread":0.2632201826299713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987699222","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.04388424,0.00006189023,0.9527986,0.00042059855,0.00038702652,0.000077860816,0.000004802572,0.00006666213,0.0022983255],"genre_scores_gemma":[0.8245356,0.0000039264087,0.17530113,0.000070679795,0.0000696407,0.000003796123,0.0000015547388,0.0000024384115,0.000011242929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988148,0.000054444,0.0001843191,0.00029339065,0.00035227707,0.00030075986],"domain_scores_gemma":[0.99878263,0.00023806612,0.00005239497,0.00055935374,0.00013425646,0.00023330146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062964426,0.00008350419,0.00010749937,0.00014448476,0.00039327974,0.00012110165,0.00069033896,0.000022986802,0.00003417033],"category_scores_gemma":[0.00007409774,0.00006590018,0.000027705297,0.00075043924,0.0013343494,0.0013778269,0.00084776763,0.00008337823,0.000021952834],"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.0000010659683,0.000052672956,0.001052436,0.0000027463977,0.0000018778157,4.0594097e-7,0.0004899489,0.000035397738,0.0005103929,0.97854066,0.00008188478,0.019230496],"study_design_scores_gemma":[0.00032796996,0.00017430571,0.10370169,0.00003074059,0.000015647667,0.00012037786,0.00007434073,0.7947665,0.0038060294,0.096100256,0.0005857552,0.00029642106],"about_ca_topic_score_codex":0.000007367773,"about_ca_topic_score_gemma":2.0665368e-7,"teacher_disagreement_score":0.88244045,"about_ca_system_score_codex":0.000013413256,"about_ca_system_score_gemma":0.00004857384,"threshold_uncertainty_score":0.49164662},"labels":[],"label_agreement":null},{"id":"W1987818736","doi":"10.1016/j.tcs.2011.10.010","title":"Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Polynomial-time approximation scheme; Approximation algorithm; Mathematics; Combinatorics; Shortest path problem; Routing (electronic design automation); Time complexity; Wireless sensor network; Discrete mathematics; Constant (computer programming); Scheme (mathematics); Constraint (computer-aided design); Wireless network; Polynomial; Path (computing); Graph; Wireless; Computer science; Computer network; Telecommunications","score_opus":0.02154726848785673,"score_gpt":0.24917111550351476,"score_spread":0.22762384701565802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987818736","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.09809158,0.0000075471307,0.8986507,0.00022101011,0.0005091016,0.001044117,0.0000032393853,0.00023864557,0.0012340429],"genre_scores_gemma":[0.70607615,7.3998393e-7,0.2933603,0.00033656927,0.00014376578,0.000058202902,0.000004046461,0.000015956512,0.0000042644015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961696,0.00025292253,0.0007069892,0.0011579149,0.0004965237,0.0012160434],"domain_scores_gemma":[0.9971009,0.0011954061,0.00025564543,0.00083355256,0.00029869287,0.00031583107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033524993,0.0003378418,0.0004489046,0.00023378716,0.0004204757,0.00043129196,0.0021372736,0.00016835285,0.00003947671],"category_scores_gemma":[0.00017601707,0.00031815973,0.00009849753,0.0014211823,0.0023073961,0.0007727787,0.0009391825,0.000380023,0.000023652403],"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.00004840364,0.000105018895,0.00013105536,0.000013648663,0.000009385875,0.000013854618,0.0012729812,0.003081198,0.0020908404,0.9585129,0.00007399239,0.034646712],"study_design_scores_gemma":[0.00092311733,0.00015972643,0.00049129146,0.000108465756,0.0000056286417,0.00004546867,0.00005234132,0.98698324,0.0029479961,0.007867488,0.0000050735953,0.00041015292],"about_ca_topic_score_codex":0.000009230687,"about_ca_topic_score_gemma":0.0000024375054,"teacher_disagreement_score":0.98390204,"about_ca_system_score_codex":0.00018722248,"about_ca_system_score_gemma":0.0001934058,"threshold_uncertainty_score":0.99992704},"labels":[],"label_agreement":null},{"id":"W1988245022","doi":"10.1016/s0304-3975(99)00127-9","title":"Extended capabilities for visual cryptography","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":436,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Set (abstract data type); Visual cryptography; Contrast (vision); Pixel; TRACE (psycholinguistics); Transparency (behavior); Scheme (mathematics); Image (mathematics); Computer science; Mathematics; Cryptography; ENCODE; Construct (python library); Theoretical computer science; Computer vision; Combinatorics; Algorithm; Secret sharing; Biology; Computer network; Linguistics","score_opus":0.009916927238760042,"score_gpt":0.27717266765448195,"score_spread":0.2672557404157219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988245022","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.022561757,0.000031024174,0.9735809,0.000535443,0.00043330182,0.00031243675,0.0000014173146,0.00077149604,0.0017722313],"genre_scores_gemma":[0.58608866,0.0000078113935,0.41344053,0.0003391693,0.00008133745,0.00003283106,5.060098e-7,0.0000057918824,0.0000033723563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976523,0.000063973544,0.00027572198,0.00078066695,0.00048268714,0.0007446874],"domain_scores_gemma":[0.9984195,0.00030868067,0.000062180225,0.0007369823,0.0002481526,0.00022447135],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001091125,0.00021411183,0.00021587427,0.00037306082,0.00062755373,0.0004107201,0.0023063181,0.00005875137,0.000010081163],"category_scores_gemma":[0.00005666094,0.00017419597,0.0001652709,0.0014831746,0.0031652062,0.0009917768,0.00058236526,0.0001363754,0.000005796429],"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.000017127708,0.00006470961,0.00011893047,0.0000064854635,0.0000033444594,0.0000049540836,0.00023253422,0.000009559226,0.0005250167,0.93787974,0.000035230616,0.06110234],"study_design_scores_gemma":[0.00019398297,0.00046875566,0.000741124,0.000021237332,0.0000033297779,0.000044041994,0.0000073406077,0.13160759,0.01090179,0.85450125,0.0012341613,0.00027542526],"about_ca_topic_score_codex":0.0000013281395,"about_ca_topic_score_gemma":2.436396e-7,"teacher_disagreement_score":0.5635269,"about_ca_system_score_codex":0.000029366409,"about_ca_system_score_gemma":0.000057083987,"threshold_uncertainty_score":0.9995476},"labels":[],"label_agreement":null},{"id":"W1989290453","doi":"10.1016/j.tcs.2010.12.012","title":"Optimization techniques for small matrix multiplication","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Mitacs; Canada Research Chairs","keywords":"Strassen algorithm; Matrix multiplication; Multiplication (music); Mathematics; Multiplication algorithm; Matrix (chemical analysis); Base (topology); Arithmetic; Algebra over a field; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.009235530333444139,"score_gpt":0.2618025722920485,"score_spread":0.25256704195860435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989290453","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.005333558,0.0000035459684,0.99149704,0.0007726742,0.0005156602,0.0003595644,0.0000013771266,0.0005541776,0.0009624152],"genre_scores_gemma":[0.45178404,7.719303e-7,0.54793096,0.00015120067,0.000095784686,0.000029614088,8.536498e-7,0.0000043205023,0.0000024524015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985686,0.000039400784,0.00019877472,0.0005859024,0.00024246857,0.00036488738],"domain_scores_gemma":[0.99839234,0.00028307483,0.000067898094,0.0008254215,0.00027283322,0.00015842616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166776,0.00013384846,0.000117778305,0.0002202479,0.00046228335,0.0004309265,0.0021825496,0.00006896419,0.000016258487],"category_scores_gemma":[0.00012168447,0.00011563471,0.000077725315,0.00091054436,0.0012696792,0.0004803994,0.0004495267,0.00017010732,0.0000096208305],"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.0000066416933,0.00003655985,0.000014407066,0.0000040541663,0.000001156032,2.8162063e-7,0.00007817716,0.00019480522,0.006504249,0.8971135,0.0000112143825,0.09603498],"study_design_scores_gemma":[0.00009151302,0.00011334441,0.000054776334,0.000006096894,0.0000025205081,0.000010187771,9.297655e-7,0.66069597,0.023462994,0.315067,0.00035779335,0.00013691388],"about_ca_topic_score_codex":7.2780693e-7,"about_ca_topic_score_gemma":4.898814e-7,"teacher_disagreement_score":0.6605011,"about_ca_system_score_codex":0.000013637245,"about_ca_system_score_gemma":0.000058527086,"threshold_uncertainty_score":0.47154468},"labels":[],"label_agreement":null},{"id":"W1990424408","doi":"10.1016/j.tcs.2011.05.047","title":"Rewriting of visibly pushdown languages for XML data integration","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Programming language; XML validation; Document Structure Description; XML Schema Editor; XPath; XML Schema (W3C); Streaming XML; Efficient XML Interchange; RELAX NG; XML; XML Encryption; World Wide Web","score_opus":0.04928169162103819,"score_gpt":0.3136043105700699,"score_spread":0.2643226189490317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990424408","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.0029091092,0.000041706473,0.9937471,0.000108188164,0.0002719142,0.00019311339,0.00004729468,0.00010070186,0.0025808704],"genre_scores_gemma":[0.48847502,0.0000019820982,0.5113856,0.00006532902,0.000054894965,0.0000042785364,0.0000062278373,0.000003261707,0.0000033536517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983518,0.000048731657,0.00034011746,0.00060585066,0.00033516958,0.000318298],"domain_scores_gemma":[0.9978451,0.00019998365,0.00013071389,0.0014935869,0.0002263561,0.00010423773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017111085,0.00011860469,0.00018447523,0.00011922379,0.00019499268,0.00007090627,0.0024316732,0.000029331568,0.00001216697],"category_scores_gemma":[0.00030810054,0.00009026934,0.00003339206,0.0005373174,0.0012147088,0.0016293392,0.0015110625,0.00007820216,0.000007045144],"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.0000065479526,0.00002345983,0.000016332766,0.000013910592,0.0000019197835,0.0000019138997,0.00056491763,0.000002441701,0.0016275282,0.9124533,0.000037122376,0.08525061],"study_design_scores_gemma":[0.0003850531,0.0005141715,0.00064946874,0.00021339019,0.000010058914,0.000047900965,0.0002284081,0.7903923,0.08726281,0.11867998,0.0012082133,0.00040829115],"about_ca_topic_score_codex":0.000019112129,"about_ca_topic_score_gemma":0.0000034096997,"teacher_disagreement_score":0.7937733,"about_ca_system_score_codex":0.000013965697,"about_ca_system_score_gemma":0.00007674274,"threshold_uncertainty_score":0.45186943},"labels":[],"label_agreement":null},{"id":"W1990785823","doi":"10.1016/s0304-3975(02)00086-5","title":"Approximation algorithms for NMR spectral peak assignment","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Bipartite graph; Matching (statistics); Disjoint sets; Combinatorics; Approximation algorithm; Mathematics; Algorithm; Set (abstract data type); Blossom algorithm; Computer science; Graph","score_opus":0.012902715873872492,"score_gpt":0.2668682977720276,"score_spread":0.2539655818981551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990785823","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.002141932,0.00001902746,0.9899042,0.0009541168,0.00079521385,0.00029900623,0.000001224197,0.00024864625,0.00563662],"genre_scores_gemma":[0.49129865,8.8010523e-7,0.508278,0.00023406223,0.00012886524,0.000016569405,8.160177e-7,0.0000063171365,0.000035862053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974033,0.00014537534,0.00026861098,0.0007976157,0.0006895634,0.00069550873],"domain_scores_gemma":[0.9986033,0.00024064473,0.00008007175,0.0006652853,0.0001411862,0.00026950228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023920806,0.00019953726,0.00019773997,0.00015201057,0.00055694336,0.0005671633,0.0015785416,0.000047308164,0.000037141825],"category_scores_gemma":[0.00018248685,0.00016212427,0.00009279847,0.000760883,0.00086601765,0.00051377766,0.00026275395,0.00019983896,0.000051070467],"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.0000019621336,0.000059591,0.000016757189,0.0000062810486,0.0000028019103,0.0000023961757,0.00022460146,0.0008066177,0.0002200541,0.94085217,0.000056514094,0.057750273],"study_design_scores_gemma":[0.0002811595,0.00025075482,0.00018318243,0.0000103007,0.0000031129327,0.000033374625,0.0000050772856,0.7698826,0.0039459537,0.22438516,0.000814565,0.00020475141],"about_ca_topic_score_codex":0.0000015273209,"about_ca_topic_score_gemma":8.614619e-8,"teacher_disagreement_score":0.769076,"about_ca_system_score_codex":0.00008049386,"about_ca_system_score_gemma":0.00013198057,"threshold_uncertainty_score":0.6611236},"labels":[],"label_agreement":null},{"id":"W1991183719","doi":"10.1016/j.tcs.2011.05.045","title":"Information systems in modeling interactive computations on granules","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Theoretical computer science; Computation; Perception; Artificial intelligence; Complex system; Machine learning; Algorithm","score_opus":0.025797941309510755,"score_gpt":0.24830519826924,"score_spread":0.22250725695972923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991183719","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.034483504,0.000007026293,0.9498645,0.00011895637,0.00067425915,0.00018449823,0.0000011940413,0.00013024242,0.014535817],"genre_scores_gemma":[0.8878152,0.0000020440573,0.11179572,0.00034503028,0.000028292861,0.000009684171,0.0000010019659,0.000002760275,2.928705e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983649,0.00009213577,0.0003378898,0.00030771154,0.00045115044,0.00044616332],"domain_scores_gemma":[0.99904686,0.00012287407,0.0000673411,0.00045361381,0.000153321,0.0001560037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009686041,0.00014177378,0.00016083456,0.00040863582,0.00021696376,0.0004238443,0.0014584898,0.000040318962,0.000005318234],"category_scores_gemma":[0.000043160853,0.0001105838,0.00003622922,0.0009540556,0.0005106157,0.0019517908,0.0004183849,0.00020209163,0.00013422333],"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.000008838576,0.000053953856,0.000022061187,0.0000038912776,0.0000012889717,0.000004024195,0.003662569,0.028533677,0.0000021277865,0.9429965,0.0000045462393,0.024706509],"study_design_scores_gemma":[0.00015539255,0.00016155478,0.0008366597,0.000044220855,9.475774e-7,0.000012638929,0.000063112624,0.8940503,0.000034160817,0.10450076,0.0000071263044,0.00013310181],"about_ca_topic_score_codex":0.00006567713,"about_ca_topic_score_gemma":0.0000011238917,"teacher_disagreement_score":0.86551666,"about_ca_system_score_codex":0.00008873943,"about_ca_system_score_gemma":0.000070465234,"threshold_uncertainty_score":0.45094767},"labels":[],"label_agreement":null},{"id":"W1991224384","doi":"10.1016/s0304-3975(00)00403-5","title":"An introduction to metric semantics: operational and denotational models for programming and specification languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Denotational semantics; Denotational semantics of the Actor model; Computer science; Programming language; Operational semantics; Nondeterministic algorithm; Normalisation by evaluation; Action semantics; Domain theory; Semantics (computer science); Programming language theory; Theoretical computer science; Fifth-generation programming language; Programming paradigm; Mathematics; Discrete mathematics","score_opus":0.019522302318894902,"score_gpt":0.28291543733863267,"score_spread":0.26339313501973777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991224384","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.016002571,0.000055829947,0.9802252,0.0029558411,0.00020515588,0.00038706328,4.7000023e-7,0.00009103781,0.000076804725],"genre_scores_gemma":[0.6796282,0.0000032724313,0.31984106,0.00012127282,0.00037232955,0.00002101569,0.0000028653571,0.0000033526162,0.0000066322896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985671,0.000047570815,0.00017210978,0.00060808146,0.00034271795,0.00026244085],"domain_scores_gemma":[0.99915475,0.00010081183,0.0000392351,0.0002800924,0.00023609454,0.00018899312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011376014,0.00010255845,0.00011012867,0.0002136954,0.0003686385,0.0008112946,0.00045921165,0.00003097328,0.000003287711],"category_scores_gemma":[0.000053261767,0.00008438015,0.000015302834,0.00061893865,0.0004339431,0.00093066925,0.00015454633,0.00005197931,0.0000041660323],"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.00000535114,0.000030994,0.00010980482,0.0000054778484,0.0000018496689,8.6503184e-7,0.00059348275,0.00053244573,0.00023282014,0.8742417,0.000014384234,0.1242308],"study_design_scores_gemma":[0.0001732953,0.00034790355,0.0015255762,0.0000018964175,0.000004376945,0.00008626861,0.00004973612,0.82801896,0.00040234183,0.16800518,0.0012221326,0.00016232757],"about_ca_topic_score_codex":0.0000041833046,"about_ca_topic_score_gemma":0.000001461025,"teacher_disagreement_score":0.8274865,"about_ca_system_score_codex":0.000028012064,"about_ca_system_score_gemma":0.00003974604,"threshold_uncertainty_score":0.78233325},"labels":[],"label_agreement":null},{"id":"W1991263747","doi":"10.1016/j.tcs.2014.09.005","title":"Brushing with additional cleaning restrictions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Ryerson University","keywords":"Brush; Traverse; Graph; Vertex (graph theory); Computer science; Combinatorics; Mathematics; Theoretical computer science; Engineering; Cartography; Mechanical engineering; Geography","score_opus":0.00951835568800899,"score_gpt":0.2215320800433167,"score_spread":0.21201372435530771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991263747","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.0031066807,0.0000030219671,0.9825977,0.0009593073,0.00033041753,0.0000669071,0.0000055714654,0.00032960004,0.012600782],"genre_scores_gemma":[0.57699263,4.877689e-7,0.42235532,0.00047226014,0.00016239526,0.0000050629883,0.000001910517,0.000004127885,0.000005812952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978224,0.00009368169,0.00018159206,0.00064049615,0.0007677115,0.00049411657],"domain_scores_gemma":[0.99820995,0.00061925786,0.000056701963,0.0006952526,0.00017064705,0.0002482142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009102818,0.00014837802,0.0001398437,0.00022647783,0.0010134776,0.0006461007,0.0020774524,0.00003099076,0.00022496727],"category_scores_gemma":[0.0001109627,0.000117223615,0.00004735138,0.0016647184,0.002324549,0.00089155004,0.00073129317,0.00025584034,0.00007595089],"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.0000023689158,0.000028717444,0.000020875692,0.0000015357616,0.0000021723245,0.000003895556,0.00010492349,0.0003017379,0.000020025369,0.9466943,0.0003128513,0.0525066],"study_design_scores_gemma":[0.00013605648,0.0002227095,0.0020345983,0.00003701948,0.0000021869912,0.000087430686,0.0000036374825,0.6733585,0.00017808455,0.32167152,0.0020837672,0.00018449369],"about_ca_topic_score_codex":0.0000041134012,"about_ca_topic_score_gemma":0.0000014832547,"teacher_disagreement_score":0.6730568,"about_ca_system_score_codex":0.00003754236,"about_ca_system_score_gemma":0.00010417032,"threshold_uncertainty_score":0.8564898},"labels":[],"label_agreement":null},{"id":"W1991356098","doi":"10.1016/j.tcs.2013.04.015","title":"Fast–mixed searching and related problems on graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Mixed graph; Combinatorics; Search algorithm; Graph; Degree (music); Search problem; Planar graph; Computer science; Discrete mathematics; Algorithm; Line graph","score_opus":0.01041735476262332,"score_gpt":0.23739648023326881,"score_spread":0.2269791254706455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991356098","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.044082463,0.000014190675,0.93707734,0.0040951,0.00033533282,0.00047109506,4.061821e-7,0.00032404516,0.013600005],"genre_scores_gemma":[0.8963643,0.000010622276,0.10298499,0.00054749905,0.000015398477,0.000016686014,5.1552036e-7,0.000007634318,0.000052366115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997438,0.00018706857,0.00025511917,0.000733455,0.0007492265,0.0006371342],"domain_scores_gemma":[0.9984501,0.00023898904,0.000048824677,0.0006102365,0.00020367673,0.00044819852],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014206858,0.00016695549,0.00015970299,0.00030861993,0.0005379007,0.001126589,0.0015561623,0.00005051049,0.00010519216],"category_scores_gemma":[0.000082528364,0.00012646666,0.000038600607,0.0013083403,0.0021602833,0.0010683362,0.0010248009,0.00032423655,0.00028100086],"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":[7.410018e-7,0.000036450332,0.000040183564,0.000005685364,0.0000025651534,0.0000021844207,0.0005957309,0.001650996,0.00031380384,0.9332373,0.000063062864,0.064051285],"study_design_scores_gemma":[0.00016737869,0.00020759652,0.0013594254,0.000027326632,6.625203e-7,0.000019575951,0.000004730929,0.6646808,0.0002670436,0.33311197,0.000022288374,0.00013123249],"about_ca_topic_score_codex":0.0000065988424,"about_ca_topic_score_gemma":2.0157115e-7,"teacher_disagreement_score":0.8522818,"about_ca_system_score_codex":0.000027925864,"about_ca_system_score_gemma":0.000068597365,"threshold_uncertainty_score":0.99991035},"labels":[],"label_agreement":null},{"id":"W1991566967","doi":"10.1016/j.tcs.2014.09.045","title":"Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Beijing University of Technology; Beijing Municipal Commission of Education; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Approximation algorithm; Dual (grammatical number); Oracle; Mathematical optimization; Greedy algorithm; Computer science; Algorithm; Stochastic approximation; Mathematics; Key (lock)","score_opus":0.0283460097376509,"score_gpt":0.24316872452961064,"score_spread":0.21482271479195975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991566967","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.0020151257,0.000007060627,0.99131894,0.0016811434,0.00044959903,0.0011071023,0.0000046947544,0.00015688043,0.0032594732],"genre_scores_gemma":[0.8508541,5.7106797e-7,0.14735155,0.0010211874,0.0005452671,0.00013972507,0.000044451022,0.0000084095755,0.000034744447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775195,0.000042879186,0.00039516116,0.0006393321,0.00070821506,0.00046245733],"domain_scores_gemma":[0.99867404,0.00009977221,0.000093563554,0.00055257935,0.0005437186,0.0000363512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042198002,0.00020946297,0.00018000018,0.0001541854,0.000802574,0.0005182186,0.0006806579,0.000042024934,0.000064996086],"category_scores_gemma":[0.0001514472,0.00014857868,0.00007175987,0.001006491,0.001252442,0.00094257254,0.00044794925,0.00012783219,0.0001787783],"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.000011708068,0.00015771466,0.000020935935,0.00009913087,0.000006821697,5.771253e-8,0.00011459374,0.003718714,0.000030188265,0.680443,0.000115997114,0.31528115],"study_design_scores_gemma":[0.0003893386,0.000038809332,0.00095052994,0.000008474177,0.000027476628,0.000001363552,0.00005025691,0.94767714,0.000047145113,0.04912432,0.0014820056,0.00020315562],"about_ca_topic_score_codex":0.0001233745,"about_ca_topic_score_gemma":0.000011805264,"teacher_disagreement_score":0.9439584,"about_ca_system_score_codex":0.000055200275,"about_ca_system_score_gemma":0.00003606836,"threshold_uncertainty_score":0.61728317},"labels":[],"label_agreement":null},{"id":"W1991636160","doi":"10.1016/s0304-3975(02)00070-1","title":"McNaughton families of languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"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é de Sherbrooke","funders":"","keywords":"Chomsky hierarchy; Rewriting; Abstract family of languages; Formal language; String (physics); Closure (psychology); Hierarchy; Recursively enumerable language; Class (philosophy); Cone (formal languages); Complexity class; Confluence; Computer science; Mathematics; Turing machine; Regular language; Language family; Context (archaeology); Automaton; Linguistics; Discrete mathematics; Theoretical computer science; Programming language; Artificial intelligence; Time complexity; Second-generation programming language","score_opus":0.005738167963395646,"score_gpt":0.23805565448284552,"score_spread":0.23231748651944986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991636160","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.11656452,0.00008055004,0.860915,0.00016441433,0.00031136483,0.00007081626,9.651942e-7,0.00015040723,0.021741971],"genre_scores_gemma":[0.8498205,0.0000062298477,0.14986965,0.00026008615,0.000025058105,0.0000018803917,1.7455035e-7,0.0000043044947,0.000012110168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982944,0.00011425657,0.0002299715,0.00045166077,0.0005112868,0.00039843126],"domain_scores_gemma":[0.99862105,0.00024202338,0.000065078115,0.00082219613,0.00011239016,0.00013723805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014029009,0.00013306586,0.00019013982,0.0001742817,0.0001601877,0.00013800288,0.0018838905,0.000035706507,0.000055704706],"category_scores_gemma":[0.00013183044,0.000101942795,0.000059751314,0.0010543572,0.0021768436,0.00046517042,0.0004307133,0.000100665486,0.00004177751],"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.0000011918178,0.000037356134,0.00006336941,0.000005969165,0.0000020368875,0.000005456909,0.00037584023,0.000023152685,0.002951535,0.975213,0.000027428769,0.021293676],"study_design_scores_gemma":[0.00031837125,0.00025183012,0.0013124377,0.00004908321,0.0000052510386,0.0000772784,0.00009330523,0.11169977,0.2191929,0.66595095,0.00068209897,0.00036673894],"about_ca_topic_score_codex":0.000003036348,"about_ca_topic_score_gemma":1.9891667e-7,"teacher_disagreement_score":0.733256,"about_ca_system_score_codex":0.000019053563,"about_ca_system_score_gemma":0.000087720546,"threshold_uncertainty_score":0.8020671},"labels":[],"label_agreement":null},{"id":"W1991824730","doi":"10.1016/j.tcs.2012.10.021","title":"Pseudospectra of exponential matrix polynomials","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; University of Otago; Curtin University of Technology; University of Canberra; University of New South Wales; Australian National University","keywords":"Matrix exponential; Mathematics; Exponential polynomial; Computation; Exponential function; Matrix (chemical analysis); Polynomial matrix; Nonlinear system; Applied mathematics; Polynomial; Matrix polynomial; Mathematical analysis; Algorithm; Differential equation","score_opus":0.008775717508541392,"score_gpt":0.26133501721195834,"score_spread":0.25255929970341695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991824730","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.10434593,0.000094445706,0.8906229,0.00027615193,0.001346469,0.0001184884,0.0000018446025,0.00013859049,0.0030551706],"genre_scores_gemma":[0.802304,0.000002966938,0.19720681,0.00010042031,0.00036000594,0.0000027053761,2.3181877e-7,0.000005660902,0.000017187233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975691,0.00014652812,0.000373012,0.00042974946,0.00069053256,0.0007910698],"domain_scores_gemma":[0.99828064,0.00023706438,0.00011719265,0.00087532814,0.000104336614,0.00038545794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027337442,0.00017783351,0.00026764636,0.00020468162,0.00024257235,0.0001640407,0.0026389076,0.000053607033,0.00017427551],"category_scores_gemma":[0.0000644047,0.00014440899,0.00010704509,0.0010173669,0.0021482904,0.0011981461,0.0010478343,0.00014984695,0.00013803055],"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.00000786108,0.00010316924,0.000080533755,0.0000074138134,0.0000038252756,0.0000020910427,0.00046430936,0.000015644055,0.0066522737,0.98175514,0.00003204127,0.010875672],"study_design_scores_gemma":[0.0007586907,0.0004575911,0.003036027,0.000052820134,0.000021111413,0.00022305656,0.00002071556,0.22252528,0.3506681,0.42101428,0.0004387709,0.00078354497],"about_ca_topic_score_codex":0.000002460363,"about_ca_topic_score_gemma":3.0879548e-8,"teacher_disagreement_score":0.69795805,"about_ca_system_score_codex":0.000036405072,"about_ca_system_score_gemma":0.000085171305,"threshold_uncertainty_score":0.7915465},"labels":[],"label_agreement":null},{"id":"W1992110345","doi":"10.1016/j.tcs.2011.04.048","title":"Advances in discrete geometry","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","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":"Université du Québec à Montréal","funders":"","keywords":"Geometry; Discrete geometry; Mathematics; Computer science","score_opus":0.012261837496204514,"score_gpt":0.25486463940089926,"score_spread":0.24260280190469474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992110345","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.0258557,0.00013741419,0.9591692,0.00016612587,0.0005915469,0.00009606561,4.174111e-7,0.00010423737,0.013879269],"genre_scores_gemma":[0.77886915,0.000018778728,0.2207923,0.00024312342,0.000059724884,0.0000050758813,4.8387005e-7,0.0000029696891,0.000008433337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816805,0.00006826365,0.00024564355,0.00058502814,0.00050912215,0.0004238791],"domain_scores_gemma":[0.999097,0.00011367887,0.000048270027,0.00046214086,0.0001082526,0.00017068087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010577806,0.00012966729,0.00013710475,0.00043840517,0.00020619704,0.00014978614,0.001625929,0.00003243534,0.00006163653],"category_scores_gemma":[0.00006442318,0.00010984949,0.00003908874,0.0025013178,0.00091520563,0.0017610817,0.0006140717,0.00013693771,0.000075121236],"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.0000044771664,0.00003980122,0.00024805265,0.0000023672064,4.8963517e-7,0.000009075025,0.00030861533,0.00039440542,0.00007518406,0.8918911,0.000004507908,0.10702193],"study_design_scores_gemma":[0.00019715435,0.00016539513,0.0109492205,0.000018568946,0.0000011658584,0.00002682005,0.0000045759093,0.47233748,0.0043858127,0.5113877,0.0003042482,0.00022184344],"about_ca_topic_score_codex":0.000002830612,"about_ca_topic_score_gemma":0.0000014330575,"teacher_disagreement_score":0.75301343,"about_ca_system_score_codex":0.00004229149,"about_ca_system_score_gemma":0.00008967358,"threshold_uncertainty_score":0.44795322},"labels":[],"label_agreement":null},{"id":"W1992151876","doi":"10.1016/j.tcs.2009.08.024","title":"Repetitions in strings: Algorithms and combinatorics","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"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; Centre National de la Recherche Scientifique","keywords":"Substring; Conjecture; Mathematics; Combinatorics on words; Combinatorics; String (physics); Compression (physics); Algorithm; Discrete mathematics; Computer science; Data structure; Word (group theory)","score_opus":0.007594207663506966,"score_gpt":0.2477842159550935,"score_spread":0.24019000829158654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992151876","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.011828195,0.000058190937,0.9836357,0.0014374913,0.00029080475,0.00010556438,0.0000014212874,0.00013372142,0.0025089053],"genre_scores_gemma":[0.82972586,0.000018831746,0.16977108,0.0004322058,0.000042332747,0.0000019045239,7.1748826e-7,0.000002380684,0.0000047057542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981795,0.000050572173,0.00022600734,0.00064573024,0.00046940747,0.00042878778],"domain_scores_gemma":[0.99888474,0.000111993744,0.000041731237,0.00064597453,0.0000864089,0.00022914895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086632004,0.00013565719,0.00016078791,0.00022410638,0.0002859123,0.0004204896,0.0013957233,0.000044014672,0.0000070672822],"category_scores_gemma":[0.00005171238,0.00011368378,0.000022647891,0.0011973608,0.00081841863,0.0009890556,0.00077902334,0.0002058589,0.000011338394],"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.0000012772367,0.00006289992,0.00003749668,0.0000012398177,3.360969e-7,0.000018925351,0.0001257164,0.000017245417,0.00008566567,0.9303799,0.000024690937,0.06924457],"study_design_scores_gemma":[0.0002128969,0.0001784288,0.0069330162,0.000030097865,8.0215364e-7,0.00003851132,0.000003301336,0.46219212,0.0003327886,0.5298033,0.0001364373,0.000138334],"about_ca_topic_score_codex":0.0000042863644,"about_ca_topic_score_gemma":2.3199193e-7,"teacher_disagreement_score":0.8178976,"about_ca_system_score_codex":0.000045486388,"about_ca_system_score_gemma":0.00006303862,"threshold_uncertainty_score":0.463589},"labels":[],"label_agreement":null},{"id":"W1992381397","doi":"10.1016/j.tcs.2007.03.025","title":"A note on the number of squares in a word","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":65,"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":"Centre National de la Recherche Scientifique","keywords":"Mathematics; Word (group theory); Combinatorics; Bounded function; String (physics); Upper and lower bounds; Word length; Least-squares function approximation; Discrete mathematics; Statistics; Computer science","score_opus":0.011050063721280442,"score_gpt":0.28660153913440206,"score_spread":0.27555147541312164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992381397","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.11846384,0.000005669696,0.87582356,0.0011963262,0.00027277478,0.000101432226,8.1818206e-7,0.000040010826,0.004095584],"genre_scores_gemma":[0.8898282,0.0000012448097,0.1095706,0.0005409981,0.000050408944,0.0000018405779,1.5457199e-7,0.0000031092966,0.000003452647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980998,0.00007393485,0.00024496968,0.0004367205,0.00070512877,0.00043941702],"domain_scores_gemma":[0.9979625,0.0008770614,0.00006489535,0.0008933151,0.00008712468,0.00011515155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028459022,0.00011794523,0.0001449755,0.00013075296,0.00016311202,0.0001294193,0.0026387533,0.000036567828,0.00003481689],"category_scores_gemma":[0.00011414504,0.000068684894,0.000041382085,0.0013578396,0.0015263864,0.00033556717,0.0010715941,0.00020955944,0.000057148714],"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.000011510462,0.00005594972,0.00017666143,0.0000018117798,5.093451e-7,0.000011141087,0.00033111885,0.000036618287,0.00021819521,0.92423517,0.00003608316,0.074885204],"study_design_scores_gemma":[0.00032009237,0.00016404637,0.020183131,0.00014383628,0.0000014980117,0.00003304359,0.000017048424,0.6448026,0.014794322,0.31891897,0.0003737405,0.00024769807],"about_ca_topic_score_codex":0.0000101738515,"about_ca_topic_score_gemma":0.0000016948858,"teacher_disagreement_score":0.77136433,"about_ca_system_score_codex":0.000034642464,"about_ca_system_score_gemma":0.000064961525,"threshold_uncertainty_score":0.56240344},"labels":[],"label_agreement":null},{"id":"W1992540913","doi":"10.1016/j.tcs.2009.11.015","title":"Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Niche; Mathematical economics; Bayesian probability; Economics; Equilibrium selection; Bayesian game; Computer science; Routing (electronic design automation); Mathematics; Mathematical optimization; Evolutionary biology; Theoretical computer science; Game theory; Artificial intelligence; Biology; Ecology; Repeated game","score_opus":0.03453562216005108,"score_gpt":0.3365466295953586,"score_spread":0.3020110074353075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992540913","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.26633608,0.000017994438,0.7225313,0.0023213262,0.000087576394,0.00014750726,0.0000012200604,0.000042246906,0.008514738],"genre_scores_gemma":[0.9883111,0.000002124526,0.011043094,0.00050903606,0.000106030966,0.000002700176,0.0000012900954,0.0000025211646,0.000022074257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776775,0.00018249349,0.00045771076,0.00047352337,0.00080954144,0.00030900986],"domain_scores_gemma":[0.9986578,0.0005126027,0.00009926742,0.00040858687,0.00018160226,0.00014013986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040384666,0.00010130366,0.00014923577,0.0002876319,0.00024471298,0.00045570228,0.00078495935,0.000043786284,0.00011927832],"category_scores_gemma":[0.00084105955,0.00007887335,0.000028297241,0.0018022213,0.0012675669,0.0012429614,0.0002112179,0.00011905813,0.00006070539],"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.000009002493,0.000027987206,0.00038510896,5.9879994e-7,1.8429344e-7,9.3734815e-7,0.0005410974,0.00035415168,0.0009490141,0.9391181,0.000042566277,0.05857124],"study_design_scores_gemma":[0.00009083,0.000048181177,0.024278678,0.000011122825,0.000001044916,0.000014069489,0.000053993794,0.378048,0.0005124347,0.5967995,0.000071328424,0.00007084231],"about_ca_topic_score_codex":7.903073e-7,"about_ca_topic_score_gemma":8.010103e-7,"teacher_disagreement_score":0.721975,"about_ca_system_score_codex":0.00005094361,"about_ca_system_score_gemma":0.00005138108,"threshold_uncertainty_score":0.46704033},"labels":[],"label_agreement":null},{"id":"W1993035157","doi":"10.1016/s0304-3975(02)00412-7","title":"On the equational definition of the least prefixed point","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Monotonic function; Modal; Normal modal logic; Property (philosophy); Modal μ-calculus; Function (biology); Extension (predicate logic); Term (time); Calculus (dental); Modal logic; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.029883401479813165,"score_gpt":0.23467898251600472,"score_spread":0.20479558103619155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993035157","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.009126052,0.000010642939,0.9574786,0.0013219629,0.00068938814,0.00021023412,3.5928687e-7,0.00004477788,0.031117972],"genre_scores_gemma":[0.9880975,4.4632657e-7,0.011199736,0.0006424256,0.000036109876,0.000009480779,1.5989717e-7,0.000003260208,0.000010882804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980166,0.0003131687,0.00022396534,0.0003489151,0.00080067007,0.00029667877],"domain_scores_gemma":[0.99835277,0.000518959,0.000105999636,0.0007869472,0.00016336118,0.00007196496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022273653,0.00011001953,0.000109323504,0.000050920495,0.0004395185,0.00020348452,0.0018779027,0.000032561533,0.000041247535],"category_scores_gemma":[0.00035993147,0.000052683146,0.00007765049,0.000798002,0.0019232539,0.0001927585,0.00033681083,0.0001476858,0.000066295936],"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.0000018676545,0.000046051086,0.000039983985,0.000002660671,0.0000021113108,4.5978905e-7,0.00025288033,0.000049316426,0.00013393954,0.99777985,0.000035319852,0.0016555338],"study_design_scores_gemma":[0.00009919601,0.00011795797,0.0006217681,0.000007302865,0.0000020821628,0.000017959472,0.00000791451,0.028239656,0.003633216,0.9670872,0.0000870899,0.00007865128],"about_ca_topic_score_codex":0.000002476628,"about_ca_topic_score_gemma":4.8692453e-7,"teacher_disagreement_score":0.9789714,"about_ca_system_score_codex":0.000033878423,"about_ca_system_score_gemma":0.00013914611,"threshold_uncertainty_score":0.7086309},"labels":[],"label_agreement":null},{"id":"W1993294649","doi":"10.1016/j.tcs.2013.09.031","title":"Succinct encoding of arbitrary graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Constant (computer programming); Vertex (graph theory); Discrete mathematics; Multiplicative function; Graph; Computer science","score_opus":0.007668647300515955,"score_gpt":0.227461928451841,"score_spread":0.21979328115132504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993294649","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.07684191,0.000035340694,0.91647834,0.00038939415,0.0004572033,0.00014979577,0.0000012261222,0.00013157871,0.0055152145],"genre_scores_gemma":[0.7250334,0.0000041994267,0.27467525,0.00023593257,0.000039142236,0.0000044885696,4.969041e-7,0.000003654443,0.000003429583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978988,0.0000661534,0.00030736128,0.0005783647,0.00067983055,0.00046946062],"domain_scores_gemma":[0.998255,0.00020738007,0.00008809391,0.0009835592,0.00020851666,0.0002574504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007408035,0.00015263792,0.00020856297,0.00021722907,0.00025876876,0.00030748697,0.0030596335,0.000041896994,0.00013030671],"category_scores_gemma":[0.00004217246,0.00011220889,0.000069159476,0.0011284045,0.001689989,0.0016528411,0.001673912,0.00016222332,0.00010065922],"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.0000010925718,0.00003956489,0.000120399585,0.000005449347,0.0000017917519,0.000003326956,0.00012644196,0.00001530394,0.0027185432,0.94888836,0.00012375032,0.04795598],"study_design_scores_gemma":[0.00013194069,0.00013577742,0.0042839115,0.000037924354,0.0000017738507,0.000023366405,0.0000042001825,0.55277836,0.013243462,0.42913505,0.000053656757,0.00017053912],"about_ca_topic_score_codex":0.000022306867,"about_ca_topic_score_gemma":1.06798005e-7,"teacher_disagreement_score":0.6481915,"about_ca_system_score_codex":0.00001830965,"about_ca_system_score_gemma":0.00008902558,"threshold_uncertainty_score":0.6226835},"labels":[],"label_agreement":null},{"id":"W1993886628","doi":"10.1016/j.tcs.2008.12.049","title":"Affine systems of equations and counting infinitary logic","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Unary operation; Discrete mathematics; Constraint satisfaction problem; Affine transformation; Counting problem; Abelian group; Datalog; Algebra over a field; Pure mathematics; Computer science; Theoretical computer science","score_opus":0.012769188734151954,"score_gpt":0.24341795040036762,"score_spread":0.23064876166621567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993886628","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.010285641,0.00003195388,0.98519105,0.0009982694,0.0002201065,0.000096757576,6.9586315e-7,0.00008869259,0.0030868272],"genre_scores_gemma":[0.8869597,0.000004817036,0.11272438,0.00027627157,0.000029649702,7.972748e-7,4.0636198e-7,0.0000012395049,0.0000027588524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893093,0.000044088094,0.00022503005,0.00028188998,0.000325168,0.0001929212],"domain_scores_gemma":[0.99917704,0.00020669396,0.0000711274,0.00027588676,0.00017449561,0.0000947552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007210198,0.000080864746,0.00012263426,0.00015795867,0.00018851235,0.00019798412,0.00047986011,0.00002723378,0.0000148317695],"category_scores_gemma":[0.00010815173,0.000068664456,0.000018774192,0.00070275017,0.00086953305,0.00050461676,0.00016265905,0.000073801246,0.000005368766],"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":[9.968395e-7,0.000014316919,0.00008787848,0.0000029005366,8.1234873e-7,0.0000010297853,0.00013235974,0.0025374067,0.0003391601,0.95622617,0.0000043203117,0.040652666],"study_design_scores_gemma":[0.00011183188,0.00012041338,0.0053543504,0.000021088277,0.0000022254303,0.000022850832,0.000007413964,0.941218,0.00019909715,0.052845687,0.00000943404,0.00008761976],"about_ca_topic_score_codex":0.0000031242407,"about_ca_topic_score_gemma":3.0405027e-7,"teacher_disagreement_score":0.9386806,"about_ca_system_score_codex":0.00001775109,"about_ca_system_score_gemma":0.00006418047,"threshold_uncertainty_score":0.32038307},"labels":[],"label_agreement":null},{"id":"W1994077047","doi":"10.1016/j.tcs.2008.05.014","title":"Solving structured linear systems with large displacement rank","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"CHIST-ERA; Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Microsoft Research","keywords":"Vandermonde matrix; Mathematics; Toeplitz matrix; Rank (graph theory); Logarithm; Interpolation (computer graphics); Exponent; Matrix (chemical analysis); Displacement (psychology); Multiplication (music); Cauchy distribution; Applied mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Computer science; Motion (physics)","score_opus":0.008182856888058834,"score_gpt":0.2243535310446579,"score_spread":0.21617067415659907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994077047","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.15817219,0.00003796064,0.8397552,0.00032371943,0.0007008241,0.00019909267,0.000001577001,0.0002206029,0.0005888754],"genre_scores_gemma":[0.9167269,0.0000031033799,0.082742095,0.00027519537,0.00021772482,0.0000072394373,0.0000012455132,0.0000078628445,0.000018661212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973079,0.00009060725,0.0002796133,0.0007249649,0.00089618453,0.00070074946],"domain_scores_gemma":[0.99865067,0.00014070785,0.00008735668,0.00064920186,0.00016860614,0.0003034725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073373504,0.00021627959,0.00023887541,0.00015587702,0.0008433243,0.00029117422,0.0017141058,0.00004016557,0.000014614555],"category_scores_gemma":[0.000026254082,0.00015070953,0.00004752971,0.0009869725,0.0012746948,0.0007176551,0.00077303516,0.00018168034,0.000048834903],"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.000017298817,0.000050842224,0.00015929698,0.000009583747,0.0000065661475,0.000046790898,0.0007986331,0.004486361,0.00027237888,0.9904371,0.000059278565,0.0036558819],"study_design_scores_gemma":[0.00058882096,0.0002627691,0.0021481584,0.000039964452,0.0000038672106,0.00024623235,0.0000070272567,0.9881341,0.0010979951,0.0069774324,0.00022246933,0.0002711778],"about_ca_topic_score_codex":0.00000719204,"about_ca_topic_score_gemma":9.86464e-7,"teacher_disagreement_score":0.9836477,"about_ca_system_score_codex":0.00007566287,"about_ca_system_score_gemma":0.00020921283,"threshold_uncertainty_score":0.6486254},"labels":[],"label_agreement":null},{"id":"W1994084299","doi":"10.1016/j.tcs.2004.11.003","title":"The generative capacity of block-synchronized context-free grammars","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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":"Language family; Tree-adjoining grammar; Rule-based machine translation; Nesting (process); Computer science; Mathematics; Block (permutation group theory); Context (archaeology); Generative grammar; Context-free language; Programming language; Discrete mathematics; Context-free grammar; Combinatorics; Artificial intelligence; Linguistics; Geography","score_opus":0.010678476020316978,"score_gpt":0.22125262563059822,"score_spread":0.21057414961028123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994084299","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.12522005,0.000092589435,0.869927,0.0031435345,0.0006261336,0.0001894711,0.000003302436,0.00014912526,0.0006487891],"genre_scores_gemma":[0.8546125,0.0000089268615,0.14468177,0.000594994,0.00008334865,0.000007591052,1.9582535e-7,0.000006358963,0.0000042897404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735034,0.00016383111,0.00039105958,0.0006131351,0.0008381631,0.00064345234],"domain_scores_gemma":[0.99704117,0.0005475386,0.00014222895,0.0017694515,0.00027688916,0.00022274753],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022403572,0.0002119689,0.0002663188,0.00009361957,0.0008158079,0.0004139494,0.0058890367,0.000053777574,0.000008060428],"category_scores_gemma":[0.00027585131,0.00013262247,0.00011311484,0.0009971884,0.007648738,0.0005011946,0.001812523,0.00022428932,0.000024993078],"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.000007928015,0.000049873222,0.0000062963745,0.0000031727652,0.0000071189056,0.000005286259,0.0006937232,0.00024299936,0.002226927,0.97732776,0.00003730982,0.019391607],"study_design_scores_gemma":[0.0006438316,0.0001820549,0.00018787506,0.00002882737,0.000004433832,0.00004615688,0.000021750218,0.098349206,0.044241197,0.85601324,0.0000933127,0.00018810846],"about_ca_topic_score_codex":0.000023309687,"about_ca_topic_score_gemma":0.000007069569,"teacher_disagreement_score":0.72939247,"about_ca_system_score_codex":0.00010313015,"about_ca_system_score_gemma":0.00025918602,"threshold_uncertainty_score":0.9994896},"labels":[],"label_agreement":null},{"id":"W1994325523","doi":"10.1016/j.tcs.2012.05.014","title":"polish—Let us play the cleaning game","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Graph; Vertex (graph theory); Mathematics; Complete bipartite graph; Discrete mathematics; Computer science","score_opus":0.021243932082185567,"score_gpt":0.28496814932973086,"score_spread":0.2637242172475453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994325523","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.08847484,0.0000744993,0.89912105,0.002333752,0.001811071,0.0001588525,7.263106e-7,0.00027733107,0.0077479025],"genre_scores_gemma":[0.94594765,0.000004099588,0.05072111,0.0026284046,0.0006579859,0.000011736625,1.6987958e-7,0.00001085492,0.000018013698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966353,0.00018826188,0.00034715552,0.0005764989,0.0009934533,0.0012593096],"domain_scores_gemma":[0.9973459,0.00064639514,0.00009314209,0.0013216935,0.0001637479,0.00042910743],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029784418,0.00022254311,0.00019124435,0.00013737098,0.00069172814,0.0008269689,0.005163772,0.000060858074,0.00011345504],"category_scores_gemma":[0.00026111802,0.0001434874,0.000088667075,0.0013951964,0.004685021,0.0016941491,0.0020608758,0.0003593706,0.0007194505],"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.0000023623015,0.000039275285,0.00052855007,0.000001285171,0.000002558948,0.0000028391432,0.0027966634,0.00017340278,0.00023248058,0.9514582,0.00020757859,0.04455476],"study_design_scores_gemma":[0.000087422115,0.00018845165,0.007928596,0.00004093529,0.00000971795,0.00016644066,0.00008336956,0.7011114,0.030352049,0.25328308,0.0061598136,0.00058871444],"about_ca_topic_score_codex":0.000013933977,"about_ca_topic_score_gemma":9.0813774e-7,"teacher_disagreement_score":0.8574728,"about_ca_system_score_codex":0.000084643376,"about_ca_system_score_gemma":0.000108188266,"threshold_uncertainty_score":0.9980236},"labels":[],"label_agreement":null},{"id":"W1994512037","doi":"10.1016/s0304-3975(01)00263-8","title":"Density via duality","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Duality (order theory); Partially ordered set; Directed graph; Combinatorics; Discrete mathematics","score_opus":0.024775744892119242,"score_gpt":0.28839810292029566,"score_spread":0.2636223580281764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994512037","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.026218226,0.000031324762,0.96373934,0.0014092495,0.00041919062,0.00015466641,5.829685e-7,0.00036911498,0.0076582944],"genre_scores_gemma":[0.83339965,0.0000042028587,0.16583724,0.0006338543,0.00008062686,0.000004582045,1.330426e-7,0.0000066910857,0.00003303231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632317,0.0002488447,0.0002697694,0.0009980885,0.0012161733,0.0009439796],"domain_scores_gemma":[0.9971351,0.00037774022,0.000055243327,0.0016389481,0.00028982197,0.0005031298],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002296245,0.00020081775,0.00022148278,0.00023892646,0.00069112494,0.00041170855,0.004150838,0.000053966087,0.00021257553],"category_scores_gemma":[0.00017579678,0.00016854606,0.00008517104,0.0022097765,0.0051666363,0.0011702081,0.002198974,0.00034056013,0.00072139787],"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.0000029768978,0.0000693369,0.00008090402,0.0000030909778,0.000002174298,0.000027152068,0.00022951044,0.000030486464,0.0008826081,0.9181397,0.000056238834,0.08047581],"study_design_scores_gemma":[0.0001209361,0.000099758014,0.00062690536,0.0000054295024,0.000001086048,0.000070103946,0.0000012049816,0.48593983,0.0057205292,0.50711286,0.00012197989,0.00017941672],"about_ca_topic_score_codex":0.0000019480515,"about_ca_topic_score_gemma":3.9114005e-7,"teacher_disagreement_score":0.8071814,"about_ca_system_score_codex":0.00008062176,"about_ca_system_score_gemma":0.000034280973,"threshold_uncertainty_score":0.9975407},"labels":[],"label_agreement":null},{"id":"W1995186768","doi":"10.1016/j.tcs.2010.10.030","title":"Succinct representation of dynamic trees","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Node (physics); Tree (set theory); Computer science; Constant (computer programming); Binary tree; Combinatorics; Enhanced Data Rates for GSM Evolution; Logarithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.006760893345757082,"score_gpt":0.2726541615227393,"score_spread":0.2658932681769822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995186768","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.13742556,0.0000061172827,0.86002463,0.00034924198,0.0007952162,0.000081615304,0.000001966964,0.00009569415,0.0012199553],"genre_scores_gemma":[0.71336377,0.0000017868914,0.28652653,0.000055682027,0.000041519943,0.0000017124714,0.000001115983,0.000002966709,0.0000049279074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823153,0.000048610513,0.00025046003,0.0005503005,0.00061298325,0.00030614075],"domain_scores_gemma":[0.9982067,0.00019710684,0.00008927973,0.0011623309,0.00018039983,0.00016423267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007263936,0.00011449926,0.00016851051,0.0001635689,0.00021097291,0.00019037304,0.0024647466,0.000044112992,0.000051130723],"category_scores_gemma":[0.00009464307,0.00008687363,0.000052789837,0.0010215981,0.0017098013,0.00090025994,0.0011999758,0.00019932161,0.00002687758],"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.0000032044775,0.00004131546,0.00008845768,0.0000021278254,0.0000012300142,0.0000033152328,0.00012218016,0.000022315977,0.024219029,0.83254814,0.000022843522,0.14292586],"study_design_scores_gemma":[0.0001532627,0.00009900613,0.012942147,0.000011498055,0.000002127883,0.000027446044,0.000002811262,0.85624236,0.021523768,0.10881461,0.000057730053,0.00012325676],"about_ca_topic_score_codex":0.000010302633,"about_ca_topic_score_gemma":0.0000034941752,"teacher_disagreement_score":0.85622,"about_ca_system_score_codex":0.000012269015,"about_ca_system_score_gemma":0.00008250663,"threshold_uncertainty_score":0.6299834},"labels":[],"label_agreement":null},{"id":"W1995730325","doi":"10.1016/j.tcs.2011.04.012","title":"Continuity of operators on continuous and discrete time streams","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Swansea University","keywords":"Hadamard transform; Metric space; Computer science; Theoretical computer science; Discrete space; Spacetime; Metric (unit); Range (aeronautics); STREAMS; Discrete time and continuous time; Semantics (computer science); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Programming language; Mathematical analysis","score_opus":0.009724069923910086,"score_gpt":0.22600280106757506,"score_spread":0.21627873114366497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995730325","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.36945665,0.000017292929,0.6222519,0.00014635037,0.00033581708,0.00025388598,0.0000043938903,0.00017357462,0.0073600877],"genre_scores_gemma":[0.8732979,0.0000018017153,0.12645033,0.00018111407,0.000046481342,0.0000038093692,2.754089e-7,0.0000075328376,0.000010747012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708325,0.00019336189,0.00041990168,0.0010139045,0.00070016494,0.00058939337],"domain_scores_gemma":[0.99773544,0.00035544325,0.00011827879,0.0011566938,0.00026942044,0.00036469742],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017030193,0.00026802282,0.00044105953,0.00018183107,0.0002210238,0.00022084665,0.0025362123,0.00006940284,0.000068399786],"category_scores_gemma":[0.00014159294,0.00020472414,0.0000794384,0.00084048015,0.0048908,0.0005186255,0.0019854687,0.00021320867,0.00005358376],"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.000016053473,0.00014070807,0.0006851463,0.000006715803,0.0000057755,0.000014052718,0.001092607,0.000012072315,0.00041750667,0.92105955,0.000010513543,0.07653927],"study_design_scores_gemma":[0.00072192826,0.0024391338,0.029703338,0.00007712746,0.000013984002,0.00007236898,0.000021723537,0.67268616,0.028152376,0.26542115,0.00003631732,0.00065440795],"about_ca_topic_score_codex":0.000018499777,"about_ca_topic_score_gemma":4.6588102e-7,"teacher_disagreement_score":0.67267406,"about_ca_system_score_codex":0.00004094725,"about_ca_system_score_gemma":0.00009822706,"threshold_uncertainty_score":0.99781734},"labels":[],"label_agreement":null},{"id":"W1995777777","doi":"10.1016/j.tcs.2007.07.034","title":"Transition complexity of language operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transition (genetics); Computer science; Programming language; Theoretical computer science; Linguistics; Chemistry; Philosophy","score_opus":0.015023758854855974,"score_gpt":0.26985739425449723,"score_spread":0.25483363539964127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995777777","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.21795307,0.000014698478,0.77935743,0.00044762815,0.00019541135,0.00007471221,0.0000019165373,0.00012265067,0.0018324631],"genre_scores_gemma":[0.7664945,5.8823696e-7,0.23306644,0.0003796484,0.000052310148,7.5582955e-7,9.474874e-7,0.0000028598529,0.0000019127208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849486,0.000053664702,0.0002664843,0.00036019314,0.00046591522,0.00035885046],"domain_scores_gemma":[0.99895895,0.00013649008,0.000032996813,0.00059140986,0.00012619802,0.00015395271],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022034633,0.00010289214,0.00014752719,0.00016398935,0.00023113126,0.00012445562,0.0014705306,0.00003233461,0.000047031303],"category_scores_gemma":[0.000032231037,0.00008489464,0.000053633612,0.0009216372,0.0031738605,0.00054529216,0.00030443066,0.00010368922,0.00002364616],"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.000003649467,0.000054044955,0.0000038496896,0.0000041965704,0.0000015586852,0.000006895387,0.002073955,0.00013552053,0.012465857,0.96260977,0.0000049150844,0.022635773],"study_design_scores_gemma":[0.00019651194,0.00014114252,0.0018067331,0.000022156413,0.000003045383,0.00003824708,0.00006825585,0.7221876,0.09492436,0.18043993,0.000009210435,0.00016280607],"about_ca_topic_score_codex":0.000012095165,"about_ca_topic_score_gemma":0.0000031108145,"teacher_disagreement_score":0.7821698,"about_ca_system_score_codex":0.00002715727,"about_ca_system_score_gemma":0.000055819943,"threshold_uncertainty_score":0.99953896},"labels":[],"label_agreement":null},{"id":"W1996328142","doi":"10.1016/j.tcs.2009.03.018","title":"Efficient enumeration of words in regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Mathematics; Computation; Domain (mathematical analysis); Algorithm; Combinatorics; Computer science; Discrete mathematics","score_opus":0.006969939814450132,"score_gpt":0.25593533423711606,"score_spread":0.24896539442266594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996328142","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.18299577,0.00004292643,0.8141717,0.00078795594,0.00016149368,0.00008864869,4.4572508e-7,0.00006452486,0.0016865903],"genre_scores_gemma":[0.82505155,0.0000012858053,0.1746982,0.00020733048,0.00003658471,0.0000010565506,2.2521309e-7,0.0000015641799,0.0000022154968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833786,0.00007725384,0.00026161768,0.00042940074,0.0005548821,0.0003389725],"domain_scores_gemma":[0.9990577,0.000104500265,0.00005491094,0.00059839885,0.00008759129,0.00009687795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011845577,0.00010892513,0.00016937222,0.00029518383,0.00011780888,0.00012311546,0.0015346656,0.0000330007,0.000012574708],"category_scores_gemma":[0.00005614732,0.00009384821,0.00004820167,0.0017036308,0.0010559988,0.0001787287,0.00030414842,0.00013063283,0.0000075002836],"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.0000029764694,0.00008769683,0.000032747317,0.0000022321335,5.430305e-7,0.000007526544,0.000601493,0.0028673445,0.0009986561,0.90658665,0.0000034799236,0.088808656],"study_design_scores_gemma":[0.00014523164,0.00016122713,0.005754549,0.000031539515,8.477982e-7,0.000010448838,0.000009184019,0.7984122,0.0057974802,0.18956245,0.00000823681,0.00010657354],"about_ca_topic_score_codex":0.0000035211106,"about_ca_topic_score_gemma":5.918114e-7,"teacher_disagreement_score":0.79554486,"about_ca_system_score_codex":0.00003207929,"about_ca_system_score_gemma":0.000060903214,"threshold_uncertainty_score":0.38908714},"labels":[],"label_agreement":null},{"id":"W1996579752","doi":"10.1016/j.tcs.2014.11.005","title":"A family of sand automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Surjective function; Mathematics; Equicontinuity; Deterministic automaton; Automaton; Two-way deterministic finite automaton; Stochastic cellular automaton; Continuous automaton; Simple (philosophy); Discrete mathematics; Cellular automaton; Mobile automaton; Theoretical computer science; Algorithm; Automata theory; Computer science; Quantum finite automata; Finite-state machine","score_opus":0.007572707418624368,"score_gpt":0.23374007002613253,"score_spread":0.22616736260750817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996579752","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.034807093,0.000010943768,0.9478652,0.0005016255,0.00016916412,0.00008817919,8.8121305e-7,0.00020937275,0.01634756],"genre_scores_gemma":[0.80759925,0.0000013523091,0.19209248,0.00025764908,0.000036831854,0.000003847635,4.16616e-7,0.0000033533336,0.000004825674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984088,0.000057572324,0.00023496897,0.0004675509,0.0005137162,0.00031740512],"domain_scores_gemma":[0.9983055,0.00018510394,0.000065774846,0.0011610809,0.0001162637,0.00016624866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011068045,0.00010666941,0.00016421059,0.00012236717,0.00019299229,0.00017007501,0.0026598135,0.000029517276,0.000011575404],"category_scores_gemma":[0.0000490394,0.00008713079,0.000051178908,0.001001372,0.0017943407,0.0003322721,0.0009074824,0.000081589926,0.00008044479],"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":[7.1599914e-7,0.000040853007,0.000014594157,0.0000042604893,0.0000010913045,4.99746e-7,0.00008667343,0.000028699476,0.011607385,0.9255566,0.00005926402,0.06259939],"study_design_scores_gemma":[0.00014553519,0.00009099603,0.001971874,0.000012194568,0.0000023015475,0.000011285108,8.1557187e-7,0.8176715,0.021711519,0.15772417,0.00054421823,0.000113633614],"about_ca_topic_score_codex":0.0000035102917,"about_ca_topic_score_gemma":5.8156555e-8,"teacher_disagreement_score":0.81764275,"about_ca_system_score_codex":0.000013908216,"about_ca_system_score_gemma":0.00007200973,"threshold_uncertainty_score":0.66113234},"labels":[],"label_agreement":null},{"id":"W1996612506","doi":"10.1016/s0304-3975(03)00315-3","title":"The regular-language semantics of second-order idealized ALGOL","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":58,"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":"Decidability; Equivalence (formal languages); Computer science; Programming language; Fragment (logic); Operational semantics; Semantics (computer science); Game semantics; Formal semantics (linguistics); Denotational semantics; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.009277252131278366,"score_gpt":0.24989362450288827,"score_spread":0.2406163723716099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996612506","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.009011447,0.00015717215,0.97682345,0.0003412997,0.0008370046,0.00023515563,2.9565118e-7,0.00010890066,0.012485296],"genre_scores_gemma":[0.9368171,0.0000045989996,0.06276628,0.00021186225,0.000048060996,0.0000063768935,2.0941494e-7,0.0000075043913,0.00013798928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974509,0.00028406215,0.00038542473,0.0005274219,0.0007416453,0.0006105538],"domain_scores_gemma":[0.99781436,0.00035944168,0.00014876098,0.0012495472,0.00024265297,0.0001852235],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029869468,0.00017683703,0.00024317228,0.00007411279,0.00048993924,0.0004070367,0.0024899375,0.000059715254,0.00006811379],"category_scores_gemma":[0.00025384923,0.000109030865,0.000085169195,0.0012854949,0.0027822244,0.00027307923,0.00061906764,0.0001618131,0.00006333001],"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.000002585511,0.00002923245,0.000037353704,0.0000091244465,0.0000059277563,0.000010894675,0.00068192795,0.00001405489,0.0006228306,0.9835945,0.00009406616,0.014897496],"study_design_scores_gemma":[0.0005855555,0.00031290815,0.000349689,0.000010659217,0.000010412387,0.00018178,0.00008120575,0.114177644,0.023877878,0.851027,0.008981725,0.0004035345],"about_ca_topic_score_codex":0.0000060877956,"about_ca_topic_score_gemma":0.0000040968575,"teacher_disagreement_score":0.92780566,"about_ca_system_score_codex":0.000029030874,"about_ca_system_score_gemma":0.00014883181,"threshold_uncertainty_score":0.99993163},"labels":[],"label_agreement":null},{"id":"W1996644214","doi":"10.1016/j.tcs.2009.05.002","title":"Operational state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"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":"Concatenation (mathematics); Finite-state machine; Nested word; Quantum finite automata; Discrete mathematics; Mathematics; Automaton; Upper and lower bounds; Word (group theory); Constant (computer programming); Deterministic finite automaton; Combinatorics; State (computer science); Automata theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.019453934358182844,"score_gpt":0.2631941083867752,"score_spread":0.24374017402859235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996644214","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.133635,0.000015704658,0.86149853,0.0023902573,0.0002887552,0.000129295,0.000004049328,0.00028962188,0.0017487629],"genre_scores_gemma":[0.7929554,0.0000019566462,0.20591988,0.0010645142,0.000044682103,0.0000013408988,0.0000014979405,0.0000034649538,0.000007281242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754494,0.00012221307,0.00039415012,0.000612529,0.0008301284,0.0004960272],"domain_scores_gemma":[0.99827814,0.00016799544,0.00010112244,0.0009899883,0.00023317202,0.00022959439],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014597279,0.00018282981,0.00026372718,0.00018425695,0.00029271437,0.0003410987,0.0030742749,0.000035406785,0.000049893293],"category_scores_gemma":[0.00006147287,0.0001478519,0.0000683698,0.0012580793,0.0033579955,0.00093871617,0.0006662856,0.00014701276,0.000044109223],"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.000007015777,0.000103675986,0.000015237519,0.0000029533624,0.0000020832506,0.000006684172,0.00026829567,0.00015941674,0.002028051,0.9085039,0.000052486183,0.088850185],"study_design_scores_gemma":[0.00018408593,0.00016993782,0.008687686,0.000019393034,0.0000014103349,0.000027761198,0.0000019068655,0.51492286,0.0062884227,0.46952313,0.000034428525,0.0001389525],"about_ca_topic_score_codex":0.0000035354312,"about_ca_topic_score_gemma":2.8014054e-7,"teacher_disagreement_score":0.65932035,"about_ca_system_score_codex":0.000038058493,"about_ca_system_score_gemma":0.00016974827,"threshold_uncertainty_score":0.9993543},"labels":[],"label_agreement":null},{"id":"W1997006459","doi":"10.1016/j.tcs.2012.01.011","title":"Effectively approximating measurable sets by open sets","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.022850413530175428,"score_gpt":0.28853472834075244,"score_spread":0.265684314810577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997006459","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.04333117,0.0001037736,0.9440465,0.0008138747,0.0012607164,0.0008002787,0.000004769798,0.00043205052,0.009206892],"genre_scores_gemma":[0.6347391,8.8139797e-7,0.36463997,0.000483436,0.00008566891,0.000029457718,0.0000011793555,0.000012926702,0.0000073591586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99436384,0.00059869513,0.00054996007,0.0013737867,0.0014038703,0.0017098234],"domain_scores_gemma":[0.9960276,0.0009427106,0.00018119553,0.0016633259,0.00032988106,0.00085528544],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.008809047,0.00041734157,0.00052197283,0.00017517013,0.00096413895,0.001840883,0.008555507,0.00010439646,0.00005920278],"category_scores_gemma":[0.00045731352,0.00034568427,0.00010629298,0.0020463497,0.0023096977,0.0036563012,0.008103801,0.0004370013,0.0002458004],"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.000008252774,0.0003882972,0.0008064212,0.000022044862,0.000010520737,0.000005734885,0.0010034556,0.0001102216,0.0010928405,0.8388795,0.0005195204,0.15715317],"study_design_scores_gemma":[0.0004918733,0.00030189235,0.003551437,0.000045620534,0.000008318148,0.00012864417,0.00001152781,0.8263317,0.009133782,0.15904927,0.00027991447,0.00066604995],"about_ca_topic_score_codex":0.000028477552,"about_ca_topic_score_gemma":5.083725e-7,"teacher_disagreement_score":0.82622147,"about_ca_system_score_codex":0.00027046129,"about_ca_system_score_gemma":0.00018987831,"threshold_uncertainty_score":0.99991846},"labels":[],"label_agreement":null},{"id":"W1997048861","doi":"10.1016/j.tcs.2010.12.005","title":"On the complexity of reconfiguration problems","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":258,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Mathematics; Time complexity; Transformation (genetics); PSPACE; NP-complete; Computer science; Computational complexity theory; Combinatorics; Theoretical computer science; Algorithm","score_opus":0.04184605298491346,"score_gpt":0.2974343397464628,"score_spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997048861","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.103911705,0.000002151212,0.8822166,0.004071025,0.00044021508,0.0002753094,0.0000013261019,0.00008805465,0.008993648],"genre_scores_gemma":[0.93816423,7.0346226e-7,0.061448947,0.00032199587,0.00004181478,0.000010047066,2.5916754e-7,0.000004720767,0.000007282377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774927,0.00017203993,0.0002515033,0.0005487584,0.00084617716,0.00043223947],"domain_scores_gemma":[0.9971123,0.00083044486,0.00009103326,0.0015036652,0.00030806597,0.00015448694],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034165403,0.00012903297,0.00014880381,0.00016171887,0.00044798045,0.00021139464,0.0037956184,0.00004014512,0.00013212439],"category_scores_gemma":[0.00043438462,0.00007825829,0.000057810375,0.0013087108,0.012964038,0.00045492273,0.00065142073,0.00048563466,0.000069656024],"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.000006344228,0.000046949983,0.0000083760915,0.0000032556925,0.000001575672,8.205675e-7,0.00020384937,0.000074633856,0.017742187,0.96987176,0.000019362116,0.012020893],"study_design_scores_gemma":[0.00006967686,0.00016399675,0.00039716644,0.000010166621,5.7518486e-7,0.000009515372,0.0000020814778,0.20673047,0.035295915,0.7572078,0.000032976404,0.00007964717],"about_ca_topic_score_codex":0.0000019042903,"about_ca_topic_score_gemma":0.000002051881,"teacher_disagreement_score":0.83425254,"about_ca_system_score_codex":0.00001602732,"about_ca_system_score_gemma":0.00010043109,"threshold_uncertainty_score":0.98972213},"labels":[],"label_agreement":null},{"id":"W1997427041","doi":"10.1016/j.tcs.2005.11.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mtext>CTL</mml:mtext></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:math> model checking for time Petri nets","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; CTL*; Computer science; Algorithm; Model checking; Bounded function; State space; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.023671791092370376,"score_gpt":0.26775318335223874,"score_spread":0.24408139225986836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997427041","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.42259398,0.0006130227,0.3650318,0.0015348264,0.0038084558,0.00015336761,0.00013578963,0.00051437924,0.20561436],"genre_scores_gemma":[0.818346,0.00021413059,0.175754,0.0023707475,0.0020951368,0.0004984272,0.00012315845,0.000367649,0.00023073233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9862456,0.00063863315,0.0022689225,0.0032289103,0.003993179,0.0036247643],"domain_scores_gemma":[0.9902256,0.0023290063,0.001781565,0.0036254358,0.0004738559,0.0015645046],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0062671956,0.0011519156,0.00055215525,0.0007157416,0.0026480684,0.0034958217,0.0066689905,0.0018004414,0.028684417],"category_scores_gemma":[0.0024405648,0.0018122022,0.0015331587,0.0023711056,0.0058970214,0.003803221,0.004908118,0.0019468241,0.0037444532],"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.00071566086,0.00037412933,0.0000029417083,0.0004507882,0.00031096075,0.00024121057,0.0028186163,0.014131988,0.0027230347,0.9458567,0.0136856325,0.018688334],"study_design_scores_gemma":[0.0010938973,0.0014792795,0.000044403947,0.00054992904,0.0003410469,0.0008853294,0.00015771143,0.6913728,0.3003447,0.0013923037,0.0011202532,0.0012183174],"about_ca_topic_score_codex":0.0002138028,"about_ca_topic_score_gemma":0.000047650276,"teacher_disagreement_score":0.9444644,"about_ca_system_score_codex":0.000067204346,"about_ca_system_score_gemma":0.0021282164,"threshold_uncertainty_score":0.99949545},"labels":[],"label_agreement":null},{"id":"W1998068293","doi":"10.1016/j.tcs.2009.04.008","title":"Two non-holonomic lattice walks in the quarter plane","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Random walk; Iterated function; Conjecture; Lattice (music); Combinatorics; Plane (geometry); Discrete mathematics; Mathematical analysis; Geometry; Statistics; Physics","score_opus":0.016902911305059446,"score_gpt":0.3131132280734893,"score_spread":0.29621031676842985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998068293","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.70132625,0.000007556952,0.27785543,0.0027885174,0.00062784075,0.0005222654,0.0000013778201,0.00012331297,0.016747447],"genre_scores_gemma":[0.92039585,0.0000010210706,0.078616835,0.00077173987,0.00019538756,0.0000062079444,2.8824607e-7,0.000008225208,0.0000044660237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824727,0.00010888912,0.00033911486,0.00036325847,0.0004375086,0.00050395355],"domain_scores_gemma":[0.9977666,0.0012154955,0.00007920227,0.0007873761,0.00005407337,0.000097244345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015726879,0.00018707685,0.00026339001,0.00010327857,0.0001737876,0.00014661385,0.0013310132,0.00004472033,0.00002237067],"category_scores_gemma":[0.00020884011,0.000119222525,0.000050288683,0.000526967,0.00095298194,0.00021533633,0.00010376939,0.0002472834,0.000089121764],"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.0000120618715,0.00014949722,0.0000064371084,0.0000050914914,0.0000011137615,0.000015541309,0.0019115453,0.000019690611,0.00020164186,0.99553233,0.00006034945,0.0020846725],"study_design_scores_gemma":[0.00047510437,0.00037655482,0.00028228556,0.000030809617,0.000006709031,0.000043912667,0.00006126071,0.032350298,0.0005126506,0.96564835,0.000047546866,0.00016449904],"about_ca_topic_score_codex":0.0000013252787,"about_ca_topic_score_gemma":0.0000010843409,"teacher_disagreement_score":0.21906957,"about_ca_system_score_codex":0.00008558916,"about_ca_system_score_gemma":0.000051132956,"threshold_uncertainty_score":0.48617536},"labels":[],"label_agreement":null},{"id":"W1998427290","doi":"10.1016/s0304-3975(03)00221-4","title":"Generating and characterizing the perfect elimination orderings of a chordal graph","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Amortized analysis; Oracle; Initialization; Clique; Treewidth; Discrete mathematics; Constant (computer programming); Graph; Algorithm; Computer science; Data structure; Pathwidth; Line graph","score_opus":0.01231511195538729,"score_gpt":0.26704502216468384,"score_spread":0.25472991020929653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998427290","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.34638187,0.000041642335,0.65247077,0.0004105026,0.00011522541,0.00012009452,2.8744924e-7,0.000038217822,0.0004213918],"genre_scores_gemma":[0.8767375,0.000010746889,0.123010404,0.00019971766,0.000025469679,0.0000075960024,1.1661411e-7,0.000005481361,0.000003009578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979566,0.00026783734,0.00022917161,0.00050852186,0.00058875734,0.00044915365],"domain_scores_gemma":[0.9985512,0.00044272406,0.000081399325,0.0005870515,0.00020737493,0.00013027573],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031582818,0.0001361889,0.00015576054,0.00019050237,0.00058481854,0.00028711508,0.0013198116,0.000028959437,0.000009465223],"category_scores_gemma":[0.00034138258,0.00009250257,0.00004220873,0.0013655225,0.0031316609,0.0006626013,0.0005971374,0.00020659219,0.000003126364],"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.0000031379332,0.000015905905,0.00007931145,0.000007079125,0.0000021659148,0.0000017102968,0.00061551126,0.0000783773,0.03167571,0.94059753,8.488862e-7,0.0269227],"study_design_scores_gemma":[0.000285356,0.00035470165,0.0026761438,0.000041560597,0.0000045238794,0.00012102595,0.000038101698,0.5465344,0.085325845,0.36427066,0.000080911785,0.0002667593],"about_ca_topic_score_codex":0.0000011659914,"about_ca_topic_score_gemma":2.3394628e-7,"teacher_disagreement_score":0.5763269,"about_ca_system_score_codex":0.00001975128,"about_ca_system_score_gemma":0.000071512855,"threshold_uncertainty_score":0.9995812},"labels":[],"label_agreement":null},{"id":"W1998674287","doi":"10.1016/j.tcs.2008.04.020","title":"How many runs can a string contain?","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Combinatorics; Conjecture; String (physics); Mathematics; Upper and lower bounds; Repetition (rhetorical device); Discrete mathematics; Data structure; Computer science; Mathematical analysis; Philosophy; Mathematical physics","score_opus":0.013842654129992698,"score_gpt":0.22579789981122944,"score_spread":0.21195524568123675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998674287","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.040651496,0.00003389234,0.9552883,0.0021986864,0.00056947384,0.00013542741,0.0000035483397,0.0002741125,0.00084507023],"genre_scores_gemma":[0.8145532,0.000008432021,0.18474935,0.00048187296,0.00015582953,0.0000045633483,0.0000010469697,0.0000063923408,0.000039290422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972736,0.00007275192,0.00019908023,0.0008440233,0.00089244015,0.00071808934],"domain_scores_gemma":[0.99804085,0.00013983864,0.00006870264,0.0011611212,0.00017341995,0.00041604985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577727,0.00020911328,0.00022675283,0.00017450652,0.0009345006,0.0007020592,0.003420549,0.000050564042,0.000013790193],"category_scores_gemma":[0.00005931318,0.00016278081,0.0000550656,0.00095852744,0.0022470162,0.001189923,0.00214406,0.00023940958,0.000028656803],"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.0000027731649,0.000035699228,0.00008978258,0.0000024527594,0.0000021512974,0.000089318615,0.00032796632,0.00002664569,0.00051870383,0.97526044,0.00013508191,0.023509009],"study_design_scores_gemma":[0.00048112386,0.000349204,0.0039704386,0.000043532746,0.000003616896,0.00037636462,0.000014739023,0.90846694,0.0059828786,0.07830171,0.0015152274,0.00049422105],"about_ca_topic_score_codex":0.0000137807865,"about_ca_topic_score_gemma":7.9368846e-7,"teacher_disagreement_score":0.9084403,"about_ca_system_score_codex":0.000070476475,"about_ca_system_score_gemma":0.00019302205,"threshold_uncertainty_score":0.82792246},"labels":[],"label_agreement":null},{"id":"W1998843748","doi":"10.1016/s0304-3975(98)00116-9","title":"Competitive analysis of randomized paging algorithms","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Paging; Competitive analysis; Computer science; Online algorithm; Cache; Algorithm; Randomized algorithm; CPU cache; Demand paging; Page fault; Cache algorithms; Deterministic algorithm; Virtual memory; Memory management; Parallel computing; Upper and lower bounds; Mathematics; Operating system","score_opus":0.008541897466011434,"score_gpt":0.26329504070959364,"score_spread":0.2547531432435822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998843748","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.0024217202,0.000020506144,0.96284086,0.00067639194,0.00010284113,0.00021506217,0.0000025106258,0.00010840672,0.03361172],"genre_scores_gemma":[0.7388724,0.000025699319,0.26068988,0.00034848083,0.000018978862,0.000006356352,0.0000019675113,0.000003233633,0.000032973552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736106,0.00035396978,0.0004511581,0.0005553968,0.0008573942,0.00042102448],"domain_scores_gemma":[0.99809504,0.0006296893,0.000084630214,0.00064826955,0.00032273232,0.0002196596],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033942827,0.00013784658,0.0006222902,0.0005716127,0.00022060014,0.00027626604,0.0018985338,0.000031680265,0.00095614337],"category_scores_gemma":[0.0000913379,0.00010535027,0.0002416257,0.004672198,0.0039610527,0.00052016333,0.00037325436,0.00012839281,0.000044010496],"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.00010103392,0.00004594006,0.000007380757,0.0000020473049,0.000069288995,0.0000026469036,0.0006670746,0.011352518,0.000030037654,0.95263255,0.000004016641,0.035085455],"study_design_scores_gemma":[0.00425428,0.000045633296,0.00012410816,0.0000127520425,0.000057609588,0.0000028429165,0.0000047987314,0.96666944,0.00043842226,0.028172527,0.00008659009,0.00013099567],"about_ca_topic_score_codex":0.000008084495,"about_ca_topic_score_gemma":6.004889e-7,"teacher_disagreement_score":0.9553169,"about_ca_system_score_codex":0.000026873462,"about_ca_system_score_gemma":0.00008809678,"threshold_uncertainty_score":0.99995714},"labels":[],"label_agreement":null},{"id":"W1998896855","doi":"10.1016/j.tcs.2014.10.015","title":"Dealing with undependable workers in decentralized network supercomputing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Computer science; Binary logarithm; Bounded function; Set (abstract data type); Logarithm; Time complexity; Supercomputer; Adversary; Parallel computing; Upper and lower bounds; Computational complexity theory; Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Mathematics","score_opus":0.005534214958432437,"score_gpt":0.21928154366739452,"score_spread":0.2137473287089621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998896855","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.05619281,0.000044569813,0.93901753,0.00041946291,0.0004374255,0.0001655151,4.871712e-7,0.00019311291,0.0035290923],"genre_scores_gemma":[0.7923535,0.0000015172292,0.20722505,0.00030528242,0.00009886005,0.0000037214063,8.1046636e-7,0.000008261728,0.0000030014016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968143,0.00016180414,0.0003890966,0.00085364154,0.00068925536,0.0010918712],"domain_scores_gemma":[0.9984265,0.00029544556,0.000079469864,0.00076606206,0.00012703669,0.00030550588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00275004,0.00022827972,0.00033357175,0.0001203839,0.00040798157,0.0006325818,0.0021382892,0.000058909503,0.00001317503],"category_scores_gemma":[0.00004575185,0.00017582857,0.000046870893,0.0018151896,0.0009723071,0.0006302653,0.0005346387,0.00025798194,0.00003196529],"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.000011022995,0.000024407062,0.0054014367,0.000006219365,0.0000029879325,0.000014219325,0.00013352983,0.03602821,0.000023266914,0.9365264,0.000018655312,0.021809654],"study_design_scores_gemma":[0.0005755682,0.00012593454,0.0044278367,0.00020719388,0.0000027199656,0.000047375033,0.000011399148,0.959283,0.00012616081,0.034393683,0.00049598055,0.00030316508],"about_ca_topic_score_codex":0.000051312727,"about_ca_topic_score_gemma":0.000021802009,"teacher_disagreement_score":0.9232548,"about_ca_system_score_codex":0.00006891324,"about_ca_system_score_gemma":0.000117115946,"threshold_uncertainty_score":0.71700805},"labels":[],"label_agreement":null},{"id":"W1999376700","doi":"10.1016/j.tcs.2012.10.013","title":"Tighter PAC-Bayes bounds through distribution-dependent priors","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":75,"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é Laval","funders":"","keywords":"Prior probability; Bayes' theorem; Mathematics; Reproducing kernel Hilbert space; Regularization (linguistics); Mathematical optimization; Applied mathematics; Exponential family; Algorithm; Class (philosophy); Function (biology); Distribution (mathematics); Computer science; Hilbert space; Artificial intelligence; Bayesian probability; Statistics; Mathematical analysis","score_opus":0.0075164416669550324,"score_gpt":0.2596614497271334,"score_spread":0.25214500806017837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999376700","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.035431366,0.00008223927,0.9567222,0.0017111711,0.0017151308,0.000111717934,0.0000041246117,0.00034478222,0.00387728],"genre_scores_gemma":[0.88780415,0.0000044919775,0.11100128,0.0006119059,0.00050560426,0.0000064459905,0.000003634863,0.000008424866,0.00005406696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968112,0.00016410607,0.00028733027,0.0006634257,0.0009938256,0.0010800721],"domain_scores_gemma":[0.99817246,0.0002696075,0.00008314191,0.0009244485,0.00013131938,0.00041903416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017182148,0.00024294495,0.00022164443,0.00007227099,0.0007464762,0.0007004591,0.0023643349,0.0000666255,0.00010507311],"category_scores_gemma":[0.0001360479,0.00018203686,0.00008868646,0.00091003324,0.0018451717,0.001623845,0.0012894503,0.00036130234,0.0003297261],"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.0000022172571,0.00009024984,0.0009963779,0.000004459297,0.000004056938,0.0000046803552,0.0009505499,0.000037715825,0.00007716427,0.9771399,0.0002024345,0.02049019],"study_design_scores_gemma":[0.0007489324,0.00052237365,0.022991167,0.00007853509,0.000021646812,0.00032643904,0.000031664953,0.69017386,0.008959381,0.25831673,0.01651208,0.0013172023],"about_ca_topic_score_codex":0.000011311249,"about_ca_topic_score_gemma":1.9076283e-7,"teacher_disagreement_score":0.85237277,"about_ca_system_score_codex":0.00009280829,"about_ca_system_score_gemma":0.00010051904,"threshold_uncertainty_score":0.74232477},"labels":[],"label_agreement":null},{"id":"W1999499351","doi":"10.1016/s0304-3975(00)00333-9","title":"Polymorphic lambda calculus and subtyping","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Subtyping; Soundness; Lambda calculus; Computer science; Extension (predicate logic); Programming language; Calculus (dental); Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.018575696554049077,"score_gpt":0.22882835018092254,"score_spread":0.21025265362687345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999499351","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.010422801,0.00030360374,0.9763097,0.0010450594,0.00068070355,0.00013713822,1.3585765e-7,0.00026929987,0.01083156],"genre_scores_gemma":[0.98220426,0.00001078358,0.017025309,0.00050279766,0.00016240033,0.0000047969793,1.2459728e-7,0.0000062380054,0.00008331585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784696,0.00008941755,0.00022427332,0.00070016546,0.0005158978,0.00062327116],"domain_scores_gemma":[0.9987505,0.000122050886,0.000057205732,0.0006563431,0.000093678296,0.00032019333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800395,0.00017042556,0.00019458347,0.00014257552,0.00046888465,0.000690623,0.0015277312,0.000056449186,0.00004850957],"category_scores_gemma":[0.00005565643,0.00013122514,0.000045269164,0.0008670063,0.0020292322,0.0005727354,0.00090510916,0.0001693908,0.00020416878],"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":[8.0432073e-7,0.000025534635,0.00013740806,0.000005882577,0.0000021487963,0.0000204363,0.00048743555,0.0000036408408,0.00012104622,0.9312719,0.00005417226,0.06786956],"study_design_scores_gemma":[0.0002586707,0.00022206688,0.00081134983,0.00000825881,0.0000042212882,0.00022723575,0.000007927143,0.8230681,0.00086844165,0.17296843,0.0012280692,0.00032721678],"about_ca_topic_score_codex":0.000012074048,"about_ca_topic_score_gemma":6.7181867e-7,"teacher_disagreement_score":0.97178143,"about_ca_system_score_codex":0.00003309701,"about_ca_system_score_gemma":0.000027344977,"threshold_uncertainty_score":0.7476791},"labels":[],"label_agreement":null},{"id":"W1999518031","doi":"10.1016/j.tcs.2005.10.045","title":"Hierarchies for classes of priority algorithms for Job Scheduling","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","score_opus":0.015456930125900416,"score_gpt":0.27097839790631356,"score_spread":0.2555214677804131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999518031","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.039962925,0.00007598312,0.95857984,0.0002292962,0.00042951206,0.00024080437,0.000011417136,0.00018425609,0.00028594627],"genre_scores_gemma":[0.42117822,0.00000597364,0.57852703,0.000037326306,0.0002251672,0.000012559283,0.0000010775123,0.000009205371,0.000003425512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898076,0.000010593114,0.00024050423,0.00023075477,0.00020976401,0.00032760802],"domain_scores_gemma":[0.9991124,0.00034488123,0.000026672573,0.00020018849,0.00020436491,0.00011149095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000654801,0.00011570475,0.00017717267,0.0001208086,0.00015895207,0.000074392476,0.00040193333,0.000046597317,0.00000981844],"category_scores_gemma":[0.00013456173,0.00010393359,0.0000695044,0.00032063687,0.00085906306,0.0001857139,0.000058634563,0.00008298193,0.0000030277229],"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.000014110787,0.000026815793,0.00002159263,0.00006164472,0.000009579396,1.1635413e-7,0.00030820916,0.3341873,0.0006778637,0.5556516,0.000019352346,0.109021805],"study_design_scores_gemma":[0.00030875616,0.00008698029,0.00007579934,0.000023153427,0.000007745242,0.0000022792165,0.000011589711,0.9708182,0.015353368,0.013024711,0.00015533865,0.00013208519],"about_ca_topic_score_codex":2.6608095e-7,"about_ca_topic_score_gemma":2.477592e-7,"teacher_disagreement_score":0.6366309,"about_ca_system_score_codex":0.0000321364,"about_ca_system_score_gemma":0.00004605997,"threshold_uncertainty_score":0.42382887},"labels":[],"label_agreement":null},{"id":"W1999696434","doi":"10.1016/j.tcs.2005.07.016","title":"A generalization of repetition threshold","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Repetition (rhetorical device); Generalization; Alphabet; Mathematics; Word (group theory); Combinatorics on words; Combinatorics; Discrete mathematics; Existential quantification; Arithmetic; Linguistics; Geometry; Mathematical analysis","score_opus":0.00790752423281006,"score_gpt":0.23576885501357725,"score_spread":0.2278613307807672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999696434","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.083721265,0.00003116095,0.91113544,0.0009426612,0.00021574335,0.000072780735,6.601902e-7,0.00015823451,0.0037220502],"genre_scores_gemma":[0.7939142,0.0000047942467,0.20543034,0.0005154708,0.00012164603,0.0000022127954,6.247009e-7,0.0000035994024,0.0000071149757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846476,0.00004453942,0.0002580424,0.0004259476,0.00051287556,0.00029386123],"domain_scores_gemma":[0.9988902,0.000064612665,0.000079437865,0.00070484023,0.00014625677,0.0001146571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870954,0.000103969986,0.00013491724,0.00015540613,0.00015427411,0.00014376495,0.0015520147,0.00003448339,0.00005583127],"category_scores_gemma":[0.00003139667,0.00008539558,0.00004870948,0.0008670666,0.0011889302,0.00081550353,0.0005219034,0.00007264252,0.000041326195],"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.000002042056,0.000041131017,0.000028910137,0.0000034375466,0.0000012073463,0.0000011879159,0.00020568629,0.00072730845,0.0048356466,0.95344484,0.000045682307,0.04066291],"study_design_scores_gemma":[0.00011167118,0.000073191986,0.00040428998,0.000018972234,0.0000017365433,0.000018891886,0.0000015972441,0.7647955,0.0430463,0.19128673,0.00013636387,0.00010480933],"about_ca_topic_score_codex":0.0000011657044,"about_ca_topic_score_gemma":2.6156115e-7,"teacher_disagreement_score":0.7640681,"about_ca_system_score_codex":0.000035184556,"about_ca_system_score_gemma":0.000058512647,"threshold_uncertainty_score":0.43806633},"labels":[],"label_agreement":null},{"id":"W2000192178","doi":"10.1016/s0304-3975(03)00224-x","title":"A classification of plane and planar 2-trees","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Molecular Sensors and Ion Detection","field":"Chemistry","cited_by":14,"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":"Planar; Plane (geometry); Mathematics; Planar graph; Combinatorics; Geometry; Computer science; Computer graphics (images); Graph","score_opus":0.009354177187862299,"score_gpt":0.22355881421962975,"score_spread":0.21420463703176745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000192178","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.90502757,0.000020437752,0.08128375,0.000048039456,0.0000438431,0.000018270493,0.0000012023022,0.000020096522,0.013536808],"genre_scores_gemma":[0.9955665,0.0000040237755,0.0043750955,0.00002262481,0.000015644584,6.931859e-7,5.0286855e-7,0.0000024848102,0.000012452264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994281,0.000016214319,0.00009689223,0.00017858704,0.0001727781,0.00010741649],"domain_scores_gemma":[0.9996877,0.00004180765,0.000030826242,0.00014177148,0.000034809484,0.00006308572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020920172,0.000048823036,0.000066088985,0.000035004858,0.00006864512,0.000025200361,0.000100262434,0.000028018272,0.00012513214],"category_scores_gemma":[0.000050190323,0.000039957544,0.000012846943,0.00012422336,0.0009199961,0.000039980663,0.000019132649,0.000052326068,0.0000039931024],"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.000006343708,0.00001497888,0.00024638287,0.00000815855,0.0000012136866,0.0000011026298,0.000046472043,0.0000030943906,0.28539842,0.7088277,0.0000068094214,0.0054393415],"study_design_scores_gemma":[0.00033520182,0.00012488753,0.0057134456,0.000040063387,0.000010124504,0.00009473153,0.000043987427,0.083730765,0.86699027,0.041957352,0.0007697704,0.00018941423],"about_ca_topic_score_codex":0.0000011698312,"about_ca_topic_score_gemma":2.8332153e-7,"teacher_disagreement_score":0.6668703,"about_ca_system_score_codex":0.000007558492,"about_ca_system_score_gemma":0.000014161762,"threshold_uncertainty_score":0.3389764},"labels":[],"label_agreement":null},{"id":"W2000194783","doi":"10.1016/j.tcs.2013.07.005","title":"Linear circuits, two-variable logic and weakly blocked monoids","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Predicate (mathematical logic); Closure (psychology); Discrete mathematics; Class (philosophy); Algebraic number; Predicate logic; First-order logic; Variable (mathematics); Expressive power; Predicate variable; Electronic circuit; Algorithm; Arithmetic; Computer science; Zeroth-order logic; Theoretical computer science; Multimodal logic; Programming language","score_opus":0.00827689966408616,"score_gpt":0.2272841832801425,"score_spread":0.21900728361605634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000194783","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.09775909,0.00007792944,0.8949532,0.0013944879,0.00045885664,0.00023628646,0.0000010002402,0.00038745953,0.0047317217],"genre_scores_gemma":[0.76682824,0.000005373187,0.23132396,0.0016534048,0.0001370759,0.000013383663,4.709509e-7,0.000008589596,0.000029515311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725693,0.00012341808,0.00031064192,0.0009470259,0.0005683284,0.00079367147],"domain_scores_gemma":[0.9979327,0.00032796335,0.00007170355,0.0010276396,0.00020047362,0.00043953335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013911698,0.00025096824,0.0002735731,0.00017479644,0.00047647828,0.00089309603,0.0025642097,0.00006802982,0.00017159928],"category_scores_gemma":[0.000090837835,0.00019470055,0.00004719376,0.0011237544,0.0025739009,0.0012210753,0.001684428,0.00024555175,0.00032391635],"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":[8.3130755e-7,0.000040138744,0.00003964911,0.000005751356,0.000003222221,0.000005595945,0.00016618363,0.00006914788,0.0050303116,0.94388366,0.000094162446,0.050661325],"study_design_scores_gemma":[0.00017130825,0.00010521989,0.00057884696,0.000016774236,0.0000026865812,0.000054480028,0.0000059053896,0.55054593,0.0019258679,0.44630742,0.00008502174,0.0002005043],"about_ca_topic_score_codex":0.000024907291,"about_ca_topic_score_gemma":1.5802742e-7,"teacher_disagreement_score":0.6690691,"about_ca_system_score_codex":0.00003762617,"about_ca_system_score_gemma":0.00010607939,"threshold_uncertainty_score":0.9483645},"labels":[],"label_agreement":null},{"id":"W2000480185","doi":"10.1016/j.tcs.2007.06.004","title":"Fibrations and universal view updatability","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Programming language; Algebra over a field; Pure mathematics","score_opus":0.007948658562605852,"score_gpt":0.25337003983349854,"score_spread":0.2454213812708927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000480185","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.014063328,0.000036600148,0.9825074,0.00053385115,0.00028463965,0.00011029617,0.0000042663055,0.00013984968,0.0023197806],"genre_scores_gemma":[0.6075927,0.000003915701,0.39216056,0.00018883141,0.000046031226,7.1065625e-7,8.9872776e-7,0.0000020756836,0.000004299429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847543,0.00004480142,0.00020403422,0.000544722,0.00034451007,0.00038647125],"domain_scores_gemma":[0.99863786,0.00023277463,0.00004051033,0.00072143105,0.00011085183,0.00025660536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017709804,0.00011236175,0.00013159867,0.00009732155,0.0004362813,0.00014184124,0.00073503604,0.000025369425,0.000017865439],"category_scores_gemma":[0.00006855031,0.00009039689,0.000022029952,0.00075241557,0.002513742,0.0015321544,0.0010427972,0.00010563399,0.000021205451],"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.000002124239,0.000013328867,0.000053638283,0.0000054161746,8.7102444e-7,0.000007267213,0.00020505596,0.0000063887073,0.00025273784,0.96048313,0.000012790713,0.03895723],"study_design_scores_gemma":[0.0008996634,0.0006603415,0.021575125,0.00014500151,0.0000133159265,0.00042314577,0.00018935995,0.48007688,0.014953281,0.44138712,0.03836034,0.0013164261],"about_ca_topic_score_codex":0.000005312727,"about_ca_topic_score_gemma":0.0000041163125,"teacher_disagreement_score":0.59352934,"about_ca_system_score_codex":0.000035291418,"about_ca_system_score_gemma":0.00007891795,"threshold_uncertainty_score":0.9261988},"labels":[],"label_agreement":null},{"id":"W2000645132","doi":"10.1016/j.tcs.2012.02.008","title":"Efficient generation of the ideals of a poset in gray code order, part II","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Squire; Partially ordered set; Gray code; Mathematics; Ideal (ethics); Code (set theory); Combinatorics; Order (exchange); Discrete mathematics; Amortized analysis; Algorithm; Computer science; Data structure; Set (abstract data type)","score_opus":0.049737963823437606,"score_gpt":0.326781192961203,"score_spread":0.2770432291377654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000645132","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.8668504,0.000018039,0.13187698,0.00034592682,0.00009388212,0.00018976147,0.0000062399595,0.000007919245,0.00061088824],"genre_scores_gemma":[0.9820776,9.0555517e-7,0.017805804,0.00006267065,0.00003671842,0.000008134946,4.5034642e-7,0.0000036839963,0.00000401146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989705,0.000106430925,0.00028429693,0.00012608684,0.0003128783,0.00019977063],"domain_scores_gemma":[0.99898124,0.00030675315,0.00010279891,0.00041225928,0.00014467124,0.000052280564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00133982,0.00006736287,0.00013857217,0.00005536919,0.00013879777,0.000009467773,0.0004653255,0.00002102491,0.000040476432],"category_scores_gemma":[0.00024832215,0.000041809064,0.000033014563,0.0007548062,0.0014282634,0.000042449617,0.0003594606,0.00007440005,0.0000026490138],"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.0000020941663,0.0001941951,0.00038009454,0.0000074410473,0.0000014695731,2.3490763e-8,0.0015109445,0.00015807692,0.005224909,0.991799,0.00005149927,0.00067025004],"study_design_scores_gemma":[0.00033393616,0.00013920128,0.011191587,0.000078427714,0.000019862082,0.000006009995,0.000052096464,0.22525693,0.09909551,0.66358143,0.00008128046,0.00016370672],"about_ca_topic_score_codex":0.0000024063777,"about_ca_topic_score_gemma":0.0000036780061,"teacher_disagreement_score":0.32821757,"about_ca_system_score_codex":0.00001997263,"about_ca_system_score_gemma":0.000047304104,"threshold_uncertainty_score":0.5262496},"labels":[],"label_agreement":null},{"id":"W2000777414","doi":"10.1016/s0304-3975(99)00020-1","title":"Efficient implementation of regular languages using reversed alternating finite automata","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"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":"Deterministic finite automaton; Finite-state machine; Nondeterministic finite automaton; Automaton; Computer science; Representation (politics); Regular language; Theoretical computer science; Quantum finite automata; Mathematics; Algorithm; Automata theory","score_opus":0.00972641191193077,"score_gpt":0.2902834371344849,"score_spread":0.28055702522255416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000777414","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.52428734,0.000014338095,0.47476283,0.000097683784,0.000108784465,0.000085615495,0.0000024691465,0.00011331745,0.0005276193],"genre_scores_gemma":[0.80864286,0.000001961565,0.19111615,0.00017169477,0.0000538724,0.0000015504335,8.0391044e-7,0.000006235053,0.000004858453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782544,0.00012256968,0.00036412533,0.0005369381,0.0007034539,0.0004474853],"domain_scores_gemma":[0.99865323,0.00020327859,0.000118873366,0.0007987797,0.00009573186,0.00013009139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543309,0.00015335351,0.00019793044,0.00016723784,0.00025602413,0.00019440602,0.0017795358,0.00003182861,0.00026105117],"category_scores_gemma":[0.000030877643,0.00013159902,0.000066424494,0.0009144523,0.0009902357,0.00030079685,0.0004953887,0.00009565095,0.000028733337],"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.0000046210316,0.000047827452,0.00005674055,0.000012372568,0.000005289167,0.000014803524,0.0009535726,0.014089417,0.0067924056,0.772479,0.0000071223226,0.20553681],"study_design_scores_gemma":[0.00030310772,0.00008568143,0.0009498731,0.000052219377,0.0000055083096,0.000027435603,0.000047207905,0.9624105,0.02307857,0.012862039,0.000015103577,0.00016272785],"about_ca_topic_score_codex":0.000032181026,"about_ca_topic_score_gemma":3.2426937e-7,"teacher_disagreement_score":0.9483211,"about_ca_system_score_codex":0.000052630407,"about_ca_system_score_gemma":0.000079828074,"threshold_uncertainty_score":0.53664523},"labels":[],"label_agreement":null},{"id":"W2001156795","doi":"10.1016/j.tcs.2009.07.007","title":"Optimal movement of mobile sensors for barrier coverage of a planar region","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Fence (mathematics); Polygon (computer graphics); Computer science; Wireless sensor network; Planar; Intrusion; Perimeter; Simple (philosophy); Simple polygon; Intrusion detection system; Computer network; Computer security; Mathematics; Regular polygon; Computer graphics (images)","score_opus":0.007139911694959688,"score_gpt":0.23106669296675808,"score_spread":0.22392678127179838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001156795","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.23359232,0.000024034189,0.7650498,0.00016503524,0.00022098416,0.00025921044,0.000002849309,0.000058094458,0.00062765856],"genre_scores_gemma":[0.77844596,0.0000073932756,0.2211869,0.00028717765,0.000050500465,0.000006096247,7.7104664e-7,0.000005303429,0.000009897572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975963,0.00007277842,0.0004762011,0.0006250772,0.00069947913,0.0005301608],"domain_scores_gemma":[0.998099,0.00032981066,0.00020074169,0.0008760727,0.00029898866,0.00019534123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610826,0.00018775201,0.0003479765,0.00020365813,0.00014944891,0.00007409166,0.0018218925,0.000068160734,0.0000055235414],"category_scores_gemma":[0.000050878803,0.00016037285,0.00012905097,0.00084347726,0.0013858003,0.00028211295,0.00024161045,0.00010990936,0.0000017638857],"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.000029860756,0.00011471199,0.00001321725,0.000009125775,0.0000039631504,0.000005430451,0.00039160912,0.20186846,0.0027391443,0.780858,0.000038097594,0.013928421],"study_design_scores_gemma":[0.00040004568,0.0012767554,0.00020968079,0.000057849564,0.0000057689126,0.000011876564,0.0000066311586,0.90834457,0.05383857,0.03559262,0.00006202395,0.00019358832],"about_ca_topic_score_codex":0.000001747362,"about_ca_topic_score_gemma":1.0564054e-7,"teacher_disagreement_score":0.7452653,"about_ca_system_score_codex":0.000044787434,"about_ca_system_score_gemma":0.00009113597,"threshold_uncertainty_score":0.65398145},"labels":[],"label_agreement":null},{"id":"W2001279658","doi":"10.1016/j.tcs.2006.02.003","title":"Synchronizing groups and automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Synchronizing; Mathematics; Combinatorics; Property (philosophy); Word (group theory); Permutation group; Discrete mathematics; Character (mathematics); Prime (order theory); Automaton; Cyclic permutation; Symmetric group; Computer science; Theoretical computer science; Topology (electrical circuits)","score_opus":0.004610918180651434,"score_gpt":0.20743109213955863,"score_spread":0.2028201739589072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001279658","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.14524841,0.00009315015,0.84830284,0.00085020764,0.0003581703,0.00008865991,7.877691e-7,0.00051882816,0.004538943],"genre_scores_gemma":[0.8525067,0.0000038535227,0.14690612,0.00040049912,0.00016322098,0.0000034465793,5.42331e-7,0.0000071949207,0.000008442998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775887,0.00007126134,0.0002463627,0.00076709554,0.0005456785,0.0006107295],"domain_scores_gemma":[0.9986297,0.00022716582,0.000056596506,0.0008279247,0.0000711271,0.00018752506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132196,0.00018817482,0.00018810642,0.00015912272,0.0004971663,0.00082470593,0.0019529847,0.00004665354,0.00002195587],"category_scores_gemma":[0.000029883638,0.00015362097,0.000040555296,0.00073300477,0.0025702438,0.0010126814,0.0015616057,0.00014380028,0.000070429174],"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.0000012719586,0.00003276433,0.00005379653,0.000005581176,0.0000012002713,0.000017663977,0.00008087698,0.000026445834,0.00086347666,0.95399153,0.000073714444,0.044851646],"study_design_scores_gemma":[0.00015745222,0.00006494814,0.0027658162,0.00001939424,0.0000020772213,0.00010772986,0.0000028030356,0.5767783,0.0016109874,0.41821113,0.00010195483,0.00017743422],"about_ca_topic_score_codex":0.000010477273,"about_ca_topic_score_gemma":4.5852718e-7,"teacher_disagreement_score":0.7072583,"about_ca_system_score_codex":0.000046543217,"about_ca_system_score_gemma":0.00006392507,"threshold_uncertainty_score":0.947017},"labels":[],"label_agreement":null},{"id":"W2001527002","doi":"10.1016/j.tcs.2014.09.018","title":"Using quantum key distribution for cryptographic purposes: A survey","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":218,"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é de Montréal; University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Quantum key distribution; Computer science; Cryptography; Key (lock); Cryptographic primitive; Computer security; Key exchange; Quantum cryptography; Context (archaeology); Cipher; Key distribution; Key management; Cryptographic protocol; Public-key cryptography; Encryption; Quantum; Quantum information; Physics","score_opus":0.020723023151779523,"score_gpt":0.27366366658569335,"score_spread":0.2529406434339138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001527002","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.14300875,0.000015632748,0.8551579,0.00032789857,0.0009242425,0.00024714295,0.000013807053,0.00024628855,0.000058320406],"genre_scores_gemma":[0.710078,8.2508865e-7,0.2894843,0.00022902444,0.00018670267,0.0000053470326,0.0000058842757,0.000009288538,6.277794e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967854,0.00032346477,0.0003598892,0.0009980482,0.00064752216,0.000885645],"domain_scores_gemma":[0.99730015,0.00092702813,0.0001237787,0.00092928443,0.00038913378,0.0003306552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004488801,0.0002652716,0.00030660568,0.00018994785,0.0009621693,0.00076135097,0.0026228286,0.00007507625,0.0000028777051],"category_scores_gemma":[0.00046463593,0.00021564378,0.00013593966,0.0017987742,0.0018551373,0.00039148683,0.0008618384,0.00022414495,0.000009749255],"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.000009268281,0.00004885462,0.00012615797,0.000010143748,0.0000039778383,0.0000010099985,0.0001199354,0.0037439358,0.00026102227,0.97051156,0.00002477846,0.025139386],"study_design_scores_gemma":[0.00022646718,0.00028190692,0.0032908146,0.00003112502,0.000004030207,0.00002713002,8.9495336e-7,0.78916436,0.00045414863,0.20602895,0.00023350044,0.00025664837],"about_ca_topic_score_codex":0.00001939057,"about_ca_topic_score_gemma":0.0000015969609,"teacher_disagreement_score":0.7854204,"about_ca_system_score_codex":0.000048266742,"about_ca_system_score_gemma":0.0001362219,"threshold_uncertainty_score":0.8793698},"labels":[],"label_agreement":null},{"id":"W2002077709","doi":"10.1016/j.tcs.2014.10.029","title":"Data gathering and personalized broadcasting in radio grids with interference","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Communication source; Broadcasting (networking); Computer network; Base station; Graph; Job shop scheduling; Schedule; Node (physics); Scheduling (production processes); Unicast; Distributed computing; Theoretical computer science; Mathematical optimization; Multicast; Mathematics; Routing (electronic design automation)","score_opus":0.018518143503911323,"score_gpt":0.2468621790266305,"score_spread":0.22834403552271917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002077709","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.06980253,0.00004199911,0.928132,0.00031506454,0.0001703465,0.00013004671,8.196074e-7,0.00011737811,0.0012898188],"genre_scores_gemma":[0.78332615,0.0000046603154,0.2163704,0.00021104183,0.00007200597,0.0000044361586,6.501167e-7,0.000007349188,0.0000033164988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737173,0.00016042743,0.0002467513,0.0011391873,0.00047567033,0.00060623896],"domain_scores_gemma":[0.99773175,0.0004538757,0.00006525739,0.0014438565,0.000066791355,0.00023849757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025095926,0.00019771917,0.00025056928,0.00013256485,0.00020374206,0.0005747569,0.003985455,0.000039432412,0.000012165033],"category_scores_gemma":[0.00011917507,0.00015084991,0.000013992109,0.0009640509,0.0026538332,0.0010920556,0.0032291731,0.00029497713,0.000008941717],"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.000011333629,0.000020697395,0.0006690989,0.000008726959,0.0000019692675,0.000012633377,0.0005541583,0.0003367991,0.00014325083,0.8779737,0.000007292397,0.12026034],"study_design_scores_gemma":[0.00037884203,0.00021221298,0.0018285973,0.00013967862,0.0000023734945,0.00012194475,0.000007605236,0.9812674,0.000110127025,0.015589179,0.00011689789,0.00022514835],"about_ca_topic_score_codex":0.000009294455,"about_ca_topic_score_gemma":0.000008436805,"teacher_disagreement_score":0.98093057,"about_ca_system_score_codex":0.000040242667,"about_ca_system_score_gemma":0.00007780794,"threshold_uncertainty_score":0.9778159},"labels":[],"label_agreement":null},{"id":"W2002992445","doi":"10.1016/s0304-3975(02)00830-7","title":"On the complexity of intersecting finite state automata and NL versus NP","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Mathematics; Complexity class; Deterministic finite automaton; DFA minimization; Intersection (aeronautics); Finite-state machine; Class (philosophy); Time complexity; Computational complexity theory; Discrete mathematics; Combinatorics; Algorithm; State (computer science); Automaton; Quantum finite automata; Automata theory; Computer science; Theoretical computer science","score_opus":0.035858908373254124,"score_gpt":0.26059878692361255,"score_spread":0.22473987855035843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002992445","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.2702046,0.000013983593,0.7234456,0.0009070452,0.0005843398,0.00011787973,0.000002391792,0.00012395911,0.0046001724],"genre_scores_gemma":[0.96464455,0.0000028278305,0.034745228,0.000579506,0.00001586408,0.0000025984475,1.6556993e-7,0.000005787923,0.0000034578077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798006,0.0002771975,0.00026230369,0.0005348028,0.000514342,0.00043129973],"domain_scores_gemma":[0.9967025,0.0020530396,0.00010459841,0.00090570736,0.00009089861,0.00014325354],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026428795,0.00016956046,0.00019536151,0.000114937466,0.0003900608,0.0002931934,0.0017896611,0.000026963811,0.000036969705],"category_scores_gemma":[0.00053218193,0.00010927771,0.00004948242,0.0007433394,0.0060136183,0.0003378205,0.0008279098,0.00020754909,0.000021897815],"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.000016811115,0.000036830166,0.0000075398893,0.0000051745096,0.000004779614,0.0000057942384,0.00070154323,0.00008295719,0.00017245032,0.9905265,0.00002501723,0.008414629],"study_design_scores_gemma":[0.00030499062,0.0002920545,0.00018548967,0.000030818086,0.0000024017934,0.000024095398,0.00002538639,0.40992242,0.00474859,0.58429986,0.00003453628,0.0001293915],"about_ca_topic_score_codex":0.000004150019,"about_ca_topic_score_gemma":6.9895464e-7,"teacher_disagreement_score":0.69443995,"about_ca_system_score_codex":0.000028249728,"about_ca_system_score_gemma":0.00006222613,"threshold_uncertainty_score":0.99669147},"labels":[],"label_agreement":null},{"id":"W2003402352","doi":"10.1016/s0304-3975(01)00216-x","title":"On a valuation of rational subsets of Zk Dédié à Jean Berstel","year":2003,"lang":"fr","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Valuation (finance); Polyhedron; Rational function; Mathematics; Generalization; Rational number; Mathematical economics; Discrete mathematics; Combinatorics; Pure mathematics; Economics; Mathematical analysis","score_opus":0.038948698092421186,"score_gpt":0.3125357313273392,"score_spread":0.273587033234918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003402352","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.13927117,0.00008677529,0.85163826,0.00043132072,0.0018260935,0.0004028754,0.000010407641,0.000025038715,0.006308095],"genre_scores_gemma":[0.7918233,0.0000056966283,0.20795645,0.000043696455,0.00006469705,0.0000041132835,9.382582e-7,0.00001727468,0.00008382602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648076,0.00038039082,0.0008168604,0.00041832024,0.001470072,0.0004335703],"domain_scores_gemma":[0.99431187,0.0037350997,0.0003286918,0.00073742104,0.0007063791,0.00018056597],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031716228,0.00024248738,0.0004869132,0.00018563074,0.00015050596,0.000042070675,0.0006790085,0.00011958116,0.0003991008],"category_scores_gemma":[0.0043353247,0.00022662837,0.00012504292,0.0009487269,0.004592055,0.0002614909,0.00017168408,0.00022696701,0.00006165247],"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.00002622095,0.0006666778,0.000007162811,0.00022228555,0.000015012668,0.0000022034035,0.0013412982,0.0015917158,0.0010556056,0.99331,0.000051655345,0.0017101627],"study_design_scores_gemma":[0.00051308685,0.00053168193,0.000012696258,0.00034210147,0.000046917256,0.000010559434,0.000035792098,0.11603654,0.037017856,0.8452542,0.00002563267,0.00017296732],"about_ca_topic_score_codex":0.0000012807005,"about_ca_topic_score_gemma":3.846472e-7,"teacher_disagreement_score":0.6525521,"about_ca_system_score_codex":0.00013626367,"about_ca_system_score_gemma":0.00032434103,"threshold_uncertainty_score":0.99811685},"labels":[],"label_agreement":null},{"id":"W2003635579","doi":"10.1016/j.tcs.2008.04.021","title":"Analysis of set-up time models: A metric perspective","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Academy of Finland","keywords":"Set (abstract data type); Perspective (graphical); Metric (unit); Mathematics; Algorithm; Computer science; Programming language; Operations management; Economics; Geometry","score_opus":0.019206459615165435,"score_gpt":0.2516292936870263,"score_spread":0.23242283407186087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003635579","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.32060304,0.00003240091,0.6579251,0.00017963699,0.00009616235,0.00008964437,0.0000021830447,0.00012856493,0.020943243],"genre_scores_gemma":[0.99571675,0.0000025513043,0.0036923387,0.00038909324,0.00013970087,0.0000022785853,0.0000026528755,0.0000096017,0.000045032106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981561,0.000030233252,0.00027634914,0.00053574063,0.0006503301,0.00035129965],"domain_scores_gemma":[0.9984295,0.00020693048,0.00017176986,0.00051877514,0.0006400574,0.00003301195],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001134037,0.00016106653,0.00042272228,0.0019628457,0.0003586688,0.00008371063,0.00091085304,0.000034450033,0.0003798113],"category_scores_gemma":[0.00028660524,0.00013428112,0.00022674496,0.012590626,0.002994062,0.0012465477,0.00053029787,0.00011437685,0.00013515432],"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.00002338287,0.00003352213,0.00013592423,0.0000041060953,0.00012211215,0.000006448371,0.00037037884,0.058148555,0.00009594121,0.94050974,0.000015831085,0.0005340836],"study_design_scores_gemma":[0.00009072639,0.000010955994,0.00026377902,0.0000048784373,0.00035674399,0.0000017754628,0.0000658847,0.75257623,0.00008757078,0.24639529,0.000013793532,0.0001323562],"about_ca_topic_score_codex":0.000042431227,"about_ca_topic_score_gemma":0.0000011306224,"teacher_disagreement_score":0.69442767,"about_ca_system_score_codex":0.00007017127,"about_ca_system_score_gemma":0.00003293186,"threshold_uncertainty_score":0.9997192},"labels":[],"label_agreement":null},{"id":"W2003815520","doi":"10.1016/j.tcs.2010.11.021","title":"On the size of inverse semigroups given by generators","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"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é de Sherbrooke","funders":"","keywords":"Injective function; Mathematics; Semigroup; Permutation (music); Discrete mathematics; Generator (circuit theory); Regular semigroup; Inverse; Property (philosophy); Domain (mathematical analysis); Combinatorics; Cancellative semigroup; Set (abstract data type); Pure mathematics; Special classes of semigroups; Mathematical analysis; Computer science; Geometry","score_opus":0.004691432277483324,"score_gpt":0.20709051736514558,"score_spread":0.20239908508766224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003815520","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.6266443,0.000007758659,0.36727703,0.0025504874,0.00084645895,0.0001377867,0.0000045289926,0.00013404276,0.0023976143],"genre_scores_gemma":[0.9589969,0.000001738955,0.038481843,0.002404311,0.00008842556,0.000005809656,3.2845531e-7,0.000008018404,0.00001264858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977881,0.00013333213,0.0002689477,0.0005901167,0.00074580545,0.00047373498],"domain_scores_gemma":[0.99669844,0.0014887983,0.00010439477,0.0013673536,0.0001239274,0.00021705849],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002149288,0.00019228585,0.00019591881,0.00007897108,0.00035739684,0.00025475115,0.0041157543,0.00006765518,0.00017963644],"category_scores_gemma":[0.0003630685,0.00011732909,0.00008385018,0.0009670739,0.003944068,0.0003708317,0.0009547878,0.00039151733,0.00007955735],"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.000003685282,0.000058458267,0.00002087599,0.000002280688,0.0000031096733,0.0000027195622,0.00027635213,0.000016703178,0.042560145,0.9482414,0.0023636366,0.006450637],"study_design_scores_gemma":[0.00019694373,0.00022753209,0.00025793325,0.000019788728,0.000003940789,0.000020065556,0.0000119181905,0.3309947,0.15876585,0.50877345,0.00047064116,0.00025725036],"about_ca_topic_score_codex":0.0000047485096,"about_ca_topic_score_gemma":8.3708414e-7,"teacher_disagreement_score":0.43946794,"about_ca_system_score_codex":0.00001866007,"about_ca_system_score_gemma":0.000090375535,"threshold_uncertainty_score":0.9987666},"labels":[],"label_agreement":null},{"id":"W2003841667","doi":"10.1016/j.tcs.2014.04.018","title":"Approximating the maximum multiple RNA interaction problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Zhejiang Normal University; Alberta Innovates - Technology Futures","keywords":"Pseudoknot; RNA; Maximization; Pairwise comparison; Time complexity; Mathematics; Constant (computer programming); Order (exchange); Computer science; Combinatorics; Mathematical optimization; Biology; Genetics; Gene","score_opus":0.00843803895061503,"score_gpt":0.23313491176058718,"score_spread":0.22469687280997214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003841667","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.14516564,0.000010261882,0.84317607,0.00032930385,0.00031648355,0.00018005449,5.151447e-7,0.00002285115,0.010798831],"genre_scores_gemma":[0.9372155,0.0000019862982,0.06200722,0.0004076531,0.00032269934,0.000015209821,0.0000015039536,0.0000074696745,0.000020765037],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989549,0.00012251132,0.00014621188,0.00032214852,0.0002041395,0.00025008796],"domain_scores_gemma":[0.9993303,0.00007506559,0.000055550776,0.00038017821,0.00008835003,0.00007058712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629787,0.00009690522,0.000077150435,0.00002182507,0.00029761478,0.00011413942,0.000572897,0.00004284054,0.000023888819],"category_scores_gemma":[0.00025473238,0.000060619604,0.000042584088,0.0001109988,0.00072385126,0.000008541054,0.000300549,0.00007958814,0.00006040265],"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.000026803757,0.000022831946,0.000023032606,0.0000074868,0.0000039669517,2.2324966e-7,0.00006228179,0.00010079674,0.6960597,0.19402744,0.00008045737,0.10958496],"study_design_scores_gemma":[0.00017130932,0.000365018,0.00005751321,0.000026310574,0.00000489228,0.000019457642,0.000015244037,0.13478611,0.8098492,0.049334873,0.0051890924,0.00018095302],"about_ca_topic_score_codex":0.000002002099,"about_ca_topic_score_gemma":4.360886e-7,"teacher_disagreement_score":0.7920499,"about_ca_system_score_codex":0.0000073341307,"about_ca_system_score_gemma":0.000020328613,"threshold_uncertainty_score":0.26670602},"labels":[],"label_agreement":null},{"id":"W2004373556","doi":"10.1016/s0304-3975(02)00648-5","title":"Rank inequalities and separation algorithms for packing designs and sparse triple systems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Division of Mathematical Sciences; University of Toronto","keywords":"Polytope; Mathematics; Combinatorics; Algorithm; Rank (graph theory); Discrete mathematics","score_opus":0.034358244664242595,"score_gpt":0.26517106086767717,"score_spread":0.23081281620343458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004373556","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.19870429,0.00032038998,0.79935324,0.000008958721,0.0005677652,0.0002558838,0.00000372489,0.00008890959,0.000696815],"genre_scores_gemma":[0.99341553,0.000010072108,0.0064520054,0.000017654382,0.0000626437,0.00002338926,7.2224054e-7,0.000009135974,0.000008826553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999113,0.000094791765,0.0001788895,0.0002128606,0.0001411624,0.00025925745],"domain_scores_gemma":[0.9994667,0.00022171617,0.00001909824,0.00013752014,0.00004539341,0.00010957019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015302037,0.00011300966,0.00016284152,0.00007918284,0.00020782964,0.0002223567,0.000109427725,0.000039908202,0.0000035098092],"category_scores_gemma":[0.000045334185,0.000095660216,0.00001887779,0.00018755674,0.0006680917,0.00020479326,0.000022123715,0.00005537345,0.0000017211376],"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.000005074545,0.000004041828,0.000036555615,0.00006347612,0.0000044459266,7.373146e-7,0.00065654237,0.0010189479,0.0009490505,0.9959105,0.000014816485,0.0013358098],"study_design_scores_gemma":[0.0004098377,0.0001238264,0.00007324787,0.000059799757,0.00001044257,0.000054962267,0.0001844431,0.8800475,0.0039923,0.11452641,0.00030431617,0.00021290443],"about_ca_topic_score_codex":0.0000010737084,"about_ca_topic_score_gemma":1.9464251e-7,"teacher_disagreement_score":0.8813841,"about_ca_system_score_codex":0.0000140140455,"about_ca_system_score_gemma":0.0000114913955,"threshold_uncertainty_score":0.39009106},"labels":[],"label_agreement":null},{"id":"W2005606079","doi":"10.1016/j.tcs.2013.03.014","title":"Fast balanced partitioning is hard even on grids and trees","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Grid; Partition (number theory); Time complexity; Limit (mathematics); Reduction (mathematics); Approximation algorithm; Maximum cut; Graph partition; Discrete mathematics; Running time; Graph; Mathematical optimization","score_opus":0.012910397604447118,"score_gpt":0.23486422708311516,"score_spread":0.22195382947866804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005606079","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.13696411,0.000019066485,0.8548797,0.004314432,0.0004668457,0.00016886351,0.0000018835385,0.0002025697,0.0029825547],"genre_scores_gemma":[0.87559956,0.0000055590517,0.12217816,0.002061414,0.00011242859,0.000014081428,4.047739e-7,0.0000048965753,0.000023469125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978642,0.00006753786,0.00021065059,0.00074868003,0.0005769995,0.0005319392],"domain_scores_gemma":[0.99863756,0.00021501083,0.0000475219,0.00068365445,0.00012845603,0.00028777518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005367853,0.00018034024,0.00018710908,0.00015727409,0.00057926663,0.0009220539,0.0015311061,0.00004019194,0.00013638729],"category_scores_gemma":[0.000039768278,0.00014583078,0.000053135787,0.00077613076,0.0023086898,0.0008689189,0.0008476937,0.00019683524,0.00020427439],"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.0000017306312,0.0000341466,0.00018515709,0.000002908472,0.000002679568,0.0000026601501,0.00043512136,0.000040212348,0.00029898525,0.9134709,0.00028401802,0.08524146],"study_design_scores_gemma":[0.00017412985,0.00024349095,0.024414254,0.00004272244,0.0000017689879,0.000020790872,0.000007503739,0.58119667,0.0021284714,0.3914375,0.00012196051,0.00021074027],"about_ca_topic_score_codex":0.000010107084,"about_ca_topic_score_gemma":5.677959e-7,"teacher_disagreement_score":0.7386355,"about_ca_system_score_codex":0.000026000476,"about_ca_system_score_gemma":0.00004116156,"threshold_uncertainty_score":0.8891387},"labels":[],"label_agreement":null},{"id":"W2005705791","doi":"10.1016/j.tcs.2011.08.030","title":"Minimizing total completion time for re-entrant flow shop scheduling problems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flow shop scheduling; Scheduling (production processes); Computer science; Completion (oil and gas wells); Mathematical optimization; Job shop scheduling; Mathematics; Schedule; Engineering; Mechanical engineering","score_opus":0.020333485618543153,"score_gpt":0.21991779575088086,"score_spread":0.1995843101323377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005705791","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.031849943,0.000027049668,0.9651317,0.000051730538,0.00058675103,0.00022451159,0.000004337168,0.00040840564,0.0017155897],"genre_scores_gemma":[0.45990214,0.0000016756271,0.5399347,0.000033769848,0.00009752034,0.000009149557,0.0000035967266,0.000013414799,0.0000040204145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987072,0.000020202819,0.00024257174,0.000333444,0.00026272793,0.00043389533],"domain_scores_gemma":[0.99934113,0.000093964874,0.000023542894,0.00024773483,0.00012375173,0.0001698813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007441142,0.00014955123,0.00017127447,0.000106304775,0.00022327332,0.00011562356,0.0003605871,0.000054017848,0.0001692289],"category_scores_gemma":[0.000051521576,0.00013632345,0.000059242244,0.00035224174,0.0005852935,0.00020371196,0.00007163557,0.00012095569,0.000066001885],"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.0000266523,0.00007052882,0.000021481274,0.000061150546,0.000017976141,0.000003088907,0.0026063954,0.8460669,0.0023899954,0.13102071,0.000034101453,0.017681021],"study_design_scores_gemma":[0.00025707384,0.00008228308,0.00007020563,0.000050895967,0.000008984632,0.000011671599,0.000015438074,0.9919069,0.003725517,0.003665416,0.000008280946,0.00019732553],"about_ca_topic_score_codex":5.0619565e-7,"about_ca_topic_score_gemma":7.929397e-8,"teacher_disagreement_score":0.4280522,"about_ca_system_score_codex":0.000040243514,"about_ca_system_score_gemma":0.000022862172,"threshold_uncertainty_score":0.5559109},"labels":[],"label_agreement":null},{"id":"W2005868985","doi":"10.1016/j.tcs.2010.10.007","title":"On the superimposition of Christoffel words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":29,"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":"Christoffel symbols; Superimposition; Mathematics; Conjecture; Root (linguistics); Existential quantification; Pure mathematics; Combinatorics; Arithmetic; Algebra over a field; Linguistics; Computer science; Artificial intelligence; Philosophy","score_opus":0.005362706332115055,"score_gpt":0.22263935071596114,"score_spread":0.21727664438384608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005868985","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.4485279,0.0000041298445,0.54589856,0.0015066917,0.00062329107,0.00008095845,8.784364e-7,0.00008562873,0.003271954],"genre_scores_gemma":[0.97013503,7.8968975e-7,0.028794372,0.0009692671,0.000087350345,0.0000046054297,2.3800254e-7,0.0000047708227,0.0000035916246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837476,0.000083284656,0.00019917102,0.0004115845,0.00059649715,0.00033469024],"domain_scores_gemma":[0.9979433,0.0006732836,0.000059854883,0.0011050372,0.000097070435,0.00012145232],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018705392,0.00012639698,0.0001337141,0.00010781582,0.00031993724,0.00021486139,0.003026662,0.000044547414,0.000104257255],"category_scores_gemma":[0.00012816525,0.00007500846,0.000064272295,0.0007850063,0.0032837654,0.000334767,0.00062211766,0.00030518268,0.0000617682],"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.0000041807243,0.000047402136,0.000007129623,0.0000017975018,0.000001349366,0.0000020115372,0.0003044369,0.000011902453,0.030010885,0.95538896,0.000057928177,0.014162039],"study_design_scores_gemma":[0.00009755454,0.00019038911,0.0008426981,0.000018357066,0.0000018803845,0.000027025519,0.0000058444343,0.2975677,0.07193111,0.6291378,0.000051887684,0.00012776213],"about_ca_topic_score_codex":0.000002387512,"about_ca_topic_score_gemma":2.5037727e-7,"teacher_disagreement_score":0.5216071,"about_ca_system_score_codex":0.000013099969,"about_ca_system_score_gemma":0.00006837448,"threshold_uncertainty_score":0.99942875},"labels":[],"label_agreement":null},{"id":"W2005930353","doi":"10.1016/j.tcs.2011.12.025","title":"Language theoretical properties of hairpin formations","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Variety (cybernetics); Class (philosophy); Regular language; Concatenation (mathematics); Closure (psychology); Aperiodic graph; Iterated function; Mathematics; Property (philosophy); Pumping lemma for regular languages; Discrete mathematics; Computer science; Combinatorics; Programming language; Second-generation programming language; Artificial intelligence; Fifth-generation programming language","score_opus":0.017979340750517714,"score_gpt":0.2343071813241843,"score_spread":0.21632784057366658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005930353","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.87358946,0.000056593617,0.11732742,0.000048574653,0.000093885326,0.00008625086,0.0000017560292,0.000021445401,0.008774648],"genre_scores_gemma":[0.98628646,0.0000033132123,0.0134187,0.00019553449,0.00008059067,0.000002728033,0.000002146105,0.0000043687687,0.0000061871406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990503,0.000059799906,0.00019144334,0.00026004238,0.00016828494,0.0002701017],"domain_scores_gemma":[0.99945045,0.000012672378,0.000043011423,0.000293721,0.00010368643,0.0000964377],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005434521,0.00009811951,0.00011288992,0.00003904589,0.00012083334,0.000021798993,0.0005653258,0.00005878997,0.00006828374],"category_scores_gemma":[0.00012140852,0.00006266913,0.000058622434,0.000172361,0.004187345,0.000007982567,0.00046584537,0.00007065735,0.000012358617],"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.00003442304,0.000059051283,0.00013888696,0.0000075130242,0.0000041441817,0.0000010002664,0.00039727226,0.0000033516926,0.25874954,0.73565567,0.000009680311,0.0049394793],"study_design_scores_gemma":[0.00016389857,0.0006367349,0.0013245958,0.00002866408,0.00000670164,0.000019930667,0.00007937831,0.008663603,0.9713982,0.017463954,0.000041494914,0.00017289772],"about_ca_topic_score_codex":0.0000019096994,"about_ca_topic_score_gemma":2.596659e-7,"teacher_disagreement_score":0.7181917,"about_ca_system_score_codex":0.000004598576,"about_ca_system_score_gemma":0.000038895872,"threshold_uncertainty_score":0.9985227},"labels":[],"label_agreement":null},{"id":"W2006059832","doi":"10.1016/j.tcs.2005.10.041","title":"The binomial transform and the analysis of skip lists","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Forming Technologies (Canada); University of Waterloo","funders":"","keywords":"Binomial (polynomial); Mathematics; Statistics; Computer science","score_opus":0.011181619839523616,"score_gpt":0.2941506066586219,"score_spread":0.2829689868190983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006059832","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.2609854,0.00007139587,0.7296157,0.0039311447,0.00029964294,0.00042736597,0.0000028037584,0.0000619148,0.0046046656],"genre_scores_gemma":[0.9594739,0.000014381293,0.040330663,0.00006629428,0.00008850214,0.000006441301,9.85858e-8,0.0000063475445,0.000013333441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985394,0.00009154339,0.0003674507,0.0002129864,0.00050793606,0.00028071902],"domain_scores_gemma":[0.9956829,0.0034391822,0.000109626446,0.0005612041,0.00012514651,0.00008196984],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025326912,0.00011797175,0.00031451066,0.00008937758,0.00040737464,0.00010707257,0.000891613,0.00003162835,0.000013954014],"category_scores_gemma":[0.0005267928,0.000055688324,0.00011461983,0.0010412255,0.007228297,0.00012353783,0.0002262007,0.00013543614,0.0000028595086],"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.00003660843,0.000030502451,0.000002909711,0.0000063093803,0.000043247313,2.2931182e-7,0.0010836377,0.000053644468,0.000024990679,0.9793605,0.00000994414,0.01934743],"study_design_scores_gemma":[0.00037756102,0.00002830948,0.000047027606,0.000007330429,0.00015981562,0.0000029931296,0.000020517153,0.21807821,0.00090626604,0.7802277,0.00008059645,0.000063632426],"about_ca_topic_score_codex":0.0000010284884,"about_ca_topic_score_gemma":0.0000040017817,"teacher_disagreement_score":0.69848853,"about_ca_system_score_codex":0.00003070903,"about_ca_system_score_gemma":0.00003584017,"threshold_uncertainty_score":0.99547344},"labels":[],"label_agreement":null},{"id":"W2006144017","doi":"10.1016/j.tcs.2015.02.032","title":"Spread of influence in weighted networks under time and budget constraints","year":2015,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Bounded function; Time complexity; Set (abstract data type); Simple (philosophy); Combinatorics; Graph; Mathematics; Polynomial; Computer science; Discrete mathematics","score_opus":0.008156097673453464,"score_gpt":0.26168961917936084,"score_spread":0.25353352150590736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006144017","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.4819279,0.000047823425,0.5141884,0.000093707764,0.000079249054,0.00024283142,0.000015735386,0.00004886578,0.0033554824],"genre_scores_gemma":[0.9819812,0.0000029451026,0.01781466,0.000047989404,0.00011569306,0.000007781485,0.000015058095,0.000010280663,0.0000043547093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798095,0.00013768586,0.00044869792,0.0006577671,0.00037705107,0.00039783327],"domain_scores_gemma":[0.9985251,0.00018064704,0.00018803128,0.00061653554,0.00029588904,0.00019383786],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013025725,0.00025768185,0.00053769036,0.00021123527,0.000058363017,0.00013993683,0.00095155,0.00009564244,0.00016020809],"category_scores_gemma":[0.000010490762,0.00022965622,0.00007363308,0.00054408,0.006058985,0.000108548134,0.0023841558,0.0005234102,0.0000060779207],"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.000013069199,0.00009254682,0.0039573447,0.000010844501,0.000028664463,0.0000024730036,0.00013762566,0.01844968,0.00007823293,0.9563364,0.00011645373,0.02077669],"study_design_scores_gemma":[0.000102667356,0.000029230256,0.0019031231,0.00013646398,0.000015995673,0.0000010130382,0.0000031310244,0.55340147,0.00016145213,0.44406804,0.000003909816,0.000173478],"about_ca_topic_score_codex":0.00005365295,"about_ca_topic_score_gemma":0.0000013112133,"teacher_disagreement_score":0.5349518,"about_ca_system_score_codex":0.000045916007,"about_ca_system_score_gemma":0.00020538123,"threshold_uncertainty_score":0.9966459},"labels":[],"label_agreement":null},{"id":"W2006186391","doi":"10.1016/j.tcs.2015.01.028","title":"Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Mathematics; Combinatorics; Injective function; Bijection; Treewidth; Homomorphism; Bounded function; Surjective function; Discrete mathematics; Algebra homomorphism; Graph; Tree-depth; 1-planar graph; Pathwidth; Chordal graph; Line graph","score_opus":0.04165431843452008,"score_gpt":0.29213325162119763,"score_spread":0.2504789331866776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006186391","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.12603344,0.000054054362,0.8649451,0.00066548225,0.00030144153,0.0002911021,0.000004025848,0.00016185237,0.0075435103],"genre_scores_gemma":[0.82228523,0.000004651992,0.17732881,0.0003267624,0.000026066054,0.000006790611,5.9639035e-7,0.000010267045,0.000010826515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960337,0.00027081757,0.00040964005,0.0009694256,0.0014911777,0.00082519563],"domain_scores_gemma":[0.9966943,0.0006127141,0.0001222598,0.0012285444,0.000535863,0.00080630323],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030323048,0.00028086445,0.0003986757,0.00050933793,0.0003308593,0.00039044983,0.0028798725,0.00007976991,0.000012815626],"category_scores_gemma":[0.00036383994,0.00022734603,0.000079364065,0.002011581,0.015195701,0.00071078545,0.0012548373,0.00032469834,0.00002707071],"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.00007719032,0.00010267759,0.0000670779,0.000007649185,0.0000075493217,0.000031131465,0.00032328753,0.000038531598,0.0004666701,0.9574565,0.00001780289,0.041403886],"study_design_scores_gemma":[0.0009072736,0.0012954077,0.00042859465,0.000041040435,0.000004077231,0.00008867238,0.00001861994,0.1078811,0.005694723,0.88335156,0.000036659523,0.00025224243],"about_ca_topic_score_codex":0.0000042910247,"about_ca_topic_score_gemma":0.00000152785,"teacher_disagreement_score":0.6962518,"about_ca_system_score_codex":0.00007516656,"about_ca_system_score_gemma":0.0004706663,"threshold_uncertainty_score":0.9874844},"labels":[],"label_agreement":null},{"id":"W2007240595","doi":"10.1016/j.tcs.2012.08.011","title":"Compressed indexes for text with wildcards","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed suffix array; Search engine indexing; Computer science; Suffix array; Theoretical computer science; Suffix; Word (group theory); Algorithm; Combinatorics; Data structure; Mathematics; Pattern matching; String searching algorithm; Information retrieval; Artificial intelligence","score_opus":0.010163152623136596,"score_gpt":0.25236240226923884,"score_spread":0.24219924964610223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007240595","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.009854037,0.00006644435,0.98723537,0.00044094707,0.00064895075,0.00028910543,0.0000063700786,0.00021832109,0.0012404636],"genre_scores_gemma":[0.62140197,0.0000013335537,0.3779709,0.00037382756,0.00021990063,0.000016855716,0.0000017195905,0.000007102764,0.0000063722036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975339,0.000055722325,0.00020806053,0.00059157994,0.0007315633,0.0008791747],"domain_scores_gemma":[0.99797684,0.00030642812,0.0000727201,0.0009948194,0.00020477509,0.00044440763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011440688,0.0002108105,0.0002276184,0.000137057,0.0005581422,0.00044900944,0.002529459,0.00005134037,0.000018850564],"category_scores_gemma":[0.000037669033,0.00013970437,0.000053829495,0.0007482215,0.0016919554,0.0018809971,0.0011519783,0.00014829608,0.000033730466],"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.000016874821,0.00009108229,0.00029049302,0.000007289939,0.000004368313,0.0000012832046,0.0002904381,0.000078248486,0.0002914149,0.9523507,0.0002938984,0.046283912],"study_design_scores_gemma":[0.00093658257,0.00063456164,0.0067555737,0.0000779036,0.000013196435,0.000092159746,0.000010074696,0.92548895,0.00975608,0.049903154,0.0057056095,0.0006261624],"about_ca_topic_score_codex":0.0000031150141,"about_ca_topic_score_gemma":1.669605e-7,"teacher_disagreement_score":0.9254107,"about_ca_system_score_codex":0.000038292168,"about_ca_system_score_gemma":0.00010380615,"threshold_uncertainty_score":0.623408},"labels":[],"label_agreement":null},{"id":"W2007245320","doi":"10.1016/j.tcs.2009.02.022","title":"On the intersection of regex languages with regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Regular language; Computer science; Regular expression; Intersection (aeronautics); Closure (psychology); Programming language; Pushdown automaton; Automaton; Language family; Semantics (computer science); Formal language; Nondeterministic finite automaton; Theoretical computer science; Class (philosophy); Discrete mathematics; Mathematics; Automata theory; Artificial intelligence; Linguistics","score_opus":0.004291568309149471,"score_gpt":0.2292128165166391,"score_spread":0.22492124820748963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007245320","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.2903946,0.000023990086,0.69850224,0.0024837826,0.00008614163,0.000103174985,5.6651055e-7,0.00014244916,0.008263047],"genre_scores_gemma":[0.9749957,9.1548077e-7,0.023610704,0.0013185396,0.0000532797,0.0000018757117,2.5433113e-7,0.0000038114465,0.000014964651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853003,0.000103086524,0.0001530087,0.00039671233,0.0005264116,0.00029074322],"domain_scores_gemma":[0.99854815,0.00031881657,0.00007465856,0.00089313637,0.00008606922,0.00007916055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010755634,0.00013139888,0.00014342686,0.00009265732,0.00018795163,0.00016705101,0.0018227744,0.000028867287,0.000026898471],"category_scores_gemma":[0.00007044591,0.0000693393,0.000044111788,0.00077605416,0.0013789551,0.00029044718,0.00021218321,0.00014588443,0.000016909124],"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.000012823648,0.00004092035,0.000004568702,0.000001926555,0.0000025499826,0.000010495295,0.0005116352,0.000054959935,0.0021001538,0.9587446,0.00007664695,0.038438756],"study_design_scores_gemma":[0.00030880395,0.0018574961,0.0032624989,0.00019375206,0.000007842901,0.00011741013,0.00021879771,0.19336368,0.1011025,0.6992236,0.00003724911,0.0003063716],"about_ca_topic_score_codex":0.0000028196632,"about_ca_topic_score_gemma":3.3987558e-7,"teacher_disagreement_score":0.68460107,"about_ca_system_score_codex":0.000029736917,"about_ca_system_score_gemma":0.000041841133,"threshold_uncertainty_score":0.50808173},"labels":[],"label_agreement":null},{"id":"W2007361403","doi":"10.1016/j.tcs.2007.04.037","title":"Every real number greater than 1 is a critical exponent","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Mathematics; Combinatorics; Critical exponent; Discrete mathematics; Geometry; Scaling; Philosophy","score_opus":0.012511110645053121,"score_gpt":0.2786504745501137,"score_spread":0.2661393639050606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007361403","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.18273671,0.000009639105,0.7973473,0.0015143325,0.0008613186,0.000104882245,0.0000019152055,0.00038129615,0.01704258],"genre_scores_gemma":[0.880001,0.0000034639768,0.1172799,0.00236725,0.0002950034,0.0000041029343,4.301428e-7,0.000013234207,0.000035595935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995895,0.000105280444,0.0004359233,0.0011281176,0.0011734071,0.0012622165],"domain_scores_gemma":[0.9971552,0.00062399346,0.000056184836,0.0013404224,0.00021317163,0.00061104784],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0032808469,0.0002943118,0.0002828076,0.00018720538,0.0004991926,0.00064831594,0.0031096272,0.000102504564,0.00030998746],"category_scores_gemma":[0.00009509546,0.00023192892,0.00013553775,0.0011095507,0.0036719115,0.0010817844,0.0016947606,0.00027847328,0.0007142538],"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.000015517719,0.00007736812,0.0005875517,0.000006477015,0.0000040084233,0.00010473183,0.00087428914,0.000001425133,0.00059037464,0.9790004,0.00027035846,0.018467536],"study_design_scores_gemma":[0.00054503506,0.000365234,0.029857185,0.00010919256,0.00001541215,0.000591277,0.00006251618,0.20208448,0.039771456,0.725109,0.0004558741,0.0010333336],"about_ca_topic_score_codex":0.000014356688,"about_ca_topic_score_gemma":5.674798e-7,"teacher_disagreement_score":0.6972643,"about_ca_system_score_codex":0.000099840385,"about_ca_system_score_gemma":0.00010963538,"threshold_uncertainty_score":0.99903953},"labels":[],"label_agreement":null},{"id":"W2007370828","doi":"10.1016/s0304-3975(02)00326-2","title":"Alternating and empty alternating auxiliary stack automata","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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é de Montréal","funders":"","keywords":"Stack (abstract data type); PSPACE; Automaton; Polynomial hierarchy; Bounded function; Hierarchy; Constant (computer programming); Mathematics; Combinatorics; Discrete mathematics; Time complexity; Computer science; Theoretical computer science; Computational complexity theory; Algorithm; Programming language","score_opus":0.00864102512398008,"score_gpt":0.24640921420933193,"score_spread":0.23776818908535186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007370828","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.31863117,0.000051930325,0.673343,0.00033173178,0.0005720442,0.00010694755,0.0000012621427,0.0003551429,0.0066067516],"genre_scores_gemma":[0.7695608,0.000008334824,0.22968616,0.0006400176,0.00007836566,0.0000036664644,2.754105e-7,0.000010609234,0.0000117453565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680334,0.00021474886,0.00037187306,0.001022373,0.00080431555,0.00078334],"domain_scores_gemma":[0.9979049,0.00045043224,0.00011771453,0.0010244914,0.00013298531,0.00036950785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030691314,0.0002592708,0.0002520857,0.00018273044,0.00062779355,0.0009725239,0.0023554729,0.000051778414,0.00004491611],"category_scores_gemma":[0.00031254298,0.00021773187,0.000055615277,0.00073687395,0.0017974849,0.0012288082,0.0014277615,0.00025667337,0.00006192466],"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.0000014482187,0.00003601172,0.00024664498,0.000007746173,0.0000040873965,0.000024155743,0.0003547943,0.0000657774,0.00089677545,0.9471145,0.000014970853,0.051233042],"study_design_scores_gemma":[0.00028103075,0.00009961783,0.0011279417,0.00004284066,0.000003099151,0.00015894762,0.000015495469,0.66217756,0.0066407025,0.32905045,0.00012123761,0.00028110627],"about_ca_topic_score_codex":0.000008550457,"about_ca_topic_score_gemma":3.1159982e-7,"teacher_disagreement_score":0.66211176,"about_ca_system_score_codex":0.000055413544,"about_ca_system_score_gemma":0.00013495961,"threshold_uncertainty_score":0.937807},"labels":[],"label_agreement":null},{"id":"W2007760711","doi":"10.1016/j.tcs.2012.03.039","title":"Computing majority with triple queries","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics; Algebra over a field; Programming language; Pure mathematics","score_opus":0.009783002692198995,"score_gpt":0.23614565000176804,"score_spread":0.22636264730956904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007760711","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.03934047,0.000043165062,0.9495192,0.00031455152,0.002107925,0.00013852167,4.2782096e-7,0.00027836728,0.008257363],"genre_scores_gemma":[0.8328283,5.843762e-7,0.16620207,0.000429752,0.000509207,0.000003066876,2.5939957e-7,0.0000062986624,0.000020516514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976408,0.00013901228,0.0002652609,0.00047888572,0.0006251077,0.00085093826],"domain_scores_gemma":[0.99850124,0.00017348389,0.00008233516,0.0006794509,0.00020703897,0.00035642376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021559559,0.00018343395,0.00022485592,0.00012815972,0.0006318884,0.00052362465,0.001524851,0.000047166723,0.00003202104],"category_scores_gemma":[0.000034688113,0.0001278208,0.000046044195,0.0012409716,0.0014961652,0.001325051,0.00067701837,0.00020848023,0.00007309689],"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.0000061865385,0.000043760756,0.0009765665,0.000005350221,0.000003856386,0.0000024291887,0.0007540183,0.00011944955,0.000057782672,0.9892471,0.0001045199,0.008679009],"study_design_scores_gemma":[0.00044477973,0.00043994465,0.005015957,0.000087813685,0.000006542292,0.00044112152,0.000054585747,0.9647613,0.00193462,0.023724534,0.0025288775,0.0005599248],"about_ca_topic_score_codex":0.000009891728,"about_ca_topic_score_gemma":9.871058e-7,"teacher_disagreement_score":0.9655225,"about_ca_system_score_codex":0.000066694556,"about_ca_system_score_gemma":0.00008446854,"threshold_uncertainty_score":0.5512683},"labels":[],"label_agreement":null},{"id":"W2009450360","doi":"10.1016/j.tcs.2010.07.004","title":"Parameterized pursuit-evasion games","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Pursuit-evasion; Computer science; Evasion (ethics); Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Biology; Genetics","score_opus":0.018033996881260575,"score_gpt":0.2857333243694043,"score_spread":0.26769932748814373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009450360","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.22185048,0.0000071503428,0.77054906,0.0017543735,0.0023389054,0.00016559538,5.9476776e-7,0.00038784533,0.0029460064],"genre_scores_gemma":[0.6986277,0.0000021550911,0.30055732,0.0006084262,0.00017241226,0.000008699515,2.3672357e-7,0.0000077708855,0.000015254064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965655,0.000094508476,0.00038511405,0.0010120509,0.0011113037,0.0008314849],"domain_scores_gemma":[0.99708015,0.00048612204,0.00009386421,0.0016276102,0.00027726145,0.00043501577],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021919694,0.00024230842,0.00025044667,0.00024365673,0.0005019258,0.0011863266,0.005822652,0.000100746554,0.00018967659],"category_scores_gemma":[0.00047080175,0.00019318472,0.000103382976,0.0013407129,0.005363877,0.0011787362,0.0018942392,0.0005090376,0.00059957185],"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.000004628898,0.000045409553,0.000049787523,0.0000017603047,0.0000015399995,0.000010312044,0.00027557547,0.000020116562,0.037994288,0.80624646,0.000055237364,0.15529488],"study_design_scores_gemma":[0.00007828381,0.00017270213,0.00063354516,0.000012672818,0.0000030068738,0.00006639003,0.0000062328795,0.4779967,0.12943663,0.39026636,0.0010199798,0.00030750417],"about_ca_topic_score_codex":0.000005892052,"about_ca_topic_score_gemma":0.0000022639124,"teacher_disagreement_score":0.4779766,"about_ca_system_score_codex":0.000031344523,"about_ca_system_score_gemma":0.00016845009,"threshold_uncertainty_score":0.9998505},"labels":[],"label_agreement":null},{"id":"W2009536531","doi":"10.1016/j.tcs.2005.09.021","title":"LA, permutations, and the Hajós Calculus","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Calculus (dental); Mathematics; Combinatorics; Computer science; Discrete mathematics; Medicine","score_opus":0.008720736149654174,"score_gpt":0.28047096780701675,"score_spread":0.27175023165736256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009536531","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.014391091,0.00007326491,0.9751768,0.0044004465,0.0001913707,0.00013711823,3.715823e-7,0.00011971149,0.0055098366],"genre_scores_gemma":[0.57558626,0.000005358462,0.42371333,0.0006209062,0.000056483277,0.000006847141,7.165441e-8,0.000002214811,0.000008542785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828696,0.0003616984,0.00019648636,0.0004104834,0.0004516297,0.00029275086],"domain_scores_gemma":[0.99854535,0.0005235655,0.000049714985,0.0006526751,0.00010296269,0.00012570739],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004241401,0.000104746665,0.000116140305,0.000084061576,0.0004978755,0.00052414305,0.0017170941,0.000036334222,0.000011132466],"category_scores_gemma":[0.00027196028,0.00006462453,0.000030085033,0.0006215861,0.006578747,0.00080025883,0.0007192545,0.00018728034,0.000058701862],"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.0000044167637,0.000010185577,0.0000042558568,0.0000013290615,9.971358e-7,7.4628895e-7,0.001283264,0.000102582206,0.000034070596,0.81865853,0.000010776867,0.17988886],"study_design_scores_gemma":[0.00031547266,0.000028166098,0.0006969425,0.000005712523,0.0000028924683,0.00008836348,0.000013177445,0.882179,0.001089237,0.11491158,0.00057266647,0.000096753625],"about_ca_topic_score_codex":0.0000024615233,"about_ca_topic_score_gemma":3.5813838e-7,"teacher_disagreement_score":0.88207644,"about_ca_system_score_codex":0.000038795788,"about_ca_system_score_gemma":0.00006593606,"threshold_uncertainty_score":0.9961248},"labels":[],"label_agreement":null},{"id":"W2009538436","doi":"10.1016/j.tcs.2008.12.046","title":"Parallelizing quantum circuits","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":118,"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é de Montréal; Computer Research Institute of Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Rewriting; Computer science; Logarithm; Qubit; Electronic circuit; Polynomial; Quantum circuit; Quantum; Quantum computer; Constant (computer programming); Quantum algorithm; Algorithm; Translation (biology); Theoretical computer science; Mathematics; Quantum error correction; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.009636575686006338,"score_gpt":0.24534133830624205,"score_spread":0.2357047626202357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009538436","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.053939268,0.000056778175,0.93794644,0.0037717668,0.0007071348,0.00011357707,3.7479265e-7,0.0005709768,0.0028936737],"genre_scores_gemma":[0.8467134,0.0000029188973,0.15103543,0.001997127,0.00023977665,0.000001167706,2.8446755e-7,0.0000054310262,0.000004431004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969219,0.00009296808,0.00030865226,0.00094131066,0.0008306124,0.000904567],"domain_scores_gemma":[0.99819547,0.00016614776,0.00007477978,0.0010326912,0.00014535544,0.0003855341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012518443,0.0002447856,0.00024838044,0.00023748663,0.00068948214,0.0007272599,0.0035802566,0.000056051595,0.000013215638],"category_scores_gemma":[0.00007299381,0.00019590514,0.000097613774,0.0015210888,0.0011088668,0.00054493075,0.00065753126,0.0003328776,0.00009409816],"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":[9.2597384e-7,0.000038411337,0.0000056818017,0.000001459553,0.0000012470529,0.000022480428,0.0002696155,0.0011259395,0.00056131155,0.755514,0.00004035947,0.24241856],"study_design_scores_gemma":[0.00012519209,0.00024838795,0.0014375504,0.000023246617,0.0000014321683,0.000091259855,0.0000014289471,0.688265,0.0007938901,0.30863032,0.00016518647,0.00021708308],"about_ca_topic_score_codex":0.0000013468267,"about_ca_topic_score_gemma":6.1809686e-8,"teacher_disagreement_score":0.7927742,"about_ca_system_score_codex":0.000042146537,"about_ca_system_score_gemma":0.00012773258,"threshold_uncertainty_score":0.798878},"labels":[],"label_agreement":null},{"id":"W2009831508","doi":"10.1016/j.tcs.2013.03.016","title":"Complexity of Canadian traveler problem variants","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"PSPACE; Combinatorics; Mathematics; Time complexity; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics; Path (computing); Travelling salesman problem; Computational complexity theory; Computer science; Algorithm","score_opus":0.03185590816938742,"score_gpt":0.24652722804301677,"score_spread":0.21467131987362936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009831508","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.0035486452,0.0000046135456,0.9497665,0.0044159926,0.00017921474,0.00035836716,0.0000021088315,0.00008318095,0.04164134],"genre_scores_gemma":[0.61816,0.0000022151448,0.38133958,0.0004530946,0.000016677035,0.000006632292,5.2948235e-7,0.0000034720767,0.000017814691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785,0.00010282151,0.00029759915,0.00048393442,0.0005969263,0.0006687256],"domain_scores_gemma":[0.99807024,0.000057277706,0.000058206035,0.0006580012,0.00048443052,0.00067184493],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009900628,0.00013110893,0.00018227435,0.0006548804,0.00029708378,0.0003936777,0.002459718,0.000045626453,0.00051818544],"category_scores_gemma":[0.000041646897,0.00010671369,0.000042360953,0.00260386,0.0033351649,0.0008976835,0.0004819477,0.00015258115,0.00022767246],"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":[5.225366e-7,0.000031085372,0.000038545506,0.0000056235276,0.0000016580385,0.0000015972585,0.00038694486,0.00023700354,0.00037943228,0.9863102,0.00022974906,0.012377671],"study_design_scores_gemma":[0.0001348214,0.00009925495,0.004468463,0.00001433136,8.756578e-7,0.000011312346,0.0000038268804,0.68195295,0.000790429,0.31226006,0.00012789688,0.00013578088],"about_ca_topic_score_codex":0.0046743983,"about_ca_topic_score_gemma":0.00027227085,"teacher_disagreement_score":0.68171597,"about_ca_system_score_codex":0.000051832103,"about_ca_system_score_gemma":0.00044587036,"threshold_uncertainty_score":0.9993772},"labels":[],"label_agreement":null},{"id":"W2010017329","doi":"10.1016/j.tcs.2005.01.001","title":"Gathering of asynchronous robots with limited visibility","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":396,"is_retracted":false,"has_abstract":false,"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":"Visibility; Asynchronous communication; Robot; Computer science; Orientation (vector space); Mobile robot; Convergence (economics); Computation; Protocol (science); Point (geometry); Artificial intelligence; Distributed computing; Computer vision; Theoretical computer science; Algorithm; Mathematics; Telecommunications; Geography; Geometry","score_opus":0.01010129519343213,"score_gpt":0.24813068238141042,"score_spread":0.23802938718797828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010017329","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.037037574,0.000012574815,0.95800066,0.0010044976,0.000066601504,0.00015950821,4.0994328e-7,0.00014866739,0.0035694942],"genre_scores_gemma":[0.5803678,0.0000018782273,0.41943055,0.00016523789,0.000025262338,0.00000200388,1.5047432e-7,0.0000033921035,0.0000036867707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980201,0.0000830149,0.00025583952,0.0005420213,0.00066440617,0.00043461728],"domain_scores_gemma":[0.9984664,0.00013546908,0.000069491296,0.00080266624,0.0002954756,0.00023052347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011903004,0.0001293612,0.00017805405,0.00014492679,0.00018886666,0.00020465448,0.001747823,0.000031725773,0.00005641976],"category_scores_gemma":[0.000047061858,0.00009395608,0.000036501013,0.0012177263,0.002004258,0.00077133084,0.000617594,0.00013908764,0.000030566276],"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.000008432415,0.00010533006,0.00015289013,0.0000076153724,0.000003059466,0.0000021875617,0.0005332333,0.04179953,0.000566356,0.88952476,0.00000439432,0.067292206],"study_design_scores_gemma":[0.00025286962,0.00032837223,0.0012848079,0.000027773129,0.0000016135751,0.000017709772,0.0000030583171,0.981804,0.0070037246,0.009098463,0.000035346948,0.00014227067],"about_ca_topic_score_codex":0.0000021720211,"about_ca_topic_score_gemma":0.0000011625493,"teacher_disagreement_score":0.94000447,"about_ca_system_score_codex":0.00005692165,"about_ca_system_score_gemma":0.00016275415,"threshold_uncertainty_score":0.7384773},"labels":[],"label_agreement":null},{"id":"W2010156088","doi":"10.1016/j.tcs.2012.02.032","title":"Exhaustive generation of gominoes","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"","keywords":"Polyomino; Inscribed figure; Rectangle; Combinatorics; Mathematics; Variation (astronomy); Perimeter; Discrete mathematics; Algorithm; Geometry","score_opus":0.065314358300083,"score_gpt":0.33972747087065164,"score_spread":0.27441311257056866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010156088","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.36165243,0.000010944044,0.6352331,0.00003153756,0.00062624924,0.00011251799,6.9850057e-7,0.000042205607,0.0022902968],"genre_scores_gemma":[0.73677224,6.411667e-7,0.26292557,0.00001947452,0.00026580275,0.0000033107779,1.786402e-7,0.0000068863055,0.0000059196873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987683,0.000036272973,0.00025652387,0.00016439192,0.00044373467,0.00033075578],"domain_scores_gemma":[0.9988428,0.00037299513,0.00010564607,0.00036650727,0.00017420143,0.00013788328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541487,0.00010512927,0.00018951886,0.00006981105,0.00010762729,0.000022685428,0.00040001178,0.000035900233,0.000055099375],"category_scores_gemma":[0.0004631158,0.000081699436,0.000037171973,0.00034828216,0.0014752621,0.00032402863,0.00024164036,0.00008310493,0.000020671356],"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.0000032280468,0.0001092365,0.000049529543,0.000017051256,0.0000025576805,2.3994934e-7,0.0007057447,0.0000057887723,0.004231467,0.99345136,0.00004043164,0.0013833703],"study_design_scores_gemma":[0.00011803524,0.0000716964,0.000078792684,0.000018739363,0.000011073767,0.0000067564147,0.000016603573,0.01787031,0.09189677,0.8897978,0.000012688113,0.00010070637],"about_ca_topic_score_codex":2.277686e-7,"about_ca_topic_score_gemma":3.664055e-8,"teacher_disagreement_score":0.37511978,"about_ca_system_score_codex":0.00004391754,"about_ca_system_score_gemma":0.00003046053,"threshold_uncertainty_score":0.54356647},"labels":[],"label_agreement":null},{"id":"W2010285287","doi":"10.1016/j.tcs.2007.10.039","title":"Words avoiding repetitions in arithmetic progressions","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arithmetic; Mathematics; Computer science","score_opus":0.009246700703768323,"score_gpt":0.2716644404241367,"score_spread":0.26241773972036836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010285287","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.09588682,0.000038456295,0.8962782,0.00074586074,0.0005483939,0.00015005414,5.506931e-7,0.00029894203,0.0060527134],"genre_scores_gemma":[0.803891,0.000002292669,0.19558047,0.00041272555,0.00008998375,0.0000060782295,3.9233973e-7,0.000006376018,0.00001068094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971893,0.0001279255,0.0003906525,0.00076154416,0.00065702165,0.0008735555],"domain_scores_gemma":[0.99794924,0.0006686568,0.0000661286,0.0009111599,0.0000922287,0.00031255727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060352026,0.00017383747,0.000190915,0.0005119378,0.00054971955,0.00039699004,0.0023447499,0.000060525657,0.000047650974],"category_scores_gemma":[0.00023650102,0.00014302788,0.000060747985,0.0027461501,0.0019869322,0.0007632925,0.0011071572,0.00039652243,0.000071315684],"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.0000029793123,0.000088050605,0.00023542767,0.0000033435376,9.814146e-7,0.00006321996,0.00069291604,0.000024151253,0.000694681,0.9425159,0.000013604846,0.05566473],"study_design_scores_gemma":[0.00031257115,0.00014554446,0.008680483,0.00017425604,0.0000027974486,0.00014393224,0.00006742485,0.368288,0.005828637,0.6157913,0.00018774092,0.00037727362],"about_ca_topic_score_codex":0.00000362729,"about_ca_topic_score_gemma":0.0000036963456,"teacher_disagreement_score":0.7080042,"about_ca_system_score_codex":0.00010115082,"about_ca_system_score_gemma":0.00011137312,"threshold_uncertainty_score":0.73209345},"labels":[],"label_agreement":null},{"id":"W2010962367","doi":"10.1016/s0304-3975(00)00019-0","title":"A space lower bound for st-connectivity on node-named JAGs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Turing machine; Discrete mathematics; Path (computing); Logarithm; Directed graph; Space (punctuation); Computation; Computer science; Algorithm","score_opus":0.014345452906201827,"score_gpt":0.2586123640249335,"score_spread":0.24426691111873167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010962367","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.09331227,0.00001535928,0.8937805,0.004185045,0.0011191604,0.0003898416,0.000010942072,0.00031808505,0.0068687634],"genre_scores_gemma":[0.8387733,0.000004383018,0.15919882,0.001658619,0.00024490262,0.000026240616,9.457408e-7,0.000011675518,0.000081124184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965746,0.00011729839,0.00028547656,0.0012305337,0.00085426535,0.0009378703],"domain_scores_gemma":[0.9971441,0.0008863285,0.00005973914,0.001352517,0.00018320578,0.00037413108],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017534612,0.0002933769,0.00030814763,0.00020803532,0.0009195508,0.0006980173,0.0032157085,0.00007778283,0.00027276488],"category_scores_gemma":[0.00013145868,0.00025037842,0.00017170407,0.0013663503,0.003125418,0.00073670316,0.0005395399,0.00032202734,0.00016347038],"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.000044492856,0.00015539296,0.0000075613675,0.0000055472547,0.0000044581548,0.000009272608,0.00021751485,0.00025899083,0.00007325662,0.8749421,0.00023425292,0.12404716],"study_design_scores_gemma":[0.00041930203,0.00062572176,0.00053029327,0.000035894762,0.000003927867,0.000023408846,0.0000021413796,0.55505353,0.0014877015,0.4383555,0.0031339815,0.00032859464],"about_ca_topic_score_codex":0.0000068084287,"about_ca_topic_score_gemma":0.0000017516527,"teacher_disagreement_score":0.745461,"about_ca_system_score_codex":0.00008922304,"about_ca_system_score_gemma":0.00015790737,"threshold_uncertainty_score":0.9999949},"labels":[],"label_agreement":null},{"id":"W2011273749","doi":"10.1016/j.tcs.2010.06.019","title":"The “runs” conjecture","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"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; Centre National de la Recherche Scientifique","keywords":"Conjecture; Combinatorics; Collatz conjecture; Mathematics; Upper and lower bounds; String (physics); Lonely runner conjecture; Discrete mathematics; Mathematical analysis","score_opus":0.0038316263642889036,"score_gpt":0.23197776452990565,"score_spread":0.22814613816561674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011273749","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.012601695,0.000023743027,0.97815526,0.003334118,0.002616892,0.00010909626,0.000001102981,0.00020305034,0.0029550293],"genre_scores_gemma":[0.8291588,0.000004221753,0.17001309,0.00052193954,0.00027581435,0.0000042741576,3.9067024e-7,0.000004538018,0.000016940296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795306,0.00005285862,0.00018532651,0.0005719789,0.00068136887,0.000555393],"domain_scores_gemma":[0.99759626,0.00041873485,0.000052069692,0.0015327599,0.0001372692,0.00026292301],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0014759321,0.00014530639,0.00011114766,0.000059576098,0.0014518496,0.0012084083,0.0051782043,0.000054572465,0.000033786466],"category_scores_gemma":[0.00011221234,0.00007864205,0.000048537695,0.0007159789,0.0035646642,0.000654105,0.0020297407,0.00047035777,0.0001183802],"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.0000014694617,0.000012194038,0.000010562276,5.5299853e-7,9.0173694e-7,0.0000045360957,0.00006501805,0.0000072272824,0.0012646716,0.87240005,0.00029133554,0.12594146],"study_design_scores_gemma":[0.00013596316,0.00008790772,0.00096244004,0.00000614567,0.0000014975095,0.0000842579,0.0000021489243,0.6298554,0.004550613,0.34876063,0.015366402,0.0001865701],"about_ca_topic_score_codex":0.0000028353497,"about_ca_topic_score_gemma":0.0000019297747,"teacher_disagreement_score":0.8165571,"about_ca_system_score_codex":0.000011967548,"about_ca_system_score_gemma":0.00013475439,"threshold_uncertainty_score":0.9998481},"labels":[],"label_agreement":null},{"id":"W2012753472","doi":"10.1016/j.tcs.2014.09.008","title":"On the conditional diagnosability of matching composition networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Composition (language); Matching (statistics); Mathematics; Computer science; Arithmetic; Algorithm; Discrete mathematics; Theoretical computer science; Statistics; Linguistics; Philosophy","score_opus":0.00697799373161165,"score_gpt":0.2244925295369179,"score_spread":0.21751453580530625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012753472","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.06666799,0.000003155088,0.9273188,0.0012445956,0.00062991225,0.00013180787,8.0069816e-7,0.000066863104,0.0039360537],"genre_scores_gemma":[0.99246925,3.9769668e-7,0.006265239,0.0010433919,0.00020595027,0.000008911719,9.608611e-7,0.0000035616222,0.0000023369766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808836,0.0003633861,0.00029879203,0.00040975458,0.00054525776,0.0002944386],"domain_scores_gemma":[0.9968385,0.0021028887,0.00010475904,0.00067601976,0.00018009206,0.00009775402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030108744,0.00011863003,0.00016878796,0.000066797336,0.00045630537,0.00022735955,0.001501932,0.000040568957,0.000070361115],"category_scores_gemma":[0.00008073933,0.00007435753,0.00007759631,0.00050141604,0.0016979523,0.00026530784,0.00035402837,0.00020759126,0.000040706465],"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.00000460747,0.000043298234,0.000022114971,0.0000026920575,0.0000023971093,3.9605706e-7,0.000121436766,0.019586703,0.00005958147,0.9773785,0.00015436449,0.002623899],"study_design_scores_gemma":[0.000059989816,0.00012433002,0.0006530226,0.000028147742,9.902996e-7,0.000009534322,0.0000021260907,0.62684953,0.00042582696,0.37176076,0.000022691202,0.000063061765],"about_ca_topic_score_codex":0.0000039570264,"about_ca_topic_score_gemma":3.7445216e-7,"teacher_disagreement_score":0.9258013,"about_ca_system_score_codex":0.00003754769,"about_ca_system_score_gemma":0.000024975008,"threshold_uncertainty_score":0.62561756},"labels":[],"label_agreement":null},{"id":"W2013154696","doi":"10.1016/j.tcs.2015.01.024","title":"A characterization of oblivious message adversaries for which Consensus is solvable","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Henan Institute of Science and Technology; Agence Nationale de la Recherche","keywords":"Network topology; Adversary; Computer science; Set (abstract data type); Theoretical computer science; Characterization (materials science); Message passing; Consensus algorithm; Topology (electrical circuits); Mathematics; Computer network; Discrete mathematics; Distributed computing; Algorithm; Computer security; Combinatorics","score_opus":0.01790132295529213,"score_gpt":0.25373043773067583,"score_spread":0.2358291147753837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013154696","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.06885799,0.000019768153,0.9275189,0.0012337371,0.0006992924,0.00029895396,0.000039254694,0.00010091258,0.0012311789],"genre_scores_gemma":[0.9434998,0.0000012858126,0.056072287,0.000304967,0.00006788192,0.000014175897,0.0000048062966,0.0000061936457,0.000028583161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792784,0.00006225535,0.0003730524,0.00055091805,0.0006287677,0.00045716934],"domain_scores_gemma":[0.99768305,0.00014116235,0.00016189614,0.00067715993,0.001075899,0.00026083988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216657,0.0001569312,0.0002922006,0.00011454728,0.0001964917,0.00029054473,0.0014989519,0.00006140296,0.0000063022817],"category_scores_gemma":[0.00016522146,0.00013249104,0.00005538221,0.0012122283,0.0011538843,0.00047714793,0.00042267336,0.000080264144,0.000016503838],"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.000020970147,0.000060490867,0.00005384566,0.000023702718,0.0000058396486,0.0000022272418,0.0013116099,0.0000709079,0.0058204634,0.9880028,0.0003192845,0.0043078964],"study_design_scores_gemma":[0.00076443696,0.00038401075,0.00037872276,0.00006941761,0.000007800023,0.000029660383,0.000027175602,0.9139033,0.03134159,0.05088396,0.0019307489,0.00027915233],"about_ca_topic_score_codex":0.0000073129404,"about_ca_topic_score_gemma":8.726485e-7,"teacher_disagreement_score":0.9371188,"about_ca_system_score_codex":0.000045227956,"about_ca_system_score_gemma":0.00036777905,"threshold_uncertainty_score":0.5402828},"labels":[],"label_agreement":null},{"id":"W2013181989","doi":"10.1016/s0304-3975(02)00317-1","title":"A probabilistic analysis of randomly generated binary constraint satisfaction problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Probabilistic logic; Binary number; Constraint (computer-aided design); Constraint satisfaction; Complexity of constraint satisfaction; Mathematics; Probabilistic analysis of algorithms; Computer science; Constraint satisfaction dual problem; Algorithm; Combinatorics; Theoretical computer science; Local consistency; Statistics; Arithmetic","score_opus":0.011029752993038324,"score_gpt":0.23533883175807763,"score_spread":0.2243090787650393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013181989","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.09640519,0.000012662108,0.9010689,0.00019015567,0.0002985479,0.00027480008,0.0000027617873,0.00012624693,0.001620722],"genre_scores_gemma":[0.897389,0.000005258531,0.102475494,0.00010094613,0.000009462151,0.000009581648,0.000001942658,0.0000040143595,0.000004304647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770236,0.00025558326,0.00046686444,0.0006531795,0.00057229283,0.00034970843],"domain_scores_gemma":[0.9983747,0.00023715751,0.00016195064,0.00063622615,0.00040070133,0.00018924022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016620738,0.00016777795,0.00034166404,0.0006618063,0.00024833146,0.00020596202,0.0005480415,0.000056254834,0.00020912196],"category_scores_gemma":[0.00024277072,0.00014227554,0.00012694072,0.0047802776,0.0022205743,0.000472811,0.0001336134,0.0001292388,0.000009990493],"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.000005972367,0.000043098902,0.0009061726,0.0000071055274,0.000049444094,0.000002226712,0.0002494746,0.06580717,0.0017912744,0.91709906,0.0000051753254,0.014033821],"study_design_scores_gemma":[0.00047519268,0.00011373299,0.013811229,0.0000140501925,0.00008204856,0.000022282895,0.0000072694475,0.9648373,0.0015785904,0.018858049,0.000014422062,0.00018581911],"about_ca_topic_score_codex":0.00000814954,"about_ca_topic_score_gemma":0.0000065399913,"teacher_disagreement_score":0.89903015,"about_ca_system_score_codex":0.00007583969,"about_ca_system_score_gemma":0.00026828435,"threshold_uncertainty_score":0.81817985},"labels":[],"label_agreement":null},{"id":"W2013195357","doi":"10.1016/j.tcs.2004.03.042","title":"Classifying RNA pseudoknotted structures","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Protein secondary structure; Nucleic acid secondary structure; Simple (philosophy); Algorithm; Generality; Class (philosophy); Computer science; Sequence (biology); Function (biology); Data structure; Base (topology); Mathematics; Theoretical computer science; RNA; Artificial intelligence; Biology; Programming language","score_opus":0.009692261270437333,"score_gpt":0.2472509920357312,"score_spread":0.23755873076529388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013195357","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.47953868,0.00004154799,0.51589435,0.00024146459,0.00038486635,0.00010098301,0.0000013804715,0.000029160658,0.0037675763],"genre_scores_gemma":[0.93430895,0.000007138387,0.06478803,0.00055912934,0.00030747458,0.0000040403993,0.0000019166737,0.000009118237,0.000014233593],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988295,0.0000373471,0.00012686594,0.0004151515,0.00026234056,0.0003288169],"domain_scores_gemma":[0.9993332,0.000012270132,0.00003274948,0.00038133922,0.00009731324,0.00014311812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038494848,0.00012191833,0.00009585636,0.00004196841,0.00022782189,0.00008870211,0.000589145,0.00007342544,0.000057805628],"category_scores_gemma":[0.00009783093,0.00009635974,0.000049889382,0.00016342821,0.001150922,0.000006993531,0.00026617237,0.000072125746,0.000058565805],"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.000015039127,0.000009861081,0.00000487939,0.000002283982,0.0000026647333,0.0000021614594,0.00001563768,0.00008310455,0.58488554,0.40883687,0.000014458144,0.0061275256],"study_design_scores_gemma":[0.00021664985,0.00024821865,0.00019558822,0.0000120875375,0.0000032875778,0.000022856235,0.0000030518074,0.0004951918,0.8623796,0.13585334,0.00041086145,0.0001592358],"about_ca_topic_score_codex":0.0000016990363,"about_ca_topic_score_gemma":2.5583302e-7,"teacher_disagreement_score":0.45477027,"about_ca_system_score_codex":0.000015751279,"about_ca_system_score_gemma":0.00009310873,"threshold_uncertainty_score":0.42406204},"labels":[],"label_agreement":null},{"id":"W2014252825","doi":"10.1016/s0304-3975(98)00342-9","title":"The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Victoria","funders":"","keywords":"Colored; Combinatorics; Parameterized complexity; Chordal graph; Mathematics; Pathwidth; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Tree (set theory); Bounded function; Graph; Line graph","score_opus":0.021004933285101487,"score_gpt":0.28023671478497736,"score_spread":0.25923178149987586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014252825","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.2731883,0.0002429994,0.7029465,0.0022774246,0.00052146526,0.0012287172,0.0000069086473,0.00021557687,0.019372152],"genre_scores_gemma":[0.9878764,0.000029386472,0.011370268,0.000495425,0.000028646173,0.0000300675,1.4123722e-7,0.000012527004,0.0001571015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966303,0.00039133284,0.000322932,0.00081926613,0.0011091067,0.0007270424],"domain_scores_gemma":[0.99759996,0.0006539372,0.00008775354,0.0012668092,0.00013803043,0.00025350074],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003213336,0.0002243304,0.0002481536,0.00016073076,0.00079653406,0.0004320896,0.0029304181,0.000054080145,0.000057759913],"category_scores_gemma":[0.000068396796,0.00013722682,0.00008100782,0.0012337123,0.0074659316,0.0003460953,0.0006459792,0.0002784033,0.000035767353],"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.00006953753,0.00007960652,0.0001278931,0.000009649899,0.000007756718,0.000003804036,0.00052297424,0.0005364802,0.0010403803,0.9503799,0.000042770083,0.047179256],"study_design_scores_gemma":[0.0005402875,0.001176791,0.0016457441,0.00008336615,0.0000048480097,0.000039507344,0.000015161674,0.19934043,0.0090632895,0.78635615,0.0014377327,0.00029670916],"about_ca_topic_score_codex":0.000004144034,"about_ca_topic_score_gemma":0.0000012446459,"teacher_disagreement_score":0.7146881,"about_ca_system_score_codex":0.000045959634,"about_ca_system_score_gemma":0.00009037793,"threshold_uncertainty_score":0.9952352},"labels":[],"label_agreement":null},{"id":"W2014679376","doi":"10.1016/j.tcs.2012.10.029","title":"On the exploration of time-varying networks","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"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":"Computability; Computer science; Exploit; Class (philosophy); Node (physics); Focus (optics); Upper and lower bounds; Theoretical computer science; Mathematics; Computer security; Artificial intelligence","score_opus":0.0262796194452426,"score_gpt":0.24617817947768544,"score_spread":0.21989856003244285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014679376","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.00467148,0.000031726762,0.9823406,0.00088060263,0.000690864,0.00013230306,3.5213964e-7,0.00008152878,0.011170587],"genre_scores_gemma":[0.9795883,0.0000051662396,0.01908231,0.0010562768,0.00024416993,0.000005058543,5.769025e-7,0.000005433036,0.000012671805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981532,0.00014047146,0.0002589813,0.0003069959,0.00059828855,0.00054202747],"domain_scores_gemma":[0.9979672,0.0008412641,0.00009851452,0.00076455815,0.00011235306,0.00021611455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022649702,0.00013767384,0.0001614022,0.000077127115,0.00035490832,0.0001664119,0.0016336379,0.000047414953,0.000073803116],"category_scores_gemma":[0.00002564259,0.000085285756,0.00005549276,0.00081965345,0.0015032731,0.0010477547,0.0005766878,0.00019435758,0.00009696513],"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.0000058104224,0.00004788277,0.000012232469,0.0000011727552,0.0000022645843,0.0000010993965,0.0003073228,0.0014685722,0.000037883205,0.9571469,0.00022996851,0.040738933],"study_design_scores_gemma":[0.000065522145,0.000098691904,0.000037105954,0.000024199999,0.0000030767737,0.000008030712,0.0000027781502,0.9096573,0.00036971684,0.08959914,0.000028253055,0.00010617304],"about_ca_topic_score_codex":7.1646264e-7,"about_ca_topic_score_gemma":1.7284219e-8,"teacher_disagreement_score":0.9749169,"about_ca_system_score_codex":0.000022517153,"about_ca_system_score_gemma":0.0000524683,"threshold_uncertainty_score":0.55388725},"labels":[],"label_agreement":null},{"id":"W2015172530","doi":"10.1016/j.tcs.2003.09.013","title":"Metrics for labelled Markov processes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":309,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Markov process; Metric (unit); Mathematics; Equivalence (formal languages); Markov chain; Property (philosophy); Markov property; Stochastic process; Discrete mathematics; Markov model; Statistics","score_opus":0.023812914768896423,"score_gpt":0.3019455865412595,"score_spread":0.2781326717723631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015172530","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.001970163,0.000059403737,0.9900077,0.00022866963,0.00084920594,0.00034787232,0.0000011851434,0.00020448313,0.0063313106],"genre_scores_gemma":[0.35730705,0.0000047042927,0.6423322,0.00027552724,0.00003433552,0.000024598205,2.4092503e-7,0.0000055576575,0.000015759166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769545,0.00014668757,0.00027981098,0.0006942222,0.0006094947,0.0005743473],"domain_scores_gemma":[0.99756706,0.0006911971,0.000089228415,0.0008407607,0.0005995613,0.0002121928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033705,0.00016054786,0.00018220418,0.00026879957,0.00046245818,0.00042649437,0.0024461243,0.00005429101,0.00001749044],"category_scores_gemma":[0.0029974924,0.0001325775,0.000048417667,0.003551433,0.0013186593,0.0008635943,0.00033303036,0.00011729991,0.000032751464],"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.0000043590485,0.000045047345,0.000018511539,0.000025047879,0.0000018777291,7.1458396e-7,0.00014045471,0.000027510385,0.0002339752,0.9713329,0.000049984897,0.02811963],"study_design_scores_gemma":[0.0003401676,0.00029149864,0.00007909861,0.000016821015,0.000005758255,0.000030998635,0.0000056800486,0.52199507,0.059651736,0.4143169,0.0029664538,0.00029980854],"about_ca_topic_score_codex":3.305225e-7,"about_ca_topic_score_gemma":8.989627e-8,"teacher_disagreement_score":0.557016,"about_ca_system_score_codex":0.00006370371,"about_ca_system_score_gemma":0.00031445542,"threshold_uncertainty_score":0.54063535},"labels":[],"label_agreement":null},{"id":"W2015179126","doi":"10.1016/j.tcs.2014.05.025","title":"Quantum cryptography: Public key distribution and coin tossing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":3914,"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":"Coin flipping; Quantum cryptography; Quantum key distribution; Computer science; Cryptography; Computer security; Theoretical computer science; Quantum channel; Channel (broadcasting); Key (lock); Adversary; Quantum information; Quantum; Mathematics; Computer network; Quantum mechanics; Physics","score_opus":0.008955706879752091,"score_gpt":0.23676191031291838,"score_spread":0.2278062034331663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015179126","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.27187458,0.000003013213,0.7265786,0.0005667359,0.000067338086,0.000052129715,0.0000066060843,0.000026704522,0.00082431507],"genre_scores_gemma":[0.99535424,3.9435142e-7,0.0044052876,0.00007624061,0.00014122222,0.000006895567,0.000010931227,0.00000426327,5.064271e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999085,0.000035384903,0.000121226076,0.0002947287,0.00018158487,0.0002820553],"domain_scores_gemma":[0.9994026,0.000076157754,0.00003666984,0.00023387911,0.00007481846,0.00017586733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835954,0.000088415385,0.000095959345,0.00003902059,0.00048846734,0.00032716693,0.00027317728,0.000015508624,0.00005646053],"category_scores_gemma":[0.000010088424,0.00007345195,0.00003216958,0.00038282177,0.0010908457,0.00014958621,0.00016793677,0.00009207724,0.00001778146],"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":[8.083028e-7,0.000027132293,0.0004200334,0.0000011610443,0.0000015218689,3.844325e-8,0.000023162018,0.0000011884393,0.0003081359,0.9745163,0.00002597023,0.024674578],"study_design_scores_gemma":[0.00006983048,0.000033077853,0.0009652289,0.0000054758616,0.0000028495203,7.416559e-7,0.0000057441716,0.31312427,0.00045343448,0.6844707,0.0007910682,0.000077604585],"about_ca_topic_score_codex":0.0000065469753,"about_ca_topic_score_gemma":1.6032577e-7,"teacher_disagreement_score":0.7234797,"about_ca_system_score_codex":0.000007210451,"about_ca_system_score_gemma":0.000023817012,"threshold_uncertainty_score":0.40192664},"labels":[],"label_agreement":null},{"id":"W2015734384","doi":"10.1016/s0304-3975(98)00132-7","title":"Three-dimensional weak visibility: Complexity and applications","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Disjoint sets; Visibility; Time complexity; Simple (philosophy); Combinatorics; Mathematics; Set (abstract data type); Space (punctuation); Computational complexity theory; Computer science; Algorithm; Discrete mathematics; Physics; Optics","score_opus":0.016896025729502356,"score_gpt":0.262296979198557,"score_spread":0.24540095346905463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015734384","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.04666879,0.000049638213,0.948922,0.0013042695,0.000116770345,0.00023566077,0.0000024701433,0.00016396248,0.0025364885],"genre_scores_gemma":[0.74324256,0.0000020478926,0.2559538,0.0006065305,0.0001562409,0.000013922685,0.000004100428,0.000003580457,0.00001726946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802047,0.00005003864,0.0002342536,0.00077156106,0.0005830484,0.00034059843],"domain_scores_gemma":[0.99876887,0.0001746469,0.000034122062,0.0005916621,0.00016565171,0.00026507373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091008836,0.00014414512,0.00014545809,0.00014420488,0.00067103765,0.0003624299,0.00096114655,0.00003690572,0.00032121816],"category_scores_gemma":[0.000014324992,0.00012675906,0.00003986078,0.0012111488,0.0022206444,0.00058926916,0.00046053663,0.00013210581,0.0001440117],"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.0000034031987,0.00004157632,0.000027103306,0.0000018740204,0.0000015447556,6.971401e-7,0.000022062228,0.00067171693,0.00008477225,0.7212788,0.000046922563,0.27781957],"study_design_scores_gemma":[0.0001084062,0.00005794853,0.0035838014,0.0000037233835,0.0000018411775,0.000036428235,3.3461708e-7,0.57412934,0.00022647803,0.42061007,0.0011279918,0.00011365611],"about_ca_topic_score_codex":0.0000065777053,"about_ca_topic_score_gemma":0.00000425848,"teacher_disagreement_score":0.69657373,"about_ca_system_score_codex":0.00003370883,"about_ca_system_score_gemma":0.000091564114,"threshold_uncertainty_score":0.81820565},"labels":[],"label_agreement":null},{"id":"W2015787121","doi":"10.1016/j.tcs.2009.03.026","title":"Estimation of state complexity of combined operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"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":"Catenation; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computational complexity theory; Combined operations; Algorithm; Theoretical computer science; Computer science; Discrete mathematics; Automaton; Linguistics","score_opus":0.01599258895503316,"score_gpt":0.26526173501559713,"score_spread":0.24926914606056397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015787121","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.24585542,0.0000069212037,0.75266325,0.000599116,0.000110944005,0.00009474002,0.0000025477957,0.00007270889,0.00059433625],"genre_scores_gemma":[0.74096024,0.000001061345,0.25884834,0.00017692037,0.000008218728,7.4175966e-7,9.105341e-7,0.0000017212999,0.0000018291357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846995,0.000081998645,0.00037039333,0.0003249145,0.00049570063,0.0002570737],"domain_scores_gemma":[0.9988218,0.00011497853,0.0000839898,0.0006766476,0.0001911487,0.00011144742],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010371936,0.00010972072,0.00022508948,0.00015408584,0.00015478372,0.0000999141,0.0016494322,0.000022741056,0.000017867056],"category_scores_gemma":[0.000065406675,0.000090273206,0.00005112573,0.0009375455,0.0027819467,0.00060505373,0.00031222362,0.000079941325,0.0000083628975],"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.0000057490006,0.00010275285,0.000005243693,0.000004582229,0.0000016030959,8.8827716e-7,0.00038423465,0.0060205054,0.00390747,0.92640036,0.000006535473,0.063160054],"study_design_scores_gemma":[0.00011724728,0.00024542466,0.0019719917,0.000016963842,0.0000013526677,0.0000037071902,0.0000016177631,0.5649167,0.03478801,0.39787683,5.4769004e-7,0.000059622937],"about_ca_topic_score_codex":0.000004765456,"about_ca_topic_score_gemma":3.0217598e-7,"teacher_disagreement_score":0.5588962,"about_ca_system_score_codex":0.000019577452,"about_ca_system_score_gemma":0.00009445545,"threshold_uncertainty_score":0.99993193},"labels":[],"label_agreement":null},{"id":"W2016258894","doi":"10.1016/j.tcs.2010.03.013","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Labelings on the composition of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> graphs","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"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":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Degree (music); Discrete mathematics; Physics","score_opus":0.014065416741891294,"score_gpt":0.23569754119939718,"score_spread":0.22163212445750588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016258894","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.952843,0.0013400587,0.01187462,0.002248963,0.007758736,0.00028133512,0.0008900301,0.0009986961,0.021764573],"genre_scores_gemma":[0.96944064,0.0011743187,0.017961545,0.0055402555,0.0023327111,0.0012322976,0.0010530775,0.0011348075,0.0001303448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9739895,0.0013059309,0.004931924,0.0058146915,0.007875321,0.006082671],"domain_scores_gemma":[0.9798998,0.0051372675,0.0045828624,0.0061939135,0.0010359694,0.003150134],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.008894083,0.0027724942,0.0013305056,0.0015057343,0.006011828,0.005289183,0.009308501,0.004266897,0.0055795517],"category_scores_gemma":[0.002926146,0.0038869842,0.0039383704,0.004530299,0.011080155,0.0038880405,0.007891159,0.0055396943,0.0044834036],"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.0022807799,0.0015411968,0.000016585316,0.0013484338,0.0015287184,0.0013399037,0.0034708912,0.005082993,0.014005072,0.94419324,0.021332782,0.003859419],"study_design_scores_gemma":[0.002801857,0.0036637636,0.00006534185,0.0024831062,0.001518379,0.0022979497,0.00068125397,0.6588201,0.31135747,0.011806094,0.0017380276,0.0027666679],"about_ca_topic_score_codex":0.0015795929,"about_ca_topic_score_gemma":0.0004738375,"teacher_disagreement_score":0.9323871,"about_ca_system_score_codex":0.00007508569,"about_ca_system_score_gemma":0.0031116586,"threshold_uncertainty_score":0.99850076},"labels":[],"label_agreement":null},{"id":"W2017334312","doi":"10.1016/j.tcs.2015.04.005","title":"The optimal capture time of the one-cop-moves game","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Computer science; Graph; Combinatorial game theory; Monotonic function; Game tree; Set (abstract data type); Depth-first search; Greedy algorithm; Mathematics; Combinatorics; Sequential game; Mathematical optimization; Theoretical computer science; Search algorithm; Algorithm; Game theory; Mathematical economics","score_opus":0.022938131111920657,"score_gpt":0.2674338826879437,"score_spread":0.24449575157602305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017334312","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.07090442,0.0001073203,0.9159027,0.0060818824,0.0011919873,0.00025244555,0.0000013902336,0.00012403092,0.0054338663],"genre_scores_gemma":[0.9607946,0.0000024901926,0.03843298,0.00052506535,0.00012419319,0.000004844956,8.080858e-8,0.0000072684106,0.00010847656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969608,0.00022149026,0.0003790728,0.0005264582,0.0013125385,0.000599624],"domain_scores_gemma":[0.9969504,0.0006020432,0.00014373416,0.0015770867,0.00046857903,0.0002581881],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024948532,0.00017687424,0.00019886652,0.00006139931,0.00044083557,0.00050101784,0.0072287708,0.000061268125,0.000016546232],"category_scores_gemma":[0.00052567484,0.00009357731,0.00010307396,0.0012615846,0.008491088,0.0005261598,0.0025166085,0.00028132214,0.00019925235],"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.000008240049,0.00003689236,0.0000367993,0.0000014308006,0.0000040125315,0.0000016120566,0.0024876737,0.0012678854,0.0006687299,0.9826232,0.00027727603,0.012586233],"study_design_scores_gemma":[0.000062531086,0.00013838324,0.00036282084,0.000028603092,0.000005211618,0.0000229446,0.000060813974,0.69739616,0.038030557,0.26311898,0.0005960969,0.00017691455],"about_ca_topic_score_codex":0.00001209772,"about_ca_topic_score_gemma":0.0000014809486,"teacher_disagreement_score":0.8898902,"about_ca_system_score_codex":0.0000660881,"about_ca_system_score_gemma":0.0003735541,"threshold_uncertainty_score":0.9981426},"labels":[],"label_agreement":null},{"id":"W2017360257","doi":"10.1016/j.tcs.2011.11.010","title":"On sum coloring and sum multi-coloring for restricted families of graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy coloring; Complete coloring; Combinatorics; Graph coloring; Mathematics; Brooks' theorem; Fractional coloring; Edge coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.04880908630460297,"score_gpt":0.30058764518823616,"score_spread":0.2517785588836332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017360257","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.33073884,0.000018701054,0.6679817,0.000040970855,0.00023816642,0.00031354645,0.000002575015,0.00009882388,0.0005667008],"genre_scores_gemma":[0.7355984,0.000011493031,0.26428577,0.000053556945,0.000013054163,0.000024281535,2.1059476e-7,0.000008338646,0.0000049148593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974886,0.00011005783,0.00031784,0.00080403325,0.0005590225,0.0007204228],"domain_scores_gemma":[0.9975166,0.0010341383,0.00009364794,0.0007709535,0.00031431043,0.00027036807],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013750545,0.000201442,0.00027812753,0.00054928137,0.00040743157,0.00011289621,0.002154548,0.000058508424,0.0000048601146],"category_scores_gemma":[0.0003910319,0.00016853375,0.00007143421,0.0015855714,0.004140525,0.00061435916,0.0011085909,0.00021016267,0.0000042461725],"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.00008415584,0.000099229044,0.0003274789,0.000020442661,0.000005712973,0.0000051513366,0.0008210022,0.000043236734,0.0026359875,0.98561573,0.0000027217757,0.010339155],"study_design_scores_gemma":[0.0007486269,0.0012570379,0.008240324,0.00006404598,0.0000050059302,0.000010131288,0.000035891815,0.23467055,0.050402004,0.7042824,0.000012077131,0.00027189136],"about_ca_topic_score_codex":0.0000068648787,"about_ca_topic_score_gemma":0.0000013268628,"teacher_disagreement_score":0.40485954,"about_ca_system_score_codex":0.000035112083,"about_ca_system_score_gemma":0.00008175558,"threshold_uncertainty_score":0.9985696},"labels":[],"label_agreement":null},{"id":"W2018390675","doi":"10.1016/j.tcs.2006.01.040","title":"Representation of a class of nondeterministic semiautomata by canonical words","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Nondeterministic algorithm; Word (group theory); Rewriting; Mathematics; Class (philosophy); Canonical form; TRACE (psycholinguistics); Set (abstract data type); Discrete mathematics; State (computer science); Existential quantification; Computer science; Algorithm; Programming language; Linguistics; Pure mathematics; Artificial intelligence","score_opus":0.012245128598761873,"score_gpt":0.26977786409715443,"score_spread":0.25753273549839256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018390675","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.04613266,0.000040741746,0.9464155,0.00014257856,0.00037293156,0.00016046593,0.0000017511605,0.000093790215,0.006639608],"genre_scores_gemma":[0.97682464,0.0000010737729,0.023025535,0.000037786383,0.00006649721,0.0000052417527,0.0000020679836,0.000005142249,0.000032040272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997675,0.00012658292,0.0005136874,0.0005404729,0.0007635222,0.00038075043],"domain_scores_gemma":[0.99835885,0.00028841442,0.00021256447,0.00082939945,0.00019485672,0.0001159312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329332,0.00013707201,0.00031759948,0.00012348183,0.000106982305,0.00012901629,0.001853904,0.00006448589,0.000011786903],"category_scores_gemma":[0.00007351217,0.000109530265,0.000081825296,0.0012491259,0.002442982,0.00030581935,0.000604153,0.000103822684,0.000010665279],"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.0000047667904,0.00009330742,0.000565743,0.000020422789,0.0000028272111,0.0000048101842,0.00014671245,0.00004534237,0.0041060536,0.9864256,0.00013477882,0.008449657],"study_design_scores_gemma":[0.00052177935,0.0005823645,0.0021196345,0.000025804306,0.00001384115,0.00005830507,0.0000144230535,0.5192014,0.07747736,0.39930344,0.00035372458,0.00032789467],"about_ca_topic_score_codex":0.000081445636,"about_ca_topic_score_gemma":0.0000028103639,"teacher_disagreement_score":0.93069196,"about_ca_system_score_codex":0.000036615376,"about_ca_system_score_gemma":0.00016989274,"threshold_uncertainty_score":0.90012693},"labels":[],"label_agreement":null},{"id":"W2018554016","doi":"10.1016/j.tcs.2007.03.014","title":"Defect particle kinematics in one-dimensional cellular automata","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kinematics; Cellular automaton; Automaton; Particle (ecology); Computer science; Mathematics; Theoretical computer science; Geometry; Classical mechanics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Physics; Geology","score_opus":0.01497642273216219,"score_gpt":0.2539691154864794,"score_spread":0.2389926927543172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018554016","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.29636997,0.000019737638,0.70099956,0.0010759179,0.00014471641,0.00015084434,5.0970664e-7,0.0002115957,0.0010271755],"genre_scores_gemma":[0.7729858,7.484303e-7,0.22628519,0.00067797553,0.000033326498,0.000005066115,9.956698e-7,0.000006121086,0.0000047501985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731225,0.000060340924,0.00042044863,0.0006698809,0.0008059995,0.00073107635],"domain_scores_gemma":[0.9980667,0.00037003978,0.00006520252,0.0011006382,0.00009927364,0.00029813772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031229532,0.00016074632,0.00019423943,0.00018515295,0.0002670953,0.00026436758,0.0020263512,0.000046007797,0.000034697867],"category_scores_gemma":[0.00007065726,0.00014554035,0.00007455895,0.001932414,0.0011994328,0.0004801208,0.0010326423,0.00019373221,0.00023392572],"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.0000027462152,0.00019403466,0.00010162689,0.000004926227,0.0000019666682,0.000026154421,0.00017790176,0.00026418242,0.02225475,0.9637921,0.000032302436,0.013147303],"study_design_scores_gemma":[0.00027399702,0.0000684183,0.003490935,0.000025295289,0.0000033290212,0.000024271723,0.0000031419195,0.85259676,0.06432154,0.078866735,0.00011829592,0.0002072547],"about_ca_topic_score_codex":0.00000542948,"about_ca_topic_score_gemma":0.0000025689944,"teacher_disagreement_score":0.88492537,"about_ca_system_score_codex":0.00007134198,"about_ca_system_score_gemma":0.00009987742,"threshold_uncertainty_score":0.5934964},"labels":[],"label_agreement":null},{"id":"W2018558025","doi":"10.1016/j.tcs.2014.10.009","title":"Approximation algorithms for digraph width parameters","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Mathematics; Combinatorics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; Algorithm; Graph","score_opus":0.022550280587743977,"score_gpt":0.29856726809895917,"score_spread":0.2760169875112152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018558025","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.005847376,0.00000981755,0.9909377,0.00081497617,0.00047234882,0.0004556732,0.0000018144029,0.00029385806,0.0011664153],"genre_scores_gemma":[0.48116198,0.0000010691618,0.51843274,0.00030076422,0.000055121793,0.00003464565,8.9944695e-7,0.0000073674632,0.0000053827853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682665,0.00017960997,0.0002893657,0.0009697712,0.0008556469,0.0008789791],"domain_scores_gemma":[0.9970633,0.001031507,0.000081982056,0.0011613852,0.00030679232,0.0003550371],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035621733,0.00020805492,0.00023463328,0.00035583862,0.00058499933,0.00054724555,0.0033809396,0.000055075587,0.0000056285144],"category_scores_gemma":[0.00039938252,0.00017116866,0.00011650036,0.001638617,0.0032997,0.0010805498,0.0007600315,0.00018437082,0.00003818646],"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.000009026924,0.000031711596,0.000012820299,0.000007867167,0.0000025847999,5.482466e-7,0.0001229607,0.0003357549,0.00034916523,0.79371256,0.000017010552,0.20539798],"study_design_scores_gemma":[0.00018217179,0.00022146375,0.000079045945,0.000008379505,0.0000014842603,0.000006908249,0.000001561663,0.49849,0.0044607287,0.49630007,0.000115087445,0.00013306517],"about_ca_topic_score_codex":8.839415e-7,"about_ca_topic_score_gemma":1.6041953e-7,"teacher_disagreement_score":0.49815425,"about_ca_system_score_codex":0.000049164188,"about_ca_system_score_gemma":0.00006737574,"threshold_uncertainty_score":0.9994128},"labels":[],"label_agreement":null},{"id":"W2018748865","doi":"10.1016/j.tcs.2008.06.011","title":"Games to induce specified equilibria","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Nash equilibrium; Computer science; Context (archaeology); Strategy; Repeated game; Mathematical economics; Best response; Node (physics); Range (aeronautics); Sequential game; Game theory; Non-cooperative game; Channel (broadcasting); A priori and a posteriori; Mathematical optimization; Mathematics; Computer network","score_opus":0.020088089347125367,"score_gpt":0.2498175850807489,"score_spread":0.22972949573362353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018748865","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.15577368,0.00001980789,0.83158696,0.0014363043,0.0010307673,0.00024817264,5.030813e-7,0.000367971,0.009535843],"genre_scores_gemma":[0.7762036,0.0000039003694,0.22161736,0.0017689728,0.00034570304,0.000012164941,2.3377882e-7,0.000010328027,0.000037757847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627584,0.00011227049,0.0003521762,0.0011782174,0.0010832633,0.0009982487],"domain_scores_gemma":[0.99702597,0.00027666456,0.000060038816,0.0017045111,0.00020085732,0.0007319564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976322,0.00025246944,0.00028615881,0.0002357442,0.00050187396,0.0003748018,0.005104078,0.00007018948,0.00009491444],"category_scores_gemma":[0.00010471766,0.00021727211,0.000078249555,0.0025356603,0.002462322,0.0008936515,0.0028587298,0.00028462382,0.00076165807],"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.000008176789,0.000045228928,0.000045765435,0.00000159356,0.0000022713914,0.000061865634,0.0006945868,0.0003254588,0.0012113036,0.96841246,0.0011260534,0.028065212],"study_design_scores_gemma":[0.00044214475,0.00062623527,0.008762885,0.000051058367,0.0000037739662,0.00049733615,0.0000061213127,0.8489415,0.01390648,0.122213624,0.003700728,0.0008480865],"about_ca_topic_score_codex":0.0000025165853,"about_ca_topic_score_gemma":3.4043282e-7,"teacher_disagreement_score":0.84861606,"about_ca_system_score_codex":0.0000891568,"about_ca_system_score_gemma":0.00022284128,"threshold_uncertainty_score":0.97898275},"labels":[],"label_agreement":null},{"id":"W2019940097","doi":"10.1016/s0304-3975(02)00736-3","title":"Expressive power of SQL","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"SQL; Computer science; Relational algebra; Mathematical proof; Programming language; Theoretical computer science; Reachability; Relational database; Database; Mathematics","score_opus":0.007096860504463824,"score_gpt":0.24190759469112036,"score_spread":0.23481073418665654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019940097","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.013680975,0.000049548296,0.97480685,0.00008317313,0.00053420855,0.00009803237,0.0000028264285,0.000076579854,0.010667802],"genre_scores_gemma":[0.64857453,0.0000013090386,0.3512957,0.00010148441,0.000013345759,0.0000027283909,1.4081627e-7,0.0000030354474,0.000007710351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981936,0.000100340454,0.00026593014,0.0005024655,0.00054285716,0.00039476348],"domain_scores_gemma":[0.9983731,0.00016175961,0.00009521444,0.0009819169,0.00020899113,0.00017905395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008808304,0.00013189368,0.00020051532,0.00011123897,0.00018896074,0.000064058906,0.0011335496,0.000028894328,0.0000611098],"category_scores_gemma":[0.00017441965,0.000100632395,0.000050853967,0.00079604454,0.0022653714,0.0008611154,0.0005218216,0.00009783157,0.000034554298],"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.0000017777005,0.000027830389,0.000026299911,0.0000045989514,0.0000016284486,0.0000066377384,0.00040546813,0.00004647889,0.00237896,0.99506927,0.000034936682,0.0019961088],"study_design_scores_gemma":[0.0008497728,0.0007948082,0.0009733277,0.00019155712,0.000006964273,0.00024482136,0.0001229973,0.06131437,0.3823276,0.5376315,0.014587675,0.00095460424],"about_ca_topic_score_codex":0.0000013681247,"about_ca_topic_score_gemma":1.0722898e-7,"teacher_disagreement_score":0.63489354,"about_ca_system_score_codex":0.000020233045,"about_ca_system_score_gemma":0.00012055347,"threshold_uncertainty_score":0.8346855},"labels":[],"label_agreement":null},{"id":"W2020031747","doi":"10.1016/j.tcs.2014.01.033","title":"A note on abelian returns in rotation words","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Abelian group; Prefix; Mathematics; Rotation (mathematics); Connection (principal bundle); Set (abstract data type); Pure mathematics; Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.006793204838155968,"score_gpt":0.24547315904204117,"score_spread":0.23867995420388521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020031747","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.11774575,0.000004928751,0.87387335,0.00180533,0.00054059736,0.00011450885,3.9355533e-7,0.00019909588,0.0057160533],"genre_scores_gemma":[0.9109939,0.000001496284,0.08702939,0.0018437316,0.000112458416,0.0000063779785,4.3202368e-7,0.000006652179,0.0000055680175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976314,0.00018602054,0.00026345951,0.0007260423,0.0006388682,0.00055421924],"domain_scores_gemma":[0.9983324,0.00044137432,0.000060171824,0.000906708,0.00006272435,0.00019661932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025103472,0.0001704207,0.0001856796,0.00024744755,0.00019414237,0.00038017042,0.0022252884,0.00005538165,0.000020145828],"category_scores_gemma":[0.00017867153,0.0001367716,0.0000466439,0.0014711497,0.0010265685,0.00056660286,0.0005150295,0.00023745607,0.00017567292],"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.000005525392,0.00004241133,0.000051584273,0.0000026881705,4.4466964e-7,0.0000050850085,0.00063618587,0.00024593322,0.0004649668,0.8785363,0.000011585271,0.1199973],"study_design_scores_gemma":[0.00018764842,0.00018219769,0.0028855486,0.000044673005,6.548871e-7,0.000007657186,0.0000033048755,0.6276092,0.0020957764,0.36674446,0.00009394335,0.00014490643],"about_ca_topic_score_codex":0.0000047395883,"about_ca_topic_score_gemma":0.0000024078201,"teacher_disagreement_score":0.7932481,"about_ca_system_score_codex":0.00007597997,"about_ca_system_score_gemma":0.000060879654,"threshold_uncertainty_score":0.5577384},"labels":[],"label_agreement":null},{"id":"W2020054908","doi":"10.1016/s0304-3975(00)00005-0","title":"Finding houses and holes in graphs","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Domino; Mathematics; Graph; Discrete mathematics; Chemistry","score_opus":0.023300947401377867,"score_gpt":0.30398486310987827,"score_spread":0.2806839157085004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020054908","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.3967161,0.0000514664,0.60159725,0.0004053718,0.00010396127,0.00009335743,2.4719756e-7,0.000106538464,0.00092572096],"genre_scores_gemma":[0.9230555,0.000040316907,0.07661353,0.00024910926,0.000023528963,0.0000060492816,9.513946e-8,0.00000658186,0.00000525592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759805,0.00012986391,0.0002074989,0.0007457369,0.00058562687,0.00073322747],"domain_scores_gemma":[0.9985669,0.00042608025,0.00003369585,0.0006357067,0.000076797885,0.00026081866],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017402162,0.00015468292,0.00017857573,0.0005899269,0.00031438188,0.00040090983,0.0020456552,0.000039752926,0.000011192166],"category_scores_gemma":[0.00013317053,0.0001304406,0.000032197753,0.002643218,0.005047093,0.001028581,0.0013647783,0.000250382,0.000022603797],"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.0000073852225,0.000029402776,0.0037715647,0.0000028853915,9.0454984e-7,0.000056418146,0.00032556514,0.00007121131,0.00047858997,0.94788194,0.0000023923571,0.047371715],"study_design_scores_gemma":[0.00023306302,0.00011948335,0.010262487,0.000031214942,6.7731196e-7,0.00010815084,0.000013699581,0.11456208,0.0012473266,0.87319046,0.000041092775,0.00019023615],"about_ca_topic_score_codex":0.0000028745199,"about_ca_topic_score_gemma":0.0000024461574,"teacher_disagreement_score":0.5263394,"about_ca_system_score_codex":0.000037008285,"about_ca_system_score_gemma":0.000057477802,"threshold_uncertainty_score":0.9976606},"labels":[],"label_agreement":null},{"id":"W2020295593","doi":"10.1016/j.tcs.2005.10.028","title":"A categorical model for the geometry of interaction","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Linear logic; Soundness; Categorical variable; Mathematics; Fragment (logic); Interpretation (philosophy); Multiplicative function; Semantics (computer science); Algebra over a field; Operator (biology); Decomposition; Pure mathematics; Calculus (dental); Discrete mathematics; Algorithm; Computer science; Programming language; Mathematical analysis","score_opus":0.026440686120794653,"score_gpt":0.28334616556474046,"score_spread":0.2569054794439458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020295593","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.0015193787,0.000049450522,0.99540836,0.0013015275,0.0005312979,0.00023974401,2.882486e-7,0.000079169644,0.0008707679],"genre_scores_gemma":[0.915511,0.0000024530134,0.08399227,0.0002555092,0.00019054879,0.000016959588,2.0770993e-7,0.0000039971615,0.00002707134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851626,0.000036170208,0.00026161943,0.00039030655,0.00043493617,0.0003607352],"domain_scores_gemma":[0.9985821,0.0004155577,0.000090123256,0.0005971161,0.00020890147,0.00010618466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014410716,0.00010905618,0.000152842,0.00010982393,0.00027292423,0.00021081809,0.001965399,0.00004021047,0.000006307289],"category_scores_gemma":[0.000083810104,0.00006450491,0.00008785974,0.0006785641,0.0010794678,0.00047267438,0.00047257685,0.00011987093,0.000021128571],"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.000005577781,0.000043910935,0.000008332579,0.0000055045007,0.000003427518,2.9153355e-7,0.00048640303,0.0038825092,0.00010192944,0.89939755,0.000067090186,0.09599748],"study_design_scores_gemma":[0.00010821047,0.000096731324,0.0000344309,0.0000012803936,0.0000038762264,0.000017204846,0.0000064728506,0.81335145,0.0011625438,0.1846131,0.00052999204,0.00007473335],"about_ca_topic_score_codex":0.0000050112885,"about_ca_topic_score_gemma":0.0000012008567,"teacher_disagreement_score":0.91399163,"about_ca_system_score_codex":0.00005055578,"about_ca_system_score_gemma":0.00008976796,"threshold_uncertainty_score":0.3977344},"labels":[],"label_agreement":null},{"id":"W2020715570","doi":"10.1016/j.tcs.2014.04.009","title":"Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Algorithm; Computer science; Mathematics; Computer network; Physics","score_opus":0.020491603163998888,"score_gpt":0.27287342488921645,"score_spread":0.25238182172521756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020715570","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.00251794,0.000012349061,0.9941212,0.00081038993,0.00024624477,0.0014696369,0.00000960264,0.00034137908,0.0004712736],"genre_scores_gemma":[0.32884842,6.224549e-7,0.67000073,0.00064485753,0.00013121087,0.00034310026,0.0000012109525,0.000012995674,0.000016836735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959955,0.0001160432,0.00047825527,0.001512341,0.0008756943,0.0010221563],"domain_scores_gemma":[0.99675125,0.0005885249,0.00014695304,0.0014240723,0.00046763895,0.00062155485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027098663,0.00033124213,0.00035827587,0.00026999993,0.0012132676,0.0007421509,0.004079094,0.00006861799,0.000007111925],"category_scores_gemma":[0.00019665307,0.00025908076,0.000093888535,0.0021262155,0.0021118266,0.00063696626,0.0011631853,0.00024334941,0.000037121637],"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.0000082008755,0.00013183246,0.000037182865,0.000032586962,0.0000044537937,0.000001253322,0.0010337264,0.001403703,0.0007873307,0.89551765,0.00002771619,0.10101436],"study_design_scores_gemma":[0.00044043388,0.00069023523,0.00026224635,0.00007909694,0.0000062188064,0.000029374989,0.000023126375,0.90355796,0.0011711618,0.09242608,0.000898157,0.00041590456],"about_ca_topic_score_codex":0.000004649882,"about_ca_topic_score_gemma":0.0000021685798,"teacher_disagreement_score":0.90215427,"about_ca_system_score_codex":0.00006407405,"about_ca_system_score_gemma":0.00017992617,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W2021295875","doi":"10.1016/j.tcs.2004.02.040","title":"A space-efficient algorithm for sequence alignment with inversions and reversals","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Substring; Algorithm; Computation; Shuffling; Dynamic programming; Sequence (biology); Space (punctuation); Smith–Waterman algorithm; Pairwise comparison; Multiple sequence alignment; Mathematics; Computer science; Combinatorics; Sequence alignment; Data structure; Biology; Genetics; Gene; Artificial intelligence","score_opus":0.010298519084731315,"score_gpt":0.23876795517614552,"score_spread":0.2284694360914142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021295875","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.50016266,0.0000701678,0.49897197,0.00043073556,0.00006023244,0.00017539553,0.000009981167,0.0000029338912,0.00011593704],"genre_scores_gemma":[0.7841033,0.00002428098,0.21554281,0.00026520833,0.000042822947,0.000010787643,0.0000013628608,0.000004619227,0.000004846218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914587,0.00001046307,0.00007872451,0.0003780934,0.00013702839,0.0002498281],"domain_scores_gemma":[0.9995541,0.000016388403,0.000024593786,0.00020126767,0.000082723585,0.00012092444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026078662,0.000100019504,0.000088172725,0.000025574218,0.00023133047,0.00003668037,0.00019660933,0.000027879496,0.0000012687995],"category_scores_gemma":[0.000015224671,0.000074022704,0.000023258928,0.00010010549,0.0016427009,9.056515e-7,0.0002523417,0.000028399016,0.0000012374775],"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.0000778093,0.00014083985,0.00016451068,0.00001778748,0.000049430368,0.000007251461,0.00064568047,0.006068526,0.35024953,0.62071294,0.0000792924,0.021786394],"study_design_scores_gemma":[0.005228103,0.007072671,0.0025670766,0.00014474711,0.00010442972,0.0002594778,0.0003301062,0.14121939,0.76175416,0.07571926,0.0042161783,0.0013844058],"about_ca_topic_score_codex":0.0000035658506,"about_ca_topic_score_gemma":7.0341173e-7,"teacher_disagreement_score":0.5449937,"about_ca_system_score_codex":0.0000208423,"about_ca_system_score_gemma":0.000090883426,"threshold_uncertainty_score":0.60526},"labels":[],"label_agreement":null},{"id":"W2021539685","doi":"10.1016/s0304-3975(98)00226-6","title":"Generating irregular partitionable data structures","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Parallel Computing and Optimization Techniques","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":"IBM (Canada); McGill University","funders":"","keywords":"Computer science; Data structure; Theoretical computer science; Pointer (user interface); Formalism (music); Rule-based machine translation; Graph partition; Graph; Parallel computing; Algorithm; Distributed computing; Programming language; Artificial intelligence","score_opus":0.019400851168053863,"score_gpt":0.2738776741788165,"score_spread":0.25447682301076263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021539685","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.008957864,0.000051157534,0.9847085,0.0007093299,0.0002079421,0.000103283855,0.000002812986,0.000683151,0.004575988],"genre_scores_gemma":[0.46001297,0.0000072709813,0.53913456,0.00067622255,0.0001247282,0.0000021283984,0.000005250973,0.000004608098,0.000032249987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975317,0.00011150845,0.00027512808,0.0009426818,0.0006224109,0.0005165785],"domain_scores_gemma":[0.9975524,0.000096287346,0.000049272687,0.0019720555,0.00012627944,0.000203704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723816,0.00016585014,0.00016178958,0.0001104003,0.00071938377,0.00079833897,0.0051796846,0.000046920683,0.00031524437],"category_scores_gemma":[0.00005393204,0.00014088445,0.00003111548,0.00092599663,0.0011815062,0.0011722357,0.0014090503,0.0001551583,0.00008390722],"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.000001677973,0.000022080887,0.000010803786,0.0000023119794,0.0000022173242,0.0000056658114,0.000080776,0.025476584,0.00010713424,0.86635447,0.0008138088,0.10712245],"study_design_scores_gemma":[0.0000825469,0.000046158297,0.00011667547,0.000010510549,0.0000018530282,0.00003468665,6.524367e-7,0.86723024,0.0014068285,0.12972175,0.0011708889,0.00017724388],"about_ca_topic_score_codex":0.0000040949935,"about_ca_topic_score_gemma":1.9584257e-7,"teacher_disagreement_score":0.8417536,"about_ca_system_score_codex":0.000028309807,"about_ca_system_score_gemma":0.00012256067,"threshold_uncertainty_score":0.9625229},"labels":[],"label_agreement":null},{"id":"W2021596745","doi":"10.1016/j.tcs.2012.04.001","title":"Algorithmic decomposition of shuffle on words","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Sublinear function; Property (philosophy); Decomposition; Mathematics; Time complexity; Combinatorics; Computational complexity theory; Discrete mathematics; Polynomial; Efficient algorithm; Word (group theory); Algorithm","score_opus":0.008221397840494565,"score_gpt":0.2671597439217456,"score_spread":0.258938346081251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021596745","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.14172594,0.000036734258,0.85315615,0.0002939755,0.0007862233,0.00009267854,0.0000012381685,0.00014674,0.0037603292],"genre_scores_gemma":[0.8532317,0.0000020406771,0.14612262,0.0004566155,0.0001735115,0.0000035988758,5.105106e-7,0.000005579034,0.0000038042665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803275,0.000102878155,0.00025166624,0.00038863823,0.00063614245,0.0005879511],"domain_scores_gemma":[0.99852616,0.00026812073,0.000080727914,0.0007785533,0.0000813466,0.00026509652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016731679,0.00015221846,0.00018915196,0.00020278111,0.00020151328,0.0001224644,0.0018727221,0.000044141332,0.000049167124],"category_scores_gemma":[0.00003370647,0.00012058949,0.000069780646,0.0008973389,0.0013948932,0.00085020065,0.00064094074,0.0001403786,0.0001227522],"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.0000049522305,0.00012949081,0.00006388071,0.0000040464533,0.0000022878655,0.0000013733463,0.00042504666,0.000035615984,0.002154207,0.93085563,0.000030242298,0.0662932],"study_design_scores_gemma":[0.00035277766,0.0005217643,0.0058032605,0.00008659088,0.000006993764,0.00007091297,0.000014901676,0.6282875,0.102491535,0.2618064,0.00015863351,0.00039870443],"about_ca_topic_score_codex":0.0000017178886,"about_ca_topic_score_gemma":3.3971432e-8,"teacher_disagreement_score":0.7115058,"about_ca_system_score_codex":0.000049840768,"about_ca_system_score_gemma":0.000046556557,"threshold_uncertainty_score":0.51395416},"labels":[],"label_agreement":null},{"id":"W2021913171","doi":"10.1016/j.tcs.2009.03.031","title":"On the synchronized derivation depth of context-free grammars","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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; Western University","funders":"","keywords":"Rule-based machine translation; Context (archaeology); Tree-adjoining grammar; Context-free grammar; Context-sensitive grammar; Mathematics; Indexed grammar; Computer science; Calculus (dental); Algorithm; Artificial intelligence; Geography","score_opus":0.009761927934682894,"score_gpt":0.2406589230558795,"score_spread":0.2308969951211966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021913171","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.79515964,0.000031770556,0.2015636,0.0011214744,0.00008312675,0.00010651203,9.56953e-7,0.000013255293,0.0019196735],"genre_scores_gemma":[0.9932294,0.000003186951,0.004648995,0.0020228452,0.00008583415,0.0000010793525,0.0000024549972,0.0000023954078,0.0000038090825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990568,0.00007685773,0.00015357032,0.00028036154,0.0002055943,0.00022681168],"domain_scores_gemma":[0.9992535,0.000101987614,0.000053590775,0.0004414741,0.00009063942,0.000058800106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065365917,0.00009405373,0.00010056082,0.000023233819,0.00015051846,0.00003610668,0.0008529843,0.000050108425,0.000013827311],"category_scores_gemma":[0.00042539835,0.000052281262,0.0000547339,0.00019613992,0.0013264813,0.0000031739467,0.00024153818,0.00007735583,0.000004064858],"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.00004876421,0.00004231821,0.000058229813,0.0000011611164,0.0000026926787,6.529185e-7,0.000014175588,0.000047535665,0.09553715,0.8544557,0.00012557536,0.04966606],"study_design_scores_gemma":[0.0008906908,0.0045130034,0.012557739,0.000057018573,0.000011382932,0.000019060091,0.000021727148,0.0387248,0.44482058,0.4976644,0.00034760102,0.00037198418],"about_ca_topic_score_codex":7.5384054e-7,"about_ca_topic_score_gemma":3.7831705e-7,"teacher_disagreement_score":0.3567913,"about_ca_system_score_codex":0.000007891729,"about_ca_system_score_gemma":0.00003215676,"threshold_uncertainty_score":0.48874757},"labels":[],"label_agreement":null},{"id":"W2022206191","doi":"10.1016/j.tcs.2011.05.042","title":"Conservative and aggressive rough SVR modeling","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Saint Mary's University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.037242674983623734,"score_gpt":0.2414768560614927,"score_spread":0.20423418107786895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022206191","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.056203894,0.00006984885,0.9304849,0.0003231595,0.00029668232,0.000115526855,7.9666694e-7,0.00014449334,0.012360686],"genre_scores_gemma":[0.6164387,0.0000089626765,0.38288096,0.00063000765,0.000033343316,0.0000031931036,1.1684e-7,0.0000033740125,0.0000013471296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806744,0.00007956118,0.00021661408,0.000723578,0.00040521513,0.0005076083],"domain_scores_gemma":[0.9987648,0.00011084801,0.00008549645,0.00059879984,0.00017528192,0.00026476936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670081,0.00017505762,0.00019122595,0.00010620991,0.00041646673,0.00029620974,0.0017117537,0.000048170426,0.00002216723],"category_scores_gemma":[0.000065383516,0.00012939858,0.000036589237,0.00064791465,0.002497304,0.0008374742,0.0013174221,0.00017026311,0.000034598594],"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.0000057765465,0.000028835399,0.00005369808,0.000002614828,0.000002850501,0.000044523604,0.0016768771,0.00006356174,0.000010586154,0.95889705,0.000009046109,0.03920455],"study_design_scores_gemma":[0.00010446106,0.00012770579,0.0003051504,0.000017184595,0.0000020118616,0.00006549384,0.000009958324,0.6474771,0.0001813489,0.35156852,0.0000065778577,0.0001345247],"about_ca_topic_score_codex":0.000016631844,"about_ca_topic_score_gemma":5.2561745e-7,"teacher_disagreement_score":0.6474135,"about_ca_system_score_codex":0.000022417618,"about_ca_system_score_gemma":0.00008382994,"threshold_uncertainty_score":0.92014205},"labels":[],"label_agreement":null},{"id":"W2022522100","doi":"10.1016/j.tcs.2005.09.047","title":"Tuning evaluation functions by maximizing concordance","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Concordance; Computer science; Mathematics; Algorithm; Biology; Bioinformatics","score_opus":0.029274080074199692,"score_gpt":0.3047333935201485,"score_spread":0.2754593134459488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022522100","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.020243753,0.00014622266,0.9680267,0.002955655,0.0008009585,0.00019846071,0.0000011458732,0.0002979108,0.0073291934],"genre_scores_gemma":[0.81862783,0.0000033443691,0.18025862,0.00084473134,0.00020718185,0.000015854444,9.2249036e-7,0.0000068956324,0.00003459112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968756,0.00015205186,0.00036352465,0.0008045519,0.0011840672,0.0006201981],"domain_scores_gemma":[0.99806666,0.00029267732,0.000096088035,0.0008524155,0.00043998632,0.00025217864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028346241,0.00018071882,0.0001639532,0.00016081372,0.00069400144,0.0006248413,0.0023504233,0.000048997932,0.00016742016],"category_scores_gemma":[0.00025211292,0.00016496936,0.00005715793,0.0012456129,0.0021968666,0.0016988768,0.0007350985,0.00022885791,0.0005303748],"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.0000020024197,0.000031663352,0.000032811786,9.237017e-7,0.0000017580112,8.1247913e-7,0.00036888575,0.001447199,0.0022261892,0.5682763,0.0005157365,0.4270957],"study_design_scores_gemma":[0.00007235563,0.0000815917,0.00007626149,0.00001814404,0.0000049507153,0.00001893004,0.00001965754,0.9291681,0.019095447,0.04916176,0.0020722302,0.00021059184],"about_ca_topic_score_codex":0.00000583724,"about_ca_topic_score_gemma":0.0000020524512,"teacher_disagreement_score":0.9277209,"about_ca_system_score_codex":0.00020729085,"about_ca_system_score_gemma":0.00020127885,"threshold_uncertainty_score":0.8094446},"labels":[],"label_agreement":null},{"id":"W2023422760","doi":"10.1016/j.tcs.2015.02.009","title":"Smoothed heights of tries and patricia tries","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Zhejiang Sci-Tech University; Alberta Innovates - Technology Futures","keywords":"Trie; Bernoulli's principle; String (physics); Set (abstract data type); Mathematics; Combinatorics; Infinity; Binary number; Discrete mathematics; Algorithm; Data structure; Computer science; Physics; Mathematical analysis; Arithmetic; Mathematical physics","score_opus":0.014883339790127296,"score_gpt":0.24625883979561064,"score_spread":0.23137550000548335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023422760","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.06630898,0.00019344364,0.9313734,0.0004393826,0.00038262535,0.000096512405,0.0000029363505,0.00009064035,0.0011120577],"genre_scores_gemma":[0.813935,0.000009616299,0.1858658,0.000116300136,0.00006106533,0.0000016793167,4.9905793e-7,0.0000034404611,0.0000066415396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981678,0.000084726336,0.0002605122,0.00048949965,0.00067259656,0.0003248651],"domain_scores_gemma":[0.9984912,0.0002059706,0.000085243504,0.00065881334,0.0002461156,0.00031263396],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011775548,0.00013977752,0.0002358664,0.00015779004,0.00019757205,0.00026332051,0.0015752695,0.00004173014,0.0000059705085],"category_scores_gemma":[0.00011538708,0.000096439275,0.00003049367,0.00082155946,0.0027218512,0.0008922646,0.0015164379,0.00009981179,0.0000096078675],"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.000012739675,0.000036455494,0.00008594975,0.00000468177,0.0000017800043,0.0000051815,0.00067415007,0.000015217297,0.000110331486,0.9509099,0.00011626377,0.048027325],"study_design_scores_gemma":[0.0006518624,0.00049926207,0.0013559551,0.00003650915,0.0000054414822,0.000039593073,0.00002581199,0.49772373,0.008649216,0.48987558,0.0008905655,0.00024647816],"about_ca_topic_score_codex":0.000009779466,"about_ca_topic_score_gemma":3.0682588e-7,"teacher_disagreement_score":0.747626,"about_ca_system_score_codex":0.000019288906,"about_ca_system_score_gemma":0.0001652975,"threshold_uncertainty_score":0.9999922},"labels":[],"label_agreement":null},{"id":"W2024502076","doi":"10.1016/j.tcs.2008.02.030","title":"Learning indexed families of recursive languages from positive data: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Inductive reasoning; Recursion (computer science); Computer science; Decidability; Artificial intelligence; Computability theory; Naturalness; String (physics); Theoretical computer science; Natural language processing; Mathematics; Algorithm","score_opus":0.017941794120456118,"score_gpt":0.27954005080668504,"score_spread":0.26159825668622894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024502076","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.32301044,0.000050439965,0.6752309,0.00017254996,0.00022308821,0.000065418404,0.000023463388,0.000114034796,0.0011096433],"genre_scores_gemma":[0.87385213,0.000017048831,0.12586375,0.00012233615,0.00009430369,9.862924e-7,0.000026576528,0.0000063803136,0.000016471731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727714,0.000508542,0.000263042,0.000830674,0.000717856,0.00040274314],"domain_scores_gemma":[0.9972344,0.0011293404,0.00013060769,0.0010847503,0.00025535392,0.00016554327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017156934,0.00017143777,0.00028919356,0.00016647931,0.0004275411,0.00012530795,0.0036513912,0.000050503368,0.000016269418],"category_scores_gemma":[0.00067835,0.00014032781,0.000039390863,0.001109308,0.002655466,0.0006535065,0.002247555,0.00039178188,0.000031447733],"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.00005170982,0.00022399142,0.025774956,0.000010361409,0.000043696276,0.00015534641,0.013477829,0.0015457217,0.0010337689,0.81603533,0.00018419283,0.1414631],"study_design_scores_gemma":[0.00035461262,0.00043986316,0.20936868,0.00006070497,0.000005901372,0.000049425515,0.00007059231,0.7761021,0.0034347689,0.009734146,0.000042368207,0.00033684826],"about_ca_topic_score_codex":0.0005003287,"about_ca_topic_score_gemma":0.0000055072255,"teacher_disagreement_score":0.8063012,"about_ca_system_score_codex":0.000021897178,"about_ca_system_score_gemma":0.00016254024,"threshold_uncertainty_score":0.9784176},"labels":[],"label_agreement":null},{"id":"W2024624524","doi":"10.1016/s0304-3975(03)00363-3","title":"An asymptotic fully polynomial time approximation scheme for bin covering","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"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":"Bin packing problem; Bin; Mathematics; Polynomial-time approximation scheme; Scheme (mathematics); Time complexity; Approximation algorithm; Polynomial; Combinatorics; Dual (grammatical number); Mathematical optimization; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.006235549382664906,"score_gpt":0.2174321802765514,"score_spread":0.2111966308938865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024624524","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.03940375,0.000006670499,0.9550976,0.00002697901,0.00032988112,0.00017563565,0.0000021740198,0.00025783258,0.0046994854],"genre_scores_gemma":[0.7710934,6.5499944e-7,0.22876541,0.000057588335,0.000053438223,0.000005992489,0.0000030831784,0.000012333291,0.000008090927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916565,0.00002422965,0.00014417607,0.00021224872,0.00016796714,0.0002857274],"domain_scores_gemma":[0.9995338,0.00005760781,0.000015991574,0.00020726213,0.000058205795,0.00012714813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058382505,0.000101848025,0.00010045151,0.00008829785,0.00014435156,0.00019021984,0.00025821934,0.00003962737,0.00009077325],"category_scores_gemma":[0.000042125936,0.000097187854,0.000026278487,0.0003142588,0.00033644852,0.00028763842,0.000021149759,0.00006559361,0.000052427786],"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.0000062010204,0.000026359603,0.00002168149,0.000026209724,0.000003756329,3.3155447e-7,0.00020121054,0.2501109,0.01322657,0.73305345,0.000087887216,0.0032354228],"study_design_scores_gemma":[0.00020581852,0.00007887188,0.00002791758,0.000011979876,0.0000026247724,0.0000052038863,0.0000017405259,0.98371214,0.010238528,0.0053628413,0.00021143147,0.00014090241],"about_ca_topic_score_codex":1.537321e-7,"about_ca_topic_score_gemma":4.5314483e-8,"teacher_disagreement_score":0.7336012,"about_ca_system_score_codex":0.00004087485,"about_ca_system_score_gemma":0.000029902996,"threshold_uncertainty_score":0.39632055},"labels":[],"label_agreement":null},{"id":"W2024626468","doi":"10.1016/s0304-3975(00)00282-6","title":"On the expressive power of first-order boolean functions in PCF","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Semilattice; Parallelism (grammar); Mathematics; Simple (philosophy); Boolean function; Order (exchange); Expressive power; Power (physics); Discrete mathematics; Computer science; Combinatorics; Theoretical computer science; Parallel computing","score_opus":0.0141741374407998,"score_gpt":0.23722002919491,"score_spread":0.22304589175411021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024626468","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.044592906,0.000022704335,0.93483406,0.001540131,0.00061641133,0.00022034261,3.4054477e-7,0.00006409115,0.018109009],"genre_scores_gemma":[0.995917,0.0000018527014,0.003553752,0.0004093459,0.000046947793,0.000013917821,2.1245273e-7,0.000004868324,0.000052082643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980971,0.00011409626,0.00026912033,0.00049488555,0.0005778183,0.0004469813],"domain_scores_gemma":[0.99827236,0.00046000935,0.00008508608,0.00089476444,0.00017339151,0.00011437085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217767,0.00014311644,0.00017317363,0.00015690914,0.0002928336,0.0001974694,0.0020109387,0.000046567126,0.00009834346],"category_scores_gemma":[0.0001732972,0.00008563282,0.000057618625,0.0015222284,0.0016427897,0.0002905233,0.0005516607,0.00019486768,0.00010105544],"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.0000070911155,0.00009393801,0.00046736398,0.0000023481914,0.0000022865372,0.000011882282,0.00094030716,0.00019842332,0.00003755552,0.995306,0.00015676173,0.0027760207],"study_design_scores_gemma":[0.00044560133,0.0007349558,0.0034140926,0.000037327227,0.0000038125522,0.0000589671,0.000121788995,0.24818966,0.0009515039,0.7429144,0.002788829,0.00033906192],"about_ca_topic_score_codex":0.000015708622,"about_ca_topic_score_gemma":0.0000063362972,"teacher_disagreement_score":0.9513241,"about_ca_system_score_codex":0.000037120695,"about_ca_system_score_gemma":0.000062739266,"threshold_uncertainty_score":0.60529274},"labels":[],"label_agreement":null},{"id":"W2025143052","doi":"10.1016/j.tcs.2012.11.037","title":"A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Facility location problem; Greedy algorithm; Approximation algorithm; Combinatorial algorithms; Mathematics; Dual (grammatical number); Scheme (mathematics); Combinatorial method; Mathematical optimization; Combinatorial optimization; Algorithm; Computer science; Combinatorics","score_opus":0.015966195577013283,"score_gpt":0.22621936649900135,"score_spread":0.21025317092198806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025143052","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.015036123,0.000025580403,0.9803131,0.0016510373,0.0009150398,0.00086782797,0.0000020155103,0.00010146457,0.0010877618],"genre_scores_gemma":[0.9866224,0.0000011177897,0.012178475,0.0004816019,0.000578727,0.00010719106,0.000014104668,0.0000053883473,0.0000109718285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855393,0.000017327951,0.00020985403,0.000284656,0.00052909803,0.00040511548],"domain_scores_gemma":[0.9990523,0.00005896983,0.00005586617,0.0003439578,0.0004601102,0.00002880476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023968995,0.00013623244,0.000111204296,0.000092360846,0.00066580187,0.00034328862,0.00050536403,0.000025815962,0.00007134741],"category_scores_gemma":[0.00008149086,0.0000845294,0.000035246336,0.0007557893,0.0010400076,0.0013879637,0.00021321232,0.0000778211,0.00010345809],"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.000020355947,0.00009648414,0.00022092575,0.00006696749,0.000006735166,4.63244e-8,0.00015475003,0.000705284,0.000008487364,0.93541694,0.00011719258,0.06318581],"study_design_scores_gemma":[0.00039095123,0.000036512414,0.003142311,0.0000135001965,0.000033960427,7.4718645e-7,0.00009787956,0.9483747,0.000091336726,0.04261363,0.0050221784,0.00018232166],"about_ca_topic_score_codex":0.000058602724,"about_ca_topic_score_gemma":0.0000046821942,"teacher_disagreement_score":0.9715863,"about_ca_system_score_codex":0.00004421385,"about_ca_system_score_gemma":0.000028223605,"threshold_uncertainty_score":0.5120877},"labels":[],"label_agreement":null},{"id":"W2025168251","doi":"10.1016/s0304-3975(01)00280-8","title":"Error-detecting properties of languages","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Redundancy (engineering); Property (philosophy); Error detection and correction; Word (group theory); Extension (predicate logic); Algorithm; Error analysis; Theoretical computer science; Natural language processing; Mathematics; Programming language","score_opus":0.022543639455241488,"score_gpt":0.2496567692035984,"score_spread":0.2271131297483569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025168251","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.9808077,0.00023173058,0.0150538115,0.00008067392,0.000078774094,0.000053094504,6.1560206e-7,0.000019995912,0.003673589],"genre_scores_gemma":[0.99573404,0.000005177208,0.0039425613,0.00015222725,0.00013982665,0.0000010162186,4.714725e-7,0.0000036966942,0.000021010126],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917936,0.000044731314,0.00013149396,0.00026709444,0.00014806069,0.00022925141],"domain_scores_gemma":[0.99961394,0.00001451079,0.000037263235,0.0002077311,0.00006494339,0.000061628125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037280066,0.00007912711,0.00009327488,0.000028034765,0.000114340175,0.000026148511,0.00039822038,0.000047891484,0.00003443612],"category_scores_gemma":[0.00013640804,0.000052039642,0.000037204605,0.00015743973,0.0014292451,0.0000037404384,0.0003410087,0.00006703843,0.000009984331],"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.000010051519,0.000039086026,0.00025612148,0.000009517876,0.0000038028254,0.0000015038502,0.000086766246,0.000043315893,0.9523278,0.020095104,0.000019630937,0.02710731],"study_design_scores_gemma":[0.00013650976,0.0005237599,0.00047489585,0.000028953507,0.000003696821,0.000021610407,0.00003918159,0.03181166,0.96597433,0.00060759165,0.0002150681,0.00016276831],"about_ca_topic_score_codex":0.0000012691,"about_ca_topic_score_gemma":1.9231933e-7,"teacher_disagreement_score":0.03176834,"about_ca_system_score_codex":0.0000037111765,"about_ca_system_score_gemma":0.0000078115,"threshold_uncertainty_score":0.52661127},"labels":[],"label_agreement":null},{"id":"W2025521996","doi":"10.1016/j.tcs.2004.02.032","title":"On the state complexity of reversals of regular languages","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":103,"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":"Regular language; Variety (cybernetics); Finite-state machine; State (computer science); Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Automaton; Finite state; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","score_opus":0.015218119819853127,"score_gpt":0.2520598938413013,"score_spread":0.23684177402144815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025521996","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.36019823,0.000020948872,0.6369161,0.0013978134,0.000108302615,0.00010168704,0.0000037546524,0.000056248176,0.0011969456],"genre_scores_gemma":[0.93624747,0.000002596685,0.06321209,0.00051019795,0.000017363624,0.0000015332039,2.2709936e-7,0.0000041444177,0.0000043918167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982391,0.00012274072,0.00028425344,0.0003689864,0.00067395,0.00031098162],"domain_scores_gemma":[0.9981025,0.0004408742,0.00013653733,0.0010909475,0.00013776097,0.00009139721],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019238228,0.00012590397,0.00021982231,0.000105834624,0.00014776207,0.00007219854,0.0027759927,0.000024245941,0.000029437893],"category_scores_gemma":[0.00013659007,0.00007637068,0.000074955664,0.00083398254,0.0061559076,0.00023209878,0.0007255087,0.00012363476,0.00001746413],"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.0000068590193,0.00006278033,0.0000034893872,0.000008168926,0.0000039487886,0.000004388206,0.00078231166,0.00048714736,0.0038980613,0.9905009,0.000019960042,0.00422193],"study_design_scores_gemma":[0.00015786475,0.00020630784,0.0005871889,0.00006880288,0.0000020364018,0.000008685327,0.000017086415,0.025346603,0.12557815,0.8479343,0.000004775947,0.00008821042],"about_ca_topic_score_codex":0.000016793021,"about_ca_topic_score_gemma":4.58066e-7,"teacher_disagreement_score":0.5760492,"about_ca_system_score_codex":0.000028690532,"about_ca_system_score_gemma":0.00007819841,"threshold_uncertainty_score":0.9965488},"labels":[],"label_agreement":null},{"id":"W2025639547","doi":"10.1016/j.tcs.2006.05.034","title":"Progressive solutions to a parallel automata equation","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Component (thermodynamics); Automaton; Block (permutation group theory); Mathematics; Action (physics); Cellular automaton; Computer science; Algorithm; Applied mathematics; Theoretical computer science; Combinatorics; Physics; Thermodynamics","score_opus":0.015572417817744736,"score_gpt":0.25212270200388376,"score_spread":0.23655028418613902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025639547","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.015780475,0.00003442011,0.9756262,0.0034105198,0.00044252395,0.0002915042,0.000002134227,0.00067237526,0.0037398671],"genre_scores_gemma":[0.6704886,3.1587322e-7,0.3288004,0.0005216739,0.00014197276,0.000024173583,0.0000014811919,0.000005790874,0.00001557577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972091,0.00010040722,0.00030134423,0.0007924669,0.00078630913,0.00081042154],"domain_scores_gemma":[0.9982631,0.00018972746,0.00007334132,0.0010235664,0.00018569616,0.00026456962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014317344,0.00018992822,0.00017753473,0.0002485072,0.0006491585,0.00073044165,0.0027040746,0.000047398036,0.000034877994],"category_scores_gemma":[0.000073866395,0.00015720639,0.00006343817,0.0016249197,0.0012931392,0.0008720757,0.0015218197,0.00012505068,0.00036925336],"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.0000035506143,0.000088976194,0.00001098255,0.000002521781,0.0000015103012,0.000016839535,0.00014929728,0.001188303,0.00055328093,0.97291327,0.00040963796,0.024661813],"study_design_scores_gemma":[0.00014167874,0.00011366201,0.0012713526,0.000020215679,0.0000021486385,0.000041467963,0.0000025573624,0.602191,0.00076334685,0.39512876,0.00014705889,0.00017679327],"about_ca_topic_score_codex":0.000010895599,"about_ca_topic_score_gemma":6.684763e-7,"teacher_disagreement_score":0.65470815,"about_ca_system_score_codex":0.000085491585,"about_ca_system_score_gemma":0.00013845076,"threshold_uncertainty_score":0.70436656},"labels":[],"label_agreement":null},{"id":"W2026365732","doi":"10.1016/j.tcs.2013.05.003","title":"Addendum to “Recursively defined metric spaces without contraction” [Theoret. Comput. Sci. 380 (1/2) (2007) 143–163]","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Addendum; Mathematics; Contraction (grammar); Metric space; Metric (unit); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Calculus (dental); Pure mathematics; Engineering","score_opus":0.012924827962777725,"score_gpt":0.25207466812166757,"score_spread":0.23914984015888985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026365732","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.026093049,0.00008080222,0.95822436,0.0040113465,0.003319918,0.00084643194,0.00000774092,0.00065226824,0.0067641097],"genre_scores_gemma":[0.6870697,0.000006067483,0.31017742,0.002132142,0.0004941316,0.00004132124,0.0000017008298,0.000019600995,0.00005790981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937793,0.0003012689,0.00066851184,0.0017893616,0.0017936798,0.0016678491],"domain_scores_gemma":[0.9947671,0.00095726585,0.00021365951,0.0016842542,0.001130095,0.001247581],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021715292,0.00056555547,0.00065079617,0.0011698169,0.0012186231,0.0025545286,0.005822288,0.00014018221,0.0005046434],"category_scores_gemma":[0.0005851481,0.00048060776,0.00017114171,0.0074793193,0.004094219,0.0021036451,0.002450998,0.0005863923,0.0016333886],"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.0000131199795,0.0001286843,0.00017961286,0.000008441199,0.000018241602,0.00001354075,0.00043422388,0.00027339836,0.00026509247,0.94520426,0.0026152013,0.050846186],"study_design_scores_gemma":[0.0006733187,0.0007523366,0.0075122067,0.00008697117,0.000019298628,0.00011954687,0.00004459841,0.5721539,0.0016038222,0.413365,0.002698073,0.0009709306],"about_ca_topic_score_codex":0.0000915907,"about_ca_topic_score_gemma":0.000004090386,"teacher_disagreement_score":0.66097665,"about_ca_system_score_codex":0.00017647092,"about_ca_system_score_gemma":0.0003270494,"threshold_uncertainty_score":0.99976456},"labels":[],"label_agreement":null},{"id":"W2026409515","doi":"10.1016/j.tcs.2008.09.023","title":"On weighted balls-into-bins games","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ball (mathematics); Bin; Mathematics; Context (archaeology); Computer science; Combinatorics; Mathematical optimization; Algorithm; Geometry","score_opus":0.01958480343885642,"score_gpt":0.21519433549914774,"score_spread":0.1956095320602913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026409515","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.75820464,0.00007011581,0.17628358,0.00047014927,0.00091454183,0.00012318294,0.0000061661704,0.000127058,0.06380059],"genre_scores_gemma":[0.9943957,0.0000072248017,0.0046357396,0.0005857257,0.00017546809,0.0000045233696,8.912408e-7,0.000012136903,0.00018259083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984069,0.00004142764,0.00039386554,0.0006009608,0.00011621147,0.00044065766],"domain_scores_gemma":[0.99891514,0.0002082244,0.00011752596,0.0005246789,0.000042745076,0.00019167941],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014919603,0.00015534178,0.00030343054,0.00022966534,0.0004678285,0.000090904556,0.0008202942,0.000058843794,0.00043860238],"category_scores_gemma":[0.00013396244,0.00014283041,0.00008390838,0.0005575635,0.0024764452,0.00018492478,0.00016278289,0.00017569901,0.0024413532],"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.0000120811565,0.000062893814,0.00069522636,0.0000049630116,0.000004188243,0.000009994237,0.0005861034,0.000033162196,0.00002844446,0.9978495,0.00013133431,0.0005821049],"study_design_scores_gemma":[0.00028617796,0.0002776544,0.003558865,0.000026483065,0.0000012152288,0.000041072715,0.000005743813,0.055834953,0.00076401123,0.9377236,0.0012127697,0.0002674799],"about_ca_topic_score_codex":0.000009766718,"about_ca_topic_score_gemma":2.2868342e-7,"teacher_disagreement_score":0.23619108,"about_ca_system_score_codex":0.000065764405,"about_ca_system_score_gemma":0.00002698447,"threshold_uncertainty_score":0.99833536},"labels":[],"label_agreement":null},{"id":"W2026582799","doi":"10.1016/j.tcs.2004.07.028","title":"Enhancing global SLS-resolution with loop cutting and tabling mechanisms","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Resolution (logic); Semantics (computer science); Computation; Computer science; Property (philosophy); Loop (graph theory); Bounded function; Stack (abstract data type); Programming language; Simple (philosophy); Algorithm; Theoretical computer science; Mathematics","score_opus":0.006578832329436091,"score_gpt":0.22602170268789493,"score_spread":0.21944287035845883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026582799","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.069421805,0.0000718174,0.9260843,0.00037106837,0.00034801982,0.00013102227,4.7463615e-7,0.00025812956,0.0033134096],"genre_scores_gemma":[0.6429008,0.0000025063039,0.35680458,0.00021243725,0.00006932621,0.0000026520788,1.9219412e-7,0.0000041523117,0.0000033149263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748266,0.00005669377,0.00022794842,0.00086742453,0.000615721,0.00074958097],"domain_scores_gemma":[0.9987999,0.00009685102,0.00008258015,0.00049762806,0.00019149212,0.00033154903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013217208,0.00022028164,0.00021324998,0.00009740555,0.0007435834,0.0006979098,0.0013018064,0.00006041998,0.000005679982],"category_scores_gemma":[0.000095594456,0.00016292512,0.000036001205,0.0012608825,0.0014606431,0.0008987685,0.001036287,0.00017683381,0.00003272842],"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.0000055689325,0.00003105163,0.000048550435,0.0000076239576,0.0000028980858,0.00002032246,0.0004070605,0.0005492663,0.0010490462,0.98712045,8.289934e-7,0.010757333],"study_design_scores_gemma":[0.0006099168,0.0004811884,0.00059983024,0.00014302865,0.000009114657,0.00033173664,0.000028043321,0.34680858,0.019043818,0.63155645,0.000011921161,0.00037637388],"about_ca_topic_score_codex":0.000015523492,"about_ca_topic_score_gemma":0.000006117311,"teacher_disagreement_score":0.573479,"about_ca_system_score_codex":0.00016290728,"about_ca_system_score_gemma":0.00023927963,"threshold_uncertainty_score":0.672996},"labels":[],"label_agreement":null},{"id":"W2026951311","doi":"10.1016/j.tcs.2009.02.024","title":"Decimations of languages and state complexity","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context-free language; Context (archaeology); Transformation (genetics); Mathematics; State (computer science); Regular language; Arithmetic; Combinatorics; Upper and lower bounds; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Algorithm; Theoretical computer science; Rule-based machine translation","score_opus":0.01166234300292262,"score_gpt":0.2812288733793871,"score_spread":0.2695665303764645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026951311","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.20639803,0.000043833246,0.7904781,0.0008841127,0.000059652368,0.000059179027,0.0000019005018,0.000104915256,0.0019702544],"genre_scores_gemma":[0.79670894,0.000004048054,0.20285113,0.0004157734,0.000015132273,5.034241e-7,2.6424502e-7,0.0000015225922,0.0000026652442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882704,0.000053481024,0.00018869215,0.00033194487,0.00033081498,0.00026805434],"domain_scores_gemma":[0.99907124,0.00015989285,0.000055728848,0.0004888224,0.00008930593,0.00013501619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079301914,0.00009572164,0.00015111372,0.000118539596,0.00017509285,0.00016897754,0.0011304802,0.000017304848,0.00001308124],"category_scores_gemma":[0.000046360346,0.000075422526,0.000027321139,0.00057089,0.0021646174,0.00046798695,0.00038491457,0.00007440976,0.000008315677],"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.0000015956474,0.000029671452,0.000024444884,0.0000024638518,9.4680087e-7,0.000002636519,0.00040848684,0.000015646741,0.0013451236,0.90239197,0.0000116115325,0.09576538],"study_design_scores_gemma":[0.000103317936,0.00013156867,0.014078431,0.000015981586,0.0000014240602,0.000023245126,0.0000073045885,0.2761584,0.0060887,0.7032858,0.0000113091455,0.00009452967],"about_ca_topic_score_codex":0.0000025060115,"about_ca_topic_score_gemma":2.63461e-7,"teacher_disagreement_score":0.59031093,"about_ca_system_score_codex":0.000011600851,"about_ca_system_score_gemma":0.00003796341,"threshold_uncertainty_score":0.7975623},"labels":[],"label_agreement":null},{"id":"W2027154380","doi":"10.1016/j.tcs.2014.10.037","title":"Improving the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games","year":2014,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Upper and lower bounds; Stability (learning theory); Function (biology); Combinatorics; Mathematics; Algorithm; Computer science; Discrete mathematics; Mathematical economics; Machine learning; Mathematical analysis","score_opus":0.03073461169615029,"score_gpt":0.2641081378752692,"score_spread":0.2333735261791189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027154380","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.65979505,0.0002786048,0.038113605,0.001278868,0.0015054595,0.00007061463,0.00005211102,0.00012363415,0.29878208],"genre_scores_gemma":[0.9905171,0.0001305568,0.0058012437,0.0018820231,0.00096546917,0.00042274184,0.000040861913,0.00018779437,0.00005224879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9896425,0.0015390838,0.0016823236,0.0018809637,0.003174245,0.0020808778],"domain_scores_gemma":[0.9837076,0.010564235,0.0014730637,0.00320816,0.00026433918,0.0007826068],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.012731014,0.00057895493,0.0003039295,0.0003498087,0.002255188,0.0021237896,0.0049642753,0.00090900523,0.2523102],"category_scores_gemma":[0.005322411,0.00077619695,0.0008714784,0.002814319,0.008454869,0.0010868405,0.0028625554,0.0014068957,0.0012878352],"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.0008020045,0.00024312761,0.000015348562,0.00014904905,0.00016776308,0.00007678512,0.0024995082,0.0050557023,0.0019260296,0.9507092,0.0324065,0.0059489487],"study_design_scores_gemma":[0.0006184908,0.0011734408,0.000304349,0.00047198727,0.00024660694,0.000184444,0.0008098222,0.3235883,0.66082954,0.010667653,0.00039700477,0.0007083334],"about_ca_topic_score_codex":0.0004397806,"about_ca_topic_score_gemma":0.00028418523,"teacher_disagreement_score":0.9400416,"about_ca_system_score_codex":0.000017108465,"about_ca_system_score_gemma":0.0014692124,"threshold_uncertainty_score":0.9994898},"labels":[],"label_agreement":null},{"id":"W2027573831","doi":"10.1016/j.tcs.2011.12.016","title":"Encapsulating deontic and branching time specifications","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Deontic logic; Computer science; Modular design; Locality; Temporal logic; Branching (polymer chemistry); Theoretical computer science; Linear temporal logic; Programming language; Modular programming; Epistemology","score_opus":0.045977585765061016,"score_gpt":0.2599045389504922,"score_spread":0.2139269531854312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027573831","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.04487234,0.000018568826,0.94121325,0.000109507295,0.00026720713,0.00012115508,4.0940517e-7,0.00020969666,0.013187851],"genre_scores_gemma":[0.49601868,0.000001388741,0.5038567,0.00008172013,0.000031233238,0.0000026804746,1.2388784e-7,0.0000032013763,0.000004268155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826044,0.00012499762,0.0002609677,0.0005883118,0.0003748837,0.00039041406],"domain_scores_gemma":[0.9986688,0.00013366996,0.000079513375,0.00079647,0.00011911586,0.00020244803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019655905,0.00012961449,0.00013419824,0.00016703464,0.0004842831,0.00028780635,0.0016721146,0.000037493744,0.000047986978],"category_scores_gemma":[0.00018972822,0.00011417437,0.0000283558,0.0008824871,0.0018492314,0.0011750946,0.0007051409,0.00015494025,0.00012636604],"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.0000014055473,0.000019809124,0.000068976144,0.0000027741323,0.0000011722186,0.0000013909737,0.0014188886,0.000004266201,0.001817795,0.9161504,0.0000029938133,0.08051011],"study_design_scores_gemma":[0.00008042004,0.00007697177,0.018683657,0.00001858879,0.0000030582366,0.000050851762,0.000005828409,0.74821985,0.007230646,0.2254257,0.000027471497,0.00017693045],"about_ca_topic_score_codex":0.0000027990939,"about_ca_topic_score_gemma":8.046071e-8,"teacher_disagreement_score":0.7482156,"about_ca_system_score_codex":0.00003258853,"about_ca_system_score_gemma":0.00004909559,"threshold_uncertainty_score":0.681357},"labels":[],"label_agreement":null},{"id":"W2027783832","doi":"10.1016/s0304-3975(01)00408-x","title":"Embedding problems for paths with direction constrained edges","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consiglio Nazionale delle Ricerche; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Reachability; Embedding; Planar graph; Graph embedding; Path (computing); Mathematics; Book embedding; Graph; Planar; Context (archaeology); Characterization (materials science); Combinatorics; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Artificial intelligence; Pathwidth; Line graph","score_opus":0.017630980161791848,"score_gpt":0.24552910943419673,"score_spread":0.22789812927240488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027783832","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.009555604,0.000040062358,0.9865281,0.001057156,0.0004870955,0.00031810036,0.0000015242526,0.00021618283,0.0017962012],"genre_scores_gemma":[0.71146226,0.0000026475313,0.28811678,0.00021198521,0.0001406642,0.000024234585,0.0000011420126,0.0000044664343,0.00003583705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832034,0.000044547578,0.00019444774,0.0005915794,0.0004601371,0.00038896487],"domain_scores_gemma":[0.998872,0.00027378128,0.00006539879,0.00032299373,0.0003030622,0.00016277871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000733909,0.00014450533,0.00013920538,0.00018945702,0.0005383721,0.00044999862,0.0007468617,0.000033579003,0.000029203553],"category_scores_gemma":[0.00006425677,0.00011174052,0.000043428292,0.0010646945,0.00089505955,0.0007045555,0.00017120909,0.00008674565,0.000020918638],"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.0000043211217,0.000058303012,0.0000092100245,0.000011486639,0.0000041114026,0.0000018193114,0.0003641605,0.013172953,0.0007611296,0.8406317,0.00010790903,0.14487286],"study_design_scores_gemma":[0.00030934595,0.00039622132,0.000089914916,0.000025323452,0.0000040125833,0.000059543036,0.0000035101925,0.9553248,0.0035326616,0.03935725,0.0007170197,0.00018038793],"about_ca_topic_score_codex":5.4377205e-7,"about_ca_topic_score_gemma":2.7995614e-7,"teacher_disagreement_score":0.94215184,"about_ca_system_score_codex":0.00004311061,"about_ca_system_score_gemma":0.000052146384,"threshold_uncertainty_score":0.4556646},"labels":[],"label_agreement":null},{"id":"W2027854745","doi":"10.1016/j.tcs.2010.10.026","title":"Reconstructing polygons from scanner data","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Scanner; Point in polygon; Point (geometry); Visibility; Range (aeronautics); Set (abstract data type); Polygon (computer graphics); Mathematics; Plane (geometry); Algorithm; Computational geometry; Computer science; Combinatorics; Geometry; Computer vision; Topology (electrical circuits); Polygon mesh; Artificial intelligence; Geography","score_opus":0.011727437243471292,"score_gpt":0.22411161233133442,"score_spread":0.21238417508786311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027854745","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.3269565,0.0000056577082,0.66839415,0.00011186201,0.0013776904,0.000035947873,0.000013526394,0.0001561046,0.0029485745],"genre_scores_gemma":[0.88582647,0.0000016427495,0.1138275,0.00006863366,0.0002529597,3.3193191e-7,0.000011950038,0.000009485144,0.0000010576165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911416,0.000012223375,0.00013665638,0.0002903647,0.00019781096,0.00024876397],"domain_scores_gemma":[0.9989905,0.000104466206,0.000012385761,0.0007136373,0.000040620544,0.00013841473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033445057,0.000086852866,0.000088138535,0.000057055055,0.0001452707,0.00015931355,0.0008420341,0.000042070675,0.00015620742],"category_scores_gemma":[0.000068206275,0.00007597573,0.000013222985,0.00027928822,0.0010412553,0.0002807327,0.00023612691,0.00020565777,0.000046420224],"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.0000018693847,0.000011021748,0.00047325843,0.000003858349,0.000005214705,0.000004225728,0.00011399167,0.020384366,0.022113707,0.91290736,0.00013404194,0.04384708],"study_design_scores_gemma":[0.000058905716,0.000007121473,0.00025714422,0.000007941343,0.0000037835728,0.0000074892864,0.000004351561,0.9803635,0.005037512,0.014004746,0.00013604647,0.00011147314],"about_ca_topic_score_codex":0.0000088253,"about_ca_topic_score_gemma":0.0000039936467,"teacher_disagreement_score":0.9599791,"about_ca_system_score_codex":0.000009971175,"about_ca_system_score_gemma":0.000025416855,"threshold_uncertainty_score":0.38365483},"labels":[],"label_agreement":null},{"id":"W2028077146","doi":"10.1016/j.tcs.2007.03.039","title":"Learning intersection-closed classes with signatures","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Intersection (aeronautics); Equivalence (formal languages); Signature (topology); Mathematics; Theoretical computer science; Algebraic number; Invariant (physics); Scheme (mathematics); Concept class; Algebra over a field; Computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.004030657338007537,"score_gpt":0.2408022262372431,"score_spread":0.23677156889923556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028077146","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.09104086,0.000012868691,0.8992543,0.00044832268,0.000495841,0.00007674868,9.308339e-8,0.00045040392,0.0082205525],"genre_scores_gemma":[0.8165058,7.2271854e-7,0.18291217,0.0003364627,0.00018990062,0.0000013464269,3.5016546e-7,0.000007738043,0.000045513654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976042,0.00009719021,0.00020722498,0.0006899379,0.00074558007,0.00065589615],"domain_scores_gemma":[0.9985771,0.00041553707,0.00007762134,0.0004677794,0.0001872739,0.00027465643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021253396,0.00018980293,0.00016818632,0.00027475244,0.0006321709,0.00053253473,0.001682071,0.000053147953,0.00003258327],"category_scores_gemma":[0.000116088486,0.00013344176,0.000047627196,0.0014327465,0.0016255925,0.00054107024,0.0005346081,0.0006283227,0.000049682552],"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.00001686872,0.00003879801,0.0004311935,0.0000042933743,0.000004987806,0.00004456348,0.00066927046,0.0021351443,0.00063561945,0.8710788,0.000018430315,0.124922015],"study_design_scores_gemma":[0.00039457087,0.0012465727,0.008688182,0.000056640296,0.000005089242,0.00014035577,0.000053030184,0.9606881,0.0062719495,0.021234686,0.00079800026,0.00042281285],"about_ca_topic_score_codex":0.000008064994,"about_ca_topic_score_gemma":0.000002062942,"teacher_disagreement_score":0.95855296,"about_ca_system_score_codex":0.00005559966,"about_ca_system_score_gemma":0.000094953866,"threshold_uncertainty_score":0.5989563},"labels":[],"label_agreement":null},{"id":"W2028475750","doi":"10.1016/j.tcs.2012.04.002","title":"One-reversal counter machines and multihead automata: Revisited","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"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; Google (Canada)","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Deterministic context-free grammar; Computer science; Nested word; Finite-state machine; Embedded pushdown automaton; Deterministic finite automaton; Counterexample; Theoretical computer science; Automaton; Algorithm; Discrete mathematics; Automata theory; Mathematics; Quantum finite automata; Programming language; Nondeterministic finite automaton; Parsing; Context-free grammar","score_opus":0.011368968874612733,"score_gpt":0.2533445139941322,"score_spread":0.2419755451195195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028475750","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.123787545,0.0003497544,0.8712418,0.0010936658,0.00083950994,0.00017894365,0.000003895723,0.0005233115,0.0019815809],"genre_scores_gemma":[0.86952263,0.000018285444,0.12879914,0.0013547807,0.00027888673,0.0000046144305,0.0000010671461,0.000009972935,0.000010627482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974232,0.00013921689,0.00028488733,0.0006411425,0.0006620061,0.0008495742],"domain_scores_gemma":[0.9981168,0.00031328024,0.00007423782,0.0009149391,0.00010366765,0.00047706865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022578128,0.00022924082,0.00027325883,0.00018117973,0.00040327138,0.0005623359,0.0017933283,0.0000649301,0.000046931047],"category_scores_gemma":[0.00009083032,0.00018829304,0.000055565997,0.000765424,0.0021753733,0.0019754502,0.0016014775,0.00020623897,0.00013812781],"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.0000052434057,0.00008740765,0.00052926433,0.000013165273,0.000005093814,0.0000030484302,0.00054590555,0.0000022872482,0.000997527,0.9257851,0.00013645928,0.07188948],"study_design_scores_gemma":[0.0005075761,0.00014445014,0.019741738,0.0000870498,0.000012980641,0.00013437055,0.0000073050755,0.9189241,0.00181479,0.05732867,0.00081120705,0.00048579276],"about_ca_topic_score_codex":0.0000052980085,"about_ca_topic_score_gemma":1.6368239e-7,"teacher_disagreement_score":0.91892177,"about_ca_system_score_codex":0.00004543667,"about_ca_system_score_gemma":0.000041590243,"threshold_uncertainty_score":0.8015253},"labels":[],"label_agreement":null},{"id":"W2029064195","doi":"10.1016/j.tcs.2008.09.027","title":"A cyclic binary morphism avoiding Abelian fourth powers","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Mathematics; Binary number; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.013840604077014223,"score_gpt":0.23986156262289027,"score_spread":0.22602095854587603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029064195","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.08454341,0.000052510346,0.90758145,0.0035657322,0.00043497322,0.00016512167,0.000001801632,0.00034953616,0.0033054538],"genre_scores_gemma":[0.7328626,0.000018772747,0.26639596,0.00053602096,0.00013356327,0.000013310939,8.8986525e-7,0.0000072382263,0.00003167264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727553,0.00009525984,0.00029305072,0.0008745011,0.0007619809,0.00069970166],"domain_scores_gemma":[0.99810225,0.00022438113,0.00007392586,0.0010316344,0.00015723154,0.00041057207],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.00088361296,0.00020880948,0.00019362663,0.00025873384,0.0021640693,0.00018326294,0.0028354398,0.00005598768,0.00003977123],"category_scores_gemma":[0.00005098839,0.00018225517,0.00009273928,0.0020181814,0.0032455965,0.0009372516,0.0011114369,0.0003212458,0.00031076025],"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.00000172402,0.000092809256,0.00008334674,0.000001987792,0.000002970901,0.000040705927,0.00047124006,0.00044198992,0.0013790558,0.9927157,0.00030777935,0.004460671],"study_design_scores_gemma":[0.00026059354,0.00019373318,0.0057625277,0.000022489576,0.000003464512,0.00043878955,0.000010757783,0.8800451,0.0012985026,0.11045939,0.001129608,0.00037501327],"about_ca_topic_score_codex":0.0000070640212,"about_ca_topic_score_gemma":2.0958485e-7,"teacher_disagreement_score":0.8822563,"about_ca_system_score_codex":0.00008734578,"about_ca_system_score_gemma":0.00017555707,"threshold_uncertainty_score":0.999467},"labels":[],"label_agreement":null},{"id":"W2029413222","doi":"10.1016/j.tcs.2003.10.010","title":"From cascade decompositions to bit-vector algorithms","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Algorithm; Automaton; Cascade; Mathematics; Computation; Bit array; Bounded function; Computer science; Theoretical computer science; Type (biology)","score_opus":0.008736864146077434,"score_gpt":0.25412173965813795,"score_spread":0.2453848755120605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029413222","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.06665913,0.000032525615,0.9270729,0.0015474216,0.0012123906,0.00016913001,0.000007876346,0.00035813233,0.002940527],"genre_scores_gemma":[0.6044055,9.816744e-7,0.39388463,0.0015444453,0.00013852959,0.00000862472,8.148078e-7,0.0000077230015,0.000008709451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705774,0.00018496905,0.0002999785,0.0010064333,0.00069546583,0.0007554468],"domain_scores_gemma":[0.9975503,0.00042712208,0.000049728293,0.0012039084,0.00013241709,0.0006365112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183461,0.0002369235,0.0002422832,0.00023234184,0.00054611027,0.0007171903,0.0028792303,0.000060289767,0.00017083711],"category_scores_gemma":[0.000117430776,0.0001990617,0.000088118075,0.0017036421,0.0010715182,0.0006731192,0.00080680015,0.00020118264,0.00058676227],"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.0000018301803,0.000065654844,0.0000077871355,0.0000010474611,0.000004357768,0.000021891145,0.000606858,0.00009860751,0.0051736403,0.97867495,0.00021148422,0.015131875],"study_design_scores_gemma":[0.00026907632,0.00022151067,0.000823294,0.000041164465,0.0000071828167,0.00009575277,0.000021063322,0.37198964,0.059559096,0.56522137,0.0012386753,0.00051220594],"about_ca_topic_score_codex":0.000015224838,"about_ca_topic_score_gemma":7.831805e-7,"teacher_disagreement_score":0.5377464,"about_ca_system_score_codex":0.00008768708,"about_ca_system_score_gemma":0.00013918964,"threshold_uncertainty_score":0.81175005},"labels":[],"label_agreement":null},{"id":"W2029626238","doi":"10.1016/s0304-3975(02)00738-7","title":"Mining for empty spaces in large data sets","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Focus (optics); Scalability; Computer science; Bounded function; Set (abstract data type); Data structure; Space (punctuation); Mathematics; Algorithm; Data mining; Theoretical computer science","score_opus":0.03465404803737175,"score_gpt":0.30475762553959324,"score_spread":0.27010357750222147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029626238","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.008046531,0.000029054938,0.98754853,0.00072404713,0.0006412781,0.00023078352,0.000013721512,0.000095195915,0.0026708764],"genre_scores_gemma":[0.52057475,0.0000022227632,0.4789763,0.00038273164,0.000033878296,0.000005537148,0.000007075313,0.000004220511,0.000013312288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757487,0.00008055365,0.00022271807,0.0009687125,0.0004466416,0.0007065028],"domain_scores_gemma":[0.9978689,0.00024956444,0.000049139686,0.0016313613,0.000056475023,0.00014458163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038817408,0.00014525573,0.00016710458,0.00019941718,0.0002579677,0.00079046044,0.005112672,0.000029219298,0.00001891237],"category_scores_gemma":[0.00023906025,0.00012300504,0.000025866098,0.0011066967,0.0006065143,0.001964329,0.0025124294,0.00009363716,0.000026506505],"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.0000015984982,0.00005541526,0.00020979664,0.0000063049965,0.0000017213133,0.000008117288,0.00018513943,0.000015143356,0.000012667174,0.9755455,0.00047069107,0.023487901],"study_design_scores_gemma":[0.00044642226,0.000082272796,0.0005549632,0.00002243366,0.0000027571841,0.000006830758,0.00002214702,0.9057108,0.00034040338,0.086024806,0.0065644924,0.00022165039],"about_ca_topic_score_codex":0.0000012208808,"about_ca_topic_score_gemma":0.0000029984121,"teacher_disagreement_score":0.9056957,"about_ca_system_score_codex":0.000024941806,"about_ca_system_score_gemma":0.00008213288,"threshold_uncertainty_score":0.9500702},"labels":[],"label_agreement":null},{"id":"W2029731972","doi":"10.1016/j.tcs.2008.02.025","title":"Measuring teachability using variants of the teaching dimension","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimension (graph theory); Monomial; Object (grammar); Mathematics education; Mathematics; Computer science; Teaching method; Theoretical computer science; Artificial intelligence; Discrete mathematics; Combinatorics","score_opus":0.025250209994526658,"score_gpt":0.25284650155929644,"score_spread":0.2275962915647698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029731972","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.43335545,0.000006915615,0.5652448,0.00022854567,0.00041338414,0.000063368534,1.997782e-7,0.00006235095,0.0006250218],"genre_scores_gemma":[0.78757304,3.664881e-7,0.21224608,0.00010307693,0.00006771877,5.5819606e-7,3.471884e-8,0.000004262019,0.0000048453535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974591,0.0004003455,0.00028177063,0.00055213104,0.0008987543,0.0004078764],"domain_scores_gemma":[0.99834913,0.00021654584,0.00011407449,0.0010602486,0.00012516421,0.00013481946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027847262,0.00014357021,0.00019428875,0.00009506049,0.0012305746,0.00008295351,0.0025008512,0.000036337515,0.0000065877844],"category_scores_gemma":[0.00035668316,0.00009112295,0.000089898924,0.00070713443,0.0023319742,0.0004174932,0.0017798338,0.0004340998,0.000005482697],"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.0000031260233,0.00009872385,0.003649126,0.0000090436515,0.0000035497699,0.0000065990534,0.0016921306,0.0035527868,0.0076789446,0.96299887,0.000005449024,0.020301657],"study_design_scores_gemma":[0.000120414305,0.000056576682,0.026249966,0.000047192614,0.00000279845,0.00014030209,0.000003085172,0.95223683,0.0039963457,0.01700672,0.000010766046,0.000129031],"about_ca_topic_score_codex":0.000032437063,"about_ca_topic_score_gemma":1.4748191e-7,"teacher_disagreement_score":0.94868404,"about_ca_system_score_codex":0.000055403212,"about_ca_system_score_gemma":0.00015766433,"threshold_uncertainty_score":0.94647086},"labels":[],"label_agreement":null},{"id":"W2029877651","doi":"10.1016/j.tcs.2015.04.027","title":"On the complexity of neighbourhood learning in radio networks","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Neighbourhood (mathematics); Schedule; Node (physics); Class (philosophy); Generalization; Radio networks; Upper and lower bounds; Degree (music); Binary logarithm; Graph; Algorithm; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Wireless network; Artificial intelligence; Wireless; Telecommunications","score_opus":0.06630140433264756,"score_gpt":0.2858921960271714,"score_spread":0.21959079169452386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029877651","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.027059702,0.000071571994,0.9580583,0.004387183,0.00023260165,0.00013117475,1.01147315e-7,0.00007366991,0.009985712],"genre_scores_gemma":[0.985111,0.000016489355,0.014190629,0.00062761386,0.000039978157,0.0000042090082,2.5903148e-7,0.0000039101647,0.0000059322133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806535,0.00051052024,0.00026192956,0.00034022177,0.00047740122,0.00034459715],"domain_scores_gemma":[0.99808043,0.00063537195,0.00008021642,0.00084499666,0.00020045359,0.0001585576],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0032589454,0.00011939902,0.00017918993,0.00012327965,0.0002663704,0.00018035121,0.002985739,0.000029802984,0.000033524822],"category_scores_gemma":[0.0003314181,0.00007944577,0.000038721715,0.0016274811,0.003424998,0.00025422385,0.0012599517,0.0004217075,0.000016178366],"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.0000061991927,0.00004179765,0.00013382282,6.021198e-7,0.0000012249628,0.0000014109135,0.0006373544,0.013745652,0.000020234536,0.96798944,0.00005950982,0.017362718],"study_design_scores_gemma":[0.00018344744,0.00016026858,0.0025755342,0.000031073047,6.3603534e-7,0.0000046677596,0.000010775862,0.853053,0.0001973575,0.14364503,0.000047690875,0.00009052511],"about_ca_topic_score_codex":0.0000027072404,"about_ca_topic_score_gemma":0.0000030405247,"teacher_disagreement_score":0.95805126,"about_ca_system_score_codex":0.00006711945,"about_ca_system_score_gemma":0.00012619667,"threshold_uncertainty_score":0.9992871},"labels":[],"label_agreement":null},{"id":"W2031856686","doi":"10.1016/j.tcs.2002.11.003","title":"Periodicity in one-dimensional peg duotaire","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science","keywords":"Conjecture; PEG ratio; Combinatorics; Mathematics; Hop (telecommunications); Solitaire Cryptographic Algorithm; Discrete mathematics; Computer science; Telecommunications","score_opus":0.02443893551405692,"score_gpt":0.2725862962438209,"score_spread":0.24814736072976398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031856686","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.2783171,0.000028832597,0.714173,0.0009722522,0.00058202253,0.00014399026,3.5661765e-7,0.0001379509,0.0056444756],"genre_scores_gemma":[0.86173487,0.000001443298,0.13746402,0.00073323946,0.000042752363,0.0000062533836,1.2718687e-7,0.0000060955417,0.000011196837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967664,0.00021415294,0.00039178357,0.0009002559,0.0009506157,0.0007767889],"domain_scores_gemma":[0.9982809,0.00030970303,0.00005957281,0.0008712486,0.00018949044,0.00028912182],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021196841,0.0001976241,0.00023838127,0.0002649481,0.00038903696,0.00040246837,0.0022941602,0.00006739435,0.00015173387],"category_scores_gemma":[0.00037790547,0.00017702389,0.00006437184,0.0016943373,0.0036030523,0.00083274976,0.0007175223,0.00030851783,0.00030569202],"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.0000033572992,0.00010853961,0.0006842073,0.0000023194332,0.0000011587447,0.00002454587,0.00051533,0.0006589276,0.00079491804,0.9844326,0.00001855296,0.012755562],"study_design_scores_gemma":[0.000102253885,0.0001490414,0.002542378,0.000038232523,0.0000016122946,0.000053614873,0.000017811044,0.4969398,0.024425771,0.47526175,0.00014867212,0.00031904958],"about_ca_topic_score_codex":0.000010310316,"about_ca_topic_score_gemma":0.000005767214,"teacher_disagreement_score":0.5834178,"about_ca_system_score_codex":0.00012224939,"about_ca_system_score_gemma":0.00031502816,"threshold_uncertainty_score":0.99910855},"labels":[],"label_agreement":null},{"id":"W2032099069","doi":"10.1016/j.tcs.2007.10.032","title":"Shuffle operations on discrete paths","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.008344515457987482,"score_gpt":0.26066202948367323,"score_spread":0.25231751402568575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032099069","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.07134015,0.00000997094,0.9158853,0.0011233758,0.00072487164,0.00012274216,0.0000013953544,0.00033064923,0.010461534],"genre_scores_gemma":[0.8802437,0.0000015043672,0.117572024,0.0019737524,0.00017186046,0.0000030865617,7.0917235e-7,0.0000072611924,0.000026108311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974995,0.000064362204,0.0002778908,0.00072438456,0.0007307305,0.00070309464],"domain_scores_gemma":[0.9981165,0.00033251697,0.00003138221,0.0010683378,0.00011007849,0.00034117937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027408735,0.00018396298,0.00016052907,0.00021325283,0.0006197656,0.00057512004,0.002682504,0.00004827473,0.000055167537],"category_scores_gemma":[0.00008739924,0.00013851687,0.000067692876,0.0011067895,0.0017302976,0.00071646046,0.0008437128,0.00020935904,0.0002456009],"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.0000045102424,0.0000481573,0.000012061759,0.0000010668159,0.0000015684931,0.000020849544,0.00029176142,0.00025184333,0.0010128707,0.9434442,0.00004341518,0.05486773],"study_design_scores_gemma":[0.00023440087,0.00038510276,0.0024782603,0.000034551267,0.0000027120532,0.00004557413,0.000015501926,0.76290476,0.02448308,0.20869102,0.0003649761,0.0003600569],"about_ca_topic_score_codex":0.0000033717458,"about_ca_topic_score_gemma":9.1495474e-7,"teacher_disagreement_score":0.8089035,"about_ca_system_score_codex":0.00006232165,"about_ca_system_score_gemma":0.00008384293,"threshold_uncertainty_score":0.63753533},"labels":[],"label_agreement":null},{"id":"W2032125335","doi":"10.1016/j.tcs.2004.05.006","title":"On maximal instances for the original syntenic distance","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"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":"Genome; Synteny; Combinatorics; Chromosome; Genetic distance; Biology; Mathematics; Genetics; Gene","score_opus":0.007896712641639192,"score_gpt":0.24957024624216476,"score_spread":0.24167353360052557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032125335","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.15932629,0.00012852222,0.83834565,0.00089861924,0.00031725765,0.0002281985,0.0000061099145,0.00001316618,0.0007361914],"genre_scores_gemma":[0.9792612,0.000018364433,0.020027936,0.0004208399,0.00021982858,0.000022721373,0.0000025712009,0.000007575672,0.000018937002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989283,0.000013765407,0.0001020944,0.00037812509,0.0002517071,0.0003259953],"domain_scores_gemma":[0.9994102,0.000047139667,0.00002859985,0.0003615664,0.000078110155,0.00007438502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000437386,0.000108722066,0.00007615351,0.00002425122,0.00029028734,0.000079505844,0.00070665317,0.000029909757,0.00001189411],"category_scores_gemma":[0.000055448352,0.00006839163,0.000055906905,0.00017251683,0.0017581695,0.0000056031963,0.00013438359,0.00006391952,0.000018652605],"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.00007402962,0.000038114133,0.00001578781,0.0000044030107,0.0000077211525,0.0000012112476,0.000029365732,0.0006460935,0.007798506,0.98455596,0.00004250669,0.0067863096],"study_design_scores_gemma":[0.0037862598,0.005584999,0.002200774,0.00011818673,0.00006240857,0.00008482122,0.00007495507,0.036846388,0.23347287,0.67959195,0.037009425,0.0011669388],"about_ca_topic_score_codex":8.0709924e-7,"about_ca_topic_score_gemma":0.0000014755637,"teacher_disagreement_score":0.8199349,"about_ca_system_score_codex":0.000028316463,"about_ca_system_score_gemma":0.00008219775,"threshold_uncertainty_score":0.6478049},"labels":[],"label_agreement":null},{"id":"W2032410720","doi":"10.1016/j.tcs.2010.11.045","title":"On protein structure alignment under distance constraint","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Constraint (computer-aided design); Sequence (biology); Enhanced Data Rates for GSM Evolution; Mathematical optimization; Matching (statistics); Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.0040224769463836265,"score_gpt":0.22474028448383354,"score_spread":0.2207178075374499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032410720","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.74884546,0.0000050537865,0.24870582,0.00036702582,0.00027607082,0.00020891512,0.000008965345,0.0000146107695,0.0015680527],"genre_scores_gemma":[0.9773554,5.922883e-7,0.02205683,0.00036832475,0.00016602487,0.000006487621,0.00000595138,0.000008570096,0.000031808428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874157,0.000026614225,0.00011280045,0.00046868366,0.0003293057,0.00032105754],"domain_scores_gemma":[0.9992633,0.000011056511,0.00003110027,0.00047896797,0.00006473309,0.0001508626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002951928,0.00013146912,0.0000840323,0.000032380933,0.0001384966,0.000076269986,0.0005166501,0.00006601479,0.00014845788],"category_scores_gemma":[0.000033717806,0.000102626494,0.000034354824,0.00012505447,0.0023024841,0.0000037365846,0.00021844885,0.00015628849,0.000019490688],"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.000007773824,0.000019435216,0.00000885453,0.0000017329128,0.0000027779902,0.0000011071671,0.000010928656,0.00004308193,0.4894256,0.50832117,0.000023841658,0.0021337026],"study_design_scores_gemma":[0.0004571174,0.0005886916,0.00064187485,0.000015646132,0.0000053003705,0.000025310774,0.000011792965,0.004859155,0.81026864,0.18167475,0.0011054274,0.00034629926],"about_ca_topic_score_codex":4.3642535e-7,"about_ca_topic_score_gemma":0.0000017257349,"teacher_disagreement_score":0.32664642,"about_ca_system_score_codex":0.0000136964345,"about_ca_system_score_gemma":0.000062620486,"threshold_uncertainty_score":0.8483599},"labels":[],"label_agreement":null},{"id":"W2032897227","doi":"10.1016/j.tcs.2004.03.041","title":"Quantum computing without entanglement","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":109,"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é de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Quantum entanglement; Quantum; Quantum computer; Computer science; Theoretical computer science; Theoretical physics; Quantum mechanics; Mathematics; Physics","score_opus":0.008001504721208781,"score_gpt":0.25077498416295135,"score_spread":0.24277347944174257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032897227","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.1793654,0.000027253996,0.81601983,0.0020566485,0.0010442128,0.00016875338,7.657408e-7,0.00052304025,0.0007941047],"genre_scores_gemma":[0.6645251,0.0000012445792,0.33443487,0.00080895313,0.0002165147,0.0000016032404,4.642082e-7,0.000009610605,0.0000016307627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962432,0.000086966385,0.00041490945,0.0011096242,0.0010997078,0.0010456373],"domain_scores_gemma":[0.99805796,0.000133192,0.00011493308,0.0010799331,0.00017628618,0.00043767912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001569341,0.00031119896,0.00030166504,0.00026233832,0.00092468964,0.00073820335,0.0035566478,0.000054677577,0.000014055706],"category_scores_gemma":[0.000054686407,0.00024983042,0.00011265218,0.0014623404,0.0019550258,0.0004583652,0.002133815,0.00037462657,0.00012036977],"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.0000027786043,0.000085139196,0.00005813959,0.0000056829185,0.0000048165016,0.00002924453,0.0008286314,0.0135054905,0.00044226923,0.93659604,0.000009128799,0.048432663],"study_design_scores_gemma":[0.00045433178,0.00026438382,0.0007067863,0.000063101885,0.00000317694,0.0001411866,0.000007104252,0.76211596,0.003167511,0.23265044,0.00011322285,0.0003128036],"about_ca_topic_score_codex":0.000010973892,"about_ca_topic_score_gemma":5.62029e-7,"teacher_disagreement_score":0.74861044,"about_ca_system_score_codex":0.00014579772,"about_ca_system_score_gemma":0.0002519785,"threshold_uncertainty_score":0.9999954},"labels":[],"label_agreement":null},{"id":"W2033907672","doi":"10.1016/j.tcs.2015.03.032","title":"Implementation and Application of Automata (CIAA 2013)","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Automaton; Computer science; Mathematics; Programming language; Combinatorics; Theoretical computer science","score_opus":0.012025747789734299,"score_gpt":0.2805018736190902,"score_spread":0.26847612582935587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033907672","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.023025831,0.000026624539,0.97443795,0.0008779255,0.00018952011,0.00029328384,7.543079e-7,0.000113231676,0.0010348675],"genre_scores_gemma":[0.84443545,0.0000067657143,0.15525794,0.00023669317,0.000040693056,0.00001607569,0.0000011303182,0.000003478389,0.0000017503161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830025,0.00007280767,0.00024961564,0.00048386373,0.00060710276,0.00028634677],"domain_scores_gemma":[0.9987458,0.00006937689,0.00010156727,0.0007108488,0.00015290237,0.00021952047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624946,0.00010442289,0.00012680337,0.00013536618,0.00010372431,0.0001491828,0.0012535361,0.00002038882,0.000006816185],"category_scores_gemma":[0.000012489317,0.00009143329,0.000019669802,0.00076269155,0.0009486957,0.00052400015,0.0011509273,0.00005445488,0.000025364143],"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.0000023049854,0.000018748922,0.00016500875,0.0000049928117,0.0000017789465,8.779906e-7,0.00015938413,0.0003810064,0.00007922053,0.76321024,0.00027246308,0.23570396],"study_design_scores_gemma":[0.0003296072,0.00020102454,0.0015034156,0.000006521728,0.0000044998246,0.0000060219672,0.000018680586,0.910074,0.0016556879,0.085373685,0.00071164913,0.00011520973],"about_ca_topic_score_codex":0.000030520965,"about_ca_topic_score_gemma":0.000003216591,"teacher_disagreement_score":0.909693,"about_ca_system_score_codex":0.000063847736,"about_ca_system_score_gemma":0.00008873076,"threshold_uncertainty_score":0.37285414},"labels":[],"label_agreement":null},{"id":"W2034395812","doi":"10.1016/j.tcs.2015.01.055","title":"Lemmings is PSPACE-complete","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Creatures; Computer science; Mathematical economics; Artificial intelligence; Mathematics; Biology","score_opus":0.05312825676127521,"score_gpt":0.30303378698114386,"score_spread":0.24990553021986867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034395812","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.019675568,0.00003232592,0.9610923,0.0062863263,0.0012167637,0.00014716083,0.0000012704788,0.00037351644,0.011174802],"genre_scores_gemma":[0.78087974,0.0000014953237,0.2164934,0.002374866,0.00018741799,0.000004981829,1.9484388e-7,0.00000862422,0.00004928054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644524,0.00009547208,0.00035298718,0.0009645579,0.0012953457,0.0008464017],"domain_scores_gemma":[0.9971799,0.00021453413,0.00008671846,0.0013176453,0.000491393,0.0007097795],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002072223,0.00023326215,0.00024259188,0.0002298387,0.00035120916,0.0008422631,0.004736062,0.000061803374,0.000072129114],"category_scores_gemma":[0.00024316988,0.00019570271,0.00008012916,0.0016359309,0.0039942884,0.0012681956,0.0019526689,0.00023817837,0.0015067422],"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.0000040708705,0.000032615935,0.00008961804,0.0000017067695,0.0000021954515,0.0000141365945,0.0025945173,0.00008651109,0.00037407424,0.96223253,0.0013654882,0.033202525],"study_design_scores_gemma":[0.00007546812,0.00020443712,0.000095256335,0.000014587323,0.0000024228316,0.000047623773,0.000033185603,0.5265366,0.016500587,0.45182258,0.004389194,0.0002780986],"about_ca_topic_score_codex":0.000017411505,"about_ca_topic_score_gemma":9.339637e-7,"teacher_disagreement_score":0.7612042,"about_ca_system_score_codex":0.00011697775,"about_ca_system_score_gemma":0.00029587658,"threshold_uncertainty_score":0.9992707},"labels":[],"label_agreement":null},{"id":"W2035362312","doi":"10.1016/s0304-3975(02)00725-9","title":"Algorithms for vertex-partitioning problems on graphs with fixed clique-width","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Chordal graph; Independent set; Time complexity; Maximal independent set; Induced subgraph isomorphism problem; Discrete mathematics; Vertex (graph theory); Treewidth; Indifference graph; Clique-width; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.024320585121181022,"score_gpt":0.29363236843299273,"score_spread":0.2693117833118117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035362312","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.010767539,0.000019673475,0.98430616,0.00044784645,0.00033902738,0.0006672669,0.0000027776491,0.00026036447,0.003189348],"genre_scores_gemma":[0.6151882,0.0000028069148,0.3842214,0.0004500469,0.000020807396,0.00008116344,8.6609805e-7,0.000014567678,0.00002013748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961923,0.00022554272,0.0002934909,0.0011727248,0.001007628,0.0011083668],"domain_scores_gemma":[0.99714136,0.0008398187,0.00008467236,0.0011006936,0.0004139075,0.00041955052],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022761817,0.00027728063,0.00026744732,0.0003529005,0.0008776131,0.0005182422,0.0021940442,0.000060378956,0.00002192137],"category_scores_gemma":[0.00020802525,0.00020624968,0.00009240677,0.002110927,0.0031914425,0.0008481994,0.00029458487,0.00030775764,0.000043429118],"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.000031913834,0.00009930636,0.00007756023,0.000011465459,0.00000666106,0.000007441754,0.00019201223,0.0010678575,0.00030457118,0.9814135,0.000028872098,0.016758848],"study_design_scores_gemma":[0.0006200015,0.0014848898,0.0001655222,0.00007032504,0.0000035152796,0.00004046243,0.000006827567,0.18538153,0.01127923,0.8003318,0.00030446448,0.00031148584],"about_ca_topic_score_codex":7.256156e-7,"about_ca_topic_score_gemma":5.444702e-7,"teacher_disagreement_score":0.60442066,"about_ca_system_score_codex":0.000079490936,"about_ca_system_score_gemma":0.00021967203,"threshold_uncertainty_score":0.9995213},"labels":[],"label_agreement":null},{"id":"W2035637517","doi":"10.1016/j.tcs.2007.09.031","title":"On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Split graph; Chordal graph; Mathematics; Combinatorics; Clique problem; Treewidth; Cograph; Independent set; Clique graph; Block graph; Perfect graph; Discrete mathematics; Graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.00919946598330105,"score_gpt":0.27909322103857703,"score_spread":0.26989375505527596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035637517","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.055539876,0.00008252193,0.93337923,0.0014987186,0.00032949436,0.0005586692,0.0000027735957,0.00023378004,0.008374952],"genre_scores_gemma":[0.8997304,0.000018118919,0.098902315,0.0012266707,0.00006319673,0.000016113481,6.003047e-7,0.000014684493,0.000027899316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995487,0.00039458976,0.00040067857,0.0011104628,0.0013111241,0.0012961657],"domain_scores_gemma":[0.99600786,0.0017745501,0.0000963265,0.0013480124,0.0002532097,0.0005200608],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.009802774,0.00030346442,0.00031536393,0.0003702579,0.0010437311,0.0008257877,0.0036210674,0.00008397918,0.000020505071],"category_scores_gemma":[0.00015668674,0.00018751042,0.00009181525,0.002579253,0.010275148,0.0009340592,0.0016947694,0.0006510518,0.00006276813],"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.00016605912,0.000043582248,0.00006345053,0.000006378037,0.000006540928,0.000019927513,0.0006016826,0.000058305617,0.00015153739,0.98243386,0.00012400438,0.016324662],"study_design_scores_gemma":[0.0008282392,0.00036419384,0.00033434056,0.000025081708,0.0000032210771,0.000063630396,0.000009835626,0.056181755,0.003087253,0.9383725,0.00047244996,0.00025747952],"about_ca_topic_score_codex":0.000007505128,"about_ca_topic_score_gemma":0.0000025956222,"teacher_disagreement_score":0.84419054,"about_ca_system_score_codex":0.00006802562,"about_ca_system_score_gemma":0.0001506412,"threshold_uncertainty_score":0.9924183},"labels":[],"label_agreement":null},{"id":"W2036162092","doi":"10.1016/s0304-3975(00)00063-3","title":"Repetitions in Sturmian strings","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Fibonacci number; Sequence (biology); Prefix; Reduction (mathematics); String (physics); Combinatorics; Discrete mathematics; Simple (philosophy); Integer (computer science); Exponent; Algorithm; Computer science","score_opus":0.005278285371736694,"score_gpt":0.2255655579966955,"score_spread":0.2202872726249588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036162092","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.36520708,0.000028423674,0.60246193,0.002006044,0.00030608778,0.00015907468,0.0000014724952,0.00040024272,0.029429639],"genre_scores_gemma":[0.93607914,0.00000799625,0.062946886,0.0008467969,0.00006725506,0.000006165971,4.1647328e-7,0.0000051670268,0.000040171693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979266,0.00008363991,0.00025839725,0.00067770097,0.00048253228,0.00057115476],"domain_scores_gemma":[0.99868953,0.00015076259,0.000027697839,0.0008801266,0.000046909325,0.00020498667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012439043,0.00014276634,0.00015949423,0.00021023465,0.00025089318,0.00038917203,0.0024754866,0.000041118892,0.00039367753],"category_scores_gemma":[0.000030901232,0.000121733974,0.00004777043,0.0015977904,0.0014976886,0.00086212397,0.00044006042,0.00020186612,0.00030751043],"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.0000021906314,0.000047431746,0.000043270273,0.0000014832035,6.289216e-7,0.00002290631,0.00023811651,0.00009909276,0.00012771769,0.83931863,0.000023448132,0.16007507],"study_design_scores_gemma":[0.00031843924,0.00011433127,0.010560203,0.00005631097,0.0000015365052,0.000080400576,0.00000820141,0.42752287,0.0015168036,0.5585725,0.0009395908,0.00030885663],"about_ca_topic_score_codex":0.000008418067,"about_ca_topic_score_gemma":0.0000018085777,"teacher_disagreement_score":0.57087207,"about_ca_system_score_codex":0.000059428177,"about_ca_system_score_gemma":0.0000818873,"threshold_uncertainty_score":0.5518296},"labels":[],"label_agreement":null},{"id":"W2037067117","doi":"10.1016/j.tcs.2014.08.008","title":"The worst case behavior of randomized gossip protocols","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Gossip; Rumor; Computer science; Node (physics); Phone; Gossip protocol; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Randomness; Mathematics; Artificial intelligence; Statistics","score_opus":0.014456712512052642,"score_gpt":0.27928492875888133,"score_spread":0.2648282162468287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037067117","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.0047364016,0.000013692671,0.985483,0.00047199728,0.00045731082,0.0037211431,7.842783e-7,0.00010641529,0.0050092726],"genre_scores_gemma":[0.9424273,0.0000019592726,0.056305967,0.00022734702,0.00013892529,0.0008674195,2.0890644e-7,0.000006822122,0.000024063631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690604,0.0004973373,0.0006388672,0.0005612059,0.0007978056,0.0005987148],"domain_scores_gemma":[0.9956537,0.0021929834,0.00022332951,0.0013149241,0.00030515087,0.00030992943],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0077911564,0.00019849539,0.0005088465,0.00008724527,0.0007974552,0.0005817824,0.002721752,0.00006144791,0.000017534057],"category_scores_gemma":[0.00012806291,0.00011357855,0.00017087157,0.00076826924,0.008134728,0.00031704057,0.00096106285,0.00022598048,0.000022146907],"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.00022884026,0.000046780187,0.0000088907545,0.0000039825336,0.0000034167763,0.00006624793,0.00013865458,0.000014026605,0.000017343064,0.831326,0.000036028177,0.16810977],"study_design_scores_gemma":[0.0057756538,0.00014816286,0.00001640757,0.00003668511,0.0000140539005,0.0005583699,0.000003982677,0.90322,0.00032249556,0.089549966,0.00019041508,0.00016380404],"about_ca_topic_score_codex":0.000005241139,"about_ca_topic_score_gemma":7.625222e-7,"teacher_disagreement_score":0.9376909,"about_ca_system_score_codex":0.00002187574,"about_ca_system_score_gemma":0.00015154436,"threshold_uncertainty_score":0.99456453},"labels":[],"label_agreement":null},{"id":"W2037872771","doi":"10.1016/s0304-3975(00)00292-9","title":"Minimal cover-automata for finite languages","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"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":"Deterministic automaton; Deterministic finite automaton; Nondeterministic finite automaton; Cover (algebra); Two-way deterministic finite automaton; Büchi automaton; DFA minimization; ω-automaton; Regular language; Quantum finite automata; Finite-state machine; Nested word; Automaton; Mathematics; Discrete mathematics; Computer science; Timed automaton; Automata theory; Theoretical computer science; Algorithm","score_opus":0.010884254074289303,"score_gpt":0.26593739130814764,"score_spread":0.25505313723385836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037872771","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.029225051,0.0000495616,0.9620371,0.0015657269,0.0005254345,0.00022419606,0.000006470128,0.0005192121,0.0058472394],"genre_scores_gemma":[0.8030336,0.000007879313,0.19523467,0.0014162095,0.00021368198,0.000016175174,0.0000019844292,0.000010196141,0.00006560934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975528,0.00006496729,0.00027293785,0.00079259067,0.00056016375,0.0007565017],"domain_scores_gemma":[0.9976035,0.00086048286,0.00007285747,0.0010579762,0.00014383151,0.0002613954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015068192,0.00021145096,0.00023099243,0.0001799845,0.0004246264,0.0006097996,0.0032868288,0.000059071685,0.00006933901],"category_scores_gemma":[0.00019152407,0.00017144783,0.00010364672,0.00094470434,0.0015353422,0.00085612544,0.0010153783,0.00012131582,0.00020136763],"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.0000144020405,0.00006331205,0.00003169626,0.0000065455793,0.000003567015,0.000018702722,0.00021504392,0.00009821014,0.00067214324,0.93053234,0.00032408003,0.06801994],"study_design_scores_gemma":[0.00043704847,0.00029259638,0.00040942372,0.000025309837,0.0000046759783,0.000078838486,0.000011528627,0.8375713,0.0038180843,0.15381944,0.003249617,0.00028212127],"about_ca_topic_score_codex":0.0000020261168,"about_ca_topic_score_gemma":1.914381e-7,"teacher_disagreement_score":0.8374731,"about_ca_system_score_codex":0.000040405874,"about_ca_system_score_gemma":0.000102881575,"threshold_uncertainty_score":0.69914395},"labels":[],"label_agreement":null},{"id":"W2038878443","doi":"10.1016/s0304-3975(03)00422-5","title":"Finding hidden independent sets in interval graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Interval graph; Interval (graph theory); Set (abstract data type); Computer science; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Chordal graph","score_opus":0.011004459878765176,"score_gpt":0.2695621984548484,"score_spread":0.2585577385760832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038878443","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.2027978,0.000023741364,0.78825504,0.0004907928,0.0008850132,0.00010598266,3.371447e-7,0.00015651145,0.007284787],"genre_scores_gemma":[0.8522149,0.0000017223,0.14739914,0.0003317121,0.000026605318,0.0000042466463,2.3313106e-7,0.00000620515,0.000015258097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971974,0.0002806966,0.00030016724,0.0007890232,0.0007306052,0.0007021139],"domain_scores_gemma":[0.9987643,0.00019960775,0.000061838444,0.0006569987,0.00006700991,0.0002502598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026771368,0.00019088245,0.00021551953,0.00041148954,0.0002640606,0.00048036355,0.0022569122,0.000056216366,0.00006405947],"category_scores_gemma":[0.0001853196,0.00016023648,0.00006824093,0.00167165,0.0009060149,0.0005585562,0.00073921785,0.00046249872,0.000093133945],"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.0000015886951,0.000049010974,0.0014775752,0.0000034288682,0.000001576287,0.00004098289,0.0005954136,0.00014722232,0.000071188915,0.94543713,0.0000132684445,0.052161604],"study_design_scores_gemma":[0.0003969447,0.00017648289,0.007739767,0.000053112835,0.0000017013888,0.00012300129,0.000014451816,0.59121704,0.0013183214,0.39849353,0.00014157502,0.0003240781],"about_ca_topic_score_codex":0.000009338649,"about_ca_topic_score_gemma":0.0000016630748,"teacher_disagreement_score":0.6494171,"about_ca_system_score_codex":0.000072178766,"about_ca_system_score_gemma":0.00011820927,"threshold_uncertainty_score":0.6534254},"labels":[],"label_agreement":null},{"id":"W2039091701","doi":"10.1016/s0304-3975(02)00746-6","title":"A note on differentiable palindromes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differentiable function; Mathematics; Palindrome; Combinatorics; Discrete mathematics; Pure mathematics; Genetics; Biology; Genome","score_opus":0.008319133653806859,"score_gpt":0.23765318785784942,"score_spread":0.22933405420404257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039091701","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.05164478,0.000017941624,0.9303739,0.0004661736,0.00069504697,0.00011063468,7.775889e-7,0.00030277905,0.016387964],"genre_scores_gemma":[0.8970323,0.0000024217804,0.10169086,0.0011714885,0.000049332706,0.000005479137,2.6117038e-7,0.000008056417,0.000039786344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738014,0.00016058901,0.0002264075,0.00080196204,0.0007316899,0.00069922826],"domain_scores_gemma":[0.9980504,0.00035666284,0.00005359531,0.0011674677,0.00007957273,0.00029232516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013662459,0.0002120783,0.0002137611,0.00019247041,0.0004332968,0.00055319886,0.002387494,0.000052622934,0.0001350072],"category_scores_gemma":[0.00013267306,0.00015877603,0.00007903724,0.0010333488,0.0014466812,0.00047625013,0.00048107014,0.00020281196,0.00035805392],"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.0000024095157,0.000080125166,0.000021514088,0.0000028938223,0.0000020280204,0.00001320011,0.00016028018,0.000049028127,0.00052937557,0.98395985,0.000067215646,0.015112066],"study_design_scores_gemma":[0.00028555584,0.00027689527,0.0006077848,0.000035314784,0.0000031238903,0.000060098464,0.0000036460872,0.26809615,0.024006648,0.70548147,0.0008257706,0.00031752512],"about_ca_topic_score_codex":9.1754026e-7,"about_ca_topic_score_gemma":1.0273598e-7,"teacher_disagreement_score":0.8453875,"about_ca_system_score_codex":0.000049900635,"about_ca_system_score_gemma":0.00010099093,"threshold_uncertainty_score":0.6474699},"labels":[],"label_agreement":null},{"id":"W2039194906","doi":"10.1016/j.tcs.2012.12.013","title":"Deterministic quantum non-locality and graph colorings","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":3,"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é de Montréal","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Locality; Quantum; Graph; Telepathy; Parallels; Class (philosophy); Computer science; Game theory; Mathematics; Theoretical computer science; Mathematical economics; Discrete mathematics; Combinatorics; Artificial intelligence; Physics; Quantum mechanics; Economics","score_opus":0.010531405984185225,"score_gpt":0.2606419009565169,"score_spread":0.2501104949723317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039194906","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.4643879,0.000003650276,0.53402627,0.00008442613,0.000104065104,0.0000671508,0.000003035374,0.000014248367,0.0013092757],"genre_scores_gemma":[0.9971214,5.007807e-7,0.002610431,0.00008797074,0.00015767434,0.000014107376,9.723327e-7,0.000004930578,0.000002036359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999098,0.000016835023,0.00012473707,0.00022906066,0.00016314442,0.00036824186],"domain_scores_gemma":[0.99935305,0.00008155181,0.000032699263,0.00023327606,0.000039765004,0.00025967637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005397799,0.000093369825,0.00010676919,0.000036686244,0.00030808453,0.00008995471,0.00027025197,0.000015082518,0.00006623291],"category_scores_gemma":[0.000004419314,0.000076754,0.000028679538,0.00025752335,0.0011001928,0.00014614894,0.00022654451,0.00009161596,0.000040077986],"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.0000015399118,0.000051424715,0.001085375,0.000002121677,0.0000017531048,1.03472814e-7,0.00008308838,7.049132e-7,0.00038438843,0.9938724,0.000009252188,0.004507821],"study_design_scores_gemma":[0.00009633697,0.00004960857,0.005031926,0.000007397984,0.000008745828,0.0000023594382,0.000019813768,0.123393916,0.0014355168,0.86967653,0.00014614541,0.0001317069],"about_ca_topic_score_codex":0.0000067813207,"about_ca_topic_score_gemma":3.539387e-8,"teacher_disagreement_score":0.5327335,"about_ca_system_score_codex":0.0000072090675,"about_ca_system_score_gemma":0.00002404351,"threshold_uncertainty_score":0.4053706},"labels":[],"label_agreement":null},{"id":"W2039459495","doi":"10.1016/j.tcs.2013.11.010","title":"Approximating the minimum independent dominating set in perturbed graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dominating set; Mathematics; Combinatorics; Set (abstract data type); Maximal independent set; Independent set; Discrete mathematics; Chordal graph; Computer science; Graph; 1-planar graph; Vertex (graph theory)","score_opus":0.015547689309879731,"score_gpt":0.2804480771253872,"score_spread":0.2649003878155075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039459495","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.26810387,0.000028915641,0.7266497,0.0019844202,0.00024995444,0.0005574345,4.683028e-7,0.00012798503,0.0022972785],"genre_scores_gemma":[0.87406594,0.000001981285,0.12522511,0.00057028094,0.000042142266,0.00007255121,3.0334087e-7,0.000010182928,0.00001147895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956881,0.0004426172,0.0004927978,0.00093942246,0.0013049,0.0011322098],"domain_scores_gemma":[0.9966736,0.0013894871,0.00011472293,0.001287471,0.0002623661,0.000272365],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.004815111,0.0002451845,0.00025757478,0.00041951053,0.0006743005,0.0009824213,0.005601953,0.00006291815,0.000060446993],"category_scores_gemma":[0.0005135722,0.0001574775,0.000083255785,0.0029868097,0.003765644,0.0014866889,0.0026828584,0.000635452,0.00012831732],"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.0000036053061,0.000037440026,0.00024604614,0.0000067340898,0.000002242741,0.000009549073,0.0018837821,0.00019189119,0.00164464,0.94811505,0.00001535244,0.047843687],"study_design_scores_gemma":[0.00018649141,0.000062068764,0.0016411785,0.00002382594,6.877961e-7,0.000028055809,0.00008240455,0.5162815,0.0012862452,0.4802542,0.0000053176,0.00014801102],"about_ca_topic_score_codex":0.000015423975,"about_ca_topic_score_gemma":0.0000018637064,"teacher_disagreement_score":0.6059621,"about_ca_system_score_codex":0.000093367176,"about_ca_system_score_gemma":0.00011397945,"threshold_uncertainty_score":0.9997782},"labels":[],"label_agreement":null},{"id":"W2039936247","doi":"10.1016/j.tcs.2005.07.014","title":"Graph exploration by a finite automaton","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":176,"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 en Outaouais","funders":"","keywords":"Traverse; Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Butterfly graph; Robot; Regular graph; Upper and lower bounds; Voltage graph; Computer science; Line graph; Artificial intelligence","score_opus":0.013465128249734063,"score_gpt":0.2579631548572839,"score_spread":0.24449802660754982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039936247","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.0010176881,0.000021850343,0.9868971,0.007342363,0.00020315501,0.00015057673,0.0000011026467,0.00043038206,0.003935797],"genre_scores_gemma":[0.6760599,0.00001242065,0.32239148,0.0014256039,0.00005873931,0.000009546527,0.0000016822945,0.000005002157,0.00003564327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787575,0.00010054671,0.00024219566,0.000565295,0.0007259984,0.00049021776],"domain_scores_gemma":[0.9987361,0.0001419702,0.000050388666,0.00059829594,0.00018201144,0.00029127783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011140794,0.00013633724,0.00012347949,0.00020251518,0.00039593678,0.00070065836,0.0018239318,0.00004139156,0.00007726756],"category_scores_gemma":[0.00006377375,0.00011474112,0.00004361604,0.0014388484,0.0011682167,0.0022993905,0.00056157477,0.00014759878,0.00028339776],"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.0000015549876,0.00005458294,0.0000053868557,0.0000018623978,0.0000012041589,0.0000011460821,0.00046586385,0.0058667953,0.00032721309,0.9339461,0.00087496586,0.05845338],"study_design_scores_gemma":[0.00017241423,0.00009950474,0.00001839989,0.000008922168,8.4336085e-7,0.0000059984586,0.0000025158263,0.9257401,0.003574315,0.06817894,0.002044458,0.00015358695],"about_ca_topic_score_codex":0.0000010805636,"about_ca_topic_score_gemma":3.4340204e-7,"teacher_disagreement_score":0.9198733,"about_ca_system_score_codex":0.000045187557,"about_ca_system_score_gemma":0.000090718226,"threshold_uncertainty_score":0.6756465},"labels":[],"label_agreement":null},{"id":"W2040122307","doi":"10.1016/j.tcs.2011.05.021","title":"Shortest paths between shortest paths","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"K shortest path routing; Shortest path problem; Shortest Path Faster Algorithm; Combinatorics; Yen's algorithm; Euclidean shortest path; Mathematics; Distance; Sequence (biology); Vertex (graph theory); Control reconfiguration; Floyd–Warshall algorithm; Longest path problem; Discrete mathematics; Graph; Computer science; Dijkstra's algorithm; Biology","score_opus":0.03888412546932748,"score_gpt":0.2914092214865761,"score_spread":0.25252509601724865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040122307","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.048215672,0.000035658606,0.9348867,0.00024407935,0.00050409476,0.00033004064,0.000006137948,0.0005297363,0.015247907],"genre_scores_gemma":[0.80959433,0.000005700123,0.18987802,0.0002844902,0.00017959808,0.000017533735,0.0000013538195,0.000020867497,0.00001812749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944699,0.00027508606,0.00053279445,0.0015813734,0.0015561152,0.0015847684],"domain_scores_gemma":[0.9956252,0.00063184707,0.000103005776,0.0022941337,0.00041798892,0.00092781434],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032609382,0.000396801,0.0004295266,0.00047619356,0.0007417792,0.00046166888,0.007635751,0.00011435017,0.00016551507],"category_scores_gemma":[0.00024187063,0.00033121402,0.00014811732,0.0029017108,0.006629492,0.0016764265,0.0032855957,0.00059793255,0.0004363696],"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.000007736511,0.00009745499,0.0031761709,0.0000036539925,0.000007016323,0.00007077055,0.000775256,0.000010908795,0.00035198432,0.9191293,0.0000235606,0.07634618],"study_design_scores_gemma":[0.00028073697,0.0007380388,0.022533672,0.000044403434,0.00001042179,0.000073928044,0.000018588007,0.081242956,0.011388638,0.88279945,0.00018064973,0.00068853045],"about_ca_topic_score_codex":0.0000066940406,"about_ca_topic_score_gemma":9.914463e-7,"teacher_disagreement_score":0.76137865,"about_ca_system_score_codex":0.00009597539,"about_ca_system_score_gemma":0.00024722697,"threshold_uncertainty_score":0.999914},"labels":[],"label_agreement":null},{"id":"W2040262311","doi":"10.1016/j.tcs.2012.01.013","title":"A Gray code for fixed-density necklaces and Lyndon words in constant amortized time","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Guelph","funders":"","keywords":"De Bruijn sequence; Gray code; Amortized analysis; Mathematics; Combinatorics; Constant (computer programming); Binary number; Code (set theory); Polyomino; Discrete mathematics; Algorithm; Data structure; Arithmetic; Computer science; Set (abstract data type); Geometry","score_opus":0.00957280733346831,"score_gpt":0.25514893121650056,"score_spread":0.24557612388303227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040262311","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.14873473,0.00008591694,0.84960055,0.00042498476,0.00037399435,0.00027302274,0.000009152912,0.00010121851,0.0003964101],"genre_scores_gemma":[0.7699088,0.0000057944,0.22969788,0.00027855116,0.00008485714,0.000010213295,0.0000015345574,0.0000050541958,0.000007320192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978343,0.000100408215,0.0002818612,0.00060332665,0.00044038182,0.0007396901],"domain_scores_gemma":[0.9984227,0.00045668188,0.00007486154,0.0005974925,0.00009314488,0.0003551607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021595357,0.00018649091,0.0002850751,0.0001594549,0.00031603896,0.0003359932,0.001221785,0.00005761472,0.00001803009],"category_scores_gemma":[0.0001119624,0.00014073876,0.000041739124,0.00062182866,0.0016964732,0.0011795447,0.0013580889,0.0001463056,0.000022063183],"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.00003477988,0.00010627114,0.0010205376,0.000010402735,0.0000022038305,0.000006469925,0.0006602316,0.000013248068,0.0017168534,0.9628594,0.00019908446,0.033370536],"study_design_scores_gemma":[0.00067845464,0.00015142138,0.003827511,0.0000544968,0.000004446381,0.000055048225,0.000008261227,0.9371369,0.0027814112,0.054682974,0.0003498531,0.00026924297],"about_ca_topic_score_codex":0.000006447243,"about_ca_topic_score_gemma":0.0000019261709,"teacher_disagreement_score":0.93712366,"about_ca_system_score_codex":0.00004414668,"about_ca_system_score_gemma":0.00007606014,"threshold_uncertainty_score":0.62507266},"labels":[],"label_agreement":null},{"id":"W2040979981","doi":"10.1016/j.tcs.2009.02.033","title":"On two open problems of 2-interval patterns","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Mathematics; Interval (graph theory); Combinatorics; Time complexity; Cardinality (data modeling); Pattern matching; Discrete mathematics; Matching (statistics); Clique; Algorithm; Computer science; Artificial intelligence","score_opus":0.016823842560171616,"score_gpt":0.2936831268212049,"score_spread":0.2768592842610333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040979981","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.02884775,0.000007499826,0.9646576,0.00086033193,0.00036047667,0.00022900682,0.0000043022583,0.000082589686,0.0049504433],"genre_scores_gemma":[0.8750889,0.0000018918156,0.12390033,0.0009423305,0.000052841653,0.0000026324349,0.0000011092216,0.0000034776845,0.0000065372265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775857,0.000084202606,0.00030919275,0.0007112937,0.00070399715,0.000432732],"domain_scores_gemma":[0.9982037,0.00013743108,0.00010339872,0.001196952,0.000140397,0.00021810093],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011197653,0.00016612369,0.00024871112,0.00013885481,0.0002190114,0.00057427026,0.006683903,0.000029517252,0.000047823974],"category_scores_gemma":[0.000036370326,0.00011964688,0.000054826865,0.00063785625,0.0006652156,0.0010631969,0.002475122,0.00016604802,0.000039322076],"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.000008430364,0.00013636597,0.0000185631,0.000003033652,0.0000012537531,0.000005980891,0.00014714232,0.0002459589,0.00043095896,0.88232476,0.000080896156,0.11659666],"study_design_scores_gemma":[0.00041536705,0.001042522,0.001940203,0.00016299568,0.0000018007631,0.000018482488,0.0000015582036,0.5774419,0.00578967,0.41293216,0.00006664061,0.00018674896],"about_ca_topic_score_codex":0.000013489004,"about_ca_topic_score_gemma":4.90446e-7,"teacher_disagreement_score":0.8462411,"about_ca_system_score_codex":0.000029328416,"about_ca_system_score_gemma":0.00007537674,"threshold_uncertainty_score":0.9986904},"labels":[],"label_agreement":null},{"id":"W2041043686","doi":"10.1016/j.tcs.2014.09.016","title":"Public-key cryptography based on bounded quantum reference frames","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Canada Foundation for Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Public-key cryptography; Quantum cryptography; Computer science; Cryptographic protocol; Cryptography; Digital signature; Bounded function; Authentication (law); Theoretical computer science; Key (lock); Protocol (science); Computer security; Mathematics; Quantum; Quantum information; Encryption; Hash function; Physics; Quantum mechanics","score_opus":0.020345907675312143,"score_gpt":0.24027860100324214,"score_spread":0.21993269332793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041043686","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.0075486423,0.0000056652343,0.9414415,0.004422363,0.00067047577,0.00016206731,0.000001775571,0.00061872427,0.045128785],"genre_scores_gemma":[0.82769144,0.0000021060202,0.16390432,0.008305463,0.00007147253,0.000013015573,0.0000023228783,0.000008788085,0.0000010529877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958747,0.00024893403,0.00047389808,0.0008842515,0.0015633072,0.0009549283],"domain_scores_gemma":[0.996395,0.00067924935,0.00015548739,0.0017265566,0.00042999268,0.0006137248],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002483201,0.00032985845,0.00029573333,0.00094528584,0.00085378106,0.0019230752,0.0043130456,0.000113093985,0.00011763712],"category_scores_gemma":[0.00032183292,0.00026157827,0.00016627296,0.0033425286,0.0034043323,0.0014580311,0.00056703924,0.0004193455,0.0003626007],"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.000008957389,0.000098627504,0.000105250714,0.0000074296995,0.0000027651643,0.0000012391374,0.00013824509,0.00010237963,0.000041445877,0.97672427,0.00023936221,0.022530032],"study_design_scores_gemma":[0.00024751772,0.00038704037,0.00094796246,0.000021458607,0.0000016966156,0.000004120293,0.0000035020666,0.61533797,0.00045874296,0.37802818,0.0043038363,0.00025799897],"about_ca_topic_score_codex":0.0000023991179,"about_ca_topic_score_gemma":4.852092e-7,"teacher_disagreement_score":0.8201428,"about_ca_system_score_codex":0.00003939037,"about_ca_system_score_gemma":0.00019023032,"threshold_uncertainty_score":0.99998367},"labels":[],"label_agreement":null},{"id":"W2041156108","doi":"10.1016/s0304-3975(03)00086-0","title":"Palindrome recognition using a multidimensional tape","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Turing machine; Computer science; Mathematics; Turing; Algorithm; Theoretical computer science; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics; Programming language","score_opus":0.025244452198185517,"score_gpt":0.2659925015108236,"score_spread":0.24074804931263807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041156108","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.08144954,0.00002456716,0.91647565,0.00009330059,0.00079354714,0.00011374825,0.000002924427,0.00013498683,0.00091172755],"genre_scores_gemma":[0.47975743,0.0000014912964,0.51994497,0.00024378467,0.000043426822,0.0000017792638,0.000001206307,0.0000043016703,0.0000016461878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975246,0.0001616015,0.00025758124,0.0007625065,0.0007553508,0.00053834694],"domain_scores_gemma":[0.9985114,0.00017096377,0.00007137353,0.0007329274,0.00021521162,0.00029814942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013333696,0.00017566569,0.00017166526,0.00017361632,0.00057307485,0.0002936792,0.0011464021,0.000056005087,0.00010629663],"category_scores_gemma":[0.000120985234,0.00014112392,0.000056353696,0.0009956986,0.0011041309,0.0010672628,0.0007395068,0.00018106432,0.00014368306],"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.0000032402768,0.00007577791,0.000020830319,0.0000028790905,0.0000022749514,0.000023069631,0.00009735961,0.00017677528,0.0025369467,0.9562525,0.000022246799,0.040786058],"study_design_scores_gemma":[0.00027006067,0.00009497579,0.00020385833,0.000039326227,0.0000033150397,0.00021160691,0.000003063915,0.8694243,0.0068195085,0.122396246,0.000288436,0.00024530062],"about_ca_topic_score_codex":0.0000038948792,"about_ca_topic_score_gemma":1.0066222e-7,"teacher_disagreement_score":0.8692475,"about_ca_system_score_codex":0.00005692557,"about_ca_system_score_gemma":0.00017683262,"threshold_uncertainty_score":0.5754866},"labels":[],"label_agreement":null},{"id":"W2041241584","doi":"10.1016/j.tcs.2014.07.013","title":"Exploring an unknown dangerous graph with a constant number of tokens","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Asynchronous communication; Security token; Computer science; Constant (computer programming); Graph; Node (physics); Protocol (science); Theoretical computer science; Simple (philosophy); Computer network","score_opus":0.040970488097334945,"score_gpt":0.2704389198655607,"score_spread":0.22946843176822573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041241584","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.057850413,0.000002185997,0.931842,0.00030280504,0.00016694401,0.00011981196,5.575396e-7,0.00014763304,0.009567633],"genre_scores_gemma":[0.6615997,0.000003969337,0.3381767,0.00017893898,0.000025999549,0.0000061502,3.2688814e-7,0.0000049098894,0.0000033080553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783516,0.0001666352,0.0002374871,0.00054916024,0.00073688745,0.00047464875],"domain_scores_gemma":[0.9982763,0.0001688401,0.00006867145,0.0008100077,0.00033594537,0.0003402369],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001411431,0.00014297511,0.0002011657,0.00014848773,0.0002382839,0.00026669537,0.0016972054,0.000023698027,0.000025656735],"category_scores_gemma":[0.000045272427,0.000102839826,0.00003345854,0.0013168668,0.0027797224,0.0013187643,0.00048358546,0.00014026156,0.00002202927],"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.000007025185,0.00006380834,0.00015115448,0.0000070611104,0.000002461621,0.000003295648,0.00075879664,0.0013243344,0.00015580507,0.96655965,0.0000029915211,0.0309636],"study_design_scores_gemma":[0.00043339957,0.00066697365,0.00033915116,0.00006406736,0.0000037919176,0.00007373205,0.000016585953,0.9186074,0.0034698967,0.07586296,0.00018528572,0.0002767609],"about_ca_topic_score_codex":0.0000051864376,"about_ca_topic_score_gemma":0.0000012659268,"teacher_disagreement_score":0.91728306,"about_ca_system_score_codex":0.000019580959,"about_ca_system_score_gemma":0.000104131315,"threshold_uncertainty_score":0.99993414},"labels":[],"label_agreement":null},{"id":"W2041342760","doi":"10.1016/j.tcs.2006.11.019","title":"RealLife: The continuum limit of Larger than Life cellular automata","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Cellular automaton; Limit (mathematics); Conjecture; Infinity; Euclidean geometry; Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Algorithm","score_opus":0.006382036356419492,"score_gpt":0.21267497150496656,"score_spread":0.20629293514854707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041342760","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.07921102,0.00007440507,0.90963405,0.0039569885,0.00027359155,0.00023980437,0.0000041072008,0.00026808374,0.006337973],"genre_scores_gemma":[0.9587747,0.0000037958225,0.040578935,0.00039349566,0.00016828025,0.000013881694,0.0000029767627,0.000008878804,0.00005504474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997454,0.00011600111,0.00043502013,0.00063214806,0.00081632065,0.0005465493],"domain_scores_gemma":[0.99735737,0.00032817977,0.00015225784,0.0017779341,0.00020157639,0.00018267937],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015985554,0.00018706359,0.00023709775,0.000111973255,0.00047164017,0.00037954244,0.0042480393,0.00005596238,0.000029804924],"category_scores_gemma":[0.000058162095,0.00012386461,0.00011418081,0.0013787069,0.0028480936,0.00038278694,0.0012535425,0.00017988814,0.000100278216],"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.000001854288,0.000104556464,0.00010050151,0.0000054581333,0.000003357096,0.0000036174738,0.000109561544,0.000047382142,0.008419303,0.98779464,0.00092275837,0.0024870052],"study_design_scores_gemma":[0.0003421585,0.00010995281,0.011579425,0.00002721226,0.000015586404,0.000025469224,0.000008156682,0.72209626,0.055378806,0.20633887,0.003746398,0.00033168544],"about_ca_topic_score_codex":0.00002932413,"about_ca_topic_score_gemma":0.0000035414516,"teacher_disagreement_score":0.8795637,"about_ca_system_score_codex":0.000023138698,"about_ca_system_score_gemma":0.00017548486,"threshold_uncertainty_score":0.9998656},"labels":[],"label_agreement":null},{"id":"W2041784286","doi":"10.1016/j.tcs.2014.10.027","title":"Algorithmic correspondence for intuitionistic modal mu-calculus","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Research Foundation","keywords":"Soundness; Mathematics; Focus (optics); Modal; Calculus (dental); Algebraic number; Intuitionistic logic; Interpretation (philosophy); Algebra over a field; Discrete mathematics; Modal logic; Pure mathematics; Computer science; Propositional calculus; Programming language","score_opus":0.008760041303592257,"score_gpt":0.24834116186091518,"score_spread":0.23958112055732292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041784286","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.0032377888,0.00002172532,0.9860686,0.00055536407,0.0016753892,0.00030705513,0.0000027787455,0.0003261581,0.0078051477],"genre_scores_gemma":[0.7898423,0.000001433206,0.20907389,0.0005796749,0.00037544488,0.000032182717,0.0000011605995,0.000009365825,0.00008457386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969342,0.0001549864,0.00032254355,0.0010450043,0.0006681494,0.00087511237],"domain_scores_gemma":[0.9972166,0.00089908886,0.00009286408,0.0009815836,0.00039949387,0.00041036893],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024291782,0.00025374308,0.0002906875,0.00019234935,0.00084139715,0.0007867224,0.003478353,0.0000838201,0.000038269318],"category_scores_gemma":[0.00064534554,0.00020607327,0.000112171154,0.0009143748,0.0028014572,0.0006384734,0.0010437218,0.00020469281,0.0002736871],"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.000010797814,0.000055537133,0.00001108988,0.000009382976,0.000002335226,0.0000032748342,0.00022001119,0.00012183504,0.00030764122,0.92517793,0.00012320103,0.07395696],"study_design_scores_gemma":[0.00028688545,0.00035221875,0.0001903202,0.000017712548,0.0000044973776,0.00004011937,0.0000019461668,0.6588436,0.0012941343,0.3381595,0.0005891744,0.00021993167],"about_ca_topic_score_codex":0.000002897669,"about_ca_topic_score_gemma":7.432089e-7,"teacher_disagreement_score":0.7866045,"about_ca_system_score_codex":0.00009586081,"about_ca_system_score_gemma":0.00020650226,"threshold_uncertainty_score":0.9999123},"labels":[],"label_agreement":null},{"id":"W2041801901","doi":"10.1016/j.tcs.2007.11.020","title":"Another proof of Soittola’s theorem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"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; Mathematical proof; Formal power series; Analytic proof; Power series; Discrete mathematics; Algebraic number; Formal proof; Series (stratigraphy); Algebra over a field; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.008936159004620844,"score_gpt":0.24335869651830644,"score_spread":0.23442253751368558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041801901","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.055653185,0.000039764418,0.9288365,0.00036989045,0.00046582104,0.00015059694,6.6768945e-7,0.00018433928,0.0142992195],"genre_scores_gemma":[0.8549079,8.576239e-7,0.14437146,0.0006006652,0.00009338582,0.0000015742597,1.5987634e-7,0.0000090224485,0.00001497994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997348,0.00007472023,0.00041300472,0.00063838845,0.0008174499,0.0007084268],"domain_scores_gemma":[0.99795395,0.00039367835,0.0001269454,0.0011272623,0.00020048651,0.00019765556],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00462957,0.0001911243,0.00025359646,0.00026246093,0.00019981613,0.0001622497,0.0033432855,0.00006283854,0.000060059672],"category_scores_gemma":[0.00008277923,0.0001437942,0.000092401766,0.0013717205,0.0036203198,0.00061953225,0.0010129093,0.00016439543,0.000028507471],"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.0000097933935,0.000076923956,0.00006272303,0.0000071307595,0.0000033665774,0.000010530021,0.00044735998,0.000018416373,0.0038537453,0.8942394,0.000031635995,0.10123896],"study_design_scores_gemma":[0.00025321977,0.0002496668,0.0016827978,0.00004230985,0.000003831125,0.000055599412,0.000014797805,0.1398483,0.24601656,0.6113389,0.00022257835,0.00027144534],"about_ca_topic_score_codex":0.0000026834798,"about_ca_topic_score_gemma":4.0135598e-7,"teacher_disagreement_score":0.7992547,"about_ca_system_score_codex":0.000039868617,"about_ca_system_score_gemma":0.00011299476,"threshold_uncertainty_score":0.99909127},"labels":[],"label_agreement":null},{"id":"W2042079117","doi":"10.1016/s0304-3975(02)00853-8","title":"A recognition and parsing algorithm for arbitrary conjunctive grammars","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"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":"L-attributed grammar; Parsing expression grammar; Indexed grammar; Context-free grammar; Parsing; Computer science; Phrase structure grammar; Context-sensitive grammar; Time complexity; Algorithm; Tree-adjoining grammar; Rule-based machine translation; Definite clause grammar; Mathematics; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.017969218265562234,"score_gpt":0.24748096050476134,"score_spread":0.22951174223919912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042079117","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.33113357,0.000053742584,0.6678456,0.00003646651,0.00012972424,0.00012605246,0.000004784797,0.000012029942,0.00065802207],"genre_scores_gemma":[0.78565776,0.000006708828,0.21371657,0.0004981319,0.00009806598,0.000005252454,0.000010235957,0.0000040294585,0.000003234933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990587,0.00006234784,0.00010847907,0.00040701963,0.000088146706,0.00027530282],"domain_scores_gemma":[0.999593,0.00006425936,0.000028205375,0.00011265588,0.00009342791,0.00010845964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503992,0.00009659639,0.00009330217,0.00002595479,0.00021160586,0.000063955056,0.00013344616,0.00005993181,0.0000052202436],"category_scores_gemma":[0.00012959515,0.00007398391,0.00003773953,0.00011337212,0.0012745238,0.000006002926,0.00009992702,0.00005903668,0.000002550846],"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.00004741211,0.00007280635,0.000116601914,0.000008984434,0.000012650494,0.0000027947913,0.000046813086,0.0000036449997,0.06612735,0.19444399,0.00003667156,0.7390803],"study_design_scores_gemma":[0.0012134537,0.002737013,0.0005909078,0.000046639198,0.00002633904,0.00014795564,0.000051077877,0.06253785,0.27475128,0.6549114,0.002340272,0.0006458083],"about_ca_topic_score_codex":4.283908e-7,"about_ca_topic_score_gemma":8.662348e-8,"teacher_disagreement_score":0.7384345,"about_ca_system_score_codex":0.0000063422917,"about_ca_system_score_gemma":0.00003495393,"threshold_uncertainty_score":0.4696036},"labels":[],"label_agreement":null},{"id":"W2043112783","doi":"10.1016/j.tcs.2008.09.061","title":"Fault-tolerant computation of distributed regular path queries","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computation; Computer science; Path (computing); Fault tolerance; Theoretical computer science; Parallel computing; Distributed computing; Algorithm; Mathematics; Programming language","score_opus":0.0103279312169427,"score_gpt":0.2333992794955134,"score_spread":0.2230713482785707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043112783","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.118796475,0.000076323144,0.87929046,0.00036040277,0.0005101873,0.00018104921,0.000023867202,0.00020026526,0.00056099147],"genre_scores_gemma":[0.92879134,0.0000067041433,0.07098944,0.00011541,0.00006835923,0.0000069485354,0.000008511853,0.000007527544,0.000005732978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684846,0.0001386216,0.0005996456,0.0007450131,0.001083291,0.00058496493],"domain_scores_gemma":[0.99798346,0.00012605714,0.00021071614,0.00085231266,0.0005573721,0.00027009184],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009524528,0.00024086903,0.00042514197,0.0001466725,0.0005345785,0.00016378416,0.0020444468,0.00007496316,0.00000799825],"category_scores_gemma":[0.00007708198,0.0001997561,0.00011281204,0.0017221806,0.003707293,0.0008239156,0.00061044627,0.00017316181,0.000028778208],"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.0000122461715,0.00011613069,0.00023349021,0.000022999096,0.000007089927,0.000047965077,0.0007212833,0.0024905682,0.00091945275,0.98725766,0.00023441153,0.007936718],"study_design_scores_gemma":[0.00049149984,0.0002801506,0.0067844945,0.00011357045,0.0000046575574,0.00023994937,0.00001743979,0.9553971,0.005406959,0.030493604,0.0004112157,0.00035933344],"about_ca_topic_score_codex":0.00001382053,"about_ca_topic_score_gemma":3.4540474e-7,"teacher_disagreement_score":0.95676404,"about_ca_system_score_codex":0.00006277022,"about_ca_system_score_gemma":0.00022073748,"threshold_uncertainty_score":0.99900407},"labels":[],"label_agreement":null},{"id":"W2043253127","doi":"10.1016/j.tcs.2011.08.040","title":"The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Node (physics); Wireless sensor network; Algorithm; Wireless network; Wireless; Computer network; Geographic routing; Routing (electronic design automation); Real-time computing; Distributed computing; Routing protocol; Engineering","score_opus":0.008877635359583953,"score_gpt":0.22069445401295212,"score_spread":0.21181681865336818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043253127","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.03213124,0.00008784424,0.96577233,0.000042481686,0.0006907325,0.000354536,0.000046048575,0.00047203392,0.00040274367],"genre_scores_gemma":[0.9825437,0.0000021816204,0.017189842,0.000057667614,0.000054653385,0.00012457941,0.000010032966,0.000014391394,0.0000029520284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888676,0.0000338668,0.00019505655,0.00024126178,0.0002554674,0.0003876061],"domain_scores_gemma":[0.9991879,0.000304428,0.00003072172,0.00023785631,0.00016151319,0.00007761252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005369541,0.00013551135,0.00013290042,0.000073228795,0.00060758943,0.00017436678,0.00055586273,0.00006887798,0.000009186302],"category_scores_gemma":[0.00002184829,0.00010158021,0.000046564168,0.00033553876,0.0016133836,0.00015279544,0.00007192354,0.00011351754,0.000008199169],"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.000019309087,0.000060556864,0.00002276372,0.000031490996,0.000014996721,0.0000024261287,0.00026007765,0.004733533,0.0019649202,0.95802796,0.00051574287,0.034346253],"study_design_scores_gemma":[0.0002380329,0.00015288526,0.000036621397,0.000027788972,0.000006203559,0.000007422595,0.000051474814,0.96343374,0.028147124,0.0076265507,0.00011575741,0.00015639018],"about_ca_topic_score_codex":0.000002485182,"about_ca_topic_score_gemma":2.2510427e-7,"teacher_disagreement_score":0.95870024,"about_ca_system_score_codex":0.00006801524,"about_ca_system_score_gemma":0.000036371224,"threshold_uncertainty_score":0.5944579},"labels":[],"label_agreement":null},{"id":"W2043304636","doi":"10.1016/j.tcs.2007.04.004","title":"On a zeta function associated with automata and codes","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simplicity; Automaton; Function (biology); Riemann zeta function; Zero (linguistics); Discrete mathematics; Word (group theory); Combinatorics; Cellular automaton; Pure mathematics; Algorithm; Computer science; Physics; Theoretical computer science; Geometry; Quantum mechanics","score_opus":0.006311545731731295,"score_gpt":0.2193332548910603,"score_spread":0.213021709159329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043304636","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.26299307,0.000010374423,0.7329441,0.0002700611,0.00020178503,0.000087725304,8.87307e-7,0.00035328788,0.0031387093],"genre_scores_gemma":[0.9744553,0.0000012101143,0.024338607,0.001140888,0.00004301542,0.0000018667962,9.1157506e-7,0.000007532408,0.0000106910675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782825,0.000071237046,0.00019042751,0.0006675488,0.000684835,0.0005577084],"domain_scores_gemma":[0.99818146,0.00075952563,0.00007146532,0.00062753505,0.000107863154,0.00025216112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002984756,0.00017954262,0.00017891788,0.00019527451,0.00040679448,0.00042186028,0.0011227701,0.000053086307,0.00001345032],"category_scores_gemma":[0.00012022508,0.00012462119,0.000026123726,0.0010125027,0.0020486533,0.00055334036,0.0005018029,0.00017413731,0.000026216474],"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.000027678743,0.000068702604,0.0000663062,0.0000020572377,0.0000059438257,0.00001972599,0.00014215212,0.000028880362,0.0002793631,0.9551342,0.0000482678,0.044176713],"study_design_scores_gemma":[0.00062945246,0.0014082919,0.026752038,0.000104840925,0.0000103556295,0.00007101745,0.000010382235,0.59732765,0.0023025298,0.37098387,0.000044029748,0.00035557488],"about_ca_topic_score_codex":0.00000179335,"about_ca_topic_score_gemma":0.0000012592976,"teacher_disagreement_score":0.7114622,"about_ca_system_score_codex":0.00005103793,"about_ca_system_score_gemma":0.000054505897,"threshold_uncertainty_score":0.75483483},"labels":[],"label_agreement":null},{"id":"W2043865630","doi":"10.1016/j.tcs.2011.09.021","title":"Canonical forms of uptimals","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Order (exchange); Mathematics; Game theory; Canonical form; Publication; Computer science; Mathematical economics; Algebra over a field; Pure mathematics","score_opus":0.039435229842599326,"score_gpt":0.2883830887407444,"score_spread":0.24894785889814508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043865630","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.100778215,0.00001419502,0.8726479,0.0001003697,0.00037293567,0.00010706537,6.2845584e-7,0.00012413356,0.025854595],"genre_scores_gemma":[0.7418763,0.0000019503393,0.2579145,0.0001660371,0.000030048737,0.0000031087081,6.42698e-8,0.0000043799328,0.0000035889898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769646,0.000058987505,0.00042904232,0.00057174737,0.00067867327,0.0005650618],"domain_scores_gemma":[0.9981682,0.00018899761,0.00010271964,0.0010126287,0.0002672963,0.00026020876],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014305451,0.00015064342,0.00022852754,0.00017381313,0.00017102271,0.00010062599,0.003945138,0.00005471467,0.00016439572],"category_scores_gemma":[0.00014255024,0.000114080976,0.000084925305,0.0010607619,0.0049767224,0.0008028005,0.0013442361,0.00015268393,0.00013805504],"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.000006266497,0.00006842721,0.00022703451,0.000003565371,0.0000024736278,0.0000070896353,0.0014976872,0.000014524276,0.00073670497,0.9662866,0.000011505854,0.031138116],"study_design_scores_gemma":[0.000040763283,0.0002548709,0.0016668659,0.000015088031,0.0000028567847,0.000023781284,0.000011576887,0.16952129,0.13537845,0.6928903,0.000026331893,0.00016784933],"about_ca_topic_score_codex":0.000011321107,"about_ca_topic_score_gemma":9.853879e-7,"teacher_disagreement_score":0.6410981,"about_ca_system_score_codex":0.000034822617,"about_ca_system_score_gemma":0.00020509187,"threshold_uncertainty_score":0.99773115},"labels":[],"label_agreement":null},{"id":"W2044141959","doi":"10.1016/s0304-3975(02)00138-x","title":"Two-way finite automata with quantum and classical states","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":183,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum finite automata; Deterministic finite automaton; Deterministic automaton; Probabilistic automaton; Nondeterministic finite automaton; ω-automaton; Finite-state machine; Discrete mathematics; Nested word; Quantum; Computer science; Mathematics; Automaton; Automata theory; Theoretical computer science; Algorithm; Quantum mechanics; Physics","score_opus":0.008223849374187228,"score_gpt":0.22078804490979856,"score_spread":0.21256419553561134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044141959","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.10490277,0.000060712406,0.8890579,0.0041736416,0.0002668186,0.00011777586,0.0000017611598,0.00043902287,0.0009796403],"genre_scores_gemma":[0.79255795,0.000009352331,0.20664898,0.00064654497,0.00011121416,0.0000029556995,4.102207e-7,0.000010083013,0.000012518134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705106,0.00011856953,0.00025532662,0.0010030771,0.00078287174,0.0007891004],"domain_scores_gemma":[0.9979078,0.00058679393,0.00007199502,0.0008778109,0.000115797644,0.00043981202],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00076842797,0.0002786182,0.00027188825,0.00019163605,0.0006171448,0.00085959054,0.0018913285,0.00004314579,0.000029412282],"category_scores_gemma":[0.000050908347,0.00018710607,0.000042270683,0.0011065155,0.0036215154,0.0004839256,0.0012935802,0.000356641,0.00006589821],"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.0000050454532,0.000077914425,0.000052817293,0.0000072448975,0.000005055814,0.00005830138,0.0006919072,0.0037749854,0.00004107279,0.8962919,0.00007428336,0.09891947],"study_design_scores_gemma":[0.00044698067,0.00054766843,0.00063441857,0.0000468375,0.000004115108,0.00018866816,0.000004246122,0.93305033,0.00019676083,0.06434303,0.00023430679,0.00030263525],"about_ca_topic_score_codex":0.0000036400882,"about_ca_topic_score_gemma":5.6284784e-7,"teacher_disagreement_score":0.92927533,"about_ca_system_score_codex":0.000024586861,"about_ca_system_score_gemma":0.00003866113,"threshold_uncertainty_score":0.9990901},"labels":[],"label_agreement":null},{"id":"W2044712489","doi":"10.1016/s0304-3975(01)00303-6","title":"Searching games with errors—fifty years of coping with liars","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":211,"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 en Outaouais","funders":"","keywords":"Computer science; Interactivity; Theoretical computer science; Computation; Algorithm; Multimedia","score_opus":0.016146130903592883,"score_gpt":0.24518310904156276,"score_spread":0.2290369781379699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044712489","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.033092994,0.000017668446,0.9616089,0.0012269603,0.00006359188,0.00016623725,4.8752815e-7,0.00012169453,0.0037014957],"genre_scores_gemma":[0.6838351,0.0000067786796,0.31582186,0.00029507175,0.000015726884,0.000002799997,1.5504835e-7,0.0000059910662,0.000016490698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976901,0.000104531704,0.00019530894,0.0005229441,0.0009776748,0.00050944096],"domain_scores_gemma":[0.9986474,0.00018764896,0.00007061483,0.00062655937,0.00021792596,0.00024987332],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008411097,0.00012870348,0.00018833151,0.00021383887,0.00021029128,0.00030074027,0.0016737025,0.000027240247,0.000060843377],"category_scores_gemma":[0.00003883801,0.00009276959,0.000028039622,0.0015089002,0.0028365885,0.0007199949,0.0005063946,0.00020826829,0.000027100998],"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.000008313949,0.00006202642,0.00013899924,0.000012884714,0.0000054874927,0.000019520932,0.0019567239,0.008462408,0.00010850514,0.9564935,0.000033337365,0.03269828],"study_design_scores_gemma":[0.00038193373,0.00062077446,0.00065831566,0.00009229278,0.000002636812,0.00004999186,0.000012296845,0.98978364,0.0010553913,0.006978513,0.00016383955,0.00020039869],"about_ca_topic_score_codex":0.000005030017,"about_ca_topic_score_gemma":9.91158e-7,"teacher_disagreement_score":0.9813212,"about_ca_system_score_codex":0.000028076109,"about_ca_system_score_gemma":0.000085156134,"threshold_uncertainty_score":0.9998771},"labels":[],"label_agreement":null},{"id":"W2045152465","doi":"10.1016/j.tcs.2014.09.014","title":"Secure identification and QKD in the bounded-quantum-storage model","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Strategic Research Council; Natural Sciences and Engineering Research Council of Canada; Sino-Danish Center; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Natural Science Foundation of China; National Research Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Bounded function; Identification (biology); Quantum cryptography; Quantum; Theoretical computer science; Computer science; Mathematics; Computer security; Discrete mathematics; Physics; Quantum mechanics; Quantum information; Biology","score_opus":0.006581475583667152,"score_gpt":0.23141508678499878,"score_spread":0.22483361120133163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045152465","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.19822599,0.000021539456,0.79752123,0.0033604486,0.00023061121,0.000116137875,5.3005584e-7,0.000088000525,0.000435503],"genre_scores_gemma":[0.9232588,0.0000031354111,0.07549823,0.0011236452,0.00010228884,0.000005044517,4.1278713e-7,0.000005455266,0.0000029830671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766564,0.00022668533,0.00027262824,0.00071310473,0.0006460723,0.000475884],"domain_scores_gemma":[0.9985038,0.00034274624,0.000071007846,0.00088119274,0.00007542194,0.00012582567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003548143,0.0001706992,0.00016168217,0.00017329642,0.0005346927,0.0009460345,0.0026293478,0.000048896767,0.0000015306631],"category_scores_gemma":[0.000100189616,0.000112367656,0.000038555634,0.0009653491,0.0016619145,0.0003963213,0.00072323385,0.00031884667,0.000012980906],"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.0000014198351,0.000029749477,0.000012425228,0.0000054077677,6.836501e-7,0.0000031421143,0.0018515221,0.009584464,0.00015931066,0.95722884,0.000021466112,0.031101553],"study_design_scores_gemma":[0.00008717546,0.00005346101,0.0009855179,0.000012653216,0.0000011599222,0.000037022946,0.000004694127,0.6244893,0.00008080295,0.37408924,0.00005490523,0.000104037324],"about_ca_topic_score_codex":0.000003389066,"about_ca_topic_score_gemma":9.972255e-7,"teacher_disagreement_score":0.7250328,"about_ca_system_score_codex":0.00002489098,"about_ca_system_score_gemma":0.00006202996,"threshold_uncertainty_score":0.9122632},"labels":[],"label_agreement":null},{"id":"W2046102647","doi":"10.1016/j.tcs.2009.08.006","title":"A sublinear-time approximation scheme for bin packing","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bin packing problem; Sublinear function; Mathematics; Constant (computer programming); Approximation algorithm; Combinatorics; Exponential function; Sampling (signal processing); Function (biology); Running time; Bin; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.008633049583876605,"score_gpt":0.22843081015668698,"score_spread":0.21979776057281036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046102647","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.009467225,0.000010986845,0.98568875,0.0003325909,0.00016567571,0.00017084579,0.0000014885752,0.00036801933,0.0037943963],"genre_scores_gemma":[0.716029,0.0000014007047,0.28370184,0.0001675623,0.00007757374,0.0000031319814,0.0000037119307,0.000006601323,0.000009180398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992263,0.000010112125,0.00013889556,0.00017987678,0.00017968554,0.00026516768],"domain_scores_gemma":[0.99959016,0.000053810367,0.000015169087,0.00016841057,0.00008285447,0.00008962589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050868484,0.00008954479,0.00009549785,0.00010041415,0.0001257624,0.00018370934,0.00026197892,0.000034633853,0.000046875175],"category_scores_gemma":[0.000039495248,0.00008004402,0.000030136815,0.0004745215,0.00026034252,0.00021846658,0.000024552799,0.00006742987,0.000043500775],"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.0000052734226,0.000019321182,0.000006599989,0.000014976396,0.00000205228,3.3111934e-7,0.00020283624,0.04954891,0.005589296,0.91664773,0.00019890236,0.027763749],"study_design_scores_gemma":[0.00015489088,0.00006282792,0.00005011458,0.000018343031,0.0000017805132,0.000002951247,9.138117e-7,0.9665317,0.004706321,0.028159034,0.00019892692,0.00011218781],"about_ca_topic_score_codex":6.591226e-8,"about_ca_topic_score_gemma":1.6671796e-8,"teacher_disagreement_score":0.9169828,"about_ca_system_score_codex":0.000025907357,"about_ca_system_score_gemma":0.000015099551,"threshold_uncertainty_score":0.32641003},"labels":[],"label_agreement":null},{"id":"W2046919262","doi":"10.1016/j.tcs.2010.08.010","title":"Tight bounds for the cover time of multiple random walks","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypercube; Mathematics; Upper and lower bounds; Random walk; Conjecture; Bounded function; Logarithm; Discrete mathematics; Random graph; Cover (algebra); Exponent; Expander graph; Order (exchange); Graph","score_opus":0.015307846400194607,"score_gpt":0.2870365055537961,"score_spread":0.2717286591536015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046919262","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.008989113,0.000006782206,0.9891019,0.00031674444,0.000485233,0.00033273827,0.000021207035,0.000033209977,0.0007131144],"genre_scores_gemma":[0.8180845,5.155018e-7,0.18162912,0.00012064106,0.000108046,0.0000151252425,4.7535758e-7,0.000008406729,0.000033170112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987933,0.000017659297,0.0002435292,0.00024474584,0.00039439343,0.00030638117],"domain_scores_gemma":[0.99180245,0.0073688207,0.000069985086,0.0003979225,0.0002523716,0.00010847195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013624894,0.00010967902,0.00021552359,0.000032845117,0.00026824372,0.00007715595,0.0007747828,0.000049592243,0.00025526944],"category_scores_gemma":[0.0033981642,0.00006190855,0.000067362635,0.00022459814,0.0020848007,0.00006517387,0.00019792438,0.00016295146,0.000031152034],"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.0000724388,0.00004715452,0.0000011317129,0.000023325929,0.000005723884,4.3702082e-7,0.00015358717,0.0000047499034,0.0028093033,0.9920208,0.00024006715,0.0046213055],"study_design_scores_gemma":[0.00041159897,0.00008450395,0.0000085882975,0.000008523978,0.000016206928,0.00000498692,0.000002015971,0.46377808,0.0029535533,0.53254634,0.00012938566,0.000056251025],"about_ca_topic_score_codex":7.4950196e-7,"about_ca_topic_score_gemma":5.4491204e-7,"teacher_disagreement_score":0.8090954,"about_ca_system_score_codex":0.000007934494,"about_ca_system_score_gemma":0.00007846001,"threshold_uncertainty_score":0.76815355},"labels":[],"label_agreement":null},{"id":"W2047406446","doi":"10.1016/j.tcs.2012.02.017","title":"On derandomization and average-case complexity of monotone functions","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Indiana State University; Cisco Systems; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Discrete mathematics; Algorithm; Geometry","score_opus":0.02453344038941696,"score_gpt":0.25747873425363593,"score_spread":0.23294529386421897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047406446","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.123090364,0.000024933051,0.8747119,0.00027483242,0.0007386296,0.00014566472,0.0000030983963,0.00008105444,0.00092956115],"genre_scores_gemma":[0.79761595,0.0000016943868,0.20208234,0.00019317983,0.00009576371,0.000004006636,5.511032e-7,0.000003334263,0.0000031723152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846244,0.00012337357,0.00024211708,0.00037656468,0.00039936652,0.00039613622],"domain_scores_gemma":[0.9985861,0.00041444384,0.00007181494,0.00053785404,0.00012467263,0.00026510554],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012086905,0.00013903373,0.00020381896,0.00020713326,0.00051510194,0.00014380703,0.0006264358,0.000034926943,0.000042633492],"category_scores_gemma":[0.00009155228,0.00011558941,0.000052487656,0.0008344808,0.0036443109,0.0006954171,0.0005938944,0.00014362842,0.000016548818],"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.000017896331,0.00013069496,0.000051969797,0.000006126922,0.0000039453735,0.0000075010294,0.00040934663,0.0002499354,0.000057767375,0.98105186,0.000019854246,0.017993074],"study_design_scores_gemma":[0.00051539706,0.00015093175,0.0007283728,0.000014403066,0.000004535765,0.00035994768,0.000004941593,0.67801577,0.000922486,0.31912985,0.000021189153,0.00013215198],"about_ca_topic_score_codex":0.0000057420684,"about_ca_topic_score_gemma":4.8580296e-7,"teacher_disagreement_score":0.67776585,"about_ca_system_score_codex":0.000022053493,"about_ca_system_score_gemma":0.00003062135,"threshold_uncertainty_score":0.9990672},"labels":[],"label_agreement":null},{"id":"W2047677968","doi":"10.1016/s0304-3975(01)00256-0","title":"The impact of information on broadcasting time in linear radio networks","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"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 en Outaouais; Carleton University","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Node (physics); Radio broadcasting; Range (aeronautics); Theoretical computer science; Telecommunications","score_opus":0.018276620666140598,"score_gpt":0.26989859452200543,"score_spread":0.2516219738558648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047677968","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.025387473,0.00009835657,0.9673006,0.0006583051,0.0001834478,0.00015359935,2.9722597e-7,0.000064362765,0.0061535523],"genre_scores_gemma":[0.9894935,0.00008749613,0.010231276,0.00013061806,0.00004155031,0.0000028905442,3.2367518e-7,0.000002442962,0.000009922029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865687,0.00017629481,0.00032069633,0.00018501114,0.00031932312,0.00034180123],"domain_scores_gemma":[0.9982645,0.0006623604,0.0000970311,0.0007289227,0.00015384206,0.000093377195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015617223,0.00010955475,0.00013158277,0.00014374217,0.00039546328,0.0002600825,0.0021083574,0.000029176712,0.000038819122],"category_scores_gemma":[0.00017856764,0.00006880631,0.000057917518,0.0015187416,0.00093911676,0.00071172457,0.00064147817,0.00023631843,0.0000691705],"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.0000063803523,0.000036601028,0.00008390753,7.925748e-7,0.000002459539,6.766022e-7,0.0006545892,0.052440543,0.000043646727,0.6454669,0.00022168893,0.30104178],"study_design_scores_gemma":[0.0001478053,0.00017984943,0.0024015696,0.000033604723,4.490864e-7,0.000005747902,0.0000014124818,0.99503285,0.00007602978,0.0019641526,0.00007251362,0.00008402482],"about_ca_topic_score_codex":0.0000016923832,"about_ca_topic_score_gemma":3.2566896e-7,"teacher_disagreement_score":0.964106,"about_ca_system_score_codex":0.00008182577,"about_ca_system_score_gemma":0.000034952773,"threshold_uncertainty_score":0.39178875},"labels":[],"label_agreement":null},{"id":"W2047837697","doi":"10.1016/j.tcs.2014.09.024","title":"Algebraic methods proving Sauer's bound for teaching complexity","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Algebraic number; Algebra over a field; Mathematics; Computer science; Discrete mathematics; Theoretical computer science; Calculus (dental); Pure mathematics","score_opus":0.017830319807700792,"score_gpt":0.33658955597516604,"score_spread":0.31875923616746527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047837697","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.0057211425,0.000013664581,0.9857462,0.0021371506,0.0010391709,0.0002636617,8.741903e-7,0.0004801619,0.0045979847],"genre_scores_gemma":[0.45086586,1.2620454e-7,0.5481592,0.00068007025,0.00025894912,0.000009409289,6.774386e-7,0.000008366577,0.000017349836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965079,0.00068101514,0.00034165249,0.0010436799,0.0005754249,0.00085033587],"domain_scores_gemma":[0.9970351,0.0013302468,0.00012002445,0.001010998,0.0001582274,0.00034542265],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.009704037,0.00025251,0.00032592146,0.00020106813,0.0014713017,0.0010153973,0.0032685737,0.000058696947,0.000015285748],"category_scores_gemma":[0.0009872235,0.00020501985,0.00012156154,0.0005601989,0.0028364044,0.0006536928,0.0012906203,0.00047160045,0.000026564885],"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.000002277896,0.000027370248,0.00001583938,0.000012240012,0.0000021511946,5.204024e-7,0.00033485919,0.00010805469,0.00031532493,0.6839489,0.000028220747,0.3152043],"study_design_scores_gemma":[0.0001695317,0.00020710753,0.00025243167,0.000015379734,0.0000034114205,0.00001856142,0.000002996394,0.6168114,0.0007549897,0.38026148,0.0013094374,0.00019329009],"about_ca_topic_score_codex":0.00001261153,"about_ca_topic_score_gemma":4.6066359e-7,"teacher_disagreement_score":0.61670333,"about_ca_system_score_codex":0.000057979276,"about_ca_system_score_gemma":0.00009855192,"threshold_uncertainty_score":0.99987733},"labels":[],"label_agreement":null},{"id":"W2048261494","doi":"10.1016/j.tcs.2008.01.038","title":"Partitioned probe comparability graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Combinatorics; Cograph; Split graph; Mathematics; Discrete mathematics; Pathwidth; Comparability graph; Indifference graph; Chordal graph; Line graph; Graph","score_opus":0.031434286364695405,"score_gpt":0.29781324708134405,"score_spread":0.2663789607166486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048261494","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.09654353,0.000027281667,0.8990535,0.0007681387,0.00030862374,0.0002906961,0.0000013540857,0.00043206866,0.0025747896],"genre_scores_gemma":[0.79388785,0.000006296356,0.20569701,0.00032785363,0.00004096034,0.000021206297,7.809691e-7,0.000006952424,0.000011113946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601066,0.00028148407,0.00035657175,0.0010944811,0.0012801922,0.000976629],"domain_scores_gemma":[0.9969838,0.00038779445,0.00006739012,0.0016269725,0.00040555585,0.0005284703],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020803649,0.00022554092,0.00027832517,0.00030307437,0.0012348607,0.00021243429,0.0038722013,0.00005101159,0.000065048305],"category_scores_gemma":[0.00016755328,0.00018716401,0.00011196586,0.002852242,0.011545114,0.0013345106,0.0014542394,0.0003396319,0.00032384414],"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.000013908399,0.00012836089,0.0006671318,0.000004980165,0.0000029004511,0.000031672495,0.00035043154,0.00014471968,0.00071072544,0.9944105,0.00004892191,0.0034857362],"study_design_scores_gemma":[0.00025777187,0.00021358077,0.006865731,0.000010434172,0.0000013031154,0.0001593761,0.0000027608596,0.15280011,0.0058576902,0.83347183,0.00010633444,0.00025308286],"about_ca_topic_score_codex":0.000001687099,"about_ca_topic_score_gemma":4.2196058e-7,"teacher_disagreement_score":0.6973443,"about_ca_system_score_codex":0.00007600334,"about_ca_system_score_gemma":0.0002207633,"threshold_uncertainty_score":0.9911449},"labels":[],"label_agreement":null},{"id":"W2049009474","doi":"10.1016/j.tcs.2005.04.011","title":"Results on multiples of primitive polynomials and their products over GF(2)","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Primitive polynomial; Multiple; Mathematics; Cryptosystem; Cryptography; GF(2); Discrete mathematics; Degree (music); Arithmetic; Polynomial; Connection (principal bundle); Combinatorics; Finite field; Algorithm; Physics","score_opus":0.012278168014508201,"score_gpt":0.23608899362235822,"score_spread":0.22381082560785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049009474","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.574946,0.000063690655,0.41668618,0.00271807,0.00032070637,0.00027481068,0.000011345839,0.00016816537,0.004811066],"genre_scores_gemma":[0.9389135,0.000007086066,0.06042448,0.00049243507,0.00014921036,0.0000030745155,3.7867045e-7,0.000005326165,0.00000447352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795544,0.00015005124,0.00031602284,0.00079548714,0.00037447474,0.00040851466],"domain_scores_gemma":[0.99804246,0.00067776494,0.00011370814,0.0008420988,0.00015491198,0.00016907183],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018907691,0.00019665837,0.00023942036,0.00024585996,0.00024769912,0.00017674593,0.001448096,0.000044254844,0.000006139664],"category_scores_gemma":[0.00025219822,0.00013889554,0.0000588205,0.0009145121,0.0031078742,0.00050650735,0.000775723,0.00015157048,0.000010415574],"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.00006866817,0.00009236941,0.000020199885,0.0000052412092,0.000003878502,0.0000010514075,0.0015192885,0.000041819214,0.006006246,0.87549996,0.000034776705,0.116706505],"study_design_scores_gemma":[0.0015510486,0.0016378004,0.013789567,0.00020149507,0.000009240388,0.0000404656,0.00003849222,0.21762729,0.5152913,0.2477613,0.0013467382,0.0007052898],"about_ca_topic_score_codex":0.000001519832,"about_ca_topic_score_gemma":4.0395264e-7,"teacher_disagreement_score":0.62773865,"about_ca_system_score_codex":0.000022198657,"about_ca_system_score_gemma":0.00007204911,"threshold_uncertainty_score":0.9996051},"labels":[],"label_agreement":null},{"id":"W2049140374","doi":"10.1016/j.tcs.2006.07.021","title":"Prime normal form and equivalence of simple grammars","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"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 en Outaouais","funders":"","keywords":"Terminal and nonterminal symbols; Context-sensitive grammar; Indexed grammar; Tree-adjoining grammar; Mathematics; Context-free grammar; Prefix; Simple (philosophy); Discrete mathematics; Definite clause grammar; L-attributed grammar; Combinatorics; Equivalence (formal languages); Concatenation (mathematics); Logical equivalence; Computer science; Rule-based machine translation; Artificial intelligence; Linguistics","score_opus":0.0058679002261748416,"score_gpt":0.22985309846033694,"score_spread":0.2239851982341621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049140374","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.075668894,0.000046845482,0.9226489,0.00015355827,0.00017299056,0.00009738591,0.0000038256403,0.000082821454,0.0011247932],"genre_scores_gemma":[0.75624424,0.0000038402904,0.24361129,0.000069794274,0.00005942609,0.0000017248425,0.0000012826398,0.0000033375088,0.0000050388567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804,0.00003853994,0.00028798849,0.00054304657,0.00061908097,0.00047130484],"domain_scores_gemma":[0.9987479,0.00015297609,0.000091091024,0.0007070189,0.00013863668,0.0001623987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082647253,0.00014403537,0.00018735071,0.00012554269,0.00027072118,0.00022832419,0.0017933684,0.00003947982,0.000016035954],"category_scores_gemma":[0.000026659742,0.00011160635,0.000038156468,0.00065106386,0.0022851431,0.0010787994,0.002085469,0.000111466725,0.000008580975],"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.0000037892312,0.00003926839,0.00024780614,0.0000071921895,8.3161507e-7,0.000004526963,0.00005939514,0.000033358734,0.0016462164,0.9381379,0.000046267913,0.059773482],"study_design_scores_gemma":[0.0002001615,0.00018841731,0.006160177,0.00002251169,0.0000026171504,0.000038782764,0.0000019155807,0.5847942,0.013234554,0.3950151,0.00016609223,0.00017542462],"about_ca_topic_score_codex":0.00003805594,"about_ca_topic_score_gemma":8.897317e-7,"teacher_disagreement_score":0.6805754,"about_ca_system_score_codex":0.000019862151,"about_ca_system_score_gemma":0.00007524554,"threshold_uncertainty_score":0.8419705},"labels":[],"label_agreement":null},{"id":"W2049709665","doi":"10.1016/j.tcs.2009.04.016","title":"On the uniqueness of shuffle on words and finite languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Western University","funders":"","keywords":"Uniqueness; Factorization; Regular language; Mathematics; Decomposition; Finite set; Combinatorics; Discrete mathematics; Combinatorics on words; Computer science; Word (group theory); Theoretical computer science; Algorithm; Automaton","score_opus":0.007427173008570303,"score_gpt":0.24655547753011023,"score_spread":0.23912830452153994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049709665","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.35841572,0.000029666062,0.629904,0.004162289,0.00012905528,0.00010934558,0.0000012554597,0.00011039312,0.007138284],"genre_scores_gemma":[0.9863322,0.0000044729404,0.009900233,0.0037140811,0.00003554278,0.0000016086407,1.4896634e-7,0.0000030211836,0.000008718916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986059,0.00011836472,0.00015372915,0.00039646172,0.00043871495,0.0002868385],"domain_scores_gemma":[0.9979524,0.0011007186,0.000052108648,0.0007484716,0.000047035894,0.00009928096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013042033,0.00012882131,0.00014481627,0.0001104078,0.00020877075,0.00018698472,0.0016800719,0.00003120169,0.000019628098],"category_scores_gemma":[0.0001312095,0.000074460375,0.000034857592,0.0006339111,0.001495266,0.00019014506,0.00031067876,0.00014578369,0.000014802419],"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.0000075216735,0.00004347911,0.000004961287,0.0000016977258,0.0000010863471,0.000005203328,0.00045310974,0.00009445748,0.0004784882,0.9413275,0.00002544947,0.057557005],"study_design_scores_gemma":[0.00011904787,0.000625531,0.0017047836,0.0000717702,0.0000018447591,0.0000098477585,0.0000193792,0.22861695,0.01770925,0.7509594,0.000023993543,0.00013820254],"about_ca_topic_score_codex":0.0000013233933,"about_ca_topic_score_gemma":8.639165e-8,"teacher_disagreement_score":0.62791646,"about_ca_system_score_codex":0.00001370032,"about_ca_system_score_gemma":0.00003500173,"threshold_uncertainty_score":0.550937},"labels":[],"label_agreement":null},{"id":"W2050063944","doi":"10.1016/j.tcs.2005.12.016","title":"Asynchronous deterministic rendezvous in graphs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":162,"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 en Outaouais; Carleton University","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Upper and lower bounds; Mathematics; Node (physics); Topology (electrical circuits); Combinatorics; Algorithm; Discrete mathematics","score_opus":0.007596805078787223,"score_gpt":0.24335416124682405,"score_spread":0.23575735616803684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050063944","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.012342215,0.00001857522,0.9737111,0.0006469216,0.0002974503,0.00015754592,5.6306214e-7,0.00019086029,0.012634792],"genre_scores_gemma":[0.80579233,0.0000025849613,0.19388191,0.00026137824,0.000037203386,0.0000072093508,6.3011765e-7,0.0000051311986,0.000011618293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976315,0.000111355635,0.00031779095,0.00065347063,0.00062426034,0.0006616486],"domain_scores_gemma":[0.99884474,0.00016449482,0.000047880098,0.0006517049,0.00011523941,0.00017596202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133959,0.00015002259,0.00016960048,0.00037483338,0.00024168323,0.0004947863,0.0020403126,0.0000455588,0.00003805926],"category_scores_gemma":[0.000049594106,0.00013015774,0.000043955737,0.0018281485,0.0017549588,0.00056005083,0.0006528549,0.00018470064,0.00008401408],"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.0000019644715,0.00007270684,0.00019788137,0.0000034317818,4.5594987e-7,0.00003771688,0.00009668663,0.0032012863,0.00011186963,0.97884244,0.000030514533,0.01740302],"study_design_scores_gemma":[0.00018814916,0.000103319515,0.0024791476,0.000012262563,5.966909e-7,0.000030501455,0.000001054393,0.6450401,0.00031228672,0.35164616,0.000045292953,0.00014116796],"about_ca_topic_score_codex":0.000016587299,"about_ca_topic_score_gemma":0.0000064838696,"teacher_disagreement_score":0.7934501,"about_ca_system_score_codex":0.00007546295,"about_ca_system_score_gemma":0.00016199096,"threshold_uncertainty_score":0.6466218},"labels":[],"label_agreement":null},{"id":"W2050243630","doi":"10.1016/j.tcs.2006.10.018","title":"Computability of analog networks","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computability; Metric space; Computable function; Mathematics; Discrete mathematics; Continuous function (set theory); Metric (unit); Fixed point; Computation; Topology (electrical circuits); Function (biology); Contraction mapping; Computer science; Algorithm; Mathematical analysis; Combinatorics","score_opus":0.005925309535869799,"score_gpt":0.22441266324461875,"score_spread":0.21848735370874894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050243630","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.06427979,0.00006394525,0.9301288,0.00049087487,0.0009341107,0.0002704705,0.0000020221062,0.0003582218,0.0034717717],"genre_scores_gemma":[0.73393697,0.0000010469452,0.26569664,0.00014192224,0.00020825001,0.0000038316266,0.0000011643115,0.0000073960614,0.0000027822425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552274,0.00027607038,0.00078185264,0.0013250952,0.0011448615,0.0009493551],"domain_scores_gemma":[0.99628896,0.0007562816,0.00019594686,0.0019048278,0.00056411995,0.0002898927],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0030834668,0.0003236306,0.0005238915,0.0002720459,0.00035761116,0.00033671685,0.004619647,0.00010462164,0.00004424404],"category_scores_gemma":[0.00009651799,0.00027526688,0.00018808927,0.0028774801,0.006217143,0.00066520984,0.0027197883,0.00032215935,0.000023934204],"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.0000055966025,0.0002462092,0.001403839,0.00001059397,0.0000033704287,0.000010331504,0.00005216759,0.024637718,0.00013750946,0.93871015,0.000047610443,0.03473489],"study_design_scores_gemma":[0.00017744148,0.000183205,0.02235155,0.000010964412,0.0000037761595,0.00002770095,0.0000011230026,0.6898549,0.0009530891,0.2861783,0.000033247794,0.00022470186],"about_ca_topic_score_codex":0.000053672116,"about_ca_topic_score_gemma":0.000003954581,"teacher_disagreement_score":0.6696572,"about_ca_system_score_codex":0.00012862662,"about_ca_system_score_gemma":0.0001916235,"threshold_uncertainty_score":0.99996996},"labels":[],"label_agreement":null},{"id":"W2051092461","doi":"10.1016/j.tcs.2003.08.001","title":"On-line parallel heuristics, processor scheduling and robot searching under the competitive framework","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Heuristics; Computer science; Scheduling (production processes); Point (geometry); Robot; Heuristic; Path (computing); Line (geometry); Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Upper and lower bounds; Programming language","score_opus":0.0251432603993933,"score_gpt":0.3021206933952823,"score_spread":0.276977432995889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051092461","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.0020911242,0.000043111195,0.98869514,0.0050624367,0.00024409896,0.0002534229,6.2719425e-7,0.00011713482,0.0034929186],"genre_scores_gemma":[0.5869942,0.000012898805,0.4111667,0.0017715773,0.000032565007,0.0000054671045,2.2157417e-7,0.0000057384445,0.000010656016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973632,0.0003169216,0.00023438316,0.0006825644,0.00079472084,0.0006081865],"domain_scores_gemma":[0.9973949,0.0013822237,0.000058559614,0.00060081895,0.0002616068,0.00030184342],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023224212,0.00018439181,0.00017440811,0.00012206953,0.0010014422,0.00096523826,0.001531834,0.000052457774,0.000036029844],"category_scores_gemma":[0.00062273064,0.00012008482,0.000035050158,0.0009595878,0.002957411,0.00036289947,0.00061591965,0.00055443536,0.00004615334],"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.0000044858866,0.000046983554,0.000009596335,0.0000062745166,0.0000035095602,0.0000034876552,0.0005003916,0.097786315,0.000010548214,0.8997678,0.0000047856397,0.0018558005],"study_design_scores_gemma":[0.0001194463,0.00012738217,0.00005315637,0.00004268814,0.0000013371649,0.000012462835,0.00002867199,0.5623505,0.0001272772,0.43700397,0.000024879862,0.00010821183],"about_ca_topic_score_codex":0.0000010202184,"about_ca_topic_score_gemma":3.0255333e-7,"teacher_disagreement_score":0.58490306,"about_ca_system_score_codex":0.000036115725,"about_ca_system_score_gemma":0.00018797709,"threshold_uncertainty_score":0.999756},"labels":[],"label_agreement":null},{"id":"W2051625963","doi":"10.1016/j.tcs.2004.11.009","title":"Formal description and analysis of a distributed location service for mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Neurosurgery Research and Education Foundation","keywords":"Computer science; Computer network; Distributed computing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Routing protocol; Mobile ad hoc network; Wireless ad hoc network; Network packet; Wireless","score_opus":0.008857737886663775,"score_gpt":0.23490069795498855,"score_spread":0.22604296006832478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051625963","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.094873846,0.00027706294,0.9039483,0.00019358774,0.00019061263,0.00040375383,0.0000069170574,0.000088268185,0.000017639157],"genre_scores_gemma":[0.8550008,0.000026958605,0.14461307,0.00024876723,0.000037106525,0.000050905855,0.000016914428,0.0000050111225,4.829926e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804753,0.000045724533,0.00036210835,0.0006163954,0.00039940546,0.00052883336],"domain_scores_gemma":[0.99824756,0.00019158413,0.00013994162,0.0006702001,0.00054686744,0.00020386757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011931099,0.00016314109,0.00030239293,0.00024129877,0.00028594615,0.00026044497,0.0012231885,0.00007540508,0.000003820883],"category_scores_gemma":[0.00003221034,0.00014418398,0.000079235295,0.0047688033,0.0009197202,0.0010980797,0.0006335908,0.00011328194,0.000001633327],"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.000021122356,0.00006748572,0.00004502508,0.00001425049,0.00003025943,7.028461e-7,0.00035216642,0.2813957,0.00010519684,0.6627537,0.0000036322895,0.055210773],"study_design_scores_gemma":[0.00038646726,0.00038104723,0.0033380864,0.00002925904,0.000085165615,0.0000066963407,0.000008949628,0.9671926,0.00033208056,0.028041504,0.000036820573,0.00016133611],"about_ca_topic_score_codex":0.0000035099677,"about_ca_topic_score_gemma":0.000010647972,"teacher_disagreement_score":0.76012695,"about_ca_system_score_codex":0.00008924553,"about_ca_system_score_gemma":0.000102182086,"threshold_uncertainty_score":0.58796525},"labels":[],"label_agreement":null},{"id":"W2051924156","doi":"10.1016/j.tcs.2006.08.010","title":"Algebraic properties of substitution on trajectories","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Substitution (logic); Concatenation (mathematics); Transitive closure; Generalization; Concurrency; Closure (psychology); Algebraic number; Transitive relation; Morphism; Algebraic theory; Mathematics; Regular language; Coding (social sciences); Quotient; Algebra over a field; Computer science; Set (abstract data type); Discrete mathematics; Theoretical computer science; Pure mathematics; Combinatorics; Automaton; Programming language","score_opus":0.010173418425434982,"score_gpt":0.2178024978931209,"score_spread":0.2076290794676859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051924156","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.9590014,0.000048022695,0.0381378,0.000055395743,0.00014100912,0.00006203303,8.807579e-7,0.000016391517,0.002537031],"genre_scores_gemma":[0.99801,0.0000016759062,0.0016570931,0.000101246085,0.00020269594,0.000001427231,0.0000037718237,0.0000027914646,0.000019333369],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918437,0.000036220117,0.00013726478,0.0002717803,0.00017281987,0.00019755404],"domain_scores_gemma":[0.9996606,0.000011663138,0.00003378332,0.00017781639,0.00007838329,0.000037714482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030565055,0.000084614534,0.00008917205,0.00003088023,0.00011061433,0.000026696745,0.00029598922,0.000045688674,0.0000069613634],"category_scores_gemma":[0.000049407237,0.000054584132,0.00004111946,0.00016672479,0.002151167,0.0000037660802,0.00013138389,0.00004689713,0.000009276634],"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.000029666344,0.000041024778,0.00021445352,0.000003961446,0.0000012276461,4.6211738e-7,0.0000042917145,0.00012143538,0.52045697,0.47808444,0.000019752862,0.0010222954],"study_design_scores_gemma":[0.00011789691,0.0005740204,0.0031654674,0.000021610653,0.000002542014,0.000005517965,0.0000016276371,0.0021280712,0.9856628,0.007845297,0.000362146,0.00011297489],"about_ca_topic_score_codex":0.0000016260267,"about_ca_topic_score_gemma":4.0931178e-7,"teacher_disagreement_score":0.47023913,"about_ca_system_score_codex":0.0000066944317,"about_ca_system_score_gemma":0.000032950673,"threshold_uncertainty_score":0.7926064},"labels":[],"label_agreement":null},{"id":"W2052932497","doi":"10.1016/j.tcs.2005.08.025","title":"Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"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":"Polyomino; Convexity; Mathematics; Enumeration; Regular polygon; Lattice (music); Combinatorics; Reflection symmetry; Computation; Hexagonal crystal system; Symmetry (geometry); Perimeter; Geometry; Algorithm; Physics","score_opus":0.026403407514722553,"score_gpt":0.30821707422867806,"score_spread":0.2818136667139555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052932497","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.67797375,0.000016421252,0.31479535,0.0012407115,0.0003542702,0.00028766296,0.0000032086386,0.000053669624,0.005274978],"genre_scores_gemma":[0.8997161,0.0000022527247,0.100009665,0.00014441594,0.00010385467,0.0000036939011,1.4389147e-7,0.000010175608,0.000009715939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983092,0.000110355795,0.00043192183,0.0002245776,0.0006819753,0.00024199439],"domain_scores_gemma":[0.9954454,0.0033740837,0.00023279838,0.0006373386,0.00024033297,0.00007009461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012374193,0.00013815313,0.00028969103,0.00009344912,0.00012748316,0.00003307621,0.0007945124,0.00004793173,0.00005714288],"category_scores_gemma":[0.0012416217,0.0000874635,0.00006253946,0.0005021293,0.002282398,0.00016561308,0.00022220168,0.00015913449,0.00001955471],"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.000011633739,0.00017337396,0.000011551207,0.00003740098,0.0000064759383,2.4964302e-7,0.0004560117,0.000019770961,0.0030191813,0.994305,0.000045843124,0.001913485],"study_design_scores_gemma":[0.00015692477,0.00018048298,0.00004383664,0.000073316274,0.000014593326,0.0000033759238,0.00003415226,0.022777028,0.16144067,0.81516826,0.000021668657,0.00008571195],"about_ca_topic_score_codex":5.7924126e-7,"about_ca_topic_score_gemma":1.9696593e-7,"teacher_disagreement_score":0.22174235,"about_ca_system_score_codex":0.00003787147,"about_ca_system_score_gemma":0.000060749364,"threshold_uncertainty_score":0.8409591},"labels":[],"label_agreement":null},{"id":"W2053332270","doi":"10.1016/s0304-3975(00)00096-7","title":"Measure and probability for concurrency theorists","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conditional probability; Probabilistic logic; Regular conditional probability; Probability measure; Concurrency; Measure (data warehouse); Law of total probability; Theoretical computer science; Probability theory; Computer science; Conditional probability distribution; Semantics (computer science); Mathematics; Probabilistic argumentation; Probability distribution; Mathematical economics; Probability mass function; Artificial intelligence; Discrete mathematics; Programming language; Posterior probability; Econometrics; Statistics; Data mining; Bayesian probability","score_opus":0.01856159685253597,"score_gpt":0.2620203990383691,"score_spread":0.24345880218583313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053332270","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.0262716,0.00014882439,0.9628518,0.00074665766,0.00066646386,0.00040130792,0.0000013705202,0.00021342083,0.008698543],"genre_scores_gemma":[0.8942811,0.000008900361,0.10531381,0.00019225235,0.0001564547,0.00002237274,3.7950377e-7,0.000005198893,0.000019521949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768466,0.000108031636,0.00023773673,0.0009040893,0.00043396404,0.0006314936],"domain_scores_gemma":[0.99808455,0.00043394635,0.000061365325,0.0007170804,0.0003695706,0.0003334966],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024608085,0.00019875175,0.00023422041,0.00008593666,0.0005240541,0.0004529978,0.0018153103,0.00006376569,0.000017182354],"category_scores_gemma":[0.00038321738,0.00014520518,0.00007012029,0.0007132547,0.0030240172,0.00056722364,0.0007564721,0.00014533746,0.0000228859],"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.000009620613,0.000055952853,0.0005287245,0.000010398762,0.0000022489023,0.0000029941937,0.0004491211,0.000002917077,0.0000834178,0.910336,0.000046323687,0.08847226],"study_design_scores_gemma":[0.00035645266,0.00028542953,0.0016670512,0.00002022633,0.0000047391864,0.00007129034,0.0000037085854,0.18084626,0.0005338038,0.8152148,0.0007626566,0.00023357359],"about_ca_topic_score_codex":0.0000013593259,"about_ca_topic_score_gemma":0.0000010205692,"teacher_disagreement_score":0.8680095,"about_ca_system_score_codex":0.00004811197,"about_ca_system_score_gemma":0.00015611587,"threshold_uncertainty_score":0.99968916},"labels":[],"label_agreement":null},{"id":"W2053695139","doi":"10.1016/j.tcs.2008.08.039","title":"Long binary patterns are Abelian 2-avoidable","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abelian group; Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.012199145243238898,"score_gpt":0.2253280155162436,"score_spread":0.2131288702730047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053695139","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.34773287,0.00004584915,0.64925945,0.0008067181,0.00058356946,0.000111075824,0.000002065069,0.00040921883,0.0010492102],"genre_scores_gemma":[0.95542777,0.000018048271,0.042863432,0.0014443004,0.00017697932,0.000008506238,8.682394e-7,0.000013251113,0.000046848636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967954,0.0001230346,0.00031398179,0.0009774995,0.0008912217,0.00089885603],"domain_scores_gemma":[0.9977271,0.00021325456,0.00010598886,0.0013698596,0.0001593068,0.0004244705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010890703,0.0002610859,0.00028133116,0.000261165,0.00096607284,0.0003651164,0.0039783223,0.00006922598,0.00010022792],"category_scores_gemma":[0.00005166983,0.0002124203,0.00009890709,0.0013910726,0.0025810627,0.0011828581,0.0017585034,0.00026671923,0.0003381007],"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.0000055131813,0.00014281552,0.0041785534,0.000013153628,0.0000050734743,0.0004413783,0.0005675992,0.00016040413,0.0005369695,0.97953284,0.00030089178,0.014114829],"study_design_scores_gemma":[0.0005443452,0.000408305,0.10319013,0.00014792565,0.0000062469653,0.0009111988,0.00002441815,0.7904336,0.009453232,0.09378197,0.0002620273,0.00083661237],"about_ca_topic_score_codex":0.000008452433,"about_ca_topic_score_gemma":7.720811e-7,"teacher_disagreement_score":0.88575083,"about_ca_system_score_codex":0.00007210369,"about_ca_system_score_gemma":0.00014082355,"threshold_uncertainty_score":0.9510034},"labels":[],"label_agreement":null},{"id":"W2053806044","doi":"10.1016/s0304-3975(99)00186-3","title":"Scheduling in the dark","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Parallelizable manifold; Computer science; Scheduling (production processes); Multiprocessing; Parallel computing; Multiprocessor scheduling; Partition (number theory); Upper and lower bounds; Distributed computing; Job shop scheduling; Algorithm; Mathematical optimization; Flow shop scheduling; Mathematics; Operating system","score_opus":0.013007104593241791,"score_gpt":0.2663847769236825,"score_spread":0.25337767233044073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053806044","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.02680027,0.00001376498,0.93614095,0.004846807,0.000112354464,0.00014697552,1.6471742e-7,0.000089874084,0.03184885],"genre_scores_gemma":[0.8048467,0.000007890613,0.19298361,0.002102933,0.00003675589,0.0000051107645,1.7902413e-7,0.0000023194677,0.0000145066915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981261,0.00017656825,0.00018200466,0.00041662902,0.00064714195,0.00045154264],"domain_scores_gemma":[0.998967,0.00018964808,0.000016351532,0.0006576143,0.000058527155,0.00011087886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024813013,0.000091798815,0.000089887726,0.00011559788,0.0003116739,0.00063816836,0.0033243764,0.000024902607,0.00017606869],"category_scores_gemma":[0.00004175498,0.000058330792,0.000029084029,0.0017861832,0.0012941496,0.00062550546,0.00026776432,0.00021243368,0.00020124506],"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.0000015025116,0.0000335409,0.000027901353,0.0000010776656,3.4044155e-7,0.00000731455,0.0008858589,0.009073423,0.000018531266,0.91522497,0.000024534249,0.07470101],"study_design_scores_gemma":[0.00012478934,0.000056363224,0.0006375732,0.000010314114,3.6258734e-7,0.000020787838,0.000006642367,0.873897,0.000068259054,0.124786034,0.0003041976,0.000087648565],"about_ca_topic_score_codex":0.0000026614396,"about_ca_topic_score_gemma":4.936202e-7,"teacher_disagreement_score":0.8648236,"about_ca_system_score_codex":0.000022514898,"about_ca_system_score_gemma":0.00008527375,"threshold_uncertainty_score":0.6177574},"labels":[],"label_agreement":null},{"id":"W2053905301","doi":"10.1016/j.tcs.2010.11.020","title":"A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Edit distance; Sequence (biology); Algorithm; Hierarchy; Computer science; Nested loop join; Class (philosophy); Mathematics; Theoretical computer science; Artificial intelligence; Data mining","score_opus":0.00882762397902518,"score_gpt":0.25409568040930236,"score_spread":0.2452680564302772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053905301","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.11024598,0.00003808531,0.8877053,0.0003480417,0.00065210636,0.00023789256,0.0000050197395,0.00003875444,0.0007288053],"genre_scores_gemma":[0.47452983,0.000004878757,0.52425635,0.0005358485,0.0005579553,0.000014834487,0.000008898148,0.000012756266,0.000078665944],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852514,0.000044203636,0.00018565787,0.00056215073,0.0002514562,0.0004313715],"domain_scores_gemma":[0.9990731,0.00006641463,0.000056217224,0.00039002797,0.00016864757,0.00024557573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006465767,0.00017366979,0.00014963688,0.000055723238,0.00024975545,0.0001340332,0.00071606465,0.00011017346,0.00006956156],"category_scores_gemma":[0.00008897767,0.00013837099,0.00007974379,0.00021072528,0.0010149889,0.00001667143,0.00019646692,0.00012113863,0.00002381019],"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.00001688003,0.000014746598,0.00000573748,0.0000032073701,0.000008559475,0.000001527792,0.000015698008,0.0000024167596,0.74457353,0.18090777,0.00009737962,0.07435257],"study_design_scores_gemma":[0.00024434488,0.0003009792,0.000039840474,0.00001546334,0.000008955134,0.000031583466,0.0000039893225,0.018028758,0.9045358,0.073674776,0.0028796429,0.000235908],"about_ca_topic_score_codex":0.0000039157067,"about_ca_topic_score_gemma":7.441463e-7,"teacher_disagreement_score":0.36428386,"about_ca_system_score_codex":0.0000055108085,"about_ca_system_score_gemma":0.00023937496,"threshold_uncertainty_score":0.56426054},"labels":[],"label_agreement":null},{"id":"W2054080154","doi":"10.1016/j.tcs.2003.04.001","title":"Appendix A: Report on the First International Clobber Tournament","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Tournament; Computer science; Mathematics; Appendix; Calculus (dental); Mathematical economics; Combinatorics; Medicine; Orthodontics; Geology","score_opus":0.022064625004885288,"score_gpt":0.2852826769892971,"score_spread":0.26321805198441184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054080154","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.0131417,0.000007731101,0.9174843,0.016452434,0.0028071967,0.00018755416,4.9123196e-7,0.0001270847,0.049791504],"genre_scores_gemma":[0.9603547,0.0000032658695,0.036152985,0.0032351525,0.00015821625,0.000012854663,3.0707312e-7,0.0000067870455,0.00007575367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706286,0.000099193756,0.00038003584,0.00074060773,0.0011978814,0.0005193962],"domain_scores_gemma":[0.99776065,0.000485488,0.000114280665,0.0012550217,0.00020962066,0.00017493796],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027654115,0.000180902,0.00013614699,0.00012672893,0.0006549951,0.00077236554,0.0038570869,0.000040726176,0.0004916642],"category_scores_gemma":[0.00053923705,0.000113787544,0.00008375843,0.00073145225,0.0022153254,0.0004562073,0.00074030407,0.00026941282,0.0011350617],"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.0000025939662,0.00006325004,0.00019351006,6.1041334e-7,0.0000046484784,0.00007930346,0.00025765726,0.00032276625,0.000028334454,0.99129784,0.001073517,0.0066759484],"study_design_scores_gemma":[0.000085971566,0.00021509954,0.00051202596,0.000049980787,0.0000041325143,0.00054667104,0.00003451807,0.2715659,0.029085537,0.6385099,0.058991164,0.00039903822],"about_ca_topic_score_codex":0.0000030864885,"about_ca_topic_score_gemma":0.0000012875286,"teacher_disagreement_score":0.947213,"about_ca_system_score_codex":0.0001345987,"about_ca_system_score_gemma":0.00012192055,"threshold_uncertainty_score":0.99964267},"labels":[],"label_agreement":null},{"id":"W2054220885","doi":"10.1016/j.tcs.2007.04.015","title":"State complexity of combined operations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":88,"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":"State (computer science); Intersection (aeronautics); Combined operations; Star (game theory); Computer science; Theoretical computer science; Computational complexity theory; Mathematics; Algorithm; Engineering; Political science","score_opus":0.018968664395800354,"score_gpt":0.26799451307674566,"score_spread":0.2490258486809453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054220885","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.19675387,0.000009147967,0.8000614,0.00041988766,0.00034958727,0.00010719646,0.0000021381347,0.00015583952,0.0021409052],"genre_scores_gemma":[0.76299536,0.0000010423154,0.23661594,0.0003457542,0.00002954592,0.0000010057207,6.294954e-7,0.0000040170644,0.000006706471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791265,0.000069004054,0.0003924806,0.0004758928,0.00062222726,0.0005277745],"domain_scores_gemma":[0.99833775,0.0002449325,0.00005867234,0.00086914975,0.00024654294,0.00024296036],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030492335,0.00014176258,0.00021364058,0.00020388541,0.00032040596,0.00019881841,0.0025008835,0.000029596129,0.000041224685],"category_scores_gemma":[0.00006453324,0.00011566416,0.000060123974,0.0012609392,0.005257633,0.00060713536,0.0009846165,0.00013591352,0.000039404604],"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.000007947692,0.000082493214,0.000045087923,0.000004007342,0.0000027379306,0.000006588264,0.000432065,0.0001687269,0.0035100644,0.9760783,0.000012663968,0.01964937],"study_design_scores_gemma":[0.00022357581,0.00020100732,0.0046849037,0.000015804757,0.000001736867,0.000016522868,0.0000073263886,0.4982521,0.040576465,0.4558494,0.000018815046,0.00015231324],"about_ca_topic_score_codex":0.00001057412,"about_ca_topic_score_gemma":0.0000034482446,"teacher_disagreement_score":0.5662415,"about_ca_system_score_codex":0.00003669326,"about_ca_system_score_gemma":0.00010320257,"threshold_uncertainty_score":0.99744946},"labels":[],"label_agreement":null},{"id":"W2054806088","doi":"10.1016/j.tcs.2012.10.015","title":"PAC learnability under non-atomic measures: A problem by Vidyasagar","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Countable set; Learnability; Uncountable set; Discrete mathematics; Modulo; Dimension (graph theory); Axiom; Combinatorics; Computer science","score_opus":0.007524025083853643,"score_gpt":0.24933544729667395,"score_spread":0.24181142221282032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054806088","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.042612206,0.00009607314,0.95022196,0.0022680084,0.0006363152,0.0002003457,0.0000013211607,0.00033815866,0.003625615],"genre_scores_gemma":[0.8663567,0.0000041241556,0.13238433,0.0009700873,0.0002167792,0.000010113902,7.6038276e-7,0.000012062103,0.000045064742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963394,0.0002726048,0.0003277749,0.0008350037,0.0010487717,0.0011764652],"domain_scores_gemma":[0.9977689,0.00024698893,0.00009156554,0.0010712632,0.0001622963,0.00065898086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038925267,0.00027597923,0.00027736663,0.00013492243,0.00059332483,0.0005022783,0.002687216,0.00008147735,0.000054435033],"category_scores_gemma":[0.00009818007,0.00021383181,0.000098722325,0.0010854307,0.002094049,0.0010978677,0.0011581655,0.00049641525,0.00029336708],"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.0000054870675,0.0002018484,0.0010786348,0.000011284873,0.000007041884,0.0000017588858,0.00093156664,0.0001904317,0.0010790811,0.912419,0.00063467625,0.08343914],"study_design_scores_gemma":[0.00056661846,0.00034833048,0.005116234,0.00006131863,0.0000115974435,0.00009251975,0.000022364831,0.82594985,0.005200864,0.15819514,0.0036242427,0.0008109337],"about_ca_topic_score_codex":0.000017719041,"about_ca_topic_score_gemma":3.113666e-7,"teacher_disagreement_score":0.8257594,"about_ca_system_score_codex":0.00011962029,"about_ca_system_score_gemma":0.00015956884,"threshold_uncertainty_score":0.8719808},"labels":[],"label_agreement":null},{"id":"W2056081080","doi":"10.1016/j.tcs.2009.06.019","title":"On-the-fly<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>T</mml:mi><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mi>L</mml:mi></mml:math>model checking for time Petri nets","year":2009,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Algorithm; Computer science; Computer graphics (images); Artificial intelligence; Mathematics; Theology; Philosophy","score_opus":0.02308841751832871,"score_gpt":0.26984431028839184,"score_spread":0.24675589277006313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056081080","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.52490425,0.00047663238,0.4229731,0.0026430713,0.0048311134,0.00024196568,0.00016304983,0.00055589335,0.043210912],"genre_scores_gemma":[0.8640827,0.00018132012,0.12889846,0.004238666,0.00164644,0.000374879,0.00013347801,0.00032632807,0.00011770295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98578054,0.0008108638,0.002332864,0.0033049705,0.004104076,0.0036666885],"domain_scores_gemma":[0.9883805,0.0032811598,0.0018264953,0.004475179,0.0004834152,0.001553277],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0077585834,0.0012543689,0.0006438574,0.00074640824,0.0035064637,0.003510631,0.007851912,0.0015713216,0.005420276],"category_scores_gemma":[0.0029447402,0.0017569799,0.0015077501,0.0028615633,0.0058027743,0.0027986616,0.004022519,0.0021932167,0.002684026],"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.00073583913,0.0004806869,0.0000035689875,0.00031724124,0.00023403326,0.00027499307,0.0023817532,0.010992926,0.0017704158,0.95421,0.016809924,0.011788663],"study_design_scores_gemma":[0.0011404331,0.0022508395,0.000047695852,0.0008513295,0.0003133885,0.0006244319,0.0001362557,0.70832115,0.23511672,0.049055483,0.0007360542,0.0014062269],"about_ca_topic_score_codex":0.00014901413,"about_ca_topic_score_gemma":0.000034405977,"teacher_disagreement_score":0.90515447,"about_ca_system_score_codex":0.0000791798,"about_ca_system_score_gemma":0.0019103831,"threshold_uncertainty_score":0.99972486},"labels":[],"label_agreement":null},{"id":"W2056117079","doi":"10.1016/j.tcs.2008.11.003","title":"Compressed depth sequences","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Redundancy (engineering); Set (abstract data type); Construct (python library); Probability distribution; Binary logarithm; Algorithm; Code (set theory); Discrete mathematics; Computer science; Statistics","score_opus":0.01978348719631589,"score_gpt":0.25570393056188034,"score_spread":0.23592044336556445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056117079","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.02370693,0.000054274406,0.96811,0.000521011,0.000708901,0.00011771687,0.0000018140439,0.00037398218,0.0064053214],"genre_scores_gemma":[0.70415914,0.000012266885,0.2952057,0.0004855605,0.00011589203,0.000004047339,0.0000010143178,0.0000046999453,0.000011688732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971377,0.00009321212,0.00027259806,0.00085366727,0.0010018873,0.0006409179],"domain_scores_gemma":[0.99798477,0.00019506674,0.00007113922,0.0011835478,0.00019243849,0.00037306093],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00068045367,0.00020296189,0.00022355422,0.0001687629,0.0010088531,0.00032515023,0.0042613563,0.000050083618,0.000054586064],"category_scores_gemma":[0.000047531466,0.00015196807,0.00006332338,0.0011653849,0.0039402316,0.0014780795,0.0019188139,0.00020909615,0.00023328178],"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.0000035351284,0.000055706852,0.00015340444,0.0000026711807,0.0000021878523,0.00007255806,0.0002860794,0.00017595821,0.0007607918,0.97342676,0.00036402518,0.024696346],"study_design_scores_gemma":[0.00025642692,0.00017520554,0.0048451447,0.000024877809,0.0000019784695,0.00035177558,0.000003093463,0.9144894,0.007595686,0.07092318,0.0010069405,0.00032630345],"about_ca_topic_score_codex":0.000009493807,"about_ca_topic_score_gemma":3.7055304e-7,"teacher_disagreement_score":0.91431344,"about_ca_system_score_codex":0.000040652376,"about_ca_system_score_gemma":0.00020457075,"threshold_uncertainty_score":0.9987705},"labels":[],"label_agreement":null},{"id":"W2057923867","doi":"10.1016/j.tcs.2005.06.030","title":"A representation theorem for Boolean contact algebras","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Representation theorem; Stone's representation theorem for Boolean algebras; Mathematics; Axiom; Connection (principal bundle); Discrete mathematics; Representation (politics); Transitive relation; Free Boolean algebra; Automated theorem proving; Complete Boolean algebra; Class (philosophy); Boolean algebras canonically defined; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Two-element Boolean algebra; Algorithm; Artificial intelligence; Algebra representation","score_opus":0.018317422667850046,"score_gpt":0.2810696077821045,"score_spread":0.26275218511425447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057923867","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.010746954,0.000031027655,0.97550124,0.0036948451,0.00043554133,0.0003538742,0.0000020276952,0.0002540138,0.008980489],"genre_scores_gemma":[0.62763566,0.0000027055567,0.3707357,0.0013451109,0.00025250597,0.000014201917,0.0000010274855,0.0000056501335,0.0000074404584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762845,0.00008108995,0.00029790137,0.00082198187,0.0005445874,0.00062599883],"domain_scores_gemma":[0.9981883,0.00039198808,0.00008148521,0.000905727,0.00018032789,0.00025215032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461342,0.00018046425,0.00021736727,0.00014324431,0.0004713589,0.00062033755,0.0023580906,0.000051483767,0.00003523594],"category_scores_gemma":[0.000104635415,0.00013715729,0.00011255551,0.0008251704,0.0010559909,0.0010001042,0.0005877949,0.00012444938,0.000099627985],"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.000010294491,0.00004120814,0.000020115978,0.0000022796114,0.0000027864553,0.0000020279786,0.00029743012,0.00011070289,0.00020638139,0.79361343,0.00021441765,0.20547892],"study_design_scores_gemma":[0.00032532998,0.0002383707,0.00059054955,0.000009309988,0.0000036647323,0.000022791408,0.0000059465156,0.6647345,0.0028122547,0.33018392,0.00089149614,0.00018184423],"about_ca_topic_score_codex":0.0000022414492,"about_ca_topic_score_gemma":7.738911e-7,"teacher_disagreement_score":0.6646238,"about_ca_system_score_codex":0.00006653259,"about_ca_system_score_gemma":0.000092577335,"threshold_uncertainty_score":0.59819293},"labels":[],"label_agreement":null},{"id":"W2058095168","doi":"10.1016/j.tcs.2008.06.002","title":"Heuristic algorithms for Hadamard matrices with two circulant cores","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Hadamard transform; Algorithm; Heuristic; Hadamard matrix; Mathematics; Complex Hadamard matrix; Combinatorics; Computer science; Mathematical optimization","score_opus":0.012383514390553699,"score_gpt":0.2220192531576568,"score_spread":0.20963573876710312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058095168","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.26630515,0.000084067295,0.73139745,0.000021019478,0.00040294282,0.00018730642,0.0000060031775,0.00023500374,0.0013610867],"genre_scores_gemma":[0.9799249,0.0000067922997,0.019815598,0.000045787183,0.0001624708,0.000020599451,0.0000014051546,0.000016364962,0.0000060848006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879426,0.000026319281,0.00016771496,0.0002845309,0.000315768,0.00041140142],"domain_scores_gemma":[0.99926585,0.00019071682,0.000021405858,0.00028270262,0.000078426056,0.00016087893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044381522,0.00015239762,0.0001901492,0.00010290045,0.00030726442,0.00007342064,0.0005017361,0.000026446072,0.000015677513],"category_scores_gemma":[0.000014500601,0.00010973594,0.000046342557,0.00043747897,0.0017612906,0.00013701883,0.00005029796,0.00009143409,0.00002356833],"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.000027439695,0.000024178096,0.00025934936,0.00005355379,0.000015499261,0.00004477852,0.0003820706,0.008020497,0.0005638403,0.9870196,0.00013134911,0.0034578387],"study_design_scores_gemma":[0.00057108764,0.00029096822,0.0010446825,0.000066616885,0.000017088078,0.00049176463,0.000017575569,0.9377833,0.0030646438,0.055978246,0.00030879845,0.0003652374],"about_ca_topic_score_codex":0.0000020095174,"about_ca_topic_score_gemma":3.8311717e-7,"teacher_disagreement_score":0.93104136,"about_ca_system_score_codex":0.000024248253,"about_ca_system_score_gemma":0.000028495837,"threshold_uncertainty_score":0.64895487},"labels":[],"label_agreement":null},{"id":"W2059032550","doi":"10.1016/j.tcs.2013.02.008","title":"A tight characterization of strategic games with a unique equilibrium","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Wireless Networks and Protocols","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":"Concordia University","funders":"","keywords":"Nash equilibrium; Computer science; Set (abstract data type); Action (physics); Strategy; Characterization (materials science); Mathematical economics; A priori and a posteriori; Correlated equilibrium; Best response; Game theory; Solution concept; Mathematical optimization; Repeated game; Equilibrium selection; Mathematics","score_opus":0.013419054997618576,"score_gpt":0.23159446582972637,"score_spread":0.21817541083210779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059032550","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.2614396,0.0000023079567,0.73501915,0.00052340626,0.00007427703,0.0010998822,5.739435e-7,0.00009015905,0.0017506685],"genre_scores_gemma":[0.94180065,9.83763e-7,0.05769882,0.00022283307,0.000064630935,0.00019301823,9.668803e-7,0.000006429972,0.000011669301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982906,0.00009389947,0.00024701955,0.00047161704,0.0004807656,0.0004161295],"domain_scores_gemma":[0.9986643,0.00008540072,0.000114958246,0.0006549595,0.0002908748,0.00018950718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004963988,0.00015219601,0.00020426467,0.000113072885,0.000097954784,0.0004485177,0.0016639918,0.00004540135,0.00008021378],"category_scores_gemma":[0.0000054683,0.00010199586,0.000032682947,0.0011052962,0.0015755186,0.0010611828,0.00046034646,0.00012431924,0.00003179601],"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.0000060788716,0.000040274495,0.00007297233,0.00001295303,0.0000025708628,0.0000027192796,0.00015578607,0.00008465075,0.021797793,0.96792465,0.000005529556,0.009893989],"study_design_scores_gemma":[0.00022922333,0.000600451,0.0038587188,0.00010461465,0.000002323507,0.000026701904,0.000002769212,0.83802056,0.02911683,0.127775,0.000033053104,0.00022973186],"about_ca_topic_score_codex":0.0000054333345,"about_ca_topic_score_gemma":2.0569671e-7,"teacher_disagreement_score":0.8401497,"about_ca_system_score_codex":0.000017958124,"about_ca_system_score_gemma":0.00016932783,"threshold_uncertainty_score":0.5805064},"labels":[],"label_agreement":null},{"id":"W2059590924","doi":"10.1016/j.tcs.2010.07.017","title":"Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Minor (academic); Scroll; Grid; Planar; Mathematics; Factor (programming language); Combinatorics; Computer science; Discrete mathematics; Computer graphics (images); Geometry; Programming language; Humanities; Engineering","score_opus":0.013831030640454033,"score_gpt":0.2509247616131342,"score_spread":0.23709373097268016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059590924","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.7201959,0.0013892902,0.019735042,0.0013876646,0.004852016,0.00017124237,0.0012566112,0.0005344239,0.25047785],"genre_scores_gemma":[0.9753631,0.00103094,0.016144153,0.0017010926,0.0022227743,0.0013096981,0.0011197651,0.0009955218,0.00011296012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9786567,0.0013901443,0.003935916,0.0044383877,0.006236157,0.005342667],"domain_scores_gemma":[0.98292226,0.005295321,0.0035443483,0.0046129026,0.00071427977,0.0029109153],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0058398135,0.0018234503,0.0008573871,0.001918415,0.0035853956,0.0034785403,0.0074458527,0.0036563387,0.19143085],"category_scores_gemma":[0.0034339242,0.0033858712,0.002854798,0.004414275,0.012483192,0.0043623676,0.0061483523,0.004125734,0.0018364621],"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.0026640208,0.0009419942,0.000047745747,0.0016786157,0.0014196618,0.0015158886,0.0032455607,0.0021104156,0.01187865,0.89975274,0.070299886,0.004444842],"study_design_scores_gemma":[0.003298798,0.0037134283,0.00022224769,0.0018809775,0.0011909,0.003273414,0.0010247139,0.1689851,0.80602735,0.006750271,0.00082835276,0.0028044193],"about_ca_topic_score_codex":0.0014138331,"about_ca_topic_score_gemma":0.0010029088,"teacher_disagreement_score":0.89300245,"about_ca_system_score_codex":0.000040754596,"about_ca_system_score_gemma":0.0032842113,"threshold_uncertainty_score":0.99945104},"labels":[],"label_agreement":null},{"id":"W2059986173","doi":"10.1016/j.tcs.2012.07.021","title":"Optimal gathering in radio grids with interference","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Combinatorics; Node (physics); Computer science; Constant (computer programming); Discrete mathematics; Matching (statistics); Graph; Mathematics; Communication source; Grid; Hexagonal tiling; Set (abstract data type); Computer network; Physics","score_opus":0.009171511087821072,"score_gpt":0.22917257095054375,"score_spread":0.22000105986272267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059986173","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.17820995,0.000053407643,0.818554,0.00018033426,0.0004602672,0.00014639388,1.86204e-7,0.00014815877,0.002247306],"genre_scores_gemma":[0.75586516,0.0000026938342,0.2437659,0.00017592881,0.00016330127,0.000013643307,1.46449e-7,0.0000084869125,0.000004733536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972528,0.00010877827,0.0002695128,0.00065039913,0.0005828975,0.0011356056],"domain_scores_gemma":[0.9983146,0.00020379186,0.000058602684,0.0009353599,0.00007682919,0.0004107877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017534774,0.00022537143,0.00023720785,0.00018516429,0.00016775304,0.00034416004,0.0029197785,0.000052617565,0.000041155767],"category_scores_gemma":[0.000028769964,0.00016927476,0.00003590192,0.0015961603,0.0019229066,0.0016440048,0.0013010228,0.0003572848,0.000071701616],"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.000012070622,0.000079375655,0.0019288755,0.0000041830963,0.0000022536196,0.000015895406,0.0011812139,0.0031792186,0.00017073075,0.96761113,0.0000115836865,0.025803456],"study_design_scores_gemma":[0.00035002883,0.0003525657,0.007744151,0.00010206302,0.0000027697865,0.0001870162,0.00001314762,0.9819349,0.0028346973,0.0059747337,0.00009506647,0.00040884616],"about_ca_topic_score_codex":0.000004488654,"about_ca_topic_score_gemma":0.0000013454248,"teacher_disagreement_score":0.9787557,"about_ca_system_score_codex":0.000118736214,"about_ca_system_score_gemma":0.00009938118,"threshold_uncertainty_score":0.70850295},"labels":[],"label_agreement":null},{"id":"W2061265323","doi":"10.1016/j.tcs.2009.01.004","title":"Nondeterministic state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Nested word; Word (group theory); Discrete mathematics; Deterministic finite automaton; Intersection (aeronautics); Mathematics; Upper and lower bounds; Combinatorics; Automaton; Finite-state machine; Automata theory; Computer science; Quantum finite automata; Theoretical computer science; Algorithm","score_opus":0.01999266988656173,"score_gpt":0.26671292319203743,"score_spread":0.2467202533054757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061265323","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.16453011,0.000014486244,0.83140564,0.0009713907,0.00037594084,0.00015060087,0.000004199971,0.0003976738,0.0021499305],"genre_scores_gemma":[0.85175496,0.0000022985241,0.14745915,0.0007244733,0.000043153967,0.0000015594211,8.9317933e-7,0.000005467889,0.00000803866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712074,0.00013823641,0.00048177192,0.0007484919,0.0008336797,0.00067706686],"domain_scores_gemma":[0.9976262,0.00026125737,0.00016090144,0.0014561219,0.00019103845,0.00030451067],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015019388,0.00023847804,0.00036806575,0.0002392499,0.00027263572,0.00032584523,0.0039931987,0.000044653087,0.00003269198],"category_scores_gemma":[0.000088735884,0.00019584961,0.00009173799,0.0014824254,0.0045460337,0.0007285162,0.0008587042,0.00018059683,0.00005496908],"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.000009147183,0.00011092662,0.000011619952,0.0000064554947,0.0000021338305,0.00001996737,0.00029488516,0.00004146715,0.0017524516,0.8395352,0.000024687923,0.1581911],"study_design_scores_gemma":[0.00021114969,0.00030251857,0.006593481,0.00003476009,0.0000028949205,0.000047610756,0.0000024099381,0.48172045,0.0053657433,0.5055069,0.000025955555,0.00018616942],"about_ca_topic_score_codex":0.0000029817622,"about_ca_topic_score_gemma":2.7096425e-7,"teacher_disagreement_score":0.68722486,"about_ca_system_score_codex":0.000041950472,"about_ca_system_score_gemma":0.00015486559,"threshold_uncertainty_score":0.99816304},"labels":[],"label_agreement":null},{"id":"W2061918649","doi":"10.1016/j.tcs.2014.02.045","title":"Online algorithms for 1-space bounded 2-dimensional bin packing and square packing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bin packing problem; Bounded function; Bin; Square (algebra); Competitive analysis; Mathematics; Packing problems; Combinatorics; Unit square; Space (punctuation); Sequence (biology); Upper and lower bounds; Online algorithm; Algorithm; Best bin first; Computer science; Geometry; Mathematical analysis; Artificial intelligence; k-nearest neighbors algorithm; Chemistry","score_opus":0.013697621675699418,"score_gpt":0.246702862499147,"score_spread":0.2330052408234476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061918649","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.04023371,0.000036182748,0.95800257,0.0004116529,0.00047527178,0.00014625238,0.0000069287285,0.00025250902,0.00043490503],"genre_scores_gemma":[0.7571019,0.000003870923,0.2425249,0.00020234227,0.00013502482,0.0000034235713,0.0000061947762,0.000016369793,0.0000059735407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.000029639144,0.00016405243,0.00030263845,0.00024986762,0.00036237785],"domain_scores_gemma":[0.99923956,0.0002649942,0.000023140201,0.00019698043,0.00010998714,0.00016532208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069579424,0.00014401689,0.00015446501,0.0001050482,0.0002602681,0.00021540606,0.00022090951,0.000050231913,0.000022319797],"category_scores_gemma":[0.00007712924,0.00012589559,0.000031883876,0.00030622273,0.00073293305,0.00015866295,0.00011077389,0.000116027935,0.0000057209786],"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.00000483425,0.000030022804,0.00008751739,0.000053447082,0.0000064923647,8.2182305e-7,0.00035451356,0.07392674,0.0007462883,0.88492364,0.00008570829,0.039779987],"study_design_scores_gemma":[0.00028904006,0.00007389189,0.00018229503,0.00006465953,0.000005005272,0.000010894052,0.000005271793,0.96647674,0.001219333,0.030908244,0.0005832606,0.00018138824],"about_ca_topic_score_codex":9.0745607e-7,"about_ca_topic_score_gemma":9.533139e-7,"teacher_disagreement_score":0.89255,"about_ca_system_score_codex":0.0000272212,"about_ca_system_score_gemma":0.000017869246,"threshold_uncertainty_score":0.5133873},"labels":[],"label_agreement":null},{"id":"W2062088872","doi":"10.1016/s0304-3975(03)00320-7","title":"On the complexity of finding common approximate substrings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"","keywords":"Parameterized complexity; Substring; Mathematics; Hamming distance; Combinatorics; String (physics); Alphabet; Time complexity; Class (philosophy); Set (abstract data type); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03818003502775003,"score_gpt":0.26858535743145007,"score_spread":0.23040532240370004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062088872","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.08388761,0.000011351964,0.90898305,0.0006208746,0.0003363203,0.0001529152,0.000002789103,0.000079826386,0.005925241],"genre_scores_gemma":[0.9017961,0.0000015322339,0.09781813,0.00035425945,0.000018497112,0.0000035005528,5.026396e-7,0.000004559984,0.0000029317134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977658,0.00019960415,0.00028449716,0.0005228631,0.0007708225,0.00045645636],"domain_scores_gemma":[0.997826,0.0005665171,0.0001182056,0.0012347769,0.00010581771,0.00014872632],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020973412,0.00016420944,0.00021413535,0.00011194103,0.00057972106,0.00026195415,0.0030175212,0.00003594176,0.000056434117],"category_scores_gemma":[0.00014294487,0.000098845005,0.000062646046,0.0010059209,0.0046547456,0.0004030977,0.0009142865,0.00023475925,0.000029107729],"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.0000035392675,0.00005778967,0.000031847678,0.000004064445,0.0000017876313,0.0000026654436,0.00016300603,0.00008708331,0.0003233095,0.9951737,0.00006286705,0.004088358],"study_design_scores_gemma":[0.00011543308,0.0001133747,0.00045888362,0.000036335532,0.0000015579959,0.000014799341,0.000005167626,0.38373536,0.020061668,0.5952766,0.00006201465,0.00011880749],"about_ca_topic_score_codex":0.0000043150203,"about_ca_topic_score_gemma":2.103298e-7,"teacher_disagreement_score":0.81790847,"about_ca_system_score_codex":0.000032678905,"about_ca_system_score_gemma":0.00006528501,"threshold_uncertainty_score":0.998054},"labels":[],"label_agreement":null},{"id":"W2063737596","doi":"10.1016/j.tcs.2011.12.048","title":"State complexity of the concatenation of regular tree languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"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":"Concatenation (mathematics); Regular language; Pumping lemma for regular languages; String (physics); Tree (set theory); Mathematics; Automaton; Combinatorics; State (computer science); Discrete mathematics; Formal language; Time complexity; Finite-state machine; Upper and lower bounds; Computer science; Algorithm; Theoretical computer science","score_opus":0.02546993447421071,"score_gpt":0.24267921759233238,"score_spread":0.21720928311812168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063737596","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.3355234,0.000021184793,0.6600895,0.00019176997,0.0002073238,0.0001039337,0.0000029254768,0.000056974623,0.003802967],"genre_scores_gemma":[0.9266494,0.0000014111243,0.0732014,0.00012225311,0.000013270113,0.0000013051765,1.9065342e-7,0.000003438728,0.0000073352116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984975,0.00014042645,0.0002831703,0.00030811544,0.0005190862,0.00025173964],"domain_scores_gemma":[0.99858475,0.000102854654,0.00014327111,0.0009026813,0.00019254629,0.00007392839],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012286961,0.00010320665,0.00018061762,0.00008614764,0.00012021052,0.000036594858,0.0028598255,0.000024875428,0.000029635965],"category_scores_gemma":[0.00005942092,0.00006375085,0.00007261916,0.00078320253,0.0062485314,0.0003229742,0.000984444,0.00008600278,0.0000054697753],"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.000004767891,0.000050777173,0.00012688035,0.000008479967,0.0000033357057,0.0000012444115,0.0015041406,0.000010911659,0.005134425,0.9719865,0.000008579405,0.02116],"study_design_scores_gemma":[0.0001454599,0.00010808052,0.031209253,0.00003218106,0.0000037392572,0.000010017978,0.000022097274,0.13755997,0.25972563,0.57108486,0.000004647856,0.000094049305],"about_ca_topic_score_codex":0.000022675284,"about_ca_topic_score_gemma":0.0000018125447,"teacher_disagreement_score":0.59112597,"about_ca_system_score_codex":0.00001678177,"about_ca_system_score_gemma":0.000063868385,"threshold_uncertainty_score":0.9964559},"labels":[],"label_agreement":null},{"id":"W2063972032","doi":"10.1016/j.tcs.2004.09.035","title":"A behavioural pseudometric for probabilistic transition systems","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Mathematics; Coalgebra; Functor; Equivalence (formal languages); Metric space; Modal logic; Discrete mathematics; Metric (unit); Algebra over a field; Pure mathematics; Modal; Statistics","score_opus":0.019719505836628813,"score_gpt":0.24980407481604147,"score_spread":0.23008456897941265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063972032","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.04181741,0.00007296335,0.95449454,0.0004983836,0.0011930484,0.0005963941,0.000003052409,0.00029079153,0.0010334039],"genre_scores_gemma":[0.9036738,0.0000015839823,0.09594779,0.00014221261,0.00016067374,0.00005611365,0.0000014346178,0.000008176033,0.000008184757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975482,0.000060826696,0.0003104697,0.00079483003,0.0005831355,0.00070249895],"domain_scores_gemma":[0.99839544,0.00024133794,0.00007267946,0.00062649854,0.00035287434,0.00031117725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014323386,0.00020571968,0.00025397856,0.0003349336,0.0005072937,0.0006869444,0.0019856147,0.0000714889,0.0000047464778],"category_scores_gemma":[0.00017611335,0.00015994917,0.000114898394,0.0020423701,0.0014786905,0.00067066326,0.00027351832,0.0001420696,0.000050208317],"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.0000066748307,0.000120719,0.000013479874,0.000022892562,0.0000023796078,0.0000071042928,0.0006771827,0.0015224209,0.00011460664,0.9934074,0.000011600501,0.0040935297],"study_design_scores_gemma":[0.0009403726,0.0008220678,0.0006945981,0.00005973411,0.000015658188,0.00016703416,0.0000121770945,0.6218219,0.0008777651,0.37419,0.000035935213,0.00036273996],"about_ca_topic_score_codex":0.000011349831,"about_ca_topic_score_gemma":7.7775707e-7,"teacher_disagreement_score":0.8618564,"about_ca_system_score_codex":0.0001952108,"about_ca_system_score_gemma":0.00024137877,"threshold_uncertainty_score":0.66242206},"labels":[],"label_agreement":null},{"id":"W2063991224","doi":"10.1016/s0304-3975(01)00152-9","title":"Lower bounds for invariant queries in logics with counting","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Preorder; Unary operation; Locality; Transitive closure; Mathematics; Discrete mathematics; Complexity class; Expressive power; First-order logic; Binary relation; Transitive relation; Second-order logic; Succinctness; Invariant (physics); Proof theory; Combinatorics; Time complexity; Higher-order logic; Computer science; Mathematical proof; Theoretical computer science; Description logic","score_opus":0.022308949309105132,"score_gpt":0.23628980476978478,"score_spread":0.21398085546067966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063991224","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.016452594,0.000033948392,0.978158,0.001484414,0.00045554497,0.00022592042,0.0000017088499,0.00014157609,0.0030462893],"genre_scores_gemma":[0.6506544,0.0000032771663,0.34863967,0.0006071032,0.000067430716,0.000012649674,2.3504568e-7,0.000005075656,0.00001015538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773043,0.000050723524,0.00026497358,0.000712433,0.0005528211,0.00068860425],"domain_scores_gemma":[0.9985799,0.00038313676,0.000064026135,0.0006532334,0.00016973165,0.00014995804],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012882027,0.0001875646,0.00022350773,0.00021894561,0.00047882428,0.0007450954,0.0021001103,0.000047297453,0.00004310157],"category_scores_gemma":[0.00008999191,0.00014290423,0.000051129435,0.0015705375,0.0030580943,0.0008676581,0.00064346043,0.00019878676,0.000016862035],"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.000008370661,0.00009199732,0.00013336014,0.000007783975,0.000002012054,0.000021959459,0.00051004946,0.00016827513,0.00002886034,0.98419887,0.000041680716,0.014786807],"study_design_scores_gemma":[0.00030974048,0.00038445523,0.00038341555,0.000039716277,0.0000017722268,0.000044312295,0.000007756154,0.7501076,0.0002387804,0.24761073,0.00064744405,0.00022430965],"about_ca_topic_score_codex":0.000005906596,"about_ca_topic_score_gemma":0.000008119412,"teacher_disagreement_score":0.74993926,"about_ca_system_score_codex":0.000055602213,"about_ca_system_score_gemma":0.00006396998,"threshold_uncertainty_score":0.999655},"labels":[],"label_agreement":null},{"id":"W2064666203","doi":"10.1016/j.tcs.2013.09.034","title":"Safe recursion revisited I: Categorical semantics for lower complexity","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Western University","funders":"","keywords":"Soundness; Mathematics; Bounded function; Categorical variable; Recursion (computer science); Polynomial; Semantics (computer science); Set (abstract data type); Discrete mathematics; Computer science; Algorithm; Programming language; Statistics","score_opus":0.02868647565985513,"score_gpt":0.26988549818003504,"score_spread":0.2411990225201799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064666203","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.0027773743,0.000037644797,0.9889741,0.0020741958,0.0013380339,0.00076605915,6.074082e-7,0.0002809074,0.003751111],"genre_scores_gemma":[0.84197843,0.000002944214,0.15707728,0.00059108716,0.00025108995,0.00002936978,0.0000020187747,0.000009321511,0.00005843704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700344,0.00012823287,0.0004112048,0.0009084236,0.0007034346,0.00084525504],"domain_scores_gemma":[0.9975647,0.00030406882,0.00011814207,0.0010365031,0.00056902703,0.00040759193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015292381,0.00024200224,0.00033837598,0.00014766306,0.0005887543,0.00092107937,0.0026172153,0.000097674776,0.00007463885],"category_scores_gemma":[0.00015368604,0.00017746266,0.00012944252,0.0010650384,0.0021306118,0.0007602946,0.0009276936,0.00019628338,0.00036837833],"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.0000053751182,0.00008537398,0.00004929898,0.000022961076,0.0000037214338,0.0000045736656,0.00017999884,0.000006049067,0.00015881703,0.9725425,0.0009784834,0.025962848],"study_design_scores_gemma":[0.00022115764,0.00036984272,0.00043839077,0.000006301398,0.000004138391,0.000036092024,0.000004552838,0.33186007,0.0005169491,0.6633018,0.0029957923,0.0002449089],"about_ca_topic_score_codex":0.000015753201,"about_ca_topic_score_gemma":3.9074743e-7,"teacher_disagreement_score":0.8392011,"about_ca_system_score_codex":0.00008255206,"about_ca_system_score_gemma":0.00009464725,"threshold_uncertainty_score":0.888199},"labels":[],"label_agreement":null},{"id":"W2064871734","doi":"10.1016/j.tcs.2006.06.017","title":"Deterministic M2M multicast in radio networks","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":25,"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 en Outaouais; Carleton University","funders":"","keywords":"Multicast; Computer network; Computer science; Node (physics); Graph; Source-specific multicast; Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.007809796145720538,"score_gpt":0.24408707871843138,"score_spread":0.23627728257271086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064871734","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.004851473,0.000018575824,0.98785716,0.0006193071,0.00035814903,0.00018052527,3.6582196e-7,0.00016377552,0.0059506465],"genre_scores_gemma":[0.79299664,0.0000026507998,0.20660047,0.00027709824,0.00008958507,0.000006797228,7.093019e-7,0.000005644361,0.00002041514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763703,0.00012968884,0.0003342425,0.00064858026,0.0005267254,0.0007237129],"domain_scores_gemma":[0.998738,0.00025377446,0.000045621575,0.00063677283,0.00011710155,0.00020874196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012757065,0.00015599054,0.00018176895,0.00026402553,0.00024050285,0.00057311234,0.0020197835,0.000053012944,0.000039852504],"category_scores_gemma":[0.000060600196,0.0001338655,0.00004198549,0.0016284348,0.0018159894,0.0005568155,0.000714288,0.000226505,0.00005880324],"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.0000027184244,0.00007039489,0.00021094548,0.0000024925098,4.7885544e-7,0.000032259577,0.00007871595,0.049881537,0.000041376385,0.9354398,0.000046258265,0.014192993],"study_design_scores_gemma":[0.00029334406,0.00008098987,0.0035925077,0.000018044999,8.110515e-7,0.000028171027,0.0000011546666,0.9501393,0.00011209996,0.045479737,0.000079849386,0.00017397737],"about_ca_topic_score_codex":0.000011172308,"about_ca_topic_score_gemma":0.0000038235107,"teacher_disagreement_score":0.90025777,"about_ca_system_score_codex":0.000069742135,"about_ca_system_score_gemma":0.00010022283,"threshold_uncertainty_score":0.66910887},"labels":[],"label_agreement":null},{"id":"W2065415255","doi":"10.1016/j.tcs.2014.06.014","title":"H-coloring degree-bounded (acyclic) digraphs","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bounded function; Degree (music); Homomorphism; Conjecture; Upper and lower bounds; Discrete mathematics; Time complexity; Physics","score_opus":0.024553383233821717,"score_gpt":0.2900484033323826,"score_spread":0.26549502009856085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065415255","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.047781482,0.000018672183,0.933469,0.0007935204,0.00064510957,0.00020263986,4.803669e-7,0.0004994426,0.01658963],"genre_scores_gemma":[0.7732795,0.000003425023,0.22604765,0.0004941094,0.00012820387,0.000014225794,2.8823635e-7,0.000012567876,0.000020062547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954775,0.00030735822,0.00035450343,0.0012393582,0.0013302915,0.0012910004],"domain_scores_gemma":[0.9962978,0.0008854019,0.00008291721,0.001847018,0.0002760025,0.00061086286],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037271,0.00028359905,0.00030398124,0.0005020998,0.0009068384,0.0008584656,0.0060723904,0.000069284775,0.000037876216],"category_scores_gemma":[0.00041096818,0.00023644166,0.00012481606,0.0029040964,0.0055690804,0.001448267,0.0024806235,0.00042464165,0.000251798],"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.000009013869,0.000040928793,0.00012386567,0.000005038636,0.0000033563322,0.000006908252,0.00017804402,0.00007381645,0.0011101003,0.8884695,0.000012516481,0.109966874],"study_design_scores_gemma":[0.0002480019,0.00022879588,0.0012762117,0.000019701456,0.0000020439902,0.00003327241,0.0000030987003,0.298584,0.0071010008,0.69165397,0.0005753862,0.00027447892],"about_ca_topic_score_codex":0.000002903027,"about_ca_topic_score_gemma":0.0000011062297,"teacher_disagreement_score":0.72549796,"about_ca_system_score_codex":0.00008389505,"about_ca_system_score_gemma":0.00011239033,"threshold_uncertainty_score":0.99930525},"labels":[],"label_agreement":null},{"id":"W2065444014","doi":"10.1016/j.tcs.2007.11.016","title":"The Magnus–Derek game","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Waterloo","keywords":"Security token; Combinatorial game theory; Mathematical game; Set (abstract data type); Mathematics; Game tree; Computer science; Repeated game; Combinatorics; Game theory; Mathematical economics; Simultaneous game; Computer network","score_opus":0.009851086488203221,"score_gpt":0.26878522570535635,"score_spread":0.25893413921715314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065444014","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.0014764578,0.000031250172,0.9758431,0.003935033,0.00062593777,0.00015033023,1.8522495e-7,0.00021133956,0.017726406],"genre_scores_gemma":[0.82979095,0.00001201592,0.16885613,0.0011469597,0.00009554046,0.0000026555986,1.5830445e-7,0.0000051185375,0.00009047726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744177,0.00008119187,0.00026565557,0.000492539,0.00088619627,0.00083262014],"domain_scores_gemma":[0.9978508,0.00061151735,0.000047820162,0.00087327446,0.00026524076,0.00035136752],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004882241,0.00012419734,0.00010029088,0.00011968173,0.00084658834,0.0010152347,0.0035120696,0.000034370976,0.00003142217],"category_scores_gemma":[0.00014604039,0.00007713894,0.000047990226,0.001417183,0.0034007162,0.00055822654,0.0010941197,0.0002082681,0.00020284967],"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.00000325159,0.00001748532,0.000015141402,0.0000010232369,0.0000010977187,0.0000071032064,0.00023352637,0.00015981276,0.00008880171,0.8981915,0.000103214305,0.101178035],"study_design_scores_gemma":[0.00017354831,0.00013343897,0.00094902783,0.000007495282,9.506235e-7,0.00003680208,0.000009486364,0.7605459,0.0016581011,0.23198612,0.0043318607,0.00016724718],"about_ca_topic_score_codex":0.0000014621348,"about_ca_topic_score_gemma":0.0000013030698,"teacher_disagreement_score":0.8283145,"about_ca_system_score_codex":0.000048546524,"about_ca_system_score_gemma":0.00012693388,"threshold_uncertainty_score":0.99931145},"labels":[],"label_agreement":null},{"id":"W2065463697","doi":"10.1016/j.tcs.2004.02.005","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Binary number; Abelian group; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065463697","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.23148263,0.000033066557,0.76372385,0.0012974993,0.00090491393,0.00011128002,6.7324754e-7,0.0001453499,0.002300754],"genre_scores_gemma":[0.91656834,0.000013765398,0.083057724,0.00026101427,0.000080070444,0.0000051930447,2.0761253e-7,0.00000846037,0.000005210734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972402,0.00018194747,0.00037785078,0.0006321409,0.00085953134,0.0007083669],"domain_scores_gemma":[0.9977956,0.0005199308,0.00012769167,0.0011372877,0.00016848068,0.00025100654],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003352275,0.00021262463,0.00020931411,0.00016928953,0.0012693673,0.00047558485,0.004168345,0.00005292693,0.000023648341],"category_scores_gemma":[0.00011172146,0.00014705896,0.00016870642,0.002112562,0.0046123797,0.0006886302,0.0013390954,0.0003094401,0.000052286447],"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.00001960305,0.00006360052,0.00008131861,0.000004627583,0.000008060892,0.00001143674,0.0010433829,0.00022836574,0.0027476957,0.98094475,0.000013132747,0.014834027],"study_design_scores_gemma":[0.0003953789,0.00024212446,0.00082534744,0.00008123122,0.00000774477,0.00006722635,0.000052943997,0.019731758,0.008495491,0.96964264,0.0001693898,0.00028874702],"about_ca_topic_score_codex":0.00000538657,"about_ca_topic_score_gemma":7.336635e-7,"teacher_disagreement_score":0.6850857,"about_ca_system_score_codex":0.00004805957,"about_ca_system_score_gemma":0.00018354115,"threshold_uncertainty_score":0.9980965},"labels":[],"label_agreement":null},{"id":"W2065887199","doi":"10.1016/j.tcs.2010.06.009","title":"The surviving rate of an infected network","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Integer (computer science); Discrete mathematics; Physics; Computer science; Graph; Operating system","score_opus":0.004482338258743271,"score_gpt":0.2509630541180462,"score_spread":0.24648071585930292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065887199","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.60480076,0.000001690982,0.39155805,0.000062530686,0.0001798714,0.000062742525,5.4685034e-7,0.000045615358,0.0032881664],"genre_scores_gemma":[0.97986716,2.461843e-7,0.01965235,0.00002791567,0.00043912322,0.0000032733235,0.000001221559,0.000005322543,0.0000034081252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998944,0.00012597333,0.00019326311,0.00022930885,0.00017542453,0.00033206373],"domain_scores_gemma":[0.9986325,0.00046093247,0.00007729592,0.0005709689,0.0001561639,0.00010217191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022360375,0.00009102992,0.00013361622,0.00003168852,0.00045877698,0.00015976906,0.0008993836,0.000015565276,0.00014410944],"category_scores_gemma":[0.000019222409,0.00005870525,0.000055952478,0.000689997,0.0024070246,0.00013169764,0.00035420453,0.00021901868,0.000004978478],"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.000002904403,0.000021332467,0.0029856963,3.3966742e-7,0.0000048726315,1.2662363e-7,0.000027624052,0.00023864814,0.001670298,0.9579605,0.000026006479,0.03706165],"study_design_scores_gemma":[0.000049660415,0.000051057057,0.010621248,0.000006154723,0.000007918678,5.1723504e-7,0.0000030311528,0.40547332,0.004176367,0.5793067,0.00020755365,0.00009643096],"about_ca_topic_score_codex":0.000025228133,"about_ca_topic_score_gemma":0.000011024177,"teacher_disagreement_score":0.4052347,"about_ca_system_score_codex":0.0000038015119,"about_ca_system_score_gemma":0.000044231674,"threshold_uncertainty_score":0.88687825},"labels":[],"label_agreement":null},{"id":"W2066234959","doi":"10.1016/j.tcs.2012.11.022","title":"Exploring an unknown dangerous graph using tokens","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"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":"Computer science; Graph; Theoretical computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.1472886519647449,"score_gpt":0.3144289435516493,"score_spread":0.1671402915869044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066234959","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.08685297,0.000022617352,0.90978765,0.00021297378,0.0009421109,0.00012452019,4.0132286e-7,0.0002700512,0.0017867261],"genre_scores_gemma":[0.62271166,0.000006221144,0.37681744,0.00029092396,0.00015931559,0.000004715627,3.670715e-7,0.000006497791,0.0000028451825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973745,0.00017067867,0.0002302152,0.00051457743,0.000738842,0.000971224],"domain_scores_gemma":[0.99812305,0.00009523919,0.00004749752,0.0008270773,0.0001871396,0.0007200209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001974275,0.00016659334,0.00015722649,0.0002775882,0.00059113756,0.0005608813,0.0020148694,0.00003310594,0.000027778095],"category_scores_gemma":[0.00004750168,0.00014048256,0.00004878044,0.0016368135,0.0013564918,0.0050958195,0.0009766982,0.00019056255,0.000053151514],"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.0000016120691,0.00008302499,0.00011410121,0.0000031776726,0.0000017068534,0.0000026301368,0.001508744,0.0023815047,0.00058804353,0.9613906,0.0000042271954,0.033920623],"study_design_scores_gemma":[0.00015112504,0.00013776962,0.0005177679,0.000018021894,0.0000030221165,0.00005469153,0.00001570766,0.97880703,0.0030255644,0.016697256,0.00028476244,0.00028726397],"about_ca_topic_score_codex":0.0000053308845,"about_ca_topic_score_gemma":2.7644856e-7,"teacher_disagreement_score":0.9764255,"about_ca_system_score_codex":0.00006336994,"about_ca_system_score_gemma":0.0000858961,"threshold_uncertainty_score":0.57287127},"labels":[],"label_agreement":null},{"id":"W2066849493","doi":"10.1016/j.tcs.2010.11.009","title":"Block insertion and deletion on trajectories","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Block (permutation group theory); Arithmetic; Mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.005196956732381941,"score_gpt":0.21990452062673832,"score_spread":0.21470756389435638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066849493","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.5770255,0.0000041288677,0.4193518,0.0008918184,0.00071951794,0.00006754393,4.0935575e-7,0.0001983175,0.0017410173],"genre_scores_gemma":[0.9529441,0.0000022416143,0.046194185,0.0007095274,0.00013246003,0.0000036602648,3.5527464e-7,0.0000047297867,0.000008726599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985212,0.000047601596,0.00014832633,0.0005345087,0.0004194476,0.000328902],"domain_scores_gemma":[0.99894285,0.00019263427,0.000037800502,0.00056332175,0.000078158526,0.00018520585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009846534,0.00013299314,0.0001149031,0.00013542037,0.00034465748,0.00042898057,0.0010413296,0.000053222175,0.00001876633],"category_scores_gemma":[0.00007851227,0.00010317984,0.000027522152,0.0005274569,0.0017557208,0.00054423,0.00038783133,0.0002473171,0.00007765981],"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.0000045527277,0.000030645653,0.000041436582,0.0000021145552,8.6229716e-7,0.000003095619,0.00015232946,0.000008080601,0.013085245,0.9418389,0.0000358479,0.0447969],"study_design_scores_gemma":[0.00026507775,0.00042073804,0.011050617,0.000023647392,0.0000032531584,0.00012336316,0.000005086708,0.51129645,0.034638967,0.4412446,0.00060889265,0.0003192938],"about_ca_topic_score_codex":0.0000013542536,"about_ca_topic_score_gemma":8.924398e-7,"teacher_disagreement_score":0.5112884,"about_ca_system_score_codex":0.000014103212,"about_ca_system_score_gemma":0.00004235019,"threshold_uncertainty_score":0.6469026},"labels":[],"label_agreement":null},{"id":"W2068568045","doi":"10.1016/j.tcs.2009.05.031","title":"Size-constrained tree partitioning: Approximating the multicast<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Tree (set theory); Routing (electronic design automation); Computer science; Node (physics); Algorithm; Steiner tree problem; Mathematics; Discrete mathematics; Combinatorics; Computer network","score_opus":0.01088862861760366,"score_gpt":0.22809246227566016,"score_spread":0.2172038336580565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068568045","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.7071076,0.00004203714,0.28704503,0.0005105564,0.00022660608,0.00009118861,0.0000050749463,0.0007164202,0.0042554606],"genre_scores_gemma":[0.7806793,0.000011396589,0.2187593,0.00024329164,0.00021614114,0.000043830314,0.000004908852,0.00003884226,0.0000029934386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706787,0.000046794223,0.0005905342,0.0006084443,0.00066660467,0.0010197549],"domain_scores_gemma":[0.9977585,0.0010379424,0.00015853027,0.00077417534,0.00006401092,0.00020681687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010252794,0.0003291054,0.00022696672,0.000066507004,0.00070838945,0.000418963,0.0011328094,0.00023425929,0.000013241598],"category_scores_gemma":[0.0008508868,0.00029752104,0.00017525624,0.0006517411,0.002617217,0.00047804773,0.0005909522,0.00069094595,0.00011662064],"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.000023416309,0.000047035246,0.0000042474803,0.0000377991,0.000021759624,0.000038633694,0.00033611737,0.03456525,0.00135964,0.9426261,0.00001663474,0.020923363],"study_design_scores_gemma":[0.00029040218,0.00023637587,0.00007731434,0.00022839424,0.000036643825,0.00009724084,0.00012216267,0.9566831,0.0038054106,0.038090505,0.000026604053,0.00030586857],"about_ca_topic_score_codex":0.00000289938,"about_ca_topic_score_gemma":0.000004217653,"teacher_disagreement_score":0.9221178,"about_ca_system_score_codex":0.00002915114,"about_ca_system_score_gemma":0.00007043084,"threshold_uncertainty_score":0.99994767},"labels":[],"label_agreement":null},{"id":"W2068825173","doi":"10.1016/j.tcs.2010.12.065","title":"Fast edge searching and fast searching on graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search problem; Mathematics; Combinatorics; Graph; Enhanced Data Rates for GSM Evolution; Search algorithm; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.027501399335166436,"score_gpt":0.2653047214923998,"score_spread":0.23780332215723338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068825173","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.02545168,0.0000093035405,0.94771534,0.0006018439,0.0002465658,0.00019974032,0.0000010384472,0.00021686051,0.025557652],"genre_scores_gemma":[0.78003615,0.000009361271,0.21928354,0.0006039484,0.0000340315,0.0000045381785,3.3078382e-7,0.000008049769,0.000020068866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971007,0.00023430758,0.00022331259,0.0008197061,0.00085568894,0.00076628],"domain_scores_gemma":[0.9983443,0.0002249001,0.0000428339,0.00069029565,0.00015125926,0.0005463811],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022179063,0.00018626676,0.00017254113,0.00040510605,0.0007636506,0.00070785696,0.0021197328,0.000041709878,0.00005420376],"category_scores_gemma":[0.000081540755,0.0001482325,0.000047134534,0.0011213325,0.0027204014,0.00088421174,0.0016350057,0.0004120724,0.0000867016],"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.0000068469562,0.000055773387,0.00010780699,0.0000066429307,0.000002557658,0.000011731666,0.0032081432,0.0002004332,0.00015692481,0.9058883,0.000015056568,0.09033976],"study_design_scores_gemma":[0.00024317375,0.00043166228,0.0026287558,0.00004981223,0.0000014406044,0.000034891316,0.000025389789,0.78477573,0.00137385,0.21015772,0.000034746947,0.00024281646],"about_ca_topic_score_codex":0.000008202784,"about_ca_topic_score_gemma":6.1706163e-7,"teacher_disagreement_score":0.7845753,"about_ca_system_score_codex":0.000030651627,"about_ca_system_score_gemma":0.000106115454,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W2069082489","doi":"10.1016/j.tcs.2011.04.037","title":"Evolving schemas for streaming XML","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Streaming XML; Programming language; XML; Theoretical computer science; World Wide Web","score_opus":0.02430770528093338,"score_gpt":0.25787714938655976,"score_spread":0.23356944410562638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069082489","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.003359279,0.000040823412,0.9905513,0.00009965292,0.00062958576,0.000218586,0.000004288908,0.00023757631,0.0048589245],"genre_scores_gemma":[0.43253407,8.2224653e-7,0.5672495,0.00010726592,0.000081017555,0.00001277485,5.1276925e-7,0.0000051762254,0.000008887133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801636,0.000034474488,0.00025854676,0.0007035636,0.0003863742,0.0006006807],"domain_scores_gemma":[0.9983671,0.00018616083,0.0000765098,0.0008944358,0.0002453664,0.00023047604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010489234,0.00016840878,0.00019218076,0.00012965652,0.00050694664,0.00010045721,0.0012346891,0.000035577476,0.000031645897],"category_scores_gemma":[0.00015712672,0.00013521318,0.00006557308,0.00061250833,0.001448611,0.0015803394,0.0009522568,0.000101501166,0.000033758846],"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.000004024254,0.000025837893,0.00003540583,0.000011066253,0.0000023352304,0.0000047435324,0.0006112739,0.0000049833507,0.0006786108,0.9757244,0.000028719393,0.022868605],"study_design_scores_gemma":[0.00046872956,0.0004766027,0.0010233306,0.00012996147,0.000007524457,0.000077238714,0.000055704695,0.7432949,0.04372617,0.20628935,0.0038034716,0.00064700434],"about_ca_topic_score_codex":0.0000062299014,"about_ca_topic_score_gemma":7.805456e-7,"teacher_disagreement_score":0.76943505,"about_ca_system_score_codex":0.000040442774,"about_ca_system_score_gemma":0.00010400117,"threshold_uncertainty_score":0.5513833},"labels":[],"label_agreement":null},{"id":"W2069229408","doi":"10.1016/j.tcs.2011.12.018","title":"Coloring vertices of a graph or finding a Meyniel obstruction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Graph factorization; Graph power; Discrete mathematics; Graph coloring; Line graph","score_opus":0.05662253399805527,"score_gpt":0.3083479634721874,"score_spread":0.2517254294741321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069229408","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.20980984,0.000015887968,0.7868361,0.00004254031,0.00040581642,0.00014157074,5.9751784e-7,0.00012464245,0.0026230274],"genre_scores_gemma":[0.7333655,0.0000046398504,0.26654503,0.00003949283,0.00002519671,0.0000073849815,7.194637e-8,0.0000056038466,0.00000712719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974502,0.00013088854,0.00032954893,0.0006569911,0.0007925125,0.00063987426],"domain_scores_gemma":[0.9981773,0.0003663064,0.000110096684,0.0008483933,0.0002497199,0.00024821048],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016245344,0.00016223853,0.00022828621,0.00045868746,0.0003483647,0.00012251876,0.0030593567,0.000047861242,0.00007624166],"category_scores_gemma":[0.00022344696,0.00012130164,0.00007324518,0.0026797568,0.0037300268,0.0012935138,0.0012599515,0.00020877915,0.000020689673],"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.000066521556,0.000052635412,0.00024060869,0.000013482791,0.0000058741384,0.000014979566,0.0014619371,0.000036405458,0.0027657542,0.9718222,0.0000018526802,0.023517748],"study_design_scores_gemma":[0.00031512845,0.00065752014,0.002816296,0.000061394174,0.000006011591,0.000069706235,0.000052348067,0.123820595,0.0931281,0.77881,0.000012996825,0.00024987638],"about_ca_topic_score_codex":0.0000056949416,"about_ca_topic_score_gemma":0.0000010916551,"teacher_disagreement_score":0.52355564,"about_ca_system_score_codex":0.000043702636,"about_ca_system_score_gemma":0.00012992253,"threshold_uncertainty_score":0.99898124},"labels":[],"label_agreement":null},{"id":"W2069939081","doi":"10.1016/j.tcs.2013.11.023","title":"UNO is hard, even for a single player","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Mattel","keywords":"Simple (philosophy); Computer science; Combinatorial game theory; Mathematical economics; Theoretical computer science; Computational complexity theory; Game theory; Repeated game; Mathematics; Algorithm","score_opus":0.032638003009175416,"score_gpt":0.2799198894126399,"score_spread":0.2472818864034645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069939081","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.027595755,0.000020715355,0.9628033,0.0047815973,0.0008574606,0.0005114907,0.0000018402854,0.0002447773,0.003183081],"genre_scores_gemma":[0.7285557,8.5718557e-7,0.26898316,0.002184824,0.00015353759,0.000046593796,2.7153288e-7,0.000009277433,0.00006580242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716115,0.0000537189,0.00035866708,0.0009273577,0.0006632592,0.0008358422],"domain_scores_gemma":[0.997566,0.00049072306,0.000079998754,0.0010577061,0.00047616137,0.0003294492],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008940715,0.00021300685,0.00022063307,0.000165019,0.00044187478,0.0010494498,0.003587595,0.000069805545,0.00025188393],"category_scores_gemma":[0.00019695857,0.00017344342,0.000110286564,0.0008729014,0.002319334,0.0013892878,0.0010120987,0.00014321896,0.0010882488],"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.0000030729448,0.00006722236,0.000028517135,0.0000046346418,0.0000034385282,0.000001660588,0.00083412975,0.00005337385,0.0085069295,0.90556055,0.001328098,0.08360835],"study_design_scores_gemma":[0.000056933462,0.0002450937,0.00014351677,0.00001638793,0.00000238262,0.000016182918,0.0000104618175,0.5045795,0.085092016,0.40885675,0.0007639619,0.00021681463],"about_ca_topic_score_codex":0.0000150179585,"about_ca_topic_score_gemma":4.9010197e-7,"teacher_disagreement_score":0.7009599,"about_ca_system_score_codex":0.0000787208,"about_ca_system_score_gemma":0.000117899894,"threshold_uncertainty_score":0.99998754},"labels":[],"label_agreement":null},{"id":"W2069969963","doi":"10.1016/s0304-3975(01)00245-6","title":"Restriction categories II: partial map classification","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Subcategory; Monad (category theory); Classifier (UML); Partial derivative; Algebraic number; Artificial intelligence; Computer science; Pure mathematics; Functor","score_opus":0.032646085677826904,"score_gpt":0.304483170689957,"score_spread":0.2718370850121301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069969963","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.3649602,0.000011739569,0.6190408,0.0015454016,0.0013971231,0.00015484764,7.670012e-7,0.00016203501,0.012727105],"genre_scores_gemma":[0.9747935,0.000002698187,0.02484271,0.0001592869,0.00012102362,0.000012777724,7.177675e-7,0.000006436479,0.00006086537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852735,0.00021180144,0.00023594612,0.00037146683,0.00027373323,0.00037973412],"domain_scores_gemma":[0.9989904,0.00031025853,0.00006413857,0.00041978757,0.000096937496,0.00011843779],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011800999,0.00011348731,0.00014877015,0.00008779776,0.00062120013,0.000048657086,0.00039376545,0.00009635704,0.0002848185],"category_scores_gemma":[0.0004534925,0.000093610775,0.00003658279,0.00039302456,0.003767232,0.000142194,0.000116775525,0.00018240392,0.00008723813],"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.0000072990733,0.000070418144,0.00010551581,0.0000042693237,0.0000029567043,0.0000041905573,0.0003009399,0.0000014718677,0.00049736904,0.9977271,0.00020437308,0.00107408],"study_design_scores_gemma":[0.0001278899,0.00018789867,0.00028715745,0.0000041921408,0.000010376207,0.000041897016,0.000030648025,0.003557227,0.00800961,0.98670185,0.0009261776,0.00011506936],"about_ca_topic_score_codex":0.0000012302017,"about_ca_topic_score_gemma":6.0228075e-7,"teacher_disagreement_score":0.6098333,"about_ca_system_score_codex":0.00004622896,"about_ca_system_score_gemma":0.000109354594,"threshold_uncertainty_score":0.9989439},"labels":[],"label_agreement":null},{"id":"W2070526994","doi":"10.1016/j.tcs.2008.02.035","title":"Time constrained graph searching","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Visibility; Computer science; Graph; Combinatorics; Theoretical computer science; Mathematics; Geography","score_opus":0.015721146206224182,"score_gpt":0.2531572785783627,"score_spread":0.2374361323721385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070526994","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.012264555,0.00000769871,0.9705285,0.0015649502,0.00017665791,0.00015186972,7.8725293e-7,0.00035554232,0.014949452],"genre_scores_gemma":[0.7038587,0.000006278718,0.29537117,0.00065556297,0.000044249544,0.000002992779,5.7839407e-7,0.0000048705374,0.000055632307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975052,0.00014495986,0.00022174644,0.00060052477,0.00088163454,0.0006459465],"domain_scores_gemma":[0.998452,0.0002182115,0.000037963964,0.0006507965,0.00022339646,0.00041761564],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013958408,0.00014042245,0.00016172002,0.00027180222,0.0008504889,0.00029278675,0.0023650518,0.00003568075,0.00015856928],"category_scores_gemma":[0.00009541131,0.000115755625,0.0000609759,0.0015739284,0.0064986297,0.0008231164,0.00093009503,0.00022414523,0.0004253817],"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.0000021601516,0.000039057624,0.000018329498,0.0000020860216,0.0000022143272,0.00003129462,0.0006814873,0.0013073084,0.0006170187,0.98891276,0.0001344714,0.008251815],"study_design_scores_gemma":[0.00021648155,0.00012979547,0.0001967565,0.00001080748,6.9974874e-7,0.00017738246,0.000002259078,0.9379362,0.0009408384,0.06010943,0.0001050965,0.00017428138],"about_ca_topic_score_codex":0.0000013214751,"about_ca_topic_score_gemma":5.0560942e-8,"teacher_disagreement_score":0.9366289,"about_ca_system_score_codex":0.00003112128,"about_ca_system_score_gemma":0.00026480516,"threshold_uncertainty_score":0.9962051},"labels":[],"label_agreement":null},{"id":"W2070767505","doi":"10.1016/s0304-3975(01)00375-9","title":"PSPACE has constant-round quantum interactive proof systems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"PSPACE; Gas meter prover; Computer-assisted proof; Constant (computer programming); Computer science; Quantum computer; Proof complexity; Mathematics; Proof assistant; Quantum; Discrete mathematics; Theoretical computer science; Automated theorem proving; Algorithm; Mathematical proof; Computational complexity theory; Quantum mechanics; Programming language; Physics; Geometry","score_opus":0.012780086443295102,"score_gpt":0.24749018085049437,"score_spread":0.23471009440719928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070767505","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.035296977,0.00013194905,0.9550339,0.0010981808,0.0026642813,0.000346839,0.0000022109814,0.0003416,0.0050840783],"genre_scores_gemma":[0.892573,0.0000017823801,0.10693865,0.0003047325,0.00013537971,0.000009598166,3.8334812e-7,0.000014629514,0.00002185905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587196,0.00041095386,0.00043204534,0.0012393788,0.0010037842,0.0010418822],"domain_scores_gemma":[0.99720365,0.0006177502,0.00016593093,0.0012096874,0.00034484905,0.0004581199],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021256746,0.0003635714,0.00039774601,0.00028565744,0.0010025031,0.0020422202,0.0027111988,0.0000817457,0.000019088773],"category_scores_gemma":[0.00024767726,0.00028333426,0.00010834224,0.001637806,0.003873476,0.0007360587,0.00086411746,0.00051901944,0.00008398563],"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.000005555285,0.00009008433,0.000018342045,0.000011971595,0.000009212466,0.00004404676,0.0008837485,0.0025554646,0.00026714194,0.9889884,0.0000984191,0.0070276414],"study_design_scores_gemma":[0.00026984277,0.00030843538,0.00004358976,0.00008790318,0.000004633974,0.000341269,0.000034157925,0.8487307,0.0020969284,0.1463762,0.0013326952,0.0003736971],"about_ca_topic_score_codex":0.000009827033,"about_ca_topic_score_gemma":5.019737e-7,"teacher_disagreement_score":0.857276,"about_ca_system_score_codex":0.00011732477,"about_ca_system_score_gemma":0.00046163227,"threshold_uncertainty_score":0.99996185},"labels":[],"label_agreement":null},{"id":"W2072044129","doi":"10.1016/j.tcs.2010.04.041","title":"Reconstructing <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>h</mml:mi><mml:mi>v</mml:mi></mml:math>-convex multi-coloured polyominoes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Polyomino; Combinatorics; Mathematics; Disjoint sets; Intersection (aeronautics); Focus (optics); Regular polygon; Discrete mathematics; Geometry; Physics; Cartography","score_opus":0.01529987571091161,"score_gpt":0.2548659633559216,"score_spread":0.23956608764501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072044129","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.7450059,0.00005467759,0.24556209,0.00059928023,0.0017369557,0.00006127881,0.000016272666,0.0006134102,0.0063501038],"genre_scores_gemma":[0.74104184,0.00001130335,0.2574851,0.00094825466,0.00035272856,0.000064703054,0.000009678903,0.00006877991,0.000017646573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99481344,0.0001222243,0.00083355594,0.0015032799,0.0013453236,0.0013821608],"domain_scores_gemma":[0.99599385,0.00079270534,0.00056909793,0.0017998494,0.00022343552,0.0006210871],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021531465,0.00048122692,0.0002967151,0.0002877844,0.0011168257,0.002883892,0.0042303605,0.00047803918,0.0001524799],"category_scores_gemma":[0.001059727,0.000576787,0.00037014912,0.0010370885,0.0047424342,0.0025513333,0.0034064925,0.0010207454,0.0004621323],"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.000054010066,0.00014515874,0.00002293221,0.00008557846,0.000038163907,0.00016631617,0.0007465828,0.000045699184,0.0050846506,0.96986586,0.00038529575,0.023359742],"study_design_scores_gemma":[0.00038295134,0.00035166988,0.000051400883,0.00024270905,0.000039948955,0.0006392489,0.000046572633,0.7739046,0.19738488,0.02625019,0.00016684378,0.0005389844],"about_ca_topic_score_codex":0.000063949905,"about_ca_topic_score_gemma":0.000020861473,"teacher_disagreement_score":0.9436157,"about_ca_system_score_codex":0.000020161484,"about_ca_system_score_gemma":0.00070221984,"threshold_uncertainty_score":0.99966836},"labels":[],"label_agreement":null},{"id":"W2072220447","doi":"10.1016/j.tcs.2014.07.015","title":"On the maximality of languages with combined types of code properties","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University; Western University","funders":"","keywords":"Decidability; Property (philosophy); Mathematics; Formal language; Regular language; Suffix; Code (set theory); Type (biology); Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Programming language; Linguistics","score_opus":0.009412736562524896,"score_gpt":0.21528818336526637,"score_spread":0.20587544680274147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072220447","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.49012366,0.000011328073,0.5061413,0.0008210305,0.00005921598,0.00009448811,0.0000011024281,0.00005516016,0.0026926908],"genre_scores_gemma":[0.9848905,5.472348e-7,0.0146821225,0.00039711074,0.000016422484,0.0000029465898,1.2243156e-7,0.000004051643,0.0000061378387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986155,0.00016362537,0.0001854082,0.00029616442,0.0005127342,0.00022656062],"domain_scores_gemma":[0.9983676,0.00050005916,0.000095247924,0.0008363552,0.00014105214,0.00005970756],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001649176,0.000108790926,0.00019090636,0.00006161507,0.0001234614,0.000073137686,0.001965637,0.00002131311,0.000018331797],"category_scores_gemma":[0.00013012787,0.000051923394,0.000034333218,0.00047028984,0.0034071556,0.00015953465,0.00042874273,0.000091727336,0.000008441045],"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.000026804106,0.000058078887,0.000044631637,0.000013043284,0.0000041495855,6.527188e-7,0.00036827428,0.00015741093,0.0020698966,0.9912017,0.000010988872,0.006044393],"study_design_scores_gemma":[0.0002738118,0.0013204437,0.0019267249,0.00013694025,0.0000061980113,0.000009062263,0.000027611932,0.56358016,0.13580205,0.296742,0.000015112986,0.00015989393],"about_ca_topic_score_codex":0.0000054110014,"about_ca_topic_score_gemma":4.6800756e-7,"teacher_disagreement_score":0.6944597,"about_ca_system_score_codex":0.000008663019,"about_ca_system_score_gemma":0.00004678064,"threshold_uncertainty_score":0.999305},"labels":[],"label_agreement":null},{"id":"W2072322452","doi":"10.1016/j.tcs.2004.12.027","title":"Constructing divisions into power groups","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Constructive; Modulo; Conjecture; Mathematics; Group (periodic table); Constructive proof; Algebra over a field; Semigroup; Class (philosophy); Group theory; Algebraic number; Block (permutation group theory); Power (physics); Pure mathematics; Discrete mathematics; Computer science; Combinatorics; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.005845672047779444,"score_gpt":0.23981276081340724,"score_spread":0.2339670887656278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072322452","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.11556062,0.00003543568,0.869072,0.0031776952,0.00066904764,0.00009732644,8.0694525e-7,0.00046219924,0.010924867],"genre_scores_gemma":[0.67376953,0.0000011604153,0.32494769,0.0011267976,0.0001393016,0.0000028522393,3.344678e-7,0.000006572353,0.000005752505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972365,0.00010178753,0.0003405163,0.0008465074,0.00075140677,0.0007232917],"domain_scores_gemma":[0.9978914,0.0003952364,0.0000799537,0.0011128354,0.00014237469,0.00037818128],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001698442,0.0002196637,0.00022484151,0.0002197479,0.00068209646,0.0007023729,0.0034944285,0.00005786944,0.00015228137],"category_scores_gemma":[0.00012556296,0.00017661408,0.000088323,0.0012089793,0.0032757649,0.0014454349,0.0021566623,0.00025694087,0.00035833917],"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.0000013420857,0.00003460618,0.000049151888,0.0000015531626,0.0000021407845,0.000008082262,0.0006083983,0.000034136647,0.00035503897,0.8127884,0.00005133043,0.18606581],"study_design_scores_gemma":[0.00021300679,0.0001113406,0.00043486478,0.000032173117,0.000002856164,0.00015205327,0.00004668923,0.58239937,0.004695157,0.4110888,0.0004914408,0.00033223355],"about_ca_topic_score_codex":0.0000024119568,"about_ca_topic_score_gemma":8.6245353e-7,"teacher_disagreement_score":0.5823652,"about_ca_system_score_codex":0.000116128525,"about_ca_system_score_gemma":0.00010245475,"threshold_uncertainty_score":0.99943674},"labels":[],"label_agreement":null},{"id":"W2072365573","doi":"10.1016/s0304-3975(97)00300-9","title":"On computing graph minor obstruction sets","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.013123453322863778,"score_gpt":0.28759454073442914,"score_spread":0.27447108741156534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072365573","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.26984137,0.000013435906,0.72020966,0.00043930198,0.0004443253,0.00018010043,0.0000011151411,0.00035046812,0.008520222],"genre_scores_gemma":[0.8570502,0.0000039484853,0.14219216,0.00062114873,0.00008371744,0.000003794944,6.565703e-7,0.000011320325,0.000033094544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601704,0.00022674484,0.00032260994,0.0011626026,0.0012526881,0.0010183224],"domain_scores_gemma":[0.99746823,0.0005644586,0.00005754612,0.0013080791,0.00017257089,0.0004291361],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015967779,0.0002627982,0.00023748283,0.00040613188,0.00088818563,0.00051407807,0.0035238971,0.00006551036,0.0002954858],"category_scores_gemma":[0.00008957656,0.00022305283,0.00010484537,0.0026048978,0.0036136296,0.0008790144,0.00063297764,0.00041289706,0.00055254006],"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.000017389797,0.00004452534,0.000015449808,0.000002858599,0.0000024138149,0.000015100317,0.00017043264,0.001642161,0.00017071847,0.7139547,0.000028101398,0.28393614],"study_design_scores_gemma":[0.00023175718,0.00028297375,0.0008684895,0.000026643724,0.0000015017648,0.00007195322,0.000002901633,0.35471627,0.0021743816,0.6413053,0.000079482525,0.00023829084],"about_ca_topic_score_codex":0.0000019234799,"about_ca_topic_score_gemma":2.1383835e-7,"teacher_disagreement_score":0.5872088,"about_ca_system_score_codex":0.00008446091,"about_ca_system_score_gemma":0.00008045011,"threshold_uncertainty_score":0.99909794},"labels":[],"label_agreement":null},{"id":"W2072483141","doi":"10.1016/j.tcs.2014.02.041","title":"Causality in physics and computation","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Causality (physics); Theory of relativity; Causal structure; Spacetime; Computation; Theoretical physics; General relativity; Computer science; Theoretical computer science; Physics; Algorithm; Quantum mechanics","score_opus":0.010787520034739989,"score_gpt":0.2622740298283683,"score_spread":0.2514865097936283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072483141","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.06280994,0.000010474102,0.93418723,0.000430763,0.00026554265,0.000087305074,7.9707854e-7,0.00008424814,0.0021237063],"genre_scores_gemma":[0.94816494,8.1888675e-7,0.051479127,0.0002581792,0.00008895886,0.0000030215435,5.8485705e-7,0.0000028571246,0.0000015321656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839896,0.00012249143,0.00021911645,0.00053399365,0.00038048704,0.0003449363],"domain_scores_gemma":[0.99918145,0.00015975203,0.000048679467,0.00036810676,0.00009243636,0.00014959989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015330298,0.00011472759,0.00017578392,0.000064458305,0.00016019231,0.00034458624,0.00077877514,0.000032502256,0.000001301546],"category_scores_gemma":[0.000047968948,0.00009834462,0.000019677913,0.0008306811,0.0010637903,0.0005519788,0.00043370778,0.00012130249,0.000016682934],"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.0000011218235,0.00002335616,0.00048386023,0.000005989013,4.7738445e-7,0.0000017522639,0.00017947941,0.00047869093,0.0000692722,0.87664396,0.000009842971,0.122102186],"study_design_scores_gemma":[0.0001837643,0.00005623764,0.012416302,0.00002133698,5.6021906e-7,0.000009994996,0.0000016719154,0.8006102,0.00020029015,0.18629432,0.00009103313,0.0001142976],"about_ca_topic_score_codex":0.000010971559,"about_ca_topic_score_gemma":0.0000017362103,"teacher_disagreement_score":0.885355,"about_ca_system_score_codex":0.000032229735,"about_ca_system_score_gemma":0.000037025296,"threshold_uncertainty_score":0.40103772},"labels":[],"label_agreement":null},{"id":"W2073028751","doi":"10.1016/s0304-3975(00)00415-1","title":"Taut Monads and T0-spaces","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Mathematics; Algebra over a field; Pure mathematics; Calculus (dental); Combinatorics; Discrete mathematics","score_opus":0.016859425758040274,"score_gpt":0.23232813335385044,"score_spread":0.21546870759581016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073028751","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.0076505872,0.0002631035,0.9747428,0.0013704889,0.00066144473,0.0001363987,1.282636e-7,0.0002629034,0.014912108],"genre_scores_gemma":[0.9730832,0.00001441173,0.026248256,0.00040423858,0.00013741518,0.000005385869,1.0453443e-7,0.0000053192944,0.00010169108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792993,0.0000786972,0.00019400736,0.0006815803,0.00056181813,0.0005539531],"domain_scores_gemma":[0.9987669,0.00013209671,0.000054131695,0.0006385679,0.00009791796,0.00031036246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089041743,0.00016514772,0.00018556081,0.0001259473,0.00041093046,0.0009359935,0.001660815,0.00005278567,0.00005123082],"category_scores_gemma":[0.000048295096,0.00012207191,0.00004009926,0.0007589887,0.0023279784,0.0006244844,0.00089395384,0.00014140473,0.00017726653],"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":[6.1024303e-7,0.00002876037,0.00015518653,0.0000052444007,0.0000019657568,0.000013453269,0.0006479816,0.0000056845997,0.000066786335,0.9270457,0.00014313852,0.07188549],"study_design_scores_gemma":[0.00017027353,0.00023164468,0.00054572034,0.0000030926503,0.0000028551199,0.00011462342,0.000009240975,0.58150923,0.00051663525,0.4132123,0.003437078,0.00024727386],"about_ca_topic_score_codex":0.000007897503,"about_ca_topic_score_gemma":6.8299937e-7,"teacher_disagreement_score":0.9654326,"about_ca_system_score_codex":0.00002509298,"about_ca_system_score_gemma":0.00002258809,"threshold_uncertainty_score":0.9025807},"labels":[],"label_agreement":null},{"id":"W2073076713","doi":"10.1016/j.tcs.2008.03.006","title":"Self-deployment of mobile sensors on a ring","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"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":"Software deployment; Ring (chemistry); Computer science; Visibility; Mathematical proof; Simple (philosophy); Impossibility; RADIUS; Coordinate system; Cover (algebra); Distributed computing; Topology (electrical circuits); Mathematics; Geometry; Physics; Computer network; Combinatorics; Artificial intelligence; Engineering","score_opus":0.015550064127749272,"score_gpt":0.2578851609787024,"score_spread":0.2423350968509531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073076713","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.09802427,0.0000093836115,0.8933218,0.00029359557,0.00021999322,0.00023353397,4.861388e-7,0.00029094034,0.007605962],"genre_scores_gemma":[0.75412834,0.000015263278,0.24559951,0.00020773178,0.000024510215,0.000006919143,1.0367911e-7,0.0000045640877,0.00001305752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793005,0.00009303863,0.00025222995,0.00048183074,0.0008384661,0.00040437139],"domain_scores_gemma":[0.99871457,0.00016573595,0.00005931695,0.0006478276,0.0001856798,0.00022686068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827266,0.00012037401,0.00016769517,0.0002017551,0.00030426943,0.000081553284,0.0015061012,0.000029125755,0.00003038116],"category_scores_gemma":[0.000033449465,0.00009631783,0.00005180355,0.0009972791,0.0013754932,0.00033058724,0.0006183593,0.00013564533,0.00007775616],"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.0000036448453,0.00014813022,0.000041033374,0.0000072894636,0.000002893008,0.0000130495155,0.0012947777,0.011009817,0.00020600001,0.9836702,0.000026537862,0.0035766447],"study_design_scores_gemma":[0.00022674832,0.00050550554,0.00020814198,0.000019808973,0.0000010533211,0.000038240818,0.0000042224437,0.98015183,0.011371754,0.0071354094,0.00020200775,0.00013527628],"about_ca_topic_score_codex":0.0000012563326,"about_ca_topic_score_gemma":3.8880277e-8,"teacher_disagreement_score":0.9765348,"about_ca_system_score_codex":0.000046830213,"about_ca_system_score_gemma":0.00012690102,"threshold_uncertainty_score":0.5068062},"labels":[],"label_agreement":null},{"id":"W2073577522","doi":"10.1016/s0304-3975(02)00543-1","title":"On the closure properties of linear conjunctive languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"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":"Indexed grammar; Context-sensitive grammar; Closure (psychology); Context-free grammar; Definite clause grammar; Mathematics; L-attributed grammar; Phrase structure grammar; Rule-based machine translation; Computer science; Discrete mathematics; Tree-adjoining grammar; Context-free language; Artificial intelligence","score_opus":0.011894322274946273,"score_gpt":0.22842020011947572,"score_spread":0.21652587784452945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073577522","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.3813448,0.00008828882,0.6068668,0.001059737,0.00032064487,0.00018404146,0.000001107611,0.0001222329,0.0100123435],"genre_scores_gemma":[0.9843962,0.0000020128502,0.014447411,0.0010923172,0.000034006964,0.000005326043,7.0612046e-8,0.0000053031104,0.000017316881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982727,0.00023935123,0.00019050934,0.0004067606,0.0005555918,0.00033507549],"domain_scores_gemma":[0.9984198,0.00043316188,0.00006757813,0.00084128155,0.00014918484,0.00008897691],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018206042,0.00014077034,0.00016408083,0.00008237274,0.00030408564,0.00012508879,0.001884906,0.00003384102,0.00004620772],"category_scores_gemma":[0.0003557782,0.000073614894,0.00006240495,0.00056272873,0.002940669,0.00024506135,0.0003404131,0.00016634216,0.00005627842],"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.0000054290326,0.000046788962,0.000013442377,0.000004386122,0.0000040597074,0.000003044898,0.000803558,0.000054013344,0.0026606822,0.9944043,0.00004046284,0.0019598207],"study_design_scores_gemma":[0.00024066475,0.00042820862,0.00023880343,0.00010366065,0.0000053683393,0.000031772743,0.00012708991,0.14638175,0.3350444,0.51701236,0.0001293548,0.0002565565],"about_ca_topic_score_codex":0.0000018873018,"about_ca_topic_score_gemma":1.3059274e-7,"teacher_disagreement_score":0.6030514,"about_ca_system_score_codex":0.00001866226,"about_ca_system_score_gemma":0.00009651094,"threshold_uncertainty_score":0.9997727},"labels":[],"label_agreement":null},{"id":"W2074124111","doi":"10.1016/j.tcs.2008.06.015","title":"Discrete sets with minimal moment of inertia","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Moment of inertia; Moment (physics); Combinatorics; Computer science; Algorithm; Physics; Classical mechanics","score_opus":0.011438740854059583,"score_gpt":0.2512032215195959,"score_spread":0.23976448066553632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074124111","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.08879035,0.000016506927,0.90436417,0.00048041603,0.0000648467,0.000103966246,0.000001040918,0.00027886758,0.005899819],"genre_scores_gemma":[0.58707416,0.0000013041704,0.41276497,0.0001336812,0.000010606502,0.000003823854,1.9929553e-7,0.0000045506627,0.0000067266574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978369,0.000034110046,0.0002614334,0.0005848533,0.0008428436,0.00043984663],"domain_scores_gemma":[0.9985877,0.000076758515,0.0000949853,0.0007814366,0.00025905587,0.00020003172],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00048873585,0.00017112898,0.0002164719,0.00017616925,0.00019707409,0.00020720194,0.0025086096,0.000028254317,0.0000063482557],"category_scores_gemma":[0.000032485408,0.00011871037,0.0000399963,0.0011624551,0.0055071265,0.0013628206,0.0011827084,0.00011378501,0.0000122942065],"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.000016141941,0.0000965741,0.00028053278,0.00001291328,0.000003979042,0.0000506672,0.0005692372,0.000026307634,0.0015755899,0.97225463,0.00008004327,0.025033357],"study_design_scores_gemma":[0.00059219653,0.002242883,0.0074033053,0.00022240961,0.000009403875,0.0007923251,0.00000682129,0.56805545,0.2360199,0.1836715,0.00018604225,0.0007977664],"about_ca_topic_score_codex":0.0000021666758,"about_ca_topic_score_gemma":1.12708e-7,"teacher_disagreement_score":0.78858316,"about_ca_system_score_codex":0.00003346668,"about_ca_system_score_gemma":0.00019293473,"threshold_uncertainty_score":0.9971993},"labels":[],"label_agreement":null},{"id":"W2074771880","doi":"10.1016/j.tcs.2008.08.025","title":"Monotonicity in digraph search problems","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Monotonic function; Mathematics; Combinatorics; Computer science; Discrete mathematics","score_opus":0.023210485426576315,"score_gpt":0.2634368297401455,"score_spread":0.24022634431356918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074771880","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.07559487,0.000020214005,0.9169735,0.0012583262,0.00015530616,0.0002933953,4.266134e-7,0.00018588851,0.00551811],"genre_scores_gemma":[0.85763735,0.000034129745,0.14188439,0.0003837203,0.000024477516,0.000011460152,3.6822544e-7,0.0000053234457,0.000018766623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700475,0.00016920794,0.00030087415,0.0008023429,0.0009361948,0.00078662473],"domain_scores_gemma":[0.99845916,0.00014871682,0.000031468087,0.0008312575,0.00020055861,0.0003288118],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019767866,0.00015171824,0.00019121484,0.00043440238,0.0004431572,0.0002579154,0.0026860426,0.000050230232,0.000040080162],"category_scores_gemma":[0.000058628506,0.00012675517,0.00005213844,0.0029205743,0.002996806,0.0009766101,0.0011346514,0.00032437153,0.00009841879],"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.0000029285322,0.000106646876,0.0013656111,0.000005202786,0.0000011268943,0.000027250675,0.0014053205,0.010087682,0.00018049085,0.980511,0.000022655951,0.006284083],"study_design_scores_gemma":[0.00029807707,0.00013915056,0.006245607,0.000018833947,3.3501777e-7,0.000054750795,0.0000031343482,0.95182246,0.0012514399,0.03990779,0.00007348329,0.00018491174],"about_ca_topic_score_codex":0.000017927665,"about_ca_topic_score_gemma":0.0000022058045,"teacher_disagreement_score":0.9417348,"about_ca_system_score_codex":0.00007164761,"about_ca_system_score_gemma":0.0002679432,"threshold_uncertainty_score":0.99971646},"labels":[],"label_agreement":null},{"id":"W2075116123","doi":"10.1016/j.tcs.2011.02.002","title":"The search for a reduction in combinatory logic equivalent to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>λ</mml:mi><mml:mi>β</mml:mi></mml:math>-reduction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Scroll; Reduction (mathematics); Algorithm; Mathematics; Computer science; Artificial intelligence; Theology; Philosophy; Geometry","score_opus":0.025986079673782147,"score_gpt":0.2623358634728863,"score_spread":0.23634978379910415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075116123","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.8478743,0.000093080824,0.14658007,0.00085107604,0.0022435493,0.00011074381,0.0000092599585,0.0001733189,0.0020646472],"genre_scores_gemma":[0.98044944,0.000044048782,0.018278554,0.0005689879,0.00040514403,0.00017540684,0.000009975579,0.000049968145,0.0000184782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582696,0.00022808988,0.000602639,0.0010875486,0.0011248856,0.0011298928],"domain_scores_gemma":[0.9973094,0.00053311815,0.0002484826,0.001366276,0.00013824341,0.00040447197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003514007,0.0003044896,0.00018589302,0.00023046082,0.0010952334,0.00074815814,0.0026147922,0.00026133118,0.00010292532],"category_scores_gemma":[0.00023809848,0.0003199649,0.0002798388,0.0009481368,0.0022967844,0.00091811916,0.0018684024,0.00050190213,0.00033634834],"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.00018223895,0.00018872415,0.0000025494605,0.000062161715,0.000028912607,0.000041986863,0.0019902575,0.00057329156,0.0017772208,0.9859428,0.00050171895,0.008708167],"study_design_scores_gemma":[0.00047333073,0.0010524823,0.0001327576,0.0001966072,0.000033034972,0.00031448033,0.00026846354,0.8303697,0.074406065,0.092205,0.00015944258,0.00038861873],"about_ca_topic_score_codex":0.00007514981,"about_ca_topic_score_gemma":0.000009336399,"teacher_disagreement_score":0.8937378,"about_ca_system_score_codex":0.000039307535,"about_ca_system_score_gemma":0.00038594852,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W2076087052","doi":"10.1016/j.tcs.2006.05.021","title":"Approximating and computing behavioural distances in probabilistic transition systems","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Functor; Probabilistic logic; Mathematics; Equivalence (formal languages); Metric (unit); Probability measure; Discrete mathematics; Statistics","score_opus":0.01054023630763494,"score_gpt":0.22712271224983321,"score_spread":0.21658247594219826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076087052","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.3376896,0.00006611992,0.66072446,0.00021060827,0.00035080165,0.00031673137,0.0000012388828,0.00019163375,0.0004488116],"genre_scores_gemma":[0.8106363,5.625858e-7,0.18919341,0.000044563778,0.000106566804,0.000009358907,0.0000012868331,0.0000069568464,0.0000010117129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651384,0.00024190021,0.0006614576,0.0010954149,0.00073906244,0.00074832805],"domain_scores_gemma":[0.99853206,0.00044933576,0.0001251936,0.0005688479,0.0001587164,0.00016587497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026027027,0.00026340934,0.00036636123,0.0002372669,0.0004108061,0.0009865838,0.0013794964,0.000064812644,0.0000019369884],"category_scores_gemma":[0.00006250151,0.00022917784,0.000048605496,0.0013711859,0.0023976655,0.0007845356,0.0007128115,0.00026832963,0.0000042959314],"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.0000033109616,0.000118440985,0.0014418626,0.000047044978,9.05474e-7,0.000024835737,0.0006342503,0.011194127,0.00009528306,0.9709526,0.0000015661558,0.015485823],"study_design_scores_gemma":[0.00025208172,0.00010791846,0.016307566,0.00007803031,0.0000031728873,0.000089123976,0.000023349809,0.87001437,0.00006014072,0.112799875,0.000002194411,0.0002622093],"about_ca_topic_score_codex":0.0001512835,"about_ca_topic_score_gemma":0.000013960195,"teacher_disagreement_score":0.8588202,"about_ca_system_score_codex":0.00016843066,"about_ca_system_score_gemma":0.00008143784,"threshold_uncertainty_score":0.951365},"labels":[],"label_agreement":null},{"id":"W2076127862","doi":"10.1016/s0304-3975(02)00069-5","title":"Coding properties of DNA languages","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"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; Saint Mary's University","funders":"","keywords":"DNA computing; Computation; Computer science; Decidability; Coding (social sciences); Theoretical computer science; Programming language; Mathematics","score_opus":0.013384440443422596,"score_gpt":0.2452220632468246,"score_spread":0.231837622803402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076127862","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.9452799,0.00011434297,0.048748065,0.000035242236,0.000087002794,0.000051615705,4.9815304e-7,0.000011989583,0.005671376],"genre_scores_gemma":[0.99378204,0.000004870116,0.0059824,0.00015274424,0.00006037988,9.234904e-7,6.131764e-7,0.0000030785045,0.0000129387445],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922526,0.00006165299,0.00011920299,0.00024727714,0.00013335038,0.00021327089],"domain_scores_gemma":[0.99963266,0.000013156157,0.00003065576,0.00018866282,0.000072940195,0.00006190827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005480988,0.00007388245,0.00009067196,0.000024014087,0.0000949007,0.000024972242,0.00030754402,0.000038775186,0.000014123386],"category_scores_gemma":[0.00018898313,0.000048107144,0.000036930833,0.00014483488,0.001450232,0.0000030863562,0.00018128131,0.00004403791,0.000004102043],"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.0000067318088,0.000019015844,0.00022337309,0.000005389246,0.0000020895982,6.6888134e-7,0.000021889116,0.000010544195,0.72093564,0.2767903,0.0000071417767,0.00197718],"study_design_scores_gemma":[0.000089633024,0.0002246479,0.00031292852,0.000017644394,0.0000021972662,0.0000118618,0.000020383302,0.0009231956,0.9962854,0.0017812526,0.00023762704,0.00009327085],"about_ca_topic_score_codex":5.184957e-7,"about_ca_topic_score_gemma":1.12983294e-7,"teacher_disagreement_score":0.27534968,"about_ca_system_score_codex":0.0000038258895,"about_ca_system_score_gemma":0.000034248995,"threshold_uncertainty_score":0.534344},"labels":[],"label_agreement":null},{"id":"W2076263584","doi":"10.1016/j.tcs.2005.07.013","title":"Decidability of trajectory-based equations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"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; Acadia University","funders":"","keywords":"Catenation; Decidability; Constructive; Mathematics; Quotient; Trajectory; Regular language; Integer (computer science); Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Theoretical computer science; Programming language; Automaton","score_opus":0.012589549041056431,"score_gpt":0.2672837213251435,"score_spread":0.2546941722840871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076263584","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.5451551,0.000012882836,0.45353815,0.00012449829,0.000043382293,0.000050234165,0.0000014836007,0.000009770731,0.0010644854],"genre_scores_gemma":[0.9390111,4.6284057e-7,0.060471587,0.000361589,0.00014538076,0.0000017708413,0.0000031915658,0.000002565679,0.0000023777347],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990736,0.000058452897,0.00017144874,0.00030745534,0.00017455795,0.00021444797],"domain_scores_gemma":[0.9993836,0.00008334408,0.000038526006,0.00028441567,0.0001190998,0.000091000125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007036386,0.00007715099,0.00009307123,0.00003108037,0.00010614645,0.000019763813,0.00042809648,0.00004959697,0.000040269177],"category_scores_gemma":[0.00021966347,0.00005657563,0.000060873655,0.00020884354,0.0018105455,0.0000035359517,0.00016737389,0.000053748867,0.0000072982634],"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.00005996353,0.0002701402,0.0019663824,0.000009309334,0.000005652734,5.1785753e-7,0.000033805558,0.004764858,0.5861594,0.34901014,0.00002691739,0.05769291],"study_design_scores_gemma":[0.0003534791,0.0008049652,0.007065326,0.000012355864,0.0000067454894,0.0000026772059,0.0000039145507,0.2861361,0.69853914,0.006326243,0.0005311303,0.0002179535],"about_ca_topic_score_codex":6.279088e-7,"about_ca_topic_score_gemma":7.9406186e-7,"teacher_disagreement_score":0.39385596,"about_ca_system_score_codex":0.00001066357,"about_ca_system_score_gemma":0.00008238758,"threshold_uncertainty_score":0.667103},"labels":[],"label_agreement":null},{"id":"W2076501806","doi":"10.1016/j.tcs.2007.01.011","title":"Equivalence of simple functions","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","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":"Université du Québec en Outaouais","funders":"","keywords":"Terminal and nonterminal symbols; Mathematics; Simple (philosophy); Equivalence (formal languages); Alphabet; Combinatorics; Deterministic pushdown automaton; Discrete mathematics; Function (biology); Rule-based machine translation; Automaton; Computer science; Automata theory; Theoretical computer science","score_opus":0.012277130162784426,"score_gpt":0.27347997903692145,"score_spread":0.26120284887413703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076501806","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.022760935,0.000024587189,0.97218007,0.00013877456,0.0005556613,0.000080841906,0.000003013524,0.00012760152,0.0041284873],"genre_scores_gemma":[0.77740955,0.0000017081131,0.222357,0.0001383481,0.00008017141,8.536864e-7,8.228682e-7,0.0000031268548,0.000008380106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786884,0.000033053388,0.00031371613,0.0005279408,0.00073826883,0.0005181854],"domain_scores_gemma":[0.9981397,0.00029180004,0.00008445967,0.0009967602,0.00023258895,0.00025469717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020677028,0.00012234203,0.00015768205,0.00019703063,0.00031594443,0.00012919877,0.0025004214,0.00003822218,0.00005684899],"category_scores_gemma":[0.000076686374,0.000095804695,0.000054151293,0.0013661683,0.0019988907,0.0008283114,0.0016515312,0.00013564598,0.000053971617],"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.0000045312154,0.00004835361,0.00009419944,0.00000392003,0.000001300762,0.000005716206,0.00009888427,0.000052379244,0.0023511949,0.8902753,0.00010263511,0.106961556],"study_design_scores_gemma":[0.00031546157,0.000446135,0.0090200165,0.000045627326,0.0000055246933,0.000061787214,0.000017954628,0.7198048,0.035016537,0.23351134,0.0014008732,0.00035393864],"about_ca_topic_score_codex":0.00000642389,"about_ca_topic_score_gemma":4.9973545e-7,"teacher_disagreement_score":0.7546486,"about_ca_system_score_codex":0.00003028259,"about_ca_system_score_gemma":0.00009249119,"threshold_uncertainty_score":0.7364996},"labels":[],"label_agreement":null},{"id":"W2076508696","doi":"10.1016/j.tcs.2005.11.008","title":"Efficient transitive closure of sparse matrices over closed semirings","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transitive closure; Semiring; Transitive relation; Closure (psychology); Transitive reduction; Kleene algebra; Mathematics; Data structure; Sparse matrix; Combinatorics; Computer science; Discrete mathematics; Algorithm; Programming language","score_opus":0.005652773324240412,"score_gpt":0.2308221720461556,"score_spread":0.2251693987219152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076508696","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.21903092,0.000017421473,0.7776124,0.00082944124,0.00019854384,0.00012302266,0.0000021230617,0.000109562556,0.0020765772],"genre_scores_gemma":[0.82308704,0.0000038289395,0.17654009,0.00029898272,0.00005928176,0.0000017437005,3.3581344e-7,0.000004015798,0.0000046518953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810475,0.00006959432,0.00031182298,0.00049963914,0.00066627905,0.00034792957],"domain_scores_gemma":[0.9989286,0.00015666606,0.00010213458,0.0004349794,0.00020338401,0.00017425799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008126767,0.00014635744,0.0001842729,0.00023128529,0.00018355092,0.00014977342,0.0009638992,0.000049379436,0.0001240719],"category_scores_gemma":[0.000032013504,0.000125394,0.000079648846,0.0011472891,0.0015536936,0.00033409722,0.00025272585,0.00013499707,0.000035250538],"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.000009148631,0.000069747795,0.0001909454,0.0000064998217,0.000003860387,0.0000028726995,0.0010904606,0.02942936,0.0012107139,0.90006965,0.000019778035,0.067896955],"study_design_scores_gemma":[0.00032894895,0.00008352429,0.007352962,0.000028245671,0.000005519383,0.00002132044,0.00000765453,0.98172486,0.007175139,0.0030315025,0.00007446316,0.00016583753],"about_ca_topic_score_codex":0.0000025846205,"about_ca_topic_score_gemma":0.0000010509799,"teacher_disagreement_score":0.95229554,"about_ca_system_score_codex":0.000055213077,"about_ca_system_score_gemma":0.00011553675,"threshold_uncertainty_score":0.5724649},"labels":[],"label_agreement":null},{"id":"W2076959711","doi":"10.1016/j.tcs.2010.07.005","title":"Equations on palindromes and circular words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"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":"Polyomino; Bijection; Mathematics; Palindrome; Translation (biology); Combinatorics; Boundary (topology); Pure mathematics; Plane (geometry); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.008528305360565884,"score_gpt":0.24131079689579749,"score_spread":0.2327824915352316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076959711","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.22876331,0.000010144929,0.76670367,0.001408561,0.0006795375,0.00008209072,8.2461986e-7,0.00019280039,0.00215908],"genre_scores_gemma":[0.92459655,0.0000016474778,0.074326485,0.000952296,0.00010629683,0.000004768154,3.5467528e-7,0.0000054855086,0.000006133305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982316,0.000054788903,0.00016821147,0.00062260433,0.00051263964,0.0004101474],"domain_scores_gemma":[0.9982633,0.00047509678,0.00003974715,0.0008896861,0.000069029404,0.0002631404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013625899,0.00014522762,0.00013969047,0.00017506738,0.00043601272,0.0005615404,0.0017073052,0.000052999338,0.00005096004],"category_scores_gemma":[0.00016112557,0.00011365641,0.000038751412,0.0007030473,0.0023503255,0.00047580074,0.00070375804,0.0002873648,0.000088385736],"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.000001046168,0.000032258322,0.000030301635,0.0000020179461,0.0000015689477,0.00000757588,0.0002566384,0.000011904468,0.0023401643,0.93042463,0.000008577993,0.06688331],"study_design_scores_gemma":[0.00013168357,0.00011298758,0.001693963,0.000012589448,0.0000022256268,0.00004562109,0.000004547526,0.48762414,0.0035151674,0.5065577,0.00011988482,0.00017948588],"about_ca_topic_score_codex":0.0000015313208,"about_ca_topic_score_gemma":3.6041513e-7,"teacher_disagreement_score":0.6958332,"about_ca_system_score_codex":0.000012319761,"about_ca_system_score_gemma":0.0000667101,"threshold_uncertainty_score":0.8659872},"labels":[],"label_agreement":null},{"id":"W2077484872","doi":"10.1016/j.tcs.2004.03.057","title":"Longest increasing subsequences in sliding windows","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Subsequence; Sliding window protocol; Longest increasing subsequence; Sequence (biology); Generalization; Longest common subsequence problem; Algorithm; Combinatorics; Mathematics; Window (computing); Computer science; Mathematical analysis","score_opus":0.012254478362827302,"score_gpt":0.25266471317457145,"score_spread":0.24041023481174414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077484872","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.25637257,0.000054618184,0.74136597,0.00066687807,0.00039766647,0.000104881554,6.978919e-7,0.00013226137,0.00090448355],"genre_scores_gemma":[0.73048717,0.0000074826607,0.26915497,0.00025128954,0.000090002664,0.0000034067075,5.6383317e-7,0.0000044096214,7.145033e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734837,0.00011262122,0.0003063611,0.00082316436,0.00072919513,0.0006803194],"domain_scores_gemma":[0.9986191,0.00019203314,0.000054280463,0.00078258035,0.00009006623,0.00026195843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002179623,0.0001869075,0.00021050045,0.0002965841,0.0003913267,0.0006580037,0.0030126756,0.000053460648,0.000011735958],"category_scores_gemma":[0.00012434865,0.00014975053,0.000041433705,0.0016753253,0.001228992,0.0018845004,0.0015455645,0.00025516792,0.000056895937],"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.00000508974,0.00005146077,0.00029565586,0.0000033979034,7.5133175e-7,0.000088379005,0.0003609066,0.0017794123,0.0011397307,0.9738805,0.0000020570765,0.022392638],"study_design_scores_gemma":[0.00074075366,0.00022705183,0.013506223,0.0002794607,0.0000024245417,0.00032460972,0.000019162218,0.631959,0.012717753,0.33965278,0.00006193501,0.0005088016],"about_ca_topic_score_codex":0.00010907078,"about_ca_topic_score_gemma":0.000007979629,"teacher_disagreement_score":0.63422775,"about_ca_system_score_codex":0.00015117989,"about_ca_system_score_gemma":0.00022765361,"threshold_uncertainty_score":0.63451445},"labels":[],"label_agreement":null},{"id":"W2077525424","doi":"10.1016/j.tcs.2009.02.023","title":"On the similarity metric and the distance metric","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":126,"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":"Division of Mathematical Sciences; National University of Singapore","keywords":"Metric (unit); Similarity (geometry); Mathematics; String metric; Measure (data warehouse); Fisher information metric; Metric space; Equivalence of metrics; Convex metric space; Discrete mathematics; Artificial intelligence; Computer science; Data mining; Image (mathematics)","score_opus":0.01072900924257724,"score_gpt":0.24329269683461782,"score_spread":0.23256368759204057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077525424","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.010819455,0.00020367876,0.9578375,0.025094623,0.0005096057,0.0004676372,0.0000012335639,0.00020805496,0.0048581753],"genre_scores_gemma":[0.9503016,0.000013263039,0.04390583,0.005644714,0.00011166726,0.000008342065,1.3329002e-7,0.0000049567375,0.0000094941715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580306,0.0005775063,0.00037366062,0.0010998646,0.0013964972,0.00074943725],"domain_scores_gemma":[0.9923295,0.0051399274,0.0001107734,0.001929966,0.00023176968,0.00025805575],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0066304947,0.00029846933,0.00034910333,0.0003025532,0.0011782043,0.0012027499,0.0054641557,0.00005851793,0.000021605949],"category_scores_gemma":[0.001436179,0.00014428799,0.0001228545,0.006135699,0.006713334,0.00046149062,0.001556262,0.0005309744,0.000035129513],"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.000015893274,0.000074944415,0.000018201856,0.0000016795229,0.0000030486194,0.000006285916,0.00021442249,0.00022787177,0.00000447166,0.9225156,0.000075503965,0.076842085],"study_design_scores_gemma":[0.00026239612,0.00018835017,0.00422007,0.0000062261684,0.0000045030392,0.000020367212,0.000002937388,0.47344404,0.00013138409,0.5215073,0.0000757797,0.00013661118],"about_ca_topic_score_codex":0.000004882281,"about_ca_topic_score_gemma":6.232655e-7,"teacher_disagreement_score":0.93948215,"about_ca_system_score_codex":0.00009998308,"about_ca_system_score_gemma":0.00009408786,"threshold_uncertainty_score":0.99991673},"labels":[],"label_agreement":null},{"id":"W2077734953","doi":"10.1016/j.tcs.2013.08.011","title":"Randomised broadcasting: Memory vs. randomness","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Node (physics); Randomness; Broadcasting (networking); Computer science; Degree (music); Upper and lower bounds; Binary logarithm; Channel (broadcasting); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Computer network; Theoretical computer science; Statistics","score_opus":0.007172847384616654,"score_gpt":0.22012452561771562,"score_spread":0.21295167823309896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077734953","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.027359204,0.000044930297,0.9567742,0.0013033744,0.0012972387,0.000893312,2.5535826e-7,0.000491296,0.011836223],"genre_scores_gemma":[0.87240493,0.0000039272263,0.12572162,0.0014052892,0.00030216196,0.00009871295,4.4690003e-7,0.00001423285,0.000048663303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959133,0.0002737361,0.00052089634,0.0011271525,0.0010659146,0.0010989821],"domain_scores_gemma":[0.99633366,0.0009776484,0.00013134496,0.0015649797,0.00038775938,0.0006046364],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024744887,0.00031683123,0.00045823562,0.0001959539,0.0005664513,0.0012609533,0.004843178,0.00008787686,0.00039714837],"category_scores_gemma":[0.00023108862,0.0002464566,0.00014561765,0.0015934001,0.0031311058,0.0015963173,0.0018428284,0.00034802657,0.00080689875],"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.000083324456,0.00006397192,0.000018432125,0.000008088188,0.000006660546,0.000016152237,0.0003446713,0.0008242732,0.0005754811,0.84815747,0.0007126201,0.14918888],"study_design_scores_gemma":[0.0059205266,0.00013426374,0.00042166255,0.000034121796,0.0000055667565,0.00007224591,0.0000040570976,0.90916026,0.0027539053,0.08099136,0.00013016487,0.00037189276],"about_ca_topic_score_codex":0.000011278117,"about_ca_topic_score_gemma":2.5417802e-7,"teacher_disagreement_score":0.908336,"about_ca_system_score_codex":0.0000689649,"about_ca_system_score_gemma":0.00016926364,"threshold_uncertainty_score":0.99999875},"labels":[],"label_agreement":null},{"id":"W2077987919","doi":"10.1016/j.tcs.2012.10.040","title":"Combinatorial properties of double square tiles","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":14,"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":"Square (algebra); Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.02192587794218105,"score_gpt":0.2611460789304941,"score_spread":0.23922020098831304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077987919","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.07068914,0.00016288391,0.91609335,0.0002595933,0.0009791767,0.00016713842,5.3954415e-7,0.00048792758,0.011160266],"genre_scores_gemma":[0.8794613,0.0000011202455,0.12031804,0.00008990987,0.000110296845,0.000007882544,1.4938212e-7,0.0000068780328,0.000004453842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99802434,0.000040076025,0.0002691142,0.00036351825,0.00072837283,0.00057454605],"domain_scores_gemma":[0.99862415,0.000050644616,0.00008890665,0.00070829573,0.00030208591,0.00022591623],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011760159,0.00015549765,0.00020476498,0.00016064025,0.00017841243,0.00044602822,0.0026216744,0.000044388995,0.000007187116],"category_scores_gemma":[0.00006667334,0.00011692611,0.000053369273,0.0009107905,0.003167966,0.0028717208,0.0015669374,0.00011981297,0.000031575633],"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.0000099820345,0.00014532685,0.00012978277,0.000023951787,0.0000017530883,7.338199e-7,0.00049591984,0.0000015884553,0.0043408675,0.97956175,0.000035549874,0.015252789],"study_design_scores_gemma":[0.0003162482,0.00020549784,0.00025636397,0.00012444286,0.000004102367,0.000029138162,0.0000070083306,0.03027565,0.69066054,0.2776846,0.00015164685,0.00028479713],"about_ca_topic_score_codex":0.0000027085412,"about_ca_topic_score_gemma":2.9431188e-8,"teacher_disagreement_score":0.80877215,"about_ca_system_score_codex":0.000038240043,"about_ca_system_score_gemma":0.00011749436,"threshold_uncertainty_score":0.99954486},"labels":[],"label_agreement":null},{"id":"W2078140591","doi":"10.1016/j.tcs.2014.11.008","title":"Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Bipartite graph; Function (biology); Approximation algorithm; Value (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Boolean function; Time complexity; Integer (computer science); Algorithm; Computer science","score_opus":0.026753670774554365,"score_gpt":0.26676395496704475,"score_spread":0.24001028419249038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078140591","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.006870815,0.00006744976,0.9904788,0.0013528616,0.0005614201,0.0003522021,0.0000012732934,0.00009985801,0.00021528937],"genre_scores_gemma":[0.7277764,0.000004887764,0.27191317,0.00017441214,0.00010296289,0.00001873865,3.8492638e-7,0.0000045810357,0.000004425932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795026,0.00011715011,0.0002951887,0.00052597735,0.000487751,0.0006236689],"domain_scores_gemma":[0.9978059,0.0010417913,0.00009194614,0.0007379685,0.00015487787,0.00016753023],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0032907438,0.00015572167,0.00020826336,0.0001229286,0.0013176731,0.0005132685,0.0018844848,0.000035248973,0.0000030705723],"category_scores_gemma":[0.00014487197,0.00010602309,0.0000894515,0.0008686122,0.0038929633,0.0004603858,0.0010663474,0.00014493444,0.0000033753458],"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.0000021202586,0.00003880658,0.000022416305,0.000010631889,0.000005173026,2.8722894e-7,0.00045053934,0.00046394154,0.00011918635,0.8545959,0.000006415807,0.14428458],"study_design_scores_gemma":[0.00013832514,0.00023014788,0.00032624684,0.000028502693,0.000006043165,0.000013892533,0.00000836162,0.6710248,0.00027725872,0.32764065,0.00020244831,0.0001033039],"about_ca_topic_score_codex":0.000008342545,"about_ca_topic_score_gemma":0.0000016740122,"teacher_disagreement_score":0.7209056,"about_ca_system_score_codex":0.000020857338,"about_ca_system_score_gemma":0.00005954577,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W2079050722","doi":"10.1016/j.tcs.2014.01.025","title":"On lattices from combinatorial game theory modularity and a representation theorem: Finite case","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Distributive property; Distributive lattice; Modular design; Mathematics; Closure (psychology); Modularity (biology); Representation (politics); Set (abstract data type); Context (archaeology); Finite set; Representation theorem; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.02126817729949018,"score_gpt":0.2903496638602661,"score_spread":0.26908148656077596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079050722","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.25939393,0.000012433952,0.73619205,0.00044491037,0.0010385462,0.00014472647,0.0000022163129,0.00016716252,0.002604012],"genre_scores_gemma":[0.9628086,0.0000029652015,0.03617366,0.00073775026,0.0002541854,0.000007479338,8.9908025e-7,0.0000099218605,0.0000045107745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996712,0.00065049867,0.00034527297,0.0010815186,0.00071637536,0.00049427705],"domain_scores_gemma":[0.99358284,0.0046300623,0.00011783167,0.0011831792,0.00018520688,0.00030085305],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002809983,0.00023566312,0.0002633994,0.00017117352,0.00048398672,0.00085372844,0.0016481172,0.00008943859,0.000040132523],"category_scores_gemma":[0.0013225423,0.00019235461,0.00005991709,0.0006837925,0.0038770244,0.00083954586,0.0010585123,0.00029878368,0.000096386975],"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.00003021156,0.000060404556,0.000056099965,0.0000022430593,0.000004580814,0.00006995568,0.0012921556,0.00044799192,0.00009049864,0.89695823,0.0000070440447,0.10098056],"study_design_scores_gemma":[0.0000946603,0.00016811474,0.000116443465,0.000014739305,0.0000046173013,0.000035117435,0.000013554816,0.45944086,0.003371884,0.53658605,0.000018087416,0.00013587254],"about_ca_topic_score_codex":0.00004682338,"about_ca_topic_score_gemma":0.0000026452649,"teacher_disagreement_score":0.7034147,"about_ca_system_score_codex":0.000039566974,"about_ca_system_score_gemma":0.000048487418,"threshold_uncertainty_score":0.99883384},"labels":[],"label_agreement":null},{"id":"W2079125934","doi":"10.1016/j.tcs.2011.05.043","title":"Fuzzy quartile encoding as a preprocessing method for biomedical pattern classification","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pattern recognition (psychology); Feature (linguistics); Outlier; Artificial intelligence; Fuzzy logic; Mathematics; Quartile; Fuzzy set; Fuzzy classification; Preprocessor; Data mining; Feature vector; Computer science; Statistics","score_opus":0.03899991989929513,"score_gpt":0.2990199429433027,"score_spread":0.26002002304400756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079125934","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.0021203726,0.000024655687,0.9650188,0.0007015467,0.00070914003,0.0003434951,0.0000012597778,0.0002726374,0.030808093],"genre_scores_gemma":[0.69263524,6.1283504e-7,0.30665743,0.00048370493,0.00015403914,0.000053088555,6.949837e-7,0.000006365785,0.0000088537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701506,0.00016542098,0.00042492288,0.0010226688,0.0007047501,0.0006671834],"domain_scores_gemma":[0.9980644,0.0003836411,0.00014635458,0.0008092462,0.00024944192,0.00034690253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032028584,0.00019549068,0.00026344866,0.00018515682,0.0004987338,0.00039441665,0.0025192958,0.00009101121,0.000016785794],"category_scores_gemma":[0.00019615666,0.00015082955,0.000098881224,0.0008283238,0.0011968508,0.0007165549,0.00048861874,0.00014729079,0.000086078646],"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.000009800243,0.000065636894,0.000028011402,0.000014728977,0.0000035788776,0.000003857902,0.0015351112,0.000002430936,0.0018002043,0.7812494,0.000030182577,0.21525708],"study_design_scores_gemma":[0.00026512638,0.0003252422,0.00040422825,0.000035780886,0.0000060792718,0.000044753997,0.000043517346,0.5061184,0.0014239284,0.49104968,0.00009253509,0.00019070868],"about_ca_topic_score_codex":0.000023763898,"about_ca_topic_score_gemma":6.888657e-7,"teacher_disagreement_score":0.69051486,"about_ca_system_score_codex":0.000063204716,"about_ca_system_score_gemma":0.00020961315,"threshold_uncertainty_score":0.61506504},"labels":[],"label_agreement":null},{"id":"W2079567772","doi":"10.1016/j.tcs.2014.11.015","title":"Descriptional complexity of unambiguous input-driven pushdown automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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; Academy of Finland","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Homomorphism; Büchi automaton; Two-way deterministic finite automaton; Nested word; Nondeterministic finite automaton; Deterministic automaton; Mathematics; Deterministic context-free grammar; Combinatorics; Automaton; Computer science; Theoretical computer science; Automata theory; Quantum finite automata; Rule-based machine translation; Context-free grammar; Artificial intelligence","score_opus":0.02080017538274525,"score_gpt":0.24438166321694996,"score_spread":0.2235814878342047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079567772","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.08036755,0.0000101067435,0.9130487,0.0010798757,0.0006746016,0.00012103572,0.000004537454,0.0003677439,0.004325851],"genre_scores_gemma":[0.75350386,0.0000014749909,0.24580984,0.0005684405,0.00009789076,0.000003589004,0.0000025385732,0.0000074472537,0.000004924559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680066,0.0002379035,0.0004557879,0.00080553663,0.0010595337,0.0006405648],"domain_scores_gemma":[0.99754965,0.00029012072,0.00015498606,0.0014281463,0.0002646989,0.00031237537],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022217303,0.00023543672,0.0003589584,0.00024942268,0.00036865383,0.00030995999,0.0042932928,0.00006690416,0.000073312105],"category_scores_gemma":[0.00015639608,0.00019567374,0.00011147454,0.0011303572,0.006976736,0.00078997895,0.00189884,0.00020515439,0.00010345535],"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.0000073060505,0.00011145352,0.000074625954,0.000011972935,0.0000045211727,0.0000031224513,0.00020156972,0.00018574671,0.0028691285,0.9624186,0.000051026742,0.034060907],"study_design_scores_gemma":[0.00020875946,0.00022306618,0.0039700246,0.00002798042,0.0000030092522,0.00003761056,0.0000021462963,0.5841883,0.0024866965,0.40855286,0.00013395402,0.00016564071],"about_ca_topic_score_codex":0.000010846136,"about_ca_topic_score_gemma":7.8249576e-7,"teacher_disagreement_score":0.6731363,"about_ca_system_score_codex":0.00005888588,"about_ca_system_score_gemma":0.00013378527,"threshold_uncertainty_score":0.9957257},"labels":[],"label_agreement":null},{"id":"W2079582928","doi":"10.1016/j.tcs.2009.05.001","title":"On the descriptional complexity of Watson–Crick automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":32,"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; Western University","funders":"","keywords":"Watson; Automaton; Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Unary operation; Automata theory; Mathematics; Finite-state machine; Regular language; DFA minimization; Deterministic finite automaton; Discrete mathematics; Quantum finite automata; Combinatorics; Computer science; Theoretical computer science; Algorithm; DNA; Base pair","score_opus":0.030091879344747684,"score_gpt":0.2660095653318389,"score_spread":0.2359176859870912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079582928","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.8958036,0.000013749835,0.097468264,0.0017372343,0.00011647553,0.0000863324,0.0000031407685,0.000019461819,0.004751779],"genre_scores_gemma":[0.9909761,0.0000019549482,0.0070345416,0.0018616691,0.000113027025,7.154006e-7,0.0000040763193,0.0000020528955,0.000005868783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998951,0.00007920287,0.00015139625,0.00030815328,0.00026105501,0.000249196],"domain_scores_gemma":[0.99939144,0.000062280924,0.00004247142,0.0003403412,0.0000904629,0.00007303054],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007242225,0.00009789112,0.00009975793,0.000023435623,0.00020314207,0.000038571052,0.00074425543,0.000043914053,0.000038715945],"category_scores_gemma":[0.00014622479,0.000053398504,0.000060712588,0.00019422181,0.0029163563,0.0000033443994,0.00024711253,0.00008961764,0.0000115267385],"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.000037703314,0.00007257115,0.000030640458,9.880837e-7,0.0000020816103,6.3012476e-7,0.000011068235,0.00004136519,0.07557944,0.9179843,0.00017922174,0.0060599633],"study_design_scores_gemma":[0.000370516,0.003986237,0.02937521,0.000035908583,0.000007289793,0.000030751147,0.000010068553,0.06441842,0.16796449,0.73301095,0.00047598075,0.0003141979],"about_ca_topic_score_codex":5.714228e-7,"about_ca_topic_score_gemma":9.66438e-8,"teacher_disagreement_score":0.18497339,"about_ca_system_score_codex":0.000007578642,"about_ca_system_score_gemma":0.000032109685,"threshold_uncertainty_score":0.9997971},"labels":[],"label_agreement":null},{"id":"W2080292561","doi":"10.1016/j.tcs.2011.08.026","title":"Counting maps on doughnuts","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.024539384326035415,"score_gpt":0.2379872145340342,"score_spread":0.2134478302079988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080292561","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.014730193,0.000013050161,0.94175124,0.00056492,0.0004715442,0.00006654601,0.000002378738,0.00024952504,0.0421506],"genre_scores_gemma":[0.86345446,0.0000030514577,0.13506642,0.0013640797,0.00008289874,0.0000028057214,6.9341263e-7,0.0000032391185,0.000022364657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745595,0.00007596558,0.0002492343,0.00082401244,0.0007737036,0.0006211465],"domain_scores_gemma":[0.99828917,0.00022170357,0.000068442016,0.0010011423,0.00013257841,0.00028697323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014981016,0.00016883106,0.00020499101,0.00036247808,0.00039843732,0.0003068142,0.0037671097,0.00004936736,0.00022181144],"category_scores_gemma":[0.00017146481,0.00011565141,0.0000827632,0.003214556,0.0020024052,0.00064602104,0.0013488166,0.00019589621,0.0006614558],"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.0000038883236,0.00007537856,0.000120344805,0.0000011197717,0.000003568512,0.000021350736,0.00015333023,0.000009293576,0.000023766373,0.9550435,0.000113846,0.04443059],"study_design_scores_gemma":[0.00025677565,0.00065836083,0.008156863,0.000020772015,0.000011084993,0.000037996157,0.000008882559,0.13439894,0.0046101063,0.849827,0.0015366124,0.00047664728],"about_ca_topic_score_codex":0.000011320735,"about_ca_topic_score_gemma":3.0568506e-7,"teacher_disagreement_score":0.84872425,"about_ca_system_score_codex":0.00003302332,"about_ca_system_score_gemma":0.000042790674,"threshold_uncertainty_score":0.8501897},"labels":[],"label_agreement":null},{"id":"W2080616298","doi":"10.1016/j.tcs.2012.02.001","title":"A linear partitioning algorithm for Hybrid Lyndons using<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>V</mml:mi></mml:math>-order","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lexicographical order; Factorization; Algorithm; Concatenation (mathematics); Order (exchange); String (physics); Computer science; Generalization; Mathematics; Edit distance; Discrete mathematics; Combinatorics","score_opus":0.019122432015830432,"score_gpt":0.26413282971905006,"score_spread":0.2450103977032196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080616298","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.34223112,0.000068498586,0.65592986,0.00016790374,0.001143543,0.00006876726,0.000043348842,0.00013945629,0.00020749339],"genre_scores_gemma":[0.5567214,0.000014254551,0.4416719,0.0006404144,0.00082589866,0.000050804192,0.000032335578,0.000034499564,0.000008498381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626637,0.00008926579,0.0005222687,0.0009102781,0.0010237467,0.001188091],"domain_scores_gemma":[0.9973158,0.00049558823,0.00026445815,0.0012000898,0.00018623123,0.00053781236],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016051279,0.00033068308,0.00023727724,0.00012307266,0.0014095709,0.00087746035,0.0019081504,0.00016839332,0.00002877911],"category_scores_gemma":[0.00021121763,0.0003281863,0.00023285775,0.00065532455,0.0014752942,0.0018186383,0.0022003418,0.00037430707,0.00024655898],"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.000024395975,0.0001559983,0.0000045439574,0.000029671099,0.00002263862,0.00003080219,0.00030008357,0.00090419245,0.00025862214,0.9827981,0.0002011155,0.015269818],"study_design_scores_gemma":[0.00044047448,0.00030427033,0.000032833934,0.00015920094,0.000042103526,0.0002766438,0.000020042064,0.9854792,0.0051183132,0.0066598053,0.0010899965,0.00037711885],"about_ca_topic_score_codex":0.000049465398,"about_ca_topic_score_gemma":0.0000017214027,"teacher_disagreement_score":0.98457503,"about_ca_system_score_codex":0.000026258025,"about_ca_system_score_gemma":0.00032894177,"threshold_uncertainty_score":0.99991703},"labels":[],"label_agreement":null},{"id":"W2080745503","doi":"10.1016/j.tcs.2007.05.011","title":"Map construction of unknown graphs by multiple agents","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"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":"Rendezvous; Traverse; Graph; Computer science; Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Algorithm","score_opus":0.01071225163422513,"score_gpt":0.2594873612681509,"score_spread":0.2487751096339258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080745503","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.016809197,0.000014964098,0.97947294,0.00043984776,0.0005698132,0.00014905533,0.0000016322673,0.000112325826,0.0024302574],"genre_scores_gemma":[0.67629135,0.000004046058,0.32347828,0.00019355024,0.000015365678,0.0000010491914,9.999135e-7,0.0000031874195,0.0000121540415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796975,0.00006497555,0.0003187314,0.0004548858,0.00071646133,0.00047522353],"domain_scores_gemma":[0.99866325,0.000208043,0.00008581177,0.00049577863,0.00027474924,0.00027235268],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001867603,0.00011625553,0.0001457769,0.00022428636,0.00022884824,0.00015024868,0.0015296012,0.000046384655,0.000056697256],"category_scores_gemma":[0.00006344343,0.00009899014,0.00005019026,0.0010710801,0.002948696,0.0005235983,0.00053009205,0.00013099663,0.00003666134],"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.000005120755,0.000056279277,0.00033928323,0.00000633767,0.0000023548785,0.000002005952,0.00019023549,0.00015255851,0.0012645109,0.96794814,0.0001964916,0.029836703],"study_design_scores_gemma":[0.00044884614,0.00020554209,0.00073166477,0.000022318622,0.0000021425851,0.000018389199,0.000010297009,0.8393288,0.0284041,0.12962288,0.0009966564,0.00020832343],"about_ca_topic_score_codex":0.000003911548,"about_ca_topic_score_gemma":5.743824e-7,"teacher_disagreement_score":0.8391763,"about_ca_system_score_codex":0.000031569827,"about_ca_system_score_gemma":0.000067234796,"threshold_uncertainty_score":0.9997647},"labels":[],"label_agreement":null},{"id":"W2081745941","doi":"10.1016/j.tcs.2012.03.043","title":"Lower bounds for the size of deterministic unranked tree automata","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Automaton; Deterministic finite automaton; Deterministic automaton; Mathematics; Combinatorics; Upper and lower bounds; Tree (set theory); Discrete mathematics; Regular language; Computer science; Automata theory; Theoretical computer science","score_opus":0.013030139263550754,"score_gpt":0.2616167939493669,"score_spread":0.24858665468581612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081745941","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.03175521,0.00009147677,0.96363866,0.00087139447,0.0017585088,0.00029452782,0.0000048496668,0.0001871513,0.0013982154],"genre_scores_gemma":[0.8989343,0.0000032037806,0.10014303,0.00064279325,0.00022759239,0.00002066695,2.9289924e-7,0.000010127199,0.000018010038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976399,0.000090979076,0.0003643415,0.00045588345,0.0006339855,0.0008149029],"domain_scores_gemma":[0.99475694,0.0033062494,0.00012532582,0.0014196782,0.00015026139,0.00024152565],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003072004,0.00020364656,0.00026114186,0.00008136944,0.0004877332,0.00029162504,0.003988701,0.000054130185,0.00003599824],"category_scores_gemma":[0.00040150233,0.00012645382,0.00014076672,0.0007860729,0.0036139365,0.0007454467,0.0010462314,0.00012343675,0.000028176251],"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.00001462426,0.00010526474,0.000031532792,0.000011631285,0.0000067941132,0.000001125983,0.000435096,0.000012815042,0.00089780905,0.9310525,0.0000978453,0.06733297],"study_design_scores_gemma":[0.00046886457,0.00037056865,0.004936528,0.00003499812,0.000023859882,0.00005285732,0.000013982091,0.8153443,0.005059329,0.17255011,0.00086306315,0.00028153986],"about_ca_topic_score_codex":0.0000019639242,"about_ca_topic_score_gemma":2.706909e-7,"teacher_disagreement_score":0.8671791,"about_ca_system_score_codex":0.000035354635,"about_ca_system_score_gemma":0.000113959446,"threshold_uncertainty_score":0.99909765},"labels":[],"label_agreement":null},{"id":"W2081804360","doi":"10.1016/j.tcs.2005.10.033","title":"Compatibility of unrooted phylogenetic trees is FPT","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Phylogenetic tree; Compatibility (geochemistry); Mathematics; Combinatorics; Tree (set theory); Discrete mathematics; Biology","score_opus":0.009351693141450177,"score_gpt":0.24839597547942832,"score_spread":0.23904428233797814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081804360","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.9782012,0.00032589844,0.019714028,0.00028608154,0.00009817113,0.0001110694,0.000012552381,0.0000043655177,0.0012466386],"genre_scores_gemma":[0.9827615,0.000030498019,0.016643215,0.000373909,0.00016820386,0.000002706756,0.0000018598286,0.000007017153,0.000011101103],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876046,0.00004329586,0.00023869045,0.00044739243,0.00022182117,0.0002883317],"domain_scores_gemma":[0.99912095,0.000026374657,0.000059380225,0.00052227767,0.00016394626,0.00010705519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039993107,0.00013460277,0.00017373828,0.000042458436,0.00012321307,0.00002092847,0.0005534097,0.000050388564,0.000037541948],"category_scores_gemma":[0.000035933,0.00011276642,0.000071793846,0.00020032423,0.0024367508,0.0000012061611,0.00042148578,0.0000504554,0.000009506538],"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.000052584637,0.0001729053,0.00748861,0.000011377794,0.000029262026,4.5785075e-7,0.0003408704,0.0010234121,0.90884423,0.043725096,0.00015441769,0.03815679],"study_design_scores_gemma":[0.00047073312,0.00068956637,0.08388815,0.000011584455,0.000017743472,0.000009076543,0.000013076749,0.022240289,0.8828435,0.0076220217,0.0018974532,0.00029682132],"about_ca_topic_score_codex":0.0000038541116,"about_ca_topic_score_gemma":0.000005807224,"teacher_disagreement_score":0.07639954,"about_ca_system_score_codex":0.000010503372,"about_ca_system_score_gemma":0.00006403005,"threshold_uncertainty_score":0.89783096},"labels":[],"label_agreement":null},{"id":"W2082273344","doi":"10.1016/s0304-3975(02)00577-7","title":"On the k-path partition of graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Indifference graph; Longest path problem; Discrete mathematics; Bipartite graph; Cograph; Pathwidth; Hamiltonian path problem; Complete bipartite graph; Partition (number theory); Frequency partition of a graph; Hamiltonian path; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.017306891891451286,"score_gpt":0.28038951099357523,"score_spread":0.26308261910212394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082273344","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.075122885,0.000014182952,0.91324955,0.0006221931,0.00023720946,0.00017211649,7.7761854e-7,0.00006914843,0.010511965],"genre_scores_gemma":[0.95819676,0.0000033520648,0.04132639,0.00044160357,0.000010426659,0.00000976929,9.517568e-8,0.000004922326,0.0000066697075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974553,0.00037691215,0.00021848912,0.0005015952,0.0009416962,0.0005059841],"domain_scores_gemma":[0.9973496,0.0010373998,0.000066100256,0.0011812191,0.00020369346,0.00016195516],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003219266,0.0001308041,0.00014230865,0.00018651673,0.00039434005,0.00013968186,0.0024747974,0.000029443867,0.00007471521],"category_scores_gemma":[0.00048682865,0.00007990205,0.00007451651,0.0020333498,0.0045209057,0.000369831,0.00036778668,0.00022163632,0.000063169304],"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.000005778811,0.000055682573,0.000021975506,0.0000024249662,0.000001991301,0.0000029176476,0.00013772672,0.00014235338,0.00089237315,0.9955205,0.00003494986,0.0031813406],"study_design_scores_gemma":[0.00009776585,0.00025698272,0.0001631166,0.000018357012,0.0000010524367,0.000010749565,0.000005516613,0.0457783,0.030895768,0.9226259,0.000049618684,0.00009690084],"about_ca_topic_score_codex":4.2256116e-7,"about_ca_topic_score_gemma":8.346612e-8,"teacher_disagreement_score":0.88307387,"about_ca_system_score_codex":0.000025403891,"about_ca_system_score_gemma":0.00009409711,"threshold_uncertainty_score":0.9981882},"labels":[],"label_agreement":null},{"id":"W2082317627","doi":"10.1016/s0304-3975(01)00192-x","title":"Computing similarity between RNA structures","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":60,"is_retracted":false,"has_abstract":false,"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":"RNA; Combinatorics; Nucleic acid secondary structure; Protein tertiary structure; Similarity (geometry); Mathematics; Protein secondary structure; Maximization; Algorithm; Base pair; Time complexity; Nucleic acid structure; Set (abstract data type); Computer science; Chemistry; Biology; Genetics; DNA; Artificial intelligence; Mathematical optimization","score_opus":0.016584805876790128,"score_gpt":0.2512811595752036,"score_spread":0.23469635369841346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082317627","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.52554464,0.000077291144,0.46633714,0.0002145027,0.0003120472,0.00012296134,0.0000040123646,0.000036663583,0.0073507666],"genre_scores_gemma":[0.9616717,0.0000064453525,0.03728401,0.00037657665,0.00062923605,0.0000010419953,0.000002187785,0.000008925323,0.00001984248],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986491,0.00008147489,0.0001583599,0.00045194838,0.00028930441,0.0003698084],"domain_scores_gemma":[0.9992462,0.000042228596,0.000042318683,0.00040777758,0.00009655374,0.00016492572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055423717,0.00013433959,0.00013234878,0.000038111357,0.00029706044,0.00009851216,0.00069619535,0.00008365731,0.00022463607],"category_scores_gemma":[0.000120010765,0.00011090509,0.000056509125,0.00015764993,0.0011326391,0.000006508002,0.00041117857,0.000096278505,0.00006875547],"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.00001747353,0.000046989353,0.00057542877,0.000015509966,0.000020593201,0.000006459902,0.000120254605,0.000086315464,0.48197478,0.37587765,0.0006467149,0.14061184],"study_design_scores_gemma":[0.00027842118,0.0005336121,0.0020475558,0.000020052776,0.000012821591,0.0000192605,0.0000053522112,0.024580626,0.91628015,0.0538769,0.0019010855,0.00044417058],"about_ca_topic_score_codex":0.0000010028748,"about_ca_topic_score_gemma":7.593964e-8,"teacher_disagreement_score":0.43612713,"about_ca_system_score_codex":0.000008592981,"about_ca_system_score_gemma":0.000015959587,"threshold_uncertainty_score":0.45225784},"labels":[],"label_agreement":null},{"id":"W2082407347","doi":"10.1016/j.tcs.2010.06.016","title":"On the number of episturmian palindromes","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Euler's totient function; Palindrome; Mathematics; Alphabet; Combinatorics; Function (biology); Euler's formula; Prefix; Enumeration; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.006382837415070408,"score_gpt":0.2457086827320534,"score_spread":0.239325845316983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082407347","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.5510503,0.0000023050663,0.43280444,0.002966761,0.0008902505,0.00009771559,0.0000011973142,0.00011291952,0.0120741],"genre_scores_gemma":[0.948618,6.357677e-7,0.050171927,0.0011142325,0.00007517732,0.0000039740066,1.4676779e-7,0.000005331943,0.000010599272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816567,0.00009103844,0.00022640458,0.0004640852,0.0006560693,0.0003967389],"domain_scores_gemma":[0.9973132,0.000990643,0.00007860664,0.0013575766,0.00011162416,0.00014833009],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020512247,0.00014439542,0.00016442564,0.000072343326,0.00031141628,0.00023043121,0.0039608837,0.000048783033,0.00026276396],"category_scores_gemma":[0.000203341,0.00008204583,0.000076102275,0.0008195802,0.003973593,0.00027534403,0.00082838914,0.00037978173,0.00020463012],"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.0000023366833,0.00004562374,0.00007242685,0.0000020375169,0.0000021487065,0.000004080688,0.00020105817,0.000004773267,0.0017908205,0.97977054,0.00006667542,0.018037476],"study_design_scores_gemma":[0.000090797665,0.00006446606,0.0027763818,0.000016451902,0.0000017850181,0.000057990223,0.000004349193,0.11570573,0.015383087,0.8656895,0.00007422769,0.0001351877],"about_ca_topic_score_codex":0.000002971814,"about_ca_topic_score_gemma":3.645132e-7,"teacher_disagreement_score":0.39756766,"about_ca_system_score_codex":0.000009856174,"about_ca_system_score_gemma":0.00008305298,"threshold_uncertainty_score":0.99873704},"labels":[],"label_agreement":null},{"id":"W2082853563","doi":"10.1016/j.tcs.2008.01.037","title":"On the weight of universal insertion grammars","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Recursively enumerable language; Rule-based machine translation; Morphism; Mathematics; Regular language; Indexed grammar; Discrete mathematics; Computer science; Context-sensitive grammar; Programming language; Context-free grammar; Theoretical computer science; Natural language processing; Automaton","score_opus":0.010292168348289705,"score_gpt":0.21424115294548252,"score_spread":0.20394898459719282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082853563","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.9355669,0.000010191924,0.061847296,0.0002769226,0.000116256684,0.00005391134,7.1917503e-7,0.00000904792,0.002118755],"genre_scores_gemma":[0.9975253,0.000008369851,0.0019114236,0.0004508241,0.00008850219,5.9109516e-7,0.0000016390329,0.0000023992313,0.000011000688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925643,0.00006501713,0.000098833305,0.00022915057,0.00017377654,0.00017680954],"domain_scores_gemma":[0.9995486,0.00006516392,0.000033302324,0.00023129335,0.000068479385,0.00005313943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035940434,0.00007044114,0.00006795552,0.000023144117,0.00020753466,0.000009387721,0.00046485604,0.000040483315,0.000019454394],"category_scores_gemma":[0.000089264184,0.000038590788,0.000045194316,0.00019311071,0.0025391087,0.0000025968716,0.00024104316,0.000068421046,0.000007822094],"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.000047707596,0.00004341395,0.00031456284,0.0000011344792,0.0000033025126,0.0000027382807,0.000025266807,0.00005900309,0.12658577,0.87033546,0.00012988319,0.0024517842],"study_design_scores_gemma":[0.00066680997,0.0038300587,0.017394971,0.000041938813,0.00001092948,0.00009347825,0.000022941551,0.03404949,0.8306467,0.11103429,0.0017302756,0.00047812916],"about_ca_topic_score_codex":0.0000011310478,"about_ca_topic_score_gemma":1.17731396e-7,"teacher_disagreement_score":0.7593011,"about_ca_system_score_codex":0.000006309453,"about_ca_system_score_gemma":0.000035619072,"threshold_uncertainty_score":0.9355452},"labels":[],"label_agreement":null},{"id":"W2083006134","doi":"10.1016/j.tcs.2013.03.001","title":"Infinite ternary square-free words concatenated from permutations of a single word","year":2013,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Ternary operation; Square-free integer; Morphism; Combinatorics; Word (group theory); Square (algebra); Mathematics; Factorization; Discrete mathematics; Arithmetic; Computer science; Algorithm; Geometry","score_opus":0.0166314847851349,"score_gpt":0.24482904076071738,"score_spread":0.22819755597558247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083006134","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.32333577,0.00011039889,0.67167807,0.0010756607,0.0014364171,0.00035007574,0.000060254122,0.00039986937,0.0015534735],"genre_scores_gemma":[0.8244915,0.0000093521685,0.1747582,0.00046038837,0.00019050577,0.000032306685,0.000021314916,0.00002312043,0.000013331907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952427,0.00029508426,0.00086635235,0.0015600607,0.0012498118,0.0007859679],"domain_scores_gemma":[0.99418116,0.0009827453,0.00046596062,0.0034688907,0.0004943648,0.00040690828],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011188524,0.00051794207,0.00071184506,0.0004995292,0.00027456536,0.0010525022,0.010176478,0.00027230708,0.000231855],"category_scores_gemma":[0.00027635356,0.0004409312,0.00023477283,0.0012676702,0.004730262,0.0007875411,0.012576336,0.0007267772,0.000102722785],"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.000011878479,0.00025894336,0.000106114305,0.000045624467,0.00003798324,0.000029491825,0.0027551705,0.00079011044,0.004605883,0.963147,0.00026705916,0.027944775],"study_design_scores_gemma":[0.00025404396,0.00011605739,0.0018017122,0.00027002118,0.000016097025,0.000010778651,0.000018633857,0.45673552,0.003298793,0.53706163,0.000035273755,0.0003814342],"about_ca_topic_score_codex":0.00013403299,"about_ca_topic_score_gemma":0.0000019211507,"teacher_disagreement_score":0.50115573,"about_ca_system_score_codex":0.00013110971,"about_ca_system_score_gemma":0.0003737189,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W2083420236","doi":"10.1016/j.tcs.2008.02.048","title":"Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"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":"Skew; Converse; Mathematics; Combinatorics; Product (mathematics); Upper and lower bounds; Discrete mathematics; Computer science; Telecommunications","score_opus":0.011870947777317311,"score_gpt":0.21092350078615546,"score_spread":0.19905255300883815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083420236","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.91792154,0.00020228383,0.07148884,0.0075685387,0.0013217406,0.00047434872,0.0000013664936,0.00014914395,0.000872171],"genre_scores_gemma":[0.96918076,0.0000201085,0.0290199,0.0017325195,0.000015343701,0.0000063462235,1.0342381e-7,0.0000071245736,0.000017766415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754757,0.0001760444,0.0003244735,0.00073857675,0.0007301499,0.00048315962],"domain_scores_gemma":[0.9976705,0.00036154973,0.00012368157,0.0014260933,0.00025751762,0.00016069761],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001813442,0.00020265514,0.00020898871,0.00012766036,0.0011488871,0.0001819405,0.001998375,0.000040640178,0.00000970264],"category_scores_gemma":[0.00020334126,0.00010224716,0.00009509028,0.0014414233,0.0074347146,0.00026635246,0.001107776,0.00029537652,0.000008713562],"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.000005182745,0.000052223008,0.00022237869,0.0000064209053,0.000005258669,0.0000028138732,0.00069221674,0.000021526916,0.0069581815,0.9900308,0.00010034163,0.0019026094],"study_design_scores_gemma":[0.00036528375,0.00034567725,0.0019471874,0.00010271555,0.000011898343,0.00018897641,0.000010809495,0.19849999,0.04772329,0.75037277,0.00011860081,0.00031281475],"about_ca_topic_score_codex":0.000011936638,"about_ca_topic_score_gemma":3.4797142e-7,"teacher_disagreement_score":0.2396581,"about_ca_system_score_codex":0.000015730975,"about_ca_system_score_gemma":0.00016721884,"threshold_uncertainty_score":0.9952665},"labels":[],"label_agreement":null},{"id":"W2083770519","doi":"10.1016/s0304-3975(03)00090-2","title":"The ring of k-regular sequences, II","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ring (chemistry); Mathematics; State (computer science); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.007250582662101844,"score_gpt":0.22411700245009575,"score_spread":0.2168664197879939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083770519","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.06710277,0.00017092645,0.9233615,0.0005763442,0.0006494941,0.000101031445,4.2882758e-7,0.00012213302,0.00791537],"genre_scores_gemma":[0.90238583,0.000009474594,0.09736092,0.00018470612,0.000032610205,0.0000033526103,6.353857e-8,0.0000044799335,0.000018590548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781114,0.00017347369,0.00029650467,0.0004808563,0.00068913045,0.0005488676],"domain_scores_gemma":[0.9980484,0.0004313071,0.00009462692,0.0011208002,0.000144865,0.00015998769],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003444177,0.00014255666,0.0001651167,0.00008337495,0.0010744322,0.00028112918,0.0033735516,0.000034570672,0.000017576147],"category_scores_gemma":[0.00018456671,0.00008803337,0.00007025162,0.0011010166,0.004385062,0.00048184715,0.0009340388,0.00014124578,0.000017675355],"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.0000012288667,0.000021255317,0.000015652253,0.000002514642,0.0000026369328,0.0000031730735,0.00023134454,0.000067974106,0.0017972857,0.9692131,0.000019222252,0.0286246],"study_design_scores_gemma":[0.00012619345,0.00014539278,0.00019745328,0.000026213844,0.000002594456,0.00005489817,0.000015626265,0.20039515,0.050678577,0.74712306,0.001073825,0.00016101351],"about_ca_topic_score_codex":0.0000020714622,"about_ca_topic_score_gemma":2.5927534e-7,"teacher_disagreement_score":0.83528304,"about_ca_system_score_codex":0.000032246433,"about_ca_system_score_gemma":0.00013261741,"threshold_uncertainty_score":0.99832445},"labels":[],"label_agreement":null},{"id":"W2083810917","doi":"10.1016/j.tcs.2011.06.021","title":"Finite state complexity","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Finite-state machine; Upper and lower bounds; Turing machine; Descriptive complexity theory; Deterministic finite automaton; Prefix; Finite set; State (computer science); Kolmogorov complexity; Finite state; Complexity class; Discrete mathematics; Time complexity; Algorithm","score_opus":0.0383737367207392,"score_gpt":0.24576939112310286,"score_spread":0.20739565440236366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083810917","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.026988598,0.000015035423,0.9552984,0.00022084764,0.0006266588,0.00010842536,0.000002245898,0.0004974395,0.016242316],"genre_scores_gemma":[0.72668695,0.0000021421508,0.27240872,0.0008380239,0.0000422223,0.0000032964224,3.1691397e-7,0.0000061566516,0.000012189591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751294,0.000117228905,0.00028226693,0.0007650885,0.00059963897,0.0007228495],"domain_scores_gemma":[0.9980124,0.00020531694,0.00007380329,0.0012139453,0.00014405652,0.00035045223],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016010731,0.0002018242,0.00020840805,0.00018085186,0.00041109865,0.00032700453,0.0040383483,0.00003458292,0.00021431067],"category_scores_gemma":[0.00006232904,0.00016094891,0.00007330882,0.0011101273,0.0045892186,0.00096650963,0.0017336634,0.0001929252,0.00040918385],"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.00000543659,0.000064840686,0.00003925251,0.0000029757227,0.0000027122219,0.00004042682,0.0011713154,0.000013639867,0.00009565852,0.95842344,0.000031346703,0.040108956],"study_design_scores_gemma":[0.00010853955,0.00011581095,0.0018492792,0.000010258553,0.0000014007148,0.00003933788,0.0000033324234,0.38127702,0.003928782,0.6124152,0.00006906161,0.0001819911],"about_ca_topic_score_codex":0.000010404755,"about_ca_topic_score_gemma":6.233664e-7,"teacher_disagreement_score":0.6996983,"about_ca_system_score_codex":0.00003630147,"about_ca_system_score_gemma":0.000094637886,"threshold_uncertainty_score":0.9981197},"labels":[],"label_agreement":null},{"id":"W2083970526","doi":"10.1016/s0304-3975(02)00048-8","title":"Structuring the elementary components of graphs having a perfect internal matching","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Structuring; Computer science; Mathematics; Matching (statistics); Combinatorics; Theoretical computer science","score_opus":0.01473154606041251,"score_gpt":0.28159802193216416,"score_spread":0.26686647587175166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083970526","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.4010546,0.000035514564,0.5973966,0.000105372994,0.0002971795,0.0001404592,8.370433e-7,0.00005157391,0.00091785466],"genre_scores_gemma":[0.8622688,0.0000046810715,0.13752083,0.00016723295,0.0000218063,0.000004966398,2.5983417e-7,0.000008736574,0.0000026599032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660945,0.00045596116,0.00038333968,0.00066813413,0.0011385293,0.0007445851],"domain_scores_gemma":[0.99782723,0.00060450146,0.00011888179,0.0010876827,0.00015637079,0.00020534273],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0033742927,0.00020668343,0.00024487206,0.00028935226,0.0006670573,0.00029926223,0.004268822,0.000029247643,0.000049281552],"category_scores_gemma":[0.000107973596,0.0001394336,0.00011575349,0.0013191538,0.0035265232,0.0007596892,0.0015625183,0.00041577578,0.000010960615],"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.000009362927,0.00003195003,0.00050052383,0.000009725582,0.000008859989,0.000009106717,0.0006719968,0.00032451446,0.010246114,0.97396517,0.0000022258575,0.014220474],"study_design_scores_gemma":[0.00026790693,0.00014899764,0.0020956174,0.000064002954,0.0000041062667,0.000108987246,0.00004337726,0.069959156,0.033200536,0.893888,0.0000265237,0.00019278018],"about_ca_topic_score_codex":0.000012279668,"about_ca_topic_score_gemma":8.9939624e-7,"teacher_disagreement_score":0.46121424,"about_ca_system_score_codex":0.000056402223,"about_ca_system_score_gemma":0.00007337795,"threshold_uncertainty_score":0.9991853},"labels":[],"label_agreement":null},{"id":"W2084170146","doi":"10.1016/j.tcs.2014.07.025","title":"A second look at counting triangles in graph streams","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Streaming algorithm; Combinatorics; Mathematics; Constant (computer programming); Graph; Space (punctuation); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Computer science","score_opus":0.00985627178227796,"score_gpt":0.2302904869943695,"score_spread":0.22043421521209153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084170146","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.21247253,0.000025805,0.7776448,0.00043473666,0.00057328865,0.00013489791,0.0000014967434,0.00017255238,0.00853988],"genre_scores_gemma":[0.8919209,0.0000021721355,0.10728691,0.0006374636,0.00011743835,0.0000063345497,5.590311e-7,0.000006794355,0.000021403772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970539,0.00017621697,0.00037230868,0.0009122223,0.00071132724,0.0007740237],"domain_scores_gemma":[0.99805987,0.00055887114,0.00008615767,0.0009436373,0.000105038715,0.0002464394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026394436,0.0002195597,0.00028771439,0.00040677862,0.0004761862,0.00048532305,0.0029446434,0.000060551753,0.00012959643],"category_scores_gemma":[0.00011661254,0.0001911647,0.000095363415,0.0019186717,0.0027241893,0.0006892288,0.0017813802,0.00025412074,0.000082983504],"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.000005131828,0.000053024174,0.00020538601,0.0000075262237,0.0000017962947,0.000012288688,0.0003337627,0.0001008569,0.00017756589,0.9288168,0.0000384088,0.07024744],"study_design_scores_gemma":[0.00039584324,0.00013337348,0.0016389231,0.000035335033,0.0000014758632,0.000046297282,0.000004702378,0.61794776,0.001572218,0.37750435,0.00047836438,0.00024139528],"about_ca_topic_score_codex":0.0000058622595,"about_ca_topic_score_gemma":0.000020063602,"teacher_disagreement_score":0.6794484,"about_ca_system_score_codex":0.000084904175,"about_ca_system_score_gemma":0.00007162323,"threshold_uncertainty_score":0.9999898},"labels":[],"label_agreement":null},{"id":"W2084172672","doi":"10.1016/j.tcs.2011.07.010","title":"Hardness results for covering arrays avoiding forbidden edges and error-locating arrays","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada","keywords":"Clique; Enhanced Data Rates for GSM Evolution; Binary number; Reduction (mathematics); Time complexity; Combinatorics; Hardness of approximation; Computer science; Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Approximation algorithm; Arithmetic; Artificial intelligence; Geometry","score_opus":0.057304972214434674,"score_gpt":0.28066317984675326,"score_spread":0.2233582076323186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084172672","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.012648468,0.000025485417,0.98053837,0.00021648966,0.00060760207,0.00025685073,0.0000028576003,0.0031106656,0.0025932314],"genre_scores_gemma":[0.54021364,0.0000013511635,0.45953727,0.00014554139,0.000074204276,0.000015484731,3.8128812e-7,0.000008065183,0.000004071187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975154,0.00008285043,0.00036500473,0.0009466435,0.0004040432,0.0006860742],"domain_scores_gemma":[0.997595,0.0009511621,0.00013413878,0.0008164158,0.00024402032,0.00025925622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032768645,0.0002338792,0.00026173855,0.00019364944,0.0009276317,0.00046922732,0.0019225944,0.00006722584,0.000001494829],"category_scores_gemma":[0.0013765176,0.00020356388,0.00005868465,0.0006305939,0.0014646889,0.000752718,0.0010715373,0.00022316653,0.000006126857],"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.000027981214,0.000042119398,0.00023654538,0.000036667338,0.000005408736,0.000005393442,0.004804315,0.00003107609,0.0005412711,0.92807895,0.000467568,0.06572269],"study_design_scores_gemma":[0.00029148386,0.00029909826,0.0005169009,0.00016194311,0.000006266848,0.00006068854,0.000015375364,0.43688023,0.017732369,0.5436458,0.000052420633,0.00033744468],"about_ca_topic_score_codex":0.000016487224,"about_ca_topic_score_gemma":5.209479e-7,"teacher_disagreement_score":0.5275652,"about_ca_system_score_codex":0.0000472435,"about_ca_system_score_gemma":0.00009833453,"threshold_uncertainty_score":0.83010936},"labels":[],"label_agreement":null},{"id":"W2084661883","doi":"10.1016/j.tcs.2009.02.025","title":"State complexity of power","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Combinatorics; Nondeterministic algorithm; Alphabet; Regular language; Nondeterministic finite automaton; Deterministic finite automaton; State (computer science); Upper and lower bounds; Mathematics; Finite-state machine; Function (biology); Discrete mathematics; Time complexity; Constant (computer programming); Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.014499479140722055,"score_gpt":0.25283446374698176,"score_spread":0.2383349846062597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084661883","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.12442635,0.000020780957,0.86792445,0.0012025035,0.00027414045,0.0000851934,0.0000017290461,0.0001950934,0.0058697495],"genre_scores_gemma":[0.84513146,0.0000015137848,0.15390222,0.0009349496,0.000021432734,5.5526795e-7,2.1912852e-7,0.0000028433822,0.000004806181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979284,0.000080905986,0.00030406343,0.00053034764,0.0006576062,0.00049867533],"domain_scores_gemma":[0.9984318,0.0001203853,0.000090856025,0.0009751833,0.00016612008,0.00021562616],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013259596,0.0001529611,0.00023526655,0.00016055269,0.00018917053,0.00019212674,0.0029505931,0.000028162707,0.00005419795],"category_scores_gemma":[0.00004366805,0.000120651646,0.00007282802,0.0010567193,0.0038818654,0.00062966644,0.0005948455,0.00013231841,0.00004602071],"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.0000049501987,0.00007492788,0.00001227856,0.0000018089833,0.0000014692683,0.000006338805,0.00035976485,0.000031889987,0.0026267355,0.9495188,0.00003544216,0.047325592],"study_design_scores_gemma":[0.000138035,0.00032059936,0.006693724,0.00001682772,0.0000011480345,0.00002151973,0.000002612713,0.18661354,0.016494147,0.78951335,0.00003492491,0.00014956291],"about_ca_topic_score_codex":0.0000016263698,"about_ca_topic_score_gemma":8.405154e-8,"teacher_disagreement_score":0.7207051,"about_ca_system_score_codex":0.000027206554,"about_ca_system_score_gemma":0.00008314677,"threshold_uncertainty_score":0.998829},"labels":[],"label_agreement":null},{"id":"W2084807618","doi":"10.1016/j.tcs.2004.02.031","title":"Deletion along trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":47,"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":"Decidability; Closure (psychology); Regular language; Mathematical proof; Formal language; Mathematics; Inverse; Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.007075571221615482,"score_gpt":0.22688505009427937,"score_spread":0.2198094788726639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084807618","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.13854805,0.000027716129,0.8572507,0.0011809217,0.0007137838,0.000087595006,5.418952e-7,0.00043085893,0.001759823],"genre_scores_gemma":[0.81869006,0.0000026698242,0.18052146,0.0006395421,0.00013332361,0.000004247673,4.3821115e-7,0.0000057639554,0.000002482293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785435,0.000051841704,0.00023200594,0.00064912275,0.0006474686,0.00056518294],"domain_scores_gemma":[0.99869287,0.00011738501,0.000049725342,0.0007856656,0.00012048531,0.00023386064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720358,0.00016886124,0.0001619385,0.00015634808,0.00045216782,0.0005168209,0.002413506,0.000046419344,0.000021598587],"category_scores_gemma":[0.000060615857,0.00013626787,0.000064537766,0.0011784802,0.0021383131,0.0010933902,0.00068454706,0.00015575135,0.00014882963],"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.0000022745426,0.000039212835,0.000023764243,0.0000026675557,0.0000016707488,0.000015488811,0.000436292,0.000302515,0.0009995847,0.96897906,0.000008234859,0.029189236],"study_design_scores_gemma":[0.00028632293,0.00016508531,0.0017141255,0.000027671791,0.0000024951974,0.000097615506,0.000008667348,0.07683683,0.019865103,0.90066636,0.00008286837,0.00024686198],"about_ca_topic_score_codex":0.000010764918,"about_ca_topic_score_gemma":9.0752314e-7,"teacher_disagreement_score":0.68014205,"about_ca_system_score_codex":0.00009549736,"about_ca_system_score_gemma":0.00016762067,"threshold_uncertainty_score":0.7878704},"labels":[],"label_agreement":null},{"id":"W2084869467","doi":"10.1016/j.tcs.2009.02.035","title":"State complexity of unique rational operations","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; State (computer science); Regular language; Theoretical computer science; Computational complexity theory; Time complexity; Algorithm; Automaton","score_opus":0.019159765986843016,"score_gpt":0.2675043142512131,"score_spread":0.2483445482643701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084869467","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.073187135,0.000010247721,0.92211354,0.0023536512,0.00017108445,0.00010820223,0.0000035776102,0.00014109988,0.0019114899],"genre_scores_gemma":[0.73409116,0.0000015965519,0.2650262,0.0008396356,0.000030952222,0.0000012706676,0.0000011452709,0.0000019294812,0.0000060598218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983115,0.00010590929,0.00029451636,0.0004251085,0.0005338583,0.00032909436],"domain_scores_gemma":[0.99878216,0.00011333923,0.000046908157,0.00065562414,0.00023870394,0.00016328414],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011474842,0.00012413874,0.00017382667,0.00014296343,0.00029866843,0.00024065687,0.0019637726,0.000025337751,0.000045181052],"category_scores_gemma":[0.00004958958,0.00010125302,0.00005137741,0.0008929608,0.002826462,0.000768399,0.00036898034,0.00011797093,0.000023357421],"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.0000029606015,0.00007215558,0.000007673122,0.0000014985948,0.00000140301,0.0000025796307,0.00028784666,0.00097122765,0.004035764,0.9760846,0.000024643801,0.018507667],"study_design_scores_gemma":[0.000082919236,0.00012619962,0.0023695654,0.000008872354,8.0550916e-7,0.000012634084,0.0000014647602,0.48168477,0.01325023,0.502366,0.000011988219,0.00008455592],"about_ca_topic_score_codex":0.0000035543467,"about_ca_topic_score_gemma":7.569776e-7,"teacher_disagreement_score":0.66090405,"about_ca_system_score_codex":0.000030700066,"about_ca_system_score_gemma":0.00017625437,"threshold_uncertainty_score":0.9998873},"labels":[],"label_agreement":null},{"id":"W2084955549","doi":"10.1016/s0304-3975(03)00286-x","title":"On universally easy classes for NP-complete problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Time complexity; Mathematics; NP-complete; Intersection (aeronautics); P versus NP problem; Polynomial; Combinatorics; Discrete mathematics; Computer science","score_opus":0.026521373393528832,"score_gpt":0.287435863305529,"score_spread":0.26091448991200017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084955549","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.0044831503,0.000017455732,0.9820232,0.00067576143,0.0004695901,0.0005606735,0.0000042522497,0.0002532954,0.011512659],"genre_scores_gemma":[0.7499499,0.000002312292,0.24926673,0.00063299167,0.000037538466,0.000025037947,6.0529396e-7,0.000014566719,0.00007036307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621665,0.00026281364,0.00027084386,0.0012116726,0.0009559337,0.0010820585],"domain_scores_gemma":[0.9963541,0.0013937537,0.00007521902,0.0013684027,0.0003906623,0.0004178565],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027036187,0.0002578565,0.0002582419,0.0003741145,0.00071148714,0.00046493905,0.0035680032,0.000059743987,0.000038041995],"category_scores_gemma":[0.0005409435,0.0002141481,0.000117814736,0.0017658483,0.003262366,0.0008134191,0.0005509628,0.00027350604,0.00011312607],"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.000019437473,0.000078652345,0.000017038354,0.000010689562,0.000004837778,0.0000068246945,0.00011140129,0.001321031,0.001044124,0.9920618,0.000074035495,0.0052501624],"study_design_scores_gemma":[0.000443982,0.00070492894,0.00006710212,0.000024187819,0.0000022539307,0.00002734652,0.000003783814,0.1574341,0.0029673618,0.8350559,0.0029997402,0.0002693159],"about_ca_topic_score_codex":5.796825e-7,"about_ca_topic_score_gemma":7.4740456e-7,"teacher_disagreement_score":0.7454667,"about_ca_system_score_codex":0.000111254085,"about_ca_system_score_gemma":0.00025635966,"threshold_uncertainty_score":0.9994502},"labels":[],"label_agreement":null},{"id":"W2085202968","doi":"10.1016/j.tcs.2004.06.028","title":"Template-guided DNA recombination","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":28,"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; University of Saskatchewan","funders":"","keywords":"Recombination; DNA; Gene; Genome; Genetics; Process (computing); Computer science; Computational biology; Biology; Theoretical computer science; Computation; Algorithm; Programming language","score_opus":0.01405394857149718,"score_gpt":0.26742032745287747,"score_spread":0.2533663788813803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085202968","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.7842603,0.000012923048,0.21135843,0.00039390227,0.00025370147,0.00007431264,6.449459e-7,0.000032734195,0.003613052],"genre_scores_gemma":[0.98341984,0.0000038330036,0.015751204,0.0006146886,0.00018467508,0.0000019877384,0.000007101592,0.000004943067,0.000011718524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988751,0.000036243153,0.00015532278,0.0004326903,0.00018828947,0.0003123648],"domain_scores_gemma":[0.99947137,0.000015367914,0.000035270652,0.00025394396,0.00010293083,0.000121129095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061905215,0.00010584566,0.000089676534,0.000039083476,0.00022243713,0.000073521944,0.0004978779,0.000070800364,0.000019051147],"category_scores_gemma":[0.00010524105,0.000079059224,0.000047995414,0.00024672993,0.0011119477,0.000006614063,0.00036891663,0.000074897056,0.000038346872],"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.000019077883,0.00008372538,0.00019499654,0.0000037583802,0.0000045535844,0.0000050392696,0.000030415105,0.000387343,0.36276585,0.6222838,0.00008220787,0.014139237],"study_design_scores_gemma":[0.00093896,0.0013330925,0.004792293,0.00003090596,0.000006720103,0.00010239035,0.000007913525,0.0042084516,0.77719104,0.20963886,0.0012979461,0.0004514028],"about_ca_topic_score_codex":0.0000016381839,"about_ca_topic_score_gemma":3.228155e-7,"teacher_disagreement_score":0.41442522,"about_ca_system_score_codex":0.00002151363,"about_ca_system_score_gemma":0.000058596994,"threshold_uncertainty_score":0.40970176},"labels":[],"label_agreement":null},{"id":"W2085216434","doi":"10.1016/s0304-3975(00)00144-4","title":"The ultimate strategy to search on m rays?","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Upper and lower bounds; Mathematics; Combinatorics; Algorithm; Computer science; Mathematical analysis","score_opus":0.02509891212686544,"score_gpt":0.30945091024063853,"score_spread":0.2843519981137731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085216434","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.006260154,0.0000073256274,0.963291,0.013379597,0.00032141528,0.0002712617,4.5511868e-7,0.00018437652,0.016284425],"genre_scores_gemma":[0.92931026,0.00002413489,0.06626538,0.004201418,0.000059715152,0.000010950063,2.5011065e-7,0.0000069291964,0.00012097107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970982,0.00016928179,0.0002110426,0.00062394066,0.0010732375,0.0008242729],"domain_scores_gemma":[0.99786276,0.00040301407,0.000023130991,0.00096520095,0.00027053,0.00047537824],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026047896,0.00014140195,0.000111731766,0.00015539285,0.0011046054,0.0015034955,0.0035998244,0.000026116148,0.000044547454],"category_scores_gemma":[0.00009602021,0.000087177985,0.000040401923,0.0018672507,0.0014558717,0.0004109303,0.00096492545,0.00023514303,0.00070242904],"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.000010319283,0.000030282843,0.000008934234,6.818801e-7,0.0000011846618,0.000008619133,0.00018458888,0.014820109,0.000100989586,0.87358654,0.00033260696,0.11091516],"study_design_scores_gemma":[0.00014816747,0.0005666081,0.00031103846,0.00001337596,4.5908195e-7,0.000021492218,0.000006815375,0.9557635,0.0010791067,0.03895973,0.0029770755,0.00015260703],"about_ca_topic_score_codex":0.000002842444,"about_ca_topic_score_gemma":6.293136e-7,"teacher_disagreement_score":0.9409434,"about_ca_system_score_codex":0.000056418405,"about_ca_system_score_gemma":0.0001391997,"threshold_uncertainty_score":0.99953306},"labels":[],"label_agreement":null},{"id":"W2085334526","doi":"10.1016/s0304-3975(03)00220-2","title":"Two bijective proofs for the arborescent form of the Good–Lagrange formula and some applications to colored rooted trees and cacti","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"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":"Colored; Mathematical proof; Mathematics; Bijection; Combinatorics; Polyomino; Algebra over a field; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.020873280411200817,"score_gpt":0.3137634951874374,"score_spread":0.29289021477623656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085334526","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.15130349,0.00005495566,0.84429514,0.0006892739,0.00017971428,0.003077389,0.000010227107,0.00004036214,0.00034947027],"genre_scores_gemma":[0.9290072,0.0000030609851,0.07064118,0.000087117674,0.0000403823,0.00020297992,1.0030854e-7,0.000012188124,0.0000057847333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881464,0.000047676287,0.0002452204,0.00028454026,0.00031813167,0.00028980122],"domain_scores_gemma":[0.99736875,0.0017148141,0.00011621295,0.00050503336,0.00018640407,0.000108799955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008339577,0.0001428206,0.00021236164,0.0000496873,0.00042932108,0.00006488624,0.000513889,0.000033279724,0.0000018157031],"category_scores_gemma":[0.00061192963,0.00007734386,0.000043896584,0.00047504107,0.0015245425,0.00013296843,0.0002816109,0.00010445163,6.4110986e-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.000013445718,0.00007464876,0.000019181924,0.000036156416,0.0000080623095,7.2414885e-8,0.0010192596,0.000009839146,0.00060088746,0.99503386,0.0000062429262,0.003178368],"study_design_scores_gemma":[0.00047328358,0.00016859385,0.0002951381,0.000035049186,0.000037422302,0.0000073512792,0.00007921102,0.012977774,0.011967584,0.97373873,0.00011247617,0.00010740397],"about_ca_topic_score_codex":0.0000016397455,"about_ca_topic_score_gemma":0.0000069642056,"teacher_disagreement_score":0.7777037,"about_ca_system_score_codex":0.00004879074,"about_ca_system_score_gemma":0.000059083563,"threshold_uncertainty_score":0.561724},"labels":[],"label_agreement":null},{"id":"W2085490472","doi":"10.1016/j.tcs.2007.07.031","title":"An infinite hierarchy induced by depth synchronization","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Saskatchewan; Western University","funders":"","keywords":"Synchronization (alternating current); Measure (data warehouse); Hierarchy; Logarithm; Mathematics; Context (archaeology); Bounded function; Grammar; Constant (computer programming); Word (group theory); Discrete mathematics; Computer science; Combinatorics; Topology (electrical circuits); Mathematical analysis; Linguistics; Geometry; Programming language; Data mining","score_opus":0.009671298505598903,"score_gpt":0.27280782412570487,"score_spread":0.263136525620106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085490472","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.5458548,0.00001490643,0.45259598,0.000035028956,0.000097340526,0.000048766102,7.88337e-7,0.00002305493,0.001329335],"genre_scores_gemma":[0.98871773,0.0000028872394,0.010134723,0.0008223886,0.00028457466,8.270044e-7,0.00002603241,0.0000067727874,0.0000040702303],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986427,0.00006237018,0.00017719361,0.000472411,0.0002199657,0.00042537344],"domain_scores_gemma":[0.9992834,0.000035373785,0.000040198065,0.00030712536,0.0001113017,0.00022261187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011948533,0.00012044169,0.00009136597,0.000049362567,0.0002262912,0.00009073306,0.0005902867,0.000100876765,0.00001460234],"category_scores_gemma":[0.00008690555,0.00009220314,0.000030599607,0.00035007,0.0010236568,0.000011111632,0.00026821965,0.00010696209,0.000010859573],"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.000035447778,0.00007936905,0.0011054918,0.0000024154751,0.000003184966,0.0000024486212,0.000034406108,0.000034246183,0.81725305,0.06494407,0.000036151356,0.1164697],"study_design_scores_gemma":[0.0006392837,0.0038047,0.017754504,0.00002238639,0.000009601001,0.00003881756,0.000023915367,0.06162048,0.90159863,0.011872056,0.0018643345,0.0007512899],"about_ca_topic_score_codex":0.0000017803243,"about_ca_topic_score_gemma":0.0000012681918,"teacher_disagreement_score":0.4428629,"about_ca_system_score_codex":0.000015448659,"about_ca_system_score_gemma":0.000043650387,"threshold_uncertainty_score":0.3771706},"labels":[],"label_agreement":null},{"id":"W2086228055","doi":"10.1016/j.tcs.2014.07.009","title":"On non-progressive spread of influence through social networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Sociology","score_opus":0.005540294514259801,"score_gpt":0.2710650071988626,"score_spread":0.2655247126846028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086228055","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.24829817,0.0000022815482,0.74048024,0.00006743678,0.000051475792,0.00007997885,9.5143764e-7,0.000036303445,0.010983152],"genre_scores_gemma":[0.98523676,1.7795968e-7,0.014194343,0.00018350683,0.00036670698,0.0000072603316,0.0000016903792,0.000007416723,0.0000021580797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986004,0.000073736184,0.00023414327,0.00036859128,0.00036560462,0.00035752385],"domain_scores_gemma":[0.9990256,0.00023816786,0.00012751829,0.00037707822,0.00015975659,0.000071891736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137137,0.00014471178,0.00025546126,0.000054037588,0.00025657113,0.00007602381,0.00081088993,0.000028472512,0.00014117603],"category_scores_gemma":[0.00001170359,0.0001176007,0.00010210732,0.0006002304,0.002615775,0.00014625644,0.0003588603,0.00017612579,0.000012907655],"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.000009019361,0.00005420982,0.00049102126,0.0000016368324,0.00000779244,2.844776e-7,0.0001282483,0.0025912502,0.000089301706,0.972745,0.00010339316,0.023778811],"study_design_scores_gemma":[0.00011744809,0.0001640123,0.002084167,0.000038198446,0.000012742238,3.25129e-7,0.000003782348,0.4133365,0.0029721786,0.581092,0.000034868102,0.00014381798],"about_ca_topic_score_codex":0.000011420097,"about_ca_topic_score_gemma":1.2006937e-7,"teacher_disagreement_score":0.7369386,"about_ca_system_score_codex":0.00001457727,"about_ca_system_score_gemma":0.000025768282,"threshold_uncertainty_score":0.96379316},"labels":[],"label_agreement":null},{"id":"W2086236932","doi":"10.1016/j.tcs.2006.10.031","title":"Feasibility and complexity of broadcasting with random transmission failures","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"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":"Broadcasting (networking); Transmission (telecommunications); Computer science; Theoretical computer science; Distributed computing; Computer network; Telecommunications","score_opus":0.022599235541769923,"score_gpt":0.24212688485675357,"score_spread":0.21952764931498364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086236932","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.13153248,0.000050228693,0.8661298,0.00026581457,0.00015528871,0.00016120786,5.666609e-7,0.000071813796,0.0016327996],"genre_scores_gemma":[0.88061357,9.513932e-7,0.11925248,0.000041399308,0.00008248795,0.000001838307,2.5013185e-7,0.0000032300616,0.0000038119276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.00013700343,0.00030512147,0.0005111645,0.0004536369,0.0003076078],"domain_scores_gemma":[0.9988874,0.00020737536,0.00008919333,0.00039403696,0.0003041679,0.000117800606],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013459312,0.00013246512,0.00024903787,0.00008960877,0.00030248257,0.00021356792,0.00070727256,0.00003430356,0.000011618708],"category_scores_gemma":[0.0000244813,0.00008752264,0.00004094411,0.0005683641,0.0033462509,0.0003876109,0.00022076203,0.00011330227,0.0000013782774],"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.000042292784,0.000042107386,0.00064113527,0.000017325552,0.0000018039404,0.000002602903,0.00016180708,0.0005434662,0.00047770794,0.9885,0.000019095809,0.009550638],"study_design_scores_gemma":[0.0008836603,0.00026054936,0.00554411,0.00009222863,0.0000036810968,0.00006357089,0.000007768206,0.8765631,0.0030641544,0.11325394,0.000098897,0.00016438143],"about_ca_topic_score_codex":0.00006521736,"about_ca_topic_score_gemma":0.0000063717075,"teacher_disagreement_score":0.8760196,"about_ca_system_score_codex":0.000024516421,"about_ca_system_score_gemma":0.000049066508,"threshold_uncertainty_score":0.99936604},"labels":[],"label_agreement":null},{"id":"W2086306425","doi":"10.1016/j.tcs.2007.09.015","title":"Palindrome positions in ternary square-free words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Palindrome; Ternary operation; Mathematics; Sequence (biology); Word (group theory); Combinatorics; Integer (computer science); Position (finance); Arbitrariness; Word length; Binary number; Square (algebra); Arithmetic; Discrete mathematics; Computer science; Linguistics; Natural language processing; Philosophy; Geometry","score_opus":0.006775379402386871,"score_gpt":0.24749328958025793,"score_spread":0.24071791017787106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086306425","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.16269656,0.00003861354,0.8297199,0.0013179056,0.0006034872,0.0001293512,0.0000018490956,0.00025878527,0.0052335737],"genre_scores_gemma":[0.8504594,0.0000023852342,0.14843456,0.00096149265,0.00012024995,0.0000037984373,7.27328e-7,0.000007998352,0.000009376441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705565,0.00008799327,0.0004085539,0.00077356107,0.0007691082,0.0009051256],"domain_scores_gemma":[0.9976005,0.00043553524,0.00006302374,0.001493041,0.00008119595,0.00032669344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003497219,0.00020352559,0.00021709918,0.0004922066,0.0002886843,0.00037639012,0.004725721,0.00007221957,0.00005293725],"category_scores_gemma":[0.00008981115,0.00017518381,0.00007465605,0.0021690412,0.0018593026,0.00089552876,0.0019712488,0.0002911948,0.00010245858],"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.000007086755,0.00010874769,0.00036319974,0.000003831093,0.0000016196574,0.0001568161,0.00054235396,0.000047286932,0.0005849893,0.96551347,0.00003277788,0.032637842],"study_design_scores_gemma":[0.0004535237,0.00022602172,0.026042439,0.00007791218,0.0000023881225,0.0002103697,0.00002331153,0.279915,0.002826999,0.6897845,0.00008100528,0.0003565113],"about_ca_topic_score_codex":0.0000114835675,"about_ca_topic_score_gemma":0.0000045368415,"teacher_disagreement_score":0.68776286,"about_ca_system_score_codex":0.00010785132,"about_ca_system_score_gemma":0.000091313756,"threshold_uncertainty_score":0.87816447},"labels":[],"label_agreement":null},{"id":"W2086312880","doi":"10.1016/j.tcs.2014.03.028","title":"Multi-target ray searching problems","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Multiplicative function; Context (archaeology); Mathematics; Mathematical optimization; Metric (unit); Measure (data warehouse); Disjoint sets; Linear search; Asymptotically optimal algorithm; Competitive analysis; Beam search; Computer science; Algorithm; Search algorithm; Discrete mathematics; Upper and lower bounds; Data mining","score_opus":0.017390947517490634,"score_gpt":0.26955533553006034,"score_spread":0.2521643880125697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086312880","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.0010235971,0.000010468328,0.9912401,0.0019520343,0.00040035223,0.00024340604,4.788731e-7,0.00038828354,0.0047412934],"genre_scores_gemma":[0.49721348,0.0000020695297,0.50206476,0.0006229805,0.000054737528,0.0000061673936,4.9045957e-7,0.0000060250095,0.000029274748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671763,0.00031308108,0.00028946516,0.000896132,0.00094553217,0.0008381798],"domain_scores_gemma":[0.9978909,0.00026229816,0.000058415495,0.0010321253,0.00026362442,0.0004926635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044064433,0.00018289567,0.00019928743,0.00025524077,0.00065166125,0.000949925,0.003307925,0.000048005848,0.00006554386],"category_scores_gemma":[0.00025320452,0.00014522551,0.000062414365,0.0012986897,0.0019379207,0.000995146,0.0014954488,0.00030852805,0.00025614008],"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.0000013379506,0.00006812483,0.00006565531,0.000009567195,0.000002009459,0.0000018177593,0.00063558394,0.019697644,0.00091581617,0.9522068,0.000038829377,0.026356844],"study_design_scores_gemma":[0.00029500196,0.00014680794,0.0003605627,0.000022868791,7.955686e-7,0.000009688258,0.0000019424306,0.93329567,0.0009886298,0.06381169,0.00086440507,0.00020195622],"about_ca_topic_score_codex":0.0000032025623,"about_ca_topic_score_gemma":3.550445e-7,"teacher_disagreement_score":0.913598,"about_ca_system_score_codex":0.00004584235,"about_ca_system_score_gemma":0.0001303278,"threshold_uncertainty_score":0.91601485},"labels":[],"label_agreement":null},{"id":"W2086603341","doi":"10.1016/j.tcs.2010.11.025","title":"Complexity and palindromic defect of infinite words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Palindrome; Conjecture; Mathematics; State (computer science); Combinatorics; Palindromic sequence; Algorithm; CRISPR; Genetics","score_opus":0.011621170060287709,"score_gpt":0.24605559810753605,"score_spread":0.23443442804724834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086603341","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.5358285,0.000015077778,0.46221548,0.00021296302,0.00037926328,0.000065278036,0.0000015240172,0.00009252226,0.0011894007],"genre_scores_gemma":[0.83296055,0.0000022275249,0.16677126,0.000203921,0.000053737745,0.000001738734,2.604075e-7,0.000004608704,0.0000016806056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982381,0.00009711148,0.00026842798,0.0005512868,0.00043799297,0.00040707894],"domain_scores_gemma":[0.99822235,0.00046753392,0.00008663142,0.0008864077,0.00010191962,0.00023514008],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022074906,0.00015607041,0.00023725613,0.00017127165,0.00027781157,0.00023498773,0.0019985344,0.00005788209,0.000047802983],"category_scores_gemma":[0.00012902643,0.00012427328,0.00006856245,0.00075426005,0.0063062985,0.00046795834,0.0013558563,0.00034471846,0.000020132626],"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.0000036573756,0.000032431955,0.00031342296,0.000007138083,0.0000027957908,0.0000036419015,0.00037321047,0.0000035344067,0.0072410265,0.95904493,0.000005484543,0.03296871],"study_design_scores_gemma":[0.00023227463,0.00014743522,0.010787835,0.000020675103,0.000004524972,0.000096629185,0.0000058057617,0.34283558,0.010152434,0.63545054,0.00006167044,0.00020460102],"about_ca_topic_score_codex":0.000006454591,"about_ca_topic_score_gemma":0.000001874016,"teacher_disagreement_score":0.34283206,"about_ca_system_score_codex":0.0000086348655,"about_ca_system_score_gemma":0.00007871383,"threshold_uncertainty_score":0.996398},"labels":[],"label_agreement":null},{"id":"W2086666778","doi":"10.1016/j.tcs.2005.01.005","title":"Avoiding large squares in infinite binary words","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Mathematics; Construct (python library); Word (group theory); Least-squares function approximation; Combinatorics; Discrete mathematics; Arithmetic; Statistics; Computer science; Geometry","score_opus":0.00866029022211975,"score_gpt":0.24990594008600098,"score_spread":0.24124564986388122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086666778","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.27200627,0.0000979742,0.72255915,0.0019770307,0.00035118277,0.00010379187,0.0000012002538,0.0002823213,0.0026210814],"genre_scores_gemma":[0.91543865,0.000008857488,0.08280522,0.0015352656,0.00018385056,0.0000066556754,5.6710417e-7,0.00000877936,0.000012147846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970724,0.0002536063,0.00031960424,0.000783981,0.0006414636,0.0009289578],"domain_scores_gemma":[0.99827206,0.0005197166,0.00006293163,0.0008355838,0.00006610026,0.00024361342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042318827,0.0002143559,0.00023137368,0.0004500268,0.00051061134,0.00048470774,0.0030417533,0.000063931606,0.000073481875],"category_scores_gemma":[0.00014810012,0.0001813615,0.00006622683,0.0020028257,0.0011272872,0.0014833756,0.0017419697,0.00046012056,0.00023445272],"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.0000046991436,0.00009594837,0.00017307265,0.0000040119044,0.0000011908357,0.00003166969,0.0012985776,0.0004572649,0.0005506898,0.934413,0.000046243087,0.06292361],"study_design_scores_gemma":[0.00034871453,0.00010268275,0.0022371835,0.00007131768,0.0000013173648,0.000044990826,0.000033288434,0.8903909,0.0025386594,0.10295266,0.0009847207,0.000293589],"about_ca_topic_score_codex":0.0000022758065,"about_ca_topic_score_gemma":0.0000020502794,"teacher_disagreement_score":0.8899336,"about_ca_system_score_codex":0.00009954232,"about_ca_system_score_gemma":0.00010321931,"threshold_uncertainty_score":0.73957074},"labels":[],"label_agreement":null},{"id":"W2087289587","doi":"10.1016/j.tcs.2008.11.022","title":"A constrained edit distance algorithm between semi-ordered trees","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Plant biochemistry and biosynthesis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"CHIST-ERA; Agence Nationale de la Recherche","keywords":"Edit distance; Algorithm; Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.008301617499869166,"score_gpt":0.22136372594427678,"score_spread":0.21306210844440762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087289587","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.58546156,0.000070773225,0.4108912,0.00031739156,0.0001728897,0.00010730356,0.00011074636,0.000047644877,0.0028205123],"genre_scores_gemma":[0.981547,0.000026365331,0.01737842,0.00018912973,0.00072711933,0.0000039435963,0.00004456268,0.000007920979,0.00007555995],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841297,0.000043966826,0.0001956241,0.0005842512,0.00032238115,0.00044082472],"domain_scores_gemma":[0.99915886,0.000060659004,0.00005118263,0.0004030229,0.000095017276,0.0002312336],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003490216,0.00018554037,0.0001840594,0.00003294494,0.00034180057,0.000042288968,0.00069855555,0.00011542624,0.000037070175],"category_scores_gemma":[0.00009587509,0.00015378132,0.00007547377,0.00025223155,0.004353939,0.000008675771,0.0002645974,0.000106757056,0.000017317181],"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.00011555733,0.00021746755,0.0030931702,0.000023040793,0.000067848094,0.00010726131,0.00013363834,0.000024590623,0.90944815,0.019774726,0.0021662447,0.0648283],"study_design_scores_gemma":[0.0004117494,0.0002928728,0.0025995253,0.000029811443,0.000016313446,0.0002638868,0.0000102249805,0.00669564,0.98360085,0.0014833112,0.0041297106,0.00046611959],"about_ca_topic_score_codex":0.0000012508515,"about_ca_topic_score_gemma":4.7080704e-7,"teacher_disagreement_score":0.39608544,"about_ca_system_score_codex":0.000013059145,"about_ca_system_score_gemma":0.00013258746,"threshold_uncertainty_score":0.9983556},"labels":[],"label_agreement":null},{"id":"W2087404611","doi":"10.1016/s0304-3975(98)00047-4","title":"Alternating finite automata and star-free languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"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":"Star (game theory); Automaton; Two-way deterministic finite automaton; Deterministic automaton; Regular language; Regular expression; Nondeterministic finite automaton; Mathematics; Class (philosophy); Finite-state machine; Construct (python library); Discrete mathematics; Representation (politics); Loop (graph theory); Deterministic finite automaton; Computer science; Combinatorics; Automata theory; Algorithm; Theoretical computer science; Programming language; Mathematical analysis; Artificial intelligence","score_opus":0.005757112725756986,"score_gpt":0.23699416293092448,"score_spread":0.2312370502051675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087404611","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.44819155,0.00009845735,0.53960586,0.0014356463,0.00020584426,0.00010922917,0.0000044220164,0.0005894561,0.009759554],"genre_scores_gemma":[0.8286527,0.000017943856,0.1701826,0.0009869811,0.0001082931,0.000003139214,5.383069e-7,0.0000075716766,0.000040227824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782777,0.00009169729,0.00022963954,0.00071351125,0.0005769333,0.00056043576],"domain_scores_gemma":[0.9979806,0.00041346182,0.000043870095,0.0012555798,0.000051628398,0.00025485802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012869926,0.00018431911,0.0001833182,0.0001230701,0.00039121998,0.00072389015,0.0033442448,0.00003912292,0.00020722808],"category_scores_gemma":[0.00010808095,0.00014829534,0.000038620947,0.0006192748,0.001749554,0.00088574766,0.0014302589,0.00016453082,0.000106192674],"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.0000028974666,0.000022106287,0.000033155247,0.0000045353186,0.000002235384,0.000026150658,0.00037818606,0.00004633442,0.00016653833,0.7462762,0.000042648902,0.25299904],"study_design_scores_gemma":[0.00028941163,0.00011386005,0.0018155404,0.000035517667,0.0000025963764,0.00007068544,0.000008153709,0.804341,0.0012432717,0.19162868,0.0002321156,0.00021914467],"about_ca_topic_score_codex":0.000009487589,"about_ca_topic_score_gemma":4.855254e-7,"teacher_disagreement_score":0.8042947,"about_ca_system_score_codex":0.00002301905,"about_ca_system_score_gemma":0.000046050034,"threshold_uncertainty_score":0.69804895},"labels":[],"label_agreement":null},{"id":"W2088319085","doi":"10.1016/j.tcs.2004.02.036","title":"An algorithmic view of gene teams","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"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":"Computer science; Genome; Comparative genomics; Divide and conquer algorithms; Computational complexity theory; Theoretical computer science; Computational genomics; Partition (number theory); Algorithm; Time complexity; Genomics; Identification (biology); Function (biology); Gene; Mathematics; Biology; Genetics; Combinatorics","score_opus":0.005230644258047232,"score_gpt":0.24631887927356755,"score_spread":0.24108823501552032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088319085","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.49406144,0.00009715454,0.5051232,0.00007116502,0.00011552562,0.000104392835,0.0000030121653,0.000012062806,0.0004120506],"genre_scores_gemma":[0.8718079,0.000019244757,0.12787925,0.000119625445,0.00015304705,0.0000032410396,0.0000066743764,0.000007936842,0.0000031090754],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885553,0.000031843112,0.00016209093,0.0003914545,0.00027633883,0.00028274357],"domain_scores_gemma":[0.9991878,0.000004593538,0.00003827813,0.0005064133,0.00011562801,0.00014726454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005035059,0.00010790122,0.00011926158,0.000051841365,0.000083098435,0.00003172261,0.00070639764,0.000046791276,0.000021962536],"category_scores_gemma":[0.000014713646,0.00009143218,0.000044728728,0.00024789947,0.0015789348,0.000008190427,0.00016737537,0.000052880332,0.00001679964],"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.0000108982595,0.00014008228,0.000065178596,0.000009294536,0.000008515382,0.0000032099017,0.00009972847,0.0006788857,0.8723323,0.09008138,0.0000038092364,0.036566753],"study_design_scores_gemma":[0.00059732946,0.0012412042,0.0013249794,0.00001722825,0.000010091845,0.00004229587,0.000014488571,0.005580472,0.97232115,0.018321292,0.00028059783,0.00024884043],"about_ca_topic_score_codex":0.0000036996448,"about_ca_topic_score_gemma":4.1005526e-7,"teacher_disagreement_score":0.37774643,"about_ca_system_score_codex":0.000018196624,"about_ca_system_score_gemma":0.00011010726,"threshold_uncertainty_score":0.5817651},"labels":[],"label_agreement":null},{"id":"W2088334991","doi":"10.1016/j.tcs.2009.02.002","title":"Energy efficient randomised communication in unknown AdHoc networks","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Broadcasting (networking); Gossip; Binary logarithm; Upper and lower bounds; Computer science; Node (physics); Computer network; Randomized algorithm; Log-log plot; Mathematics; Algorithm; Discrete mathematics; Theoretical computer science","score_opus":0.005181335881111793,"score_gpt":0.22327924849091482,"score_spread":0.21809791260980302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088334991","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.008003174,0.00025187014,0.9834502,0.0012755961,0.00038008866,0.00026773207,1.2982221e-7,0.00023256142,0.0061386493],"genre_scores_gemma":[0.94754237,0.0000372996,0.050613325,0.001667697,0.00010441852,0.000018364357,0.0000012835939,0.000007126827,0.000008138805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667704,0.00038567864,0.0005202968,0.00085490005,0.00069261336,0.0008694476],"domain_scores_gemma":[0.99702096,0.0005516021,0.00011705544,0.0018445804,0.0001559107,0.0003099078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027153194,0.0002488418,0.00033657916,0.00025029256,0.00035045968,0.00047564163,0.0045255125,0.00010087473,0.000022065098],"category_scores_gemma":[0.000055695233,0.00021485792,0.00008984128,0.0024115192,0.0015084079,0.00044013056,0.00096847647,0.0003580238,0.000018015218],"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.000028457214,0.000098438424,0.000005365127,6.561101e-7,0.0000010776699,0.000008389899,0.00013852262,0.09346842,0.000034042667,0.7577004,0.000049119324,0.14846714],"study_design_scores_gemma":[0.0019403311,0.00014390839,0.0005861779,0.00005152766,0.00000229431,0.0000181501,0.0000013903664,0.9315739,0.00029447797,0.06497839,0.000161404,0.00024802497],"about_ca_topic_score_codex":0.0000065673835,"about_ca_topic_score_gemma":0.000003301154,"teacher_disagreement_score":0.9395392,"about_ca_system_score_codex":0.00013832713,"about_ca_system_score_gemma":0.000114711234,"threshold_uncertainty_score":0.87616515},"labels":[],"label_agreement":null},{"id":"W2088855462","doi":"10.1016/j.tcs.2006.10.007","title":"On codes defined by bio-operations","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Baoji University of Arts And Sciences","keywords":"Code (set theory); Block code; Computer science; Decidability; Function (biology); Reed–Muller code; Linear code; Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Programming language; Biology; Decoding methods; Genetics","score_opus":0.005389987106981573,"score_gpt":0.23005966072130168,"score_spread":0.2246696736143201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088855462","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.75849056,0.00003333321,0.23640592,0.00039790376,0.00011530656,0.000058275444,0.0000061817577,0.000027231155,0.0044652903],"genre_scores_gemma":[0.99013007,0.000001945689,0.008726977,0.0008706085,0.00018289668,0.00000244403,0.000030928448,0.0000042898646,0.000049813825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989881,0.00004609667,0.00012837278,0.00039676786,0.00015925968,0.00028141163],"domain_scores_gemma":[0.9995824,0.000040801606,0.000015583211,0.00022584196,0.000060285503,0.00007510141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031236594,0.000106342355,0.00008347852,0.000027965103,0.00027134208,0.000094217365,0.00038162962,0.000057854766,0.000026536592],"category_scores_gemma":[0.00006581139,0.00007397132,0.00003967238,0.00018340252,0.0012588407,0.0000032592143,0.00020223658,0.00006459815,0.000033906374],"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.0000125850465,0.00009183373,0.00013891798,9.313837e-7,0.0000016585337,9.826766e-7,0.0000026672974,0.0004888547,0.31316486,0.68226343,0.0012371562,0.0025961138],"study_design_scores_gemma":[0.00066613714,0.0025099174,0.0038582599,0.000023169794,0.0000105071795,0.000027713902,0.0000042029606,0.078521855,0.8151266,0.093750626,0.004795158,0.0007058393],"about_ca_topic_score_codex":0.000004723386,"about_ca_topic_score_gemma":0.000001426497,"teacher_disagreement_score":0.58851284,"about_ca_system_score_codex":0.000008456914,"about_ca_system_score_gemma":0.000025665891,"threshold_uncertainty_score":0.46382508},"labels":[],"label_agreement":null},{"id":"W2088906714","doi":"10.1016/j.tcs.2013.08.013","title":"Enhanced string covering","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Cover (algebra); Mathematics; Prefix; Suffix; Cardinality (data modeling); Combinatorics; Computation; String searching algorithm; Computer science; Discrete mathematics; Algorithm; Data structure; Linguistics","score_opus":0.006813118042016994,"score_gpt":0.2286797062139488,"score_spread":0.22186658817193183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088906714","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.051919032,0.000014114808,0.9432586,0.0003121002,0.00058680575,0.00014624027,5.221302e-7,0.0002562588,0.0035063322],"genre_scores_gemma":[0.74531674,0.0000024693327,0.2542702,0.00029549352,0.00009340104,0.000008196008,3.5458157e-7,0.0000042132506,0.0000089681735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978816,0.0000406017,0.00021568473,0.000664612,0.0006218188,0.00057567854],"domain_scores_gemma":[0.99842864,0.00013175597,0.000051408708,0.0009299122,0.00016371899,0.00029454657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050602836,0.0001530554,0.00015241525,0.00012278989,0.00041340612,0.0009453848,0.002849313,0.00003566325,0.00013994038],"category_scores_gemma":[0.00004531116,0.00011885725,0.00004122238,0.00078841153,0.0009150196,0.0021638335,0.002283728,0.00016392197,0.00046370795],"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":[6.686862e-7,0.000018199125,0.0000066257535,0.0000022618308,0.000001058831,0.0000022023567,0.00010662789,0.0001190833,0.0065419325,0.849957,0.00005885007,0.14318551],"study_design_scores_gemma":[0.00014845746,0.000086691616,0.0013224027,0.000030329038,9.843642e-7,0.000014109972,0.0000038771273,0.8407864,0.033736728,0.123529404,0.00012080053,0.00021982723],"about_ca_topic_score_codex":0.000012039507,"about_ca_topic_score_gemma":9.671892e-8,"teacher_disagreement_score":0.8406673,"about_ca_system_score_codex":0.00004471294,"about_ca_system_score_gemma":0.00006885116,"threshold_uncertainty_score":0.9116367},"labels":[],"label_agreement":null},{"id":"W2088999425","doi":"10.1016/j.tcs.2009.02.043","title":"State-complexity hierarchies of uniform languages of alphabet-size length","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Hierarchy; Combinatorics; Class (philosophy); State (computer science); Formal language; Discrete mathematics; Simple (philosophy); Complexity class; Chomsky hierarchy; Set (abstract data type); Finite-state machine; Automaton; Computer science; Time complexity; Theoretical computer science; Algorithm; Linguistics; Programming language; Artificial intelligence","score_opus":0.010043604494926939,"score_gpt":0.2575917261567074,"score_spread":0.24754812166178045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088999425","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.38296854,0.000051973788,0.61217946,0.0005053939,0.00013390205,0.000105101295,0.0000064215296,0.00013700152,0.003912222],"genre_scores_gemma":[0.8025662,0.000007646106,0.19710043,0.0002834275,0.000029913925,7.7695876e-7,4.740192e-7,0.000003838709,0.0000073179067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977651,0.00010319128,0.0004293023,0.00048386247,0.0007246008,0.000493929],"domain_scores_gemma":[0.998036,0.00048400296,0.00016501405,0.0009570786,0.00018227902,0.00017561803],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014049587,0.00018580409,0.00035866234,0.000190432,0.00014912187,0.00010364536,0.0028972405,0.00003675827,0.000038010257],"category_scores_gemma":[0.00012795691,0.00014330595,0.00009525497,0.0010825555,0.0040618954,0.00061067846,0.00063567056,0.00015180523,0.000008363469],"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.00001061081,0.000083204424,0.00003774038,0.000012096026,0.0000041101234,0.000005340661,0.0008535667,0.00006236409,0.0048966543,0.90743977,0.000015807329,0.086578764],"study_design_scores_gemma":[0.00024527824,0.00052247616,0.010655633,0.000051576593,0.0000038464113,0.000018214132,0.000024224477,0.14310841,0.07539335,0.76976085,0.000018700268,0.00019741467],"about_ca_topic_score_codex":0.000009672808,"about_ca_topic_score_gemma":5.276596e-7,"teacher_disagreement_score":0.41959766,"about_ca_system_score_codex":0.0000314486,"about_ca_system_score_gemma":0.0001312463,"threshold_uncertainty_score":0.99864846},"labels":[],"label_agreement":null},{"id":"W2089081951","doi":"10.1016/j.tcs.2011.08.007","title":"Palindromic complexity of codings of rotations","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"Palindrome; Mathematics; Computer science; Artificial intelligence; Algorithm; Biology","score_opus":0.04530645399952978,"score_gpt":0.2533063429209016,"score_spread":0.2079998889213718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089081951","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.24778628,0.000009435732,0.7475253,0.00008089298,0.00019389733,0.00008203982,0.0000030003137,0.000067980174,0.0042512105],"genre_scores_gemma":[0.73344344,0.0000012632455,0.2664631,0.00007423343,0.000011739265,0.0000015298588,2.6838535e-7,0.0000030209674,0.000001398288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984372,0.00007366702,0.00037161316,0.0003765428,0.00044014622,0.0003007902],"domain_scores_gemma":[0.9985831,0.0001577039,0.00016119232,0.0007520706,0.00021486892,0.00013105944],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011571296,0.000114699316,0.00024083766,0.00017360026,0.00012786144,0.00003846844,0.0024945654,0.00003296528,0.00009637618],"category_scores_gemma":[0.00005614645,0.000094883704,0.00007463139,0.00090064004,0.006426867,0.00042481566,0.000780057,0.00009216076,0.000017532815],"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.0000051132088,0.00008960621,0.00014076162,0.000010206547,0.0000035776673,0.0000018838982,0.0015707072,0.0000058960177,0.00345947,0.98868924,0.0000069018465,0.0060166144],"study_design_scores_gemma":[0.00015265355,0.00018451747,0.008269714,0.00003386264,0.0000042933702,0.000016740645,0.000015720276,0.20465963,0.08489694,0.7016452,0.0000028887862,0.00011786294],"about_ca_topic_score_codex":0.000016558773,"about_ca_topic_score_gemma":3.9055487e-7,"teacher_disagreement_score":0.4856572,"about_ca_system_score_codex":0.000015416286,"about_ca_system_score_gemma":0.000088073226,"threshold_uncertainty_score":0.9962771},"labels":[],"label_agreement":null},{"id":"W2089886783","doi":"10.1016/j.tcs.2014.02.029","title":"Exhaustive generation of atomic combinatorial differential operators","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Analytical Chemistry and Chromatography","field":"Chemistry","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 à Chicoutimi; Université du Québec à Montréal","funders":"","keywords":"sort; Generalization; Operator (biology); Mathematics; Differential (mechanical device); Differential operator; Discrete mathematics; Combinatorics; Algorithm; Computer science; Pure mathematics; Arithmetic; Chemistry; Physics; Mathematical analysis","score_opus":0.007786497966708939,"score_gpt":0.22595117613908997,"score_spread":0.21816467817238103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089886783","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.8847353,0.000003088537,0.10699172,0.000029052984,0.00023982857,0.000021423815,0.0000027509147,0.000042534815,0.007934334],"genre_scores_gemma":[0.9983876,9.37411e-7,0.0010324374,0.000031741693,0.0005267664,0.0000021065523,0.000005423058,0.000006800985,0.000006203976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99867874,0.000018516841,0.00024135444,0.00036434788,0.00042729528,0.00026973075],"domain_scores_gemma":[0.99922025,0.00007861895,0.00005815836,0.00032940778,0.00013145787,0.00018210351],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00024462066,0.00013677857,0.00020644553,0.000041160525,0.00016936909,0.00006689305,0.0005460538,0.00007970247,0.0007813873],"category_scores_gemma":[0.000057403737,0.00011237501,0.000084849744,0.00027957384,0.0027867341,0.00009465386,0.00020080681,0.00014437299,0.000012361212],"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.000015119841,0.00007056141,0.00029570694,0.000021101028,0.0000070362184,6.2614987e-7,0.000043935663,0.000012976853,0.18806826,0.81080383,0.00002167154,0.0006391601],"study_design_scores_gemma":[0.00040082194,0.000051673233,0.00011063702,0.0000214633,0.000019233545,0.0000036295003,0.000006006042,0.20431258,0.76438683,0.030503709,0.00003068806,0.00015273795],"about_ca_topic_score_codex":0.0000014514404,"about_ca_topic_score_gemma":5.262026e-8,"teacher_disagreement_score":0.78030014,"about_ca_system_score_codex":0.000024195942,"about_ca_system_score_gemma":0.000041430914,"threshold_uncertainty_score":0.9999271},"labels":[],"label_agreement":null},{"id":"W2089939112","doi":"10.1016/j.tcs.2008.03.011","title":"Embedding finite automata within regular expressions","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular expression; Computer science; Automaton; Nondeterministic finite automaton; Timed automaton; Theoretical computer science; Büchi automaton; Set (abstract data type); Deterministic automaton; Algorithm; Expression (computer science); Representation (politics); Automata theory; Programming language","score_opus":0.029109684257736527,"score_gpt":0.3043006566341777,"score_spread":0.2751909723764412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089939112","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.047386885,0.000013339466,0.9480572,0.0003319617,0.0010246019,0.00014411485,9.176351e-7,0.00056362577,0.0024773683],"genre_scores_gemma":[0.48633966,0.000002916583,0.51334727,0.00022406652,0.000059275037,0.0000064125243,3.2420508e-7,0.0000054181214,0.0000146366465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695605,0.0002306094,0.00039173904,0.00083502976,0.0009933524,0.00059320993],"domain_scores_gemma":[0.99729973,0.00031039756,0.0001277958,0.0017366153,0.00019290241,0.00033256024],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023606718,0.00019862979,0.00020753195,0.00024352806,0.0010643165,0.00026867696,0.003928072,0.00007078501,0.000026774544],"category_scores_gemma":[0.00047740573,0.0001635947,0.0000651936,0.0015270159,0.00353291,0.0015596084,0.0016213214,0.00027188784,0.00014909574],"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.0000036694862,0.000041681895,0.000020492915,0.0000037763343,0.0000016609686,0.00002088594,0.0011597337,0.0022717414,0.0019682772,0.9887079,0.000058228332,0.005741931],"study_design_scores_gemma":[0.00014358186,0.00010031351,0.00063643424,0.000037525217,0.0000018461126,0.00016124704,0.0000048925963,0.9123418,0.021650594,0.06457367,0.00012770329,0.00022041239],"about_ca_topic_score_codex":0.0000014431513,"about_ca_topic_score_gemma":3.7854086e-8,"teacher_disagreement_score":0.92413425,"about_ca_system_score_codex":0.000067839435,"about_ca_system_score_gemma":0.00019213445,"threshold_uncertainty_score":0.9991789},"labels":[],"label_agreement":null},{"id":"W2090143015","doi":"10.1016/s0304-3975(02)00183-4","title":"A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Education, Culture, Sports, Science and Technology; Alberta Innovates - Health Solutions","keywords":"Simple (philosophy); Greedy algorithm; Bounded function; Algorithm; Computer science; Domain (mathematical analysis); Mathematics; Function (biology); Relational database; Constant (computer programming); Theoretical computer science; Mathematical optimization; Data mining","score_opus":0.01779435933608195,"score_gpt":0.2961311114551869,"score_spread":0.2783367521191049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090143015","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.022654725,0.000014325496,0.9765104,0.00015932269,0.00013037019,0.0002639185,0.000036955204,0.000075727665,0.00015426507],"genre_scores_gemma":[0.54289395,6.2414216e-7,0.45694512,0.00008118149,0.000025161567,0.000033857476,0.000011938537,0.000003057847,0.000005130521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982905,0.000059288155,0.00026406415,0.00068205665,0.0003388845,0.0003652518],"domain_scores_gemma":[0.9987412,0.0003671735,0.00007840797,0.0004597449,0.00016694979,0.00018649363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014442758,0.00013001155,0.00014872367,0.00031755934,0.0010463685,0.00048561385,0.00041085287,0.000030023923,0.000054510365],"category_scores_gemma":[0.000050852523,0.00011775814,0.00006696717,0.0019942762,0.0005389951,0.0003883661,0.0002487792,0.00008338256,0.000010104067],"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":[5.045801e-7,0.00003178411,0.000114085444,0.0000014381602,0.000017916851,0.000008475731,0.00020465702,0.0015918019,0.000020504725,0.85723346,0.000033130866,0.14074224],"study_design_scores_gemma":[0.0002687487,0.000068175905,0.0011374672,0.000002207896,0.00004360487,0.00019425388,0.000047373524,0.9656219,0.00023028681,0.032013156,0.00022062982,0.00015220525],"about_ca_topic_score_codex":0.000010632539,"about_ca_topic_score_gemma":0.000003099499,"teacher_disagreement_score":0.9640301,"about_ca_system_score_codex":0.00005923216,"about_ca_system_score_gemma":0.000089707864,"threshold_uncertainty_score":0.80479264},"labels":[],"label_agreement":null},{"id":"W2090562519","doi":"10.1016/j.tcs.2008.02.051","title":"Extension of Brzozowski’s derivation calculus of rational expressions to series over the free partially commutative monoids","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"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":"Noncommutative geometry; Extension (predicate logic); Mathematics; Power series; Commutative property; Formal power series; Series (stratigraphy); Expression (computer science); Pure mathematics; Finitely-generated abelian group; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015476486358449839,"score_gpt":0.25462773357631596,"score_spread":0.23915124721786613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090562519","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.3921421,0.0000139388685,0.60691583,0.000515014,0.000120092496,0.00011122631,0.0000052934433,0.000022442064,0.00015407371],"genre_scores_gemma":[0.9005087,0.0000036544868,0.099213816,0.00023259364,0.000027017928,0.0000059028184,9.1144875e-7,0.0000039274223,0.0000034611062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811393,0.00017674557,0.000418797,0.0003203113,0.00073951995,0.00023071082],"domain_scores_gemma":[0.99779224,0.0005456636,0.00017542922,0.000991015,0.00039220258,0.00010344724],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00097082276,0.00012067245,0.0002302948,0.00011980138,0.00029981916,0.00003136925,0.0021353797,0.000035173907,0.000021111266],"category_scores_gemma":[0.00025087837,0.000078448014,0.00006697725,0.0009171533,0.003453444,0.00053988595,0.001353654,0.00009535681,0.0000027331848],"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.000023010256,0.0000711956,0.000078871046,0.0000064127225,0.000003947375,0.0000020206128,0.0035302287,0.0015133377,0.046680525,0.9456406,0.00008431305,0.0023654941],"study_design_scores_gemma":[0.0003258031,0.000498209,0.03893642,0.00012292272,0.000006410864,0.00003978331,0.000065534274,0.4253268,0.32824713,0.20622137,0.000026313824,0.00018331187],"about_ca_topic_score_codex":0.000013370917,"about_ca_topic_score_gemma":0.0000012266393,"teacher_disagreement_score":0.7394193,"about_ca_system_score_codex":0.000018309516,"about_ca_system_score_gemma":0.00016413337,"threshold_uncertainty_score":0.9992586},"labels":[],"label_agreement":null},{"id":"W2090863119","doi":"10.1016/j.tcs.2007.07.032","title":"On the existence of regular approximations","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"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; McGill University","funders":"","keywords":"Closure (psychology); Measure (data warehouse); Degree (music); Mathematics; Context (archaeology); Automaton; Regular language; Approximations of π; Discrete mathematics; Approximation algorithm; Combinatorics; Applied mathematics; Computer science; Theoretical computer science","score_opus":0.011196178193247025,"score_gpt":0.24015798834140104,"score_spread":0.228961810148154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090863119","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.08468639,0.000012076906,0.90327984,0.0012482873,0.00026317296,0.00012748747,6.312699e-7,0.00010998898,0.010272113],"genre_scores_gemma":[0.87341243,8.042912e-7,0.12573792,0.00079266046,0.00004117155,0.0000024783546,1.438407e-7,0.000003797622,0.000008573641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980178,0.00007935988,0.0002855017,0.00043054466,0.0007544246,0.00043237145],"domain_scores_gemma":[0.997174,0.0012149442,0.00009442886,0.0012377255,0.00014754018,0.0001313651],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0045272494,0.00012442267,0.00013904387,0.0001454509,0.00036688085,0.00015618827,0.0033462928,0.000032967684,0.00003146287],"category_scores_gemma":[0.00021002647,0.000074834395,0.00006454038,0.0013439173,0.0034133878,0.0003241293,0.00067187345,0.0001527766,0.000046399025],"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.0000037184138,0.000045347013,0.0000041451226,0.0000028773834,0.0000016885456,0.0000034436996,0.00033601763,0.00003293422,0.0011103887,0.97714746,0.000042027736,0.021269955],"study_design_scores_gemma":[0.00006604084,0.00011813284,0.0006490831,0.000029437266,0.0000015544497,0.000016933218,0.000016966978,0.21987201,0.026708324,0.75238466,0.00003690557,0.00009993112],"about_ca_topic_score_codex":0.000001209476,"about_ca_topic_score_gemma":1.4470335e-7,"teacher_disagreement_score":0.78872603,"about_ca_system_score_codex":0.000028988203,"about_ca_system_score_gemma":0.00005116002,"threshold_uncertainty_score":0.99929875},"labels":[],"label_agreement":null},{"id":"W2091687228","doi":"10.1016/j.tcs.2013.01.032","title":"Cops and invisible robbers: The cost of drunkenness","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Psychology","score_opus":0.0059258660472191645,"score_gpt":0.23838519953481221,"score_spread":0.23245933348759304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091687228","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.34562236,0.00001579367,0.64660406,0.0005552838,0.000043012144,0.00024241133,0.000001015892,0.00003050467,0.0068855593],"genre_scores_gemma":[0.9914219,9.275249e-7,0.008377861,0.00009345733,0.00008051117,0.000013799678,6.7541936e-7,0.0000037221002,0.0000071572404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918014,0.000046566474,0.00015109198,0.00020849232,0.00019828576,0.00021543747],"domain_scores_gemma":[0.99923736,0.00018181268,0.000050624974,0.00033269502,0.00011827771,0.00007921994],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045552247,0.00008238525,0.0001356497,0.000045026074,0.00017689377,0.00013647942,0.0005448702,0.000010359449,0.00039564667],"category_scores_gemma":[0.0000048536835,0.000050568855,0.000037283877,0.00045425846,0.0027670392,0.00015779465,0.0004259162,0.000089668836,0.000014591165],"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":[8.915232e-7,0.000019678082,0.0022869653,0.0000012059592,0.000005348471,5.7427865e-8,0.00011688855,0.000041122057,0.00026832896,0.95213026,0.0002311033,0.044898123],"study_design_scores_gemma":[0.00011306382,0.000057983707,0.0075488696,0.00002490988,0.00001564335,0.0000013324427,0.000060240396,0.34961775,0.0057641347,0.63646466,0.00019128883,0.00014010207],"about_ca_topic_score_codex":0.0000678844,"about_ca_topic_score_gemma":5.626794e-7,"teacher_disagreement_score":0.6457995,"about_ca_system_score_codex":0.000006580699,"about_ca_system_score_gemma":0.00002194395,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W2091897018","doi":"10.1016/j.tcs.2009.05.013","title":"A 3.4713-approximation algorithm for the capacitated multicast tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Destination-Sequenced Distance Vector routing; Mathematics; Approximation algorithm; Algorithm; Link-state routing protocol; Combinatorics; Routing protocol; Distributed computing; Computer network","score_opus":0.020962504307776086,"score_gpt":0.29635319215966927,"score_spread":0.2753906878518932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091897018","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.0010226798,0.000025811529,0.9931785,0.0032104831,0.0002219776,0.0009199965,0.0000029641187,0.00029684926,0.0011207346],"genre_scores_gemma":[0.48135602,0.0000015943117,0.51816064,0.00035401693,0.00007995045,0.000029504616,7.1638766e-7,0.000006080949,0.000011453397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667215,0.00016162566,0.00036583483,0.00086699537,0.00091909093,0.0010142982],"domain_scores_gemma":[0.9968921,0.0012126019,0.00010373712,0.0010472566,0.0004909549,0.00025337993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036261259,0.0002354401,0.00022041693,0.00021635933,0.0011945512,0.0007545466,0.003719599,0.00005638614,0.000005792391],"category_scores_gemma":[0.00026751836,0.00015457954,0.00010873758,0.002055052,0.002598508,0.0010580219,0.0005262358,0.0003102125,0.000026903668],"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.0000058823666,0.000037942187,0.0000010343582,0.0000018248595,0.0000025886893,0.0000017041015,0.00042397567,0.00019334638,0.0008643814,0.5779321,0.000009762367,0.42052543],"study_design_scores_gemma":[0.00026945322,0.00025359436,0.00014173574,0.000015851127,0.0000033197498,0.00002282589,0.000014572016,0.6192824,0.00310148,0.3767184,0.000035467932,0.0001408564],"about_ca_topic_score_codex":0.0000014435554,"about_ca_topic_score_gemma":4.0895574e-7,"teacher_disagreement_score":0.6190891,"about_ca_system_score_codex":0.00009255357,"about_ca_system_score_gemma":0.00012414779,"threshold_uncertainty_score":0.95743114},"labels":[],"label_agreement":null},{"id":"W2091933094","doi":"10.1016/j.tcs.2010.11.006","title":"On the relationship between fuzzy and Boolean cellular automata","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Automaton; Fuzzy logic; Mathematics; Boolean expression; Cellular automaton; Theoretical computer science; Computer science; Discrete mathematics; Algebra over a field; Boolean function; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.018595582783489318,"score_gpt":0.2532387237377519,"score_spread":0.23464314095426259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091933094","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.41064733,0.0000036509932,0.57988316,0.0054919524,0.00016280822,0.0001432824,0.0000015888311,0.00019773174,0.0034685107],"genre_scores_gemma":[0.967485,3.598439e-7,0.031895716,0.0004740511,0.00011045506,0.000010162641,0.0000012796047,0.0000064835285,0.000016465885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982714,0.00007625537,0.00019719463,0.00058231945,0.0005097264,0.0003631002],"domain_scores_gemma":[0.99636173,0.0018967022,0.000054276057,0.001403894,0.000057115187,0.00022625641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015909754,0.0001445536,0.00011790894,0.00010726649,0.00095101795,0.00063164777,0.002437709,0.000056506557,0.000019540279],"category_scores_gemma":[0.0002609673,0.00009549423,0.00003923612,0.0008144914,0.002537272,0.00033603053,0.000903043,0.0004475868,0.00019506247],"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":[4.8988653e-7,0.000019191371,0.0007676568,0.0000017314096,0.0000010999966,0.0000015876445,0.00013924454,0.0000023705622,0.0012517547,0.9908249,0.00008332564,0.006906698],"study_design_scores_gemma":[0.00010030983,0.000058142883,0.0418924,0.000009395039,0.0000043064238,0.000013809975,0.0000025119712,0.1380771,0.0034615085,0.8159454,0.00027240385,0.00016275317],"about_ca_topic_score_codex":0.0000019654283,"about_ca_topic_score_gemma":5.055819e-7,"teacher_disagreement_score":0.5568377,"about_ca_system_score_codex":0.000012340996,"about_ca_system_score_gemma":0.00006433871,"threshold_uncertainty_score":0.93486845},"labels":[],"label_agreement":null},{"id":"W2092520161","doi":"10.1016/s0304-3975(01)00164-5","title":"Frozen development in graph coloring","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Graph coloring; Complete coloring; Combinatorics; Fractional coloring; Edge coloring; Mathematics; List coloring; Discrete mathematics; Random graph; Greedy coloring; Dense graph; Graph; Line graph; Graph power; 1-planar graph","score_opus":0.011163201346677422,"score_gpt":0.23511345542789475,"score_spread":0.22395025408121733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092520161","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.09607591,0.000005626883,0.89758366,0.000560933,0.0003550904,0.00009384772,6.409378e-8,0.00013051504,0.0051943786],"genre_scores_gemma":[0.74763787,0.000004151887,0.2520613,0.00026277345,0.000019997105,0.0000045813517,2.1246866e-7,0.0000022636655,0.0000068223308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850297,0.000043749154,0.00022951246,0.00044355553,0.00040380325,0.00037643846],"domain_scores_gemma":[0.9993365,0.00008211182,0.00003457507,0.00031695762,0.00007978896,0.00015009314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836393,0.00010346385,0.00010922264,0.00031250762,0.00022397743,0.00024792957,0.0009770647,0.000030314764,0.00007014469],"category_scores_gemma":[0.000035995494,0.00009404594,0.00002209985,0.0015940361,0.0006656058,0.0005997237,0.00041778816,0.000118820484,0.00006395295],"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.0000027043184,0.000023968,0.002488123,0.0000010250783,8.206798e-7,0.00001504867,0.00042943878,0.0011349564,0.00008213061,0.84877354,0.0000047758117,0.14704348],"study_design_scores_gemma":[0.00045236122,0.0000645412,0.06693605,0.00003731313,0.0000010440343,0.000081229584,0.000011857795,0.8699444,0.0021996943,0.059109114,0.00082984404,0.00033255797],"about_ca_topic_score_codex":0.0000026853618,"about_ca_topic_score_gemma":0.000006498279,"teacher_disagreement_score":0.86880946,"about_ca_system_score_codex":0.000088359106,"about_ca_system_score_gemma":0.00014382531,"threshold_uncertainty_score":0.3835082},"labels":[],"label_agreement":null},{"id":"W2092910894","doi":"10.1016/s0304-3975(98)00223-0","title":"Power consumption in packet radio networks","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":424,"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; Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Bounded function; Network packet; Constant (computer programming); Approximation algorithm; Mathematics; Assignment problem; Range (aeronautics); Generalized assignment problem; Node (physics); Path (computing); Mathematical optimization; Dynamic programming; Combinatorics; Discrete mathematics; Computer science; Computer network","score_opus":0.007225679416192487,"score_gpt":0.23289500770145535,"score_spread":0.22566932828526287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092910894","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.105109006,0.00009465164,0.88518655,0.00042409333,0.00058734656,0.00023475186,3.962778e-7,0.0002399658,0.008123265],"genre_scores_gemma":[0.9574265,0.000040863997,0.041457526,0.00089412014,0.0001253863,0.000013566922,6.7693225e-7,0.00001000257,0.00003134894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686253,0.00019781296,0.00038762123,0.0009578327,0.00064655615,0.0009476428],"domain_scores_gemma":[0.9981197,0.00027434342,0.000050246377,0.0011657404,0.000060303544,0.0003296546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018031297,0.00022948485,0.00026078857,0.00017375294,0.00023583538,0.0004836553,0.0028205349,0.00010097926,0.0012149642],"category_scores_gemma":[0.000022043841,0.00020340164,0.000064577966,0.0015774333,0.0023107019,0.00093590206,0.0005330227,0.0003987852,0.00040828722],"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.000012070411,0.00006430415,0.0006127513,0.0000018673746,0.0000017707456,0.00004075623,0.0002246759,0.011554316,0.000015318834,0.8853256,0.00023016101,0.1019164],"study_design_scores_gemma":[0.0003390368,0.00013262767,0.01170076,0.00003927324,0.0000013699181,0.00007032013,9.530884e-7,0.9508087,0.00008643256,0.036044553,0.00049655966,0.0002794209],"about_ca_topic_score_codex":0.0000028324664,"about_ca_topic_score_gemma":0.0000015601322,"teacher_disagreement_score":0.9392544,"about_ca_system_score_codex":0.00011137954,"about_ca_system_score_gemma":0.0000684191,"threshold_uncertainty_score":0.99969804},"labels":[],"label_agreement":null},{"id":"W2093015753","doi":"10.1016/j.tcs.2009.04.023","title":"On the relative dominance of paging algorithms","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Austrian Science Fund","keywords":"Paging; Computer science; Algorithm; Thrashing; Demand paging; Interval (graph theory); Mathematics; Virtual memory; Parallel computing; Combinatorics; Operating system; Memory management","score_opus":0.013791904763709497,"score_gpt":0.2660141089415978,"score_spread":0.2522222041778883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093015753","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.0029653367,0.000010887717,0.97765464,0.008572972,0.00015295307,0.0001564105,4.883189e-7,0.00006284616,0.01042349],"genre_scores_gemma":[0.8128402,0.0000041360336,0.18562579,0.0014883089,0.000021232518,0.0000019620195,1.1045023e-7,0.0000019907977,0.000016241429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982455,0.00013207627,0.00020935619,0.0004007666,0.0006640766,0.00034827096],"domain_scores_gemma":[0.99839884,0.0005517773,0.00007299562,0.0006706001,0.00019438844,0.00011138186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017035231,0.000107124586,0.00013085411,0.00011122826,0.00032677824,0.00018312542,0.0021378424,0.000024876446,0.000032432265],"category_scores_gemma":[0.00018361335,0.000064526794,0.00004819613,0.0012584665,0.001717044,0.0005096245,0.00031170156,0.00019673978,0.000033665507],"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.000002997049,0.000037619353,0.0000018851775,7.7818714e-7,0.0000010511992,0.0000020007699,0.000523705,0.0008650797,0.00017499158,0.9656553,0.000053965312,0.032680627],"study_design_scores_gemma":[0.00007893254,0.00020326371,0.00017283519,0.000022075721,5.702056e-7,0.0000033072483,0.0000019184904,0.5526247,0.0023111622,0.4445014,0.000020405845,0.00005945117],"about_ca_topic_score_codex":5.997046e-7,"about_ca_topic_score_gemma":3.2497184e-8,"teacher_disagreement_score":0.8098749,"about_ca_system_score_codex":0.00002694425,"about_ca_system_score_gemma":0.00007740049,"threshold_uncertainty_score":0.63265204},"labels":[],"label_agreement":null},{"id":"W2093528244","doi":"10.1016/j.tcs.2005.11.039","title":"Approximation algorithms for minimizing the total weighted tardiness on a single machine","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"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; European Social Fund; Ministry of National Education and Religious Affairs","keywords":"Tardiness; Algorithm; Single-machine scheduling; Computer science; Approximation algorithm; Mathematical optimization; Mathematics; Job shop scheduling","score_opus":0.009993433012399786,"score_gpt":0.21974957702617523,"score_spread":0.20975614401377546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093528244","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.023587821,0.000027967943,0.97343713,0.00032813905,0.0006379377,0.00020251531,0.000005962278,0.00026874896,0.0015037757],"genre_scores_gemma":[0.6571548,4.26848e-7,0.3424825,0.00005795498,0.0002604134,0.000015056839,0.000007761918,0.000012073899,0.000009031423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990155,0.0000202609,0.00017592986,0.00022807809,0.00027694655,0.00028328638],"domain_scores_gemma":[0.99941516,0.00020048906,0.00002211033,0.00021760052,0.000089077395,0.000055565695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045537858,0.00012613382,0.00011112351,0.000082446444,0.00026872443,0.0001829132,0.00030772455,0.00003642468,0.0000145222375],"category_scores_gemma":[0.00002774777,0.000085337924,0.000045782912,0.00045846315,0.0004947017,0.00011223824,0.00004484192,0.000096333526,0.000011488515],"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.000013528447,0.000064351974,0.000002938886,0.000013772852,0.000005371033,0.0000010183307,0.00014296711,0.5108594,0.00080320914,0.45192188,0.000075848344,0.036095716],"study_design_scores_gemma":[0.00023745006,0.00006649022,0.00007137137,0.000015028485,0.0000056899717,0.000009075846,0.0000062334975,0.98021185,0.008198218,0.011025023,0.00002615619,0.0001274069],"about_ca_topic_score_codex":0.0000014973275,"about_ca_topic_score_gemma":1.2716282e-7,"teacher_disagreement_score":0.633567,"about_ca_system_score_codex":0.000045567354,"about_ca_system_score_gemma":0.000011478998,"threshold_uncertainty_score":0.34799796},"labels":[],"label_agreement":null},{"id":"W2093783531","doi":"10.1016/j.tcs.2011.02.021","title":"Positive expansiveness versus network dimension in symbolic dynamical systems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dynamical systems theory; Countable set; Dynamical system (definition); Topological entropy; Symbolic dynamics; Counterexample; Discrete mathematics; Invariant (physics); Exponent; Dimension (graph theory); Function (biology); Topological conjugacy; Pure mathematics; Combinatorics","score_opus":0.014673494038912948,"score_gpt":0.23768209010071864,"score_spread":0.2230085960618057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093783531","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.14846608,0.00004427178,0.84679264,0.00012628031,0.0009248215,0.00023830094,0.000001054035,0.00016534784,0.003241224],"genre_scores_gemma":[0.961911,0.0000029586074,0.037873562,0.00009957912,0.00007858199,0.000022067223,0.0000016647156,0.0000073019587,0.0000032829523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977667,0.00013907246,0.00028475773,0.00072485936,0.00045498693,0.0006296261],"domain_scores_gemma":[0.99850774,0.00024145567,0.000058281505,0.00084109633,0.00012258539,0.00022881835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000815303,0.00017154748,0.00022037723,0.00014282808,0.00027681995,0.0002109317,0.001959166,0.00006265702,0.000010886854],"category_scores_gemma":[0.000022813887,0.00014861584,0.00004875039,0.0015441752,0.0012643227,0.00046762364,0.0010081244,0.00018362977,0.00009946854],"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.000015931513,0.00007415829,0.00008720916,0.0000030335925,0.0000024457236,0.000023828912,0.0006165629,0.0005100855,0.00034250226,0.9945861,0.00000756765,0.003730571],"study_design_scores_gemma":[0.0003650789,0.00015658292,0.009801284,0.000055135675,0.0000042823644,0.000031904558,0.000014917372,0.9451089,0.0010697194,0.043132693,0.000016371314,0.00024312439],"about_ca_topic_score_codex":0.000032964548,"about_ca_topic_score_gemma":0.0000021417054,"teacher_disagreement_score":0.9514534,"about_ca_system_score_codex":0.0000925457,"about_ca_system_score_gemma":0.00009749641,"threshold_uncertainty_score":0.60603786},"labels":[],"label_agreement":null},{"id":"W2093995619","doi":"10.1016/j.tcs.2005.11.023","title":"Efficient algorithms for robustness in resource allocation and scheduling problems","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"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":"Computer science; Robustness (evolution); Scheduling (production processes); Algorithm; Mathematical optimization; Distributed computing; Mathematics","score_opus":0.019938166810192462,"score_gpt":0.27476555904362915,"score_spread":0.2548273922334367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093995619","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.016679918,0.000042624593,0.9765691,0.005706551,0.00008853475,0.0004623808,4.948387e-7,0.000106268984,0.00034410812],"genre_scores_gemma":[0.50899047,0.000002534488,0.49065876,0.00027099895,0.000045876925,0.000020580634,5.497246e-7,0.00000418095,0.000006051942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798495,0.00009752601,0.0002791798,0.0006936491,0.00043897162,0.0005057377],"domain_scores_gemma":[0.9989006,0.00026066334,0.00004942813,0.00041092298,0.0001770628,0.00020132173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034565278,0.00012772097,0.00014537846,0.00025670105,0.00029219207,0.00042310279,0.001021086,0.00004633433,0.00000477272],"category_scores_gemma":[0.00013015461,0.0001107953,0.000025537072,0.0009908208,0.00092644617,0.00032505856,0.00051477127,0.00013900409,0.0000054699826],"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.0000028981801,0.00003903628,0.0000064893984,0.0000072858984,5.242265e-7,3.1824825e-7,0.00035440375,0.4906004,0.00007666724,0.46464235,0.0000034037748,0.04426622],"study_design_scores_gemma":[0.00042361883,0.00009262903,0.00012457882,0.00004143852,0.0000010171512,0.000009998148,0.000008986473,0.9929695,0.00042843353,0.0055262465,0.00021983244,0.00015372054],"about_ca_topic_score_codex":0.0000010871416,"about_ca_topic_score_gemma":0.0000010029743,"teacher_disagreement_score":0.5023691,"about_ca_system_score_codex":0.00007060005,"about_ca_system_score_gemma":0.00009359331,"threshold_uncertainty_score":0.45181012},"labels":[],"label_agreement":null},{"id":"W2094083250","doi":"10.1016/j.tcs.2011.05.016","title":"An edge deletion model for complex networks","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.035898796686286094,"score_gpt":0.28954232575921907,"score_spread":0.25364352907293297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094083250","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.017538961,0.0000022509487,0.97790813,0.000024957328,0.000058316356,0.0002074737,0.0000037292823,0.00012417372,0.0041320142],"genre_scores_gemma":[0.73314714,1.7755985e-7,0.26646698,0.000102992286,0.0002393926,0.000020332996,0.000010703773,0.000008737317,0.0000035112546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987216,0.00004017457,0.0002038375,0.00042930673,0.00018230769,0.00042279746],"domain_scores_gemma":[0.99905556,0.000050671297,0.000057259833,0.00048490305,0.0001701661,0.00018145173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555928,0.00013950393,0.00017742363,0.00007733297,0.00032991494,0.00010131519,0.00082881073,0.000024485073,0.00025192468],"category_scores_gemma":[0.0000021393164,0.0001216573,0.000094533265,0.0003399466,0.0011689125,0.00022873154,0.00017938687,0.000097983735,0.0000061757924],"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.000012633798,0.00009255133,0.0003516478,8.804205e-7,0.000005250368,1.100872e-7,0.0001566746,0.00590859,0.00017405378,0.9600272,0.00014319636,0.03312717],"study_design_scores_gemma":[0.000067509194,0.00007645577,0.0003546101,0.0000034646976,0.000010706533,2.7849856e-7,0.0000031361267,0.6607999,0.0002916903,0.33826506,0.000016943588,0.000110244415],"about_ca_topic_score_codex":0.0000088684765,"about_ca_topic_score_gemma":7.6318196e-7,"teacher_disagreement_score":0.71560824,"about_ca_system_score_codex":0.00001866037,"about_ca_system_score_gemma":0.000033190223,"threshold_uncertainty_score":0.49610406},"labels":[],"label_agreement":null},{"id":"W2094270516","doi":"10.1016/j.tcs.2014.03.014","title":"A bijective variant of the Burrows–Wheeler Transform using V -order","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"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; Bijection; String (physics); Factorization; Order (exchange); Combinatorics; Mathematics; Sorting; Suffix; Algorithm; Extension (predicate logic); Suffix array; Discrete mathematics; Data structure; Computer science","score_opus":0.008812748346585018,"score_gpt":0.23876803994743095,"score_spread":0.22995529160084593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094270516","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.016424589,0.000010247376,0.97980917,0.0006146884,0.0006807879,0.00016261247,0.0000022124013,0.000057036927,0.0022386669],"genre_scores_gemma":[0.73537713,8.111083e-7,0.26428056,0.00025940867,0.000071841416,0.0000016960826,1.3935501e-7,0.0000046153887,0.000003800113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784213,0.00014884533,0.00026883648,0.0005499992,0.0007630324,0.00042715186],"domain_scores_gemma":[0.9982161,0.00019236829,0.000092951166,0.0010972666,0.00025819457,0.00014311392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013364374,0.00015816318,0.00020321074,0.0001035016,0.0004503262,0.0001851684,0.0031741783,0.000048273323,0.000031318676],"category_scores_gemma":[0.000086035616,0.000092521754,0.000078043784,0.0014837135,0.0020802887,0.0006510273,0.0013102088,0.00018681129,0.000010758523],"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.000003762995,0.00004328721,0.000015270123,0.0000048207885,0.000002720757,0.0000010970632,0.00037642106,0.00058924576,0.0019869583,0.96126616,0.000009188893,0.035701096],"study_design_scores_gemma":[0.00017706108,0.000093660376,0.00059847604,0.000043801014,0.000004857424,0.000037112797,0.0000032586502,0.8445209,0.009965989,0.14427659,0.00014844153,0.00012983874],"about_ca_topic_score_codex":0.000019522884,"about_ca_topic_score_gemma":6.4510266e-7,"teacher_disagreement_score":0.8439317,"about_ca_system_score_codex":0.00003800793,"about_ca_system_score_gemma":0.00016454548,"threshold_uncertainty_score":0.766491},"labels":[],"label_agreement":null},{"id":"W2094391659","doi":"10.1016/j.tcs.2013.12.023","title":"Price of asynchrony in mobile agents computing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchrony (computer programming); Asynchronous communication; Rendezvous; Computer science; Distributed computing; Task (project management); Context (archaeology); Grid; Node (physics); Synchronization (alternating current); Distributed algorithm; Integer (computer science); Computer network; Mathematics; Spacecraft","score_opus":0.01074761978554087,"score_gpt":0.27420456160855056,"score_spread":0.26345694182300966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094391659","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.039623566,0.000010637441,0.9523421,0.00020530996,0.0002256456,0.00018569642,2.3903024e-7,0.00008057635,0.007326239],"genre_scores_gemma":[0.7697731,0.0000030508256,0.22992173,0.00026451927,0.000026505286,0.0000026729833,2.4924285e-7,0.0000037154537,0.000004453231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978119,0.00018996398,0.00034849157,0.00051129493,0.0006485929,0.0004897358],"domain_scores_gemma":[0.9986622,0.00028519396,0.00008420511,0.0006046833,0.00017655792,0.00018717759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026447256,0.000117140466,0.0002039676,0.00026642665,0.00013944732,0.00016648878,0.0021694477,0.000037369304,0.000041217412],"category_scores_gemma":[0.00012132332,0.00010119992,0.00003861184,0.0016138498,0.0012889382,0.0004507572,0.0011023799,0.00015852271,0.000036017016],"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.0000016178723,0.00007566001,0.00028400132,0.000011549312,9.3690636e-7,0.0000015123965,0.0006447243,0.017602269,0.00019701544,0.92847246,0.000015900472,0.052692365],"study_design_scores_gemma":[0.0002510884,0.00019473404,0.002157657,0.000037729806,5.214281e-7,0.000005120971,0.0000040096807,0.97037184,0.0012063502,0.0254911,0.00016072569,0.00011912365],"about_ca_topic_score_codex":0.0000030947272,"about_ca_topic_score_gemma":3.519614e-7,"teacher_disagreement_score":0.9527696,"about_ca_system_score_codex":0.000046315898,"about_ca_system_score_gemma":0.00009370767,"threshold_uncertainty_score":0.47491467},"labels":[],"label_agreement":null},{"id":"W2094408690","doi":"10.1016/j.tcs.2012.12.011","title":"Strict hierarchy among Bell Theorems","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bell state; Local hidden variable theory; Bell's theorem; Bell test experiments; Quantum teleportation; Mathematics; Quantum mechanics; Bipartite graph; State (computer science); Quantum entanglement; Quantum; Discrete mathematics; Physics; Quantum channel; Algorithm","score_opus":0.008465686951181533,"score_gpt":0.24540853434351137,"score_spread":0.23694284739232985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094408690","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.36275214,0.000007046771,0.62377554,0.000095980104,0.00018551301,0.00009531346,0.000004282523,0.000032147113,0.013052071],"genre_scores_gemma":[0.99513006,4.4605582e-7,0.0042441296,0.000078699406,0.0005100358,0.000013529513,0.0000028699512,0.000008185607,0.000012068611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987864,0.00004339029,0.0001412279,0.00024357664,0.0002700604,0.0005153787],"domain_scores_gemma":[0.99912024,0.00011948959,0.00004034241,0.00036783717,0.00005579923,0.00029631305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093929836,0.00011100752,0.000105317515,0.000059611943,0.00035791352,0.0001043183,0.00057414215,0.00001798232,0.0005287112],"category_scores_gemma":[0.00000592772,0.00008617113,0.00005402868,0.00049325667,0.0012529618,0.0002587277,0.00027601293,0.00014177256,0.0001761315],"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.0000013768116,0.00007822329,0.0022341693,6.85184e-7,0.000002793983,7.8667206e-8,0.00013451361,0.0000038023213,0.0002571567,0.98581403,0.000045377135,0.01142778],"study_design_scores_gemma":[0.00009245404,0.00003187604,0.00452217,0.0000058886058,0.0000069098533,8.236667e-7,0.000019705485,0.0510828,0.004026885,0.93956774,0.00048682475,0.00015592707],"about_ca_topic_score_codex":0.000007024929,"about_ca_topic_score_gemma":3.525687e-8,"teacher_disagreement_score":0.6323779,"about_ca_system_score_codex":0.0000137614925,"about_ca_system_score_gemma":0.000031329062,"threshold_uncertainty_score":0.57890165},"labels":[],"label_agreement":null},{"id":"W2096578724","doi":"10.1016/j.tcs.2014.09.022","title":"Confident and consistent partial learning of recursive functions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore","keywords":"Recursive functions; Partial function; Computer science; Mathematics; Calculus (dental); Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics; Pure mathematics; Medicine","score_opus":0.005754438812722299,"score_gpt":0.23142524644197493,"score_spread":0.22567080762925262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096578724","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.046170812,0.000018786744,0.9496218,0.0008919524,0.00043027796,0.000060282735,2.9083628e-7,0.00009348131,0.0027123326],"genre_scores_gemma":[0.94311917,0.0000025346296,0.056599796,0.00015545213,0.00008894064,0.0000022234715,3.2636473e-7,0.000003385845,0.000028158127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841404,0.0002065028,0.00021148787,0.0004574651,0.00040916787,0.0003013159],"domain_scores_gemma":[0.99883103,0.0003701833,0.000088121764,0.00035643182,0.00015783109,0.0001963885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014404117,0.000109574525,0.0001797668,0.0001108184,0.00035099188,0.00018193269,0.0006744471,0.000029200566,0.000020472784],"category_scores_gemma":[0.00026441636,0.00008905614,0.000041022573,0.0004144115,0.002167797,0.00019919191,0.0005786516,0.00022341273,0.00002144765],"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.0000026898358,0.000019175204,0.00029023946,0.0000048116553,0.0000027341553,0.0000010953199,0.00035700112,0.00061085826,0.00020924148,0.9323129,0.000012252274,0.06617699],"study_design_scores_gemma":[0.00020937077,0.00046301313,0.0017588561,0.000027874135,0.0000057668676,0.00003822975,0.000015460388,0.9610066,0.0014196103,0.03409749,0.000823311,0.00013445337],"about_ca_topic_score_codex":0.000007954593,"about_ca_topic_score_gemma":1.5802323e-7,"teacher_disagreement_score":0.9603957,"about_ca_system_score_codex":0.000012447335,"about_ca_system_score_gemma":0.00004905195,"threshold_uncertainty_score":0.79873383},"labels":[],"label_agreement":null},{"id":"W2099745962","doi":"10.1016/j.tcs.2011.09.002","title":"Asynchronous deterministic rendezvous in bounded terrains","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Robot; Asynchronous communication; Computer science; Terrain; Bounded function; Mobile robot; Polygon (computer graphics); A priori and a posteriori; Trajectory; Algorithm; Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Spacecraft; Engineering; Geography","score_opus":0.027579630914106534,"score_gpt":0.2618971261887515,"score_spread":0.23431749527464496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099745962","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.009516098,0.000008081905,0.96300393,0.00028558797,0.00037729018,0.00018476268,5.157317e-7,0.00019576063,0.026427988],"genre_scores_gemma":[0.7039677,0.0000027815468,0.29557097,0.00041106358,0.00002455368,0.000008015121,2.6779745e-7,0.000005540499,0.000009125388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975468,0.00013831261,0.00032540187,0.0007071367,0.0005591459,0.00072322006],"domain_scores_gemma":[0.99859035,0.00010749424,0.000054687956,0.00081871566,0.000116435636,0.00031234504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359113,0.00016693716,0.00018896427,0.0003371782,0.00026063286,0.00035422313,0.0026836211,0.00005357682,0.00013104326],"category_scores_gemma":[0.00010219886,0.00014353641,0.000043762942,0.001318344,0.00244408,0.00071119994,0.0009692255,0.00022136277,0.00013318253],"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.0000047297913,0.00010185143,0.00012755195,0.000004015557,0.0000011816894,0.00005205142,0.0022031192,0.00008025988,0.000054427095,0.9688717,0.000008952221,0.028490162],"study_design_scores_gemma":[0.00027360985,0.00029342296,0.002752874,0.00002132053,0.00000112566,0.000055221655,0.0000074744867,0.74851084,0.000566311,0.24726154,0.000040100706,0.00021616332],"about_ca_topic_score_codex":0.000010668602,"about_ca_topic_score_gemma":0.000005561537,"teacher_disagreement_score":0.7484306,"about_ca_system_score_codex":0.00009609868,"about_ca_system_score_gemma":0.0002517576,"threshold_uncertainty_score":0.9005315},"labels":[],"label_agreement":null},{"id":"W2099846147","doi":"10.1016/j.tcs.2007.04.024","title":"Hardness and approximation results for Black Hole Search in arbitrary networks","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Node (physics); Black hole (networking); Approximation algorithm; Tree (set theory); Upper and lower bounds; Computer science; Mathematics; Black box; Combinatorics; Planar graph; Discrete mathematics; Theoretical computer science; Graph; Physics; Computer network; Artificial intelligence; Routing (electronic design automation)","score_opus":0.015594494620845169,"score_gpt":0.26388932728968884,"score_spread":0.24829483266884367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099846147","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.04132121,0.000028476536,0.95435524,0.0005984764,0.0004323283,0.0006837207,8.867207e-7,0.00010497801,0.002474686],"genre_scores_gemma":[0.7906343,0.0000069310954,0.20862484,0.00057140423,0.00012757006,0.000013935183,0.0000023532307,0.000006568052,0.000012127701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972033,0.00009286538,0.00041210203,0.00090433913,0.00055794086,0.00082947646],"domain_scores_gemma":[0.9984318,0.0004407616,0.00006423972,0.0007033049,0.000113311864,0.00024657644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007005711,0.0001694474,0.00019106896,0.00030122872,0.00022086546,0.00041530782,0.00151054,0.00005946555,0.0000017653505],"category_scores_gemma":[0.000055935056,0.00015231878,0.00003799844,0.0014355803,0.0015893403,0.00060365873,0.0010063224,0.00020728119,0.000008296722],"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.000057418478,0.000053228334,0.000035798945,0.000019550153,0.0000021339554,0.000011443819,0.00044100845,0.027918885,0.000023737806,0.89988947,0.00019079301,0.07135653],"study_design_scores_gemma":[0.00064655324,0.00018229823,0.0019041914,0.00004363752,0.0000021417331,0.0000029735677,0.000012115446,0.96709365,0.0006572321,0.029077187,0.00019132032,0.00018668434],"about_ca_topic_score_codex":0.000004248706,"about_ca_topic_score_gemma":0.0000031275856,"teacher_disagreement_score":0.9391748,"about_ca_system_score_codex":0.00010663037,"about_ca_system_score_gemma":0.00006751548,"threshold_uncertainty_score":0.621138},"labels":[],"label_agreement":null},{"id":"W2100899126","doi":"10.1016/j.tcs.2009.03.030","title":"Interpolation of polynomials given by straight-line programs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Interpolation (computer graphics); Line (geometry); Combinatorics; Polynomial; Polynomial interpolation; Degree (music); Upper and lower bounds; Discrete mathematics; Linear interpolation; Geometry; Mathematical analysis; Computer science; Image (mathematics)","score_opus":0.00979432748980266,"score_gpt":0.2506469350022867,"score_spread":0.24085260751248402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100899126","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.069537595,0.000034270535,0.9258408,0.0021935278,0.0003238116,0.0001855435,0.0000018506164,0.00015992679,0.0017226913],"genre_scores_gemma":[0.9046885,0.0000016489729,0.094842,0.00034843842,0.00010041499,0.0000018516383,0.0000029661228,0.0000034434604,0.0000107726155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799645,0.00007580242,0.0004116717,0.0005406864,0.0005499321,0.00042546805],"domain_scores_gemma":[0.99891454,0.000099137054,0.00014385565,0.0004794351,0.00015253368,0.00021050054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112983,0.00016803117,0.00023747045,0.00016178301,0.00016193662,0.00025167875,0.001763892,0.00004892093,0.000023357772],"category_scores_gemma":[0.000038369817,0.0001376481,0.00007528858,0.00096544455,0.0010042064,0.0007500751,0.00032956144,0.00012393176,0.00001853224],"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.000007918184,0.00010530974,0.000011360392,0.0000026809903,0.0000020496832,0.0000011697036,0.00024439412,0.00003821249,0.013703662,0.63662195,0.000114096474,0.34914717],"study_design_scores_gemma":[0.00034768274,0.0011631501,0.001274889,0.000051006675,0.0000047372887,0.00001627361,0.000003507178,0.7396127,0.037023015,0.22010772,0.0001412621,0.00025404457],"about_ca_topic_score_codex":0.0000043546247,"about_ca_topic_score_gemma":2.908565e-7,"teacher_disagreement_score":0.83515084,"about_ca_system_score_codex":0.000038340517,"about_ca_system_score_gemma":0.00009781797,"threshold_uncertainty_score":0.5613127},"labels":[],"label_agreement":null},{"id":"W2101961482","doi":"10.1016/j.tcs.2012.10.011","title":"Learning without coding","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Numbering; Theoretical computer science; Computer science; Computable function; Coding (social sciences); Iterative learning control; Artificial intelligence; Natural language processing; Mathematics; Algorithm","score_opus":0.009088502408711367,"score_gpt":0.2651701515503501,"score_spread":0.2560816491416388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101961482","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.042091344,0.000028031041,0.9455636,0.0005318866,0.0009784707,0.00006128544,9.238091e-8,0.00045989215,0.010285407],"genre_scores_gemma":[0.7945136,0.0000018256491,0.20475817,0.00029805666,0.00037079127,0.0000023921186,2.165248e-7,0.0000066894804,0.00004829321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765325,0.00016528131,0.00018598381,0.00045876548,0.000653387,0.0008833135],"domain_scores_gemma":[0.99871933,0.00018915437,0.00006203153,0.0005100912,0.00008759024,0.0004318056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025643136,0.00016254977,0.00017000645,0.00015861634,0.0007037515,0.0004418995,0.0018005258,0.000037935963,0.00004951626],"category_scores_gemma":[0.00017012256,0.00012950222,0.000053158783,0.0009187039,0.0011236465,0.001074446,0.001067949,0.00042729513,0.00027680042],"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.0000011166271,0.000028528202,0.003433078,0.0000029506164,0.0000017107681,0.0000018555505,0.000825167,0.00020065636,0.0003334213,0.9160741,0.000012262664,0.079085164],"study_design_scores_gemma":[0.00014802201,0.00013963191,0.0050271326,0.000021103464,0.0000028643144,0.00008037903,0.000009595287,0.97970504,0.0016335837,0.011952873,0.0010153743,0.0002644078],"about_ca_topic_score_codex":0.0000028820796,"about_ca_topic_score_gemma":2.7904738e-8,"teacher_disagreement_score":0.97950435,"about_ca_system_score_codex":0.000040307707,"about_ca_system_score_gemma":0.00005047908,"threshold_uncertainty_score":0.54127586},"labels":[],"label_agreement":null},{"id":"W2102729564","doi":"10.1016/j.tcs.2004.10.033","title":"Data exchange: semantics and query answering","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Data exchange; Schema (genetic algorithms); Theoretical computer science; Semantics (computer science); Information retrieval; Database; Programming language","score_opus":0.022598624166246625,"score_gpt":0.2786496916886596,"score_spread":0.25605106752241297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102729564","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.0135849165,0.0001313252,0.9838517,0.0012161172,0.0004983465,0.0001093778,0.000016325412,0.00018921876,0.0004027019],"genre_scores_gemma":[0.52123815,0.00002006895,0.47835627,0.00027020043,0.00010340883,0.0000016767551,0.0000026493283,0.000004900767,0.0000026546045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979727,0.000034252906,0.00020813121,0.0008594324,0.00046111125,0.00046436087],"domain_scores_gemma":[0.99776876,0.00008735156,0.000051105413,0.0017721204,0.000080316226,0.00024035375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010934781,0.00015728225,0.00017928216,0.000109374894,0.00039588427,0.00027837214,0.0021044584,0.000031672113,0.0000049381692],"category_scores_gemma":[0.00007886865,0.00012776423,0.000016030874,0.0006316602,0.0020528138,0.0021802248,0.0046883873,0.00013711918,0.000022192526],"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.0000014326553,0.00001559093,0.000023069817,0.00001702148,0.0000016585126,0.000024885423,0.00022602812,0.00008875658,0.00034422352,0.98284376,0.000015484455,0.01639808],"study_design_scores_gemma":[0.0010021281,0.0003760813,0.0016340384,0.00032675973,0.000011987677,0.00073309604,0.0000512466,0.6843181,0.0066299033,0.28748354,0.016363163,0.0010699314],"about_ca_topic_score_codex":0.000012978319,"about_ca_topic_score_gemma":0.0000051156244,"teacher_disagreement_score":0.69536024,"about_ca_system_score_codex":0.000031711807,"about_ca_system_score_gemma":0.000108944565,"threshold_uncertainty_score":0.75636774},"labels":[],"label_agreement":null},{"id":"W2102862468","doi":"10.1016/j.tcs.2005.10.002","title":"Simplifying the weft hierarchy","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Hierarchy; Normalization (sociology); Monotone polygon; Simple (philosophy); Mathematics; Discrete mathematics; Combinatorics; Calculus (dental); Algebra over a field; Pure mathematics; Philosophy; Epistemology; Geometry","score_opus":0.017219545451255067,"score_gpt":0.3028416063272443,"score_spread":0.2856220608759892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102862468","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.010935218,0.00006530339,0.97057444,0.009986742,0.00029602856,0.00021946664,6.5505554e-7,0.00029532574,0.007626811],"genre_scores_gemma":[0.8039821,0.000005870308,0.19384404,0.0018652988,0.00024966706,0.000011130912,1.513283e-7,0.000008785542,0.00003299599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963658,0.00023614094,0.0002797693,0.0008325318,0.0012299082,0.0010558632],"domain_scores_gemma":[0.9968246,0.0008236925,0.00005590583,0.0017213374,0.00021764162,0.0003568],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003320112,0.00020323598,0.00017353897,0.00023747275,0.0012253403,0.00073829084,0.0071497736,0.00004197984,0.000071269365],"category_scores_gemma":[0.00018938915,0.00012779263,0.000088831795,0.002241954,0.00619835,0.0013546156,0.0027534512,0.0004764982,0.00040699996],"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.0000043601462,0.000025100844,0.000017900036,0.0000016226544,0.000002170902,0.0000048492534,0.00036726202,0.0005253551,0.0004955854,0.82793665,0.00005927784,0.17055987],"study_design_scores_gemma":[0.00014173245,0.00008829699,0.00030462808,0.000009548163,0.0000014386162,0.000060901315,0.0000064552128,0.47897407,0.004370503,0.5125843,0.0032721793,0.00018593797],"about_ca_topic_score_codex":9.826608e-7,"about_ca_topic_score_gemma":6.7137177e-7,"teacher_disagreement_score":0.79304683,"about_ca_system_score_codex":0.00009216671,"about_ca_system_score_gemma":0.00015335015,"threshold_uncertainty_score":0.998222},"labels":[],"label_agreement":null},{"id":"W2104606980","doi":"10.1016/j.tcs.2011.10.026","title":"The loop formula based semantics of description logic programs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stable model semantics; Answer set programming; Well-founded semantics; Logic programming; Semantics (computer science); Classical logic; Theoretical computer science; Programming language; Computer science; Operational semantics; Mathematics; Set (abstract data type); Algebra over a field; Discrete mathematics; Algorithm; Denotational semantics; Pure mathematics","score_opus":0.0374375417248961,"score_gpt":0.24258265929032496,"score_spread":0.20514511756542886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104606980","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.019301195,0.000035263613,0.9687561,0.0002214059,0.0005588664,0.00021526901,2.0143084e-7,0.00014333116,0.010768404],"genre_scores_gemma":[0.8290786,0.000003647793,0.17070049,0.00015115422,0.0000364414,0.0000067914325,2.4857303e-7,0.000004783436,0.000017805896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979474,0.000117733514,0.00029900565,0.00048112657,0.00057057186,0.00058416644],"domain_scores_gemma":[0.9982895,0.00017869516,0.00012487304,0.0009224074,0.00029819531,0.00018628359],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018935121,0.00016717539,0.00017987736,0.00007730954,0.0004949669,0.00028936012,0.0030565732,0.00005767578,0.000022079788],"category_scores_gemma":[0.000117051415,0.000098035394,0.000095090836,0.0010394616,0.0037500763,0.00046121885,0.000892622,0.00015189263,0.00006005601],"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.000008317303,0.00011227673,0.00043751343,0.000006701463,0.000002391872,0.0000041391204,0.0004924217,0.0000099223835,0.00017171401,0.9433865,0.00002257356,0.05534553],"study_design_scores_gemma":[0.00017492546,0.0004757421,0.002031561,0.000023987031,0.0000062048634,0.000015177927,0.000007592493,0.6040269,0.006518615,0.38645554,0.00010363052,0.0001601288],"about_ca_topic_score_codex":0.0000058049504,"about_ca_topic_score_gemma":0.0000026015891,"teacher_disagreement_score":0.80977744,"about_ca_system_score_codex":0.000036695663,"about_ca_system_score_gemma":0.00012172474,"threshold_uncertainty_score":0.99896115},"labels":[],"label_agreement":null},{"id":"W2105334284","doi":"10.1016/j.tcs.2014.12.007","title":"Searching on a line: A complete characterization of the optimal solution","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Competitive analysis; Parameterized complexity; Mathematics; Position (finance); Upper and lower bounds; Mathematical optimization; Characterization (materials science); Line (geometry); Search problem; Combinatorics","score_opus":0.02262614493001695,"score_gpt":0.2660139534981598,"score_spread":0.24338780856814288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105334284","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.04117672,5.539282e-7,0.95396954,0.0027932853,0.00029671617,0.00017906532,0.0000010515269,0.00007366514,0.0015093877],"genre_scores_gemma":[0.92749757,0.0000011408888,0.07171003,0.0007089375,0.00006279731,0.0000036011593,0.0000012137232,0.000004475701,0.000010222422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979576,0.00028592534,0.00022806972,0.000392072,0.0007825936,0.00035376978],"domain_scores_gemma":[0.9987222,0.00016778731,0.00009064459,0.0006819654,0.00020870935,0.00012871854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017010433,0.00010508167,0.0001286807,0.00013387477,0.00043650647,0.00023852393,0.002023841,0.000029783952,0.0000125183515],"category_scores_gemma":[0.00014103229,0.000069285525,0.00005488655,0.0010330327,0.0014579268,0.0003874384,0.00089990936,0.00018880794,0.000025736335],"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.000005037922,0.000038089238,0.000010734713,0.0000052661144,0.0000011560521,1.5687999e-7,0.00030099505,0.0077484758,0.013829035,0.95685893,0.0000025182521,0.021199603],"study_design_scores_gemma":[0.00018908468,0.00024663657,0.0011854251,0.000039704883,0.0000010575126,0.0000044677017,7.125641e-7,0.9742018,0.0066542076,0.017285436,0.00010595328,0.000085489206],"about_ca_topic_score_codex":0.0000019774257,"about_ca_topic_score_gemma":1.563626e-7,"teacher_disagreement_score":0.9664534,"about_ca_system_score_codex":0.000031083837,"about_ca_system_score_gemma":0.00007694588,"threshold_uncertainty_score":0.5371792},"labels":[],"label_agreement":null},{"id":"W2106875872","doi":"10.1016/j.tcs.2012.10.055","title":"Quotient complexity of ideal languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ideal (ethics); Mathematics; Regular language; Concatenation (mathematics); Quotient; Discrete mathematics; Intersection (aeronautics); Generator (circuit theory); Combinatorics; Computer science; Theoretical computer science; Automaton","score_opus":0.020154317981563488,"score_gpt":0.2752687244087085,"score_spread":0.255114406427145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106875872","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.17338133,0.00010826214,0.8200517,0.00035208656,0.0005355542,0.000083656014,0.0000020961513,0.00016534512,0.0053199627],"genre_scores_gemma":[0.8462151,0.0000016572644,0.15330851,0.00033795479,0.00012612411,0.0000019461588,4.9640147e-7,0.000004553586,0.0000036511144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979595,0.00010867428,0.0002693826,0.0003573462,0.00065437134,0.00065074116],"domain_scores_gemma":[0.99848825,0.00019310837,0.000089087276,0.0008196132,0.00010594253,0.00030397833],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018520412,0.0001452273,0.00021641153,0.00014314048,0.00018943404,0.000110103676,0.0022351593,0.00003585509,0.0000701701],"category_scores_gemma":[0.000059956477,0.00011192818,0.00007127107,0.00079040916,0.004125306,0.0007969238,0.0012721347,0.00012330414,0.00007176956],"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.000002608973,0.00009671571,0.00032793824,0.000007382233,0.0000026313219,0.000001646009,0.0007420077,0.000013985659,0.001302712,0.98034334,0.00004830283,0.01711073],"study_design_scores_gemma":[0.0003918339,0.00030382499,0.03709153,0.00006062439,0.000009358866,0.000106219515,0.000075744945,0.38156492,0.054096926,0.52553254,0.0002441883,0.0005222572],"about_ca_topic_score_codex":0.0000081559965,"about_ca_topic_score_gemma":1.7512123e-7,"teacher_disagreement_score":0.6728338,"about_ca_system_score_codex":0.000034272947,"about_ca_system_score_gemma":0.00005270355,"threshold_uncertainty_score":0.99858487},"labels":[],"label_agreement":null},{"id":"W2107243490","doi":"10.1016/j.tcs.2005.05.007","title":"Games on triangulations","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Artificial Intelligence in Medicine (Canada); University of New Brunswick","funders":"","keywords":"Combinatorial game theory; Computer science; Theoretical computer science; Variation (astronomy); Combinatorics; Position (finance); Time complexity; Mathematics; Game theory; Sequential game; Mathematical economics","score_opus":0.02323360527989452,"score_gpt":0.3010453241538673,"score_spread":0.27781171887397277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107243490","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.021996489,0.000014165059,0.9539289,0.006876128,0.0005421435,0.00013550106,5.908228e-7,0.00033297992,0.01617313],"genre_scores_gemma":[0.79677975,0.0000015892257,0.2013102,0.0015566972,0.00029826423,0.0000056066788,1.6203884e-7,0.000005194487,0.00004254427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976949,0.00007538723,0.0002899749,0.00066763884,0.00073755987,0.000534503],"domain_scores_gemma":[0.9981535,0.00038968836,0.00005538583,0.0009953412,0.00015577687,0.00025032158],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010289645,0.00015818312,0.00015028442,0.0002433235,0.0004308561,0.00049253734,0.002708256,0.000043522155,0.00014112127],"category_scores_gemma":[0.00018559897,0.00012817362,0.00007004821,0.0011595036,0.002169543,0.0008572542,0.00057657977,0.00017889842,0.0012716032],"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.0000026999953,0.00004609634,0.000010976215,4.4289104e-7,0.0000010281373,0.0000021578999,0.00033370242,0.0016673943,0.00016713154,0.751806,0.00013432914,0.24582803],"study_design_scores_gemma":[0.00006170191,0.00015925334,0.00044022803,0.000013364289,0.0000016001478,0.000012645361,0.0000051262646,0.7731347,0.023944333,0.19977278,0.002265532,0.00018874263],"about_ca_topic_score_codex":0.0000015395567,"about_ca_topic_score_gemma":9.706217e-7,"teacher_disagreement_score":0.77478325,"about_ca_system_score_codex":0.000085628664,"about_ca_system_score_gemma":0.000104427985,"threshold_uncertainty_score":0.999506},"labels":[],"label_agreement":null},{"id":"W2107263471","doi":"10.1016/j.tcs.2006.02.024","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-Spine, 1-bend planarity","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planarity testing; Planar graph; Planar; Combinatorics; Mathematics; Geometry; Vertex (graph theory); Hamiltonian path; Algorithm; Graph; Computer science; Computer graphics (images)","score_opus":0.012392663271763091,"score_gpt":0.23701306708695594,"score_spread":0.22462040381519285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107263471","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.5238524,0.00005860486,0.4709004,0.0005550637,0.0008632394,0.0000403396,0.0000070079977,0.00014951217,0.0035734754],"genre_scores_gemma":[0.93255544,0.0000105545605,0.06557793,0.0010834102,0.0006602526,0.000025379573,0.00002903248,0.00002190401,0.00003611501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964649,0.0001067785,0.0004977782,0.0009467111,0.0012427443,0.0007410876],"domain_scores_gemma":[0.99809355,0.00034967804,0.00021433516,0.00089071685,0.00015245819,0.00029925955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014088107,0.00027388666,0.0001812547,0.00019855663,0.0008757547,0.0009315429,0.0017434377,0.00018600257,0.000049643382],"category_scores_gemma":[0.00014398133,0.00030196438,0.00019537852,0.001104003,0.0012912864,0.0009358518,0.0011354482,0.00035161176,0.00052047713],"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.000023766977,0.00011314103,0.000006237266,0.000028206392,0.000013986381,0.00006574229,0.00019667203,0.008962771,0.00066020305,0.9836308,0.0006068693,0.005691599],"study_design_scores_gemma":[0.00029795594,0.0003107208,0.00052407244,0.000053459527,0.00001824147,0.000177957,0.000008148405,0.94059396,0.009278671,0.047420524,0.0010075457,0.00030874053],"about_ca_topic_score_codex":0.00006194823,"about_ca_topic_score_gemma":0.000015846912,"teacher_disagreement_score":0.9362103,"about_ca_system_score_codex":0.00002792787,"about_ca_system_score_gemma":0.00039763603,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W2107552967","doi":"10.1016/j.tcs.2011.12.028","title":"State complexity of union and intersection of star on regular languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"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":"Intersection (aeronautics); Regular language; State (computer science); Star (game theory); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.02220350129067516,"score_gpt":0.24425759313541612,"score_spread":0.22205409184474095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107552967","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.52583677,0.000010589778,0.47277483,0.000047028887,0.000099545745,0.00005107714,0.0000018185957,0.0000415251,0.0011368248],"genre_scores_gemma":[0.9253359,0.0000029028768,0.07457474,0.000068527086,0.000011187392,7.1515956e-7,2.6937528e-7,0.000003296515,0.0000024939031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878514,0.00012891128,0.00021715609,0.00033935427,0.00032356713,0.00020588186],"domain_scores_gemma":[0.9990951,0.00009630438,0.0001033623,0.000512801,0.0001010703,0.00009139671],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012233792,0.00010142826,0.00017526142,0.00016154858,0.00007637047,0.000032951717,0.0008958162,0.00002350872,0.000019383451],"category_scores_gemma":[0.000029452747,0.000078826066,0.00003259275,0.0004299714,0.0037365814,0.000298262,0.0005342745,0.000083018414,0.0000030972246],"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.000016100597,0.00006184958,0.000053607677,0.000013601643,0.0000031832417,0.00000266171,0.001825299,0.0000055437326,0.0034765734,0.96755576,0.0000034695438,0.026982378],"study_design_scores_gemma":[0.00020094575,0.00080720615,0.0134948,0.00008299405,0.0000033425058,0.00001609428,0.00006483164,0.15425365,0.16333136,0.6676072,0.000003953664,0.00013363552],"about_ca_topic_score_codex":0.00002834286,"about_ca_topic_score_gemma":9.991927e-7,"teacher_disagreement_score":0.39949912,"about_ca_system_score_codex":0.000017153909,"about_ca_system_score_gemma":0.000027759335,"threshold_uncertainty_score":0.9989747},"labels":[],"label_agreement":null},{"id":"W2108489993","doi":"10.1016/j.tcs.2007.02.059","title":"Recursively defined metric spaces without contraction","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Metric space; Bounded function; Metric (unit); Fixed point; Contraction (grammar); Probabilistic logic; Banach space; Discrete mathematics; Contraction mapping; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.012316706694448192,"score_gpt":0.2644182511156446,"score_spread":0.2521015444211964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108489993","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.039854694,0.00009506036,0.92158306,0.00050795166,0.0014049339,0.00017152504,3.800727e-7,0.0003232509,0.03605912],"genre_scores_gemma":[0.85288435,0.000006966473,0.14646359,0.00036480342,0.00022248234,0.000002529563,3.5794787e-7,0.000007031323,0.00004785934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970188,0.000094960786,0.00031656216,0.000843772,0.00083101675,0.000894866],"domain_scores_gemma":[0.99768114,0.0006471374,0.00013421684,0.00070663827,0.0003904671,0.00044042716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037233618,0.00022832878,0.00026835644,0.0004725355,0.00054183486,0.0006399469,0.0022656268,0.000088277244,0.00002976741],"category_scores_gemma":[0.00048382604,0.00017550829,0.00008860996,0.002777651,0.0019179463,0.00095630705,0.00064746995,0.00027235385,0.0002360907],"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.000014956728,0.000068712725,0.00045653808,0.0000034003951,0.0000041366156,0.000018129776,0.00036519926,0.000012439129,0.0005460619,0.9444134,0.00006562383,0.054031406],"study_design_scores_gemma":[0.0013864443,0.001195788,0.06434476,0.00007597857,0.000031086725,0.00039952048,0.00005228146,0.39366725,0.024380231,0.50968057,0.0035966672,0.0011894306],"about_ca_topic_score_codex":0.000008948783,"about_ca_topic_score_gemma":0.0000036123904,"teacher_disagreement_score":0.8130297,"about_ca_system_score_codex":0.00012669327,"about_ca_system_score_gemma":0.00016480064,"threshold_uncertainty_score":0.71570206},"labels":[],"label_agreement":null},{"id":"W2109036808","doi":"10.1016/j.tcs.2008.12.054","title":"State complexity of basic operations on suffix-free regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"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":"Catenation; Regular language; Suffix; Deterministic finite automaton; State (computer science); Abstract family of languages; Regular expression; Computer science; Nondeterministic finite automaton; Automaton; Cone (formal languages); Finite-state machine; Combined operations; Deterministic automaton; Pumping lemma for regular languages; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Automata theory; Second-generation programming language; Fifth-generation programming language; Linguistics","score_opus":0.015094532963450848,"score_gpt":0.26196869014037016,"score_spread":0.24687415717691932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109036808","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.21224388,0.000029202385,0.78084654,0.0031267458,0.00018548107,0.00013896334,0.000007851463,0.00021863081,0.0032027215],"genre_scores_gemma":[0.8748524,0.0000030514652,0.12369119,0.0013780418,0.000053645643,0.000001622272,0.0000011767567,0.0000043989626,0.000014431224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977987,0.00013648967,0.0003029054,0.0005939807,0.0007103673,0.00045759496],"domain_scores_gemma":[0.99776995,0.00016549052,0.000056842262,0.0016528036,0.00015882416,0.00019611421],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012540601,0.00017882632,0.00024544107,0.00019091579,0.00030322635,0.00027039973,0.003610773,0.000033914013,0.000039111226],"category_scores_gemma":[0.000120212346,0.00014031833,0.00007313582,0.00094403944,0.0027871525,0.0005152381,0.0006524608,0.0001616464,0.00003857333],"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.0000067561286,0.000120865625,0.0000052124806,0.000003033605,0.0000022256963,0.000010016334,0.00040360805,0.00056814856,0.0031754223,0.965611,0.00009160969,0.030002149],"study_design_scores_gemma":[0.0002494635,0.0005065933,0.003124386,0.000037278718,0.0000024463316,0.00001700142,0.000009239863,0.34577355,0.035135075,0.61494064,0.000022589273,0.00018173546],"about_ca_topic_score_codex":0.0000063524767,"about_ca_topic_score_gemma":9.94709e-7,"teacher_disagreement_score":0.66260856,"about_ca_system_score_codex":0.00003704624,"about_ca_system_score_gemma":0.00009048989,"threshold_uncertainty_score":0.9999267},"labels":[],"label_agreement":null},{"id":"W2111945870","doi":"10.1016/j.tcs.2014.07.011","title":"On the approximability of the exemplar adjacency number problem for genomes with gene repetitions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; National Science Foundation","keywords":"Combinatorics; Parameterized complexity; Adjacency list; Mathematics; Genome; Approximation algorithm; Set (abstract data type); Alphabet; Measure (data warehouse); Discrete mathematics; Gene; Computer science; Biology; Genetics","score_opus":0.006080399229874966,"score_gpt":0.21752872795666095,"score_spread":0.21144832872678598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111945870","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.53973156,0.000012370261,0.45480514,0.0011452792,0.00007567905,0.0006201798,0.00000995397,0.0000088220295,0.0035910183],"genre_scores_gemma":[0.96043843,0.0000025577217,0.03916703,0.00023701243,0.000074017036,0.000044969627,0.00000288355,0.0000075750995,0.000025508216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894357,0.00008830669,0.00013118457,0.0003533964,0.00024954186,0.00023400785],"domain_scores_gemma":[0.99893206,0.00008733643,0.000057598143,0.00071833516,0.00015465867,0.00004998797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095785205,0.000100290286,0.00009233764,0.000012543661,0.00025367516,0.000030230321,0.0006949551,0.000032751093,0.00002554791],"category_scores_gemma":[0.00008467056,0.00004853751,0.00006187077,0.00018861207,0.0021653129,0.000003495983,0.00023707493,0.00006203934,0.000003481398],"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.000038261493,0.00009546541,0.0005063132,0.00001714476,0.000011854372,6.36761e-8,0.00007800728,0.0001806275,0.041507564,0.9551978,0.00007814967,0.002288756],"study_design_scores_gemma":[0.0010777251,0.0020038113,0.005131266,0.0000641013,0.000051142564,0.000028892375,0.000031136668,0.019699208,0.58436817,0.38314724,0.00391967,0.00047761263],"about_ca_topic_score_codex":7.9931567e-7,"about_ca_topic_score_gemma":6.459906e-7,"teacher_disagreement_score":0.5720505,"about_ca_system_score_codex":0.000010476983,"about_ca_system_score_gemma":0.000055462395,"threshold_uncertainty_score":0.79781854},"labels":[],"label_agreement":null},{"id":"W2111953579","doi":"10.1016/j.tcs.2009.09.014","title":"Why greed works for shortest common superstring problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"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; Tsinghua University; National Science Foundation","keywords":"Greedy algorithm; Mathematics; Algorithm; Combinatorics; Superstring theory; Asymptotically optimal algorithm; Approximation algorithm; Sequence (biology); Biology; Supersymmetry; Genetics","score_opus":0.012502913709073315,"score_gpt":0.2567674646483736,"score_spread":0.24426455093930027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111953579","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.0044568586,0.00004992885,0.9898965,0.0033482127,0.0003951812,0.00036587266,0.000002955703,0.0003054345,0.0011790713],"genre_scores_gemma":[0.59285766,0.0000032913752,0.4049694,0.002012145,0.00013987422,0.000007246984,0.0000026946257,0.000004887236,0.0000027965812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734503,0.00005130247,0.00031670358,0.00086737185,0.0006254802,0.0007941258],"domain_scores_gemma":[0.99814624,0.00025656863,0.00006273997,0.0010167244,0.00018003558,0.0003377096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011638033,0.00022346077,0.00025877758,0.00016723099,0.00066691515,0.0010260824,0.0034226119,0.00007101248,0.0000115327875],"category_scores_gemma":[0.000036016394,0.00017667733,0.00008618936,0.0009946314,0.00090083684,0.0015867013,0.0008793991,0.00021844015,0.0000134033635],"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.000008986049,0.00006610977,0.00001914076,0.0000028015484,0.0000014731767,0.0000056050685,0.00013269774,0.00021220649,0.0004578625,0.7650108,0.0005327228,0.23354961],"study_design_scores_gemma":[0.0003016742,0.00044660206,0.0005226458,0.000089079076,0.000003886041,0.000030071777,0.0000038626736,0.78280777,0.0015907581,0.21307349,0.0008669226,0.00026327203],"about_ca_topic_score_codex":0.0000052214286,"about_ca_topic_score_gemma":7.9065575e-7,"teacher_disagreement_score":0.7825955,"about_ca_system_score_codex":0.000055738656,"about_ca_system_score_gemma":0.00007726881,"threshold_uncertainty_score":0.9894536},"labels":[],"label_agreement":null},{"id":"W2112167630","doi":"10.1016/j.tcs.2009.06.003","title":"The complexity of weighted Boolean #CSP with mixed signs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Parameterized complexity; Discrete mathematics; Sign (mathematics); Partition (number theory); Weight function; Combinatorics; Function (biology); Boolean function; Polynomial; Affine transformation; Pure mathematics","score_opus":0.025818018430684833,"score_gpt":0.28477121299437513,"score_spread":0.2589531945636903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112167630","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.026179047,0.00003833257,0.96590805,0.0035874215,0.00015577149,0.0002579794,0.0000014348316,0.00016025636,0.003711712],"genre_scores_gemma":[0.8346222,0.000004576826,0.1650705,0.00024444616,0.00003718129,0.0000032760554,3.2144644e-7,0.000005608037,0.000011896417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646324,0.00027789277,0.00033594138,0.0007069194,0.0013398438,0.0008761726],"domain_scores_gemma":[0.9968957,0.0006130867,0.00011980789,0.0015986614,0.0004495853,0.00032317135],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023431026,0.0002160815,0.00026374147,0.00017964863,0.0009332238,0.00035237393,0.005304048,0.00003887524,0.000012386609],"category_scores_gemma":[0.00008948912,0.00012349455,0.00007367387,0.0023612229,0.017645964,0.00062397594,0.0007893346,0.00032081618,0.000023130331],"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.000050445306,0.00006787699,0.000018470324,0.0000023247571,0.0000043948476,0.000009024992,0.00016858322,0.00005751847,0.0018715314,0.9493023,0.00002241961,0.048425093],"study_design_scores_gemma":[0.0002617815,0.0010704731,0.0016223273,0.000022873974,0.0000025608529,0.000031147963,0.0000101722835,0.1623802,0.020121312,0.8142076,0.00008618397,0.00018337034],"about_ca_topic_score_codex":0.0000015112686,"about_ca_topic_score_gemma":0.0000017168506,"teacher_disagreement_score":0.8084431,"about_ca_system_score_codex":0.00004768133,"about_ca_system_score_gemma":0.0001791481,"threshold_uncertainty_score":0.98563284},"labels":[],"label_agreement":null},{"id":"W2112908352","doi":"10.1016/j.tcs.2014.05.005","title":"New space/time tradeoffs for top- k document retrieval on sequences","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Document retrieval; Computer science; Space (punctuation); Information retrieval; Combinatorics; Mathematics","score_opus":0.008556120600705158,"score_gpt":0.25402016309942393,"score_spread":0.24546404249871878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112908352","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.0033812975,0.000015329751,0.98865783,0.004122102,0.0009333145,0.00027730118,0.0000028455129,0.00021857739,0.0023913884],"genre_scores_gemma":[0.41514713,0.000002628316,0.58324367,0.0009787601,0.00051478454,0.000004164083,0.000002120515,0.000008770226,0.00009800615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969891,0.0001008798,0.00028082271,0.001002861,0.0009420881,0.0006842876],"domain_scores_gemma":[0.99764246,0.00057835854,0.00008755025,0.0010895513,0.00011245862,0.00048965245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001795282,0.00023569091,0.00026073345,0.00015761165,0.00049470074,0.0007778833,0.0031783017,0.00006736085,0.00007109394],"category_scores_gemma":[0.0001500031,0.00017242579,0.000093182025,0.0007321505,0.0008562891,0.0008334652,0.0008296736,0.00017028631,0.00017548563],"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.0000228098,0.000023325832,0.0000023215282,0.0000039288043,0.0000020843981,0.0000017668821,0.000117232106,0.00013770096,0.0008260895,0.90946203,0.0010503287,0.08835041],"study_design_scores_gemma":[0.00037742476,0.00091875164,0.00010285178,0.000049340837,0.000003726549,0.000014149693,0.0000012920278,0.61018986,0.015569494,0.36782256,0.0046934346,0.00025712454],"about_ca_topic_score_codex":0.000005713047,"about_ca_topic_score_gemma":1.207711e-7,"teacher_disagreement_score":0.61005217,"about_ca_system_score_codex":0.00006610249,"about_ca_system_score_gemma":0.00018268128,"threshold_uncertainty_score":0.7501146},"labels":[],"label_agreement":null},{"id":"W2114513404","doi":"10.1016/j.tcs.2013.11.033","title":"Social exchange networks with distant bargaining","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extension (predicate logic); Core (optical fiber); Computer science; Set (abstract data type); Matching (statistics); Time complexity; Bargaining problem; Stability (learning theory); Mathematical economics; Theoretical computer science; Class (philosophy); Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.02023283452738109,"score_gpt":0.21274166859308735,"score_spread":0.19250883406570626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114513404","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.16331542,0.0000704412,0.78495187,0.00044037914,0.0003327597,0.0001974144,0.0000023813059,0.000093919014,0.05059544],"genre_scores_gemma":[0.99565005,0.0000014088193,0.0036362635,0.00029617734,0.0003344592,0.0000150037895,8.877531e-7,0.000012484369,0.00005325165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866897,0.00003228236,0.00029529448,0.0004397996,0.00007537647,0.00048829336],"domain_scores_gemma":[0.9993546,0.00008358844,0.0001232722,0.0002535883,0.00004891892,0.0001360157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015332635,0.00012688893,0.00024894698,0.000094794355,0.00040263095,0.0003048623,0.00053679384,0.000046289617,0.000478536],"category_scores_gemma":[0.000029462928,0.00010546349,0.000040857114,0.00045524805,0.001656649,0.00029156057,0.00017040712,0.00014850168,0.00046807888],"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.0000056177473,0.000017835753,0.0010719363,0.0000049128903,0.0000042011593,0.0000016875043,0.00057672017,0.000109673936,0.000005706684,0.9965149,0.00007122956,0.0016155802],"study_design_scores_gemma":[0.00030785878,0.0002030395,0.0068905875,0.000029016936,0.0000023903817,0.000013815011,0.000041560354,0.38075298,0.000033485172,0.610984,0.0004109686,0.00033027268],"about_ca_topic_score_codex":0.000015645684,"about_ca_topic_score_gemma":4.22025e-7,"teacher_disagreement_score":0.83233464,"about_ca_system_score_codex":0.000042515218,"about_ca_system_score_gemma":0.000011039632,"threshold_uncertainty_score":0.61039925},"labels":[],"label_agreement":null},{"id":"W2114650657","doi":"10.1016/j.tcs.2006.05.011","title":"A PTAS for the minimization of polynomials of fixed degree over the simplex","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Degree (music); Simplex; Combinatorics; Discrete mathematics; Upper and lower bounds; Polynomial; Integer (computer science); Mathematical analysis","score_opus":0.056029897949023626,"score_gpt":0.36187059965159923,"score_spread":0.3058407017025756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114650657","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.009720004,0.000020970027,0.98853695,0.00056231115,0.00007528468,0.00052869896,0.000014599896,0.000017767028,0.0005233869],"genre_scores_gemma":[0.6948952,0.0000025525633,0.3049225,0.00005256787,0.00007393103,0.000014596588,0.0000011430354,0.000008907412,0.00002856926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856645,0.000083513565,0.00035512156,0.00019316304,0.00054750673,0.00025422516],"domain_scores_gemma":[0.9953566,0.0035810252,0.00015824051,0.0004795907,0.00038828372,0.000036218964],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013271444,0.00008869352,0.00016893541,0.00007039626,0.00022375694,0.00004122682,0.0008499746,0.000031224397,0.00009707497],"category_scores_gemma":[0.0008657702,0.00004658186,0.00006630485,0.0006256764,0.0031899593,0.00010196941,0.00024518196,0.000070050744,0.000001203966],"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.000025150326,0.00004934711,0.000014974241,0.00001721657,0.0000047820736,1.1549159e-7,0.00013524888,0.0057815197,0.00033788572,0.9842334,0.00037656867,0.0090238],"study_design_scores_gemma":[0.00026021872,0.00005849629,0.00063974806,0.0000112517055,0.000011193266,0.0000015789059,0.000016846529,0.6617353,0.008867264,0.32824245,0.00010182664,0.000053845928],"about_ca_topic_score_codex":0.0000061294427,"about_ca_topic_score_gemma":0.0000016424641,"teacher_disagreement_score":0.68517524,"about_ca_system_score_codex":0.000023513956,"about_ca_system_score_gemma":0.00008803463,"threshold_uncertainty_score":0.9995228},"labels":[],"label_agreement":null},{"id":"W2114968511","doi":"10.1016/j.tcs.2005.09.030","title":"List matrix partitions of chordal graphs","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Indifference graph; Interval graph; Discrete mathematics; Clique-sum; Pathwidth; Partition (number theory); Cograph; Graph; Line graph; 1-planar graph","score_opus":0.013647279260516391,"score_gpt":0.3137581876164931,"score_spread":0.3001109083559767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114968511","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.05674997,0.000054526852,0.93665606,0.0015887462,0.00020953313,0.00016049016,0.000003695859,0.00017880324,0.004398189],"genre_scores_gemma":[0.7254463,0.000006369729,0.27429697,0.00015453555,0.00006514755,0.000007212111,3.9122062e-7,0.0000057907682,0.000017276994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971622,0.00014132138,0.00035745863,0.0006562141,0.0009702038,0.00071257463],"domain_scores_gemma":[0.9977375,0.00034130987,0.00008064586,0.0011749972,0.00031436712,0.00035113227],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017169063,0.00016640243,0.0002223842,0.00039902402,0.00038538317,0.00020589921,0.0035001673,0.000044145552,0.0001202133],"category_scores_gemma":[0.0001248284,0.00014144441,0.00010922334,0.00251455,0.0056736683,0.0011193919,0.0012271518,0.00024586116,0.0001105445],"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.00000739753,0.00009195396,0.00007409442,0.000005009796,0.0000031021925,0.0000038184426,0.00019854578,0.00044197522,0.002824906,0.97299093,0.00005250191,0.023305753],"study_design_scores_gemma":[0.00021684702,0.00019587952,0.00054398226,0.000019707899,0.0000027352798,0.000033291923,0.000004506053,0.1983499,0.02121983,0.7787565,0.0004610544,0.00019579697],"about_ca_topic_score_codex":0.0000019637084,"about_ca_topic_score_gemma":0.000001267963,"teacher_disagreement_score":0.66869634,"about_ca_system_score_codex":0.000047991834,"about_ca_system_score_gemma":0.0001314683,"threshold_uncertainty_score":0.99703234},"labels":[],"label_agreement":null},{"id":"W2115404543","doi":"10.1016/j.tcs.2004.06.029","title":"Computationally universal P systems without priorities: two catalysts are sufficient","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":122,"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":"Catalysis; Symbol (formal); Reduction (mathematics); P system; Power (physics); Mathematics; Computer science; Membrane computing; Chemistry; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.008116660906839171,"score_gpt":0.2500124413008852,"score_spread":0.24189578039404602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115404543","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.69999576,0.000053278192,0.29855296,0.00011400624,0.00030006494,0.000118927186,0.000004520223,0.000037490554,0.0008230142],"genre_scores_gemma":[0.99157655,0.0000025765764,0.0077599864,0.000290079,0.00033050642,0.0000021287674,0.000014305379,0.0000075657085,0.00001631526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983865,0.00006248296,0.0002064846,0.0005720118,0.0003625768,0.0004099439],"domain_scores_gemma":[0.9991895,0.000031741663,0.000079747064,0.00028864562,0.00022305256,0.00018733059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055165146,0.00016266636,0.00016725049,0.0000592576,0.0003067462,0.0001480238,0.00065377937,0.000063079126,0.0000033166834],"category_scores_gemma":[0.000060397586,0.00012574696,0.00006163567,0.00028587962,0.0018803793,0.000009465584,0.0004936927,0.00010833109,0.00002254696],"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.00006376082,0.0001636107,0.0019242929,0.000020937974,0.000019866247,0.000029703422,0.00020391996,0.049306937,0.04432052,0.9027077,0.000038993767,0.0011997418],"study_design_scores_gemma":[0.013985264,0.009818445,0.063830554,0.0011422897,0.00016154797,0.0015501388,0.001597085,0.59419495,0.21487305,0.08764955,0.005295689,0.0059014577],"about_ca_topic_score_codex":0.000011474176,"about_ca_topic_score_gemma":0.0000016932332,"teacher_disagreement_score":0.8150582,"about_ca_system_score_codex":0.000055589844,"about_ca_system_score_gemma":0.00017690644,"threshold_uncertainty_score":0.69283354},"labels":[],"label_agreement":null},{"id":"W2116273603","doi":"10.1016/j.tcs.2012.01.041","title":"Fighting constrained fires in graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Limiting; Random regular graph; Random graph; Mathematics; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Engineering","score_opus":0.00893920547535462,"score_gpt":0.263824961362226,"score_spread":0.2548857558868714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116273603","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.6027071,0.00001975197,0.37349153,0.00012211729,0.00010128097,0.000091285576,0.0000012908142,0.00007561797,0.023390042],"genre_scores_gemma":[0.97756845,2.1619047e-7,0.022166455,0.00006602001,0.000185328,0.000005292302,0.0000013449574,0.0000041968774,0.0000027097806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988856,0.000051355615,0.00017639335,0.00020807545,0.00020557204,0.00047304717],"domain_scores_gemma":[0.99941707,0.0001473109,0.00003636134,0.00023168165,0.000035104436,0.00013246805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008344602,0.00009738292,0.00014092385,0.00012560874,0.0001349082,0.0000714521,0.00041233547,0.000013365449,0.00048638968],"category_scores_gemma":[0.000008204737,0.00008059,0.00005534148,0.0007351078,0.0013179292,0.00021251339,0.00023537666,0.0001238855,0.00001967685],"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.0000012497038,0.000044828947,0.03323656,7.1949285e-7,0.0000023965745,3.1867864e-7,0.000150149,0.00001744856,0.00016684408,0.9416434,0.000032641816,0.024703411],"study_design_scores_gemma":[0.00020413043,0.000043215598,0.023035664,0.000043981025,0.000010688087,0.0000026071234,0.000036991096,0.17263672,0.0049492763,0.79851407,0.00020888505,0.00031374735],"about_ca_topic_score_codex":0.000015336986,"about_ca_topic_score_gemma":4.3112087e-7,"teacher_disagreement_score":0.37486136,"about_ca_system_score_codex":0.000015590022,"about_ca_system_score_gemma":0.0000226378,"threshold_uncertainty_score":0.53256255},"labels":[],"label_agreement":null},{"id":"W2116298394","doi":"10.1016/s0304-3975(99)00267-4","title":"Query learning of bounded-width OBDDs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Calgary","keywords":"Learnability; Binary decision diagram; Equivalence (formal languages); Bounded function; Mathematics; Discrete mathematics; Combinatorics; Time complexity; Theoretical computer science; Algorithm; Computer science; Artificial intelligence","score_opus":0.0043915468152772134,"score_gpt":0.23586408441484966,"score_spread":0.23147253759957245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116298394","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.094516344,0.000032883116,0.8849212,0.0006133333,0.00029831997,0.0000667124,3.3076915e-7,0.00026981375,0.019281054],"genre_scores_gemma":[0.8233021,0.0000073876104,0.17616142,0.00023571041,0.00011073819,0.0000017454089,3.84712e-7,0.000006545154,0.00017394884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756193,0.00018612479,0.00030545043,0.0006292814,0.00076385617,0.00055333955],"domain_scores_gemma":[0.9986666,0.00022996793,0.00007385257,0.00068032986,0.00011857398,0.00023071597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016060754,0.00017081652,0.000239592,0.0001604612,0.00043142514,0.0003096197,0.0023463035,0.000048030364,0.00036375213],"category_scores_gemma":[0.0000860359,0.00013999855,0.00008442554,0.001233509,0.0021863952,0.00051256886,0.00049641787,0.00038297698,0.00016900674],"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.0000033175322,0.00003375957,0.00016153997,0.000004665553,0.000002098883,0.000006094198,0.00031136785,0.0014382516,0.00011280748,0.67289054,0.000013535794,0.325022],"study_design_scores_gemma":[0.00017761027,0.00030011198,0.0014904594,0.000032545555,0.000002726381,0.000044940745,0.0000029170262,0.9042738,0.001446292,0.09064934,0.0013740185,0.00020523263],"about_ca_topic_score_codex":0.000014624473,"about_ca_topic_score_gemma":1.3925644e-7,"teacher_disagreement_score":0.90283555,"about_ca_system_score_codex":0.000028389079,"about_ca_system_score_gemma":0.00012684826,"threshold_uncertainty_score":0.8055864},"labels":[],"label_agreement":null},{"id":"W2118223706","doi":"10.1016/j.tcs.2005.09.011","title":"The complexity of partition functions","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Constraint satisfaction problem; Adjacency matrix; Homomorphism; Partition (number theory); Counting problem; Discrete mathematics; Time complexity; Equivalence (formal languages); Graph","score_opus":0.040453615366782006,"score_gpt":0.3106491400712147,"score_spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118223706","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.010208137,0.000038563077,0.9798897,0.0050974423,0.00025747038,0.00013439445,0.0000015551519,0.00011221846,0.0042605493],"genre_scores_gemma":[0.89613426,0.0000057521393,0.10359223,0.00014512232,0.00008640872,0.000007773617,2.8845457e-7,0.0000035819621,0.00002459692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978547,0.00016180829,0.00026593806,0.00041340553,0.0007797646,0.00052437134],"domain_scores_gemma":[0.99794185,0.00045968106,0.0000697653,0.001035446,0.00031046657,0.0001828021],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021750596,0.00010583751,0.00012253574,0.00011691979,0.00097416143,0.00021731723,0.0027386528,0.000024448727,0.00003168154],"category_scores_gemma":[0.00013747263,0.000069383634,0.00006509703,0.0014088085,0.015019299,0.0007307766,0.0009703197,0.0001909413,0.00011457975],"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.000007764982,0.0000375174,0.000017528919,0.0000014543201,0.0000020985483,5.062492e-7,0.000096892145,0.0004013423,0.00063148193,0.9236303,0.000053058284,0.07512006],"study_design_scores_gemma":[0.00009608372,0.000105386476,0.0007206265,0.0000061319265,0.0000012158695,0.000011493765,0.0000053784142,0.3416099,0.0069777076,0.649463,0.00092373224,0.00007934462],"about_ca_topic_score_codex":0.0000010978215,"about_ca_topic_score_gemma":0.0000026256316,"teacher_disagreement_score":0.8859261,"about_ca_system_score_codex":0.000049921848,"about_ca_system_score_gemma":0.000097575656,"threshold_uncertainty_score":0.98766124},"labels":[],"label_agreement":null},{"id":"W2119251691","doi":"10.1016/j.tcs.2004.05.019","title":"Competitive online routing in geometric graphs","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Mathematics; Routing (electronic design automation); Shortest path problem; Convex polygon; Regular polygon; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.014311499595550056,"score_gpt":0.2694103437007924,"score_spread":0.25509884410524236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119251691","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.024694527,0.000012554125,0.96811754,0.0018738309,0.00025767795,0.00017564684,0.0000013336187,0.000169112,0.00469776],"genre_scores_gemma":[0.7265413,0.000008162863,0.272785,0.0006307288,0.000023977063,0.0000026729235,0.0000010329493,0.0000042253128,0.0000029097043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975571,0.00008785476,0.0003064604,0.0006554699,0.00072674,0.0006663959],"domain_scores_gemma":[0.99879444,0.00018002558,0.000053231834,0.00050927437,0.0002024863,0.0002605336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001430493,0.0001490097,0.00018666727,0.00083266833,0.0002522944,0.00038345324,0.0021413653,0.000042191536,0.000024185987],"category_scores_gemma":[0.00016796814,0.0001282851,0.00004810982,0.0061792214,0.0015336152,0.0007845749,0.0009841003,0.0002872534,0.00005779909],"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.0000017631435,0.00013425159,0.00014264049,0.0000024046929,0.0000010269862,0.000017828621,0.00038028465,0.0074677,0.000063398285,0.98100233,0.0000015005292,0.0107848635],"study_design_scores_gemma":[0.00080007606,0.00023548388,0.005271269,0.00006688098,0.0000010395902,0.00003071594,0.00002295338,0.6282299,0.0010365372,0.3639921,0.00004008141,0.0002729342],"about_ca_topic_score_codex":0.000014566897,"about_ca_topic_score_gemma":0.000006099002,"teacher_disagreement_score":0.7018468,"about_ca_system_score_codex":0.00013025859,"about_ca_system_score_gemma":0.0002126587,"threshold_uncertainty_score":0.5650669},"labels":[],"label_agreement":null},{"id":"W2120324771","doi":"10.1016/j.tcs.2011.04.019","title":"A linear time and space algorithm for detecting path intersection in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Intersection (aeronautics); Initialization; Algorithm; Path (computing); Dimension (graph theory); Mathematics; Linear space; Data structure; Time complexity; Computer science; Discrete mathematics; Combinatorics","score_opus":0.017869333412496385,"score_gpt":0.24595248615093426,"score_spread":0.22808315273843788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120324771","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.46867552,0.00027813466,0.34918275,0.0005062585,0.0023469152,0.00008925112,0.00009673442,0.0004865062,0.17833793],"genre_scores_gemma":[0.8685398,0.00009062399,0.12904654,0.0007160537,0.00085022184,0.00037298657,0.0000693229,0.00025687425,0.000057586418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99231833,0.0002627807,0.0013267173,0.002093455,0.0018868453,0.0021118573],"domain_scores_gemma":[0.9947294,0.0011605993,0.0010951984,0.0018900323,0.00023998151,0.0008847608],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.0029916258,0.0007006718,0.00031350701,0.00054625754,0.001315036,0.0030858282,0.0032081096,0.0010747053,0.018151386],"category_scores_gemma":[0.0011097132,0.0011562512,0.00071893533,0.0015538353,0.0039583156,0.0031644204,0.004181802,0.00126948,0.00052169047],"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.000698012,0.00026009968,0.000004592538,0.0004713399,0.00019633734,0.0007460234,0.0032559496,0.00027922465,0.0013714484,0.96208274,0.0048042606,0.025829967],"study_design_scores_gemma":[0.0007488928,0.0014652503,0.000023193172,0.0007352664,0.00015913435,0.00113376,0.00020324973,0.5716051,0.42183653,0.0013095042,0.000100905425,0.00067922706],"about_ca_topic_score_codex":0.0005373493,"about_ca_topic_score_gemma":0.00011409494,"teacher_disagreement_score":0.9607732,"about_ca_system_score_codex":0.000024111521,"about_ca_system_score_gemma":0.0011585632,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W2120837895","doi":"10.1016/s0304-3975(03)00139-7","title":"Closure and decidability properties of some language classes with respect to ciliate bio-operations","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"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":"Closure (psychology); Decidability; Mathematics; Ciliate; Computer science; Discrete mathematics; Biology; Ecology; Political science","score_opus":0.011038720805139993,"score_gpt":0.24515593442266154,"score_spread":0.23411721361752155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120837895","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.97683716,0.00012557792,0.022362918,0.00019375773,0.000035019435,0.00013410738,0.0000019210952,0.000010722483,0.00029880012],"genre_scores_gemma":[0.9832713,0.0000037383297,0.016399045,0.00027098606,0.000039965154,0.0000031395336,7.3367346e-7,0.0000031468064,0.000007937521],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911106,0.000088301575,0.00012263452,0.00034809095,0.00013282592,0.00019706195],"domain_scores_gemma":[0.9995302,0.00001935489,0.00001619854,0.00023346454,0.00009899241,0.000101819125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052961777,0.00008918692,0.00010824011,0.000030268588,0.00012953687,0.00004814018,0.0002067376,0.000038236936,0.0000052219234],"category_scores_gemma":[0.0002242146,0.00005167831,0.000020289264,0.00019646955,0.0014327575,0.000006919361,0.00017656191,0.000049969607,0.0000016436288],"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.00006703871,0.00005742081,0.003911086,0.000012065084,0.0000059351714,0.0000016284004,0.00014161888,0.00016097953,0.8271269,0.16657199,0.000005831754,0.0019374678],"study_design_scores_gemma":[0.00020478907,0.0013478138,0.0074675395,0.000030438501,0.0000060642024,0.000018020171,0.000048836184,0.0009450229,0.98753685,0.002089981,0.00012632605,0.00017834055],"about_ca_topic_score_codex":0.0000026046162,"about_ca_topic_score_gemma":0.0000048972793,"teacher_disagreement_score":0.164482,"about_ca_system_score_codex":0.000005820806,"about_ca_system_score_gemma":0.00006329134,"threshold_uncertainty_score":0.52790546},"labels":[],"label_agreement":null},{"id":"W2120954276","doi":"10.1016/j.tcs.2010.03.014","title":"Randomized priority algorithms","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Randomized algorithm; Job shop scheduling; Class (philosophy); Approximation algorithm; Computer science; Scheduling (production processes); Algorithm; Context (archaeology); Deterministic algorithm; Mathematical optimization; Mathematics; Schedule; Artificial intelligence","score_opus":0.010635678378934522,"score_gpt":0.2768811115611415,"score_spread":0.26624543318220695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120954276","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.0050280876,0.0000051908246,0.97936934,0.0025692475,0.0013645734,0.00032940516,4.444442e-7,0.0003329505,0.011000743],"genre_scores_gemma":[0.54095054,0.000003349431,0.45842573,0.0004853396,0.0000985989,0.000008974416,2.910572e-7,0.0000038693634,0.000023271821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974248,0.0001944275,0.00029781205,0.0006582314,0.000851386,0.0005733572],"domain_scores_gemma":[0.99780357,0.00044880252,0.00006079729,0.0009322286,0.00033451113,0.0004201014],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0050887577,0.00015482596,0.00029232347,0.00019016868,0.00045501642,0.0008011068,0.0029953148,0.00006264178,0.00014820308],"category_scores_gemma":[0.00039757555,0.00011354951,0.00009815667,0.0011467709,0.005248009,0.0008621216,0.0011273529,0.00044286557,0.0001691323],"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.00008075407,0.000038712544,0.0000046574155,0.0000018624537,0.000002114128,0.000003827153,0.0002383207,0.00006255174,0.0004837177,0.97268736,0.00002481563,0.026371293],"study_design_scores_gemma":[0.008871719,0.000033274842,0.00003302364,0.0000036072022,0.0000016106156,0.000022113993,7.2641876e-7,0.780111,0.001253579,0.20933512,0.00019358765,0.0001406546],"about_ca_topic_score_codex":0.0000029152145,"about_ca_topic_score_gemma":5.555229e-7,"teacher_disagreement_score":0.78004843,"about_ca_system_score_codex":0.000017553897,"about_ca_system_score_gemma":0.00020689807,"threshold_uncertainty_score":0.9974591},"labels":[],"label_agreement":null},{"id":"W2121102942","doi":"10.1016/j.tcs.2015.03.011","title":"Low space data structures for geometric range mode query","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"Canada Research Chairs","keywords":"Multiset; Range (aeronautics); Data structure; Set (abstract data type); Space (punctuation); Range query (database); Mode (computer interface); Combinatorics; Point (geometry); Mathematics; Word (group theory); Computer science; Sargable; Web search query; Geometry; Information retrieval; Search engine","score_opus":0.04144772785392008,"score_gpt":0.30845009617466385,"score_spread":0.26700236832074375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121102942","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.004109207,0.000111031484,0.99258786,0.00084072095,0.0013467522,0.00028833732,0.00005345677,0.00021258014,0.00045007607],"genre_scores_gemma":[0.49348727,0.000003770395,0.50587094,0.0003240137,0.00027668057,0.0000058369183,0.0000146763505,0.000007942546,0.000008899356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672157,0.000080274964,0.0002683551,0.001208485,0.0010306733,0.0006906668],"domain_scores_gemma":[0.9958361,0.0003703256,0.00008946449,0.0027966318,0.00034354572,0.0005639491],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001981352,0.00022307779,0.0002624399,0.00033472286,0.0003594848,0.0007825394,0.008091088,0.00006851821,0.000009685235],"category_scores_gemma":[0.00042371085,0.00016619236,0.0000467169,0.0017185118,0.0012444356,0.0020998332,0.0055626403,0.00017277486,0.000034741475],"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.000016117472,0.0000507285,0.000024425766,0.000009515894,0.0000032751498,0.0000068034296,0.00014057629,0.0005536597,0.00006553141,0.92588735,0.0037018526,0.06954015],"study_design_scores_gemma":[0.00040819688,0.00015947342,0.00019489214,0.000016139833,0.000004175765,0.000025503365,0.000004684697,0.8058892,0.0012973177,0.1904259,0.0013486539,0.00022589664],"about_ca_topic_score_codex":0.00001812637,"about_ca_topic_score_gemma":9.105839e-7,"teacher_disagreement_score":0.8053355,"about_ca_system_score_codex":0.00006453526,"about_ca_system_score_gemma":0.0003195212,"threshold_uncertainty_score":0.9972756},"labels":[],"label_agreement":null},{"id":"W2121524100","doi":"10.1016/s0304-3975(02)00640-0","title":"Analysis of edge deletion processes on faulty random regular graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random graph; Enhanced Data Rates for GSM Evolution; Degree (music); Expander graph; Random regular graph; Mathematics; Fault tolerance; Constant (computer programming); Computer science; Discrete mathematics; Combinatorics; Chordal graph; Graph; 1-planar graph; Distributed computing; Artificial intelligence","score_opus":0.00983825410962391,"score_gpt":0.24056285942636824,"score_spread":0.23072460531674432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121524100","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.06900575,0.000032769884,0.9250343,0.00011484615,0.00056567544,0.00014147194,0.0000010582846,0.00008230829,0.0050218566],"genre_scores_gemma":[0.9882235,0.0000057531906,0.011475558,0.00023176036,0.000034793036,0.000007819129,8.0595555e-7,0.000004328611,0.000015692744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761283,0.00025889723,0.00039979615,0.00063894613,0.0007122032,0.00037729426],"domain_scores_gemma":[0.99805355,0.00037749333,0.00014016086,0.0007636675,0.00051370077,0.00015145459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022497603,0.0001601098,0.00037251296,0.00059136655,0.00027237713,0.00022304295,0.0012428793,0.00005717772,0.00003881265],"category_scores_gemma":[0.00022392988,0.000119728815,0.00015896732,0.0056114504,0.0010359617,0.0003584603,0.00013569211,0.00012122969,0.0000135379705],"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.000014188068,0.000065922504,0.00016288749,0.000010684841,0.00003980269,0.0000023444666,0.00028150517,0.0052429335,0.00015335431,0.9911182,0.000042115375,0.0028660654],"study_design_scores_gemma":[0.0005107831,0.00036684453,0.0005659977,0.000060467697,0.00006456103,0.000015836285,0.000014232483,0.90913135,0.010830447,0.07779676,0.00038046547,0.00026227286],"about_ca_topic_score_codex":0.0000033484666,"about_ca_topic_score_gemma":0.0000019875322,"teacher_disagreement_score":0.91921777,"about_ca_system_score_codex":0.000036362497,"about_ca_system_score_gemma":0.0001040396,"threshold_uncertainty_score":0.48823994},"labels":[],"label_agreement":null},{"id":"W2121556262","doi":"10.1016/j.tcs.2014.03.034","title":"The cyclical scheduling problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scheduling (production processes); Vertex (graph theory); Combinatorics; Job shop scheduling; Mathematics; Computer science; Matching (statistics); Algorithm; Mathematical optimization; Graph; Schedule","score_opus":0.0113602510684824,"score_gpt":0.2838421154584433,"score_spread":0.2724818643899609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121556262","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.007087385,0.000027568909,0.9784088,0.004150645,0.00036927316,0.00019016079,1.7301556e-7,0.00029080192,0.009475201],"genre_scores_gemma":[0.6818891,0.000004282417,0.31756207,0.00038377108,0.00012520989,0.000012055734,8.875996e-8,0.0000072108733,0.000016165463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962356,0.0003496655,0.00029756592,0.00084402756,0.001187955,0.0010851955],"domain_scores_gemma":[0.996101,0.001587451,0.0000621783,0.001570973,0.00026214996,0.00041620192],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0059583876,0.0001859169,0.00017157038,0.00014160127,0.0017675145,0.0011080473,0.0064709275,0.000047504273,0.000008822162],"category_scores_gemma":[0.0004964668,0.000114371825,0.000078861856,0.001771104,0.006914414,0.00072287035,0.0024464326,0.000431805,0.0002093941],"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.0000055417527,0.000018050756,0.000022242222,0.000002032658,0.0000017455151,0.0000017967027,0.00007886307,0.0003367824,0.0004268417,0.8592654,0.000011619877,0.1398291],"study_design_scores_gemma":[0.00009017174,0.00010050526,0.00012239645,0.000008411817,6.949508e-7,0.000018335848,0.0000019745457,0.45225513,0.0014212576,0.5449644,0.00090777123,0.00010901606],"about_ca_topic_score_codex":7.261277e-7,"about_ca_topic_score_gemma":4.319104e-7,"teacher_disagreement_score":0.67480177,"about_ca_system_score_codex":0.000051781542,"about_ca_system_score_gemma":0.00010825875,"threshold_uncertainty_score":0.9999289},"labels":[],"label_agreement":null},{"id":"W2121693375","doi":"10.1016/j.tcs.2006.08.022","title":"Codes defined by multiple sets of trajectories","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"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":"Mathematics; Computer science; Algorithm; Combinatorics; Discrete mathematics","score_opus":0.006236922189298416,"score_gpt":0.22849628015321546,"score_spread":0.22225935796391705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121693375","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.8837205,0.000087609216,0.11466353,0.000059451453,0.000105105224,0.00005405643,0.000010506182,0.00001748704,0.0012817199],"genre_scores_gemma":[0.9853033,0.0000025529937,0.014461378,0.00009735873,0.000099172365,0.0000013427897,0.000020221141,0.000003991147,0.000010692014],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990274,0.000044656714,0.0001726458,0.0003231402,0.00016854897,0.0002636283],"domain_scores_gemma":[0.99954015,0.000067051296,0.000045131248,0.00019916202,0.00008886082,0.000059621576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035488346,0.00010159899,0.00012503062,0.000021550813,0.00011391477,0.000030114701,0.0004009385,0.000059977272,0.000009783951],"category_scores_gemma":[0.000093817136,0.00007297055,0.00004928726,0.00017992001,0.0019236881,0.000003620333,0.00024244109,0.00004898479,0.000002864768],"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.000031117743,0.00010377249,0.005253911,0.0000059943545,0.0000034947936,8.9078867e-7,0.000009816465,0.00007530124,0.8807104,0.10946617,0.0003897229,0.003949387],"study_design_scores_gemma":[0.00031950945,0.00062383816,0.0090190545,0.000010730275,0.000005116733,0.0000093747,0.0000052798678,0.010707385,0.9637199,0.014549301,0.00081296684,0.00021756723],"about_ca_topic_score_codex":0.000011135019,"about_ca_topic_score_gemma":0.0000017845185,"teacher_disagreement_score":0.10158276,"about_ca_system_score_codex":0.0000052927103,"about_ca_system_score_gemma":0.000027041318,"threshold_uncertainty_score":0.7087909},"labels":[],"label_agreement":null},{"id":"W2122177483","doi":"10.1016/j.tcs.2003.06.002","title":"The generalized Weil pairing and the discrete logarithm problem on elliptic curves","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Mathematics; Elliptic curve; Pairing; Logarithm; TRACE (psycholinguistics); Reduction (mathematics); Generalization; Modulo; Pure mathematics; Edwards curve; Simple (philosophy); Discrete mathematics; Finite field; Schoof's algorithm; Mathematical analysis; Public-key cryptography; Computer science; Geometry; Quarter period; Physics","score_opus":0.0056954008353222035,"score_gpt":0.22177431581755602,"score_spread":0.2160789149822338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122177483","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.015028136,0.0011573127,0.947245,0.033742867,0.0004245602,0.00046942264,6.3859017e-7,0.00016744931,0.0017646423],"genre_scores_gemma":[0.93503916,0.00046337539,0.062097006,0.002265303,0.000092618226,0.000024361221,1.90231e-7,0.0000075029643,0.000010507152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974767,0.0002428229,0.00027614058,0.0006339016,0.00075257866,0.00061787275],"domain_scores_gemma":[0.99789125,0.0008089339,0.00007447018,0.0009415981,0.000094215444,0.00018951796],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0028727008,0.0002083664,0.00020524948,0.00009002465,0.0017312735,0.00091495266,0.0025746294,0.000036603036,0.000002814344],"category_scores_gemma":[0.00008773518,0.0000943956,0.00010569605,0.0010378483,0.009404722,0.00031848325,0.0010421376,0.00030804134,0.000019465037],"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.000018115012,0.0000217472,0.000010538485,0.000010207262,0.0000073495785,0.0000065776844,0.00036982182,0.00046195075,0.000028187567,0.98458445,0.000021361318,0.014459709],"study_design_scores_gemma":[0.0012218392,0.00021083638,0.0007616301,0.00018387173,0.000012263818,0.00007723292,0.000009438137,0.1348934,0.0009081415,0.86121696,0.0002745217,0.00022983823],"about_ca_topic_score_codex":0.000012876565,"about_ca_topic_score_gemma":0.00000282085,"teacher_disagreement_score":0.920011,"about_ca_system_score_codex":0.000028126473,"about_ca_system_score_gemma":0.00009268187,"threshold_uncertainty_score":0.99956834},"labels":[],"label_agreement":null},{"id":"W2122181022","doi":"10.1016/s0304-3975(02)00038-5","title":"Order-incompleteness and finite lambda reduction models","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Finitary; Mathematics; Lambda calculus; Term (time); Mathematical proof; Calculus (dental); Simply typed lambda calculus; Lambda; Reduction (mathematics); Typed lambda calculus; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.03184987190362172,"score_gpt":0.236760036849676,"score_spread":0.2049101649460543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122181022","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.004330997,0.00011778948,0.98588455,0.0007542717,0.00082406466,0.00016938754,2.7855867e-7,0.00026934495,0.0076493085],"genre_scores_gemma":[0.9366226,0.000016417034,0.0629412,0.00018544971,0.0001676061,0.000008466223,3.1781096e-7,0.000006850114,0.000051099225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977785,0.00010630439,0.00025218067,0.0007701149,0.0005530437,0.0005398578],"domain_scores_gemma":[0.9986516,0.000121974816,0.00006955047,0.00069064024,0.00021173341,0.000254482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009296634,0.00018182774,0.00020847833,0.00015602044,0.00050113664,0.0006857539,0.0013946018,0.000059447495,0.000028305714],"category_scores_gemma":[0.00004358995,0.0001428298,0.00003888962,0.001130642,0.0018429022,0.0010288461,0.0007739337,0.00015497716,0.000086278626],"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.0000014196401,0.00003498946,0.000015118819,0.000007867699,0.0000023473326,0.0000071702198,0.0006343343,0.0004112455,0.0000748422,0.929381,0.000034028562,0.06939561],"study_design_scores_gemma":[0.00011833573,0.000110046174,0.000035485034,0.0000037339917,0.0000020227712,0.00010886619,0.0000053891968,0.6389058,0.00018428937,0.36010298,0.00027803,0.000145029],"about_ca_topic_score_codex":0.000011491787,"about_ca_topic_score_gemma":5.467294e-7,"teacher_disagreement_score":0.9322916,"about_ca_system_score_codex":0.000034021134,"about_ca_system_score_gemma":0.000030899853,"threshold_uncertainty_score":0.679025},"labels":[],"label_agreement":null},{"id":"W2122388370","doi":"10.1016/j.tcs.2007.03.003","title":"Bounds on the bisection width for random d -regular graphs","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Generalitat de Catalunya","keywords":"Bisection; Mathematics; Upper and lower bounds; Asymptotically optimal algorithm; Combinatorics; Bisection method; Random graph; Discrete mathematics; Value (mathematics); Graph; Algorithm; Statistics; Geometry; Mathematical analysis","score_opus":0.022499315483579776,"score_gpt":0.2983433027230205,"score_spread":0.27584398723944076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122388370","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.32676908,0.0000084203875,0.6670584,0.00040348695,0.00084994955,0.00035988036,0.000001590401,0.00007554454,0.004473636],"genre_scores_gemma":[0.97354037,0.0000012809477,0.025444074,0.0007496388,0.0002221246,0.0000097615775,3.5894394e-7,0.00001261357,0.000019765428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998372,0.00007972091,0.00024325858,0.0003453978,0.00049567776,0.0004639399],"domain_scores_gemma":[0.9964117,0.002749469,0.00006719267,0.0005560385,0.00009836094,0.0001172791],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0052915914,0.00015336329,0.00017091559,0.0001439605,0.0012186251,0.0001309035,0.0007750884,0.000059320148,0.000035566034],"category_scores_gemma":[0.0004862887,0.00008243805,0.00013860689,0.00052269374,0.0035741848,0.00008610866,0.00016297936,0.0001675177,0.0000038576304],"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.0001725548,0.00003143715,0.000011378028,0.000006978835,0.0000079356705,0.000001163152,0.0003934057,0.000004175745,0.00029405576,0.99179,0.00020363815,0.007083295],"study_design_scores_gemma":[0.00048410002,0.00023042607,0.0002566615,0.000019773484,0.000014274053,0.0000116008805,0.00001782191,0.006552978,0.0075314436,0.98445344,0.00029906543,0.00012843088],"about_ca_topic_score_codex":4.830711e-7,"about_ca_topic_score_gemma":5.766488e-7,"teacher_disagreement_score":0.6467713,"about_ca_system_score_codex":0.000030120944,"about_ca_system_score_gemma":0.000023132367,"threshold_uncertainty_score":0.9991375},"labels":[],"label_agreement":null},{"id":"W2122483877","doi":"10.1016/s0304-3975(02)00643-6","title":"Almost k-wise independence and hard Boolean functions","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Discrete mathematics; Linear subspace; Upper and lower bounds; Function (biology); Polynomial; Computable function; Independence (probability theory); Circuit complexity; Affine transformation; Electronic circuit; Pure mathematics","score_opus":0.015241762987331061,"score_gpt":0.23840912940705755,"score_spread":0.22316736641972648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122483877","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.029276093,0.00007157617,0.9615514,0.00064856827,0.0008638747,0.0001302678,0.0000023481036,0.00018854035,0.00726731],"genre_scores_gemma":[0.78001547,0.000007776627,0.21930993,0.000567137,0.000051618175,0.000005289663,3.1909514e-7,0.000005482298,0.000037003625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733335,0.00012705776,0.00024256863,0.0009102355,0.0007659711,0.0006208284],"domain_scores_gemma":[0.9982279,0.00021325122,0.000052223597,0.00091813353,0.00017718079,0.0004113302],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015949397,0.00020547146,0.00019289687,0.00021927024,0.00089547265,0.0006990767,0.0017032246,0.00006146598,0.000078327765],"category_scores_gemma":[0.00015203892,0.0001798185,0.000058993854,0.0014056845,0.0035783749,0.00093662174,0.00088443595,0.00033106405,0.00009490754],"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.000001779139,0.000044502533,0.00020082401,0.0000035004223,0.0000028644909,0.00001202896,0.00020932409,0.000025609335,0.000151261,0.96650994,0.00006236525,0.032776024],"study_design_scores_gemma":[0.0003674182,0.00028731476,0.00539632,0.00003496048,0.0000075856315,0.00038146175,0.000022832852,0.28617272,0.0022722178,0.7017438,0.0028159155,0.00049749285],"about_ca_topic_score_codex":0.0000048848747,"about_ca_topic_score_gemma":0.000001237546,"teacher_disagreement_score":0.75073934,"about_ca_system_score_codex":0.00003483091,"about_ca_system_score_gemma":0.00015073681,"threshold_uncertainty_score":0.9991333},"labels":[],"label_agreement":null},{"id":"W2122658384","doi":"10.1016/j.tcs.2008.09.042","title":"Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nucleic acid; RNA; Nucleic acid structure; Computational biology; Nucleic acid secondary structure; DNA; Function (biology); Molecule; Translation (biology); Protein secondary structure; Small molecule; Gene; Biology; Chemistry; Nanotechnology; Computer science; Cell biology; Biochemistry; Messenger RNA; Materials science","score_opus":0.015871321677934976,"score_gpt":0.25836071146186823,"score_spread":0.24248938978393325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122658384","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.11586511,0.0015400711,0.8815026,0.00013027042,0.00009584681,0.00017042772,0.000020023188,0.00001421035,0.00066142983],"genre_scores_gemma":[0.74352473,0.00025300327,0.25605768,0.000060243023,0.00008604552,0.000005914181,0.0000060941634,0.0000042042943,0.0000021155038],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992066,0.00008419757,0.00013364856,0.000298592,0.00015589081,0.0001210733],"domain_scores_gemma":[0.99953216,0.00003314422,0.00004492084,0.00020203,0.0001152215,0.00007252819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039341176,0.00007732773,0.000095170115,0.000037489015,0.0001540016,0.000010547732,0.00022127906,0.00005561041,0.000029770363],"category_scores_gemma":[0.000031369476,0.00006648307,0.000022700777,0.000079508005,0.0013677379,0.000007659932,0.000152893,0.000046811045,0.0000024102462],"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.000020533867,0.000022534412,0.00002818215,0.00002534884,0.000008512683,3.9284365e-7,0.000071036746,0.00003696351,0.6266996,0.25323746,0.000015011304,0.11983439],"study_design_scores_gemma":[0.00026825452,0.00046030933,0.0036994414,0.0000124616745,0.000008199454,0.00013875186,0.000010608453,0.010378511,0.87009245,0.112489045,0.0022840642,0.00015793018],"about_ca_topic_score_codex":2.5212634e-7,"about_ca_topic_score_gemma":4.1976044e-8,"teacher_disagreement_score":0.6276596,"about_ca_system_score_codex":0.000003831595,"about_ca_system_score_gemma":0.000057109617,"threshold_uncertainty_score":0.5039487},"labels":[],"label_agreement":null},{"id":"W2123868336","doi":"10.1016/j.tcs.2007.02.033","title":"Efficient algorithms for center problems in cactus networks","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cactus; Center (category theory); Algorithm; Computer science; Mathematics","score_opus":0.018651931694772642,"score_gpt":0.30651717067432355,"score_spread":0.2878652389795509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123868336","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.013769511,0.00004277767,0.9832495,0.0003490745,0.00079816673,0.0006953899,0.0000015930988,0.00015445947,0.0009395286],"genre_scores_gemma":[0.7748813,0.0000020803757,0.22468792,0.00027488463,0.0001122183,0.000021764834,7.2800606e-7,0.000011390154,0.000007722536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595124,0.00009271742,0.0004408485,0.0010430469,0.0008340002,0.0016381632],"domain_scores_gemma":[0.9974876,0.0008399796,0.00007051255,0.00091151835,0.00026746237,0.00042293503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006703305,0.0002290737,0.00025177107,0.00052060647,0.00034706105,0.00028635416,0.0031208007,0.0000794946,0.0000103815555],"category_scores_gemma":[0.0001311927,0.00019022575,0.000090815694,0.0024573712,0.002508108,0.00029671058,0.0011781303,0.00035687888,0.00002099082],"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.000020407277,0.00014400925,0.00016641972,0.00000772568,0.0000019712954,0.000014759986,0.00030272943,0.04208084,0.00013250817,0.8899897,0.000008771275,0.0671302],"study_design_scores_gemma":[0.00056103716,0.00021579103,0.001012444,0.000033628257,8.315163e-7,0.000026994358,0.0000053841727,0.86156654,0.00073526066,0.1355,0.00011869538,0.00022341551],"about_ca_topic_score_codex":0.0000025154677,"about_ca_topic_score_gemma":0.0000033479776,"teacher_disagreement_score":0.81948566,"about_ca_system_score_codex":0.00016688819,"about_ca_system_score_gemma":0.00009167743,"threshold_uncertainty_score":0.92412287},"labels":[],"label_agreement":null},{"id":"W2123984395","doi":"10.1016/j.tcs.2004.06.013","title":"Characterization of networks supporting multi-dimensional linear interval routing schemes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Node (physics); Interval (graph theory); Routing (electronic design automation); Class (philosophy); Generalization; Integer (computer science); Discrete mathematics; Computer science; Mathematics; Combinatorics; Scheme (mathematics); Set (abstract data type); Topology (electrical circuits); Computer network; Artificial intelligence","score_opus":0.01905426557928505,"score_gpt":0.30749170544809024,"score_spread":0.2884374398688052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123984395","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.31738043,0.000005037633,0.6818846,0.00021335886,0.000242181,0.00012608977,9.597796e-7,0.000106704116,0.000040622745],"genre_scores_gemma":[0.69519573,0.0000010284767,0.304571,0.00014673066,0.00006942947,0.0000030362146,0.0000021097803,0.000008081921,0.0000028332176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712485,0.00011237769,0.000508045,0.0007099822,0.000797863,0.0007468611],"domain_scores_gemma":[0.9982772,0.00017922232,0.00020173698,0.0006807817,0.00041039923,0.00025065083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023366946,0.00018912874,0.00026098703,0.00024480192,0.00035829935,0.00014670403,0.0021749374,0.00006174339,0.00001724617],"category_scores_gemma":[0.00023870956,0.00016320767,0.000090772264,0.0015424361,0.0025459446,0.0010476593,0.0017910483,0.00032026516,0.000018055334],"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.000012612845,0.00008821694,0.00014144706,0.0000066386738,0.0000043350287,0.000010659746,0.00028018377,0.0073839845,0.04666786,0.9329138,1.4572001e-7,0.012490133],"study_design_scores_gemma":[0.0003775871,0.00015775593,0.0009810159,0.000079757025,0.000002056485,0.000029339071,0.000004210355,0.87600833,0.08278373,0.039394084,0.000003723376,0.00017839315],"about_ca_topic_score_codex":0.0000018221275,"about_ca_topic_score_gemma":2.5317325e-7,"teacher_disagreement_score":0.8935197,"about_ca_system_score_codex":0.00007058266,"about_ca_system_score_gemma":0.00018339686,"threshold_uncertainty_score":0.93806386},"labels":[],"label_agreement":null},{"id":"W2124356944","doi":"10.1016/j.tcs.2005.08.019","title":"The discrete Green Theorem and some applications in discrete geometry","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":26,"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":"Direction Générale de la Compétitivité, de l’Industrie et des Services","keywords":"Mathematics; Intersection (aeronautics); Polyomino; Boundary (topology); Discrete geometry; Moment (physics); Geometry; Generating function; Green's theorem; Center (category theory); Function (biology); Bounded function; Discrete mathematics; Combinatorics; Fundamental theorem; Mathematical analysis","score_opus":0.007065804377029443,"score_gpt":0.2646758480864806,"score_spread":0.2576100437094512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124356944","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.0087128,0.00026176634,0.98077023,0.006490401,0.000056450965,0.00026372584,0.0000015888731,0.00032347493,0.0031195513],"genre_scores_gemma":[0.8412785,0.000020607831,0.15803728,0.000493356,0.00008665567,0.000034479646,4.188701e-7,0.000008247856,0.000040441533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977995,0.00006703306,0.00029608546,0.0007026036,0.0005339862,0.00060077896],"domain_scores_gemma":[0.9982366,0.00044103668,0.0000711511,0.00095507124,0.00008990399,0.00020626116],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016205246,0.00019152884,0.00016447956,0.00020302615,0.00066848606,0.0015971635,0.0033978445,0.000041986354,0.000001930641],"category_scores_gemma":[0.000078614576,0.00012021854,0.00003879813,0.0013507286,0.0050985925,0.0024116419,0.002195514,0.00023487075,0.000019586667],"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.000001780047,0.000015650516,0.00008175388,0.0000028086433,9.88981e-7,0.0000012106187,0.00013102319,0.000006384033,0.000077844685,0.81248707,0.000009617469,0.18718386],"study_design_scores_gemma":[0.000085588945,0.000052719777,0.0011502632,0.00002193195,0.0000017093224,0.00001794265,0.0000059248955,0.21657395,0.0024495902,0.77855396,0.0008951566,0.00019123948],"about_ca_topic_score_codex":0.0000048939964,"about_ca_topic_score_gemma":0.0000024217297,"teacher_disagreement_score":0.8325657,"about_ca_system_score_codex":0.00006017593,"about_ca_system_score_gemma":0.00007440228,"threshold_uncertainty_score":0.9994393},"labels":[],"label_agreement":null},{"id":"W2124849294","doi":"10.1016/j.tcs.2010.05.027","title":"Analysis of a cellular automaton model for car traffic with a slow-to-stop rule","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Traffic control and management","field":"Engineering","cited_by":26,"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; McMaster University","funders":"","keywords":"Cellular automaton; Automaton; Computer science; Traffic model; Block cellular automaton; Stochastic cellular automaton; Theoretical computer science; Algorithm; Automata theory; Mobile automaton","score_opus":0.004090382981792452,"score_gpt":0.19381443217619634,"score_spread":0.1897240491944039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124849294","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.46154705,0.0000026050755,0.5379328,0.000044030494,0.0000659692,0.00012232714,0.0000037683828,0.00011255172,0.00016889586],"genre_scores_gemma":[0.93100595,2.516016e-7,0.06889686,0.000041163225,0.000020650481,0.000018935994,0.0000011692805,0.00000864313,0.000006387033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990677,0.000005214308,0.00014695428,0.00024903633,0.0002447259,0.00028636292],"domain_scores_gemma":[0.99939275,0.00004944378,0.000015008758,0.00033358013,0.000065018685,0.00014418877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035670333,0.000107932836,0.00022062875,0.0002641123,0.000059843464,0.000042997846,0.00043224517,0.00002622886,0.000010957219],"category_scores_gemma":[0.000008329509,0.00008260529,0.00007588633,0.00084668637,0.000406317,0.00006211057,0.00006467973,0.000076372926,0.00000318146],"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.000009427519,0.000019466564,0.0000024948292,0.000013093624,0.000045233945,8.397306e-7,0.00039057215,0.75304675,0.006882448,0.22883762,0.000010108162,0.010741941],"study_design_scores_gemma":[0.0002013923,0.000064206746,0.00027854458,0.00000564482,0.00015088417,4.9938416e-7,0.0000047269555,0.9974682,0.0010312571,0.0006410393,0.000035420337,0.00011818231],"about_ca_topic_score_codex":7.6674553e-7,"about_ca_topic_score_gemma":0.000006767366,"teacher_disagreement_score":0.4694589,"about_ca_system_score_codex":0.000014223704,"about_ca_system_score_gemma":0.000022548167,"threshold_uncertainty_score":0.3368546},"labels":[],"label_agreement":null},{"id":"W2124856856","doi":"10.1016/j.tcs.2005.10.014","title":"Maximizing agreements and coagnostic learning","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Mathematical economics; Mathematics","score_opus":0.005471975983276587,"score_gpt":0.2387742020984049,"score_spread":0.2333022261151283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124856856","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.057623293,0.00005786622,0.93606716,0.002110913,0.00024148314,0.000070044734,1.405659e-7,0.00025631255,0.0035727909],"genre_scores_gemma":[0.73847735,0.0000066944035,0.26085255,0.00047181873,0.00014873593,0.0000017996463,2.1211899e-7,0.000004626346,0.000036201418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804085,0.00010640203,0.00018953362,0.0006189236,0.00053057156,0.00051373005],"domain_scores_gemma":[0.9989734,0.00025428127,0.000053788746,0.00037683072,0.00007636763,0.000265318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156789,0.00015212856,0.00015020404,0.0001502733,0.0006264778,0.0005710746,0.0012456408,0.00003097153,0.00003443355],"category_scores_gemma":[0.0001711366,0.0001268572,0.000029555096,0.00057689653,0.0011220216,0.00061652693,0.0011833628,0.00032514156,0.00011417794],"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.0000011959461,0.000019634179,0.00040565635,0.0000031288805,0.0000017871818,0.0000065029726,0.00041850784,0.0012454669,0.00012993197,0.6371887,0.000013237771,0.3605663],"study_design_scores_gemma":[0.0002089848,0.0001493639,0.0022887436,0.000025465919,0.0000026825903,0.00006444911,0.000005458472,0.98130256,0.00048956944,0.014213461,0.0010607592,0.0001885275],"about_ca_topic_score_codex":0.0000036139916,"about_ca_topic_score_gemma":2.5872907e-7,"teacher_disagreement_score":0.98005706,"about_ca_system_score_codex":0.0000314763,"about_ca_system_score_gemma":0.000042342555,"threshold_uncertainty_score":0.55068856},"labels":[],"label_agreement":null},{"id":"W2125204297","doi":"10.1016/j.tcs.2010.12.034","title":"Two infinite families of polyominoes that tile the plane by translation in two distinct ways","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"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":"Polyomino; Tile; Plane (geometry); Focus (optics); Mathematics; Translation (biology); Fibonacci number; Combinatorics; Fractal; Geometry; Mathematical analysis; Physics; Optics","score_opus":0.012861044561188799,"score_gpt":0.2507726794940887,"score_spread":0.2379116349328999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125204297","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.5131374,0.000036986756,0.48303866,0.00051903113,0.000434598,0.00013200207,0.000008289898,0.00008137882,0.0026116697],"genre_scores_gemma":[0.97142994,0.0000040083114,0.028228527,0.000257074,0.00006286063,0.0000060118323,0.0000025007844,0.000006417252,0.0000026525372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980521,0.00010233373,0.000309518,0.0004925856,0.00059115916,0.00045231252],"domain_scores_gemma":[0.997856,0.0010517791,0.00009669365,0.00082825957,0.000052499345,0.000114772],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018367748,0.00018014152,0.00021806374,0.00015877896,0.00022188165,0.00024106793,0.0026496474,0.00003580355,0.00003882198],"category_scores_gemma":[0.000059283266,0.00011503184,0.000056613095,0.0008510781,0.0031560773,0.00057452463,0.00046969054,0.00032723998,0.000017473943],"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.000008476261,0.000049954073,0.0008246307,0.0000044889216,0.000001728252,0.0000027790777,0.0012573916,0.000034040106,0.013986133,0.9160037,0.00002107701,0.06780559],"study_design_scores_gemma":[0.0007295259,0.00012026039,0.008485807,0.000041296254,0.0000057005,0.00003831585,0.000053900032,0.6675478,0.054421358,0.26800773,0.00022746073,0.0003208294],"about_ca_topic_score_codex":0.000067475834,"about_ca_topic_score_gemma":0.000038278213,"teacher_disagreement_score":0.6675138,"about_ca_system_score_codex":0.0000130023745,"about_ca_system_score_gemma":0.000066538254,"threshold_uncertainty_score":0.9995568},"labels":[],"label_agreement":null},{"id":"W2125583143","doi":"10.1016/j.tcs.2013.06.009","title":"On minimum cost edge searching","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Best-first search; Mathematical optimization; Beam search; Search algorithm; Computer science; Combinatorics; Artificial intelligence","score_opus":0.018929723704174912,"score_gpt":0.30389556963707576,"score_spread":0.28496584593290086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125583143","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.058128368,0.000009726707,0.92493325,0.0018935006,0.0004490537,0.0005121534,8.402552e-7,0.00028620905,0.013786869],"genre_scores_gemma":[0.8930429,0.0000019424128,0.10556876,0.0011861945,0.000093700866,0.000042049876,3.6796274e-7,0.000012514201,0.000051535535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957983,0.00026234103,0.00026793705,0.0010552384,0.0013789512,0.0012372674],"domain_scores_gemma":[0.99625415,0.0011750223,0.000050512135,0.0015318968,0.0003189219,0.00066950225],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020376872,0.00023645474,0.00021899608,0.00044210674,0.000717843,0.0010401534,0.0052068075,0.000051978674,0.00022059983],"category_scores_gemma":[0.00032896217,0.00018490206,0.00008074145,0.0019432809,0.004350697,0.0014793782,0.002176108,0.00051117985,0.0021235663],"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.0000058398437,0.00005847162,0.000015558797,0.000003505688,0.0000021380824,0.00001077129,0.0001994158,0.0001759541,0.0013794582,0.89835894,0.00019207888,0.09959785],"study_design_scores_gemma":[0.00016288518,0.00023381658,0.00043642355,0.000020763015,5.6068507e-7,0.000018430414,0.000004347595,0.38158745,0.0037516518,0.6135195,0.00007837802,0.0001858332],"about_ca_topic_score_codex":0.000003480337,"about_ca_topic_score_gemma":1.6722554e-7,"teacher_disagreement_score":0.83491457,"about_ca_system_score_codex":0.00010039095,"about_ca_system_score_gemma":0.00014555859,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W2126750116","doi":"10.1016/j.tcs.2006.06.008","title":"A construction method for optimally universal hash families and its consequences for the existence of RBIBDs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hash function; Prime (order theory); Corollary; Discrete mathematics; Combinatorics; Time complexity; Computer science","score_opus":0.00984109463461909,"score_gpt":0.2334235269196561,"score_spread":0.223582432285037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126750116","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.09728029,0.0001529526,0.9011051,0.00008120896,0.00029504593,0.00030004908,0.000014643886,0.000052586252,0.00071810174],"genre_scores_gemma":[0.8344973,0.000006506205,0.16542003,0.000011888473,0.000041734842,0.000014321978,4.0950658e-7,0.0000042983193,0.0000035336072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993151,0.00003376726,0.00015871073,0.00017440924,0.00012365058,0.00019439265],"domain_scores_gemma":[0.998918,0.0007776411,0.000031145326,0.000121853416,0.00011457212,0.00003679256],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00089180877,0.000088743385,0.00013640789,0.00006420551,0.00020019997,0.000054015214,0.0003012882,0.000031285563,0.0000028165725],"category_scores_gemma":[0.000032204505,0.00006175054,0.000042037853,0.00022975953,0.0028144745,0.0001264879,0.000039372702,0.00004338557,3.5780326e-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.00001817605,0.000003612989,0.000009923441,0.000047474456,0.000005742975,2.423687e-7,0.00011996409,0.003848575,0.01029921,0.98243916,0.000006378198,0.003201559],"study_design_scores_gemma":[0.00020863363,0.00011582748,0.000086712374,0.000030854204,0.000017050002,0.0000325671,0.00016087954,0.7439796,0.034431178,0.2207528,0.000088899964,0.000095037285],"about_ca_topic_score_codex":0.0000040886325,"about_ca_topic_score_gemma":0.0000011718919,"teacher_disagreement_score":0.7616863,"about_ca_system_score_codex":0.000010720548,"about_ca_system_score_gemma":0.000026470563,"threshold_uncertainty_score":0.99989927},"labels":[],"label_agreement":null},{"id":"W2129749965","doi":"10.1016/j.tcs.2010.09.006","title":"On the complexity of deciding avoidability of sets of partial words","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Set (abstract data type); Word (group theory); Alphabet; Space (punctuation); Discrete mathematics; Decidability; Finite set; Polynomial; De Bruijn sequence; Time complexity; Upper and lower bounds; Existential quantification; Computer science","score_opus":0.025403499655608456,"score_gpt":0.2698010805531539,"score_spread":0.24439758089754543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129749965","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.60157746,0.0000024386238,0.39678228,0.00045877445,0.00032549136,0.0001017601,0.000003375635,0.000027414195,0.0007210332],"genre_scores_gemma":[0.9491765,4.0100107e-7,0.0506619,0.00012609843,0.00002830786,0.0000024125816,1.7402093e-7,0.0000036865747,5.15443e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780273,0.00020247824,0.00046025086,0.00042822192,0.00077597797,0.00033034032],"domain_scores_gemma":[0.9965345,0.0015189698,0.00022044685,0.001390578,0.00021914791,0.00011633856],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0041234083,0.00013722031,0.00029781985,0.00010243694,0.00017321369,0.000054520064,0.0032646249,0.000049580587,0.00009243029],"category_scores_gemma":[0.00050937664,0.00008552472,0.00010765095,0.0009051813,0.012799348,0.00022896849,0.0010443105,0.00026946477,0.0000053785575],"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.000015110567,0.00012690574,0.00015686719,0.000012247351,0.000003287799,5.8808394e-7,0.0005464138,0.00003927339,0.021630678,0.9691014,0.000008401254,0.008358792],"study_design_scores_gemma":[0.000091400754,0.00015107232,0.00342838,0.000027778498,0.000002423701,0.0000039940205,0.000007850571,0.23914516,0.19111873,0.5659487,0.0000029068353,0.000071555456],"about_ca_topic_score_codex":0.000009000979,"about_ca_topic_score_gemma":0.0000011771041,"teacher_disagreement_score":0.40315267,"about_ca_system_score_codex":0.000012161266,"about_ca_system_score_gemma":0.00011670161,"threshold_uncertainty_score":0.98988724},"labels":[],"label_agreement":null},{"id":"W2130262632","doi":"10.1016/j.tcs.2009.07.057","title":"Covering arrays avoiding forbidden edges","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Pairwise comparison; Clique; Generalization; Enhanced Data Rates for GSM Evolution; Binary number; Software; Mathematics; Computer science; Algorithm; Theoretical computer science; Combinatorics; Discrete mathematics; Artificial intelligence; Arithmetic; Programming language","score_opus":0.01674969832501048,"score_gpt":0.26296799658636427,"score_spread":0.2462182982613538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130262632","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.008749225,0.000028258208,0.9780349,0.0012439643,0.00039873767,0.00009986385,2.7271346e-7,0.006782939,0.0046618152],"genre_scores_gemma":[0.6313791,0.0000017670515,0.36763588,0.0008659441,0.00010671673,0.0000019295137,1.3853018e-7,0.0000040045447,0.0000044616468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977327,0.00007498666,0.00023289362,0.00069889467,0.00061251066,0.00064803194],"domain_scores_gemma":[0.9981811,0.00044934067,0.00006313125,0.00091802084,0.00014218841,0.00024622353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018118455,0.0001906083,0.00019561256,0.00021266018,0.00067050074,0.0007038898,0.0027972744,0.00004996977,0.000007609155],"category_scores_gemma":[0.0004454291,0.0001628088,0.00006432024,0.0010843537,0.00088077714,0.0007987612,0.00064882333,0.0002714918,0.000046757228],"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.0000017048005,0.000026055955,0.00007833748,0.0000027160115,9.618645e-7,0.000011182676,0.0002836821,0.000058887566,0.00062270934,0.8574613,0.00043812898,0.14101438],"study_design_scores_gemma":[0.000077962344,0.00021772174,0.0009509481,0.000051949988,0.0000018111718,0.000066268076,8.368371e-7,0.25710714,0.010352622,0.7308683,0.00008283999,0.00022161593],"about_ca_topic_score_codex":0.0000024080912,"about_ca_topic_score_gemma":4.0359705e-8,"teacher_disagreement_score":0.62262994,"about_ca_system_score_codex":0.00006828618,"about_ca_system_score_gemma":0.00009222609,"threshold_uncertainty_score":0.6787626},"labels":[],"label_agreement":null},{"id":"W2130729091","doi":"10.1016/j.tcs.2011.05.012","title":"Polyominoes simulating arbitrary-neighborhood zippers and tilings","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","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":"Polyomino; Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.014175814350595672,"score_gpt":0.22785787668915014,"score_spread":0.21368206233855447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130729091","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.13146506,0.000034753444,0.8556878,0.00029312135,0.00012983652,0.00011613756,6.950079e-7,0.00025922342,0.012013356],"genre_scores_gemma":[0.79542875,0.0000024135886,0.20415065,0.00036486995,0.00003823677,0.0000041583953,2.8973244e-7,0.0000054730244,0.0000051787924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829334,0.000035772842,0.00021674791,0.0006603687,0.00034512888,0.00044864826],"domain_scores_gemma":[0.99877876,0.00014007466,0.00005340729,0.0006808781,0.0000718827,0.00027502613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059299235,0.0001535627,0.00014709472,0.0001295592,0.00044613436,0.00028902688,0.0015632537,0.000040646504,0.000037246853],"category_scores_gemma":[0.00003396926,0.00012800124,0.000041828393,0.0007145128,0.0018475499,0.00063693384,0.00094847195,0.00014678533,0.000048902126],"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.000001411441,0.000034325076,0.00024112914,0.0000033256483,0.000002022386,0.0000049049067,0.0012561956,0.000003949831,0.0010633924,0.9618924,0.000003416851,0.035493515],"study_design_scores_gemma":[0.00012701857,0.00008040653,0.0031775315,0.000013042419,0.00000426993,0.000038917522,0.000014225025,0.7583762,0.009215462,0.22871923,0.00003819847,0.00019549143],"about_ca_topic_score_codex":0.0000067824426,"about_ca_topic_score_gemma":2.4242897e-7,"teacher_disagreement_score":0.75837225,"about_ca_system_score_codex":0.000016758848,"about_ca_system_score_gemma":0.00006664458,"threshold_uncertainty_score":0.6807375},"labels":[],"label_agreement":null},{"id":"W2131488553","doi":"10.1016/j.tcs.2010.12.044","title":"Local 7-coloring for planar subgraphs of unit disk graphs","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Planar graph; Unit disk graph; Mathematics; Vertex (graph theory); Complete coloring; Graph factorization; Edge coloring; Graph coloring; Fractional coloring; Graph; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.017918212958136517,"score_gpt":0.2962133064616216,"score_spread":0.2782950935034851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131488553","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.13820617,0.000010927148,0.8595087,0.00026370294,0.0006545681,0.00032530702,0.0000061160035,0.00013941697,0.0008851242],"genre_scores_gemma":[0.76260906,0.000002237828,0.23722653,0.00008696778,0.000037467562,0.000021600512,7.8585725e-7,0.000010366824,0.000004966393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968626,0.00009043457,0.00037443775,0.00086618145,0.00088754355,0.0009188171],"domain_scores_gemma":[0.99662846,0.0010543568,0.000102803846,0.0013360943,0.00045916278,0.00041910165],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027896801,0.00022257006,0.00030283228,0.0005451096,0.0004733379,0.0001844752,0.0047169914,0.00008581743,0.000019181763],"category_scores_gemma":[0.00023117708,0.00018499531,0.00015156266,0.002437173,0.00896564,0.0007866013,0.0008349016,0.00045282985,0.00001347096],"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.000034847286,0.000066203356,0.00026925164,0.000016240965,0.0000057163093,0.0000045179113,0.0001842035,0.000085283566,0.012131167,0.9563552,0.000008123579,0.030839238],"study_design_scores_gemma":[0.00031240427,0.00034571395,0.000988804,0.000015699014,0.0000036100625,0.000021153894,0.000010451372,0.18114734,0.044335883,0.7724968,0.00011428646,0.00020781912],"about_ca_topic_score_codex":0.0000037631357,"about_ca_topic_score_gemma":0.0000045844226,"teacher_disagreement_score":0.6244029,"about_ca_system_score_codex":0.000017242466,"about_ca_system_score_gemma":0.00016851824,"threshold_uncertainty_score":0.9937314},"labels":[],"label_agreement":null},{"id":"W213233986","doi":"10.1016/j.tcs.2013.02.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-labelings on the modular product of two graphs","year":2013,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Graph; Vertex (graph theory); Product (mathematics); Mathematics; Algorithm; Geometry","score_opus":0.01497110216309254,"score_gpt":0.2328032701847388,"score_spread":0.21783216802164623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213233986","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.94355047,0.0016103754,0.015945282,0.0030209417,0.0055707633,0.00026696865,0.00032331693,0.0007221183,0.028989749],"genre_scores_gemma":[0.9724685,0.0006931569,0.018906804,0.0045192163,0.0014505319,0.0008820648,0.0002867844,0.0006611652,0.00013178421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9796236,0.0011496712,0.0034189324,0.0048056846,0.006215036,0.0047870497],"domain_scores_gemma":[0.9856633,0.003199833,0.002797426,0.005034229,0.00097006024,0.0023351454],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0076059187,0.0018640641,0.0009086534,0.0011451152,0.0040282854,0.004149722,0.008311265,0.0020767453,0.010035815],"category_scores_gemma":[0.0026924915,0.0025495107,0.0024532762,0.0042294175,0.010012086,0.0029788257,0.00659662,0.0033041723,0.0033676794],"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.00076409307,0.0008900971,0.000013970797,0.0007611693,0.00087272574,0.0005453393,0.0028319345,0.005478456,0.008613776,0.93781906,0.035818722,0.005590677],"study_design_scores_gemma":[0.0017496772,0.002618228,0.00005209161,0.0015850202,0.0007697727,0.0010730713,0.00039649315,0.5208978,0.4366535,0.03133286,0.00091137685,0.0019600878],"about_ca_topic_score_codex":0.0014409426,"about_ca_topic_score_gemma":0.00016070904,"teacher_disagreement_score":0.90648615,"about_ca_system_score_codex":0.00004797491,"about_ca_system_score_gemma":0.002101507,"threshold_uncertainty_score":0.9994104},"labels":[],"label_agreement":null},{"id":"W2134071399","doi":"10.1016/j.tcs.2004.09.024","title":"Verification and refinement with fine-grained action-based concurrent objects","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Computer science; Programming language; Guard (computer science); Action (physics); Object (grammar); Contrast (vision); Object-oriented programming; Theoretical computer science; Artificial intelligence","score_opus":0.018709218350867675,"score_gpt":0.25738826103413764,"score_spread":0.23867904268326998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134071399","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.019116646,0.000031038682,0.9781118,0.0011141531,0.00041278926,0.0002333754,2.644951e-7,0.00018799839,0.00079192186],"genre_scores_gemma":[0.95501256,0.0000015059089,0.044645965,0.0002415513,0.0000691365,0.000017924089,0.0000013616506,0.0000048267507,0.000005163702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982364,0.00005100572,0.00018683486,0.00061761454,0.0005373207,0.00037081054],"domain_scores_gemma":[0.9989481,0.00007428966,0.00008046148,0.0005266387,0.00016367293,0.00020682893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006839195,0.00015690779,0.00014978573,0.00011372589,0.00033868177,0.00040666718,0.00078047864,0.00003525586,0.000006473926],"category_scores_gemma":[0.000032137246,0.00010855214,0.00002636477,0.00069582695,0.0013556953,0.0003037455,0.00018649321,0.00011213908,0.000024455916],"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.000006174777,0.00006111474,0.000060565246,0.000012914925,0.0000026513724,0.000005958462,0.00039988884,0.00030363197,0.0003019327,0.9649741,0.0000054824673,0.0338656],"study_design_scores_gemma":[0.0046240943,0.0039454084,0.0069350437,0.00009413832,0.00003052124,0.00017679892,0.00006664912,0.5941646,0.038626473,0.3478606,0.0022111826,0.0012645068],"about_ca_topic_score_codex":0.000016559183,"about_ca_topic_score_gemma":0.0000068051777,"teacher_disagreement_score":0.9358959,"about_ca_system_score_codex":0.00008395707,"about_ca_system_score_gemma":0.00023208401,"threshold_uncertainty_score":0.49951157},"labels":[],"label_agreement":null},{"id":"W2136026170","doi":"10.1016/j.tcs.2009.09.033","title":"Priority algorithms for graph optimization problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Greedy algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.020045918708397618,"score_gpt":0.2708548621187035,"score_spread":0.2508089434103059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136026170","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.0005057651,0.00003709225,0.99438775,0.0022894992,0.0007678637,0.0004928538,0.0000031538211,0.00041393007,0.0011020827],"genre_scores_gemma":[0.2879777,0.0000068818877,0.7110981,0.0007379367,0.00015531253,0.000012052254,0.0000018016818,0.0000047544245,0.0000055020064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720365,0.00006463123,0.00033709567,0.0009890812,0.0006783737,0.00072715484],"domain_scores_gemma":[0.99810636,0.00019350843,0.000088932335,0.00096170267,0.0003592432,0.00029023102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017472504,0.00022458233,0.00024328189,0.00028334832,0.0007859828,0.00069665146,0.0028751772,0.000067138935,0.000013667018],"category_scores_gemma":[0.00008887449,0.00019562225,0.000134005,0.0018800698,0.0015152202,0.0010381124,0.00043587704,0.00018243899,0.00000923166],"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.0000036462163,0.00009263529,0.0000038210956,0.0000048879806,0.0000021660778,0.0000016426458,0.00018510023,0.0082787955,0.00006952713,0.8575188,0.000038045295,0.13380094],"study_design_scores_gemma":[0.00020134979,0.0003282048,0.00016817183,0.000014069862,0.0000026066903,0.0000150069445,0.0000011116233,0.5764737,0.0005009174,0.42200384,0.00011856883,0.00017240507],"about_ca_topic_score_codex":0.0000014629437,"about_ca_topic_score_gemma":2.038506e-7,"teacher_disagreement_score":0.5681949,"about_ca_system_score_codex":0.000048675643,"about_ca_system_score_gemma":0.000118256234,"threshold_uncertainty_score":0.7977244},"labels":[],"label_agreement":null},{"id":"W2136499814","doi":"10.1016/j.tcs.2009.02.032","title":"Twin-roots of words and their properties","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Involution (esoterism); Mathematics; Catenation; Combinatorics; Uniqueness; Word (group theory); Primitive root modulo n; Factorization; Pure mathematics; Modulo; Algorithm; Geometry; Biology; Mathematical analysis","score_opus":0.010737442766716497,"score_gpt":0.21839386871214253,"score_spread":0.20765642594542602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136499814","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.35193792,0.00014753842,0.6451699,0.0009806702,0.00015215657,0.000082330334,4.6932738e-7,0.00012690286,0.0014021315],"genre_scores_gemma":[0.96193427,0.0000070300866,0.037262794,0.0007346932,0.000051064882,0.0000012429402,8.930342e-8,0.0000032576086,0.00000558117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849796,0.000067219924,0.00022989584,0.00048431157,0.0003354483,0.0003851368],"domain_scores_gemma":[0.99891996,0.000107011736,0.000059107693,0.00065650104,0.00009150024,0.00016594508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010612342,0.00015707612,0.0002180042,0.00013716672,0.0001850663,0.00023363606,0.001743806,0.00003557288,0.0000085106985],"category_scores_gemma":[0.000046626912,0.00009930907,0.000043203378,0.00068947964,0.0023638678,0.000591133,0.00060854456,0.00010952638,0.0000073306755],"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.0000043658138,0.00003639912,0.000015459394,0.0000042454667,0.0000014030228,0.00000189225,0.00088979857,0.000010885784,0.012380884,0.8250101,0.000007775705,0.16163675],"study_design_scores_gemma":[0.00018223388,0.00040107596,0.004052913,0.00007164162,0.0000019971787,0.00005227387,0.000028283495,0.40494868,0.05999083,0.5300112,0.000043762328,0.00021511075],"about_ca_topic_score_codex":0.0000012928222,"about_ca_topic_score_gemma":8.315203e-8,"teacher_disagreement_score":0.6099963,"about_ca_system_score_codex":0.000014548729,"about_ca_system_score_gemma":0.000061732826,"threshold_uncertainty_score":0.870977},"labels":[],"label_agreement":null},{"id":"W2137465421","doi":"10.1016/j.tcs.2008.10.015","title":"The degree distribution of random<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-trees","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Degree (music); Mathematics; Distribution (mathematics); Computer science; Physics; Mathematical analysis; Theology; Philosophy","score_opus":0.015779277903760762,"score_gpt":0.24383143856678902,"score_spread":0.22805216066302825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137465421","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.77758527,0.00004509635,0.22053547,0.00015085857,0.00015170498,0.000046463392,0.000023165183,0.00006461773,0.0013973686],"genre_scores_gemma":[0.9954925,0.000026160995,0.0038788621,0.00007459104,0.00040705124,0.000039203744,0.000049854894,0.00002207535,0.000009705262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977304,0.00009778153,0.00046097682,0.00046703688,0.00070097897,0.00054283295],"domain_scores_gemma":[0.99806786,0.000599203,0.00026074258,0.0007901992,0.000113562586,0.00016846489],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010167192,0.0002162836,0.0002155084,0.000049079037,0.00090679637,0.00020632752,0.0010543225,0.000084814405,0.00003952205],"category_scores_gemma":[0.00007026413,0.00018454355,0.0003401988,0.0005090813,0.002899925,0.0002463796,0.00074556645,0.00028595803,0.00008527955],"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.000100972546,0.00009063224,0.00009272113,0.000008505579,0.000052846983,0.000008955818,0.00014921225,0.0004214174,0.0002535809,0.99284726,0.00024723422,0.005726682],"study_design_scores_gemma":[0.00037957195,0.00017860255,0.00055021077,0.00006922971,0.000068855355,0.000020849662,0.00002755806,0.9691455,0.006149972,0.022793626,0.00042847227,0.00018758055],"about_ca_topic_score_codex":0.0000700089,"about_ca_topic_score_gemma":0.000009220309,"teacher_disagreement_score":0.9700536,"about_ca_system_score_codex":0.000012616759,"about_ca_system_score_gemma":0.0001600913,"threshold_uncertainty_score":0.9998136},"labels":[],"label_agreement":null},{"id":"W2137845880","doi":"10.1016/j.tcs.2007.04.036","title":"Agreement in synchronous networks with ubiquitous faults","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Impossibility; Computer science; Distributed computing; Topology (electrical circuits); Component (thermodynamics); Class (philosophy); Theoretical computer science; Mathematics","score_opus":0.004726351572055682,"score_gpt":0.22857777259807088,"score_spread":0.2238514210260152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137845880","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.06483445,0.000056996512,0.92888695,0.00024250992,0.00054439023,0.00024711047,8.0993783e-7,0.00014994749,0.005036825],"genre_scores_gemma":[0.9384673,0.0000023920247,0.060970265,0.0003900891,0.00014417301,0.0000065093486,8.1942187e-7,0.0000066686903,0.000011735413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967451,0.000058352656,0.00042464744,0.00085813436,0.00084283936,0.0010709349],"domain_scores_gemma":[0.99832445,0.00016820504,0.000091491354,0.00091115775,0.00016725827,0.00033743787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028059022,0.00022827914,0.0002707058,0.00020495866,0.00024579169,0.00028514393,0.0023735997,0.00006822363,0.000011174668],"category_scores_gemma":[0.000020179965,0.00016954746,0.000040360916,0.0020125175,0.0013940927,0.0005619597,0.00059205934,0.00026954696,0.000041909843],"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.00002560744,0.00011886091,0.00066910434,0.000006992553,0.0000035033781,0.00021540742,0.00036351607,0.007181892,0.00007232917,0.905726,0.000030412897,0.08558636],"study_design_scores_gemma":[0.0006746168,0.0005084846,0.023011412,0.00013446364,0.000002410596,0.00015438348,0.000018596422,0.9694484,0.0005995471,0.004747571,0.0002863309,0.00041379884],"about_ca_topic_score_codex":0.000020980526,"about_ca_topic_score_gemma":0.00002220848,"teacher_disagreement_score":0.9622665,"about_ca_system_score_codex":0.00016644638,"about_ca_system_score_gemma":0.000118401935,"threshold_uncertainty_score":0.6913945},"labels":[],"label_agreement":null},{"id":"W2138079171","doi":"10.1016/j.tcs.2012.12.017","title":"Classical, quantum and nonsignalling resources in bipartite games","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Bipartite graph; Quantum; Mathematical economics; Mathematics; Computer science; Theoretical computer science; Combinatorics; Discrete mathematics; Quantum mechanics; Physics; Graph","score_opus":0.012374730256739512,"score_gpt":0.25664841359229545,"score_spread":0.24427368333555594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138079171","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.67904884,0.000028141952,0.3195902,0.0003151331,0.00005675017,0.000055796285,0.0000013525965,0.000013391206,0.00089038746],"genre_scores_gemma":[0.9970129,0.0000014022778,0.0027062169,0.000074971664,0.00018825792,0.000009309798,5.300279e-7,0.000004672082,0.000001709741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991234,0.000028834533,0.00013284251,0.00021056636,0.00015311802,0.00035125404],"domain_scores_gemma":[0.99949944,0.000109560555,0.000027413995,0.00016653075,0.000023231698,0.00017379355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894078,0.0000797349,0.00010085405,0.00006085134,0.00016381287,0.00010470866,0.00021701494,0.000014805697,0.000087509165],"category_scores_gemma":[0.0000049893156,0.00006407932,0.00002035453,0.00032078894,0.00078038714,0.00016366165,0.00017364025,0.00011257813,0.00002884837],"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.0000015841496,0.00005551424,0.0020377145,0.0000011501118,0.0000010328592,1.1357271e-7,0.00034587216,0.0000042972574,0.0013521117,0.9920433,0.000009930081,0.004147362],"study_design_scores_gemma":[0.00012097565,0.000034241224,0.0027345887,0.000023407238,0.0000043735035,0.0000012853707,0.00007262085,0.34427926,0.0038006708,0.6480494,0.00073259365,0.00014654912],"about_ca_topic_score_codex":0.0000050448316,"about_ca_topic_score_gemma":1.5722881e-7,"teacher_disagreement_score":0.34427497,"about_ca_system_score_codex":0.0000071908025,"about_ca_system_score_gemma":0.000016377428,"threshold_uncertainty_score":0.2875369},"labels":[],"label_agreement":null},{"id":"W2140266967","doi":"10.1016/j.tcs.2014.02.006","title":"Graph transformation for incremental natural language analysis","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Transformation (genetics); Graph rewriting; Computer science; Graph; Mathematics; Programming language; Theoretical computer science","score_opus":0.0046900244990736,"score_gpt":0.26367150925723376,"score_spread":0.2589814847581602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140266967","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.013951656,0.00010413026,0.9840559,0.000625335,0.00022115522,0.00020177876,0.0000019484958,0.00050200685,0.00033614074],"genre_scores_gemma":[0.56433994,4.192418e-7,0.43520314,0.00039668882,0.000043079817,0.000008291542,0.0000034706427,0.0000029604296,0.0000020019618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822235,0.000070475064,0.00023581684,0.00050879974,0.00053604733,0.00042651675],"domain_scores_gemma":[0.99890965,0.0001896297,0.00006854453,0.00054020376,0.00016396808,0.00012799964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016846708,0.00015308571,0.00020532873,0.00047567935,0.00035200393,0.00046893914,0.0021074698,0.000043390344,0.0000074358018],"category_scores_gemma":[0.00009258698,0.00011780443,0.00014341314,0.002229074,0.0007853023,0.001024618,0.0002983766,0.00014661343,0.000006014405],"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.0000052105506,0.000015619897,0.000009976388,0.00000842331,0.000011093889,5.7876264e-7,0.0007196108,0.000019989915,0.0036073735,0.9124867,0.000011513236,0.083103955],"study_design_scores_gemma":[0.00015943251,0.00010825736,0.00009157492,0.000009090404,0.000027661637,0.0000066555367,0.0000074497657,0.7651876,0.052994147,0.1812092,0.000022380462,0.00017653697],"about_ca_topic_score_codex":0.000005827262,"about_ca_topic_score_gemma":0.0000018690877,"teacher_disagreement_score":0.7651676,"about_ca_system_score_codex":0.00004875262,"about_ca_system_score_gemma":0.00003209204,"threshold_uncertainty_score":0.48039255},"labels":[],"label_agreement":null},{"id":"W2140571294","doi":"10.1016/j.tcs.2004.01.013","title":"The abc conjecture and correctly rounded reciprocal square roots","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Conjecture; Reciprocal; Square root; Square (algebra); Mathematics; Point (geometry); Code (set theory); Constant (computer programming); Computation; Collatz conjecture; Scheme (mathematics); Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.008188843754170748,"score_gpt":0.26321091355238313,"score_spread":0.2550220697982124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140571294","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.014521293,0.00012143969,0.97704756,0.0059206304,0.0011430741,0.00018395885,8.075389e-7,0.000179598,0.00088160986],"genre_scores_gemma":[0.63202506,0.000015722242,0.3670843,0.00072904496,0.00012694286,0.00000631679,1.3309507e-7,0.0000059605045,0.0000065503064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743134,0.00015665799,0.00025706802,0.00077581574,0.0006837149,0.0006953778],"domain_scores_gemma":[0.99800557,0.0006640898,0.00006678866,0.0007493117,0.00013767117,0.00037658785],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016784341,0.00021431275,0.00021655826,0.000067127956,0.0012684664,0.0011557288,0.0021968852,0.00006329212,0.000004671903],"category_scores_gemma":[0.00021255613,0.00012543393,0.00006024941,0.0011044198,0.0041760462,0.00047480324,0.001082788,0.00034048603,0.0000274472],"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.0000041857215,0.000023831566,0.000008484392,0.0000017104319,0.00000195555,0.000010991889,0.00019123754,0.000040911098,0.000107083535,0.7517368,0.00000892112,0.24786384],"study_design_scores_gemma":[0.00043008552,0.0004223264,0.0011732685,0.00003001298,0.0000027670571,0.00016263475,0.000015995147,0.12514374,0.0019741983,0.869711,0.00068169954,0.0002523245],"about_ca_topic_score_codex":0.000010112522,"about_ca_topic_score_gemma":0.0000016750404,"teacher_disagreement_score":0.61750376,"about_ca_system_score_codex":0.000073665185,"about_ca_system_score_gemma":0.00016334285,"threshold_uncertainty_score":0.99988115},"labels":[],"label_agreement":null},{"id":"W2141195801","doi":"10.1016/j.tcs.2015.10.038","title":"Order compression schemes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Compression (physics); Mathematics; Data compression; Conjecture; Data compression ratio; Sample (material); Lossless compression; Intersection (aeronautics); Dimension (graph theory); Order (exchange); Algorithm; Image compression; Discrete mathematics; Computer science; Combinatorics; Artificial intelligence","score_opus":0.014273892912185154,"score_gpt":0.27760372365807984,"score_spread":0.26332983074589467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141195801","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.011758756,0.0000380822,0.97573805,0.0020303968,0.00093887944,0.00007108178,2.5771385e-7,0.00039599676,0.0090284925],"genre_scores_gemma":[0.620896,6.788473e-7,0.3784452,0.00047542612,0.00014303313,0.0000019611366,3.5277733e-7,0.0000043655314,0.000032989738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768156,0.00012021641,0.00018799263,0.00061925914,0.0008898435,0.0005011522],"domain_scores_gemma":[0.9982203,0.00010963515,0.000050963168,0.0007800799,0.000337512,0.0005015131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015134991,0.00015631632,0.00016508436,0.00014318936,0.0003130193,0.0005005095,0.0025917708,0.000040206978,0.000028520328],"category_scores_gemma":[0.00020382585,0.00011493378,0.000035433583,0.0013340559,0.0014233509,0.0006336449,0.0015314041,0.00025432836,0.00025133847],"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.0000026294122,0.00003695532,0.00009619573,0.0000018366047,0.0000012670437,0.000009225915,0.00027795965,0.0004307032,0.0001210681,0.92428964,0.00026353478,0.07446898],"study_design_scores_gemma":[0.0002638643,0.00015264702,0.00021511901,0.000017895576,0.0000013258485,0.000040755272,0.0000044134918,0.90592796,0.0016395844,0.0878627,0.0036851887,0.0001885232],"about_ca_topic_score_codex":0.0000046717946,"about_ca_topic_score_gemma":8.065637e-8,"teacher_disagreement_score":0.90549725,"about_ca_system_score_codex":0.000036860005,"about_ca_system_score_gemma":0.00019792368,"threshold_uncertainty_score":0.5244396},"labels":[],"label_agreement":null},{"id":"W2141385438","doi":"10.1016/j.tcs.2012.03.046","title":"State complexity of union and intersection of square and reversal on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math> regular languages","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"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":"State (computer science); Intersection (aeronautics); Component (thermodynamics); Mathematics; Discrete mathematics; Computer science; Algorithm; Engineering; Physics","score_opus":0.014212729719191937,"score_gpt":0.24482203627869006,"score_spread":0.23060930655949813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141385438","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.88612586,0.000084528176,0.11286901,0.00015950514,0.00033844644,0.000038716433,0.000014020478,0.00006417453,0.00030571508],"genre_scores_gemma":[0.98477834,0.000020796606,0.014861665,0.00020797817,0.0001023191,0.000005385385,0.0000057959237,0.0000147382425,0.000003001814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981715,0.00013106808,0.0003148211,0.00044267604,0.0005356976,0.0004042325],"domain_scores_gemma":[0.9986227,0.00030521644,0.00021735123,0.0006024176,0.000059602997,0.00019271113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015049618,0.00017237011,0.00017275833,0.00011150922,0.00023419756,0.00015667344,0.000672309,0.00009741655,0.000007949799],"category_scores_gemma":[0.00010142661,0.00016539679,0.00008503438,0.0003284176,0.0024279982,0.00065085496,0.0009371734,0.0001965342,0.000017757446],"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.00005796088,0.00008290125,0.00003458515,0.0000868553,0.000018008697,0.000010358423,0.0015881278,0.00007158692,0.0025033322,0.98976004,0.000019584808,0.0057666325],"study_design_scores_gemma":[0.00028049998,0.000564022,0.0013868043,0.00022814603,0.000019759684,0.00009915484,0.00014784951,0.95588934,0.022714995,0.018472178,0.00002699298,0.00017023658],"about_ca_topic_score_codex":0.000051537907,"about_ca_topic_score_gemma":0.000004606418,"teacher_disagreement_score":0.9712879,"about_ca_system_score_codex":0.000012056196,"about_ca_system_score_gemma":0.000059330447,"threshold_uncertainty_score":0.89460605},"labels":[],"label_agreement":null},{"id":"W2142971854","doi":"10.1016/j.tcs.2009.01.016","title":"Exploration–exploitation tradeoff using variance estimates in multi-armed bandits","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":566,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Variance (accounting); Stochastic game; Upper and lower bounds; Logarithm; Mathematical optimization; Computer science; Multi-armed bandit; Interval (graph theory); Mathematics; Mathematical economics; Machine learning; Economics","score_opus":0.20250909729079805,"score_gpt":0.46313926625110025,"score_spread":0.2606301689603022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142971854","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.057959575,0.00002653591,0.9399899,0.0012278417,0.00031827544,0.00026855196,0.0000023640894,0.00006324568,0.00014369431],"genre_scores_gemma":[0.71828413,0.0000028676225,0.28145596,0.00016751779,0.000067546884,0.0000046986765,7.909129e-7,0.0000056600397,0.00001083677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509025,0.00023160016,0.0006439523,0.0009440239,0.002380779,0.00070939574],"domain_scores_gemma":[0.9970365,0.0014558246,0.0001241576,0.00062470295,0.0004865764,0.0002722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049612257,0.00019143357,0.0003035006,0.00069955667,0.00042100297,0.0007090758,0.0017069179,0.000064127256,0.00011155612],"category_scores_gemma":[0.003552325,0.00014600715,0.00005309462,0.0037928005,0.0020844399,0.0026059854,0.00021642786,0.00027803818,0.00012560532],"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.00012665815,0.0005823241,0.00066303083,0.000005642567,0.000003935347,0.00011236061,0.0046440056,0.26235524,0.010759509,0.45753068,0.000070881215,0.26314571],"study_design_scores_gemma":[0.00032038434,0.00010686532,0.006729311,0.000019717843,0.0000011058486,0.000010221467,0.000052830725,0.6571352,0.0029338745,0.33254933,0.00001185038,0.00012933752],"about_ca_topic_score_codex":0.0000032527341,"about_ca_topic_score_gemma":0.0000024058413,"teacher_disagreement_score":0.6603246,"about_ca_system_score_codex":0.00015891918,"about_ca_system_score_gemma":0.0001891846,"threshold_uncertainty_score":0.7680205},"labels":[],"label_agreement":null},{"id":"W2144182788","doi":"10.1016/j.tcs.2007.09.032","title":"Gathering asynchronous oblivious mobile robots in a ring","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Snapshot (computer storage); Robot; Asynchronous communication; Computer science; Mobile robot; Node (physics); Ring (chemistry); Algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence; Engineering; Operating system","score_opus":0.009868126200166685,"score_gpt":0.26984641937393045,"score_spread":0.25997829317376375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144182788","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.050478958,0.000032051215,0.94176424,0.00015472934,0.0003042003,0.00023768136,1.3817007e-7,0.00021196512,0.006816026],"genre_scores_gemma":[0.7524164,0.000005166674,0.24727657,0.00023719107,0.00004476683,0.0000070626274,1.4335019e-7,0.0000063612742,0.0000063808425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743205,0.0000664212,0.00032983048,0.0006480204,0.0006419096,0.0008817366],"domain_scores_gemma":[0.9986827,0.00022533815,0.00004720778,0.0006139838,0.00011763047,0.0003131812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034375119,0.00015241269,0.00017226057,0.00040038698,0.00024924584,0.0004319532,0.0020313128,0.00004959562,0.00003853445],"category_scores_gemma":[0.00006059222,0.00013619337,0.000041137308,0.0019706108,0.0010543413,0.0007551633,0.0010364148,0.00025389207,0.00007666907],"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.0000034729667,0.00007397059,0.00021391339,0.000005133061,0.0000010384266,0.000043866075,0.001070733,0.02661947,0.0005327346,0.8828974,0.0000018859281,0.08853641],"study_design_scores_gemma":[0.00027600708,0.00017744108,0.0021560758,0.00003792884,5.8073357e-7,0.00003911735,0.000012777692,0.97190887,0.0020626737,0.023080518,0.00003784794,0.0002101693],"about_ca_topic_score_codex":0.0000079113815,"about_ca_topic_score_gemma":0.0000056911485,"teacher_disagreement_score":0.9452894,"about_ca_system_score_codex":0.00014083143,"about_ca_system_score_gemma":0.00011804324,"threshold_uncertainty_score":0.5553804},"labels":[],"label_agreement":null},{"id":"W2144694779","doi":"10.1016/s0304-3975(02)00421-8","title":"On learning of functions refutably","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Real Estate Foundation of British Columbia","keywords":"Function (biology); Artificial intelligence; Computer science; Type (biology); Mathematics; Machine learning","score_opus":0.0060477036543585775,"score_gpt":0.23988754661695125,"score_spread":0.23383984296259266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144694779","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.028320748,0.000009731643,0.94125277,0.00024968415,0.0005461685,0.000049497015,2.3288698e-7,0.00015286478,0.029418308],"genre_scores_gemma":[0.8894551,8.4459634e-7,0.11022517,0.00016447902,0.000035114925,0.0000017719522,1.8537693e-7,0.0000046469295,0.0001127291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816227,0.00021156087,0.00019858533,0.00048933027,0.0005646734,0.00037356856],"domain_scores_gemma":[0.9987447,0.00034446374,0.000069976166,0.0005506851,0.00012674814,0.00016337246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015163895,0.00012212906,0.00015556907,0.00018954446,0.00039945336,0.00014404132,0.0010724778,0.000031709176,0.000078792575],"category_scores_gemma":[0.0004193781,0.00009662185,0.000056984645,0.0011728861,0.001064596,0.00023971114,0.0002361405,0.00032842648,0.00011567256],"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.000001947004,0.000044157146,0.00006949396,0.0000025678712,0.0000017338876,0.0000027029423,0.0001311328,0.004194492,0.00023769258,0.97059536,0.000024946483,0.024693754],"study_design_scores_gemma":[0.00023345355,0.0007384298,0.00051144336,0.000031206237,0.0000029835608,0.000037104375,0.0000075483094,0.8293991,0.0039071436,0.16348493,0.0014380781,0.00020857027],"about_ca_topic_score_codex":0.0000019031821,"about_ca_topic_score_gemma":4.1160998e-8,"teacher_disagreement_score":0.8611343,"about_ca_system_score_codex":0.000023511215,"about_ca_system_score_gemma":0.000090175854,"threshold_uncertainty_score":0.39401245},"labels":[],"label_agreement":null},{"id":"W2145253149","doi":"10.1016/j.tcs.2005.06.037","title":"The HASCASL prologue: Categorical syntax and semantics of the partial <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>λ</mml:mi></mml:math>-calculus","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Syntax; Scroll; Algorithm; Semantics (computer science); Prologue; Computer science; Categorical variable; Mathematics; Programming language; Artificial intelligence; Machine learning; Philosophy; Theology; Art","score_opus":0.01425435046213259,"score_gpt":0.2348297229824746,"score_spread":0.220575372520342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145253149","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.6837309,0.00013514064,0.31148848,0.0019486997,0.0010722084,0.000111285204,0.0000016171508,0.00011449112,0.0013971899],"genre_scores_gemma":[0.9938574,0.000022862141,0.0051985295,0.00047536913,0.00037267944,0.00003555565,9.4815044e-7,0.000019158057,0.000017528699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969415,0.00018339416,0.00046977945,0.00066780666,0.0009846007,0.00075289496],"domain_scores_gemma":[0.99780977,0.00047134116,0.00026228477,0.0011251493,0.00009208434,0.00023934877],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002019382,0.00022824896,0.00018895134,0.000047227102,0.0009793593,0.000698324,0.0022542689,0.00018911931,0.000009550704],"category_scores_gemma":[0.00023606866,0.0001607921,0.00017785231,0.00055336114,0.0035499497,0.00040898813,0.0020813474,0.00037258022,0.0001747824],"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.0000273832,0.00007428933,0.00002144471,0.000027131682,0.000021789934,0.000024210343,0.00084284495,0.00023323475,0.00018135423,0.9882153,0.00013002116,0.01020095],"study_design_scores_gemma":[0.00023168855,0.00034424115,0.00010434308,0.000017955697,0.000030567247,0.00028254738,0.000029392922,0.9648528,0.0073037855,0.024980322,0.001630176,0.00019218898],"about_ca_topic_score_codex":0.0000447917,"about_ca_topic_score_gemma":0.000017561688,"teacher_disagreement_score":0.9646196,"about_ca_system_score_codex":0.00001865834,"about_ca_system_score_gemma":0.0002589359,"threshold_uncertainty_score":0.99916184},"labels":[],"label_agreement":null},{"id":"W2147012241","doi":"10.1016/s0304-3975(01)00154-2","title":"Rigorous results for random (2+p)-SAT","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Random variable; Set (abstract data type); Order (exchange); Discrete mathematics; Statistics; Computer science","score_opus":0.011106381693631446,"score_gpt":0.2534107792008292,"score_spread":0.24230439750719776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147012241","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.003289905,0.000008421133,0.9854616,0.0029913713,0.0008518701,0.00029964934,0.00000331265,0.0002815281,0.0068123615],"genre_scores_gemma":[0.7039872,0.0000062501113,0.2952616,0.0005863193,0.00010593023,0.000009526894,0.0000020847692,0.0000039022857,0.00003724364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981244,0.000057810154,0.00029635933,0.0006321662,0.00043103547,0.0004582213],"domain_scores_gemma":[0.99842143,0.00043994805,0.00007025204,0.00060203235,0.00024576765,0.0002205458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106119,0.00013803323,0.00016058213,0.0001668348,0.0004629553,0.00044814366,0.0012352997,0.0000447303,0.000027368027],"category_scores_gemma":[0.00023263694,0.000114691,0.000072867384,0.0008936697,0.0011913131,0.00066106534,0.00030013482,0.00009542704,0.0000661918],"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.00006582385,0.000024217641,0.000028647899,0.0000016834803,0.000002042401,0.00000490856,0.00019163633,0.001007779,0.00009129958,0.87765133,0.00017133908,0.12075931],"study_design_scores_gemma":[0.0016659456,0.00015294435,0.0006730928,0.000010818729,0.0000033570134,0.00008688302,0.0000035264347,0.91239864,0.00058111246,0.08237204,0.0018623803,0.00018927881],"about_ca_topic_score_codex":0.0000017436761,"about_ca_topic_score_gemma":0.0000014034334,"teacher_disagreement_score":0.91139084,"about_ca_system_score_codex":0.000051575596,"about_ca_system_score_gemma":0.00011176928,"threshold_uncertainty_score":0.4676963},"labels":[],"label_agreement":null},{"id":"W2147763027","doi":"10.1016/j.tcs.2008.09.056","title":"Quasiperiodic and Lyndon episturmian words","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Quasiperiodic function; Mathematics; Generalization; Morphism; Word (group theory); Characterization (materials science); Class (philosophy); Directive; Pure mathematics; Combinatorics; Computer science; Artificial intelligence; Mathematical analysis; Physics; Geometry","score_opus":0.008835510490404727,"score_gpt":0.2206555159525293,"score_spread":0.21182000546212457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147763027","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.28704304,0.00009765206,0.70836276,0.0009943016,0.00037618668,0.000085857195,5.744578e-7,0.00027729073,0.0027623512],"genre_scores_gemma":[0.90325004,0.00002378651,0.09560213,0.0009904964,0.00010494028,0.0000042965094,2.7880318e-7,0.0000067565816,0.000017298102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977261,0.000094959214,0.0002318285,0.0007725925,0.00058745453,0.0005870753],"domain_scores_gemma":[0.9984695,0.00020384211,0.000050861003,0.0008399123,0.00007512267,0.0003608066],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010378689,0.00019486685,0.00022121698,0.0001747717,0.0008117867,0.00034113077,0.0020013554,0.000050755,0.000036206926],"category_scores_gemma":[0.000061272774,0.0001544893,0.000050246286,0.0009393462,0.0053945654,0.00078040455,0.0011980201,0.00018335588,0.00007821452],"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.0000033073625,0.000032631306,0.00020694753,0.0000036941594,0.0000018135084,0.000054468266,0.0011064688,0.0000040206046,0.00042729653,0.95214796,0.00006698409,0.045944422],"study_design_scores_gemma":[0.000508093,0.00037307708,0.016822822,0.00004506387,0.000004382343,0.0013448556,0.000020859792,0.67114526,0.004165991,0.3043686,0.0006190895,0.0005818985],"about_ca_topic_score_codex":0.0000053415915,"about_ca_topic_score_gemma":3.07044e-7,"teacher_disagreement_score":0.67114127,"about_ca_system_score_codex":0.000036775506,"about_ca_system_score_gemma":0.00011485919,"threshold_uncertainty_score":0.9973122},"labels":[],"label_agreement":null},{"id":"W2148837681","doi":"10.1016/s0304-3975(03)00049-5","title":"A fast algorithm to generate necklaces with fixed content","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Alphabet; Amortized analysis; Algorithm; Mathematics; Fixed point; Constant (computer programming); Simple (philosophy); Symbol (formal); Construct (python library); Bounding overwatch; Listing (finance); Combinatorics; Content (measure theory); Computer science; Data structure; Artificial intelligence","score_opus":0.015390357915986018,"score_gpt":0.23220576042524038,"score_spread":0.21681540250925435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148837681","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.015791865,0.000029353941,0.9810132,0.00057798694,0.00055712473,0.00024820093,0.0000042355514,0.00019238063,0.0015856634],"genre_scores_gemma":[0.28698453,0.0000021216376,0.71174544,0.0011322701,0.00007165815,0.000013654797,8.30588e-7,0.000008331033,0.000041193176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969185,0.00013433793,0.0002580076,0.0010252809,0.00090696785,0.0007569256],"domain_scores_gemma":[0.9977837,0.00010959559,0.00006242235,0.0011302797,0.0003023688,0.00061162317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090061064,0.0002567056,0.00025368968,0.0001843689,0.00053075154,0.0008429455,0.002373717,0.000041686686,0.00004109053],"category_scores_gemma":[0.00005319622,0.00017013353,0.000043261785,0.0014552826,0.0010690459,0.00087537454,0.00096274784,0.00017367724,0.00013819753],"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.0000069552516,0.00006674977,0.000035895268,0.0000021913854,0.000004262618,0.000031649815,0.0002534732,0.000392153,0.00092124246,0.8625577,0.00017232283,0.13555539],"study_design_scores_gemma":[0.00068925496,0.0010062458,0.0008825142,0.00007594449,0.000006715179,0.0002052002,0.00002970234,0.94925946,0.027662242,0.017007679,0.0025157826,0.00065928116],"about_ca_topic_score_codex":0.000007745698,"about_ca_topic_score_gemma":8.025379e-7,"teacher_disagreement_score":0.94886726,"about_ca_system_score_codex":0.00005529629,"about_ca_system_score_gemma":0.00018526128,"threshold_uncertainty_score":0.81285423},"labels":[],"label_agreement":null},{"id":"W2149317979","doi":"10.1016/j.tcs.2010.10.038","title":"On the red/blue spanning tree problem","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Division of Biological Infrastructure; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Shortest-path tree; Euclidean minimum spanning tree; Minimum spanning tree; Vertex (graph theory); k-minimum spanning tree; Convex hull; Tree (set theory); Minimum degree spanning tree; Path (computing); K-ary tree; Regular polygon; Geometry; Tree structure; Graph; Binary tree; Computer science","score_opus":0.00984460314560611,"score_gpt":0.23983971626585446,"score_spread":0.22999511312024834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149317979","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.11805861,0.0000032548269,0.86276734,0.0074875206,0.0009385506,0.0001646003,3.868862e-7,0.00014626526,0.010433462],"genre_scores_gemma":[0.8403347,4.1152535e-7,0.157947,0.001444459,0.00022591911,0.00000989915,5.6207324e-7,0.000004615248,0.0000324121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979003,0.0000896503,0.00021170608,0.0006023684,0.00077819807,0.000417776],"domain_scores_gemma":[0.9980892,0.000666128,0.0000628707,0.00080363563,0.00019765228,0.00018054806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017695,0.00015358225,0.0001122849,0.00017232633,0.00076284475,0.0006512678,0.0024186105,0.000045261433,0.00007289787],"category_scores_gemma":[0.00019994026,0.00009794082,0.000056652963,0.0014434428,0.0012432716,0.00045694792,0.0006418757,0.00040778008,0.0001363782],"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.0000030516223,0.000034381876,0.0000075578555,0.0000011660916,0.0000016704491,0.0000033152432,0.00021636469,0.0012169875,0.003423929,0.945429,0.0003373044,0.049325258],"study_design_scores_gemma":[0.00008723851,0.00012628158,0.00064577285,0.000009511003,0.0000014598926,0.000030921812,0.000001932251,0.55702555,0.008807887,0.43243963,0.0006912076,0.0001326341],"about_ca_topic_score_codex":9.78773e-7,"about_ca_topic_score_gemma":0.0000011518199,"teacher_disagreement_score":0.7222761,"about_ca_system_score_codex":0.000021902237,"about_ca_system_score_gemma":0.00013966321,"threshold_uncertainty_score":0.62801903},"labels":[],"label_agreement":null},{"id":"W2152595206","doi":"10.1016/j.tcs.2004.10.021","title":"Domain theory, testing and simulation for labelled Markov processes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Preorder; Mathematics; Probabilistic logic; Domain theory; Equivalence (formal languages); Domain (mathematical analysis); Markov chain; State space; Markov kernel; Markov process; Discrete mathematics; Kernel (algebra); Computer science; Pure mathematics; Markov model; Variable-order Markov model","score_opus":0.02515576003690079,"score_gpt":0.30781641537150756,"score_spread":0.28266065533460677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152595206","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.034418944,0.000024422374,0.96365005,0.0003025982,0.00022122567,0.00042493435,9.599493e-7,0.00019479993,0.00076205767],"genre_scores_gemma":[0.46578273,6.7263306e-7,0.53400564,0.00014785964,0.000042738782,0.00001463813,1.7169268e-7,0.000004172932,0.0000013448741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982904,0.00009610429,0.00024742665,0.0005995007,0.00036774602,0.00039881328],"domain_scores_gemma":[0.9973885,0.001511737,0.00009241954,0.00046414463,0.0003960555,0.00014713529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034694516,0.00014351965,0.00014250276,0.00012730237,0.0005468989,0.00039981084,0.0011584635,0.000045263016,0.000002329787],"category_scores_gemma":[0.0017162067,0.00011833753,0.00002167867,0.0012155767,0.0015711299,0.00088245457,0.00046677465,0.000093035014,0.0000059702834],"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.000019644616,0.000025714367,0.000014732355,0.000029603569,0.0000014422931,7.3009494e-7,0.00047889052,0.0043677846,0.00058737386,0.93826467,5.0359e-7,0.0562089],"study_design_scores_gemma":[0.00038497295,0.00016253625,0.00022020827,0.00002731734,0.000002256846,0.000011541961,0.000004539237,0.41497228,0.0032541445,0.5808232,0.00002395636,0.00011309771],"about_ca_topic_score_codex":8.733136e-7,"about_ca_topic_score_gemma":1.4856757e-7,"teacher_disagreement_score":0.4313638,"about_ca_system_score_codex":0.000056663863,"about_ca_system_score_gemma":0.00018090269,"threshold_uncertainty_score":0.57888937},"labels":[],"label_agreement":null},{"id":"W2154866826","doi":"10.1016/j.tcs.2013.12.018","title":"Restriction categories as enriched categories","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Australian Research Council","keywords":"Computer science; Mathematics; Linguistics; Natural language processing; Philosophy","score_opus":0.015895323894086648,"score_gpt":0.28641501998191393,"score_spread":0.2705196960878273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154866826","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.76252896,0.000017841374,0.2134331,0.0028893095,0.00097024,0.0002705124,4.6505167e-7,0.0002625427,0.019627031],"genre_scores_gemma":[0.9833619,0.0000060179236,0.015824387,0.00044091025,0.00018414421,0.000035414352,8.8001315e-7,0.000010216541,0.00013612956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827355,0.00014250983,0.00027448183,0.0004257465,0.0003511159,0.00053261506],"domain_scores_gemma":[0.9983935,0.0006387387,0.000069605456,0.0005017343,0.00020944737,0.00018700918],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069231907,0.00016723742,0.00022843297,0.00012986174,0.00044487324,0.00014448987,0.00074247364,0.000118814,0.0013144155],"category_scores_gemma":[0.0005525681,0.00012869855,0.00004686845,0.00059183454,0.00595781,0.00032553682,0.0003232209,0.0002441553,0.0007414313],"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.0000059270587,0.00004855338,0.00012408628,0.0000063695784,0.000005688265,0.00000890875,0.00059148786,0.0000010129451,0.000736877,0.99551016,0.00039417105,0.00256675],"study_design_scores_gemma":[0.00012244587,0.00022516587,0.0010640724,0.0000033322378,0.000010382456,0.000096526484,0.0000791799,0.0017533363,0.0039904644,0.9924169,0.00007809303,0.00016007813],"about_ca_topic_score_codex":0.000055328805,"about_ca_topic_score_gemma":0.0000019832535,"teacher_disagreement_score":0.22083294,"about_ca_system_score_codex":0.00004795514,"about_ca_system_score_gemma":0.00013142101,"threshold_uncertainty_score":0.9995985},"labels":[],"label_agreement":null},{"id":"W2155175290","doi":"10.1016/j.tcs.2012.03.021","title":"Euclidean chains and their shortcuts","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; University of Hong Kong","keywords":"Computer science; Combinatorics; Euclidean geometry; Euclidean distance; Mathematics; Algebra over a field; Algorithm; Artificial intelligence; Pure mathematics; Geometry","score_opus":0.01138904384297347,"score_gpt":0.2426906368052338,"score_spread":0.23130159296226033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155175290","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.09871715,0.00012001571,0.8969374,0.0010654406,0.00064735784,0.00008823559,7.197933e-7,0.000123165,0.00230057],"genre_scores_gemma":[0.9251858,0.0000058460164,0.07365341,0.0007996422,0.00031809747,0.0000034691118,8.5251315e-7,0.000004024008,0.000028858416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851096,0.0000718715,0.00017029195,0.00040133393,0.00034373096,0.00050180126],"domain_scores_gemma":[0.9988902,0.00019837797,0.000036545745,0.00039438985,0.00010664584,0.0003738166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564635,0.00014180467,0.0001272479,0.00017645306,0.0003978829,0.0003014864,0.00082942017,0.000032876935,0.000019031722],"category_scores_gemma":[0.000051721756,0.00010619865,0.000033611715,0.00089222274,0.000939327,0.0010933729,0.00077308447,0.000109621586,0.000038474896],"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.0000012804733,0.00003449953,0.00016389218,0.000002092598,0.0000019319518,6.3772495e-7,0.00066639605,0.000073487856,0.0006541699,0.93076354,0.000072818206,0.067565225],"study_design_scores_gemma":[0.0001604872,0.00013207835,0.00970979,0.000011709231,0.0000026628225,0.00012598156,0.000012024852,0.87999505,0.0096894475,0.09830839,0.0015555788,0.0002968037],"about_ca_topic_score_codex":9.3135145e-7,"about_ca_topic_score_gemma":2.0979753e-7,"teacher_disagreement_score":0.87992156,"about_ca_system_score_codex":0.00002750141,"about_ca_system_score_gemma":0.00005537076,"threshold_uncertainty_score":0.4330655},"labels":[],"label_agreement":null},{"id":"W2155195622","doi":"10.1016/j.tcs.2005.12.003","title":"Combinatorial properties of smooth infinite words","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"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":"Bijection; Mathematics; Combinatorics; Mixing (physics); Monoid; Class (philosophy); Fixed point; Palindrome; Combinatorial algorithms; Computation; Free monoid; Point (geometry); Discrete mathematics; Computer science; Algorithm","score_opus":0.008293644474209383,"score_gpt":0.20828282649396776,"score_spread":0.19998918201975838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155195622","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.3242455,0.00008273322,0.6681175,0.0003066938,0.0011297936,0.00011487136,9.782168e-7,0.00022539461,0.0057764817],"genre_scores_gemma":[0.9710617,0.0000014925573,0.028578222,0.00013692706,0.00020279875,0.0000044332282,3.0163127e-7,0.0000072693883,0.000006823749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977281,0.00009881544,0.00037444924,0.00052626745,0.0007729877,0.0004993787],"domain_scores_gemma":[0.9986167,0.0001287077,0.00010711947,0.00084144797,0.00018421603,0.00012180619],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001303448,0.00017710208,0.00025128797,0.00019848702,0.0002344257,0.00029399537,0.0026544963,0.00005253349,0.00001915593],"category_scores_gemma":[0.000050838655,0.00013265474,0.00007479232,0.0012093033,0.0034318161,0.00066803105,0.0010640426,0.00014354102,0.00003275072],"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.000008002539,0.00009378379,0.00007523691,0.000009935963,0.0000017664809,0.0000041960047,0.00019177499,0.00006813852,0.006984493,0.9827937,0.000025053883,0.009743951],"study_design_scores_gemma":[0.0003490275,0.00015526055,0.0012527633,0.000062506515,0.0000035345613,0.000013836027,0.000005727068,0.21466516,0.06431384,0.7187549,0.00018416258,0.00023927497],"about_ca_topic_score_codex":0.000020949374,"about_ca_topic_score_gemma":2.9122893e-7,"teacher_disagreement_score":0.6468162,"about_ca_system_score_codex":0.000034115863,"about_ca_system_score_gemma":0.00013690903,"threshold_uncertainty_score":0.9992803},"labels":[],"label_agreement":null},{"id":"W2155834001","doi":"10.1016/j.tcs.2015.05.031","title":"A framework for non-interactive instance-dependent commitment schemes (NIC)","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Variety (cybernetics); Computer science; Theoretical computer science; Closure (psychology); Abstraction; Zero-knowledge proof; Artificial intelligence; Algorithm; Cryptography","score_opus":0.025976171992434783,"score_gpt":0.3073404757690739,"score_spread":0.2813643037766391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155834001","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.007826477,0.000040992796,0.98714083,0.0013292569,0.001438689,0.00046258394,0.000015819936,0.00020119878,0.001544127],"genre_scores_gemma":[0.5388308,0.0000026258178,0.460418,0.00059658877,0.00011541412,0.000028924896,0.000001499614,0.000005181564,9.578877e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708843,0.000083680345,0.00031041662,0.0009368904,0.0008801614,0.00070041703],"domain_scores_gemma":[0.997089,0.00054799503,0.00010774399,0.001276635,0.00041321293,0.0005654135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018432542,0.0002427574,0.00027859324,0.00019710652,0.00038476818,0.0006926179,0.0033751682,0.00008042979,0.000012330219],"category_scores_gemma":[0.00026461467,0.00020097241,0.000119111995,0.0010592893,0.0017009169,0.001406483,0.0016334055,0.00030928143,0.00005583784],"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.000047544152,0.00016195972,0.000051749088,0.000006849493,0.00000915231,0.000006817855,0.0012797895,0.000020494459,0.000038743525,0.9823398,0.00031939955,0.015717726],"study_design_scores_gemma":[0.00051874784,0.00045080247,0.000106872896,0.0000543673,0.0000056580543,0.000016492393,0.000048756905,0.20060013,0.0039203884,0.79224735,0.0017588321,0.0002715718],"about_ca_topic_score_codex":0.000003845195,"about_ca_topic_score_gemma":0.0000013257174,"teacher_disagreement_score":0.5310043,"about_ca_system_score_codex":0.00012230578,"about_ca_system_score_gemma":0.00025142176,"threshold_uncertainty_score":0.8195417},"labels":[],"label_agreement":null},{"id":"W2156139008","doi":"10.1016/j.tcs.2012.02.030","title":"State complexity of combined operations with two basic operations","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"State (computer science); Component (thermodynamics); Upper and lower bounds; Computer science; Computational complexity theory; Mathematics; Theoretical computer science; Algorithm","score_opus":0.020934576738689207,"score_gpt":0.2652000572899269,"score_spread":0.2442654805512377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156139008","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.29570255,0.000014484062,0.70231026,0.0005634609,0.00023421332,0.00015463894,0.000004915358,0.00012481157,0.00089063647],"genre_scores_gemma":[0.7499924,0.0000011227802,0.24955651,0.00037537742,0.000050079674,0.000007819509,0.0000018909997,0.000006323673,0.000008513686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997891,0.00015672448,0.00031422684,0.00042605074,0.0006062598,0.0006057303],"domain_scores_gemma":[0.99827534,0.00014528928,0.000040678435,0.0009454964,0.00026491092,0.00032830818],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014273209,0.0001831536,0.00024451202,0.00015948439,0.00052232586,0.00031470394,0.0018624205,0.000022065307,0.00007050279],"category_scores_gemma":[0.000036708327,0.00013149166,0.000045889934,0.0011842635,0.004538019,0.001596249,0.00074556365,0.00015151703,0.000052507865],"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.0000072070166,0.00017262256,0.00021191612,0.000004140381,0.0000057857637,0.0000014023746,0.0009548565,0.002681272,0.0015706521,0.9908496,0.000010687891,0.0035298294],"study_design_scores_gemma":[0.00052714476,0.00032140577,0.004530884,0.00003112424,0.0000071596523,0.000042031046,0.000016100117,0.9019794,0.01740473,0.074860506,0.000017262197,0.000262262],"about_ca_topic_score_codex":0.000025897465,"about_ca_topic_score_gemma":0.000008568419,"teacher_disagreement_score":0.9159891,"about_ca_system_score_codex":0.000039986866,"about_ca_system_score_gemma":0.00016076598,"threshold_uncertainty_score":0.99817103},"labels":[],"label_agreement":null},{"id":"W2156204758","doi":"10.1016/j.tcs.2004.09.038","title":"Aspects of shuffle and deletion on trajectories","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Decidability; Word (group theory); Context (archaeology); Generalization; Variable (mathematics); Sequence (biology); Constraint (computer-aided design); Focus (optics); Catenation; Binary number; Computer science; Palindrome; Context-free language; Quotient; Integer (computer science); Morphism; Mathematics; Algorithm; Discrete mathematics; Arithmetic; Combinatorics; Artificial intelligence; Programming language; Rule-based machine translation","score_opus":0.007725269626223187,"score_gpt":0.2393898409633678,"score_spread":0.2316645713371446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156204758","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.9171789,0.000024732608,0.07806081,0.00014029184,0.000082348415,0.00004553967,8.0550416e-7,0.000009695745,0.0044568405],"genre_scores_gemma":[0.994843,0.0000058108612,0.0048489072,0.00020329235,0.0000915744,6.18758e-7,0.0000018271564,0.0000023540356,0.0000026155074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935454,0.00001997543,0.000090897665,0.00025604712,0.00012335171,0.00015519962],"domain_scores_gemma":[0.9997129,0.000018404031,0.000024351975,0.00013322112,0.000047954654,0.0000631901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026289077,0.000068573274,0.00007690821,0.000024158175,0.000082554485,0.000020801623,0.00018130138,0.00004022765,0.0000043732744],"category_scores_gemma":[0.00006207123,0.000048155,0.00002314407,0.00011923966,0.0013969118,0.000002812555,0.00014853034,0.00004577495,0.0000036697334],"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.000025853946,0.0000359353,0.000103091326,0.000003528179,0.0000018790951,0.0000010718801,0.000020725989,0.00012563326,0.18747865,0.8071505,0.0000040168457,0.005049156],"study_design_scores_gemma":[0.000423972,0.0027231046,0.008123254,0.000033706518,0.0000044814255,0.000023480365,0.000008263304,0.0010458167,0.86706835,0.12013006,0.00022957704,0.00018590408],"about_ca_topic_score_codex":8.627153e-7,"about_ca_topic_score_gemma":4.1127032e-7,"teacher_disagreement_score":0.6870204,"about_ca_system_score_codex":0.000006276861,"about_ca_system_score_gemma":0.00003027989,"threshold_uncertainty_score":0.51469797},"labels":[],"label_agreement":null},{"id":"W2156537685","doi":"10.1016/j.tcs.2015.04.004","title":"On the expressivity of time-varying graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Institute for Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Rendering (computer graphics); Algebraic number; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.017447829726501374,"score_gpt":0.24559491417567908,"score_spread":0.2281470844491777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156537685","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.07164094,0.00002160369,0.9132002,0.0009833093,0.00044695352,0.00014621211,0.0000033914757,0.000097054995,0.013460367],"genre_scores_gemma":[0.9879159,5.3156776e-7,0.011610658,0.00041457036,0.000036841102,0.000005588898,2.9283217e-7,0.0000038403446,0.000011779532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977954,0.00016836682,0.00025416497,0.00046134673,0.000939158,0.0003815848],"domain_scores_gemma":[0.9978918,0.00042973759,0.000104695704,0.0010715144,0.00026746705,0.00023482704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023907858,0.00013836841,0.00019921966,0.0000851986,0.00023665547,0.00024275489,0.003016148,0.00003517597,0.000015935007],"category_scores_gemma":[0.00021711673,0.000082273116,0.000064863016,0.0011167007,0.0020515781,0.00040329367,0.00071493175,0.00015576302,0.00011029403],"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.000006066769,0.000047655893,0.000015148744,0.0000025010265,0.0000022052423,0.000003942552,0.00031464215,0.0004446916,0.00063287915,0.9935076,0.00067975745,0.0043428782],"study_design_scores_gemma":[0.00020130348,0.00020763923,0.00012962522,0.00006255127,0.0000017646124,0.000015550899,0.0000051360494,0.60398567,0.00757518,0.38752225,0.00014203764,0.00015132519],"about_ca_topic_score_codex":0.0000044669096,"about_ca_topic_score_gemma":6.3995564e-8,"teacher_disagreement_score":0.91627496,"about_ca_system_score_codex":0.000028772067,"about_ca_system_score_gemma":0.0001234718,"threshold_uncertainty_score":0.75591254},"labels":[],"label_agreement":null},{"id":"W2157637221","doi":"10.1016/j.tcs.2004.09.008","title":"Mergible states in large NFA","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"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; University of Prince Edward Island","funders":"","keywords":"Parameterized complexity; Regular language; Constant (computer programming); Automaton; Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Finite-state machine; Deterministic automaton; Discrete mathematics; Büchi automaton; State (computer science); Computer science; Combinatorics; Algorithm; Theoretical computer science; Automata theory; Programming language","score_opus":0.005756027207093133,"score_gpt":0.23843631340741395,"score_spread":0.2326802862003208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157637221","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.17090717,0.00004216259,0.82523656,0.0014506263,0.0003810419,0.00009924438,0.0000013907772,0.00023080631,0.0016509973],"genre_scores_gemma":[0.8928275,0.000008041769,0.10603155,0.0010622558,0.00005233115,0.000005428138,7.646482e-7,0.000006614768,0.0000055014793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975165,0.00006647077,0.00027700418,0.00071116746,0.0005845096,0.00084430637],"domain_scores_gemma":[0.99870867,0.00013244097,0.00004465194,0.0008137345,0.00007261805,0.00022789591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927625,0.00017438075,0.00020179753,0.00027813012,0.00024808367,0.00038463334,0.002768507,0.00004460367,0.000043933298],"category_scores_gemma":[0.00004501286,0.00014088581,0.000051528332,0.0017594333,0.0012331102,0.00096745766,0.0012257127,0.0002031238,0.00018628302],"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.0000028036234,0.00010432203,0.000072331895,0.0000034212353,0.0000011414542,0.00003733234,0.0008390143,0.0010521831,0.0003435457,0.99015486,0.000011661734,0.0073773977],"study_design_scores_gemma":[0.00047496884,0.00010452101,0.0012693809,0.000033831562,8.931443e-7,0.000026238295,0.000017619768,0.27578261,0.005831804,0.716136,0.00012092631,0.00020119366],"about_ca_topic_score_codex":0.000013466616,"about_ca_topic_score_gemma":0.0000036618308,"teacher_disagreement_score":0.7219204,"about_ca_system_score_codex":0.000102745165,"about_ca_system_score_gemma":0.00015105812,"threshold_uncertainty_score":0.57451564},"labels":[],"label_agreement":null},{"id":"W2158592145","doi":"10.1016/j.tcs.2007.10.029","title":"A characterization of fine words over a finite alphabet","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"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":"Lexicographical order; Word (group theory); Prefix; Characterization (materials science); Mathematics; Alphabet; Combinatorics; Aperiodic graph; Combinatorics on words; Discrete mathematics; Linguistics","score_opus":0.006842940091432575,"score_gpt":0.23709594725084926,"score_spread":0.23025300715941668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158592145","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.34444183,0.000006395889,0.6541424,0.00016322908,0.00033401808,0.00007498594,0.000001981159,0.00010755389,0.00072764384],"genre_scores_gemma":[0.92669255,0.0000017394188,0.072684616,0.0004897396,0.00011030836,0.0000016711841,0.0000020053258,0.000006544266,0.000010802788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978794,0.0000530087,0.00037673602,0.0005120465,0.00065549236,0.00052333996],"domain_scores_gemma":[0.9983948,0.00036608087,0.00013051914,0.0007723078,0.00013937232,0.00019695217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025915715,0.00015656823,0.00021319921,0.00027064924,0.00015698327,0.00016443351,0.001957328,0.000051922954,0.000075676595],"category_scores_gemma":[0.0000880868,0.00012834829,0.00006522641,0.0016201364,0.0015459653,0.0007307532,0.00083095423,0.00012711236,0.00002958411],"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.000010090227,0.000060279395,0.00011387239,0.0000064312226,0.000002566937,0.000008816783,0.00045242847,0.000010505779,0.051955137,0.87280935,0.0000044558255,0.07456604],"study_design_scores_gemma":[0.0004250478,0.00029138848,0.025232494,0.00007615341,0.0000055118976,0.000026482583,0.0000045429147,0.70179725,0.14191222,0.12967904,0.00021408482,0.00033578125],"about_ca_topic_score_codex":0.0000019511642,"about_ca_topic_score_gemma":5.0677517e-7,"teacher_disagreement_score":0.7431303,"about_ca_system_score_codex":0.000031548065,"about_ca_system_score_gemma":0.00007270784,"threshold_uncertainty_score":0.56961733},"labels":[],"label_agreement":null},{"id":"W2159035200","doi":"10.1016/j.tcs.2010.04.007","title":"Active learning in heteroscedastic noise","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Nemzeti Kutatási és Technológiai Hivatal; Magyar Tudományos Akadémia; Hungarian Scientific Research Fund","keywords":"Logarithm; Mathematics; Asymptotically optimal algorithm; Variance (accounting); Heteroscedasticity; Conjecture; Sample (material); Simple (philosophy); Distribution (mathematics); Sample size determination; Mathematical optimization; Applied mathematics; Statistics; Discrete mathematics; Mathematical analysis","score_opus":0.004437595498572343,"score_gpt":0.24734009686251593,"score_spread":0.2429025013639436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159035200","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.28402326,0.0000021942685,0.7109817,0.0006724023,0.0008245504,0.00007159002,1.9192069e-7,0.0002266364,0.0031974379],"genre_scores_gemma":[0.88861096,6.005423e-7,0.11098624,0.0002342078,0.00013594428,0.000004704133,2.912335e-7,0.000006671304,0.000020407277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780256,0.00011965001,0.0002095259,0.00071952195,0.0005313396,0.0006174215],"domain_scores_gemma":[0.99873734,0.0003037531,0.00005632591,0.0005649883,0.00008704463,0.00025055013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012865597,0.00016829272,0.00018018314,0.00027348765,0.00033106538,0.0004092822,0.0021453619,0.00005750727,0.000047547488],"category_scores_gemma":[0.00032577253,0.00014070865,0.0000471233,0.0012059109,0.0014566709,0.0006043421,0.0009400599,0.0011075082,0.00012106218],"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.0000041682833,0.000050612503,0.00082245766,0.0000027950791,9.307132e-7,0.000020354722,0.00054292445,0.0012517703,0.004852966,0.8217667,0.0000026579291,0.17068169],"study_design_scores_gemma":[0.00023863927,0.00014730843,0.013296335,0.000015363374,9.572766e-7,0.000043586926,0.000003999212,0.9512006,0.002747467,0.031955767,0.00014116669,0.00020880782],"about_ca_topic_score_codex":0.000010434485,"about_ca_topic_score_gemma":0.0000026466723,"teacher_disagreement_score":0.94994885,"about_ca_system_score_codex":0.000028632001,"about_ca_system_score_gemma":0.00010795365,"threshold_uncertainty_score":0.57379323},"labels":[],"label_agreement":null},{"id":"W2161403911","doi":"10.1016/j.tcs.2007.07.015","title":"Adaptive searching in succinctly encoded binary relations and tree-structured documents","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Conjunctive query; Binary relation; Binary number; XML; Intersection (aeronautics); Theoretical computer science; Representation (politics); Binary tree; Information retrieval; Relation (database); Data mining; Mathematics; Algorithm; Discrete mathematics; Relational database; World Wide Web","score_opus":0.008911253992056412,"score_gpt":0.2664774614759441,"score_spread":0.2575662074838877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161403911","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.15397368,0.00003807038,0.843432,0.00035550373,0.00024311393,0.00014484095,0.0000015002703,0.00007765371,0.0017336464],"genre_scores_gemma":[0.7143939,0.0000035289831,0.28540218,0.00014655007,0.00004071652,0.000001495296,9.566576e-7,0.000003818376,0.0000068486397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977008,0.00010144525,0.00028872353,0.00070579094,0.0006216787,0.0005815438],"domain_scores_gemma":[0.99864715,0.0003719794,0.000057306817,0.0005483704,0.00008652196,0.00028867146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016443543,0.00015988105,0.00016858739,0.00036825298,0.00042593418,0.00030766623,0.0013692499,0.000055600576,0.000015335867],"category_scores_gemma":[0.000065721884,0.00012739834,0.000026539075,0.001201112,0.001194872,0.0013603583,0.0017119037,0.00030763104,0.00001509219],"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.0000187817,0.00003610618,0.0007409209,0.0000020383998,0.0000017258285,0.00004969975,0.00083202234,0.0001701358,0.0009540371,0.8802775,0.000020407651,0.116896614],"study_design_scores_gemma":[0.0003626225,0.00017493148,0.04595074,0.000043560096,0.0000016154419,0.000036046094,0.000020157942,0.7999246,0.0013009295,0.15195638,0.000042056487,0.00018636503],"about_ca_topic_score_codex":0.00002584893,"about_ca_topic_score_gemma":0.000010697855,"teacher_disagreement_score":0.79975444,"about_ca_system_score_codex":0.00008173695,"about_ca_system_score_gemma":0.00009232801,"threshold_uncertainty_score":0.51951534},"labels":[],"label_agreement":null},{"id":"W2161797215","doi":"10.1016/s0304-3975(99)00021-3","title":"Automata of asynchronous behaviors","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automaton; Asynchronous communication; Computer science; Theoretical computer science; Programming language; Computer network","score_opus":0.01062701085896973,"score_gpt":0.2832916232939664,"score_spread":0.2726646124349967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161797215","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.14033167,0.000009229396,0.8503346,0.0001330885,0.00030088887,0.0001091674,9.685715e-7,0.00020015166,0.008580226],"genre_scores_gemma":[0.52329755,0.0000028712273,0.47659308,0.00007232465,0.000022034501,0.0000027723186,1.8078609e-7,0.0000030152044,0.0000061803416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794215,0.0001172389,0.00032700525,0.000519469,0.0006852717,0.00040886685],"domain_scores_gemma":[0.9982825,0.00009019706,0.00007003541,0.0012590036,0.00012581135,0.0001724455],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016928358,0.00012976366,0.00017793372,0.00014160738,0.00019411194,0.000144407,0.0032916039,0.000046961588,0.00024089329],"category_scores_gemma":[0.000052799038,0.00011139446,0.000054035925,0.0012134028,0.0028349543,0.0008353902,0.0004413018,0.00012920628,0.00015408696],"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.0000029150037,0.000052389067,0.000022105132,0.000003110248,7.822595e-7,0.0000018635029,0.00019419931,0.000100974125,0.00058181677,0.7049486,0.00000654924,0.29408473],"study_design_scores_gemma":[0.00019097935,0.0003443928,0.005879599,0.000024012452,0.000004602869,0.000056739995,0.0000021838546,0.8912618,0.03554183,0.066315055,0.0001620186,0.00021674726],"about_ca_topic_score_codex":0.0000040913255,"about_ca_topic_score_gemma":7.760488e-8,"teacher_disagreement_score":0.89116085,"about_ca_system_score_codex":0.00004751268,"about_ca_system_score_gemma":0.000113091366,"threshold_uncertainty_score":0.99987876},"labels":[],"label_agreement":null},{"id":"W2162312358","doi":"10.1016/j.tcs.2008.11.008","title":"Local edge colouring of Yao-like subgraphs of Unit Disk Graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Unit disk graph; Unit disk; Graph; Discrete mathematics; Partition (number theory); Constant (computer programming); Locality; Computer science","score_opus":0.021918745402650586,"score_gpt":0.27866484541387604,"score_spread":0.25674610001122544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162312358","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.3112271,0.00005667349,0.6870018,0.000076865654,0.00023406545,0.0001595711,0.0000028373654,0.00008475335,0.0011562606],"genre_scores_gemma":[0.9189502,0.000026657843,0.08090069,0.000076223834,0.000017393075,0.000005956015,4.9557383e-7,0.00001158697,0.000010822031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606484,0.00025301712,0.0005605866,0.0008172225,0.0014496474,0.00085468567],"domain_scores_gemma":[0.9966839,0.00068386074,0.00017710766,0.0014690009,0.00058456603,0.0004015534],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018823012,0.00024762892,0.00045133327,0.00071437785,0.00042973945,0.00005073342,0.0046905666,0.000075563454,0.000029765934],"category_scores_gemma":[0.000114683105,0.00021052318,0.00017799197,0.004402285,0.018992469,0.000766309,0.0019403092,0.00034025122,0.000017010483],"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.000035365494,0.00014273346,0.0013212896,0.00002366546,0.000009079926,0.000029349509,0.0006008275,0.00058985583,0.0024945189,0.9861984,0.0000121721205,0.008542734],"study_design_scores_gemma":[0.00060851057,0.00082689454,0.008147337,0.000082042534,0.0000069771677,0.0001467223,0.00003102982,0.20287141,0.078866795,0.707971,0.000044231478,0.00039708643],"about_ca_topic_score_codex":0.000008534601,"about_ca_topic_score_gemma":0.0000010725948,"teacher_disagreement_score":0.60772306,"about_ca_system_score_codex":0.000033642114,"about_ca_system_score_gemma":0.00026950432,"threshold_uncertainty_score":0.98367727},"labels":[],"label_agreement":null},{"id":"W2162572810","doi":"10.1016/s0304-3975(99)00277-7","title":"Shuffle and scattered deletion closure of languages","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Closure (psychology); Computer science; Programming language; Mathematics; Linguistics; Combinatorics; Philosophy; Political science","score_opus":0.004512639951644926,"score_gpt":0.24192520145966326,"score_spread":0.23741256150801834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162572810","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.987003,0.00009322282,0.010072593,0.00013220613,0.00002695741,0.00004469407,0.0000018806273,0.000009974386,0.002615418],"genre_scores_gemma":[0.99419755,0.00001511454,0.005407706,0.00025742073,0.00009532839,6.2763127e-7,0.000004334751,0.0000024776832,0.000019425162],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993459,0.000037699767,0.00010149192,0.00025143192,0.0001020914,0.0001614092],"domain_scores_gemma":[0.99971086,0.000016186359,0.000019337205,0.00015317497,0.000038487546,0.000061953295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031131887,0.00006535802,0.00007942169,0.000017785133,0.00007518515,0.000022939776,0.0002174105,0.000044629007,0.000065295266],"category_scores_gemma":[0.000022398544,0.000046637448,0.000025397529,0.00010511536,0.0012825333,0.0000032355144,0.00013812976,0.00004069325,0.0000050630492],"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.000096399395,0.000089019944,0.0062447195,0.000019249534,0.000009880493,0.000003736401,0.00009396673,0.00007430746,0.5877197,0.089479215,0.00010635566,0.31606346],"study_design_scores_gemma":[0.0011443357,0.0031431837,0.10193577,0.00008589661,0.000025303176,0.00014200876,0.00004566489,0.01937634,0.8505664,0.019720655,0.0030783508,0.0007360808],"about_ca_topic_score_codex":0.0000016334147,"about_ca_topic_score_gemma":2.6013902e-7,"teacher_disagreement_score":0.31532738,"about_ca_system_score_codex":0.0000021350452,"about_ca_system_score_gemma":0.000012380774,"threshold_uncertainty_score":0.47255474},"labels":[],"label_agreement":null},{"id":"W2162678883","doi":"10.1016/j.tcs.2009.07.010","title":"A new approach to the periodicity lemma on strings with holes","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Lemma (botany); Mathematics; String (physics); Combinatorics; Discrete mathematics; Computer science; Data structure","score_opus":0.012621170148108091,"score_gpt":0.2370631779968014,"score_spread":0.2244420078486933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162678883","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.00512697,0.000009248065,0.98049194,0.0049128267,0.00014371696,0.00022599981,0.000001041655,0.00015430847,0.008933955],"genre_scores_gemma":[0.6297594,7.7512925e-7,0.36732972,0.002743092,0.00014146115,0.0000024080048,4.3596643e-7,0.000003022801,0.000019698962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744445,0.00006326824,0.00015983942,0.0008509338,0.00095966266,0.00052185677],"domain_scores_gemma":[0.9980406,0.00009217625,0.00004344001,0.0013144567,0.00008912375,0.00042017366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082389824,0.00019482308,0.00016741683,0.00011635928,0.0006610235,0.0009446484,0.0040738783,0.000031727952,0.0000108458835],"category_scores_gemma":[0.00003147915,0.00010110896,0.00003761785,0.0012421437,0.00084623613,0.0005287634,0.0008175881,0.0002396158,0.00010749855],"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.000015523055,0.00005413383,0.0000046920786,7.791334e-7,0.0000010295864,0.0000036323463,0.0005341162,0.0010848404,0.000034651068,0.8445441,0.000833989,0.1528885],"study_design_scores_gemma":[0.00048431417,0.0015286359,0.005365961,0.00007998934,0.0000054963407,0.00010265118,0.00001935386,0.9173553,0.0016299547,0.06886446,0.0040837275,0.00048015366],"about_ca_topic_score_codex":0.0000067881824,"about_ca_topic_score_gemma":2.611733e-7,"teacher_disagreement_score":0.91627043,"about_ca_system_score_codex":0.00003856521,"about_ca_system_score_gemma":0.00015804982,"threshold_uncertainty_score":0.91092664},"labels":[],"label_agreement":null},{"id":"W2163134916","doi":"10.1016/j.tcs.2015.09.025","title":"Fast rendezvous with advice","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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","keywords":"Rendezvous; Computer science; Oracle; Advice (programming); Set (abstract data type); Node (physics); Upper and lower bounds; Integer (computer science); String (physics); Algorithm; Mathematics","score_opus":0.01677587884675006,"score_gpt":0.25703540298749517,"score_spread":0.2402595241407451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163134916","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.0011110288,0.000010735262,0.96248776,0.0021576774,0.00024479243,0.00012611071,4.1771975e-7,0.00042347927,0.033438027],"genre_scores_gemma":[0.55570155,0.0000011452021,0.44344917,0.00072985963,0.00004876093,0.0000042786373,3.8564102e-7,0.0000051247175,0.000059690305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975357,0.00009609945,0.00017096724,0.00059892156,0.001056554,0.0005417253],"domain_scores_gemma":[0.99798524,0.00007773457,0.00004439159,0.0007732126,0.0004818431,0.00063755683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013787809,0.00014046885,0.00013947829,0.00015972333,0.00023942841,0.0006047863,0.0023395915,0.000031394397,0.00002574274],"category_scores_gemma":[0.00006406738,0.00009783491,0.000022756276,0.001627628,0.0019035524,0.00096657604,0.0008611476,0.00016842168,0.00017917443],"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.000008043766,0.000040342566,0.00003416284,0.0000019598997,0.0000017389657,0.000016317083,0.00071316835,0.0040686396,0.000016892871,0.9772207,0.00029361175,0.017584387],"study_design_scores_gemma":[0.00040063195,0.0004676999,0.000095475676,0.0000150094,0.0000015100261,0.000087805965,0.00001565206,0.9507339,0.00038300853,0.046894692,0.0007082392,0.00019636602],"about_ca_topic_score_codex":0.00000398102,"about_ca_topic_score_gemma":9.0293184e-7,"teacher_disagreement_score":0.9466653,"about_ca_system_score_codex":0.000060759598,"about_ca_system_score_gemma":0.0003661549,"threshold_uncertainty_score":0.70137185},"labels":[],"label_agreement":null},{"id":"W2163285607","doi":"10.1016/s0304-3975(02)00398-5","title":"Periodicity, morphisms, and matrices","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Mathematics; Conjecture; Iterated function; Combinatorics; Constant (computer programming); Word (group theory); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.006621511833063064,"score_gpt":0.22147273379972024,"score_spread":0.21485122196665718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163285607","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.12539488,0.00019636663,0.8668835,0.0004881998,0.00035984023,0.000086109154,5.530739e-7,0.00022496156,0.006365582],"genre_scores_gemma":[0.8560516,0.000016525271,0.14315894,0.00071986235,0.000037965983,0.0000027924484,8.7501775e-8,0.0000048885054,0.000007343864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806243,0.00011449521,0.00018770903,0.00065298687,0.0004889125,0.00049346645],"domain_scores_gemma":[0.9987646,0.00019202547,0.00004660704,0.0006461126,0.00007425788,0.00027642085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015733478,0.00016083354,0.00016983975,0.00015232326,0.00047647118,0.0007345366,0.0015258548,0.000039689152,0.00011414941],"category_scores_gemma":[0.00006119565,0.00012600185,0.000034319546,0.00077612314,0.0026474847,0.0006806184,0.0007393336,0.00013295293,0.00010161156],"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":[7.2466395e-7,0.000022501401,0.00010298473,0.0000039314154,0.0000018224338,0.000011681721,0.0002386975,0.0000071298796,0.00040621805,0.98210824,0.000031155472,0.0170649],"study_design_scores_gemma":[0.00024015621,0.00015298626,0.0014729107,0.000022084092,0.0000052694913,0.00023321592,0.00001418301,0.24583806,0.00468412,0.746276,0.0007365328,0.00032442622],"about_ca_topic_score_codex":0.0000018871813,"about_ca_topic_score_gemma":6.686615e-8,"teacher_disagreement_score":0.73065674,"about_ca_system_score_codex":0.000023967743,"about_ca_system_score_gemma":0.000080204605,"threshold_uncertainty_score":0.97547674},"labels":[],"label_agreement":null},{"id":"W2163677685","doi":"10.1016/s0304-3975(99)00100-0","title":"Using DNA to solve the Bounded Post Correspondence Problem","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"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":"Bounded function; Mathematics; Combinatorics; DNA; Discrete mathematics; Algorithm; Computer science; Algebra over a field; Genetics; Biology; Pure mathematics","score_opus":0.01483284745428979,"score_gpt":0.2743296738512333,"score_spread":0.2594968263969435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163677685","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.87073267,0.000021841865,0.12495256,0.0006028375,0.00013590186,0.00018768903,0.0000022414642,0.000023979743,0.0033402515],"genre_scores_gemma":[0.9600326,0.0000022290217,0.036470223,0.003180575,0.00025291234,0.000002953921,0.000002193131,0.000006396311,0.000049914044],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984581,0.00006972598,0.00017539364,0.0005371083,0.00027253374,0.00048712554],"domain_scores_gemma":[0.9991978,0.000050929215,0.000027657103,0.00041614525,0.0001261341,0.00018138278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774105,0.00014427271,0.000109948225,0.000030222975,0.0005141933,0.00019410624,0.0010702965,0.00006292429,0.00015502094],"category_scores_gemma":[0.00008023465,0.00008518716,0.000060575716,0.00040685644,0.0018058905,0.0000074794066,0.0005269754,0.00011203294,0.000085733554],"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.00021537524,0.000077569624,0.0001180666,0.00000446068,0.000008420063,0.000008406935,0.00019774702,0.0010980429,0.76399183,0.16686219,0.00015002958,0.067267865],"study_design_scores_gemma":[0.0013782583,0.007392548,0.010990493,0.00021694798,0.000060374194,0.00074436073,0.00012374253,0.24160405,0.6034977,0.09922866,0.032234296,0.0025285662],"about_ca_topic_score_codex":0.000004687497,"about_ca_topic_score_gemma":0.0000012533837,"teacher_disagreement_score":0.24050601,"about_ca_system_score_codex":0.000016740385,"about_ca_system_score_gemma":0.00009513211,"threshold_uncertainty_score":0.66538787},"labels":[],"label_agreement":null},{"id":"W2165037031","doi":"10.1016/j.tcs.2015.01.011","title":"On graphs that are not PCGs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Wheel graph; Vertex (graph theory); Graph; Path graph; Graph power; Pairwise comparison; Planar graph; Discrete mathematics; Line graph","score_opus":0.049060207401457154,"score_gpt":0.31182620543233247,"score_spread":0.2627659980308753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165037031","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.054796323,0.00002035069,0.934132,0.0021098864,0.0008386672,0.0002134204,0.0000020451982,0.0003869197,0.0075004348],"genre_scores_gemma":[0.92359906,0.000002286275,0.07435992,0.0019200719,0.00006204616,0.000011275334,3.2952448e-7,0.000012816733,0.000032192136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952436,0.00025877106,0.00022956346,0.0011387188,0.0021043143,0.001025022],"domain_scores_gemma":[0.99625665,0.0006067412,0.00009046734,0.001745828,0.00037587978,0.00092445605],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031539688,0.0002662263,0.00027237067,0.000492296,0.00042945595,0.0005895951,0.0053346544,0.00006629281,0.000024288209],"category_scores_gemma":[0.0004016283,0.00020784825,0.000096892865,0.002289241,0.0046427874,0.0010906521,0.0019287457,0.00042477524,0.00047853173],"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.000036000383,0.00007760507,0.00009751619,0.0000028074382,0.0000027788285,0.00004597865,0.00026393047,0.0002897279,0.000115451985,0.9861693,0.00021716503,0.012681767],"study_design_scores_gemma":[0.00035609896,0.00040760246,0.0006618762,0.000028490165,0.0000014463682,0.000038696126,0.000013896861,0.12385967,0.0078741005,0.8663385,0.00014605989,0.00027356567],"about_ca_topic_score_codex":0.0000015014476,"about_ca_topic_score_gemma":3.9769674e-7,"teacher_disagreement_score":0.8688027,"about_ca_system_score_codex":0.00011278059,"about_ca_system_score_gemma":0.00018673456,"threshold_uncertainty_score":0.998066},"labels":[],"label_agreement":null},{"id":"W2166582984","doi":"10.1016/j.tcs.2009.05.007","title":"On the surface area of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-star graph","year":2009,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Graph; Scroll; Node (physics); Surface (topology); Mathematics; Combinatorics; Computer science; Algorithm; Discrete mathematics; Geometry; Physics","score_opus":0.01527671044608049,"score_gpt":0.23081596269499186,"score_spread":0.21553925224891138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166582984","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.9004297,0.0007171402,0.038724046,0.0024557747,0.006320524,0.0001715195,0.00017865334,0.00038651034,0.050616093],"genre_scores_gemma":[0.9882039,0.00035701483,0.0041750926,0.0043213493,0.0020999692,0.0002825329,0.000087362045,0.0003552395,0.00011757116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9850741,0.0011232303,0.0025759952,0.0031255104,0.004660649,0.003440519],"domain_scores_gemma":[0.98886317,0.003362387,0.0021381055,0.0036933231,0.0005444993,0.0013985371],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0061445106,0.0013177712,0.00066904357,0.00055244187,0.003541946,0.0033510185,0.007350757,0.001814364,0.005958973],"category_scores_gemma":[0.0014883475,0.0016407961,0.0022616691,0.0030588822,0.006619031,0.0019129497,0.004071979,0.0026060422,0.0014868667],"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.0008029865,0.0005009214,0.000011040354,0.0003420841,0.00052284903,0.00040014807,0.0028801148,0.011067638,0.0017731689,0.95309716,0.025451947,0.0031499292],"study_design_scores_gemma":[0.0012460604,0.0028803528,0.000110739216,0.0016798968,0.00049419596,0.0013516985,0.0006716944,0.7500006,0.22027476,0.018653477,0.0010711426,0.001565385],"about_ca_topic_score_codex":0.00077221385,"about_ca_topic_score_gemma":0.00025173812,"teacher_disagreement_score":0.9344437,"about_ca_system_score_codex":0.00005117849,"about_ca_system_score_gemma":0.001457325,"threshold_uncertainty_score":0.9999574},"labels":[],"label_agreement":null},{"id":"W2166846151","doi":"10.1016/j.tcs.2013.06.003","title":"State complexity of star of union and square of union on k regular languages","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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":"State (computer science); Star (game theory); Square (algebra); Regular language; Mathematics; Component (thermodynamics); Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton; Geometry; Physics","score_opus":0.011941278949197592,"score_gpt":0.24203050426044778,"score_spread":0.2300892253112502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166846151","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.64740914,0.00003393101,0.35168323,0.0003027357,0.00006490135,0.0001236357,0.0000056568156,0.00003488611,0.00034191422],"genre_scores_gemma":[0.9440261,0.00000727699,0.055872742,0.00007108579,0.000011841076,0.0000014367835,9.1248717e-7,0.000004573199,0.0000039916395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982394,0.00024109345,0.0003351513,0.00037753733,0.0005422949,0.0002645209],"domain_scores_gemma":[0.9984839,0.00025842688,0.00017648611,0.0007231287,0.00023779087,0.00012028388],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014713157,0.00013229692,0.0002861513,0.0001779334,0.00007596215,0.000053286272,0.0011965685,0.000033885346,0.000029983576],"category_scores_gemma":[0.00004766962,0.0001002773,0.000044124135,0.0006113352,0.0045438823,0.000386805,0.00069669634,0.000092306575,0.000004408415],"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.000005506853,0.00007427509,0.00010437857,0.000047139456,0.0000035636567,0.0000011643662,0.00064743817,0.00006111803,0.011110771,0.95293504,0.000012766653,0.03499686],"study_design_scores_gemma":[0.00029950976,0.00080538646,0.02467749,0.00018690992,0.0000039402466,0.000007982149,0.00007114918,0.29726878,0.13887027,0.5376317,0.0000074474806,0.00016942217],"about_ca_topic_score_codex":0.000059328017,"about_ca_topic_score_gemma":7.139647e-7,"teacher_disagreement_score":0.41530332,"about_ca_system_score_codex":0.000014835899,"about_ca_system_score_gemma":0.000042709904,"threshold_uncertainty_score":0.9981652},"labels":[],"label_agreement":null},{"id":"W2167390667","doi":"10.1016/j.tcs.2007.05.009","title":"Formalization of the Standard Uniform random variable","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Random variable; HOL; Mathematics; Automated theorem proving; Correctness; Probabilistic logic; Random element; Algorithm; Random function; Convergence of random variables; Central limit theorem; Discrete mathematics; Computer science; Theoretical computer science; Calculus (dental); Statistics","score_opus":0.008524250274741239,"score_gpt":0.23561232784780017,"score_spread":0.22708807757305893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167390667","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.0024415567,0.000017657261,0.9775337,0.00013326468,0.0009997203,0.00022791928,3.6748418e-7,0.000084564665,0.01856128],"genre_scores_gemma":[0.9408171,0.0000010678934,0.05891722,0.00016310498,0.00007352723,0.0000016710376,2.4237272e-7,0.000003620967,0.000022451424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980314,0.00006423258,0.00033367524,0.0003233833,0.000791266,0.0004560634],"domain_scores_gemma":[0.99854046,0.000178248,0.00012888723,0.000733239,0.00029576258,0.0001233726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045554014,0.00011084176,0.00017389224,0.000093482704,0.00035951834,0.00020047328,0.0022073542,0.000047423608,0.000014435513],"category_scores_gemma":[0.00010624791,0.000064612315,0.00006129048,0.0015454694,0.0014980423,0.00049392227,0.0007397182,0.000106829866,0.000008807619],"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.000015162784,0.000019183515,0.00020139197,0.000009148548,0.0000023714315,0.0000010709714,0.00036249624,0.000117235126,0.00018914463,0.9839049,0.000018384391,0.015159501],"study_design_scores_gemma":[0.0008003585,0.00026073903,0.0008041923,0.0000145869035,0.0000066396306,0.00004038055,0.000016685522,0.1992803,0.022348149,0.77361673,0.0026172898,0.00019393078],"about_ca_topic_score_codex":0.000008250089,"about_ca_topic_score_gemma":0.0000016660116,"teacher_disagreement_score":0.93837553,"about_ca_system_score_codex":0.000052567055,"about_ca_system_score_gemma":0.00015838511,"threshold_uncertainty_score":0.55195993},"labels":[],"label_agreement":null},{"id":"W2168431435","doi":"10.1016/j.tcs.2009.08.031","title":"Theory of one-tape linear-time Turing machines","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Time hierarchy theorem; Turing machine; Probabilistic Turing machine; Non-deterministic Turing machine; DTIME; NSPACE; Super-recursive algorithm; Computer science; Nondeterministic algorithm; Time complexity; Universal Turing machine; NP; Description number; Theoretical computer science; PSPACE; Complexity class; Algorithm; Computational complexity theory; Computation","score_opus":0.007599579880102563,"score_gpt":0.23473991430566515,"score_spread":0.22714033442556258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168431435","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.13028891,0.00004959446,0.86567825,0.0011379513,0.00031112286,0.00010871369,0.0000011021721,0.00027868216,0.0021456892],"genre_scores_gemma":[0.6878503,0.0000014735474,0.3114457,0.00049432693,0.00018997861,5.7225157e-7,3.162231e-7,0.0000052747687,0.000012031472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731386,0.00016748914,0.00037917812,0.00074063556,0.00077585917,0.00062295597],"domain_scores_gemma":[0.9980854,0.00038288135,0.0001201856,0.0009899217,0.00017293534,0.00024869715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019548412,0.00023394742,0.00033557278,0.0002479138,0.00034389898,0.00019843224,0.003227566,0.000057205994,0.000034490196],"category_scores_gemma":[0.00011527127,0.00018259199,0.00011747001,0.0012205463,0.0015756272,0.00036103613,0.0008812558,0.00029577984,0.000050361665],"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.000007636224,0.00008128109,0.000007732903,0.000004846202,0.0000034721604,0.000006597757,0.00033678283,0.0018518532,0.003313643,0.7334092,0.000006153233,0.26097077],"study_design_scores_gemma":[0.00012775183,0.00029252388,0.0015316501,0.000047983398,0.0000033717442,0.00003176261,7.441423e-7,0.6660359,0.007536235,0.32420403,0.00001558677,0.00017247316],"about_ca_topic_score_codex":0.0000011095801,"about_ca_topic_score_gemma":3.436932e-8,"teacher_disagreement_score":0.66418403,"about_ca_system_score_codex":0.000022256878,"about_ca_system_score_gemma":0.000099621844,"threshold_uncertainty_score":0.7445885},"labels":[],"label_agreement":null},{"id":"W2170096365","doi":"10.1016/j.tcs.2014.10.044","title":"On a class of covering problems with variable capacities in wireless networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc 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 Lethbridge; Queen's University","funders":"","keywords":"Class (philosophy); Variable (mathematics); Computer science; Wireless; Wireless network; Mathematics; Theoretical computer science; Computer network; Telecommunications; Artificial intelligence","score_opus":0.005265615106788304,"score_gpt":0.1913742510683054,"score_spread":0.1861086359615171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170096365","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.07315615,0.0000065944205,0.9193892,0.0000920801,0.00026755192,0.00021948526,3.3671452e-7,0.00009128781,0.0067773485],"genre_scores_gemma":[0.9385173,0.0000021058177,0.061034307,0.00034508161,0.00006708339,0.000018630717,2.994001e-7,0.00001028819,0.0000049134997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974303,0.00016065955,0.00033461832,0.0006996398,0.0006846938,0.0006900356],"domain_scores_gemma":[0.99798304,0.0006523554,0.00011430001,0.000944123,0.00013392471,0.00017228139],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019105411,0.00020738455,0.0003280993,0.00018004539,0.0001433035,0.0002072778,0.0021415928,0.00006971603,0.000011334477],"category_scores_gemma":[0.00003773417,0.00015843431,0.000030674044,0.0016453391,0.002832598,0.000488932,0.0006109787,0.00033061753,0.0000059308854],"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.000012355548,0.000045561046,0.00007633919,0.000012081931,0.000001965986,0.0000025532308,0.00024577312,0.24106002,0.00006171369,0.75317353,0.000007974577,0.00530016],"study_design_scores_gemma":[0.00031933686,0.0005664291,0.00025259206,0.00023832322,0.0000017607298,0.000013931129,0.000003181221,0.89702356,0.00045900568,0.10090394,0.000025645837,0.00019227467],"about_ca_topic_score_codex":0.000015900483,"about_ca_topic_score_gemma":0.0000056030676,"teacher_disagreement_score":0.86536115,"about_ca_system_score_codex":0.000071638155,"about_ca_system_score_gemma":0.00010168064,"threshold_uncertainty_score":0.99988115},"labels":[],"label_agreement":null},{"id":"W2170431684","doi":"10.1016/j.tcs.2013.11.031","title":"Fixed-orientation equilateral triangle matching of point sets","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Equilateral triangle; Combinatorics; Mathematics; General position; Vertex (graph theory); Discrete mathematics; Delaunay triangulation; Graph; Geometry","score_opus":0.009409666610581204,"score_gpt":0.2569229396507219,"score_spread":0.24751327304014067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170431684","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.285155,0.000009965751,0.7124199,0.0006898946,0.00051705044,0.0001610966,7.505823e-7,0.00006719486,0.00097913],"genre_scores_gemma":[0.76582205,8.4332163e-7,0.2337884,0.00029856907,0.00006619043,0.000007596518,0.0000023696143,0.000003433367,0.000010539567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807835,0.00009847227,0.000366997,0.00046857476,0.00064717303,0.00034040833],"domain_scores_gemma":[0.9987221,0.00021394793,0.000115088835,0.00043569627,0.00034316475,0.00017001106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010123084,0.00012987391,0.00017982612,0.00025444137,0.00022164219,0.0003481045,0.0010807903,0.000035592715,0.00013679874],"category_scores_gemma":[0.000058024005,0.00010989989,0.00006657135,0.0011492104,0.0005794812,0.0015556676,0.0005430013,0.00009947111,0.00011632128],"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.0000034587779,0.00004578811,0.000026283547,0.00000699063,0.0000029512878,0.0000014146934,0.00072254264,0.0026941856,0.007030276,0.9323271,0.00007532379,0.057063665],"study_design_scores_gemma":[0.00023242565,0.00015560769,0.0028021063,0.000017225,0.0000022683955,0.000019165944,0.000008529483,0.57861155,0.017187204,0.40081683,0.000015653242,0.00013143512],"about_ca_topic_score_codex":0.000012586615,"about_ca_topic_score_gemma":2.726862e-7,"teacher_disagreement_score":0.57591736,"about_ca_system_score_codex":0.000043258584,"about_ca_system_score_gemma":0.000106218635,"threshold_uncertainty_score":0.44815874},"labels":[],"label_agreement":null},{"id":"W2170840812","doi":"10.1016/j.tcs.2006.08.045","title":"The degree distribution of the generalized duplication model","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree distribution; Degree (music); Gene duplication; Combinatorics; Node (physics); Mathematics; Graph; Discrete mathematics; Preferential attachment; Complex network; Gene; Physics","score_opus":0.009081162169139182,"score_gpt":0.21888527224500479,"score_spread":0.2098041100758656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170840812","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.27781227,0.000052429943,0.7203741,0.0005352315,0.000097178614,0.00009014036,0.0000053533,0.0000037207944,0.0010295835],"genre_scores_gemma":[0.9966345,0.000011163787,0.0031025507,0.00010553757,0.00009630981,0.0000035939092,0.000011365407,0.0000024927365,0.00003248744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999376,0.000022344302,0.00015641146,0.00012724487,0.00015305435,0.00016496492],"domain_scores_gemma":[0.99940103,0.000013659137,0.00006271676,0.00040687592,0.00008930567,0.000026384596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668489,0.000057537683,0.000046716978,0.000005073483,0.0002988755,0.0000418718,0.00055867754,0.000037171227,8.556061e-7],"category_scores_gemma":[0.000015798836,0.000030051377,0.00004553768,0.00012790212,0.0015545507,0.0000032093994,0.00026897242,0.000044223834,0.0000013607062],"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.000009685841,0.0000099987565,0.00003287752,0.0000013261658,0.0000015927714,1.32869e-8,0.0000068857576,0.0068184454,0.016784173,0.9697698,0.0005220424,0.0060431734],"study_design_scores_gemma":[0.000120616925,0.000032377204,0.0021768678,0.0000036233716,0.000004453655,0.0000033386007,0.0000013423972,0.8616555,0.036838252,0.09828073,0.0008182514,0.000064672975],"about_ca_topic_score_codex":0.0000029341716,"about_ca_topic_score_gemma":0.000002508282,"teacher_disagreement_score":0.87148905,"about_ca_system_score_codex":0.000009581366,"about_ca_system_score_gemma":0.000052412517,"threshold_uncertainty_score":0.57278067},"labels":[],"label_agreement":null},{"id":"W2171278552","doi":"10.1016/j.tcs.2011.06.012","title":"The Černý conjecture for one-cluster automata with prime length cycle","year":2011,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Conjecture; Prime (order theory); Combinatorics; Cluster (spacecraft); Automaton; Mathematics; Computer science; Theoretical computer science","score_opus":0.013767798483434209,"score_gpt":0.23932951504386277,"score_spread":0.22556171656042856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171278552","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.009183946,0.00012868141,0.981173,0.003254412,0.0016975596,0.0012316456,0.000017391863,0.0007627476,0.0025506115],"genre_scores_gemma":[0.75457937,0.0000186274,0.24385355,0.0009815826,0.00035427688,0.000120342556,0.0000061629967,0.000039739327,0.00004632468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99486244,0.00025384303,0.00053820765,0.0019086618,0.0011530871,0.0012837341],"domain_scores_gemma":[0.9939341,0.0012345035,0.0003413849,0.0037321546,0.00036619234,0.0003916448],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003652096,0.0006049493,0.0005782064,0.00017513106,0.0012843347,0.0021076447,0.010867484,0.00026393586,0.000017137505],"category_scores_gemma":[0.00012816238,0.0003584546,0.00021204492,0.0005708523,0.0055823955,0.00054167607,0.007953278,0.0008682346,0.000073344905],"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.000049683873,0.0000922648,0.0000045193597,0.00003973039,0.00003616567,0.000006254555,0.00079045113,0.00021644801,0.000033743432,0.952824,0.00015664283,0.045750074],"study_design_scores_gemma":[0.0003917889,0.00032273933,0.00015447388,0.00014875674,0.000024130786,0.00004420925,0.0000056211748,0.46698862,0.0018380551,0.5292242,0.0003935315,0.00046387798],"about_ca_topic_score_codex":0.000010033082,"about_ca_topic_score_gemma":0.0000031772415,"teacher_disagreement_score":0.7453954,"about_ca_system_score_codex":0.00011907539,"about_ca_system_score_gemma":0.0006372516,"threshold_uncertainty_score":0.99988675},"labels":[],"label_agreement":null},{"id":"W2172943111","doi":"10.1016/j.tcs.2013.09.026","title":"Accelerated training of max-margin Markov networks with kernels","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Google; University of Chicago; National Science Foundation","keywords":"Margin (machine learning); Computation; Markov chain; Convergence (economics); Projection (relational algebra); Computer science; Mathematical optimization; Euclidean geometry; Mathematics; Algorithm; Machine learning","score_opus":0.01849413291799128,"score_gpt":0.24994403962652262,"score_spread":0.23144990670853133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172943111","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.04021905,0.000024658619,0.95560384,0.0008302669,0.00013619784,0.00038977552,5.282099e-7,0.00021300536,0.002582701],"genre_scores_gemma":[0.68163556,0.00000457402,0.3179065,0.00034455847,0.00005838536,0.000030696734,6.055434e-7,0.000008808427,0.000010320761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975718,0.000075299504,0.00034122157,0.0007459358,0.00056027464,0.0007054505],"domain_scores_gemma":[0.997811,0.00042139352,0.00014193695,0.0009907308,0.00033058517,0.00030431172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004989906,0.00022260986,0.0002822373,0.0001313363,0.00028520005,0.00029406298,0.0027416178,0.000050891995,0.00008179841],"category_scores_gemma":[0.000030293562,0.00015927543,0.000045168697,0.0023760793,0.0026427987,0.0010677725,0.00076968595,0.00024618127,0.000041401996],"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.000006971967,0.00003745718,0.000051447518,0.0000030364758,0.0000048226625,0.0000036827455,0.00029705992,0.01348196,0.0006899945,0.84262365,0.000059681686,0.14274023],"study_design_scores_gemma":[0.00020573799,0.0002178443,0.0019760758,0.000034407898,0.0000033883957,0.000038901562,0.0000081895205,0.9376183,0.0020664234,0.0575531,0.000045477133,0.00023215346],"about_ca_topic_score_codex":0.000003952908,"about_ca_topic_score_gemma":3.6366475e-7,"teacher_disagreement_score":0.92413634,"about_ca_system_score_codex":0.00003259715,"about_ca_system_score_gemma":0.0000997311,"threshold_uncertainty_score":0.97375023},"labels":[],"label_agreement":null},{"id":"W2172997278","doi":"10.1016/j.tcs.2012.03.044","title":"Approximation algorithms for orienting mixed graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Approximation algorithm; Undirected graph; Vertex (graph theory); Mathematics; Combinatorics; Graph; Directed graph; Mixed graph; Discrete mathematics; Algorithm; Computer science; Line graph; Voltage graph","score_opus":0.011063770892872771,"score_gpt":0.25410822685249945,"score_spread":0.24304445595962668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172997278","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.39504942,0.000065599495,0.60431886,0.00003227614,0.0002658322,0.00008881883,0.000001018136,0.000011161463,0.00016703963],"genre_scores_gemma":[0.89970034,0.0000022580857,0.09975369,0.00008197456,0.00041669887,0.000012688659,0.0000141901355,0.000007736814,0.000010424219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889237,0.00003985782,0.0001393912,0.00030147107,0.00019977165,0.00042714764],"domain_scores_gemma":[0.9993461,0.000021340156,0.000046650326,0.0003090256,0.0001226647,0.00015422518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011188085,0.0000969174,0.00009487971,0.000056197565,0.0002284589,0.00004775824,0.00032088524,0.000050330258,0.000007642892],"category_scores_gemma":[0.000055823883,0.00008332858,0.00008476039,0.00031759558,0.00076297316,0.00001155347,0.00019788368,0.000034800476,0.000006035856],"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.000024192506,0.00010564133,0.002120159,0.000016135253,0.000032417287,1.6949228e-7,0.00013949905,0.00050336984,0.10082592,0.8431776,0.00030636386,0.052748542],"study_design_scores_gemma":[0.00059119525,0.00033598018,0.00495533,0.000015217475,0.00007474368,0.000024655441,0.000039700135,0.41085374,0.5405546,0.03923226,0.002755553,0.0005670475],"about_ca_topic_score_codex":2.4385105e-7,"about_ca_topic_score_gemma":1.321701e-7,"teacher_disagreement_score":0.8039453,"about_ca_system_score_codex":0.000010433243,"about_ca_system_score_gemma":0.00002582261,"threshold_uncertainty_score":0.3398041},"labels":[],"label_agreement":null},{"id":"W2173002974","doi":"10.1016/j.tcs.2015.02.017","title":"Strong connectivity of sensor networks with double antennae","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Wireless sensor network; Mathematics; Computer network","score_opus":0.0180973245174269,"score_gpt":0.24659175151804394,"score_spread":0.22849442700061703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173002974","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.06954244,0.00003659264,0.9253998,0.00026084948,0.00049346755,0.0002499875,5.699184e-7,0.00018064298,0.0038356753],"genre_scores_gemma":[0.8398548,0.0000013945236,0.15985322,0.00013454139,0.00013244525,0.0000069780394,3.5615125e-7,0.00000938129,0.0000068821887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970619,0.00013191608,0.00030474795,0.0008075488,0.0009442006,0.0007496968],"domain_scores_gemma":[0.9972668,0.00026967644,0.00014312826,0.0012581424,0.0005373114,0.00052492874],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020907852,0.00022722025,0.0003516259,0.00012330979,0.00017339746,0.00026497772,0.0024697252,0.00006714847,0.000011036702],"category_scores_gemma":[0.000036440746,0.00016685332,0.000053327673,0.0016419283,0.0034311174,0.00083484495,0.0011783656,0.00028160942,0.000015989326],"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.0000663374,0.00007679451,0.0006002411,0.00000387773,0.0000069978605,0.000022526561,0.00023355802,0.039968982,0.000046026867,0.95154285,0.00004886491,0.0073829666],"study_design_scores_gemma":[0.0008504696,0.0006584382,0.00084800314,0.00004066438,0.0000061608835,0.00008419977,0.000014012404,0.98623276,0.001363652,0.00961907,0.000035486257,0.0002470687],"about_ca_topic_score_codex":0.00001470887,"about_ca_topic_score_gemma":0.0000034176212,"teacher_disagreement_score":0.9462638,"about_ca_system_score_codex":0.00007575625,"about_ca_system_score_gemma":0.00027278118,"threshold_uncertainty_score":0.999281},"labels":[],"label_agreement":null},{"id":"W2174018860","doi":"10.1016/j.tcs.2015.04.017","title":"State complexity of inversion operations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Yonsei University","keywords":"Substring; Inversion (geology); Nondeterministic algorithm; Prefix; Upper and lower bounds; Computational complexity theory; Mathematics; Combinatorics; Algorithm; Computer science; Discrete mathematics; Data structure","score_opus":0.04010833710941971,"score_gpt":0.2705048822927333,"score_spread":0.23039654518331357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174018860","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.16060247,0.000013404786,0.83617353,0.00074001146,0.0004276642,0.00008146634,0.0000022073325,0.00012742956,0.0018318421],"genre_scores_gemma":[0.78414,0.0000010690933,0.21547738,0.00034229804,0.000027220289,0.0000012863898,6.3404127e-7,0.0000029681983,0.0000071638856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825424,0.00011470387,0.0002440591,0.00041011174,0.00064917566,0.00032768628],"domain_scores_gemma":[0.9985047,0.00008249415,0.000044085322,0.000743706,0.0003054038,0.0003195861],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016030285,0.00011364033,0.0001713253,0.0001454225,0.00018739188,0.00019568596,0.0021718435,0.000023916671,0.000017842405],"category_scores_gemma":[0.00008726341,0.00009010854,0.000041232783,0.000963769,0.004128497,0.00081112166,0.0012591972,0.000101606034,0.00006662938],"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.000003896024,0.00004795654,0.000029425062,0.0000027413628,0.0000015936919,0.000003154987,0.00076857285,0.0007977087,0.00082477584,0.98734224,0.00009301115,0.010084907],"study_design_scores_gemma":[0.00015094528,0.000121386656,0.00022961175,0.000009976403,0.0000010863962,0.0000091875345,0.000009845935,0.61856043,0.009547578,0.37123555,0.000036978396,0.000087440654],"about_ca_topic_score_codex":0.000016253738,"about_ca_topic_score_gemma":0.0000013445801,"teacher_disagreement_score":0.62353754,"about_ca_system_score_codex":0.000046790734,"about_ca_system_score_gemma":0.0002111395,"threshold_uncertainty_score":0.9985817},"labels":[],"label_agreement":null},{"id":"W2174619083","doi":"10.1016/j.tcs.2012.07.033","title":"On the competitiveness of AIMD-TCP within a general network","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Computer science; Router; Competitive analysis; Scheduling (production processes); Multiplicative function; Computer network; Distributed computing; Set (abstract data type); Mathematical optimization; Upper and lower bounds; Mathematics","score_opus":0.016616668126334232,"score_gpt":0.2587536619840035,"score_spread":0.2421369938576693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174619083","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.028725399,0.000017867138,0.96189433,0.0015257311,0.0007038321,0.00018161067,7.4280723e-7,0.0000734918,0.0068770032],"genre_scores_gemma":[0.87024057,0.0000021763587,0.12805603,0.0015156117,0.00015054719,0.000006575626,3.210643e-7,0.0000049468695,0.000023236465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977332,0.0003081533,0.00025891603,0.0003233239,0.00076475076,0.00061168766],"domain_scores_gemma":[0.99818593,0.0005762246,0.000088973444,0.0007116144,0.00019328849,0.00024397121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034315782,0.00013269829,0.00016675585,0.00008254649,0.00039702942,0.00018688242,0.00219479,0.00003339046,0.00013513134],"category_scores_gemma":[0.0001032111,0.00007981748,0.000055304317,0.0012657096,0.0023957994,0.00045126758,0.0008235894,0.00019560971,0.0000637675],"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.000005206586,0.000063980995,0.00023244148,0.0000028726802,0.000003048912,6.525487e-7,0.0005755405,0.014275291,0.00008951272,0.9833664,0.000059974926,0.001325108],"study_design_scores_gemma":[0.00013325163,0.00015698762,0.001578294,0.0000362868,0.0000018896104,0.000009727103,0.000005549127,0.86697876,0.0023599574,0.12846404,0.00013650043,0.00013878118],"about_ca_topic_score_codex":0.0000018578387,"about_ca_topic_score_gemma":1.7874389e-7,"teacher_disagreement_score":0.8549023,"about_ca_system_score_codex":0.000028188704,"about_ca_system_score_gemma":0.00009875814,"threshold_uncertainty_score":0.8827423},"labels":[],"label_agreement":null},{"id":"W2174851824","doi":"10.1016/j.tcs.2012.01.035","title":"More efficient periodic traversal in anonymous undirected graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"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 en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Tree traversal; Undirected graph; Combinatorics; Graph; Set (abstract data type); Node (physics); Computer science; Mathematics; Period length; Discrete mathematics; Time complexity; Integer (computer science); Binary logarithm; Algorithm","score_opus":0.010685658302965768,"score_gpt":0.2572362291670868,"score_spread":0.24655057086412105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174851824","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.14842808,0.00003817551,0.84656507,0.0009541232,0.0005691954,0.00022090571,6.7754104e-7,0.00021888915,0.003004859],"genre_scores_gemma":[0.9063234,0.0000037976965,0.09313408,0.00047180912,0.000041860585,0.00000782481,7.8684275e-7,0.0000066977004,0.000009756997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972143,0.00016504893,0.00027141292,0.0005329737,0.00081855623,0.0009977033],"domain_scores_gemma":[0.9986118,0.00013753107,0.00004376307,0.0005997982,0.0001261014,0.00048098472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017604603,0.00017393785,0.00018838332,0.00044413333,0.000296245,0.0003524221,0.0017753761,0.000055935427,0.00007995266],"category_scores_gemma":[0.00007297395,0.00014445714,0.000056015804,0.0026786393,0.00213558,0.00060263235,0.0006791117,0.0002426716,0.00009587863],"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.0000046858163,0.00017396444,0.0008655295,0.000003823864,0.0000014988397,0.000007045658,0.003078297,0.0037837317,0.00025222942,0.98407817,0.000020158768,0.0077308947],"study_design_scores_gemma":[0.00034607152,0.0000940325,0.010761337,0.000018302533,0.0000015417982,0.000031462932,0.000022977954,0.97917336,0.0007692759,0.008479576,0.000066785375,0.00023528418],"about_ca_topic_score_codex":0.0000063790053,"about_ca_topic_score_gemma":7.156308e-7,"teacher_disagreement_score":0.9755986,"about_ca_system_score_codex":0.000094634255,"about_ca_system_score_gemma":0.00014386271,"threshold_uncertainty_score":0.78686327},"labels":[],"label_agreement":null},{"id":"W2176863542","doi":"10.1016/j.tcs.2007.03.023","title":"Powers in a class of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">A</mml:mi></mml:math>-strict standard episturmian words","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"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":"Scroll; Class (philosophy); Mathematics; Algorithm; Computer science; Artificial intelligence; Theology; Philosophy","score_opus":0.010309950302254896,"score_gpt":0.2403761296158783,"score_spread":0.2300661793136234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176863542","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.6694843,0.00007445757,0.3264866,0.00037771394,0.000958578,0.000065028966,0.00001970801,0.00014815414,0.0023854424],"genre_scores_gemma":[0.95393133,0.000027010496,0.04475026,0.0009907219,0.00022282575,0.000017173348,0.000008095698,0.000041462994,0.000011150584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950283,0.00016585649,0.000881662,0.0011044982,0.0015717121,0.0012479624],"domain_scores_gemma":[0.9966568,0.0008817605,0.0003814782,0.0014968361,0.00012534874,0.00045777753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0049995366,0.00039293882,0.000368232,0.00035300877,0.00044490435,0.00059919327,0.0030464397,0.00029574198,0.00003146702],"category_scores_gemma":[0.0003821085,0.00039464532,0.0002872363,0.0016565253,0.0026636177,0.00097536435,0.0018240011,0.0005922491,0.0001661301],"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.00018871677,0.0001493241,0.000023534329,0.00005904618,0.000026092395,0.00032651034,0.001359559,0.0002843954,0.0010878852,0.98753047,0.000079210986,0.008885242],"study_design_scores_gemma":[0.000624983,0.0006090382,0.0005972075,0.00026435734,0.000024682464,0.00020911153,0.00013451112,0.9690022,0.006982231,0.020753365,0.0003963004,0.00040204322],"about_ca_topic_score_codex":0.00006905833,"about_ca_topic_score_gemma":0.000021571504,"teacher_disagreement_score":0.96871775,"about_ca_system_score_codex":0.00006243085,"about_ca_system_score_gemma":0.00048482165,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W2179376195","doi":"10.1016/j.tcs.2012.07.004","title":"Gathering asynchronous oblivious agents with local vision in regular bipartite graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"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; Snapshot (computer storage); Asynchronous communication; Bipartite graph; Existential quantification; Theoretical computer science; Graph; Algorithm; Mathematics; Combinatorics; Computer network","score_opus":0.010246317737841494,"score_gpt":0.2581444462834714,"score_spread":0.2478981285456299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179376195","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.0640166,0.000040301617,0.93321526,0.00039733644,0.00022809465,0.00020020283,2.5917316e-7,0.00014647875,0.0017554507],"genre_scores_gemma":[0.84852934,0.000007663413,0.15107128,0.00033722227,0.000031390733,0.000008231487,4.28175e-7,0.0000088064835,0.0000056221447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972992,0.00015163017,0.0002501384,0.00054361165,0.00082099234,0.0009344541],"domain_scores_gemma":[0.9986184,0.000090950336,0.000051731313,0.00067977567,0.000109936875,0.00044916812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842299,0.00017777718,0.0001822401,0.00032916144,0.00025629823,0.0003647132,0.0015129895,0.00004893265,0.000054008862],"category_scores_gemma":[0.000023746974,0.00013300557,0.00003647187,0.0020108647,0.0019982944,0.0015059008,0.0007722815,0.00021235962,0.00008239033],"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.000009043951,0.00016962785,0.0013487065,0.000007606585,0.0000024569836,0.000015049858,0.0010977916,0.007429241,0.00013779834,0.9494287,0.000020822048,0.040333163],"study_design_scores_gemma":[0.00036883433,0.00031637528,0.006356165,0.00006816031,0.000001658091,0.000046373432,0.000011179558,0.97325605,0.0009289398,0.018302264,0.00010425146,0.00023976305],"about_ca_topic_score_codex":0.0000062849535,"about_ca_topic_score_gemma":0.0000019566703,"teacher_disagreement_score":0.9658268,"about_ca_system_score_codex":0.00009562178,"about_ca_system_score_gemma":0.0000930449,"threshold_uncertainty_score":0.7362799},"labels":[],"label_agreement":null},{"id":"W2180483632","doi":"10.1016/j.tcs.2015.02.006","title":"Complexity of barrier coverage with relocatable sensors in the plane","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Concordia University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Minimax; Plane (geometry); Set (abstract data type); Perpendicular; Range (aeronautics); Time complexity; Computer science; Line (geometry); Mathematical optimization; Algorithm; Mathematics; Topology (electrical circuits); Combinatorics; Geometry; Engineering","score_opus":0.020268602013612684,"score_gpt":0.2532846675983693,"score_spread":0.23301606558475663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180483632","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.1788793,0.000013109614,0.81218964,0.0015197905,0.00018219676,0.00013029292,0.000001915167,0.000062423744,0.007021347],"genre_scores_gemma":[0.91538167,7.262957e-7,0.084166914,0.0003852379,0.000050018247,0.0000023140633,7.6356116e-7,0.0000036947647,0.000008639263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780047,0.00026275494,0.00021076559,0.000427013,0.00089948263,0.00039952277],"domain_scores_gemma":[0.9985755,0.00025237532,0.00006843941,0.0007926527,0.00013490034,0.00017614008],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028584641,0.00013271185,0.00019625053,0.00012031074,0.00014871424,0.00019421127,0.0023494514,0.000027014348,0.000013756407],"category_scores_gemma":[0.0001100541,0.00007536942,0.000024028537,0.0012525095,0.0030246375,0.00033907872,0.00044771846,0.0002835691,0.000019435314],"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.000014806176,0.000051986157,0.0006988212,0.0000047440676,0.0000015081405,0.000028762486,0.001853137,0.0034379202,0.000022431372,0.9901081,0.000050680617,0.0037271446],"study_design_scores_gemma":[0.00052194024,0.00051988603,0.0040346673,0.000034113356,0.000002457218,0.000121025194,0.000046914025,0.8449645,0.0008138203,0.1485734,0.0001830035,0.00018426545],"about_ca_topic_score_codex":0.00005971465,"about_ca_topic_score_gemma":0.0000026470664,"teacher_disagreement_score":0.8415347,"about_ca_system_score_codex":0.00002764321,"about_ca_system_score_gemma":0.00017846492,"threshold_uncertainty_score":0.99968857},"labels":[],"label_agreement":null},{"id":"W2180828828","doi":"10.1016/j.tcs.2013.05.037","title":"On approximating string selection problems with outliers","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; String (physics); Hamming distance; Combinatorics; Mathematics; Polynomial-time approximation scheme; Time complexity; Outlier; Edit distance; Selection (genetic algorithm); Approximation algorithm; Set (abstract data type); Randomized algorithm; Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.006601948988134197,"score_gpt":0.20958767853864238,"score_spread":0.20298572955050817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180828828","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.045698293,0.000003631576,0.9512501,0.00031993614,0.0001936716,0.0002908971,3.4089754e-7,0.00027995184,0.0019631756],"genre_scores_gemma":[0.6500884,3.7533454e-7,0.34962955,0.00020269664,0.00005044396,0.00001645581,4.265346e-7,0.0000054908046,0.0000061299484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977041,0.000057384616,0.00021716316,0.0007224564,0.0007552378,0.00054365984],"domain_scores_gemma":[0.99876994,0.00014962206,0.00008425176,0.00057764567,0.00018042413,0.00023811968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676477,0.00017742021,0.00015418259,0.00016301926,0.00057128206,0.0009433327,0.0016014611,0.00003642222,0.000039849263],"category_scores_gemma":[0.000039407732,0.000116379226,0.000025965068,0.001052827,0.0007914348,0.0014780487,0.00066956424,0.00023575114,0.00012657889],"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.0000024213039,0.000042975636,0.00004629949,0.000005763417,0.000002104451,0.0000013680368,0.00019676321,0.002527428,0.00043117703,0.92164165,0.00005335275,0.07504869],"study_design_scores_gemma":[0.00017465987,0.00039576401,0.0004919685,0.0000691226,0.0000013766222,0.000024791407,0.000005525097,0.89257455,0.0018448664,0.10421051,0.000022571363,0.00018430693],"about_ca_topic_score_codex":0.00001299001,"about_ca_topic_score_gemma":2.6915066e-7,"teacher_disagreement_score":0.89004713,"about_ca_system_score_codex":0.00006256106,"about_ca_system_score_gemma":0.000072927374,"threshold_uncertainty_score":0.90965784},"labels":[],"label_agreement":null},{"id":"W2183729464","doi":"10.1016/j.tcs.2015.11.011","title":"Fast construction of wavelet trees","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet; Computer science; Mathematics; Artificial intelligence; Algorithm","score_opus":0.014599212517948037,"score_gpt":0.2475569675169556,"score_spread":0.23295775499900756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183729464","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.02115504,0.000019118095,0.9743749,0.00033959866,0.0007488115,0.00006875363,0.0000027669148,0.00010172044,0.0031892832],"genre_scores_gemma":[0.55615973,0.0000013415133,0.44370416,0.00006567616,0.00006212598,0.000001005679,6.4336825e-7,0.0000021917076,0.00000310988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982032,0.00006506768,0.00024010603,0.00045001102,0.00073293963,0.00030865418],"domain_scores_gemma":[0.99849564,0.00008132542,0.00008386807,0.00075557537,0.00029256867,0.00029102335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009359544,0.00011584133,0.00017439979,0.0001448397,0.0001340187,0.00017088608,0.0019045796,0.000036533944,0.000013744676],"category_scores_gemma":[0.000068454174,0.00008706248,0.000037250225,0.0008368757,0.0025347336,0.00086615596,0.001240137,0.00010311367,0.00003207966],"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.000004132524,0.000032956832,0.00004147678,0.0000017657142,0.0000012123028,0.0000029998967,0.00022348981,0.00007217574,0.00027301125,0.8651493,0.00010184084,0.13409561],"study_design_scores_gemma":[0.00027737377,0.00028417757,0.0006156827,0.000024792034,0.000002286314,0.00007273489,0.000019975734,0.78312993,0.009332851,0.20579834,0.00029032832,0.00015150022],"about_ca_topic_score_codex":0.0000062522818,"about_ca_topic_score_gemma":2.5278484e-7,"teacher_disagreement_score":0.7830578,"about_ca_system_score_codex":0.000031999207,"about_ca_system_score_gemma":0.00017350327,"threshold_uncertainty_score":0.9339332},"labels":[],"label_agreement":null},{"id":"W2189549633","doi":"10.1016/j.tcs.2017.01.030","title":"The within-strip discrete unit disk cover problem","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"STRIPS; Cardinality (data modeling); Cover (algebra); Set cover problem; Approximation algorithm; Unit disk; Set (abstract data type); Mathematics; Unit (ring theory); Plane (geometry); Combinatorics; Unit disk graph; Discrete mathematics; Algorithm; Computer science; Geometry; Telecommunications","score_opus":0.01477852363600524,"score_gpt":0.27497184750959625,"score_spread":0.260193323873591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189549633","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.01550996,0.000026200005,0.9704873,0.004663545,0.0012469764,0.00020119445,0.0000017610703,0.00010808506,0.0077549675],"genre_scores_gemma":[0.91654307,0.0000066635494,0.082688615,0.00032812488,0.00022750246,0.000009559756,0.0000010488623,0.0000054889465,0.00018991159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975968,0.00010404365,0.0002855763,0.00062584283,0.00088343443,0.0005043219],"domain_scores_gemma":[0.99735177,0.00033808974,0.00019262914,0.0015939348,0.00028036535,0.00024320587],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.002235634,0.00017352648,0.00013769699,0.00008152647,0.003813645,0.0037568992,0.005195406,0.000039604056,0.000011339617],"category_scores_gemma":[0.00023287437,0.00010935201,0.000065268876,0.00049397163,0.0034965992,0.0013976787,0.001930611,0.00021345094,0.00014540709],"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.0000062679524,0.00001735641,0.00007760941,0.000002116203,0.0000039941856,0.000004321418,0.000189841,0.0018790005,0.000159321,0.9618135,0.00009310587,0.03575355],"study_design_scores_gemma":[0.00017418421,0.000103064434,0.0042338017,0.0000149556245,0.0000033617212,0.00002176411,0.000002618864,0.6572856,0.0018977717,0.33395237,0.0021403776,0.00017015889],"about_ca_topic_score_codex":0.0000043198525,"about_ca_topic_score_gemma":0.000002049061,"teacher_disagreement_score":0.9010331,"about_ca_system_score_codex":0.000036170626,"about_ca_system_score_gemma":0.00023810082,"threshold_uncertainty_score":0.9992153},"labels":[],"label_agreement":null},{"id":"W2191739325","doi":"10.1016/j.tcs.2015.11.048","title":"Space-efficient algorithm for computing a centerpoint of a set of points in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">R</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Set (abstract data type); Space (punctuation); Point (geometry); Computer science; Scroll; Mathematics; Geometry; Programming language","score_opus":0.021527318223237855,"score_gpt":0.256776298198295,"score_spread":0.23524897997505714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191739325","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.56385833,0.00027398212,0.36504725,0.0008942346,0.0031119105,0.00008407625,0.00017367654,0.00012062045,0.0664359],"genre_scores_gemma":[0.920297,0.000055480556,0.07740047,0.0007134544,0.0010023214,0.00014641196,0.0001981383,0.0001513213,0.000035352066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99154806,0.00040318398,0.0016700847,0.001750337,0.002780965,0.0018473929],"domain_scores_gemma":[0.99408346,0.0015000432,0.0013665924,0.0017008773,0.0004051665,0.0009438669],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0040701106,0.0005973981,0.0003647879,0.00064808776,0.00089418463,0.0012281385,0.0028156356,0.00079313025,0.017816437],"category_scores_gemma":[0.00090419815,0.0009812961,0.0008514051,0.0020663724,0.002907562,0.0011150112,0.003339696,0.00085698406,0.0003406791],"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.0006725064,0.0003551192,0.0000047523026,0.00044415504,0.00022827054,0.00033195727,0.003955568,0.022709783,0.0007190842,0.9518817,0.009753126,0.008943983],"study_design_scores_gemma":[0.0015103054,0.0013400146,0.00005553769,0.000583994,0.0001531139,0.0006196452,0.0003342539,0.6407015,0.35328677,0.0006379746,0.00021494307,0.0005619902],"about_ca_topic_score_codex":0.00033123026,"about_ca_topic_score_gemma":0.00006915465,"teacher_disagreement_score":0.9512437,"about_ca_system_score_codex":0.000028838866,"about_ca_system_score_gemma":0.0020150756,"threshold_uncertainty_score":0.99980867},"labels":[],"label_agreement":null},{"id":"W2196269078","doi":"10.1016/j.tcs.2015.06.040","title":"Matchings in higher-order Gabriel graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Order (exchange); Mathematics; Computer science; Discrete mathematics; Business","score_opus":0.02564039760582372,"score_gpt":0.2643235027200953,"score_spread":0.2386831051142716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196269078","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.07317453,0.000035684352,0.91552466,0.0032956921,0.0012042287,0.0001105271,3.956164e-7,0.00014106065,0.0065132445],"genre_scores_gemma":[0.79150486,0.0000012650138,0.20725846,0.0010945159,0.00009348263,0.000005168908,0.0000010220348,0.00000406516,0.00003717668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777484,0.00009823903,0.00026445495,0.00060957967,0.00080923,0.0004436606],"domain_scores_gemma":[0.99871445,0.0001366172,0.000048718248,0.00047461345,0.00029982446,0.00032577058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017163202,0.00014769685,0.0001569521,0.000377323,0.00015312138,0.00039329304,0.0015529845,0.00004444071,0.000028554303],"category_scores_gemma":[0.00008856419,0.00012989515,0.00003514774,0.0030981093,0.00081432454,0.0009788419,0.0007036238,0.00017256537,0.00009978568],"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.00000502657,0.000052007603,0.0000967955,0.0000019192903,0.0000010398437,0.000012016426,0.00040913362,0.0033003634,0.00014727777,0.9765324,0.00015757463,0.01928446],"study_design_scores_gemma":[0.0003113586,0.00010766789,0.0025620963,0.000010858753,0.0000010008964,0.000023946248,0.0000041298335,0.41945642,0.0007426612,0.5760222,0.00058360596,0.00017404766],"about_ca_topic_score_codex":0.000008388803,"about_ca_topic_score_gemma":0.0000012123319,"teacher_disagreement_score":0.7183303,"about_ca_system_score_codex":0.000073631694,"about_ca_system_score_gemma":0.00025993772,"threshold_uncertainty_score":0.52969706},"labels":[],"label_agreement":null},{"id":"W2206772957","doi":"10.1016/j.tcs.2015.11.027","title":"Descriptional Complexity of Formal Systems","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Middlesex London Health Unit","funders":"","keywords":"Formal language; Computer science; Formal system; Theoretical computer science; Programming language; Mathematics; Linguistics; Philosophy","score_opus":0.07158295952416184,"score_gpt":0.2757495938322175,"score_spread":0.20416663430805565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206772957","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.04558259,0.000055913155,0.947787,0.0004623057,0.0019809753,0.0002496641,0.0000045075953,0.00023955316,0.0036375],"genre_scores_gemma":[0.71892416,4.642024e-7,0.28081763,0.000101412494,0.00014172797,0.000005202358,8.770476e-7,0.0000048646,0.00000367991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599755,0.00022524403,0.00055647775,0.00079139223,0.0016479904,0.00078136084],"domain_scores_gemma":[0.9969291,0.00022608474,0.00014869969,0.0011814265,0.00091774284,0.00059693673],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003978029,0.00023046388,0.00038355298,0.00023940841,0.0002585742,0.0004051701,0.00394228,0.000065606,0.000015409774],"category_scores_gemma":[0.0001883564,0.00019055505,0.00009702491,0.0014620476,0.0069449325,0.0014423445,0.0028488052,0.00021497809,0.00006376818],"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.000011764981,0.000128537,0.00017812163,0.000012791491,0.0000038464736,0.0000074987847,0.0003516662,0.0018512803,0.00010131027,0.9900587,0.0000614951,0.0072329515],"study_design_scores_gemma":[0.00026223852,0.00039862204,0.0018115431,0.000015037435,0.0000025756988,0.00009429081,0.000013755817,0.69932806,0.00044739756,0.29737937,0.00006950574,0.00017761633],"about_ca_topic_score_codex":0.000027014792,"about_ca_topic_score_gemma":8.218895e-7,"teacher_disagreement_score":0.6974768,"about_ca_system_score_codex":0.00017721437,"about_ca_system_score_gemma":0.00045725954,"threshold_uncertainty_score":0.9957576},"labels":[],"label_agreement":null},{"id":"W2209166757","doi":"10.1016/j.tcs.2015.10.035","title":"Partial learning of recursively enumerable languages","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National University of Singapore","keywords":"Consistency (knowledge bases); Recursion (computer science); Mathematics; Inference; Recursively enumerable language; Limit (mathematics); Extension (predicate logic); Partial function; Class (philosophy); Relation (database); Inductive reasoning; Theoretical computer science; Computer science; Artificial intelligence; Discrete mathematics; Algorithm; Programming language; Data mining","score_opus":0.011608975006489186,"score_gpt":0.2756719027429692,"score_spread":0.26406292773648005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209166757","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.033967767,0.000055372504,0.9559437,0.0007044752,0.00040898964,0.00005556522,3.314845e-7,0.00017207144,0.008691735],"genre_scores_gemma":[0.8480878,0.0000014168293,0.15161397,0.00010932513,0.00012809674,0.0000016087804,3.7921663e-7,0.0000044841418,0.000052955333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808854,0.00018652844,0.00020570209,0.0004390303,0.0006719774,0.00040819764],"domain_scores_gemma":[0.998805,0.00015637475,0.000088382156,0.0004333297,0.0002274911,0.0002894255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019312666,0.00011943155,0.00018596849,0.000128117,0.00018306873,0.00017537146,0.0016037398,0.000034383895,0.000019800202],"category_scores_gemma":[0.0003638871,0.00009636536,0.00004562811,0.00083018944,0.0011442137,0.00039937603,0.0006929674,0.00026859282,0.00006326326],"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.0000048550837,0.000032531985,0.00029562012,0.0000036995225,0.0000024223484,0.00001008662,0.001236219,0.0021295862,0.0002590253,0.93175375,0.000057360558,0.064214826],"study_design_scores_gemma":[0.00027117785,0.00044949385,0.00034309883,0.000025636553,0.0000030838514,0.00003339165,0.000039375034,0.95717907,0.008872623,0.031682637,0.0009229896,0.00017740793],"about_ca_topic_score_codex":0.000018216217,"about_ca_topic_score_gemma":8.93633e-8,"teacher_disagreement_score":0.9550495,"about_ca_system_score_codex":0.00002559339,"about_ca_system_score_gemma":0.00015844066,"threshold_uncertainty_score":0.4215903},"labels":[],"label_agreement":null},{"id":"W2210036804","doi":"10.1016/j.tcs.2015.05.023","title":"TCS in the 21st century","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"History of Medical Practice","field":"Medicine","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":"Computer science; Mathematics; Programming language","score_opus":0.029955469606361602,"score_gpt":0.3083197519809694,"score_spread":0.2783642823746078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2210036804","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31594145,0.0006978481,0.05272071,0.0701293,0.0027335377,0.00084594026,0.0000011132431,0.00019510539,0.556735],"genre_scores_gemma":[0.9845577,0.000009749879,0.007987965,0.0071836165,0.00023955313,0.0000027716449,4.7220914e-7,0.000004408313,0.0000137568895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980246,0.00016661329,0.00015886633,0.00026087437,0.0010793252,0.00030975603],"domain_scores_gemma":[0.99873227,0.00035201546,0.000026295862,0.00042857326,0.00009704634,0.00036380382],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003920019,0.00007870795,0.0001320514,0.0000855792,0.000091896145,0.000039138118,0.00060479087,0.000038354003,0.000088177054],"category_scores_gemma":[0.0014040424,0.000045984183,0.000026351301,0.0006112283,0.00401267,0.00015606418,0.0001399819,0.0003954127,0.00029702997],"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.00005715003,0.00017908432,0.00015457941,0.0000066550406,0.0000013573882,0.00013389408,0.0023076462,0.0000037121647,0.00007834138,0.96035653,0.0013472403,0.03537379],"study_design_scores_gemma":[0.007615899,0.004107549,0.024243722,0.0003940758,0.00013008622,0.003478888,0.004162108,0.098318614,0.00062318676,0.1306009,0.7253655,0.0009594131],"about_ca_topic_score_codex":0.0000048782344,"about_ca_topic_score_gemma":5.352036e-7,"teacher_disagreement_score":0.82975566,"about_ca_system_score_codex":0.00011203426,"about_ca_system_score_gemma":0.0002760312,"threshold_uncertainty_score":0.9986978},"labels":[],"label_agreement":null},{"id":"W2219611942","doi":"10.1016/j.tcs.2015.12.012","title":"A probabilistic version of the game of Zombies and Survivors on graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Zombie; Vertex (graph theory); Mathematics; Discrete mathematics; Probabilistic logic; Graph; Computer science; Statistics; Computer security","score_opus":0.019414974779184177,"score_gpt":0.27299347884894193,"score_spread":0.25357850406975774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219611942","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.75707,0.000029352423,0.24050084,0.00044154955,0.0002941443,0.00023554376,0.0000020961509,0.000037167723,0.0013893364],"genre_scores_gemma":[0.9874851,0.0000024843525,0.012431998,0.000060390972,0.000008161787,0.0000025244078,7.0426005e-8,0.000003884973,0.000005349149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978021,0.00024198,0.00021611746,0.00042203531,0.0010026534,0.00031511983],"domain_scores_gemma":[0.9979534,0.0005266127,0.00008925202,0.0008973646,0.00034006737,0.00019331659],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002082299,0.00011508809,0.00018879134,0.00018675391,0.00011363436,0.000056082165,0.0022699372,0.00003083816,0.0000030045094],"category_scores_gemma":[0.0004904975,0.00007095849,0.00005124858,0.0015980158,0.008025337,0.0002865434,0.0015270163,0.00015272487,0.000004314805],"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.00002935754,0.00005196729,0.00032513434,0.000013409273,0.0000019540073,9.679871e-7,0.0006461437,0.0003636482,0.0005005088,0.9941398,0.0000066945945,0.0039204527],"study_design_scores_gemma":[0.00024471091,0.0005258246,0.002805357,0.000053894273,0.000002303692,0.000009046909,0.000019066472,0.095613904,0.010008991,0.8906148,0.00001271168,0.00008938083],"about_ca_topic_score_codex":0.0000060065954,"about_ca_topic_score_gemma":9.900964e-7,"teacher_disagreement_score":0.23041517,"about_ca_system_score_codex":0.000026259831,"about_ca_system_score_gemma":0.00013412574,"threshold_uncertainty_score":0.99467427},"labels":[],"label_agreement":null},{"id":"W2236520910","doi":"10.1016/j.tcs.2016.01.002","title":"Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backtracking; Algorithm; Task (project management); Assignment problem; Computer science; Mathematics; Process (computing); Mathematical optimization","score_opus":0.0047725030374459534,"score_gpt":0.19742278774281283,"score_spread":0.19265028470536688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236520910","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.00600379,0.00005864875,0.99039346,0.0020061943,0.00029494066,0.00026593433,0.0000034529223,0.00025584578,0.00071770954],"genre_scores_gemma":[0.68896234,0.000006720108,0.31045422,0.00036608326,0.0001393221,0.000023613775,2.96718e-7,0.000021666878,0.000025738156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823564,0.000052435225,0.00020898668,0.00036972645,0.00057425554,0.0005589706],"domain_scores_gemma":[0.9989377,0.0002902434,0.00003312782,0.0004777052,0.00008995363,0.000171248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011464083,0.0001915703,0.00012771126,0.000056076336,0.00052355864,0.00040848608,0.0010399353,0.0000355646,0.00005597351],"category_scores_gemma":[0.000029730038,0.000080670085,0.000032448974,0.0004908479,0.0010460323,0.00022232175,0.0002656836,0.00017621531,0.000052414944],"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.0000127639005,0.000032551983,0.000026941108,0.0000140036655,0.000025908606,0.0000066137072,0.002080337,0.049670465,0.005756429,0.15181547,0.0003866134,0.7901719],"study_design_scores_gemma":[0.00018127539,0.00011697721,0.00007320192,0.000106343185,0.00000952186,0.000020095425,0.00009116574,0.9882178,0.0090971375,0.0017048628,0.00015594166,0.00022568487],"about_ca_topic_score_codex":0.000002901188,"about_ca_topic_score_gemma":3.6679845e-7,"teacher_disagreement_score":0.9385473,"about_ca_system_score_codex":0.00009057255,"about_ca_system_score_gemma":0.000033198972,"threshold_uncertainty_score":0.4026843},"labels":[],"label_agreement":null},{"id":"W2248326503","doi":"10.1016/j.tcs.2016.04.026","title":"Recognizing and drawing IC-planar graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; Deutsche Forschungsgemeinschaft","keywords":"Planar graph; Combinatorics; Planar straight-line graph; Book embedding; Mathematics; Planarity testing; Outerplanar graph; 1-planar graph; Planar; Time complexity; Graph drawing; Discrete mathematics; Rotation system; Pathwidth; Line graph; Graph; Computer science","score_opus":0.01154503844059302,"score_gpt":0.23778373087163776,"score_spread":0.22623869243104475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248326503","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.085712194,0.00004011372,0.91011965,0.0023099303,0.00047017293,0.00007312469,7.333932e-7,0.00011710689,0.0011569897],"genre_scores_gemma":[0.81113267,0.000010325729,0.18828067,0.000469723,0.000084863816,0.0000025757083,2.4839136e-7,0.0000032797113,0.000015672573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983203,0.00006935344,0.0001897971,0.0006075799,0.0004454107,0.00036760332],"domain_scores_gemma":[0.99885696,0.00037786015,0.000044906803,0.00035324245,0.0001442135,0.0002227905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135186,0.00012438688,0.000119832606,0.00024319979,0.00042744083,0.00034604454,0.0008482776,0.000032158565,0.000018927652],"category_scores_gemma":[0.000105952786,0.000082541934,0.000032246895,0.00090542645,0.001063941,0.0009613605,0.00040700962,0.00006870567,0.000052111234],"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.0000019325685,0.000008942747,0.00007241752,0.0000017251557,0.0000015726093,0.0000037532045,0.000091952475,0.000007795163,0.006147433,0.75053513,0.000029957271,0.2430974],"study_design_scores_gemma":[0.00035687198,0.00018123178,0.004198351,0.00006369074,0.000003940138,0.00011606364,0.0000030844187,0.12812147,0.017457487,0.8487521,0.0004387843,0.00030692248],"about_ca_topic_score_codex":9.686615e-7,"about_ca_topic_score_gemma":3.0584343e-7,"teacher_disagreement_score":0.7254204,"about_ca_system_score_codex":0.000028149472,"about_ca_system_score_gemma":0.00007404883,"threshold_uncertainty_score":0.39201352},"labels":[],"label_agreement":null},{"id":"W2250680610","doi":"10.1016/j.tcs.2015.05.003","title":"Studies on finite Sturmian words","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"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":"Christoffel symbols; Mathematics; Bijection; Closure (psychology); Combinatorics; Palindrome; Extension (predicate logic); Word (group theory); Inverse; Combinatorics on words; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.03992175234996239,"score_gpt":0.30067441099862086,"score_spread":0.2607526586486585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250680610","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.05668213,0.00012185345,0.9295914,0.0023925614,0.0025160417,0.00014185645,0.0000010820379,0.0005254332,0.00802765],"genre_scores_gemma":[0.9267901,0.0000037821494,0.07047007,0.0024734421,0.00021666166,0.000006703185,2.7752372e-7,0.000007959502,0.000030968244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717456,0.00015461026,0.00028511774,0.0007887436,0.000995967,0.0006010213],"domain_scores_gemma":[0.9974787,0.00058708276,0.00007456976,0.0011426721,0.00025324884,0.00046369174],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029769524,0.0002241567,0.0002604887,0.0002269863,0.00030840156,0.00044481317,0.0030936105,0.00004396296,0.000006491614],"category_scores_gemma":[0.00048029204,0.00016095302,0.00006123074,0.0013131447,0.0027299153,0.00067517144,0.001553996,0.00021475977,0.00034144078],"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.000007799668,0.00005223779,0.000020396827,0.0000028841278,0.000005848397,0.000028572853,0.0020095126,0.0006931853,0.000041764382,0.9756626,0.0003527753,0.02112242],"study_design_scores_gemma":[0.0002884331,0.000511867,0.00008534909,0.00004996348,0.0000032307285,0.000024459534,0.00009932926,0.44322148,0.0042012427,0.5508309,0.0004095465,0.00027418588],"about_ca_topic_score_codex":7.7078545e-7,"about_ca_topic_score_gemma":2.8662294e-7,"teacher_disagreement_score":0.870108,"about_ca_system_score_codex":0.00010778645,"about_ca_system_score_gemma":0.0001655859,"threshold_uncertainty_score":0.9999841},"labels":[],"label_agreement":null},{"id":"W2266731991","doi":"10.1016/j.tcs.2016.01.037","title":"Topology recognition and leader election in colored networks","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Narodowe Centrum Nauki","keywords":"Node (physics); Colored; Leader election; Computer science; Topology (electrical circuits); Upper and lower bounds; Network topology; Path (computing); Theoretical computer science; Mathematics; Computer network; Combinatorics","score_opus":0.013708711981975702,"score_gpt":0.23691358033165807,"score_spread":0.22320486834968237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266731991","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.08886988,0.00003170696,0.90785325,0.0020677382,0.00047551453,0.00011202623,0.0000012288681,0.0000805113,0.00050817424],"genre_scores_gemma":[0.9902238,0.000010966436,0.009308135,0.00032544378,0.00010986953,0.000009973044,4.9198917e-7,0.00000318847,0.000008094823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984732,0.00010836795,0.00021911759,0.0005452871,0.00021424606,0.00043972995],"domain_scores_gemma":[0.9992616,0.00017625913,0.0000471444,0.00029019613,0.00009729823,0.00012749642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009187108,0.00010861438,0.00015476637,0.00012686537,0.00014055637,0.00015259451,0.00060388417,0.00006883666,0.000013806088],"category_scores_gemma":[0.000042688436,0.00007257113,0.000020007823,0.00075490965,0.0014306034,0.0005936018,0.00026280084,0.00010102401,0.000033199707],"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.000011320272,0.000028383554,0.00025396512,0.000002530279,0.0000013069734,0.000008740482,0.000117350195,0.000026677117,0.0010366893,0.7060021,0.000062126346,0.29244876],"study_design_scores_gemma":[0.0009904321,0.00044004983,0.013099472,0.00013281436,0.0000025610498,0.00017275692,0.000009542069,0.7286216,0.0026761836,0.25307906,0.00038776456,0.0003877714],"about_ca_topic_score_codex":0.000008519034,"about_ca_topic_score_gemma":0.0000041289727,"teacher_disagreement_score":0.90135396,"about_ca_system_score_codex":0.000058797326,"about_ca_system_score_gemma":0.000040099643,"threshold_uncertainty_score":0.5271118},"labels":[],"label_agreement":null},{"id":"W2267246357","doi":"10.1016/j.tcs.2016.02.030","title":"To catch a falling robber","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; State Administration of Foreign Experts Affairs; Ryerson University","keywords":"Falling (accident); Mathematics; Psychology","score_opus":0.021773099119165425,"score_gpt":0.2934336035943495,"score_spread":0.2716605044751841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267246357","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.41091374,0.0000029524658,0.5833275,0.0009834628,0.0003731438,0.00010152364,0.0000013853319,0.00008617508,0.004210155],"genre_scores_gemma":[0.8812785,8.8502105e-7,0.117918134,0.0005754174,0.00016250869,0.000003873774,2.9222813e-8,0.0000099314375,0.000050694773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984736,0.000053743777,0.00018816328,0.00039906046,0.00043211432,0.00045333355],"domain_scores_gemma":[0.99843603,0.00061974215,0.00002899857,0.00054544676,0.00011131542,0.0002584798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183762,0.0001275308,0.00015602623,0.00010735495,0.00034936625,0.000068108246,0.0009107585,0.000038198817,0.00019582937],"category_scores_gemma":[0.00036784192,0.00006681273,0.000052898846,0.0003975205,0.0017105609,0.00012457813,0.00066009624,0.00007644496,0.000068972564],"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.000009737724,0.000013256714,0.000060702514,0.000003652635,0.0000026494074,0.000003155149,0.0005351087,0.000002061707,0.0014079988,0.9751105,0.00013229415,0.022718929],"study_design_scores_gemma":[0.00011997294,0.00007740558,0.0002720715,0.000047041685,0.0000045689485,0.000013757481,0.0000046741184,0.00071450847,0.00582242,0.9925704,0.00020217779,0.0001509957],"about_ca_topic_score_codex":6.924964e-7,"about_ca_topic_score_gemma":4.1243638e-7,"teacher_disagreement_score":0.47036478,"about_ca_system_score_codex":0.00003790912,"about_ca_system_score_gemma":0.000030189807,"threshold_uncertainty_score":0.63026327},"labels":[],"label_agreement":null},{"id":"W2281873354","doi":"10.1016/j.tcs.2017.03.029","title":"A direct algorithm to compute the topological Euler characteristic and Chern–Schwartz–MacPherson class of projective complete intersection varieties","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Chern class; Intersection (aeronautics); Euler's formula; Scheme (mathematics); Gravitational singularity; Euler characteristic; Characteristic class; Complete intersection; Class (philosophy); Field (mathematics); Pure mathematics; Computation; Topology (electrical circuits); Discrete mathematics; Algorithm; Combinatorics; Mathematical analysis; Computer science; Cohomology; Artificial intelligence","score_opus":0.03763302985100976,"score_gpt":0.30511557534237294,"score_spread":0.2674825454913632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281873354","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.45301384,0.000005783945,0.5420318,0.00067172875,0.00060293975,0.00031380178,0.000008938746,0.000055458466,0.0032956556],"genre_scores_gemma":[0.97342116,0.0000016202575,0.026137158,0.00018322948,0.00020393358,0.000013094442,4.9772405e-7,0.000010147236,0.000029147906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822253,0.00022591041,0.00028038633,0.00047954102,0.00041751334,0.0003740952],"domain_scores_gemma":[0.9976939,0.0010727439,0.00019419738,0.0006925954,0.00019189442,0.00015466048],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002063011,0.00020056212,0.00036498223,0.00008313462,0.0009422064,0.00027693147,0.0010468676,0.000071148614,0.00007025299],"category_scores_gemma":[0.0008014466,0.00012644447,0.00006904144,0.00022721672,0.005888459,0.00021577788,0.0010430716,0.00025305836,0.000015066461],"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.000079060075,0.00008523214,0.00012184346,0.000026223983,0.0000258143,0.0000056333847,0.003447781,0.0000017179252,0.0005948417,0.97606575,0.000033796823,0.019512301],"study_design_scores_gemma":[0.00048971607,0.0010896305,0.024707127,0.00013457054,0.000061661405,0.00011167522,0.0004157301,0.07217707,0.005360156,0.8948096,0.00022252265,0.00042056726],"about_ca_topic_score_codex":0.000017162221,"about_ca_topic_score_gemma":0.0000016943176,"teacher_disagreement_score":0.5204073,"about_ca_system_score_codex":0.000043858872,"about_ca_system_score_gemma":0.00003832684,"threshold_uncertainty_score":0.99681693},"labels":[],"label_agreement":null},{"id":"W2284684210","doi":"10.1016/j.tcs.2020.01.031","title":"Paid exchanges are worth the price","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Business; Economics","score_opus":0.03455886438842057,"score_gpt":0.2758827443001755,"score_spread":0.24132387991175494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284684210","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.0003571463,0.00011425142,0.9479861,0.044339996,0.0012733589,0.0005713646,0.0000052527685,0.00048704512,0.004865431],"genre_scores_gemma":[0.75750977,0.00008718809,0.23563819,0.0061719194,0.00047409942,0.000053966764,0.000003199528,0.000020365474,0.00004129684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953672,0.00038440002,0.00039051202,0.0015095699,0.0015341647,0.00081410736],"domain_scores_gemma":[0.9964005,0.00038594494,0.00023615248,0.0020287829,0.00043098535,0.0005176479],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023288229,0.00036810775,0.00037780814,0.00018087,0.00070222566,0.0021538013,0.009715055,0.00013941816,0.00008418571],"category_scores_gemma":[0.00024514584,0.00023991657,0.00014389324,0.001618556,0.0033217377,0.00040842508,0.0137624005,0.001147765,0.00018737534],"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.000003674454,0.000039041228,0.00002508864,0.000040379182,0.000008453672,0.000019626716,0.0014190916,0.0034034417,0.000013559448,0.98125744,0.0007610693,0.013009116],"study_design_scores_gemma":[0.000097234806,0.000077399614,0.0004982958,0.00008580064,0.000004678111,0.000011264177,0.000011615149,0.7832932,0.00015365468,0.21433215,0.0011296875,0.00030503268],"about_ca_topic_score_codex":0.0000033711312,"about_ca_topic_score_gemma":9.566313e-7,"teacher_disagreement_score":0.77988976,"about_ca_system_score_codex":0.00008443689,"about_ca_system_score_gemma":0.0004683401,"threshold_uncertainty_score":0.99939066},"labels":[],"label_agreement":null},{"id":"W2288306272","doi":"10.1016/j.tcs.2016.02.034","title":"The effect of end-markers on counter machines and commutativity","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Commutative property; Nondeterministic algorithm; Mathematics; Decidability; Deterministic pushdown automaton; Finite-state machine; Discrete mathematics; Bounded function; Nested word; Closure (psychology); Regular language; Pushdown automaton; Class (philosophy); Quotient; Automaton; Quantum finite automata; Nondeterministic finite automaton; Combinatorics; Automata theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.0032313319446241667,"score_gpt":0.23135244729608526,"score_spread":0.2281211153514611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288306272","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.4297534,0.000038281214,0.5658057,0.002351215,0.00035540247,0.00013773119,0.0000029275518,0.00008339059,0.0014719613],"genre_scores_gemma":[0.996662,0.000009044491,0.0030102965,0.0002673665,0.000033956923,0.000004830444,6.6315486e-8,0.000004591343,0.000007845079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982035,0.00035284797,0.00018597579,0.00040301282,0.0004989123,0.0003557293],"domain_scores_gemma":[0.9935946,0.0054143956,0.00007231912,0.0007634209,0.00005346084,0.00010184357],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035161062,0.00015297892,0.00018369257,0.000068010384,0.00040525614,0.00020414736,0.00181133,0.000026733404,0.000012358428],"category_scores_gemma":[0.00023057095,0.00006357607,0.00004779244,0.00031903206,0.0054104063,0.00034035833,0.0008793876,0.0000908376,0.000016641769],"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.000032276654,0.000008208015,0.0003127632,0.0000039708816,0.0000034230547,0.0000020096136,0.00006277019,0.000001630514,0.0012513618,0.70048386,0.00003904102,0.2977987],"study_design_scores_gemma":[0.0014807704,0.0038410518,0.017845526,0.00027637897,0.000013023734,0.000078289675,0.0000051116667,0.5029089,0.07878415,0.39382,0.00045190062,0.00049492903],"about_ca_topic_score_codex":0.0000028490908,"about_ca_topic_score_gemma":4.9889064e-7,"teacher_disagreement_score":0.5669086,"about_ca_system_score_codex":0.000023447972,"about_ca_system_score_gemma":0.000025324785,"threshold_uncertainty_score":0.9972963},"labels":[],"label_agreement":null},{"id":"W2288393983","doi":"10.1016/j.tcs.2016.01.025","title":"Rendezvous with constant memory","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rendezvous; Constant (computer programming); Robot; Computer science; Asynchronous communication; Transmission (telecommunications); State (computer science); Mobile robot; Theoretical computer science; Algorithm; Artificial intelligence; Computer network; Telecommunications; Programming language","score_opus":0.009871011720561236,"score_gpt":0.23466240848243702,"score_spread":0.2247913967618758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288393983","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.0016981955,0.0000086174805,0.9732334,0.004831745,0.00019972924,0.00013764226,9.0798005e-7,0.00027067668,0.019619096],"genre_scores_gemma":[0.752451,0.0000058290625,0.24683456,0.00058969617,0.000033872686,0.0000048468405,8.324176e-8,0.0000049549544,0.000075148055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977703,0.00008947438,0.00017881933,0.0006237436,0.00078142644,0.0005562451],"domain_scores_gemma":[0.9983278,0.00022553613,0.00004559146,0.0007996049,0.00025917045,0.0003423169],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010523122,0.00013523629,0.00013831943,0.00015103036,0.0002943418,0.00031940488,0.0019726322,0.00002910251,0.0001208693],"category_scores_gemma":[0.00005947828,0.00006889104,0.000027782182,0.0009295258,0.0039663264,0.00080978434,0.0006804274,0.00009031622,0.0001553386],"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.0000064559817,0.000025043679,0.000022156515,0.0000017663184,0.0000019953586,0.000017205983,0.0001291342,0.000072853225,0.00061466603,0.92496216,0.00006710278,0.07407947],"study_design_scores_gemma":[0.0018728495,0.0013469825,0.00043479097,0.00020172013,0.000005616418,0.00035058972,0.000013439506,0.6336013,0.018599415,0.341669,0.0010895022,0.00081476814],"about_ca_topic_score_codex":9.185632e-7,"about_ca_topic_score_gemma":4.2915212e-7,"teacher_disagreement_score":0.7507528,"about_ca_system_score_codex":0.00005442118,"about_ca_system_score_gemma":0.00024484386,"threshold_uncertainty_score":0.9987443},"labels":[],"label_agreement":null},{"id":"W2289737386","doi":"10.1016/j.tcs.2006.09.011","title":"Preface","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Computer science; Philosophy","score_opus":0.003825225736326931,"score_gpt":0.21797820993581318,"score_spread":0.21415298419948625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289737386","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.6129356,0.00006737547,0.37293485,0.00019145648,0.00018424039,0.00010091768,0.0000015154508,0.00002512185,0.013558902],"genre_scores_gemma":[0.9740733,0.0000025706906,0.025376396,0.00011566934,0.000298317,0.0000030147603,0.0000049083396,0.00000608044,0.00011975798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907905,0.000020739175,0.000090654765,0.0003248581,0.00021326158,0.00027143935],"domain_scores_gemma":[0.99954337,0.0000059911713,0.000017758657,0.00030422249,0.00006208427,0.00006658097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031963427,0.00007933192,0.000057497924,0.000032382413,0.000109430344,0.00005711673,0.0004207322,0.00003172396,0.000038852057],"category_scores_gemma":[0.000012107937,0.0000669745,0.000029911895,0.0001710978,0.0011508379,0.0000035282806,0.0002770745,0.000039188522,0.000055980112],"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.000013376275,0.00008014745,0.0007342894,0.0000050851945,0.000004734939,0.0000035562166,0.000019319416,0.00037732112,0.42443502,0.563682,0.0007518347,0.009893278],"study_design_scores_gemma":[0.0009771878,0.0009554908,0.025014587,0.000016611133,0.000016873155,0.000071759496,0.0000095227715,0.037611313,0.81887764,0.0930397,0.022606267,0.0008030689],"about_ca_topic_score_codex":0.0000023205234,"about_ca_topic_score_gemma":5.594235e-7,"teacher_disagreement_score":0.47064236,"about_ca_system_score_codex":0.000009250545,"about_ca_system_score_gemma":0.000033837263,"threshold_uncertainty_score":0.42403102},"labels":[],"label_agreement":null},{"id":"W2292546119","doi":"10.1016/j.tcs.2013.09.018","title":"Guest Editorsʼ introduction","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Global Security and Public Health","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.007993924183787497,"score_gpt":0.2834320103082725,"score_spread":0.275438086124485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292546119","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.28674972,0.00005125521,0.095278844,0.27616173,0.0562477,0.0011668804,0.0000035657365,0.00084504613,0.28349525],"genre_scores_gemma":[0.9753726,0.0000086906575,0.0032364645,0.0009671327,0.020361444,0.0000057268744,7.329442e-7,0.0000026107664,0.000044592853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980527,0.00019297225,0.00014057486,0.0003168636,0.0007150202,0.0005818655],"domain_scores_gemma":[0.9988855,0.000106776824,0.000030141686,0.00022425737,0.00028902566,0.00046426817],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023975177,0.00006989318,0.00008993083,0.000066874374,0.0010513791,0.00044006456,0.00069905387,0.00005965171,0.0015483635],"category_scores_gemma":[0.00039797134,0.00005909668,0.000025832342,0.0008403512,0.005307934,0.00077025197,0.0001424417,0.00015338264,0.0009667569],"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":[7.775842e-7,0.000024979317,0.000042557345,0.0000014716537,4.97509e-7,2.992834e-7,0.0017236273,0.0000013539294,0.00001666311,0.9674513,0.018950127,0.011786394],"study_design_scores_gemma":[0.00011664816,0.00014554338,0.0021578027,0.000008983903,0.0000027089434,0.0000043146892,0.000416252,0.004257596,0.00014890825,0.4032175,0.58928525,0.00023852021],"about_ca_topic_score_codex":0.0010254962,"about_ca_topic_score_gemma":0.000025369885,"teacher_disagreement_score":0.6886229,"about_ca_system_score_codex":0.000108664826,"about_ca_system_score_gemma":0.00026167213,"threshold_uncertainty_score":0.9998111},"labels":[],"label_agreement":null},{"id":"W2313440826","doi":"10.1016/j.tcs.2011.08.039","title":"WITHDRAWN: Quantum cryptography: Public key distribution and coin tossing","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":114,"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é de Montréal","funders":"","keywords":"Coin flipping; Public-key cryptography; Cryptography; Key (lock); Computer security; Computer science; Quantum key distribution; Quantum cryptography; Theoretical computer science; Mathematics; Quantum; Encryption; Statistics; Physics; Quantum information; Quantum mechanics","score_opus":0.046140776292576936,"score_gpt":0.2645989169087647,"score_spread":0.21845814061618776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313440826","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.34662506,0.000008981581,0.65046656,0.000084896696,0.00018526577,0.000084627696,0.0000022840907,0.0001075089,0.0024348383],"genre_scores_gemma":[0.9498212,0.0000018178048,0.05003027,0.00006921057,0.0000630709,0.0000038651197,0.0000012831276,0.0000074852524,0.0000017995874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866897,0.000060838654,0.0002062381,0.0003423745,0.0003351821,0.00038638304],"domain_scores_gemma":[0.9991663,0.00012197114,0.00006361779,0.0003079808,0.00013016621,0.00020993597],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009784144,0.0001311015,0.00015337297,0.00008593116,0.00049444236,0.00024998668,0.00030651942,0.000061012805,0.000069788555],"category_scores_gemma":[0.00013124285,0.00010288479,0.000042566902,0.0005702777,0.0033714504,0.00041656388,0.00020190571,0.0001552189,0.000010972012],"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.000013654562,0.000049500082,0.00032728395,0.000010530689,0.0000032715932,0.000002267876,0.00032690662,9.2235815e-8,0.00013436578,0.98954386,0.000031008207,0.009557238],"study_design_scores_gemma":[0.0001721037,0.0002277199,0.003090349,0.000025854808,0.0000119823435,0.000047848403,0.000021976599,0.038612347,0.002503381,0.95498526,0.00013034248,0.00017084664],"about_ca_topic_score_codex":0.000009779305,"about_ca_topic_score_gemma":0.0000034686707,"teacher_disagreement_score":0.60319614,"about_ca_system_score_codex":0.000027107746,"about_ca_system_score_gemma":0.000036535617,"threshold_uncertainty_score":0.9993408},"labels":[],"label_agreement":null},{"id":"W2338410001","doi":"10.1016/j.tcs.2016.04.005","title":"Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"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":"Submodular set function; Vertex cover; Cover (algebra); Vertex (graph theory); Mathematics; Edge cover; Approximation algorithm; Dual (grammatical number); Covering problems; Combinatorics; Set cover problem; Mathematical optimization; Algorithm; Computer science; Graph; Set (abstract data type)","score_opus":0.027205835633059547,"score_gpt":0.26314649833605147,"score_spread":0.2359406627029919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338410001","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.011565758,0.000021021018,0.98565274,0.0007498789,0.000380821,0.0011270881,0.0000118454955,0.00033917086,0.00015169593],"genre_scores_gemma":[0.43619007,0.0000027893461,0.5634573,0.00014582685,0.0001118011,0.000066389344,0.0000013164558,0.000014983345,0.00000949889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963026,0.000119905926,0.00042259693,0.0011875189,0.0010551471,0.0009122028],"domain_scores_gemma":[0.99756294,0.00035934855,0.00016366462,0.0010677973,0.0005681481,0.00027808922],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002074476,0.00035344873,0.00036371808,0.00032072846,0.0007234496,0.00043273394,0.0020871537,0.00010382589,0.000021032856],"category_scores_gemma":[0.00009916071,0.00022414463,0.00011933227,0.0012439418,0.003372088,0.0016139692,0.0008871865,0.00018735867,0.00001656961],"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.000028242901,0.000119905664,0.00003750563,0.000042561245,0.00001377154,0.000008293905,0.0002618555,0.00072902243,0.008577956,0.95012575,0.000015835036,0.040039323],"study_design_scores_gemma":[0.00057287375,0.0005291128,0.00010877643,0.00017024453,0.000010193625,0.0001336038,0.000003126694,0.74291664,0.03194693,0.22303519,0.00018024033,0.00039308728],"about_ca_topic_score_codex":0.0000054325446,"about_ca_topic_score_gemma":4.5297517e-7,"teacher_disagreement_score":0.7421876,"about_ca_system_score_codex":0.00015220183,"about_ca_system_score_gemma":0.000280236,"threshold_uncertainty_score":0.9993402},"labels":[],"label_agreement":null},{"id":"W2342108770","doi":"10.1016/j.tcs.2016.04.016","title":"An alternative proof for the equivalence of ∞-searcher and 2-searcher","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Visibility; Equivalence (formal languages); Conjecture; Computer science; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.03990573698417783,"score_gpt":0.33345797334618205,"score_spread":0.2935522363620042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342108770","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.0057678344,0.000028212806,0.9886567,0.004592671,0.0001143679,0.000431971,0.0000028381871,0.000039920033,0.0003655079],"genre_scores_gemma":[0.8491029,0.000021823495,0.15057331,0.00019365385,0.000049948696,0.000023339899,9.0503e-8,0.0000051918873,0.00002974187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801594,0.0001613174,0.00019305186,0.0005185814,0.0006558916,0.00045520088],"domain_scores_gemma":[0.9972827,0.0012770514,0.00005516636,0.00068572257,0.00046974543,0.0002296256],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030943467,0.00010618605,0.00012557919,0.00010338419,0.00028815217,0.00028181254,0.0024907715,0.000028490336,0.00003545347],"category_scores_gemma":[0.00028309476,0.000051597573,0.000034046232,0.00050592225,0.004976913,0.0010522205,0.00078607205,0.00008895531,0.0000052732703],"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.000010782944,0.000036005655,0.00003692339,0.0000069777407,0.0000033368553,4.483843e-7,0.0005384496,0.00012498857,0.002780168,0.834769,0.000011370865,0.16168156],"study_design_scores_gemma":[0.00031376435,0.00048135934,0.00040732985,0.000031085558,0.0000017885029,0.000004955906,0.000009524446,0.794253,0.016830169,0.18747488,0.000093062554,0.00009908713],"about_ca_topic_score_codex":0.0000030774354,"about_ca_topic_score_gemma":4.125854e-7,"teacher_disagreement_score":0.84333503,"about_ca_system_score_codex":0.000025935577,"about_ca_system_score_gemma":0.00014323994,"threshold_uncertainty_score":0.997731},"labels":[],"label_agreement":null},{"id":"W2343833891","doi":"10.1016/j.tcs.2003.11.001","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Theoretical 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":"Dalhousie University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.010688338425084355,"score_gpt":0.25891585120388516,"score_spread":0.2482275127788008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343833891","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.2970267,0.000019981786,0.54695654,0.00014543929,0.0004947074,0.00017405816,0.0000021344433,0.0003538219,0.15482664],"genre_scores_gemma":[0.933949,2.8290074e-7,0.06572397,0.00024463536,0.000039030427,0.000002668679,1.5230792e-7,0.000015267624,0.000025022291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997961,0.00014080136,0.00014543455,0.0004929559,0.0006701979,0.0005896525],"domain_scores_gemma":[0.9988547,0.00012446687,0.000028159107,0.0005723008,0.00012460182,0.00029578584],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002035433,0.00012381613,0.00011766497,0.00010709916,0.0002882743,0.00017339877,0.0008478825,0.000026689308,0.00058918],"category_scores_gemma":[0.0002819064,0.00009760812,0.000035310222,0.001191996,0.006063393,0.00027657076,0.00020282967,0.00013536365,0.0052797315],"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.0000039648908,0.000038499467,0.00010829929,0.0000012301024,0.0000010349139,0.000003997579,0.000116710326,0.00008157884,0.0036489563,0.9944749,0.00013727165,0.0013835824],"study_design_scores_gemma":[0.00049634906,0.00025495776,0.0023004268,0.000023398223,0.000009846404,0.00013679701,0.000012637384,0.097651504,0.09836347,0.79485136,0.0053874375,0.00051183347],"about_ca_topic_score_codex":4.965357e-7,"about_ca_topic_score_gemma":1.1095774e-7,"teacher_disagreement_score":0.6369223,"about_ca_system_score_codex":0.00006514167,"about_ca_system_score_gemma":0.000112337875,"threshold_uncertainty_score":0.9966415},"labels":[],"label_agreement":null},{"id":"W2344606806","doi":"10.1016/j.tcs.2016.04.015","title":"On Sillke's bijection","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Cardinality (data modeling); Indecomposable module; Combinatorics; Mathematics; Group (periodic table); Discrete mathematics; Computer science; Chemistry; Database","score_opus":0.005954904830763786,"score_gpt":0.223660163684643,"score_spread":0.21770525885387923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344606806","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.06245361,0.000005824001,0.9278975,0.0024886108,0.00094266585,0.00007898233,8.192159e-7,0.0004318349,0.0057001207],"genre_scores_gemma":[0.96727616,0.0000027650854,0.03135483,0.0011924691,0.00012846207,0.0000044888334,7.9343636e-8,0.000006507448,0.000034237484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997875,0.00008663744,0.00018184251,0.00071556884,0.00062432577,0.0005166212],"domain_scores_gemma":[0.9981559,0.0005219717,0.000048167236,0.0009591512,0.00009179446,0.0002230219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011749695,0.00015620771,0.00013543053,0.00020868902,0.00032544043,0.00027703177,0.0021893245,0.000041927935,0.00009887277],"category_scores_gemma":[0.00012903611,0.00008771217,0.00005930369,0.0008534038,0.0017800934,0.00075227447,0.0006550102,0.00008968029,0.00063631043],"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.0000044860208,0.00003056239,0.000008297957,8.4223524e-7,0.000001159076,0.0000056009944,0.000047145884,0.00000792207,0.0034257113,0.8145745,0.00010756264,0.18178624],"study_design_scores_gemma":[0.00026876928,0.00036656842,0.0007766958,0.0000522979,0.0000013782545,0.000039161972,0.0000012753893,0.10102351,0.025189608,0.8717868,0.00026507044,0.00022891903],"about_ca_topic_score_codex":9.507162e-7,"about_ca_topic_score_gemma":9.019705e-8,"teacher_disagreement_score":0.9048225,"about_ca_system_score_codex":0.00007522481,"about_ca_system_score_gemma":0.00006038374,"threshold_uncertainty_score":0.81786954},"labels":[],"label_agreement":null},{"id":"W2397866482","doi":"10.1016/j.tcs.2016.05.018","title":"State complexity of prefix distance","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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":"Substring; Suffix; Generalized suffix tree; Prefix; Combinatorics; Regular language; Mathematics; Deterministic finite automaton; Nondeterministic algorithm; Nondeterministic finite automaton; Discrete mathematics; State (computer science); Suffix tree; Set (abstract data type); Finite-state machine; Automaton; Computer science; Algorithm; Theoretical computer science; Automata theory","score_opus":0.016784463291252882,"score_gpt":0.24484974529758166,"score_spread":0.22806528200632878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397866482","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.07601975,0.00002210887,0.92042696,0.0011672768,0.000352309,0.000096712734,0.000008177319,0.0001946091,0.0017121024],"genre_scores_gemma":[0.8838148,0.000005210701,0.11591856,0.00019694968,0.00003524005,0.0000028772745,1.4003776e-7,0.000005543435,0.000020687856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976954,0.0001065279,0.00033293874,0.0006428852,0.0006809405,0.00054132985],"domain_scores_gemma":[0.997984,0.00033503177,0.0001188135,0.001157836,0.00018154884,0.00022280352],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013473224,0.00016356503,0.00024098463,0.00011911262,0.00018180402,0.00012817454,0.0032348535,0.00002709533,0.00005762208],"category_scores_gemma":[0.00008021945,0.00009712958,0.000069122354,0.000808294,0.008069877,0.00082020194,0.0012295826,0.00007605033,0.0000672018],"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.000007349289,0.00004368404,0.00008931805,0.000006046505,0.0000024064216,0.0000037936861,0.00015949996,0.0000050928506,0.0054726056,0.9023367,0.000027480408,0.09184602],"study_design_scores_gemma":[0.00025385598,0.00014842482,0.0030553695,0.00007107206,0.0000016077537,0.000015152683,0.0000016657292,0.07779958,0.04433599,0.87398404,0.00014000406,0.00019326419],"about_ca_topic_score_codex":0.0000024991512,"about_ca_topic_score_gemma":5.35955e-7,"teacher_disagreement_score":0.80779505,"about_ca_system_score_codex":0.00004813511,"about_ca_system_score_gemma":0.00009539005,"threshold_uncertainty_score":0.99462956},"labels":[],"label_agreement":null},{"id":"W2400068012","doi":"10.1016/j.tcs.2016.05.024","title":"Document retrieval with one wildcard","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Canada Research Chairs","keywords":"Substring; Symbol (formal); String (physics); Computer science; Data structure; Alphabet; Extension (predicate logic); Linear space; Space (punctuation); Pattern matching; Listing (finance); Combinatorics; Mathematics; Algorithm; Theoretical computer science; Information retrieval; Artificial intelligence; Linguistics","score_opus":0.00782486814828636,"score_gpt":0.22878456495539984,"score_spread":0.22095969680711347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400068012","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.014585338,0.000017832897,0.9801157,0.0030217478,0.00035362938,0.00013736554,0.000001995471,0.00023621894,0.0015301489],"genre_scores_gemma":[0.6872209,0.000006948693,0.31227684,0.0003423348,0.00011988125,0.0000023048867,2.6199947e-7,0.000005727042,0.000024815561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702656,0.00007416387,0.0002175178,0.0008729924,0.0011895694,0.0006191979],"domain_scores_gemma":[0.9978685,0.00021329465,0.00006709773,0.0012904993,0.00019444032,0.00036619065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010372022,0.00018396843,0.00019661845,0.00012901751,0.00035082846,0.00043268054,0.0028570907,0.00003993131,0.00007260238],"category_scores_gemma":[0.000044452754,0.00009492773,0.000039285766,0.00089210935,0.0023392255,0.001514149,0.0017407092,0.00011201555,0.0001668749],"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.000024103723,0.000037161222,0.000030214638,0.0000018531072,0.0000035296307,0.000013590061,0.000057314843,0.0000055256473,0.001811793,0.89434814,0.00006654185,0.10360022],"study_design_scores_gemma":[0.0027956734,0.0029056736,0.0068036984,0.0006189229,0.00002179294,0.00027310706,0.000006193448,0.14890139,0.091797955,0.74009466,0.0043227645,0.001458195],"about_ca_topic_score_codex":0.0000020793846,"about_ca_topic_score_gemma":1.6573509e-7,"teacher_disagreement_score":0.67263556,"about_ca_system_score_codex":0.00008104506,"about_ca_system_score_gemma":0.00014869095,"threshold_uncertainty_score":0.86189735},"labels":[],"label_agreement":null},{"id":"W2400176033","doi":"10.1016/s0304-3975(04)00143-4","title":"On the number of nonterminals in linear conjunctive grammars*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Terminal and nonterminal symbols; Indexed grammar; Mathematics; Context-sensitive grammar; Disjoint sets; Discrete mathematics; Combinatorics; Rule-based machine translation; Computer science; Context-free grammar; Natural language processing","score_opus":0.009711916773719308,"score_gpt":0.2632984173633767,"score_spread":0.2535865005896574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400176033","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.35643312,0.0000048007587,0.6391427,0.0014735244,0.00031695885,0.00012905861,0.000001020156,0.000051601928,0.0024472217],"genre_scores_gemma":[0.95527774,0.0000015700169,0.043324266,0.0013415652,0.00003799889,0.0000064784917,1.5693091e-7,0.000005221667,0.0000049791092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807256,0.00012078956,0.00029255103,0.0004981574,0.0005883502,0.00042755785],"domain_scores_gemma":[0.9981474,0.0007036929,0.00008371739,0.000848879,0.00010987535,0.00010643138],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019160864,0.00015714917,0.00021372248,0.000116801166,0.00015197342,0.0001124866,0.0025866407,0.000041586096,0.000045897024],"category_scores_gemma":[0.00016275569,0.00009600713,0.00006930258,0.0011299065,0.0028319298,0.00034072157,0.00069501926,0.00022433604,0.000120742916],"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.000011340947,0.00010210812,0.000055327942,0.0000028068073,0.0000019697054,0.000016667018,0.0005764087,0.0003104731,0.00025693973,0.9933652,0.000007710549,0.005293008],"study_design_scores_gemma":[0.00031340777,0.00015796433,0.0010963571,0.00008634762,0.0000014947875,0.000033754,0.000016231168,0.09877591,0.008602179,0.8907733,0.000008464758,0.00013456911],"about_ca_topic_score_codex":0.000013888579,"about_ca_topic_score_gemma":8.510892e-7,"teacher_disagreement_score":0.59884465,"about_ca_system_score_codex":0.00006127857,"about_ca_system_score_gemma":0.00012279808,"threshold_uncertainty_score":0.9998818},"labels":[],"label_agreement":null},{"id":"W2401552927","doi":"10.1016/j.tcs.2019.03.015","title":"Weighted minimum backward Fréchet distance","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Mathematics; Tree traversal; Combinatorics; Euclidean space; Simple (philosophy); Euclidean distance; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Geometry; Computer science; Artificial intelligence","score_opus":0.006085964691183508,"score_gpt":0.23055598571832414,"score_spread":0.22447002102714064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401552927","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.11456374,0.00003742515,0.87598675,0.001071276,0.0013864059,0.00018377411,0.0000015021188,0.0001848687,0.006584284],"genre_scores_gemma":[0.81710553,0.0000025611957,0.18187404,0.00074437616,0.00014571701,0.0000043530154,0.0000025893335,0.000005605861,0.00011521122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973901,0.00008581608,0.00027951176,0.00085442176,0.0008735425,0.0005166103],"domain_scores_gemma":[0.9983239,0.00024496805,0.00007234968,0.0008461319,0.00025912898,0.00025347545],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009647092,0.0001851263,0.00019763976,0.00021234079,0.00026918543,0.0004742809,0.0020912406,0.000050320967,0.0001678648],"category_scores_gemma":[0.000035747576,0.00015803053,0.000072167444,0.001836226,0.00076031813,0.0009535858,0.0007517485,0.00016550545,0.0009007711],"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.000006423907,0.00004306288,0.00011225754,0.0000058728215,0.000002873683,0.000004250845,0.0001463871,0.00056038797,0.0012475939,0.97193384,0.00015321857,0.02578382],"study_design_scores_gemma":[0.0002541636,0.00016019601,0.0014544439,0.000017598746,0.0000020814991,0.000023525654,0.0000024016956,0.8379269,0.005460034,0.15203707,0.0024128659,0.00024866057],"about_ca_topic_score_codex":8.721105e-7,"about_ca_topic_score_gemma":2.3949184e-7,"teacher_disagreement_score":0.8373666,"about_ca_system_score_codex":0.00006603234,"about_ca_system_score_gemma":0.00017400034,"threshold_uncertainty_score":0.99987715},"labels":[],"label_agreement":null},{"id":"W2407207612","doi":"10.1016/j.tcs.2016.02.036","title":"Permuted scaled matching","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Canada Research Chairs","keywords":"Substring; Permutation (music); Matching (statistics); String searching algorithm; Mathematics; Scaling; Computer science; 3-dimensional matching; Pattern matching; Algorithm; Blossom algorithm; Artificial intelligence; Set (abstract data type); Statistics","score_opus":0.007325258038249031,"score_gpt":0.23932446873999386,"score_spread":0.2319992107017448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407207612","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.025403759,0.000013634706,0.96912867,0.0025689234,0.00069029257,0.00009167723,0.00000257685,0.0003482126,0.0017522338],"genre_scores_gemma":[0.74145925,0.0000036480276,0.25799555,0.00038570678,0.00012626225,0.0000032660068,2.7256058e-7,0.0000053816407,0.000020680589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975173,0.00008302043,0.0002385224,0.0008015879,0.00075240637,0.00060716964],"domain_scores_gemma":[0.99802876,0.00027152905,0.000056405042,0.0011629916,0.00014607391,0.00033423663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010443589,0.00017117828,0.00017261006,0.00015298693,0.0004715766,0.00042799735,0.0034541688,0.000044171935,0.00009553515],"category_scores_gemma":[0.000058113055,0.000095010786,0.000056490884,0.0007514118,0.0017131218,0.0015558673,0.0023280387,0.00010817063,0.0003061704],"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.0000029372345,0.00002364348,0.000018399336,0.0000013619857,0.0000012100402,0.000010655919,0.000092150454,0.0000053917715,0.005721207,0.81815577,0.00010174679,0.17586553],"study_design_scores_gemma":[0.00060941925,0.00018053643,0.0026167438,0.00013556755,0.000003277781,0.000110257126,0.0000033041738,0.34483302,0.013217252,0.63682497,0.001004673,0.00046099233],"about_ca_topic_score_codex":0.000003165789,"about_ca_topic_score_gemma":1.9008988e-7,"teacher_disagreement_score":0.71605545,"about_ca_system_score_codex":0.000055869248,"about_ca_system_score_gemma":0.000094568175,"threshold_uncertainty_score":0.6418763},"labels":[],"label_agreement":null},{"id":"W2409994095","doi":"10.1016/j.tcs.2016.04.046","title":"An FPTAS for the parallel two-stage flowshop problem","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; Program for Changjiang Scholars and Innovative Research Team in University; Georgia Southern University","keywords":"Job shop scheduling; Schedule; Subroutine; Computer science; Mathematical optimization; Scheme (mathematics); Dynamic programming; Time complexity; Scheduling (production processes); Polynomial-time approximation scheme; Parallel computing; Algorithm; Mathematics","score_opus":0.01124981111899529,"score_gpt":0.25387417817360247,"score_spread":0.2426243670546072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409994095","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.004030716,0.00002035861,0.99387956,0.000561999,0.00038899106,0.00017823464,0.000004981559,0.00027570664,0.0006594635],"genre_scores_gemma":[0.57548606,0.000004370943,0.42421943,0.0001095447,0.00013683649,0.000016273929,4.3606607e-7,0.000009456218,0.000017603053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991219,0.000017787004,0.00012442877,0.00022806526,0.00020039611,0.00030741515],"domain_scores_gemma":[0.99915886,0.00026245083,0.000011540981,0.00036397018,0.000076342185,0.00012681058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007029287,0.00009601915,0.00007919643,0.000039867362,0.00021121823,0.00013098093,0.00065182755,0.000023684313,0.0000749654],"category_scores_gemma":[0.000031191328,0.00004849831,0.000031385385,0.0002261889,0.0008639434,0.00018787413,0.000052702017,0.000055391843,0.000032113316],"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.000005337064,0.000010285666,0.000006434241,0.0000038668823,0.0000034211305,4.729332e-7,0.00011839537,0.24121507,0.0004926996,0.70650893,0.000028364868,0.051606733],"study_design_scores_gemma":[0.00027610973,0.000055283766,0.00003747366,0.000011120023,0.0000037607194,0.0000026422708,0.0000064238025,0.9838573,0.0013201784,0.01411171,0.00021032781,0.00010767325],"about_ca_topic_score_codex":4.764973e-7,"about_ca_topic_score_gemma":3.5793218e-7,"teacher_disagreement_score":0.7426422,"about_ca_system_score_codex":0.000022905666,"about_ca_system_score_gemma":0.000022018203,"threshold_uncertainty_score":0.31832355},"labels":[],"label_agreement":null},{"id":"W2416495215","doi":"10.1016/j.tcs.2016.04.041","title":"A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisfiability; Probabilistic logic; Constraint programming; Constraint (computer-aided design); Computer science; Mathematics; Programming language; Theoretical computer science; Algorithm; Mathematical optimization; Discrete mathematics; Stochastic programming; Artificial intelligence","score_opus":0.021345531829380798,"score_gpt":0.2795715204165245,"score_spread":0.2582259885871437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416495215","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.4668438,0.0000022743977,0.5324575,0.0001761611,0.00006931434,0.00033032146,3.9471172e-7,0.000049618637,0.000070643844],"genre_scores_gemma":[0.7901732,5.170621e-7,0.20978029,0.00002095908,0.000009704697,0.000012689911,4.8863456e-8,0.000002196742,4.3004914e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818724,0.00021076987,0.0003838654,0.00055823463,0.00036091966,0.00029897603],"domain_scores_gemma":[0.99858373,0.0006275519,0.00010295217,0.0003529249,0.00021339406,0.00011946475],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015857733,0.00011653185,0.00019216775,0.00015380418,0.00013512354,0.00010787594,0.00042726388,0.000030338646,0.000011867904],"category_scores_gemma":[0.0007559956,0.00008103986,0.000016779257,0.0008713342,0.0027932238,0.0004268033,0.0003824902,0.0000718891,0.0000012195994],"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.000006018555,0.00013223724,0.018770317,0.000008258009,0.000001626389,0.000002743775,0.00084453035,0.00019745604,0.0013149712,0.48077247,2.5429085e-7,0.49794912],"study_design_scores_gemma":[0.0016324549,0.0007570892,0.14734782,0.000107963315,0.0000053020613,0.00003964286,0.000058282792,0.7856122,0.0004767438,0.06372139,0.0000014932538,0.00023956812],"about_ca_topic_score_codex":0.000030222382,"about_ca_topic_score_gemma":0.000019824824,"teacher_disagreement_score":0.7854148,"about_ca_system_score_codex":0.00007375949,"about_ca_system_score_gemma":0.00013299388,"threshold_uncertainty_score":0.9999206},"labels":[],"label_agreement":null},{"id":"W2418872760","doi":"10.1016/j.tcs.2016.04.044","title":"Approximating the restricted 1-center in graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Saddle point; Approximation algorithm; Center (category theory); Separable space; Binary logarithm; Vertex (graph theory); Discrete mathematics; Matrix (chemical analysis); Distance matrix; Graph; Mathematical analysis; Geometry","score_opus":0.01411976057326362,"score_gpt":0.24352743115335584,"score_spread":0.22940767058009223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418872760","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.04564873,0.0000151945005,0.9460687,0.0049221716,0.0005149934,0.00017309556,0.0000012710099,0.00016785396,0.0024879857],"genre_scores_gemma":[0.88521945,0.000005592333,0.114146575,0.0005528351,0.000054456636,0.000010663033,1.1449316e-7,0.0000046722503,0.0000056609856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974508,0.00018107754,0.00035084592,0.0006674148,0.00067661796,0.00067323796],"domain_scores_gemma":[0.9979615,0.0006625332,0.00007232518,0.0010535183,0.00010261815,0.00014748152],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016049854,0.00016442667,0.00016545772,0.0002797515,0.00042473874,0.00035410686,0.004052106,0.000037862435,0.000023939116],"category_scores_gemma":[0.00018017815,0.00008204833,0.000070859074,0.0025637576,0.0034503725,0.0007019644,0.0015490863,0.0002018154,0.00004577482],"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.0000026556017,0.000046588717,0.00037176444,0.0000016213068,0.0000012704706,0.00000789866,0.0002149494,0.0000050914464,0.00030844033,0.8801236,0.000025855965,0.11889025],"study_design_scores_gemma":[0.00042052785,0.00008614879,0.007051143,0.00007299861,0.0000010047912,0.00004578011,0.000005386055,0.22286615,0.0009608141,0.7681163,0.00017685899,0.00019688506],"about_ca_topic_score_codex":0.000004365083,"about_ca_topic_score_gemma":0.0000017826331,"teacher_disagreement_score":0.8395707,"about_ca_system_score_codex":0.000050275154,"about_ca_system_score_gemma":0.00007363737,"threshold_uncertainty_score":0.9992617},"labels":[],"label_agreement":null},{"id":"W242605419","doi":"10.1016/j.tcs.2015.05.005","title":"An adaptive algorithm for group testing for complexes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Group testing; Cardinality (data modeling); Mathematics; Generalization; Group (periodic table); Combinatorics; Algorithm; Property testing; Set (abstract data type); Binary number; Polynomial; Discrete mathematics; Computer science; Arithmetic; Data mining","score_opus":0.09479870449260654,"score_gpt":0.3446798799702559,"score_spread":0.24988117547764938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242605419","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.10074377,0.000008849012,0.8973748,0.000088583125,0.00030405915,0.00048304317,0.000005722971,0.00018957272,0.00080158206],"genre_scores_gemma":[0.51710093,1.1715813e-8,0.48186362,0.0007267959,0.00028006165,0.000018304132,0.0000012208455,0.000007916062,0.0000011131154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870896,0.000028258459,0.0001807224,0.00040613054,0.00029888772,0.00037702007],"domain_scores_gemma":[0.9982559,0.0006447701,0.0000482229,0.00023264265,0.0005832218,0.00023522651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097331,0.00011768618,0.00019361293,0.00009973655,0.00026327002,0.00008745118,0.00025101096,0.00003596966,0.0000021772937],"category_scores_gemma":[0.0007162838,0.000094255614,0.000046267385,0.00043103768,0.0012528724,0.0001715545,0.00007659299,0.00009129394,0.0000064443607],"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.00015844445,0.00017675075,0.0001378414,0.000014934042,0.00000829697,0.000006327479,0.00034430422,0.000019814079,0.053160436,0.4596382,0.00006369683,0.48627096],"study_design_scores_gemma":[0.0010092106,0.003958348,0.00016498576,0.00004038512,0.00001740719,0.000101609854,0.000051032748,0.8957105,0.040981483,0.057712995,0.00012989966,0.00012214035],"about_ca_topic_score_codex":0.000005772959,"about_ca_topic_score_gemma":4.7144388e-7,"teacher_disagreement_score":0.8956907,"about_ca_system_score_codex":0.000059589867,"about_ca_system_score_gemma":0.00011485126,"threshold_uncertainty_score":0.46162605},"labels":[],"label_agreement":null},{"id":"W2460638073","doi":"10.1016/j.tcs.2007.05.022","title":"Width versus size in resolution proofs","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Mathematical proof; Exponential function; Theme (computing); Propositional calculus; Computer science; Upper and lower bounds; Mathematics; Calculus (dental); Discrete mathematics; Combinatorics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.024770213205656318,"score_gpt":0.2673765226264571,"score_spread":0.2426063094208008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460638073","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.8162522,0.000013846327,0.008493802,0.00050083274,0.0016514483,0.00016805512,0.0000017964958,0.000059623293,0.17285845],"genre_scores_gemma":[0.99848604,9.0434906e-7,0.00095963245,0.00014116282,0.00030039536,0.0000012996608,2.6769854e-7,0.0000035371206,0.00010676086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989276,0.00003190114,0.00016424486,0.000228473,0.00029968534,0.0003480833],"domain_scores_gemma":[0.9994217,0.00021276646,0.000025100659,0.00015234553,0.00009738178,0.00009069421],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015907758,0.00007267481,0.00008523399,0.000089385634,0.00030909618,0.00019461097,0.0002934479,0.000018863113,0.00053402846],"category_scores_gemma":[0.00011022942,0.000058540434,0.000023438537,0.00016248351,0.0029969646,0.00022479026,0.00012932147,0.000114744005,0.000070130125],"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.00004832406,0.000040934527,0.000086462336,0.0000021854285,9.4083947e-7,0.00000666296,0.0014950935,0.0000055168016,0.00008893267,0.99278283,0.000054122305,0.0053879838],"study_design_scores_gemma":[0.0022136176,0.0012345816,0.037348196,0.00008878213,0.00001258691,0.000005292985,0.00033072275,0.04882264,0.0034860722,0.88348866,0.022272717,0.0006961355],"about_ca_topic_score_codex":0.000025267704,"about_ca_topic_score_gemma":0.0006920218,"teacher_disagreement_score":0.1822339,"about_ca_system_score_codex":0.000070317445,"about_ca_system_score_gemma":0.000042744912,"threshold_uncertainty_score":0.9997163},"labels":[],"label_agreement":null},{"id":"W2470754857","doi":"10.1016/j.tcs.2016.06.022","title":"Mitigating covert channels based on analysis of the potential for communication","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Covert; Covert channel; Computer science; Concurrency; Channel (broadcasting); Limiting; Communications system; Order (exchange); Distributed computing; Theoretical computer science; Computer network; Engineering","score_opus":0.013632418037605558,"score_gpt":0.263277827929747,"score_spread":0.24964540989214146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470754857","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.03205543,0.0000048160036,0.9627221,0.004296208,0.0004137458,0.00017700493,0.000004824164,0.00005599795,0.00026986422],"genre_scores_gemma":[0.91166884,7.558449e-7,0.087528385,0.00074601325,0.00004031218,0.000008820447,6.2685984e-7,0.0000032814512,0.0000029801859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828523,0.0001700993,0.000293288,0.00042599507,0.00055066496,0.00027469816],"domain_scores_gemma":[0.99691755,0.0011832825,0.00017685618,0.0013419403,0.0003021353,0.00007821123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017486153,0.000103489976,0.0001756655,0.00021840268,0.0005405553,0.00015987577,0.0031455732,0.000038072478,0.000012355984],"category_scores_gemma":[0.00027171883,0.000059659276,0.00017855507,0.0019699235,0.0015689412,0.0002446397,0.0005347779,0.00007339061,0.0000033064352],"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.000006432041,0.00004051268,0.00007341075,0.0000034924935,0.00001378723,7.937141e-8,0.00015892934,0.010270118,0.001255008,0.9728511,0.000017325425,0.015309819],"study_design_scores_gemma":[0.00019913986,0.0000704228,0.0018664987,0.00005672456,0.000026062737,6.851149e-7,0.0000026948287,0.935801,0.0131127965,0.048745528,0.000026767979,0.00009166199],"about_ca_topic_score_codex":0.0000020280247,"about_ca_topic_score_gemma":2.4850212e-7,"teacher_disagreement_score":0.9255309,"about_ca_system_score_codex":0.00005006446,"about_ca_system_score_gemma":0.00009900917,"threshold_uncertainty_score":0.584531},"labels":[],"label_agreement":null},{"id":"W2472694993","doi":"10.1016/j.tcs.2016.06.027","title":"Conspiracy number search with relative sibling scores","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Heuristic; Null-move heuristic; Champion; Computer science; Tree (set theory); Node (physics); Iterative deepening depth-first search; Search tree; Game tree; Search algorithm; Bidirectional search; Mathematics; Algorithm; Theoretical computer science; Best-first search; Beam search; Monte Carlo method; Artificial intelligence; Statistics; Combinatorics; Game theory; Sequential game","score_opus":0.029266208269517896,"score_gpt":0.3119599208179767,"score_spread":0.28269371254845876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472694993","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.10882609,0.000008063701,0.88016325,0.0029274384,0.0002700979,0.00016400944,9.1975477e-7,0.00025636377,0.007383774],"genre_scores_gemma":[0.7948104,0.0000035785881,0.20465049,0.0003761947,0.0000943008,0.0000058876562,6.3036886e-8,0.000009268907,0.00004981369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966615,0.00015267263,0.00030598897,0.00095573306,0.0010936502,0.0008304998],"domain_scores_gemma":[0.9968775,0.0012041588,0.000071008384,0.0010049515,0.0004923282,0.00035008517],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015539519,0.00021693563,0.00021163982,0.00019601587,0.000496826,0.0005106791,0.0029407712,0.000054215325,0.00018394933],"category_scores_gemma":[0.00023214023,0.00011991299,0.000052759253,0.0016854844,0.00837663,0.0022058685,0.0012228596,0.00021083097,0.0010691525],"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.000013252325,0.000031874024,0.0020125087,0.0000020583411,0.0000045499046,0.000026293632,0.0006243741,0.000060716342,0.0009138804,0.92366713,0.000020426882,0.0726229],"study_design_scores_gemma":[0.0002858754,0.00056922634,0.0018003603,0.0002769871,0.0000071514464,0.00015942709,0.000030027162,0.19864976,0.12376868,0.67360085,0.00021434105,0.000637327],"about_ca_topic_score_codex":0.000008931934,"about_ca_topic_score_gemma":0.0000015080248,"teacher_disagreement_score":0.6859843,"about_ca_system_score_codex":0.00009568018,"about_ca_system_score_gemma":0.00029402258,"threshold_uncertainty_score":0.99970865},"labels":[],"label_agreement":null},{"id":"W2484948871","doi":"10.1016/j.tcs.2012.12.012","title":"Quantum entanglement and the communication complexity of the inner product function","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":11,"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é de Montréal; University of Waterloo","funders":"","keywords":"Computer science; Quantum entanglement; Communication complexity; Quantum information science; Product (mathematics); Probabilistic logic; Bounded function; Theoretical computer science; Mathematical proof; Quantum capacity; Function (biology); Quantum; Discrete mathematics; Mathematics; Quantum network; Quantum mechanics; Physics","score_opus":0.02005179859931104,"score_gpt":0.25480346788828306,"score_spread":0.234751669288972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484948871","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.52326274,0.00006600662,0.47046036,0.0039967326,0.00022568855,0.0003844766,0.0000056011286,0.0000112950775,0.0015870619],"genre_scores_gemma":[0.99894667,0.00000103635,0.0008388811,0.000105392435,0.00008584994,0.00001612957,0.0000013764917,0.000002463252,0.000002216752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932224,0.00010043783,0.00013109775,0.00011113757,0.00018542034,0.00014966825],"domain_scores_gemma":[0.9992572,0.00007631309,0.000073853385,0.00048661476,0.000064513384,0.000041488605],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001167011,0.0000564532,0.00007414618,0.0000135160535,0.00042159454,0.000037762577,0.0004294974,0.000005921409,0.00005273291],"category_scores_gemma":[0.0000066223165,0.00002797589,0.000030332541,0.00025227567,0.0032952596,0.00009171927,0.00039438152,0.00008884498,0.000004408279],"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.000005750184,0.000049777504,0.0007611647,0.0000013020946,0.0000033658862,7.510464e-10,0.0002548939,0.0000014462993,0.00020237589,0.99488926,0.000027020538,0.0038036718],"study_design_scores_gemma":[0.00018512047,0.0000129471755,0.007702365,0.000007338246,0.000013786321,4.6287963e-7,0.000051324958,0.040271703,0.0021548267,0.9493181,0.00023717781,0.00004486278],"about_ca_topic_score_codex":0.000025327014,"about_ca_topic_score_gemma":3.6137095e-7,"teacher_disagreement_score":0.4756839,"about_ca_system_score_codex":0.0000070538727,"about_ca_system_score_gemma":0.000016935328,"threshold_uncertainty_score":0.9994172},"labels":[],"label_agreement":null},{"id":"W2485167870","doi":"10.1016/j.tcs.2016.07.039","title":"Dynamic range majority data structures","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Data structure; Amortized analysis; Combinatorics; Range (aeronautics); Mathematics; Set (abstract data type); Range query (database); Constant (computer programming); Space (punctuation); Upper and lower bounds; Fraction (chemistry); Discrete mathematics; Computer science; Information retrieval; Search engine; Web search query; Sargable","score_opus":0.017063029502736967,"score_gpt":0.2707024161268978,"score_spread":0.25363938662416086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485167870","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.0033029318,0.000023526734,0.98997223,0.003507378,0.0010286646,0.00013034689,0.000026105354,0.0002827759,0.0017260495],"genre_scores_gemma":[0.6804887,0.000010583212,0.31897303,0.0003903987,0.000086528824,0.0000018000001,0.0000035017617,0.000005276745,0.000040182444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971431,0.000074848846,0.00021620434,0.0011631583,0.0007937003,0.00060897885],"domain_scores_gemma":[0.9962425,0.00018104078,0.00005658116,0.0032082184,0.000083983774,0.00022766039],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015488251,0.00017986106,0.00016705229,0.00016174909,0.00031514425,0.00065717223,0.011292897,0.000033628665,0.00009076754],"category_scores_gemma":[0.00010093599,0.00010623733,0.0000323205,0.0008166511,0.0022937497,0.0030136164,0.008292439,0.00009986144,0.00021368117],"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.000001907564,0.0000152000985,0.00004284896,0.000002476391,0.0000027237445,0.00001075646,0.000020219635,8.0098084e-7,0.00017469587,0.7502822,0.00029316964,0.24915294],"study_design_scores_gemma":[0.00041452117,0.000089230576,0.0053461124,0.000024521945,0.000006355873,0.00002249903,0.0000016349474,0.48519507,0.00043159517,0.50611025,0.002024302,0.00033389067],"about_ca_topic_score_codex":0.0000027116744,"about_ca_topic_score_gemma":0.0000011820932,"teacher_disagreement_score":0.6771858,"about_ca_system_score_codex":0.000044542998,"about_ca_system_score_gemma":0.00006591332,"threshold_uncertainty_score":0.9997283},"labels":[],"label_agreement":null},{"id":"W2491829515","doi":"10.1016/j.tcs.2015.09.011","title":"The Beachcombers' Problem: Walking and searching with mobile robots","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Schedule; Mobile robot; Set (abstract data type); Computer science; Algorithm; Line segment; Real-time computing; Artificial intelligence","score_opus":0.012996402439254037,"score_gpt":0.26030036725639494,"score_spread":0.2473039648171409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491829515","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.0056109163,0.00007250896,0.9860474,0.0020690935,0.00012747436,0.00032104828,1.747239e-7,0.0001584771,0.005592926],"genre_scores_gemma":[0.63437474,0.00000953459,0.36529648,0.00023348791,0.000032629145,0.000017035962,2.0979597e-7,0.0000057662974,0.00003012518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976159,0.00019107322,0.00017520493,0.00051602704,0.0009016862,0.0006001367],"domain_scores_gemma":[0.9982991,0.00032317132,0.000045666995,0.00056886167,0.00028500587,0.00047816068],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003435091,0.00013484035,0.00012124213,0.000095233176,0.0009111874,0.0015552572,0.0017563899,0.000025418014,0.0000029591292],"category_scores_gemma":[0.00006165352,0.00007597502,0.000017621825,0.00089469313,0.0028904558,0.0008456242,0.0013196799,0.0002481622,0.000016063575],"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.00000662908,0.000018959408,0.000077681456,0.0000033189676,0.0000026426223,0.000005110553,0.0020539232,0.0076995273,0.0000193013,0.9253128,0.000046815818,0.06475327],"study_design_scores_gemma":[0.00029696856,0.00042251352,0.00010897233,0.000026551239,0.0000016576854,0.00007030575,0.00005449115,0.90813726,0.00016278753,0.090061605,0.0005001109,0.00015674904],"about_ca_topic_score_codex":0.0000050109993,"about_ca_topic_score_gemma":0.000001773061,"teacher_disagreement_score":0.9004378,"about_ca_system_score_codex":0.000045248114,"about_ca_system_score_gemma":0.00023364958,"threshold_uncertainty_score":0.9998231},"labels":[],"label_agreement":null},{"id":"W2493758942","doi":"10.1016/j.tcs.2017.03.040","title":"Outfix-guided insertion","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Mathematics; Computer science","score_opus":0.021440013269191774,"score_gpt":0.2984234565227588,"score_spread":0.27698344325356705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493758942","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.88136137,0.000013435661,0.107357495,0.00044509777,0.00035395758,0.00006425075,7.543931e-7,0.00002196293,0.010381676],"genre_scores_gemma":[0.99032104,0.000004049108,0.00875003,0.0005036832,0.00037214067,0.0000015757562,0.0000026430132,0.0000041624253,0.000040694256],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989583,0.000034035962,0.0001226217,0.00041452967,0.0001719058,0.00029864415],"domain_scores_gemma":[0.99906904,0.000011451987,0.00006184649,0.0006370375,0.00009747168,0.0001231337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333996,0.00009771925,0.0000891795,0.000021566693,0.00075721054,0.0002434287,0.0010815816,0.000063627485,0.000018328572],"category_scores_gemma":[0.00026920234,0.0000699062,0.000049483184,0.000050220082,0.0023129538,0.000008846368,0.0009217989,0.00007109427,0.000034424505],"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.000046998575,0.00007429802,0.0064019742,0.0000060926923,0.000007953634,0.00000807155,0.000026507143,0.000050742023,0.54809695,0.3862865,0.00038429268,0.058609616],"study_design_scores_gemma":[0.0012194038,0.0019026189,0.2081895,0.00006463803,0.000017909182,0.000110225374,0.0000109696375,0.061509937,0.6498072,0.06921778,0.0069122096,0.0010375929],"about_ca_topic_score_codex":0.0000027559718,"about_ca_topic_score_gemma":5.903275e-7,"teacher_disagreement_score":0.31706873,"about_ca_system_score_codex":0.0000075907087,"about_ca_system_score_gemma":0.000035148478,"threshold_uncertainty_score":0.85221744},"labels":[],"label_agreement":null},{"id":"W2495876702","doi":"10.1016/j.tcs.2016.07.018","title":"An efficient method to evaluate intersections on big data sets","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trie; Intersection (aeronautics); Identifier; Computer science; Context (archaeology); Set (abstract data type); Interval (graph theory); Theoretical computer science; Tree (set theory); Search tree; Sequence (biology); Data structure; Node (physics); Inverted index; Algorithm; Binary tree; Data mining; Mathematics; Information retrieval; Search algorithm; Search engine indexing; Combinatorics","score_opus":0.0577306352145133,"score_gpt":0.3662562790384329,"score_spread":0.30852564382391956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495876702","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.009710053,0.0000033591605,0.98492193,0.0024783367,0.0017940694,0.00020170232,0.000030278425,0.00025023005,0.00061004533],"genre_scores_gemma":[0.56770766,5.8432965e-7,0.43130904,0.00079289824,0.00017145365,0.000005240973,0.0000018293646,0.000006244721,0.000005040553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961554,0.00032894622,0.00026973282,0.0015966888,0.0010331842,0.0006160812],"domain_scores_gemma":[0.9947888,0.00044267412,0.000056007168,0.0038979137,0.0001972003,0.00061737216],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0036687132,0.00021037976,0.00019164768,0.00030775362,0.00050109247,0.0004940461,0.007630551,0.000042679683,0.000040162347],"category_scores_gemma":[0.00015127532,0.000121559395,0.00003597982,0.0011403136,0.00075560855,0.0007781297,0.004837737,0.00013679273,0.00039442212],"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.000010299386,0.00009304376,0.0000034622708,8.573631e-7,0.0000015335021,0.000005269985,0.00013913619,0.00074006314,0.0021418403,0.41339383,0.00022167747,0.583249],"study_design_scores_gemma":[0.00024237389,0.0006029518,0.00066568493,0.00007573508,0.0000039204756,0.000030557665,0.0000039284128,0.970352,0.0045070862,0.022346787,0.00091793475,0.00025106288],"about_ca_topic_score_codex":0.000008381557,"about_ca_topic_score_gemma":0.0000010758813,"teacher_disagreement_score":0.96961194,"about_ca_system_score_codex":0.00008523041,"about_ca_system_score_gemma":0.00013926573,"threshold_uncertainty_score":0.99773866},"labels":[],"label_agreement":null},{"id":"W2523839178","doi":"10.1016/j.tcs.2017.05.001","title":"Functional clones and expressibility of partition functions","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Partition (number theory); Combinatorics; Functional analysis; Multiplication (music); Boolean function; Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Lattice (music); Computer science; Biology; Physics; Genetics","score_opus":0.02092870772223816,"score_gpt":0.2655031272994424,"score_spread":0.24457441957720427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523839178","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.18738426,0.00001609534,0.8102006,0.00054301904,0.00043301968,0.00005647514,0.0000011903245,0.00004956612,0.0013157752],"genre_scores_gemma":[0.9495007,0.0000028395432,0.050324477,0.000077685385,0.000077102195,0.0000041103813,3.3045777e-7,0.0000018305577,0.000010947994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879354,0.000036628728,0.00016348973,0.00045675974,0.00032434368,0.00022525719],"domain_scores_gemma":[0.9985873,0.00011579142,0.00010382026,0.0009199379,0.0001424789,0.00013064803],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00061615073,0.000088238114,0.00012344391,0.00005635806,0.0009190704,0.00025747303,0.000995339,0.000028188882,0.000028997209],"category_scores_gemma":[0.00013902811,0.00006824904,0.000032886004,0.00013994862,0.0041582286,0.0011324554,0.00090877595,0.00008669304,0.000013810641],"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.0000055308515,0.000033744283,0.0009929048,0.000004452431,0.0000012990104,0.0000011811394,0.00006123415,0.00006231157,0.0015197997,0.9726383,0.000017736837,0.024661481],"study_design_scores_gemma":[0.00020058245,0.00014120845,0.14928284,0.000017052658,0.0000033791973,0.000019200033,0.0000043999044,0.11539426,0.0071527543,0.7276142,0.000042507483,0.00012758686],"about_ca_topic_score_codex":0.000002066346,"about_ca_topic_score_gemma":5.253638e-7,"teacher_disagreement_score":0.76211643,"about_ca_system_score_codex":0.000012243405,"about_ca_system_score_gemma":0.00004568132,"threshold_uncertainty_score":0.9985519},"labels":[],"label_agreement":null},{"id":"W2530989744","doi":"10.1016/j.tcs.2016.09.020","title":"Rate-limited secure function evaluation","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Technische Universität Darmstadt; Aarhus Universitet","keywords":"Function (biology); Computer science; Mathematics; Algorithm; Biology","score_opus":0.013407019797567228,"score_gpt":0.25250418889849796,"score_spread":0.23909716910093073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530989744","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.03878812,0.000025772002,0.9563734,0.0017312668,0.0010042123,0.00019565421,0.00000398003,0.00026228465,0.0016153003],"genre_scores_gemma":[0.9583718,0.0000053627077,0.040840767,0.0006215589,0.00014155284,0.000011332208,0.0000018815305,0.000004444816,0.0000012971439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728453,0.00026373615,0.00022748439,0.0008077673,0.0009334772,0.00048303054],"domain_scores_gemma":[0.9978913,0.00031420315,0.00006722424,0.0010648487,0.0004185873,0.000243801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037371288,0.00016041387,0.0001336674,0.00024224463,0.00038856725,0.0003629153,0.0018044106,0.000059414775,0.00018250904],"category_scores_gemma":[0.00020082884,0.00009997579,0.0000688672,0.0016629023,0.0016694362,0.0016938053,0.0007184684,0.00010881646,0.00018445106],"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.000011731106,0.00003515334,0.00005610258,0.000001623177,0.000002760704,0.0000014570332,0.000092895745,0.000006603592,0.0024747956,0.8543782,0.00017210472,0.14276655],"study_design_scores_gemma":[0.0004898956,0.00023664291,0.006347395,0.000029859193,0.000010070261,0.000012779083,0.0000026911373,0.2334867,0.0039076507,0.7544604,0.0007861909,0.0002297404],"about_ca_topic_score_codex":0.0000013634183,"about_ca_topic_score_gemma":8.907965e-7,"teacher_disagreement_score":0.9195837,"about_ca_system_score_codex":0.000063873646,"about_ca_system_score_gemma":0.0001446594,"threshold_uncertainty_score":0.6151107},"labels":[],"label_agreement":null},{"id":"W2538425405","doi":"10.1016/j.tcs.2016.10.005","title":"Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"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":"Fibonacci number; Computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.010856704063362848,"score_gpt":0.2600031196010287,"score_spread":0.24914641553766584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538425405","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.25564137,0.000057856465,0.74103403,0.0019474984,0.0005642484,0.0002914562,0.0000042891675,0.00030727184,0.00015196603],"genre_scores_gemma":[0.70545167,0.0000085707825,0.29422247,0.00022738561,0.000047792026,0.000018242075,3.057443e-7,0.0000068648033,0.000016699963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970653,0.00012070747,0.00045005817,0.0010824058,0.00061467517,0.0006668511],"domain_scores_gemma":[0.9962788,0.002145317,0.00010801571,0.0009751541,0.00017087563,0.00032181025],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034588738,0.00023780469,0.00029581328,0.00017296747,0.00080322206,0.0003731142,0.002229097,0.000087925124,0.00005329264],"category_scores_gemma":[0.00050595624,0.00014008002,0.00008375671,0.0008144225,0.0033647043,0.0011754251,0.0015671849,0.00010789689,0.000028126371],"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.000004196002,0.00002700796,0.000028515286,0.000005511457,0.000002451501,0.0000022349689,0.00021412825,0.0000027963183,0.0007353862,0.55752325,0.00002766061,0.4414269],"study_design_scores_gemma":[0.00034579422,0.00026235438,0.0011647377,0.00009402276,0.0000036176239,0.000043916487,0.0000049452237,0.39519522,0.0018114137,0.6007797,0.00010222907,0.00019205178],"about_ca_topic_score_codex":0.0000021842043,"about_ca_topic_score_gemma":4.69813e-7,"teacher_disagreement_score":0.4498103,"about_ca_system_score_codex":0.00007997585,"about_ca_system_score_gemma":0.000119887874,"threshold_uncertainty_score":0.99934757},"labels":[],"label_agreement":null},{"id":"W2548497170","doi":"10.1016/j.tcs.2018.05.030","title":"Whom to befriend to influence people","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Influencer marketing; Dominating set; Time complexity; DTIME; Computer science; Social network (sociolinguistics); Set (abstract data type); Viral marketing; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Graph; Computation; Algorithm; Vertex (graph theory); Social media","score_opus":0.004446420588320317,"score_gpt":0.2697570541844836,"score_spread":0.26531063359616325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548497170","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.46210796,4.103386e-7,0.5326898,0.00043321156,0.00005845496,0.000102531216,0.0000014706137,0.000060022398,0.00454613],"genre_scores_gemma":[0.9034375,1.9612205e-8,0.09528039,0.00075999636,0.00048515789,0.000012736913,5.988874e-7,0.0000070913784,0.000016495665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983994,0.00003428574,0.0001853792,0.00051921327,0.00037080544,0.0004909532],"domain_scores_gemma":[0.9986248,0.000074795804,0.000027572134,0.0006037697,0.0002729577,0.00039608366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053386623,0.00013561663,0.00017863286,0.00015465428,0.0005725869,0.0004572892,0.0011160827,0.000013446846,0.00061833207],"category_scores_gemma":[0.00001910692,0.00011695413,0.00004928871,0.0017555007,0.0017242781,0.00015738558,0.000968351,0.00008838414,0.0006158481],"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.000006086138,0.000027325379,0.0027574396,5.3953056e-7,0.0000033927859,2.9947927e-7,0.00087044016,0.00014115298,0.0009665146,0.9701949,0.00045703058,0.024574894],"study_design_scores_gemma":[0.00022488195,0.0012609402,0.050122406,0.00009445408,0.00003125454,0.0000037337568,0.00005327865,0.12271564,0.0475266,0.7640365,0.012929547,0.001000764],"about_ca_topic_score_codex":0.000040457908,"about_ca_topic_score_gemma":0.0000075795715,"teacher_disagreement_score":0.44132957,"about_ca_system_score_codex":0.000026614765,"about_ca_system_score_gemma":0.00007626998,"threshold_uncertainty_score":0.7915687},"labels":[],"label_agreement":null},{"id":"W2549642977","doi":"10.1016/j.tcs.2016.11.014","title":"Covering points with convex sets of minimum size","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Automated Road and Building Extraction","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Education; Hankuk University of Foreign Studies","keywords":"Perimeter; Mathematics; Regular polygon; Combinatorics; Cover (algebra); Bounded function; Plane (geometry); Cluster analysis; Convex set; Set (abstract data type); Algorithm; Computer science; Convex optimization; Geometry; Statistics; Mathematical analysis","score_opus":0.004117169033881237,"score_gpt":0.2045481531417101,"score_spread":0.20043098410782886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549642977","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.6423237,0.0000046937216,0.35574865,0.00009214156,0.000192301,0.000036928508,0.000001426773,0.00017285952,0.0014273673],"genre_scores_gemma":[0.9863959,0.0000032283806,0.013533806,0.000025405636,0.000028152152,9.746295e-7,7.0538206e-8,0.0000081298895,0.0000043140803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992885,0.0000098966075,0.00011218293,0.00015189758,0.00022679078,0.0002107257],"domain_scores_gemma":[0.99951476,0.00017615424,0.000020271862,0.00017024155,0.00004456966,0.00007399756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303095,0.00008027615,0.000107123014,0.00004314012,0.000045130797,0.000022428854,0.00022601023,0.000026975049,0.0000711646],"category_scores_gemma":[0.000029504296,0.000046043453,0.000016465887,0.00021180115,0.00092589186,0.0001945797,0.000052514188,0.000047927955,0.00002439953],"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.000059416067,0.000057935908,0.0006960202,0.00008316025,0.000027047407,0.000022288372,0.0003672385,0.0029459263,0.42828906,0.49103644,0.0002059328,0.07620954],"study_design_scores_gemma":[0.0008377048,0.00035175265,0.011419309,0.00044287348,0.000015211192,0.00009416208,0.000009429234,0.50224614,0.46529913,0.018688407,0.00018521465,0.00041068534],"about_ca_topic_score_codex":3.9163646e-7,"about_ca_topic_score_gemma":7.63737e-8,"teacher_disagreement_score":0.4993002,"about_ca_system_score_codex":0.000027698012,"about_ca_system_score_gemma":0.00001641674,"threshold_uncertainty_score":0.34114873},"labels":[],"label_agreement":null},{"id":"W2550472248","doi":"10.1016/j.tcs.2016.11.019","title":"Evacuating two robots from multiple unknown exits in a circle","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Parameterized complexity; Mobile robot; Simple (philosophy); Computer science; Control (management); Mathematics; Domain (mathematical analysis); Algorithm; Topology (electrical circuits); Artificial intelligence; Combinatorics; Mathematical analysis","score_opus":0.017454379383506465,"score_gpt":0.27701269766194486,"score_spread":0.2595583182784384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550472248","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.057509817,0.000013291661,0.93796057,0.0022897704,0.0003193481,0.0001818698,0.0000015756943,0.00017925822,0.0015445265],"genre_scores_gemma":[0.76430506,0.0000036586641,0.23522004,0.0003822855,0.00006156794,0.000008575442,3.7343293e-7,0.0000060803613,0.000012362942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972263,0.00019986105,0.00032812377,0.0008447822,0.00071652053,0.0006843979],"domain_scores_gemma":[0.9979219,0.0007981485,0.00006045979,0.0007591737,0.00015577239,0.00030457834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015212899,0.00015036346,0.00019054956,0.00022240402,0.00022710241,0.00036482618,0.0023421126,0.00004082705,0.000082467224],"category_scores_gemma":[0.00037286285,0.000108002896,0.000042982512,0.0012736513,0.0012232013,0.0011053467,0.0012482826,0.00014562922,0.00020028201],"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.00000487125,0.000058757898,0.00079964555,0.0000016677426,0.0000015634207,0.000011257508,0.00046487784,0.0021289892,0.004124689,0.7692006,0.000011381825,0.22319168],"study_design_scores_gemma":[0.0008513075,0.0000715025,0.0041935425,0.00008673153,7.184066e-7,0.0000044378244,0.0000022715037,0.86237663,0.0051476136,0.12703365,0.00003548192,0.00019610104],"about_ca_topic_score_codex":0.000026145737,"about_ca_topic_score_gemma":0.000012985268,"teacher_disagreement_score":0.8602477,"about_ca_system_score_codex":0.0000956378,"about_ca_system_score_gemma":0.00015570545,"threshold_uncertainty_score":0.4506936},"labels":[],"label_agreement":null},{"id":"W2552316968","doi":"10.1016/j.tcs.2016.10.015","title":"On prefix normal words and prefix normal forms","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Prefix; Word (group theory); Mathematics; Combinatorics; Context (archaeology); Equivalence (formal languages); Binary number; Unary operation; Discrete mathematics; Prefix code; Arithmetic; Algorithm; Linguistics","score_opus":0.006545220852153862,"score_gpt":0.22883456753285955,"score_spread":0.22228934668070569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552316968","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.09848851,0.000021083268,0.8959011,0.0011358111,0.00053352694,0.00014894639,0.000007150429,0.00019346499,0.0035704002],"genre_scores_gemma":[0.9126408,0.000010141094,0.08637796,0.00078490656,0.0001162482,0.0000088459055,7.621631e-7,0.000009212757,0.000051083764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969289,0.00007423655,0.0002966177,0.0009816306,0.00091196975,0.0008066503],"domain_scores_gemma":[0.9976251,0.00046719462,0.00008168803,0.0011307265,0.000106004525,0.00058929727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010752465,0.0002614748,0.00022721104,0.00018922647,0.00053021463,0.00051747134,0.002559214,0.00007649208,0.00008298939],"category_scores_gemma":[0.0001463983,0.00014457434,0.000054281423,0.00058963115,0.0021464408,0.0021178008,0.002838955,0.00018647648,0.00013630869],"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.000020778076,0.00004739454,0.000044740013,0.000004012389,0.000002167771,0.000008912028,0.00014520941,0.000013275076,0.0003962917,0.831418,0.00018666068,0.1677126],"study_design_scores_gemma":[0.0010841761,0.001189396,0.0027773671,0.00020952681,0.0000059221093,0.0001258456,0.0000036737115,0.35885808,0.007025441,0.6272845,0.00080299156,0.00063306233],"about_ca_topic_score_codex":0.0000028844452,"about_ca_topic_score_gemma":4.7463072e-7,"teacher_disagreement_score":0.81415236,"about_ca_system_score_codex":0.000053135103,"about_ca_system_score_gemma":0.00012501427,"threshold_uncertainty_score":0.79086506},"labels":[],"label_agreement":null},{"id":"W2561213546","doi":"10.1016/j.tcs.2019.10.021","title":"Kochen-Specker sets and Hadamard matrices","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical proof; Hadamard transform; Kochen–Specker theorem; Parity (physics); Class (philosophy); Simple (philosophy); Discrete mathematics; Combinatorics; Pure mathematics; Computer science; Physics; Quantum","score_opus":0.005715462573881126,"score_gpt":0.23983065091279487,"score_spread":0.23411518833891376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561213546","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.7339089,0.000011995281,0.25825438,0.00038601234,0.000117967946,0.00011505171,0.0000041843264,0.000022798275,0.007178756],"genre_scores_gemma":[0.9935362,0.0000011802489,0.006257096,0.00010690397,0.00007480342,0.0000042875963,0.0000013026411,0.000004472315,0.000013792547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992296,0.000011565495,0.00009183401,0.0002845605,0.0001732126,0.0002091976],"domain_scores_gemma":[0.99953043,0.000051248542,0.00002636686,0.00024270051,0.00004173358,0.000107505686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026451822,0.00007631499,0.00008957293,0.00003521191,0.00013926515,0.00013906058,0.00029327738,0.0000122884,0.00043232847],"category_scores_gemma":[8.519608e-7,0.000060140115,0.000022710401,0.00022586019,0.00040614954,0.00010873887,0.00022848645,0.00007604546,0.00023330534],"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.0000011362258,0.000017663824,0.00065599463,0.0000016571869,0.0000022553436,1.14524134e-7,0.000046632027,0.000002138527,0.00049220835,0.990078,0.000033004097,0.008669238],"study_design_scores_gemma":[0.00011614114,0.00003900263,0.0015535705,0.00000864433,0.0000046733862,0.0000013589279,0.000016037266,0.12515195,0.0012395587,0.87118304,0.00057423743,0.00011178359],"about_ca_topic_score_codex":0.0000037218413,"about_ca_topic_score_gemma":3.4741948e-8,"teacher_disagreement_score":0.25962728,"about_ca_system_score_codex":0.0000055226524,"about_ca_system_score_gemma":0.000024736682,"threshold_uncertainty_score":0.47336936},"labels":[],"label_agreement":null},{"id":"W2561282814","doi":"10.1016/j.tcs.2012.10.008","title":"Toward a classification of finite partial-monitoring games","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Computer science; Algebra over a field; Calculus (dental); Mathematical economics; Pure mathematics; Medicine","score_opus":0.18861928299444541,"score_gpt":0.44523061759891325,"score_spread":0.25661133460446783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561282814","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.12641075,0.000063443906,0.8710493,0.000363667,0.0008073623,0.00011334146,0.0000023867042,0.00003570631,0.0011540655],"genre_scores_gemma":[0.96155363,0.000005157028,0.03797325,0.000022106959,0.00040926633,0.0000072470084,2.4464322e-7,0.000006199581,0.000022908505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530727,0.0002195722,0.0005174397,0.0004792919,0.002798354,0.0006781044],"domain_scores_gemma":[0.9956476,0.0024469518,0.00014981044,0.0007867954,0.00059838424,0.0003704661],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00736225,0.00011911232,0.0002376774,0.00034422628,0.0002102596,0.00020638574,0.0018086111,0.000046868096,0.00020223591],"category_scores_gemma":[0.00377963,0.000081869664,0.000071922404,0.0020725683,0.0041321213,0.0010194721,0.0006574076,0.00018516874,0.00029213514],"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.000037503094,0.00015471957,0.011888319,0.0000063897446,0.000004316914,0.0000024025762,0.0020180817,0.000736916,0.0052675684,0.67327,0.00005050898,0.3065633],"study_design_scores_gemma":[0.00036674424,0.00027500925,0.12788895,0.000047900085,0.0000077122495,0.000017920218,0.0003709767,0.50149965,0.12164664,0.24623938,0.0012850683,0.00035401498],"about_ca_topic_score_codex":0.0000012340134,"about_ca_topic_score_gemma":4.129242e-8,"teacher_disagreement_score":0.83514285,"about_ca_system_score_codex":0.000055730507,"about_ca_system_score_gemma":0.000099045224,"threshold_uncertainty_score":0.9985781},"labels":[],"label_agreement":null},{"id":"W2564591273","doi":"10.1016/j.tcs.2017.03.035","title":"Computing real witness points of positive dimensional polynomial systems","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"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":"Witness; Mathematics; Component (thermodynamics); Polynomial; Connected component; Perturbation (astronomy); Path (computing); Mathematical optimization; Algorithm; Computer science; Applied mathematics; Mathematical analysis; Discrete mathematics","score_opus":0.010384160367676391,"score_gpt":0.2589777510609282,"score_spread":0.2485935906932518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564591273","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.39435837,0.000010912369,0.6013252,0.00058534316,0.0015870208,0.00014287172,0.0000033064357,0.00008203684,0.0019049043],"genre_scores_gemma":[0.96379036,0.0000011084933,0.035779953,0.000100497244,0.00031038505,0.0000015777131,0.0000011304069,0.00000760441,0.0000073751257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725217,0.00012751143,0.0004465651,0.0007513857,0.0008546743,0.00056769693],"domain_scores_gemma":[0.99762136,0.00033080595,0.0003679564,0.0010581649,0.00033630853,0.00028538183],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014842968,0.00021841793,0.00036034625,0.00017385346,0.0012534093,0.0008173472,0.003692739,0.00006198706,0.000004892215],"category_scores_gemma":[0.00011374566,0.00018372288,0.00009292808,0.00031352296,0.0040002586,0.0010478299,0.0025708468,0.00017874518,0.00002799577],"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.000019875997,0.000061675055,0.00019302014,0.000010483347,0.000008172467,0.000015667925,0.0003569083,0.00086506293,0.0017383595,0.97395265,0.00003277703,0.022745356],"study_design_scores_gemma":[0.00047306027,0.00021441444,0.030310988,0.00012971403,0.000006179642,0.00006446597,0.0000047529834,0.93270326,0.006635806,0.029185345,0.0000053495373,0.0002666446],"about_ca_topic_score_codex":0.0001278294,"about_ca_topic_score_gemma":9.812136e-7,"teacher_disagreement_score":0.9447673,"about_ca_system_score_codex":0.000074525364,"about_ca_system_score_gemma":0.0002878408,"threshold_uncertainty_score":0.9987103},"labels":[],"label_agreement":null},{"id":"W2582851771","doi":"10.1016/j.tcs.2017.01.028","title":"Algorithmic complexity of weakly semiregular partitioning and the representation number","year":2017,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","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; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Injective function; Bipartite graph; Vertex (graph theory); Graph; Conjecture; Modulo; Degree (music); Discrete mathematics; Induced subgraph; Physics","score_opus":0.031946229294501596,"score_gpt":0.29685800832948783,"score_spread":0.26491177903498625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582851771","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.060497027,0.00015099722,0.9304885,0.0048985053,0.0011290109,0.00043708025,0.0000053437097,0.000145039,0.0022484583],"genre_scores_gemma":[0.8349707,0.000028342965,0.16477935,0.00015298926,0.00003458333,0.000016217724,0.0000023318662,0.0000064605506,0.000009042738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969268,0.0003280948,0.00047772267,0.000984927,0.0008893149,0.00039317142],"domain_scores_gemma":[0.9964586,0.00033469152,0.00043614313,0.0021683369,0.00043118524,0.00017104635],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035208885,0.00024219375,0.00045996765,0.00010709953,0.00094312464,0.0009993549,0.002904066,0.00011238116,0.000013291847],"category_scores_gemma":[0.0002177554,0.00016451051,0.00013005623,0.000318139,0.020713525,0.00036873532,0.0056903902,0.00046694843,0.000013113469],"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.000010366136,0.000024145962,0.00010778704,0.000027090096,0.000011574068,0.0000031039765,0.0006489741,0.0003885809,0.00009216134,0.99218124,0.000044926666,0.0064600473],"study_design_scores_gemma":[0.00025223923,0.000015044464,0.0007457657,0.00011143272,0.000010842003,0.000022253851,0.0000030644976,0.43057388,0.0011520775,0.5669924,0.0000049219475,0.000116083254],"about_ca_topic_score_codex":0.00010125147,"about_ca_topic_score_gemma":0.0000013431753,"teacher_disagreement_score":0.77447367,"about_ca_system_score_codex":0.000022826473,"about_ca_system_score_gemma":0.00016934866,"threshold_uncertainty_score":0.98195153},"labels":[],"label_agreement":null},{"id":"W2585764344","doi":"10.1016/j.tcs.2017.02.012","title":"Abelian-square-rich words","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Square (algebra); Abelian group; Combinatorics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.012208342314047174,"score_gpt":0.2651676796845346,"score_spread":0.2529593373704874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585764344","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.07114929,0.00003411289,0.9073104,0.002837604,0.0015692143,0.00012700478,0.0000013023017,0.00038556923,0.016585488],"genre_scores_gemma":[0.8877917,0.000005450564,0.111111134,0.0008010693,0.00022968878,0.000006184258,2.7095555e-7,0.00000935832,0.000045148092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702924,0.00007554608,0.00027064563,0.0009471537,0.0008564681,0.00082095736],"domain_scores_gemma":[0.9959037,0.0001866071,0.00014884534,0.0032355303,0.00015791904,0.00036744273],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0020927445,0.00023313733,0.00024680782,0.0001701567,0.0020125476,0.002726354,0.009611363,0.00006605003,0.000077505276],"category_scores_gemma":[0.000205245,0.00018386368,0.0000836868,0.00049274584,0.0045693,0.0018475294,0.003346822,0.0002346982,0.0004233424],"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.0000026555165,0.000039511906,0.00018643789,0.0000038067667,0.0000027054602,0.000024817318,0.0002626872,0.000010371069,0.0003849942,0.89128923,0.00011259118,0.10768021],"study_design_scores_gemma":[0.00031316362,0.000171199,0.010038188,0.000053050015,0.0000044058534,0.000061344064,0.00000748328,0.42742264,0.006577344,0.5543546,0.00057514803,0.00042143956],"about_ca_topic_score_codex":0.0000067091205,"about_ca_topic_score_gemma":5.861334e-7,"teacher_disagreement_score":0.8166424,"about_ca_system_score_codex":0.00005167387,"about_ca_system_score_gemma":0.0001313087,"threshold_uncertainty_score":0.9992867},"labels":[],"label_agreement":null},{"id":"W2592557380","doi":"10.1016/j.tcs.2017.02.016","title":"Constructing an indeterminate string from its associated graph","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Mathematics; Cardinality (data modeling); Discrete mathematics; Heuristics; Clique; Alphabet; String (physics); Vertex cover; Heuristic; Graph; Computer science; Mathematical optimization","score_opus":0.020535399402898905,"score_gpt":0.2824883555088229,"score_spread":0.261952956105924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592557380","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.31531078,0.000010292351,0.682184,0.0001931471,0.0009189884,0.000081005004,0.000013937338,0.0001835106,0.0011043643],"genre_scores_gemma":[0.87297326,0.0000020575337,0.12674843,0.000117909316,0.00014163884,0.0000022387435,0.000003838689,0.000006975976,0.00000364552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972719,0.000115803836,0.00027759233,0.00096183654,0.00075133325,0.0006215419],"domain_scores_gemma":[0.997015,0.00019102191,0.0002534236,0.0019363437,0.00022105446,0.0003831416],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012422726,0.00020778626,0.00024740555,0.00013003816,0.0020161383,0.0028302083,0.006636079,0.00008201687,0.000027056622],"category_scores_gemma":[0.00029407552,0.00017427765,0.00005558661,0.00029474936,0.0020925167,0.0037192646,0.0036809382,0.00029538805,0.000032818643],"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.0000027576555,0.000037960977,0.0007371766,0.0000012782339,0.0000039632505,0.000031219224,0.0001648305,0.000011772971,0.00061180687,0.7934161,0.000006105313,0.20497505],"study_design_scores_gemma":[0.0003207952,0.00011134402,0.0127883,0.00007259988,0.0000045087836,0.000014856845,0.000010582936,0.81629086,0.008645186,0.16143698,0.000013303683,0.00029066883],"about_ca_topic_score_codex":0.000038062237,"about_ca_topic_score_gemma":0.000004199874,"teacher_disagreement_score":0.8162791,"about_ca_system_score_codex":0.0000617182,"about_ca_system_score_gemma":0.00010186965,"threshold_uncertainty_score":0.9992831},"labels":[],"label_agreement":null},{"id":"W2595036685","doi":"10.1016/j.tcs.2017.03.007","title":"State complexity of permutation on finite languages over a binary alphabet","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"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; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Deterministic finite automaton; Combinatorics; Mathematics; Permutation (music); Regular language; Modulo; Nondeterministic finite automaton; Finite-state machine; Discrete mathematics; Deterministic automaton; State (computer science); DFA minimization; Cyclic permutation; Alphabet; String (physics); Binary number; Automaton; Automata theory; Algorithm; Computer science; Arithmetic; Symmetric group; Theoretical computer science; Physics","score_opus":0.023003178710106462,"score_gpt":0.2986228897265871,"score_spread":0.27561971101648064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595036685","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.4646541,0.000013288544,0.5299173,0.00077373965,0.00032443283,0.000110803136,0.000009802921,0.00011853397,0.004078026],"genre_scores_gemma":[0.96342367,0.0000032063315,0.036035366,0.0004552915,0.000055550165,0.0000028720385,0.000001256235,0.000006668154,0.000016121481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803513,0.00010036977,0.00024563284,0.00056120974,0.00065351697,0.00040416274],"domain_scores_gemma":[0.99762994,0.00032121534,0.00020328465,0.0015675147,0.00012006667,0.00015796394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012312183,0.00016698385,0.00022795801,0.00015637297,0.00065287075,0.00053103146,0.0034244282,0.00003405167,0.000042631385],"category_scores_gemma":[0.00017716218,0.00013151916,0.000071617374,0.00025832732,0.005182185,0.0008730564,0.0012715323,0.00014690358,0.000047688198],"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.0000142979125,0.000078561454,0.0001571021,0.000009752908,0.000003940192,0.000019815327,0.00058162917,0.00020658385,0.0017049466,0.96961427,0.000042140447,0.02756699],"study_design_scores_gemma":[0.00028162476,0.0003184402,0.041034676,0.000060493905,0.0000027392082,0.000006918321,0.0000073676983,0.6190563,0.01030207,0.3287255,0.000024417377,0.00017945135],"about_ca_topic_score_codex":0.000016130678,"about_ca_topic_score_gemma":8.452282e-7,"teacher_disagreement_score":0.64088875,"about_ca_system_score_codex":0.000030561558,"about_ca_system_score_gemma":0.00007085868,"threshold_uncertainty_score":0.99752516},"labels":[],"label_agreement":null},{"id":"W2595941837","doi":"10.1016/j.tcs.2017.02.023","title":"A symbolic dynamics approach to Epileptic Chronnectomics: Employing strings to predict crisis onset","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"State Scholarships Foundation","keywords":"Dynamics (music); Symbolic dynamics; Computer science; Statistical physics; Econometrics; Mathematics; Algorithm; Artificial intelligence; Psychology; Pure mathematics; Physics","score_opus":0.02152651764763815,"score_gpt":0.2679997071560513,"score_spread":0.24647318950841315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595941837","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.668714,6.312545e-7,0.32496542,0.0020236343,0.0006675126,0.0003941075,0.000018447985,0.0001311786,0.003085086],"genre_scores_gemma":[0.9852472,0.000001838147,0.011031266,0.003461356,0.00017937274,0.000026751532,0.000001304082,0.00002425112,0.0000266746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678516,0.00008652996,0.00028954187,0.0012610035,0.00074899604,0.0008287557],"domain_scores_gemma":[0.9976185,0.00022784725,0.00009917621,0.0013244142,0.00009558559,0.00063447864],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009134563,0.00025501184,0.00027992658,0.00027349155,0.0016787525,0.0012888102,0.0027189169,0.0000605037,0.000017173637],"category_scores_gemma":[0.0011464758,0.000217429,0.00008208475,0.0006254287,0.0014826392,0.000486171,0.0016954845,0.00026968113,0.00016380867],"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.000062762185,0.00014433882,0.00061665697,0.000019978585,0.000002831873,0.00001838474,0.00045825992,0.0017599417,0.01214975,0.9693168,0.0002224896,0.015227802],"study_design_scores_gemma":[0.00024934622,0.0004893349,0.008348759,0.00004637274,0.000010473478,0.000093023795,0.000020405107,0.9586119,0.008416344,0.023246517,0.000055953464,0.00041155767],"about_ca_topic_score_codex":0.000022166763,"about_ca_topic_score_gemma":0.0000038176827,"teacher_disagreement_score":0.95685196,"about_ca_system_score_codex":0.00021280485,"about_ca_system_score_gemma":0.0000864402,"threshold_uncertainty_score":0.99974793},"labels":[],"label_agreement":null},{"id":"W2601587549","doi":"10.1016/j.tcs.2017.03.023","title":"TCS SNC Preface","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics","score_opus":0.03760811578990411,"score_gpt":0.2334731767846426,"score_spread":0.1958650609947385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601587549","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055549514,0.00011317222,0.048551377,0.0010810761,0.0055498993,0.0001256971,0.0000470091,0.000062139035,0.8889201],"genre_scores_gemma":[0.9880756,0.000018118142,0.004919958,0.00021679969,0.00013860338,0.0000030417689,2.9712743e-7,0.0000054493157,0.0066221477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986917,0.0000045581414,0.00024592355,0.0005980875,0.000058284517,0.00040149086],"domain_scores_gemma":[0.9987142,0.00003066362,0.00016779643,0.0009113873,0.000035060693,0.00014089678],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013165467,0.00010301329,0.00022441999,0.0000929997,0.0012558373,0.0007748332,0.0015768484,0.000030017054,0.0026344561],"category_scores_gemma":[0.00017169639,0.0001004649,0.00006221741,0.00008946751,0.004491166,0.00054757885,0.0009154472,0.00008114594,0.012858742],"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.0000025812058,0.000017522923,0.0014615429,0.0000021877452,0.0000049477853,0.0000015307804,0.0001924269,0.000014024903,0.0000042515444,0.99327195,0.0032064067,0.0018206069],"study_design_scores_gemma":[0.00060824124,0.00010362599,0.033222757,0.000020902047,0.000004934516,0.000007765908,0.00004275147,0.08518571,0.0004160952,0.78495866,0.09486244,0.00056614215],"about_ca_topic_score_codex":0.000015657159,"about_ca_topic_score_gemma":5.637606e-7,"teacher_disagreement_score":0.93252605,"about_ca_system_score_codex":0.00004849405,"about_ca_system_score_gemma":0.000017236303,"threshold_uncertainty_score":0.99827725},"labels":[],"label_agreement":null},{"id":"W2610819251","doi":"10.1016/j.tcs.2017.04.008","title":"Reconstructing a string from its Lyndon arrays","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"String (physics); Combinatorics; Computer science; Mathematics; Algorithm","score_opus":0.0204940698894321,"score_gpt":0.2687786662791555,"score_spread":0.2482845963897234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610819251","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.08395961,0.00002661087,0.90958196,0.00057467027,0.0015576043,0.00009777179,0.00000594491,0.00018180745,0.004014034],"genre_scores_gemma":[0.6748343,0.000004075302,0.3247857,0.000107868465,0.0002562476,0.0000021498006,7.094276e-7,0.0000047945564,0.0000041109593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748975,0.000058245096,0.00026524716,0.0009501975,0.0006554326,0.00058114255],"domain_scores_gemma":[0.99697196,0.00020909234,0.00019302791,0.0021607995,0.00015207594,0.00031301967],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00096917385,0.00019044318,0.00022186892,0.00009990585,0.0021451402,0.0025517151,0.006497394,0.00005618356,0.0000667683],"category_scores_gemma":[0.00024645287,0.00015484371,0.00005962894,0.00022544626,0.0016250621,0.0026801974,0.004214851,0.00025541082,0.00011352741],"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.0000031130253,0.000016796224,0.00022270715,0.000002085973,0.0000027425128,0.000018555353,0.00015563975,0.000021253782,0.0015953651,0.81100386,0.000028631024,0.18692923],"study_design_scores_gemma":[0.00023266739,0.00005014787,0.0018834837,0.000077912024,0.0000026709151,0.000025868476,0.000004761043,0.8550878,0.013488328,0.12878455,0.00013285216,0.00022890832],"about_ca_topic_score_codex":0.000025933588,"about_ca_topic_score_gemma":5.971187e-7,"teacher_disagreement_score":0.8550666,"about_ca_system_score_codex":0.00004342552,"about_ca_system_score_gemma":0.000109289766,"threshold_uncertainty_score":0.9991539},"labels":[],"label_agreement":null},{"id":"W2613337430","doi":"10.1016/j.tcs.2020.04.008","title":"Step-optimal implementations of large single-writer registers","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Register (sociolinguistics); Algorithm; Arithmetic; Shift register; Upper and lower bounds; Binary logarithm; Time complexity; Bit (key); Discrete mathematics; Mathematics","score_opus":0.02542056911127512,"score_gpt":0.28924634464861265,"score_spread":0.26382577553733755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613337430","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.011183884,0.000015564174,0.9847211,0.002596175,0.00023883996,0.00013062535,0.00001959576,0.00011715648,0.000977064],"genre_scores_gemma":[0.62280613,9.87116e-7,0.3759228,0.0011899644,0.000069537506,0.0000019778176,0.0000026897776,0.000004088127,0.000001834209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780536,0.00007477632,0.00034435565,0.00062359165,0.0006824639,0.00046948128],"domain_scores_gemma":[0.99856347,0.00012880139,0.000109343026,0.00070582837,0.00016675067,0.00032581316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000560223,0.00014622115,0.00019887145,0.000094049756,0.00025877095,0.00027371777,0.002481792,0.00003083139,0.00008221243],"category_scores_gemma":[0.00004940547,0.000119316275,0.000067469446,0.000960655,0.0010354922,0.0009310798,0.0020136412,0.00013094427,0.000036374862],"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.000008744149,0.000079484045,0.00006332659,0.000010086289,0.0000037012117,0.000008278347,0.0009023723,0.00006917977,0.0024047247,0.97370803,0.0007395682,0.022002487],"study_design_scores_gemma":[0.00047536992,0.00051671773,0.00052420923,0.00002773575,0.0000057217644,0.0000131030765,0.000039136146,0.98385364,0.0073518627,0.0041675996,0.002804585,0.0002203249],"about_ca_topic_score_codex":0.0000027239457,"about_ca_topic_score_gemma":2.3612635e-7,"teacher_disagreement_score":0.98378444,"about_ca_system_score_codex":0.000024772344,"about_ca_system_score_gemma":0.00008045917,"threshold_uncertainty_score":0.48655763},"labels":[],"label_agreement":null},{"id":"W2616150629","doi":"10.1016/j.tcs.2004.10.036","title":"On reasoning about structural equality in XML: a description logic approach","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"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":"Computer science; Satisfiability; Feature (linguistics); Description logic; XML; Theoretical computer science; Boolean satisfiability problem; Programming language; Mathematics; Linguistics","score_opus":0.02815735822224639,"score_gpt":0.2811092599757268,"score_spread":0.25295190175348037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616150629","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.3345753,0.000020399273,0.6609203,0.00035514188,0.00032340924,0.00011090019,2.568096e-7,0.00015728267,0.0035369648],"genre_scores_gemma":[0.7362126,0.0000012521226,0.26313865,0.0005988423,0.000038364393,0.0000048064244,4.3415446e-7,0.0000033705378,0.0000016722621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735576,0.00013941452,0.0002959466,0.0008467133,0.000698635,0.00066355616],"domain_scores_gemma":[0.9988017,0.00014508519,0.00006826119,0.0007440528,0.00008338084,0.00015748755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016555537,0.00019597332,0.00023791599,0.00021915654,0.0002853596,0.00050832797,0.0021471356,0.000072417315,0.000006282623],"category_scores_gemma":[0.00022740936,0.00014689803,0.00005687424,0.0011356027,0.0017615156,0.0007491099,0.0006620094,0.00028244278,0.000030370693],"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.000010268274,0.000048011392,0.00019895563,0.00000598588,0.0000011050789,0.000013387827,0.000672403,0.0037864882,0.0001525412,0.9878457,0.0000017050352,0.00726343],"study_design_scores_gemma":[0.00031774695,0.00015648616,0.0176805,0.000042672604,0.0000011480992,0.0000387081,0.000015576397,0.3239398,0.0006864403,0.6569498,0.0000011262046,0.00016999498],"about_ca_topic_score_codex":0.000040580042,"about_ca_topic_score_gemma":0.000004247184,"teacher_disagreement_score":0.4016373,"about_ca_system_score_codex":0.00018446892,"about_ca_system_score_gemma":0.0001294654,"threshold_uncertainty_score":0.6490378},"labels":[],"label_agreement":null},{"id":"W2616344723","doi":"10.1016/s0304-3975(02)00739-9","title":"Algebraic rewritings for optimizing regular path queries","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rewriting; Computer science; Tuple; Materialized view; Query optimization; Query language; Algebraic number; Conjunctive query; Theoretical computer science; Relational algebra; Relational database; Mathematics; View; Programming language; Database; Discrete mathematics; Database design","score_opus":0.009068548688099044,"score_gpt":0.24208067029440322,"score_spread":0.2330121216063042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616344723","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.0030429005,0.00009057965,0.99294144,0.00046045982,0.00063320925,0.00031394433,0.000005959389,0.00027108353,0.0022404268],"genre_scores_gemma":[0.32314306,0.0000040411396,0.67631286,0.00040255114,0.00007726074,0.000027878728,0.0000012142071,0.0000098984065,0.000021212996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973198,0.00010823969,0.0003579683,0.0009155567,0.0005277732,0.0007706713],"domain_scores_gemma":[0.99796796,0.00032294588,0.00010624381,0.0010592768,0.00027574648,0.00026785812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020844059,0.00022843652,0.00027887122,0.00013260797,0.00079690246,0.0003324255,0.001242299,0.000050142287,0.000014936568],"category_scores_gemma":[0.00041342637,0.00019061485,0.00009153333,0.0008281568,0.002107504,0.0014984893,0.0005113357,0.00013310072,0.00001860957],"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.00000407692,0.000019489322,0.000008355747,0.000018166482,0.0000025385464,0.0000067900523,0.00029110705,0.000078699595,0.00094710133,0.9920312,0.00008841535,0.006504059],"study_design_scores_gemma":[0.00078285707,0.0005645809,0.0000615929,0.00020492275,0.000009449555,0.00025681083,0.00012286437,0.24131368,0.049473394,0.6710389,0.035210423,0.00096052093],"about_ca_topic_score_codex":0.000001987324,"about_ca_topic_score_gemma":3.3505668e-7,"teacher_disagreement_score":0.3209923,"about_ca_system_score_codex":0.000053591968,"about_ca_system_score_gemma":0.00017137743,"threshold_uncertainty_score":0.7773048},"labels":[],"label_agreement":null},{"id":"W2616737215","doi":"10.1016/s0304-3975(02)00737-5","title":"Scalar aggregation in inconsistent databases","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Scalar (mathematics); Database; Computer science; Mathematics; Set (abstract data type); Characterization (materials science); Theoretical computer science; Programming language","score_opus":0.0173094157674278,"score_gpt":0.2560617708558215,"score_spread":0.23875235508839368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616737215","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.046964414,0.00012466959,0.9299664,0.00026358006,0.00065171235,0.00014755502,6.2115095e-7,0.00013123985,0.021749828],"genre_scores_gemma":[0.8765677,0.000009075855,0.12302738,0.00032954162,0.000041183044,0.0000063061593,6.0869024e-7,0.0000043662453,0.00001380361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976422,0.0002182156,0.00027630894,0.00076162437,0.0005311987,0.0005704062],"domain_scores_gemma":[0.99844676,0.0002623012,0.000058608333,0.00086008094,0.0001376843,0.00023456052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021328023,0.00016630144,0.00019171179,0.00024113977,0.00026234775,0.00029715223,0.001521583,0.00003667882,0.000040823474],"category_scores_gemma":[0.0004437434,0.00013306251,0.000050595245,0.0015333048,0.001571293,0.000852872,0.0006247224,0.00017682844,0.00013807716],"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.0000016741682,0.000080955695,0.0010577802,0.000004085002,0.0000010401238,0.000019240457,0.00025189447,0.000039554485,0.000098176235,0.97654766,0.000027694521,0.021870228],"study_design_scores_gemma":[0.0007816991,0.00024053172,0.00877771,0.000116279465,0.000005624628,0.000172848,0.000021471637,0.5180898,0.016724514,0.45175743,0.0026855476,0.0006266025],"about_ca_topic_score_codex":0.000006056075,"about_ca_topic_score_gemma":0.0000058489613,"teacher_disagreement_score":0.8296033,"about_ca_system_score_codex":0.00009270749,"about_ca_system_score_gemma":0.00021151686,"threshold_uncertainty_score":0.57894945},"labels":[],"label_agreement":null},{"id":"W2617479596","doi":"10.1016/j.tcs.2017.05.018","title":"The entire chromatic number of graphs embedded on the torus with large maximum degree","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Torus; Combinatorics; Mathematics; Graph; Colored; Degree (music); Chromatic scale; Edge coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","score_opus":0.023421179190116572,"score_gpt":0.3095576618514181,"score_spread":0.28613648266130154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617479596","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.25192496,0.000022193268,0.72875714,0.0034268387,0.00045060687,0.0005026357,0.0000033994033,0.00010415888,0.014808082],"genre_scores_gemma":[0.9784808,0.0000071572526,0.021156436,0.00024269764,0.00003975047,0.000022806842,1.4504766e-7,0.0000120560135,0.0000381449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624366,0.00029347744,0.00029174017,0.00067404273,0.001549688,0.00094742567],"domain_scores_gemma":[0.9938569,0.0013714008,0.00023523676,0.0039987466,0.0003168587,0.00022087643],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0038168654,0.0002388036,0.0002435133,0.00008442229,0.0036244185,0.0011488984,0.010554751,0.000044193308,0.000044985863],"category_scores_gemma":[0.00042530382,0.00011005385,0.00010514382,0.00074237015,0.011542027,0.0006900713,0.0023263402,0.00038171007,0.00009747893],"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.000034516514,0.000063204025,0.00027780893,0.000006086662,0.000011335495,0.00001333962,0.0003498814,0.000010868589,0.00012686095,0.9794064,0.000036187605,0.019663498],"study_design_scores_gemma":[0.00035902802,0.00031868432,0.0046177073,0.00008267534,0.0000051576535,0.000046952948,0.00003422144,0.07634307,0.0048011644,0.9130865,0.000099789126,0.00020507631],"about_ca_topic_score_codex":0.0000030319036,"about_ca_topic_score_gemma":0.0000042176657,"teacher_disagreement_score":0.7265558,"about_ca_system_score_codex":0.000035872334,"about_ca_system_score_gemma":0.00014416063,"threshold_uncertainty_score":0.999888},"labels":[],"label_agreement":null},{"id":"W2618109676","doi":"10.1016/j.tcs.2018.04.024","title":"Variations of checking stack automata: Obtaining unexpected decidability properties","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Undecidable problem; Decidability; Nondeterministic algorithm; Emptiness; Decision problem; Discrete mathematics; Automaton; Bounded function; Mathematics; Computer science; Combinatorics; Algorithm; Theoretical computer science","score_opus":0.018541725253925886,"score_gpt":0.25498249743764784,"score_spread":0.23644077218372195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618109676","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.25018656,0.00001322496,0.7467503,0.0003363162,0.00043846216,0.00014447363,0.0000013124203,0.00035350956,0.0017758457],"genre_scores_gemma":[0.8105228,8.611974e-7,0.18915375,0.00017504116,0.00012998757,0.0000065020467,3.5171672e-7,0.0000068376976,0.000003857337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973019,0.0001814192,0.00045671864,0.00073461665,0.0007539283,0.00057145493],"domain_scores_gemma":[0.997528,0.0002932204,0.00014861497,0.0012756712,0.00056732725,0.00018716138],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024212138,0.00018879688,0.00027316323,0.00020701892,0.00056059734,0.00036809297,0.0028002285,0.000056868346,0.00004764913],"category_scores_gemma":[0.0003947306,0.00014529355,0.0000694301,0.0018595641,0.005083812,0.0010262487,0.0014965109,0.0001450031,0.000042828506],"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.000008257198,0.000088065615,0.0001205265,0.000010287044,0.0000057795037,0.0000017446289,0.0022462085,0.000034561475,0.009830118,0.96547407,0.000012607599,0.022167796],"study_design_scores_gemma":[0.00020654128,0.0002709663,0.0041351584,0.000064845415,0.0000048785,0.000015099251,0.000027881846,0.78708494,0.05042901,0.15752894,0.00003037078,0.00020135271],"about_ca_topic_score_codex":0.000009767314,"about_ca_topic_score_gemma":9.755988e-7,"teacher_disagreement_score":0.80794513,"about_ca_system_score_codex":0.00007574424,"about_ca_system_score_gemma":0.00027174657,"threshold_uncertainty_score":0.9976238},"labels":[],"label_agreement":null},{"id":"W2619621338","doi":"10.1016/j.tcs.2017.05.016","title":"Corrigendum to “An FPTAS for the parallel two-stage flowshop problem” [Theoret. Comput. Sci. 657 (2017) 64–72]","year":2017,"lang":"en","type":"erratum","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Computer science; Parallel computing; Combinatorics","score_opus":0.02781184992361467,"score_gpt":0.28506034541367054,"score_spread":0.25724849549005585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619621338","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.00003105086,0.0002666206,0.9352446,0.0006081213,0.04700965,0.0012530125,0.00010767738,0.00065884006,0.014820393],"genre_scores_gemma":[0.015683556,0.00012115067,0.9595113,0.0013181735,0.007378619,0.00029394933,0.00022339534,0.0002832228,0.015186656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544185,0.00009862298,0.0006046536,0.0012976482,0.0010816414,0.0014756037],"domain_scores_gemma":[0.9958824,0.00027814778,0.00016571594,0.0024406298,0.00047119285,0.00076193706],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.002864119,0.00072884257,0.0007081094,0.0003205468,0.0018870514,0.0016946153,0.0053054886,0.00035626476,0.00018268892],"category_scores_gemma":[0.00023291758,0.0005354723,0.00022936371,0.0005580981,0.0032648612,0.00037821324,0.0008359237,0.001121014,0.00019844003],"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.000032773354,0.000053858923,0.0000011651712,0.00010563655,0.000049655766,0.0000139147005,0.00064134726,0.35684842,0.000009793255,0.51166207,0.11013437,0.020446993],"study_design_scores_gemma":[0.0004255344,0.00022022396,0.000017884055,0.00018065247,0.000051650353,0.000020768102,0.00002217869,0.94454414,0.000041962438,0.012080351,0.0416289,0.0007657538],"about_ca_topic_score_codex":0.000011322326,"about_ca_topic_score_gemma":0.000011225891,"teacher_disagreement_score":0.5876957,"about_ca_system_score_codex":0.00016049788,"about_ca_system_score_gemma":0.00033330175,"threshold_uncertainty_score":0.99970967},"labels":[],"label_agreement":null},{"id":"W2622492622","doi":"10.1016/j.tcs.2017.05.035","title":"Computing conforming partitions of orthogonal polygons with minimum stabbing number","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Disjoint sets; Rectangle; Polygon (computer graphics); Polygon covering; Line segment; Rounding; Polygonal chain; Partition problem; Discrete mathematics; Regular polygon; Computer science; Geometry","score_opus":0.014265505653925382,"score_gpt":0.28223805436392385,"score_spread":0.2679725487099985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622492622","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.29327616,0.0000045976667,0.70112604,0.00047701574,0.000290603,0.0000898282,0.0000022884105,0.000055947756,0.0046774987],"genre_scores_gemma":[0.8003773,8.537953e-7,0.19936669,0.00012957669,0.000107361615,0.0000020900327,0.0000015701107,0.00000464676,0.00000990125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979484,0.000048528193,0.0003240133,0.0005056057,0.0007305438,0.00044289656],"domain_scores_gemma":[0.9980097,0.00024291131,0.00025488838,0.0008712974,0.00041050886,0.00021073714],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001046681,0.00015892107,0.00021120065,0.00013339584,0.0015840679,0.0006867064,0.0019194523,0.000035694564,0.00003630566],"category_scores_gemma":[0.00011016034,0.00013026642,0.000057908877,0.00048842886,0.0023805068,0.0012396645,0.00093458075,0.00014806456,0.000025572695],"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.000007937434,0.000048105387,0.0010027852,0.000007717363,0.000007084379,0.0000072492885,0.0003316906,0.0022675316,0.0006748452,0.9722517,0.000014110696,0.02337923],"study_design_scores_gemma":[0.00046839958,0.0001989632,0.016536972,0.0001026321,0.000010383598,0.00012512859,0.000017203696,0.9104283,0.011123414,0.06059158,0.000092846814,0.00030418168],"about_ca_topic_score_codex":0.000005832764,"about_ca_topic_score_gemma":0.000002448333,"teacher_disagreement_score":0.91166013,"about_ca_system_score_codex":0.000029354285,"about_ca_system_score_gemma":0.00030784504,"threshold_uncertainty_score":0.99971575},"labels":[],"label_agreement":null},{"id":"W2623507859","doi":"10.1016/j.tcs.2017.05.029","title":"Improved analysis of the online set cover problem with advice","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Advice (programming); Set cover problem; Cover (algebra); Online algorithm; Set (abstract data type); Competitive analysis; Upper and lower bounds; Time complexity; Computer science; Mathematics; Computational complexity theory; Quality (philosophy); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics","score_opus":0.013541789528518268,"score_gpt":0.2784548933950822,"score_spread":0.26491310386656397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623507859","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.01991744,0.000003282412,0.97401375,0.0027143608,0.000121990524,0.00022629111,0.000008688691,0.00007101489,0.002923174],"genre_scores_gemma":[0.7991951,0.0000019289744,0.20032531,0.00039711938,0.000017268414,0.000003095254,9.648887e-7,0.0000037026466,0.00005546941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980296,0.00009109775,0.00023863486,0.0005231065,0.00073718955,0.00038036023],"domain_scores_gemma":[0.9970184,0.00010682588,0.00022442671,0.002054926,0.00043004463,0.00016538483],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010454443,0.00013199658,0.00023614218,0.00017520667,0.0008068326,0.0006500684,0.0054656323,0.000033669676,0.00003852802],"category_scores_gemma":[0.00008504963,0.00007275882,0.000092947805,0.0016899277,0.0036566416,0.00075642765,0.0019079854,0.00016879807,0.0000054027373],"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.000010659834,0.000092197275,0.0011198513,0.000008037726,0.000058704936,0.0000016458663,0.0005006306,0.01162307,0.00036483543,0.9803778,0.000029256047,0.0058132936],"study_design_scores_gemma":[0.00022874527,0.00013326436,0.010458219,0.000020078565,0.000039791852,0.0000033881038,0.0000033842973,0.98240757,0.00081350346,0.0057148524,0.00005826248,0.00011893242],"about_ca_topic_score_codex":0.000021440923,"about_ca_topic_score_gemma":0.00001248681,"teacher_disagreement_score":0.97466296,"about_ca_system_score_codex":0.000027229185,"about_ca_system_score_gemma":0.00021014996,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W2623681909","doi":"10.1016/j.tcs.2017.01.034","title":"Higher-level constructs for families and multisets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Multiset; Intersection (aeronautics); Power set; Set (abstract data type); Mathematics; Complement (music); Functor; Family of sets; Computer science; Theoretical computer science; Discrete mathematics; Programming language","score_opus":0.05420908054288178,"score_gpt":0.34654448382506264,"score_spread":0.2923354032821809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623681909","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.52068347,0.00006232694,0.20573679,0.0051082163,0.0043091564,0.00058460934,0.0000613322,0.00013898696,0.2633151],"genre_scores_gemma":[0.9838358,0.0000022821384,0.015372512,0.00050141296,0.00021633267,0.0000156488,4.3658616e-7,0.000006554025,0.00004897494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983155,0.000045358145,0.00016528813,0.0006408095,0.00027645857,0.00055656175],"domain_scores_gemma":[0.99830693,0.00042106264,0.00007491531,0.0007774374,0.000102027356,0.00031763938],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0009512292,0.00014644489,0.00018578711,0.000060058668,0.0013654126,0.00036993268,0.0014071879,0.00006742205,0.00018537033],"category_scores_gemma":[0.0002488012,0.000111015484,0.000041481308,0.0001066349,0.023224605,0.000280586,0.00056295126,0.000117753414,0.00006144847],"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.00003092048,0.00002909097,0.00019850435,0.0000041938933,0.000003772742,0.0000059020063,0.00023184209,2.6531288e-7,0.00024698116,0.9437123,0.000021267919,0.05551495],"study_design_scores_gemma":[0.0005683893,0.0001922383,0.05560515,0.000017276598,0.000007756737,0.000020697433,0.0000124777025,0.0032194213,0.00077587354,0.93916,0.0002346624,0.00018605441],"about_ca_topic_score_codex":0.0000073591295,"about_ca_topic_score_gemma":5.891481e-7,"teacher_disagreement_score":0.46315238,"about_ca_system_score_codex":0.000014112818,"about_ca_system_score_gemma":0.000032254717,"threshold_uncertainty_score":0.9999347},"labels":[],"label_agreement":null},{"id":"W2624658792","doi":"10.1016/j.tcs.2017.05.039","title":"On RAC drawings of 1-planar graphs","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Combinatorics; Planar straight-line graph; Outerplanar graph; Book embedding; Planar; Graph drawing; Mathematics; Line graph; 1-planar graph; Graph; Discrete mathematics; Pathwidth; Computer science; Computer graphics (images)","score_opus":0.010909321731467709,"score_gpt":0.26626685491266744,"score_spread":0.25535753318119975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624658792","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.11342958,0.000007976605,0.87868655,0.0010618308,0.00071093976,0.00008382762,0.0000011661211,0.000055193323,0.0059629334],"genre_scores_gemma":[0.89125943,0.0000018415003,0.1082907,0.0003673467,0.00006118225,0.0000020189125,5.738804e-7,0.0000030417239,0.000013881768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982445,0.000045810128,0.00021583166,0.0004956791,0.00070679106,0.00029136226],"domain_scores_gemma":[0.9981107,0.00023013385,0.00015336052,0.0011312173,0.00021749159,0.00015709273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092215,0.00012143562,0.00015919958,0.0002259624,0.00088454934,0.0005103007,0.003004872,0.000034074255,0.000018604953],"category_scores_gemma":[0.00021552942,0.00010095308,0.00006514874,0.00040982934,0.001897324,0.0007517712,0.0004989745,0.000112789196,0.00004570816],"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.0000067929345,0.000044121836,0.00004279862,0.0000035161968,0.0000024754045,0.0000044456056,0.00011297853,0.00034330264,0.001049081,0.9623057,0.00008525167,0.035999514],"study_design_scores_gemma":[0.00019382658,0.00024663482,0.0065830695,0.000025012503,0.000002216316,0.000011371108,7.985838e-7,0.2340968,0.013653813,0.7449796,0.0000742487,0.00013260182],"about_ca_topic_score_codex":0.0000035651285,"about_ca_topic_score_gemma":2.888859e-7,"teacher_disagreement_score":0.7778298,"about_ca_system_score_codex":0.000019383708,"about_ca_system_score_gemma":0.000101489124,"threshold_uncertainty_score":0.69907695},"labels":[],"label_agreement":null},{"id":"W2625894783","doi":"10.1016/j.tcs.2017.05.021","title":"Know when to persist: Deriving value from a stream buffer","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","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":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Random permutation; Competitive analysis; Scheduling (production processes); Data stream; Online algorithm; Permutation (music); Algorithm; Mathematics; Mathematical optimization; Upper and lower bounds; Statistics; Discrete mathematics","score_opus":0.01683647901415447,"score_gpt":0.27598478296795875,"score_spread":0.2591483039538043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625894783","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.014594932,0.000013435058,0.9672471,0.008256155,0.0006003013,0.0002021812,0.0000029068667,0.00017575253,0.008907207],"genre_scores_gemma":[0.61576873,0.0000026533346,0.38310444,0.0009632426,0.0001015714,0.0000054213947,4.4537447e-7,0.000005943493,0.00004755383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731016,0.00010258063,0.0002142078,0.00090193754,0.0008153657,0.00065576093],"domain_scores_gemma":[0.9969539,0.0001854573,0.00007387636,0.0019475034,0.0002305085,0.0006087307],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010820075,0.00018279426,0.0002066481,0.00014677129,0.0015024057,0.0029317313,0.006160551,0.0000502888,0.0001677879],"category_scores_gemma":[0.0003262454,0.00015341301,0.00006830919,0.00028151026,0.0016730042,0.0012488038,0.003428643,0.00018604439,0.00031794395],"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.0000037066368,0.000044653738,0.00021773457,0.0000022533404,0.000004510201,0.000009927548,0.0016109417,0.00079918146,0.00040806964,0.93761474,0.00025420866,0.059030056],"study_design_scores_gemma":[0.00020393518,0.00014552685,0.0037706497,0.00005654356,0.0000030144924,0.0000056013405,0.000008133281,0.8685742,0.0015805196,0.124649435,0.00074401713,0.00025845284],"about_ca_topic_score_codex":0.000057860336,"about_ca_topic_score_gemma":0.0000042878864,"teacher_disagreement_score":0.86777496,"about_ca_system_score_codex":0.000069201975,"about_ca_system_score_gemma":0.0001606703,"threshold_uncertainty_score":0.9997975},"labels":[],"label_agreement":null},{"id":"W2626630915","doi":"10.1016/j.tcs.2017.12.024","title":"New results on edge partitions of 1-plane graphs","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cubic graph; Planar graph; Distance-regular graph; Regular graph; Graph power; Vertex (graph theory); Discrete mathematics; Complement graph; Butterfly graph; Line graph; Graph; Voltage graph","score_opus":0.0309586809723489,"score_gpt":0.32480655874926573,"score_spread":0.29384787777691684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626630915","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.015972624,0.000010641311,0.9550304,0.0024758761,0.0006025344,0.00018344908,0.0000104585115,0.00012204332,0.025591968],"genre_scores_gemma":[0.87287736,0.00000561898,0.12684229,0.00013309956,0.00007383162,0.000003311955,7.478744e-7,0.000006013416,0.00005770339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997159,0.00010606852,0.00032747525,0.00078725885,0.0009772946,0.00064290233],"domain_scores_gemma":[0.9956674,0.00047161328,0.00017885394,0.0029925918,0.00022486747,0.00046468896],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018034363,0.00017188412,0.00023099678,0.00029132533,0.0010655317,0.00050780165,0.006529089,0.000048953734,0.000029604187],"category_scores_gemma":[0.00056184316,0.00013904258,0.000087078726,0.0006573108,0.0051194313,0.00091607345,0.001585965,0.0002650194,0.00012644172],"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.000045564204,0.00005150277,0.00003649002,0.0000033037904,0.000003277686,0.000012993713,0.00014698366,0.000092671435,0.00072845776,0.9576966,0.00027548734,0.04090666],"study_design_scores_gemma":[0.0005097016,0.00052915234,0.0037336969,0.0000556138,0.0000023319717,0.000015191358,0.0000020611171,0.022434855,0.02497627,0.94732124,0.00023261219,0.00018725755],"about_ca_topic_score_codex":0.000009064906,"about_ca_topic_score_gemma":0.0000016167609,"teacher_disagreement_score":0.85690475,"about_ca_system_score_codex":0.000027661104,"about_ca_system_score_gemma":0.00019840393,"threshold_uncertainty_score":0.99884605},"labels":[],"label_agreement":null},{"id":"W2669944882","doi":"10.1016/s0304-3975(02)00649-7","title":"Uniform multi-hop all-to-all optical routings in rings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wavelength-division multiplexing; Hop (telecommunications); Computer science; Computer network; Optical communication; Routing (electronic design automation); Wavelength; Routing and wavelength assignment; Node (physics); Telecommunications; Physics; Optics; Quantum mechanics","score_opus":0.01194601667252668,"score_gpt":0.24577727401127708,"score_spread":0.2338312573387504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2669944882","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.19811293,0.000020246618,0.79449725,0.0002796733,0.00024403776,0.00017928217,4.829554e-7,0.0006885937,0.00597749],"genre_scores_gemma":[0.58358604,0.000004677499,0.4160979,0.0002726239,0.000015068442,0.000006453882,1.7868486e-7,0.000014097941,0.0000029322948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787873,0.000017895802,0.00029832206,0.00047225447,0.000347276,0.0009854975],"domain_scores_gemma":[0.9989824,0.00020937287,0.000013674557,0.0004556683,0.00005059907,0.000288278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072514825,0.00022313691,0.00023854843,0.00020708157,0.000069257505,0.00009915173,0.0008959288,0.00010760785,0.000027134374],"category_scores_gemma":[0.00041163593,0.00019802903,0.000037307113,0.0011051357,0.0015683707,0.00024302486,0.00036583355,0.00043764268,0.00014065989],"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.0000033988536,0.000029940264,0.00008043072,0.0000065567083,0.000002699599,0.000019188876,0.00013295554,0.050955705,0.0012232132,0.9409079,0.00001984412,0.0066181584],"study_design_scores_gemma":[0.00034686553,0.00012067257,0.00068338774,0.000051470088,0.0000046226573,0.000026310829,0.000028112985,0.91733,0.009037558,0.07117739,0.0007536526,0.00043990187],"about_ca_topic_score_codex":6.634066e-7,"about_ca_topic_score_gemma":0.0000015878267,"teacher_disagreement_score":0.86973053,"about_ca_system_score_codex":0.00016790726,"about_ca_system_score_gemma":0.000017818817,"threshold_uncertainty_score":0.8075389},"labels":[],"label_agreement":null},{"id":"W2676800707","doi":"10.1016/s0304-3975(02)00650-3","title":"The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Simple (philosophy); Factorization; Mathematics; Expressive power; Range (aeronautics); Discrete mathematics; Combinatorics; Computer science; Graph; Theoretical computer science; Algorithm","score_opus":0.010286011854412915,"score_gpt":0.20471116056560285,"score_spread":0.19442514871118993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2676800707","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.26606277,0.00024488824,0.7188948,0.00005908157,0.0016105104,0.00017561787,0.0000064664446,0.00017707894,0.012768823],"genre_scores_gemma":[0.99853754,0.000018972807,0.0013837558,0.000015629252,0.00002618501,0.000004679847,6.1280804e-7,0.000008330667,0.00000432121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882144,0.00010856942,0.0002582395,0.00017577804,0.00029197408,0.00034402753],"domain_scores_gemma":[0.9991573,0.00021920732,0.000031171785,0.00041029463,0.00008123787,0.0001007686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008926845,0.000112071975,0.00014350555,0.00007295727,0.00048415648,0.0000744137,0.00053587166,0.000032884895,0.000027538956],"category_scores_gemma":[0.000046515044,0.00007772592,0.00006354804,0.00086276326,0.0023355149,0.00011529102,0.00004766572,0.0001141161,0.000020492962],"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":[8.464305e-7,0.000009925005,0.00023436907,0.000008453644,0.000006141838,4.3485468e-7,0.000121163175,0.001014902,0.00386017,0.9939076,0.00002532161,0.000810682],"study_design_scores_gemma":[0.00031051255,0.00011368193,0.0061710197,0.00007484538,0.000019727886,0.00004843583,0.000056432225,0.21157882,0.020020055,0.75771636,0.0034770404,0.00041308432],"about_ca_topic_score_codex":7.0737326e-7,"about_ca_topic_score_gemma":4.6845872e-7,"teacher_disagreement_score":0.73247474,"about_ca_system_score_codex":0.000014908651,"about_ca_system_score_gemma":0.000019855323,"threshold_uncertainty_score":0.8605302},"labels":[],"label_agreement":null},{"id":"W2727458370","doi":"10.1016/j.tcs.2017.06.014","title":"Asymptotic medians of random permutations sampled from reversal random walks","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Median; Random walk; Mathematics; Random permutation; Combinatorics; Discrete mathematics; Statistics; Symmetric group","score_opus":0.009401001321547755,"score_gpt":0.2585849957158825,"score_spread":0.24918399439433475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727458370","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.5691241,0.00005131813,0.42851272,0.0004116683,0.00035984445,0.00019371697,0.000025252888,0.000010444495,0.0013109478],"genre_scores_gemma":[0.9788406,0.000021108182,0.020762479,0.000078093406,0.0002385908,0.0000066700654,0.000022788101,0.000009290019,0.000020366764],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986826,0.000070627604,0.00021131974,0.0004149094,0.0003367509,0.0002837659],"domain_scores_gemma":[0.9986738,0.00009283428,0.000113268055,0.00081679167,0.0001566047,0.00014672207],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00066763884,0.00012591202,0.00020942789,0.00004787836,0.0004271906,0.0001256972,0.0010831094,0.00006373359,0.00010156761],"category_scores_gemma":[0.0004165469,0.00010530303,0.000092642775,0.00007250951,0.002883864,0.000014665073,0.0004444543,0.000074666365,0.000019555559],"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.0008578672,0.0002814157,0.0040605525,0.00003295633,0.00019055784,0.00001936826,0.0016027599,0.0004259991,0.86193204,0.10063902,0.00035554232,0.029601939],"study_design_scores_gemma":[0.037590913,0.0019708078,0.09672148,0.00020767837,0.00037984218,0.000053747983,0.00019247746,0.17214102,0.5297148,0.15724826,0.0018853034,0.0018936591],"about_ca_topic_score_codex":0.000027800661,"about_ca_topic_score_gemma":0.000006274136,"teacher_disagreement_score":0.40971652,"about_ca_system_score_codex":0.00001162743,"about_ca_system_score_gemma":0.000096895266,"threshold_uncertainty_score":0.9998297},"labels":[],"label_agreement":null},{"id":"W2732417078","doi":"10.1016/j.tcs.2017.07.001","title":"Pseudoknot-generating operation","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Ministry of Science, ICT and Future Planning","keywords":"Pseudoknot; Undecidable problem; String (physics); Automaton; Computer science; Context (archaeology); Closure (psychology); Algorithm; Time complexity; Theoretical computer science; Deterministic finite automaton; Rewriting; Decidability; Mathematics; Programming language; Base sequence; DNA","score_opus":0.012409678940562215,"score_gpt":0.2677902802252762,"score_spread":0.25538060128471396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732417078","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.5112448,0.000019179892,0.47970814,0.0002793174,0.0005357403,0.00010230653,0.0000011386925,0.000013598125,0.0080957785],"genre_scores_gemma":[0.94886315,0.0000055315136,0.050231546,0.00028151748,0.0005456015,0.0000056254494,0.0000016412594,0.0000059740014,0.000059417398],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914056,0.00003722459,0.000096482014,0.00033477915,0.0001787097,0.00021224277],"domain_scores_gemma":[0.9990989,0.0000075974635,0.00004564681,0.00065996987,0.00009760233,0.00009026422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000686051,0.00008209455,0.000068152774,0.000016558486,0.0009611766,0.00038307745,0.00079644274,0.000046782618,0.00005654744],"category_scores_gemma":[0.00021539965,0.00006647877,0.00003106543,0.00002131067,0.0010090452,0.000013600655,0.00039303626,0.00003959359,0.00008151452],"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.000008423279,0.000008677638,0.000037774185,0.0000014602148,0.0000016687708,0.0000010083676,0.000011423618,0.000050320163,0.79835063,0.18289202,0.000041277577,0.018595304],"study_design_scores_gemma":[0.000121203695,0.00021198523,0.00028351945,0.000009359694,0.0000023766836,0.000010238614,0.000001398321,0.041651804,0.9519263,0.004993699,0.00064500753,0.00014308913],"about_ca_topic_score_codex":0.0000017526488,"about_ca_topic_score_gemma":4.9701464e-7,"teacher_disagreement_score":0.43761835,"about_ca_system_score_codex":0.000005287146,"about_ca_system_score_gemma":0.000048679445,"threshold_uncertainty_score":0.739269},"labels":[],"label_agreement":null},{"id":"W2741500259","doi":"10.1016/j.tcs.2018.05.035","title":"Bounds on the burning numbers of spiders and path-forests","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Graph; Mathematics; Path (computing); Upper and lower bounds; Discrete mathematics; Computer science","score_opus":0.011822099500608281,"score_gpt":0.2734107971776106,"score_spread":0.26158869767700227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741500259","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.58068216,0.000011720614,0.4068172,0.00035481452,0.00016765567,0.00018779279,0.000005019212,0.000042825417,0.011730816],"genre_scores_gemma":[0.98968446,0.0000014013037,0.009841488,0.00008881794,0.00035570888,0.000009769655,0.0000029986957,0.000010212862,0.00000516855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983099,0.000112072354,0.00027086085,0.00054201623,0.00044543625,0.00031971224],"domain_scores_gemma":[0.99846554,0.00033208856,0.00018520323,0.0007690545,0.00014415244,0.0001039911],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013161171,0.00021416911,0.00030582523,0.00009483346,0.0002789834,0.00023646436,0.0010921538,0.000044891898,0.00021146837],"category_scores_gemma":[0.000019318548,0.00014066054,0.00012370327,0.00030305787,0.00595296,0.000046497,0.0018971812,0.00040645004,0.000007422814],"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.0000055690966,0.000025234429,0.003066411,0.0000066592106,0.000021799447,4.3243136e-7,0.00024121194,0.00017319959,0.00001883165,0.9888082,0.00031268652,0.0073197335],"study_design_scores_gemma":[0.000049083083,0.00009650466,0.0023922487,0.00019804997,0.00002998553,6.566579e-7,0.000017235614,0.17405385,0.0009587323,0.8219453,0.00007037617,0.00018800418],"about_ca_topic_score_codex":0.00003907526,"about_ca_topic_score_gemma":0.0000010892122,"teacher_disagreement_score":0.40900227,"about_ca_system_score_codex":0.000023375655,"about_ca_system_score_gemma":0.00008064929,"threshold_uncertainty_score":0.99675226},"labels":[],"label_agreement":null},{"id":"W2754752206","doi":"10.1016/j.tcs.2017.08.023","title":"A general framework for searching on a line","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Competitive analysis; Constant (computer programming); Search cost; Mathematics; Mathematical optimization; Line (geometry); Search problem; Upper and lower bounds; Fixed cost; Computer science","score_opus":0.048514790885910465,"score_gpt":0.3635690444791842,"score_spread":0.3150542535932737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754752206","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.0027531814,0.0000029395014,0.9848952,0.008376999,0.00056363264,0.0002827908,0.0000017193034,0.00013262178,0.0029909092],"genre_scores_gemma":[0.464942,0.0000020648008,0.533928,0.0009093055,0.00017390828,0.000011102905,2.6655619e-7,0.0000047121393,0.000028635211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791515,0.00006174561,0.00016923508,0.00063817785,0.00061575137,0.00059993897],"domain_scores_gemma":[0.9975824,0.00037088263,0.000075578006,0.0014521896,0.00020758649,0.00031136585],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018259789,0.00013051725,0.00014800324,0.00013246553,0.0018597158,0.0021460725,0.004366049,0.000048764552,0.000019555211],"category_scores_gemma":[0.0006770394,0.000102161874,0.0000670691,0.00023320806,0.0018154496,0.00067618105,0.0012738552,0.00024356104,0.000052084073],"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.000008735407,0.000038883463,0.000010489831,0.0000042571137,0.0000018247875,0.0000029435953,0.0002212658,0.0021833961,0.000059863658,0.94064623,0.000037536516,0.056784548],"study_design_scores_gemma":[0.00013706155,0.00025798523,0.000113717026,0.000025192678,5.6742834e-7,0.0000028644704,5.2208213e-7,0.5895979,0.00080491055,0.40884104,0.00012975754,0.00008853066],"about_ca_topic_score_codex":0.0000018515077,"about_ca_topic_score_gemma":1.9412438e-7,"teacher_disagreement_score":0.58741444,"about_ca_system_score_codex":0.000034764118,"about_ca_system_score_gemma":0.0001285095,"threshold_uncertainty_score":0.9994397},"labels":[],"label_agreement":null},{"id":"W2754950191","doi":"10.1016/j.tcs.2017.09.007","title":"Finding modes with equality comparisons","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sorting; Mathematics; Element (criminal law); Generalization; Maximal element; Equivalence (formal languages); Combinatorics; Set (abstract data type); Upper and lower bounds; Contrast (vision); Order (exchange); Discrete mathematics; Algorithm; Computer science","score_opus":0.07704094708051623,"score_gpt":0.36278967107923105,"score_spread":0.2857487239987148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754950191","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.45160964,0.0000036851168,0.5196603,0.00021767478,0.0001800768,0.00009333652,0.0000022537497,0.00006940876,0.028163627],"genre_scores_gemma":[0.86696506,6.0305626e-7,0.13282526,0.000090520625,0.00009224099,0.0000023157713,1.4649896e-7,0.000008320432,0.000015531221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845135,0.000069692316,0.0001776269,0.00038347204,0.00050230225,0.00041554877],"domain_scores_gemma":[0.9979968,0.00037158016,0.00012827759,0.0012356951,0.00009995555,0.0001676579],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0015138929,0.00014848517,0.0002296454,0.000059920025,0.0027305915,0.00044138962,0.0017440034,0.000041500254,0.000060804123],"category_scores_gemma":[0.0002635322,0.000092695715,0.00004778634,0.00010564354,0.0077400515,0.00029378443,0.0009125005,0.00019657722,0.0000064775054],"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.000021187621,0.00002698658,0.0010785928,0.000011489829,0.000006510986,0.000004170142,0.00039283506,0.000013730177,0.0000602774,0.99648595,0.00005470655,0.0018435938],"study_design_scores_gemma":[0.00019833304,0.0000874767,0.004216654,0.00004184355,0.000012385839,0.000017556567,0.000020280804,0.037189536,0.0017909572,0.9562132,0.000036003905,0.00017581623],"about_ca_topic_score_codex":0.0000033678364,"about_ca_topic_score_gemma":0.0000016910992,"teacher_disagreement_score":0.4153554,"about_ca_system_score_codex":0.000023601802,"about_ca_system_score_gemma":0.00004015346,"threshold_uncertainty_score":0.9985677},"labels":[],"label_agreement":null},{"id":"W2760545295","doi":"10.1016/j.tcs.2017.09.018","title":"An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Office of the Vice President for Research and Economic Development, University at Buffalo; Kyushu Institute of Technology; Alberta Innovates - Technology Futures; Office of the Vice President for Research and Economic Development, University of Iowa; Georgia Southern University","keywords":"Scheme (mathematics); Job shop scheduling; Mathematical optimization; Flow (mathematics); Polynomial-time approximation scheme; Mathematics; Computer science; Stage (stratigraphy); Scheduling (production processes); Parallel computing; Algorithm; Approximation algorithm; Biology; Routing (electronic design automation); Geometry; Mathematical analysis; Computer network","score_opus":0.03236869020933152,"score_gpt":0.29743998264156546,"score_spread":0.26507129243223393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760545295","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.058822338,0.000007928538,0.93989736,0.0003217059,0.00048685982,0.0002136271,0.000004176605,0.00006699106,0.00017902676],"genre_scores_gemma":[0.53538525,8.031075e-7,0.46449718,0.00003972093,0.000057673667,0.000007198312,6.204644e-7,0.0000064529067,0.0000050773947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990591,0.000031603708,0.00019914807,0.00019663965,0.00027585228,0.00023768144],"domain_scores_gemma":[0.9988763,0.000111584115,0.000056743902,0.0007700773,0.00010913796,0.00007618875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009279264,0.00009819502,0.00010922471,0.000030645162,0.0006712361,0.00032212937,0.0013969877,0.00004152603,0.000011036774],"category_scores_gemma":[0.00023363554,0.000057896068,0.000059011676,0.00011861955,0.0016718945,0.00024255081,0.00015618671,0.000115157665,0.0000034829875],"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.000012847416,0.00005599434,0.0002524936,0.00004048253,0.000009960806,3.9566643e-7,0.0010168039,0.27286828,0.0015075848,0.71380615,0.000009126146,0.010419856],"study_design_scores_gemma":[0.0002497941,0.000019721298,0.0019575404,0.000020923342,0.0000062711492,0.0000016969193,0.00003609043,0.99117535,0.0034831031,0.0029557748,0.000008594,0.00008515966],"about_ca_topic_score_codex":8.7463644e-7,"about_ca_topic_score_gemma":6.472047e-7,"teacher_disagreement_score":0.7183071,"about_ca_system_score_codex":0.000016647113,"about_ca_system_score_gemma":0.000023153241,"threshold_uncertainty_score":0.6160165},"labels":[],"label_agreement":null},{"id":"W2768476682","doi":"10.1016/j.tcs.2018.04.039","title":"Avoidance bases for formulas with reversal","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Index (typography); Subject (documents); Mathematics; Combinatorics; Computer science","score_opus":0.011948554639043669,"score_gpt":0.25296535695797273,"score_spread":0.24101680231892905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768476682","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.017652186,0.000052191135,0.97641915,0.0012661711,0.0016906841,0.00070544967,0.000024207719,0.00056154246,0.001628432],"genre_scores_gemma":[0.5136705,0.000004435266,0.48459393,0.0011388181,0.0004885037,0.00005742408,0.000004401245,0.00002102307,0.000020944422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955044,0.000107930995,0.0004215379,0.0019239335,0.0009952933,0.0010469367],"domain_scores_gemma":[0.99572295,0.0006512065,0.00024355075,0.0024291473,0.0005727856,0.00038038354],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023833173,0.00050558866,0.00052933313,0.0002613728,0.0006351634,0.0011992665,0.0068268236,0.00018051587,0.000033533815],"category_scores_gemma":[0.00014858106,0.0003708127,0.00017408085,0.00071643223,0.005040589,0.0007325391,0.005289669,0.0004676989,0.00005793304],"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.000039345632,0.00006238534,0.000011052942,0.00007663966,0.000013898866,0.000012018253,0.00033956685,0.00022595494,0.000089740606,0.9831961,0.0006824732,0.015250849],"study_design_scores_gemma":[0.0002746749,0.00047614885,0.00007944022,0.00025656397,0.000013926741,0.000038176284,0.0000035769287,0.5484971,0.0042942413,0.44501093,0.00058188225,0.00047337142],"about_ca_topic_score_codex":0.000004449779,"about_ca_topic_score_gemma":0.0000013513745,"teacher_disagreement_score":0.5482711,"about_ca_system_score_codex":0.0001280169,"about_ca_system_score_gemma":0.00059752923,"threshold_uncertainty_score":0.99987435},"labels":[],"label_agreement":null},{"id":"W2771270479","doi":"10.1016/j.tcs.2018.04.019","title":"Leaf realization problem, caterpillar graphs and prefix normal words","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bijection; Simple graph; Prefix; Discrete mathematics; Graph; Simple (philosophy); Natural number; Realization (probability)","score_opus":0.006163145191917235,"score_gpt":0.22559021252530242,"score_spread":0.21942706733338518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771270479","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.10800148,0.00003228506,0.8860053,0.00068807596,0.00042189698,0.00015440834,0.0000011624863,0.00035635507,0.004339064],"genre_scores_gemma":[0.8929697,0.000009977315,0.10589267,0.000984946,0.000112152135,0.000005688058,9.596683e-7,0.0000084334215,0.000015462327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977143,0.000105873885,0.00026343815,0.00078367133,0.0005447811,0.0005879422],"domain_scores_gemma":[0.99851686,0.000098274155,0.00007436852,0.0007719865,0.00019715745,0.00034138223],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014992526,0.00019178855,0.00017556324,0.00021046102,0.0005924519,0.0006604801,0.0017419027,0.00006051004,0.00003206447],"category_scores_gemma":[0.000056439785,0.00015165347,0.00003546205,0.0012471409,0.0043134387,0.0010812969,0.0012815973,0.0001190212,0.00005535756],"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.000005774129,0.000025878106,0.0001737693,0.0000074041013,0.000002507155,0.0000040035075,0.001057034,0.000006878172,0.00080460333,0.9608402,0.00012019247,0.036951702],"study_design_scores_gemma":[0.00021205221,0.00040184686,0.001396114,0.000042639087,0.000004649899,0.000091174996,0.0000075172484,0.32200363,0.0070610223,0.668134,0.0003602523,0.0002851299],"about_ca_topic_score_codex":0.000008191629,"about_ca_topic_score_gemma":0.0000012868754,"teacher_disagreement_score":0.78496826,"about_ca_system_score_codex":0.000028368737,"about_ca_system_score_gemma":0.000096670105,"threshold_uncertainty_score":0.9983963},"labels":[],"label_agreement":null},{"id":"W2774221743","doi":"10.1016/j.tcs.2017.11.024","title":"On the teaching complexity of linear sets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Computer science; Theoretical computer science; Discrete mathematics; Combinatorics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.03139846617734175,"score_gpt":0.31474211638168936,"score_spread":0.2833436502043476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774221743","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.08651156,0.0000034612362,0.8884054,0.008903966,0.00052278786,0.00009299886,0.0000012097463,0.0000913025,0.015467326],"genre_scores_gemma":[0.8673437,5.5915103e-7,0.13202474,0.0005250937,0.00008721837,0.0000014289064,1.3676927e-7,0.000003992282,0.000013119063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807936,0.00019921464,0.00019505122,0.00046802787,0.00068976363,0.00036857542],"domain_scores_gemma":[0.9971284,0.0004967072,0.00016669113,0.001979376,0.00009609474,0.00013273321],"candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0024054565,0.00013719198,0.00017577264,0.00006990804,0.0024810073,0.00053633144,0.006167937,0.000028549766,0.000029659912],"category_scores_gemma":[0.0007056276,0.000080706115,0.00006967325,0.00014698404,0.0059509585,0.00034668206,0.0017958954,0.00046233565,0.000056009823],"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.000002557421,0.00003774935,0.000054478493,0.0000029394007,0.0000021064866,0.0000032299135,0.0003010519,0.00013623468,0.00007816803,0.95931685,0.000046292964,0.04001836],"study_design_scores_gemma":[0.00007993385,0.0001302509,0.002787993,0.00003053784,0.000001159869,0.000007668933,0.0000018531946,0.6694422,0.00097039755,0.3264101,0.00005312849,0.00008476547],"about_ca_topic_score_codex":0.000021729546,"about_ca_topic_score_gemma":3.6864662e-7,"teacher_disagreement_score":0.7808322,"about_ca_system_score_codex":0.000016247768,"about_ca_system_score_gemma":0.000058075366,"threshold_uncertainty_score":0.99920917},"labels":[],"label_agreement":null},{"id":"W2782891332","doi":"10.1016/j.tcs.2018.10.017","title":"Critical exponents of infinite balanced words","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Exponent; Critical exponent; Construct (python library); Word (group theory); Mathematics; Discrete mathematics; Combinatorics; Computer science; Scaling; Geometry","score_opus":0.015274009070791862,"score_gpt":0.28262871418596985,"score_spread":0.267354705115178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782891332","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.07701794,0.00007660198,0.9142208,0.00066065084,0.0035043238,0.00022350052,0.000014967071,0.00035371716,0.003927513],"genre_scores_gemma":[0.76584935,0.00000949766,0.23328564,0.00047586655,0.000344113,0.000012599533,0.0000024825601,0.000015546615,0.000004892389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99489117,0.00027055672,0.00076238834,0.0016089207,0.001507933,0.00095905777],"domain_scores_gemma":[0.99500823,0.000837416,0.00024509145,0.0028053946,0.0006522899,0.00045159383],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0028159812,0.0004619711,0.0006931043,0.00043292533,0.0002849447,0.000717184,0.008305403,0.00026485437,0.00013641128],"category_scores_gemma":[0.00055502687,0.00039459352,0.00021916491,0.0010957646,0.010184379,0.00064292055,0.012307814,0.00067823974,0.00012547772],"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.00001238526,0.00011989381,0.000063432926,0.00007567534,0.000009976323,0.000016259437,0.00062006764,0.000056354962,0.00056040596,0.9821606,0.00010907789,0.01619586],"study_design_scores_gemma":[0.00014892338,0.00018946924,0.00092519296,0.0003194262,0.0000096294525,0.00002026799,0.0000041275434,0.41189235,0.0063742474,0.5796963,0.000038595586,0.0003814592],"about_ca_topic_score_codex":0.0000051674533,"about_ca_topic_score_gemma":1.5206831e-7,"teacher_disagreement_score":0.68883145,"about_ca_system_score_codex":0.00008262604,"about_ca_system_score_gemma":0.0004177377,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W2784921327","doi":"10.1016/j.tcs.2019.07.003","title":"Type-two polynomial-time and restricted lookahead","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; CHIST-ERA; Agence Nationale de la Recherche","keywords":"Computability; Oracle; Class (philosophy); Time complexity; Mathematics; Closure (psychology); Polynomial; Discrete mathematics; Simple (philosophy); Subroutine; Computer science; Combinatorics; Programming language","score_opus":0.006589398957977416,"score_gpt":0.23664922752132503,"score_spread":0.2300598285633476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784921327","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.5177606,0.000060279923,0.47318465,0.0012613048,0.0013962808,0.00042576983,0.0000017476403,0.0004824141,0.0054269694],"genre_scores_gemma":[0.8341861,0.0000032233072,0.165084,0.0004948131,0.00015375561,0.0000022262439,7.844917e-7,0.0000107156675,0.00006440948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643636,0.0001920102,0.0003670792,0.0013508106,0.0008259424,0.0008277721],"domain_scores_gemma":[0.9970931,0.0005785806,0.000084258,0.0015097557,0.00028877557,0.0004455759],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012355865,0.0002874168,0.00037016877,0.0002754314,0.00029151826,0.0007108999,0.0029376992,0.00007623452,0.00013724843],"category_scores_gemma":[0.00013872434,0.00024153404,0.000062814266,0.0020477762,0.0023465848,0.0008079994,0.002987152,0.00029620374,0.0009111642],"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.000022211425,0.00011488862,0.0006054151,0.000010922815,0.000007314935,0.000031628966,0.00028726424,0.0003439152,0.006234187,0.9184552,0.00017478957,0.073712304],"study_design_scores_gemma":[0.00051563384,0.0005366187,0.0071511324,0.0000214085,0.000004755877,0.00013201535,0.0000019655567,0.9349513,0.0015876901,0.054456867,0.00024538068,0.0003952337],"about_ca_topic_score_codex":0.000016046759,"about_ca_topic_score_gemma":5.7624095e-7,"teacher_disagreement_score":0.9346074,"about_ca_system_score_codex":0.00009834151,"about_ca_system_score_gemma":0.00024455876,"threshold_uncertainty_score":0.9998667},"labels":[],"label_agreement":null},{"id":"W2790857551","doi":"10.1016/j.tcs.2018.02.001","title":"On the string matching with k mismatches","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"String (physics); Computer science; String searching algorithm; Mathematics; Matching (statistics); Combinatorics; Algorithm; Pattern matching; Programming language; Statistics","score_opus":0.010314673885081276,"score_gpt":0.2341122272412989,"score_spread":0.22379755335621762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790857551","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.106934264,0.000004144123,0.88759726,0.001729034,0.00029799438,0.00009847686,6.806501e-7,0.00014798604,0.0031901575],"genre_scores_gemma":[0.84112996,5.3983683e-7,0.15753579,0.0011496205,0.00016870299,0.0000032650878,1.6562457e-7,0.000005112882,0.0000068201607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980033,0.000071821196,0.00014162899,0.0005835265,0.0007443932,0.0004553513],"domain_scores_gemma":[0.99811566,0.00043410802,0.00005156902,0.0011121803,0.00013112185,0.000155381],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010936507,0.00015282002,0.000115565956,0.00008057445,0.0009953763,0.00073689345,0.0031600364,0.000024902727,0.0000458584],"category_scores_gemma":[0.00003553588,0.00007539307,0.000026088152,0.0007785762,0.0027525637,0.00059387315,0.0012500527,0.00019315573,0.00015104136],"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.0000069798903,0.00002034487,0.0000052048426,0.0000011116623,0.000001751481,0.0000053321332,0.00044614504,0.000049395316,0.00020184764,0.98095214,0.000100828605,0.018208902],"study_design_scores_gemma":[0.00014238658,0.0005024925,0.00041468604,0.000090545705,0.0000021114056,0.000040912975,0.000017449585,0.48510018,0.009438657,0.5038578,0.00018590194,0.00020689872],"about_ca_topic_score_codex":0.000005199974,"about_ca_topic_score_gemma":5.3585643e-7,"teacher_disagreement_score":0.7341957,"about_ca_system_score_codex":0.000027412854,"about_ca_system_score_gemma":0.00007594396,"threshold_uncertainty_score":0.9999614},"labels":[],"label_agreement":null},{"id":"W2794348239","doi":"10.1016/j.tcs.2018.02.026","title":"An approximation algorithm for the k-median problem with uniform penalties via pseudo-solution","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Algorithm; Mathematics; Approximation algorithm; Computer science; Combinatorics; Mathematical optimization","score_opus":0.01356936042573732,"score_gpt":0.23478928602623958,"score_spread":0.22121992560050227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794348239","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.0052120504,0.0000020753366,0.9880117,0.0034977011,0.00037520568,0.0005828646,9.4207064e-7,0.00011574235,0.0022017297],"genre_scores_gemma":[0.87365395,8.6975905e-7,0.12433884,0.001107873,0.00081452477,0.00004802938,0.000010174539,0.0000072965813,0.000018471743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875385,0.0000093277,0.00017345899,0.00032946857,0.00041112446,0.00032277725],"domain_scores_gemma":[0.9991127,0.000025774956,0.00004787283,0.00034684976,0.00044088907,0.000025885887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013533182,0.00011823257,0.00008372145,0.00012623647,0.0008740922,0.0004269182,0.000642512,0.000021748203,0.000113495196],"category_scores_gemma":[0.000016989388,0.00007103133,0.00002520871,0.00068033824,0.0019899425,0.0012741502,0.00014960552,0.00005686853,0.000115270996],"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.000018307688,0.000050053022,0.0000225626,0.00002827694,0.0000044210587,1.2319285e-7,0.00016062155,0.00032697932,0.000049331957,0.7587108,0.00014852478,0.24048],"study_design_scores_gemma":[0.00017177072,0.000103805425,0.000558358,0.000010990292,0.00001629408,9.5208435e-7,0.00006855529,0.9414298,0.000101243015,0.056187082,0.0012294367,0.00012174737],"about_ca_topic_score_codex":0.00009387986,"about_ca_topic_score_gemma":0.00006986533,"teacher_disagreement_score":0.9411028,"about_ca_system_score_codex":0.000029905481,"about_ca_system_score_gemma":0.000024974688,"threshold_uncertainty_score":0.73320264},"labels":[],"label_agreement":null},{"id":"W2802261039","doi":"10.1016/j.tcs.2018.04.022","title":"Approximation and complexity of multi-target graph search and the Canadian traveler problem","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Graph; Computer science; Approximation algorithm; Theoretical computer science; Mathematics; Combinatorics; Mathematical optimization","score_opus":0.039379010213812085,"score_gpt":0.27466528492848,"score_spread":0.23528627471466795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802261039","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.0077860323,0.00002156321,0.98580694,0.0036669536,0.000067096254,0.00037934686,0.0000020048067,0.000033739343,0.002236325],"genre_scores_gemma":[0.6358315,0.0000041373705,0.3638827,0.00025613193,0.00001533189,0.000003409607,3.691497e-7,0.0000022512247,0.000004179833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834764,0.00021178271,0.00020074892,0.00039473598,0.0004535375,0.0003915755],"domain_scores_gemma":[0.9988157,0.00009175914,0.000034673518,0.00036481288,0.00038034277,0.0003127034],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028486282,0.000100802645,0.00014996562,0.00019984724,0.00076377334,0.0004148422,0.00096335233,0.00003657165,0.000019255938],"category_scores_gemma":[0.00004764365,0.000064735344,0.000020697835,0.00083601306,0.018515224,0.00037485658,0.0004920376,0.00014300845,0.000005293011],"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.0000060150965,0.0000148063555,0.00007908883,0.000009140515,0.000001908757,3.6662811e-7,0.0024863814,0.00008869741,0.00004606444,0.98951507,0.0000061487053,0.0077463086],"study_design_scores_gemma":[0.00044231143,0.00008999603,0.001912737,0.000010352607,0.0000011966888,0.000011133229,0.000009974909,0.81104565,0.0006615383,0.18572655,0.000015414635,0.000073167896],"about_ca_topic_score_codex":0.0016374331,"about_ca_topic_score_gemma":0.0011306821,"teacher_disagreement_score":0.8109569,"about_ca_system_score_codex":0.000024131583,"about_ca_system_score_gemma":0.0002182996,"threshold_uncertainty_score":0.98415583},"labels":[],"label_agreement":null},{"id":"W2804617844","doi":"10.1016/j.tcs.2018.05.017","title":"Designing and implementing algorithms for the closest string problem","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Parameterized complexity; Algorithm; String (physics); Hamming distance; Time complexity; Set (abstract data type); String searching algorithm; Computer science; Mathematics; Pattern matching","score_opus":0.02336628486097867,"score_gpt":0.29476499538044393,"score_spread":0.27139871051946524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804617844","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.002085314,0.00005443823,0.99595284,0.0007179466,0.0003764195,0.00034362896,0.0000027297513,0.00012031262,0.00034634356],"genre_scores_gemma":[0.4329947,0.0000034080758,0.5664882,0.00020742022,0.00028491308,0.000012942218,3.838623e-7,0.000004694845,0.0000033386661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978481,0.000047030637,0.00023423787,0.00066121743,0.0004248264,0.0007845954],"domain_scores_gemma":[0.99828535,0.00061218435,0.00007696664,0.0006174959,0.00022157581,0.0001864012],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029328668,0.0001501938,0.00013140688,0.000082324965,0.001888991,0.0009996218,0.0020377154,0.000028785946,0.000009396291],"category_scores_gemma":[0.000069238,0.000093792405,0.000034042634,0.0005606416,0.002026445,0.00080973835,0.0024063843,0.00011784173,0.000007506997],"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.0000025900388,0.000009023955,0.000024939885,0.0000039509373,0.000002769856,8.2464413e-7,0.0003001702,0.000007725637,0.00073240366,0.6898618,0.000061182865,0.30899262],"study_design_scores_gemma":[0.00022702263,0.00025361223,0.0002865948,0.000033502118,0.000005758668,0.000028009737,0.00001899183,0.89772135,0.009144906,0.09077671,0.0013416107,0.00016193687],"about_ca_topic_score_codex":0.000007422278,"about_ca_topic_score_gemma":8.2882957e-7,"teacher_disagreement_score":0.8977136,"about_ca_system_score_codex":0.000025923298,"about_ca_system_score_gemma":0.000086471715,"threshold_uncertainty_score":0.9994104},"labels":[],"label_agreement":null},{"id":"W2806423369","doi":"10.1016/j.tcs.2020.05.039","title":"Tree path majority data structures","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Instituto Millenium","keywords":"Combinatorics; Logarithm; Binary logarithm; Sigma; Mathematics; Path (computing); Tree (set theory); Log-log plot; Time complexity; Entropy (arrow of time); Data structure; Space (punctuation); Linear space; Discrete mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.040455948883471746,"score_gpt":0.29748064855604134,"score_spread":0.2570246996725696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806423369","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.0008648135,0.0001463217,0.9898501,0.0028518112,0.0032618342,0.00033218972,0.00017147827,0.0005677055,0.0019537618],"genre_scores_gemma":[0.4299006,0.000020548692,0.5684486,0.0007985369,0.00072341954,0.000005153061,0.00008588379,0.000014705615,0.0000025858276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932966,0.0002249493,0.0005422737,0.0033067523,0.001790162,0.0008392482],"domain_scores_gemma":[0.99128944,0.00023422904,0.000236474,0.007294496,0.0002340313,0.0007113618],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015578071,0.0005383532,0.00059863104,0.00018451858,0.00055689644,0.0021911503,0.027310664,0.00023349845,0.00006681593],"category_scores_gemma":[0.00021517869,0.00042183936,0.00010955436,0.000890988,0.002657536,0.0013035052,0.08276959,0.0013171494,0.00009129673],"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.0000065186987,0.00004006805,0.000014213643,0.00003599978,0.000008893267,0.0000590925,0.0001747027,0.000074843156,0.00007438062,0.8660241,0.0023846037,0.1311026],"study_design_scores_gemma":[0.00010639548,0.00006154421,0.0007218417,0.000052624877,0.00000884001,0.000018589508,0.0000017106734,0.58477485,0.0002164725,0.4131828,0.0005120845,0.00034226762],"about_ca_topic_score_codex":0.000024535595,"about_ca_topic_score_gemma":9.940089e-7,"teacher_disagreement_score":0.5847,"about_ca_system_score_codex":0.00006407539,"about_ca_system_score_gemma":0.0006922157,"threshold_uncertainty_score":0.99982333},"labels":[],"label_agreement":null},{"id":"W2806746572","doi":"10.1016/j.tcs.2018.05.033","title":"Unary patterns under permutations","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Combinatorics; Permutation (music); Mathematics; Alphabet; Integer (computer science); Word (group theory); Discrete mathematics; Function (biology); Combinatorics on words; Computer science","score_opus":0.01175273181836696,"score_gpt":0.2700564735631998,"score_spread":0.25830374174483284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806746572","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.026654193,0.00000821578,0.964094,0.0039551957,0.0004001071,0.00010801742,0.0000029458283,0.00024377162,0.0045335866],"genre_scores_gemma":[0.8111624,0.000001727116,0.18748172,0.001033996,0.0002792577,0.000010947184,0.0000012065931,0.000004496825,0.000024232202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982532,0.00004577882,0.00018919872,0.0006054549,0.00047774072,0.0004285915],"domain_scores_gemma":[0.9985246,0.000120810786,0.000039716626,0.0007987431,0.0002855329,0.00023059477],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00048725784,0.000123131,0.00009765467,0.0001368201,0.0009284223,0.00029012092,0.0020170466,0.0000334872,0.00012559786],"category_scores_gemma":[0.0000168477,0.00010470575,0.000044406377,0.0011993912,0.002960325,0.0006859506,0.0008187976,0.0001182191,0.0004353534],"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":[6.535072e-7,0.000053020292,0.00006401241,9.798705e-7,0.0000017562708,0.000001715721,0.00021214847,0.00006680067,0.00022228008,0.9899177,0.000097152755,0.00936178],"study_design_scores_gemma":[0.000090966656,0.00012367057,0.011738421,0.000008308036,0.0000020923737,0.000046148798,0.0000104027995,0.58084184,0.0008176793,0.40591317,0.0002590859,0.00014822204],"about_ca_topic_score_codex":0.000004173607,"about_ca_topic_score_gemma":8.4995247e-7,"teacher_disagreement_score":0.7845082,"about_ca_system_score_codex":0.000052076593,"about_ca_system_score_gemma":0.00014261084,"threshold_uncertainty_score":0.99975306},"labels":[],"label_agreement":null},{"id":"W2884716215","doi":"10.1016/j.tcs.2018.06.045","title":"On asynchronous rendezvous in general graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"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 en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Asynchronous communication; Traverse; Computer science; Adversary; Characterization (materials science); Time complexity; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Computer network; Computer security; Geography","score_opus":0.010886347146242769,"score_gpt":0.26764632849572767,"score_spread":0.2567599813494849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884716215","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.03880006,0.0000052357564,0.94146025,0.0010478947,0.0005496868,0.00014877897,4.3314532e-7,0.00016324723,0.017824393],"genre_scores_gemma":[0.8168859,0.000002852609,0.18159094,0.0014128562,0.00007958719,0.0000050012513,3.0178734e-7,0.000005128842,0.00001745514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760157,0.00013003865,0.00023543414,0.0007078277,0.0006807326,0.00064437353],"domain_scores_gemma":[0.99865,0.00013016364,0.00003741329,0.00075353816,0.00017431409,0.00025457153],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012955777,0.00014478811,0.00014864076,0.00039542268,0.0003034955,0.00039082995,0.002196875,0.000045989356,0.00010551882],"category_scores_gemma":[0.00008334631,0.000118042,0.000038713355,0.0019056121,0.0028193714,0.00047318323,0.0006867009,0.00019761022,0.0002658785],"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.00000588251,0.00006697357,0.000039079645,0.0000013117104,8.6373655e-7,0.000011360823,0.00034165464,0.00083363405,0.00010983015,0.97292775,0.000091507965,0.025570167],"study_design_scores_gemma":[0.00020631443,0.0004717648,0.00069460046,0.0000136033805,3.3995087e-7,0.000012041921,9.1284267e-7,0.66432863,0.001061369,0.33302945,0.00005134963,0.0001295916],"about_ca_topic_score_codex":0.000005459587,"about_ca_topic_score_gemma":0.0000026762593,"teacher_disagreement_score":0.7780858,"about_ca_system_score_codex":0.00007586151,"about_ca_system_score_gemma":0.00014466117,"threshold_uncertainty_score":0.9998944},"labels":[],"label_agreement":null},{"id":"W2889518945","doi":"10.1016/j.tcs.2018.08.024","title":"Constant query time (1 + ϵ)-approximate distance oracle for planar graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Combinatorics; Mathematics; Binary logarithm; Time complexity; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.013018652046001375,"score_gpt":0.2536365564653466,"score_spread":0.24061790441934522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889518945","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.0036732478,0.00003741164,0.9885337,0.0009652131,0.0009758021,0.00036856605,0.000022837974,0.00042041397,0.0050028586],"genre_scores_gemma":[0.5310331,0.0000029343294,0.46801943,0.000703985,0.0001855825,0.000017807473,0.0000019122485,0.000010382834,0.000024874995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968112,0.000085029125,0.00037455268,0.0010910133,0.0006904206,0.00094778906],"domain_scores_gemma":[0.9974822,0.00045596436,0.00010743561,0.001194164,0.0004113252,0.00034890813],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017572746,0.00026850842,0.000313082,0.00023747436,0.0010960285,0.00064871507,0.0035551016,0.00006371033,0.000058230085],"category_scores_gemma":[0.00010068353,0.00022645062,0.00012973382,0.0016361689,0.008890465,0.00080073107,0.0007495952,0.00017069734,0.00014817408],"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.000022006358,0.00006922549,0.000015604195,0.000009610569,0.0000059631507,0.000006925259,0.00025238332,0.000003226289,0.000518914,0.97246706,0.00035675507,0.026272329],"study_design_scores_gemma":[0.00021047598,0.00031448004,0.000059733848,0.000028353494,0.0000033666804,0.000029279683,0.0000031426391,0.45969355,0.0026987998,0.53573203,0.0009943877,0.00023240696],"about_ca_topic_score_codex":0.0000026754335,"about_ca_topic_score_gemma":0.000001409039,"teacher_disagreement_score":0.52735984,"about_ca_system_score_codex":0.000052603988,"about_ca_system_score_gemma":0.00016714224,"threshold_uncertainty_score":0.9938068},"labels":[],"label_agreement":null},{"id":"W2891053194","doi":"10.1016/j.tcs.2018.09.005","title":"Population protocols with faulty interactions: The impact of a leader","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Impossibility; Mathematical proof; Computer science; Focus (optics); Theoretical computer science; Population; Distributed computing; State (computer science); Algorithm; Mathematics","score_opus":0.019973799382233298,"score_gpt":0.34060739758259034,"score_spread":0.32063359820035703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891053194","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.06642616,0.0000028651516,0.9297787,0.00033960902,0.00013731467,0.0016721055,0.0000033158794,0.00007448779,0.0015654674],"genre_scores_gemma":[0.9790789,9.544749e-8,0.020515416,0.000072100236,0.00013645917,0.00018338072,7.104701e-7,0.000004346338,0.000008608344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832803,0.00009796159,0.0002733256,0.00041452548,0.0005407073,0.00034545918],"domain_scores_gemma":[0.99831414,0.00011027069,0.00014442808,0.00087394164,0.00044849238,0.000108723376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086404174,0.00013990045,0.00018550477,0.0000828956,0.0003576825,0.00033317893,0.0017616637,0.000025322426,0.000027168322],"category_scores_gemma":[0.000044141998,0.00006889399,0.000069214184,0.0013019784,0.002428814,0.0007795112,0.000300838,0.00013568468,0.000030199799],"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.00003651529,0.00009122577,0.0013740291,0.000007133405,0.000010977723,0.0000018913714,0.0008014615,0.0003490652,0.00052827236,0.9756486,0.00015551115,0.02099534],"study_design_scores_gemma":[0.00038083785,0.0013278935,0.056483146,0.00019680754,0.0000038001203,0.00011575842,0.000017182727,0.91363543,0.0023996672,0.025001833,0.00020618715,0.00023144374],"about_ca_topic_score_codex":0.00006708158,"about_ca_topic_score_gemma":0.0000038764183,"teacher_disagreement_score":0.95064676,"about_ca_system_score_codex":0.00006454273,"about_ca_system_score_gemma":0.00011965369,"threshold_uncertainty_score":0.8949067},"labels":[],"label_agreement":null},{"id":"W2895157742","doi":"10.1016/j.tcs.2019.08.013","title":"Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"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":"Army Research Office; National Science Foundation; European Research Council; Banff International Research Station for Mathematical Innovation and Discovery; European Commission; American Institute of Mathematics","keywords":"Ergodic theory; Mathematics; Limit (mathematics); Probability distribution; Probability mass function; Lattice (music); Applied mathematics; Statistical physics; Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Physics","score_opus":0.007422290535116712,"score_gpt":0.2276371222684539,"score_spread":0.2202148317333372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895157742","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.44270277,0.000019031822,0.5567734,0.00005264188,0.00011205196,0.00023371384,0.000002950121,0.000017283443,0.000086131346],"genre_scores_gemma":[0.95568216,7.5287414e-7,0.043836474,0.000065539396,0.00030937087,0.000027523287,0.000060917933,0.000010202482,0.000007057613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845827,0.000047518795,0.00024011756,0.0006284653,0.00020889762,0.00041675995],"domain_scores_gemma":[0.9990264,0.000059882204,0.00007396593,0.00052983937,0.00016465399,0.00014524278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008925503,0.00014257879,0.00017025988,0.000031097105,0.00017812823,0.00005926268,0.0004167181,0.00010119202,0.000010017212],"category_scores_gemma":[0.000111887915,0.00012720872,0.00012541171,0.0003219502,0.0009501654,0.000010843079,0.00026107483,0.0001148426,0.0000061567407],"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.0001833482,0.00025978452,0.0005670811,0.000057602905,0.00006877398,5.036173e-7,0.00004342651,0.11719556,0.40717015,0.46206078,0.00014989723,0.012243088],"study_design_scores_gemma":[0.00023272693,0.00016275668,0.00041103453,0.000015275715,0.000029069828,0.000012595876,0.000004017673,0.95736253,0.021996886,0.019518746,0.00004242229,0.00021193808],"about_ca_topic_score_codex":5.199013e-7,"about_ca_topic_score_gemma":2.2575105e-7,"teacher_disagreement_score":0.840167,"about_ca_system_score_codex":0.00004367533,"about_ca_system_score_gemma":0.00008275278,"threshold_uncertainty_score":0.51874214},"labels":[],"label_agreement":null},{"id":"W2897193193","doi":"10.1016/j.tcs.2018.10.021","title":"Path queries on functions","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Ackermann function; Combinatorics; Successor cardinal; Element (criminal law); Inverse; Mathematics; Range (aeronautics); Path (computing); Function (biology); Discrete mathematics; Graph; Computer science","score_opus":0.00960591139529451,"score_gpt":0.24773992844400522,"score_spread":0.2381340170487107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897193193","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.007661426,0.000008757827,0.9775409,0.000859273,0.0016001062,0.00007930008,0.0000031487298,0.00028474745,0.01196236],"genre_scores_gemma":[0.82775503,0.000001758599,0.17071609,0.0010550475,0.0004267417,0.00000414803,9.1112094e-7,0.000004786377,0.00003545753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796593,0.00005948678,0.00017042852,0.00069826987,0.0006427075,0.00046319579],"domain_scores_gemma":[0.99824315,0.00013238828,0.000041878142,0.0011290507,0.00020979215,0.00024372031],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006728781,0.00014830033,0.00012610845,0.00014070806,0.00088690844,0.0004976907,0.0021619534,0.000037325848,0.00011080067],"category_scores_gemma":[0.000059709237,0.00010659299,0.000040606905,0.0009455481,0.003432284,0.00081880746,0.0013145204,0.00014719085,0.00079379644],"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.0000057402876,0.000042251693,0.000011040647,0.0000011540428,0.0000010988824,0.0000042343486,0.00014854172,0.0000067263927,0.00017192004,0.9255411,0.0009875974,0.073078565],"study_design_scores_gemma":[0.00021701626,0.001247664,0.001797082,0.000054009884,0.000002696295,0.000039871244,0.000008033086,0.80985695,0.004962411,0.1731711,0.008309416,0.00033375964],"about_ca_topic_score_codex":0.0000033768167,"about_ca_topic_score_gemma":3.3534414e-7,"teacher_disagreement_score":0.82009363,"about_ca_system_score_codex":0.000035687626,"about_ca_system_score_gemma":0.00009856267,"threshold_uncertainty_score":0.9999842},"labels":[],"label_agreement":null},{"id":"W2897485334","doi":"10.1016/j.tcs.2018.10.015","title":"On extensions of the deterministic online model for bipartite matching and max-sat","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Deterministic algorithm; Submodular set function; Monotone polygon; Binary logarithm; Matching (statistics); Combinatorics; Approximation algorithm; Simple (philosophy); Online algorithm; Discrete mathematics; Greedy algorithm; Algorithm; Graph","score_opus":0.02794348708303992,"score_gpt":0.290670138379534,"score_spread":0.2627266512964941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897485334","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.22634995,0.00000528246,0.7722778,0.0007100421,0.00036606207,0.00014094975,0.000009292081,0.000039554965,0.000101086196],"genre_scores_gemma":[0.7328291,8.8365624e-7,0.26635283,0.0007456337,0.00005805608,0.0000028229852,2.0339596e-7,0.0000037979596,0.0000066883235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851525,0.00004588771,0.00022221185,0.0004853365,0.00038542022,0.0003458745],"domain_scores_gemma":[0.9983593,0.00048421902,0.00006999472,0.00077539944,0.00018436283,0.00012667196],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006608687,0.00012865454,0.00016179532,0.000101499565,0.00063761947,0.0001464031,0.001742294,0.000030255616,0.0000033557828],"category_scores_gemma":[0.0001298885,0.00008328736,0.00006674298,0.00054504233,0.004611971,0.00019623627,0.0012499585,0.000116181174,0.0000035097505],"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.000007377145,0.000051269242,0.0000065633676,0.000006316211,0.0000015944446,5.1238334e-7,0.0004589111,0.00046385996,0.0005104323,0.9821997,0.000012040095,0.016281374],"study_design_scores_gemma":[0.000080414844,0.00014855253,0.0003981829,0.00003518811,0.000002695215,0.000009280998,0.0000018362522,0.5357492,0.00060102856,0.46290615,0.000005258852,0.00006220143],"about_ca_topic_score_codex":0.0000012882613,"about_ca_topic_score_gemma":0.000002495661,"teacher_disagreement_score":0.53528535,"about_ca_system_score_codex":0.000012925,"about_ca_system_score_gemma":0.00007743221,"threshold_uncertainty_score":0.9980969},"labels":[],"label_agreement":null},{"id":"W2897693141","doi":"10.1016/j.tcs.2018.10.012","title":"Perennial secure multi-party computation of universal Turing machine","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Ben-Gurion University of the Negev; Israel Science Foundation","keywords":"Turing machine; Computer science; Computation; Theoretical computer science; Universal Turing machine; Set (abstract data type); Time hierarchy theorem; Model of computation; Super-recursive algorithm; Non-deterministic Turing machine; Theory of computation; Time complexity; Algorithm; Programming language","score_opus":0.011466911643908808,"score_gpt":0.258196179037084,"score_spread":0.24672926739317516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897693141","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.103600085,0.000021408812,0.89472324,0.00017580246,0.0005798422,0.00010442328,0.000009795466,0.00014065625,0.0006447232],"genre_scores_gemma":[0.70736593,0.000001524161,0.29242864,0.000093099276,0.00010430599,6.096877e-7,0.0000019621377,0.0000035571397,3.789429e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799275,0.000101628604,0.00026982697,0.0006337498,0.00057234266,0.00042967638],"domain_scores_gemma":[0.9986463,0.000105488114,0.000100166595,0.00061274675,0.00031580223,0.00021949262],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00087106216,0.00016843819,0.00020306137,0.0002488502,0.00039587956,0.00019500533,0.0019953868,0.000055207747,0.000034378754],"category_scores_gemma":[0.00004189805,0.00014316967,0.00007926801,0.0013792778,0.0043360107,0.00087970257,0.0012258686,0.00018056852,0.000028680579],"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.000016704926,0.0001022289,0.00019466759,0.0000092183345,0.000004587823,0.000005077749,0.0013857653,0.00004901764,0.0010025527,0.98403263,0.000026243397,0.013171286],"study_design_scores_gemma":[0.0004991085,0.0003567057,0.0032237282,0.000031717158,0.000005593144,0.000023260884,0.000012425092,0.9203191,0.008370429,0.06686977,0.00007920522,0.00020895974],"about_ca_topic_score_codex":0.000017075385,"about_ca_topic_score_gemma":0.0000066414573,"teacher_disagreement_score":0.9202701,"about_ca_system_score_codex":0.000030026846,"about_ca_system_score_gemma":0.000100543206,"threshold_uncertainty_score":0.9983736},"labels":[],"label_agreement":null},{"id":"W2898623953","doi":"10.1016/j.tcs.2018.10.033","title":"Off-line and on-line algorithms for closed string factorization","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Combinatorics; Mathematics; Factorization; Prefix; Suffix; String (physics); Line (geometry); Algorithm; Integer (computer science); Discrete mathematics; Data structure; Computer science","score_opus":0.033646803485844784,"score_gpt":0.3082231752536396,"score_spread":0.2745763717677948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898623953","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.011584121,0.000020548177,0.98622274,0.0005741216,0.0009672803,0.00025171248,0.000011721843,0.00016168729,0.00020606948],"genre_scores_gemma":[0.6918716,0.0000064701107,0.3072076,0.00036571728,0.0005246325,0.000005299556,0.0000039684737,0.0000066461575,0.000008092047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792445,0.0000427288,0.00024730928,0.0008059864,0.0005165606,0.00046293915],"domain_scores_gemma":[0.99843115,0.00029000876,0.000073886586,0.0006565686,0.0003013873,0.00024698075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008705616,0.00018314054,0.00018487897,0.00015527071,0.0006131887,0.00046214196,0.0013600732,0.000056361896,0.000011332044],"category_scores_gemma":[0.000114629715,0.00013873332,0.000034917717,0.0006139327,0.0014536135,0.0007152763,0.00095170696,0.00011688925,0.000019744952],"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.000012104912,0.000036314057,0.000006609459,0.0000035518217,0.0000017762736,0.0000011910059,0.0001155256,0.00005521463,0.00039888025,0.679317,0.000036381858,0.3200155],"study_design_scores_gemma":[0.00040424554,0.0010900322,0.00028534705,0.00003606086,0.000002886272,0.0000084755,0.0000021911799,0.8968025,0.0136952875,0.08679037,0.0006988147,0.00018380446],"about_ca_topic_score_codex":0.0000019468719,"about_ca_topic_score_gemma":2.8676033e-7,"teacher_disagreement_score":0.8967473,"about_ca_system_score_codex":0.000034193494,"about_ca_system_score_gemma":0.000072433584,"threshold_uncertainty_score":0.5657381},"labels":[],"label_agreement":null},{"id":"W2898948556","doi":"10.1016/j.tcs.2018.12.014","title":"State complexity of pattern matching in regular languages","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Sigma; Alphabet; Word (group theory); Kappa; Mathematics; State (computer science); Matching (statistics); Discrete mathematics; Physics; Algorithm; Geometry; Statistics; Philosophy; Linguistics","score_opus":0.019041264832982706,"score_gpt":0.2783483248492058,"score_spread":0.2593070600162231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898948556","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.3344063,0.000051849653,0.66362447,0.00038356704,0.00055208785,0.00017993643,0.000012331129,0.0001493248,0.0006401415],"genre_scores_gemma":[0.8699179,0.0000076196798,0.12962882,0.00030189232,0.000116027455,0.0000065451486,0.0000033760318,0.000013946277,0.00000387218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960985,0.00031295745,0.0006483415,0.001255933,0.0009637484,0.00072052696],"domain_scores_gemma":[0.99700993,0.00024071653,0.00029117288,0.002054228,0.00020446966,0.00019948096],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0033038172,0.00035802607,0.0006009466,0.00043819484,0.00014250394,0.00043177645,0.006139079,0.00012867131,0.000047130477],"category_scores_gemma":[0.000054898446,0.00030812068,0.00012869466,0.00077893113,0.00650233,0.0003853296,0.009290372,0.0005863836,0.000034990215],"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.0000064354335,0.00010269588,0.00019595349,0.000110861925,0.0000081508515,0.000048080696,0.002535194,0.0005003465,0.00048276133,0.9460747,0.000024190875,0.049910616],"study_design_scores_gemma":[0.0001293679,0.00007091925,0.0034008683,0.00031349124,0.000002737183,0.000013377465,0.00001364626,0.33545768,0.0049457992,0.6553774,0.0000038099245,0.0002709233],"about_ca_topic_score_codex":0.00010882409,"about_ca_topic_score_gemma":0.0000086354785,"teacher_disagreement_score":0.5355116,"about_ca_system_score_codex":0.00009803473,"about_ca_system_score_gemma":0.0002220244,"threshold_uncertainty_score":0.9999371},"labels":[],"label_agreement":null},{"id":"W2904368314","doi":"10.1016/j.tcs.2018.10.019","title":"A simple linear-space data structure for constant-time range minimum query","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Data structure; Range (aeronautics); Simple (philosophy); Range query (database); Set (abstract data type); Mathematics; Linear space; Query optimization; Space (punctuation); Constant (computer programming); Computer science; Discrete mathematics; Algorithm; Sargable; Data mining; Web search query; Search engine; Information retrieval","score_opus":0.01974509309859996,"score_gpt":0.2915802183371953,"score_spread":0.2718351252385953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904368314","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.006575392,0.00003601684,0.9901248,0.0009763003,0.0008494473,0.00036820755,0.0002312976,0.00023754186,0.00060097163],"genre_scores_gemma":[0.4953857,0.000002091491,0.5031533,0.0007073692,0.00068673823,0.000003893048,0.000031218886,0.0000112737425,0.000018401413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668705,0.00009217878,0.00031594676,0.0013952197,0.0007167737,0.0007928043],"domain_scores_gemma":[0.99567103,0.00049946026,0.00010721227,0.0029584276,0.00040203103,0.00036180537],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013129722,0.00025931423,0.00030239564,0.00013480734,0.0008270483,0.0005762982,0.007078367,0.00009092203,0.00012493301],"category_scores_gemma":[0.00022765041,0.00019597725,0.0000518023,0.00088262674,0.0038535688,0.0015560844,0.005326063,0.00017743232,0.00010540111],"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.000040307572,0.000054089134,0.000022029019,0.000011556987,0.0000075049793,0.0000088873385,0.00031220264,0.0000128695465,0.0033796243,0.9500072,0.006505136,0.039638594],"study_design_scores_gemma":[0.0004107508,0.00030731707,0.00006481345,0.000027047272,0.000006680333,0.0000355749,0.000004336538,0.88980764,0.0027514242,0.09961257,0.0066740867,0.0002977753],"about_ca_topic_score_codex":0.0000062692493,"about_ca_topic_score_gemma":0.0000018385299,"teacher_disagreement_score":0.88979477,"about_ca_system_score_codex":0.000036018697,"about_ca_system_score_gemma":0.00027514328,"threshold_uncertainty_score":0.9988574},"labels":[],"label_agreement":null},{"id":"W2907265589","doi":"10.1016/j.tcs.2018.12.016","title":"The number of valid factorizations of Fibonacci prefixes","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Prefix; Fibonacci polynomials; Mathematics; Sequence (biology); Pisano period; Combinatorics; Lucas sequence; Recurrence relation; Arithmetic; Word (group theory); Lucas number; Discrete mathematics; Linguistics","score_opus":0.007265641520229918,"score_gpt":0.2561661758688777,"score_spread":0.24890053434864778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907265589","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.3189024,0.000027450307,0.67516273,0.0002872277,0.0007448335,0.00013985421,0.000003276357,0.00006494728,0.004667286],"genre_scores_gemma":[0.9670734,0.000007707016,0.032792185,0.000053521544,0.00002914085,0.0000021920287,3.6901415e-7,0.0000044539606,0.000037076006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834394,0.00009816719,0.00030912925,0.00034063487,0.00059605326,0.0003120632],"domain_scores_gemma":[0.9977782,0.00078206323,0.00013305499,0.0010104546,0.0002114942,0.00008474665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011645822,0.00010911378,0.00018703646,0.000054949363,0.00018635539,0.00013111347,0.0028479462,0.000032749063,0.000070212554],"category_scores_gemma":[0.00007230719,0.000067422574,0.000074323216,0.00088764814,0.0018429992,0.00041475188,0.0009158446,0.00009027803,0.00006078223],"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.0000027836336,0.000029588906,0.0013088728,0.000007860006,0.0000040068076,1.8052268e-7,0.00026939085,0.00004261393,0.0028719741,0.98593247,0.000018057886,0.009512212],"study_design_scores_gemma":[0.00018575121,0.00015064403,0.008707281,0.00005729675,0.0000055212145,0.000009244235,0.000025658635,0.2790412,0.06009038,0.65120435,0.00031529897,0.00020736767],"about_ca_topic_score_codex":0.0000029471576,"about_ca_topic_score_gemma":6.7903954e-8,"teacher_disagreement_score":0.64817095,"about_ca_system_score_codex":0.000015212252,"about_ca_system_score_gemma":0.000101484926,"threshold_uncertainty_score":0.67906076},"labels":[],"label_agreement":null},{"id":"W2907458073","doi":"10.1016/j.tcs.2018.12.025","title":"Syntactic complexity of bifix-free regular languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki","keywords":"Injective function; Cardinality (data modeling); Mathematics; Regular language; Alphabet; Upper and lower bounds; Combinatorics; Discrete mathematics; Function (biology); Semigroup; Computer science; Theoretical computer science; Linguistics; Automaton","score_opus":0.011359170030102426,"score_gpt":0.24601496610541337,"score_spread":0.23465579607531095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907458073","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.33439493,0.00005802766,0.65611,0.0010672441,0.0005234227,0.0001829581,0.0000037392192,0.00023990023,0.007419789],"genre_scores_gemma":[0.8707378,0.0000021212172,0.12882975,0.00034937603,0.00005102003,0.0000018974996,5.830858e-7,0.000007364592,0.000020073527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754584,0.00013030482,0.0003093318,0.00068097695,0.0008178207,0.00051569875],"domain_scores_gemma":[0.99697477,0.00032411478,0.00012072651,0.0022400687,0.00015154999,0.00018878278],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015822675,0.00018247956,0.00031328225,0.00019974113,0.00014709002,0.00020775433,0.0050188294,0.000051655898,0.00016949944],"category_scores_gemma":[0.00011761907,0.00014498529,0.00009384627,0.0010756177,0.0033635984,0.00071973604,0.0021979357,0.00016741747,0.00017832409],"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.000005762657,0.000056015404,0.0001490781,0.0000214948,0.000004782348,0.0000074559666,0.00023671622,0.000024908575,0.006442904,0.9845859,0.000048835955,0.008416146],"study_design_scores_gemma":[0.00034151852,0.00024645776,0.0037446935,0.00006698901,0.0000050932035,0.000055414122,0.000029437026,0.29947177,0.037887372,0.6578227,0.00006527147,0.0002632709],"about_ca_topic_score_codex":0.000009970114,"about_ca_topic_score_gemma":3.6551663e-7,"teacher_disagreement_score":0.53634286,"about_ca_system_score_codex":0.000038922793,"about_ca_system_score_gemma":0.00009622728,"threshold_uncertainty_score":0.9993487},"labels":[],"label_agreement":null},{"id":"W2910240168","doi":"10.1016/j.tcs.2019.10.006","title":"Some further results on squarefree arithmetic progressions in infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Square-free integer; Arithmetic; Mathematics; Combinatorics","score_opus":0.016454798319736685,"score_gpt":0.27484793513718514,"score_spread":0.25839313681744847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910240168","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.14828493,0.00048109854,0.82198256,0.009648871,0.008353769,0.0019344119,0.000065859786,0.0012062668,0.008042239],"genre_scores_gemma":[0.93444633,0.000026749778,0.06381297,0.0011574163,0.00043061524,0.000051166924,0.000007069813,0.000031539934,0.000036116482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932593,0.000457388,0.0008954745,0.0024788599,0.0016372718,0.0012717069],"domain_scores_gemma":[0.9941158,0.0010261273,0.00032211846,0.003958761,0.00017214412,0.00040504304],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0041827657,0.0006435748,0.0007203788,0.0010164372,0.00024107407,0.001251906,0.008333309,0.00036201728,0.000022725366],"category_scores_gemma":[0.00032284137,0.0005032995,0.00020289789,0.0016393613,0.0027374912,0.00066396396,0.009219099,0.0016783756,0.0004306797],"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.000045383447,0.00025580157,0.00004925018,0.000040289833,0.0000071444283,0.00007003206,0.0015725503,0.004425804,0.000033354718,0.94379294,0.000088495784,0.049618956],"study_design_scores_gemma":[0.0005341949,0.00030332344,0.0015432257,0.00080574694,0.000004786299,0.000013591735,0.000010599251,0.5263583,0.00035806748,0.46940237,0.000118356445,0.0005474145],"about_ca_topic_score_codex":0.000011388496,"about_ca_topic_score_gemma":0.0000014664706,"teacher_disagreement_score":0.7861614,"about_ca_system_score_codex":0.00022892252,"about_ca_system_score_gemma":0.00057571504,"threshold_uncertainty_score":0.9999765},"labels":[],"label_agreement":null},{"id":"W2911989380","doi":"10.1016/j.tcs.2006.06.021","title":"Coloring octrees","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Octree; Partition (number theory); Unit cube; Cube (algebra); Mathematics; Combinatorics; Computer science; Hypercube; Algorithm","score_opus":0.003326963702036951,"score_gpt":0.1764818607435589,"score_spread":0.17315489704152195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911989380","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.68378365,0.000049405626,0.26316306,0.000024295594,0.0007689727,0.000062412284,7.804354e-7,0.0004252695,0.051722147],"genre_scores_gemma":[0.99720824,7.2449814e-7,0.002548923,0.00002220043,0.00019790386,0.00000373306,3.1945288e-7,0.0000075139556,0.000010472228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991719,0.00001868978,0.0001271156,0.00016797692,0.00020670463,0.0003076104],"domain_scores_gemma":[0.9996267,0.000059992803,0.000008026533,0.00020820819,0.000025443464,0.000071616014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043917837,0.00008934464,0.00009379886,0.000077580844,0.0001388826,0.00009632112,0.00039305902,0.000024970013,0.000043842938],"category_scores_gemma":[0.000005115573,0.000075827826,0.000030401943,0.00041414853,0.0010103018,0.00013772708,0.00006216601,0.000077665754,0.000089194145],"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.0000013268075,0.0000065384506,0.00012308087,0.000005992017,0.0000011740699,0.000003895341,0.00003626585,0.00502326,0.0032765511,0.9895863,0.00006672277,0.0018689227],"study_design_scores_gemma":[0.00016833573,0.000062097795,0.0038401466,0.000034494675,0.0000049511123,0.00003686139,0.000011242123,0.5448751,0.035568323,0.4141628,0.00093329,0.00030234724],"about_ca_topic_score_codex":0.000001950666,"about_ca_topic_score_gemma":6.1305616e-7,"teacher_disagreement_score":0.5754235,"about_ca_system_score_codex":0.00002278596,"about_ca_system_score_gemma":0.000007026494,"threshold_uncertainty_score":0.37224987},"labels":[],"label_agreement":null},{"id":"W2912094370","doi":"10.1016/s0304-3975(01)00212-2","title":"Palindrome complexity","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; University of Alberta","keywords":"Palindrome; Mathematics; Morphism; Sequence (biology); Combinatorics; Upper and lower bounds; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.019404880997357755,"score_gpt":0.2512589619389404,"score_spread":0.2318540809415826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912094370","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.03651332,0.000029222174,0.9418839,0.00055255665,0.00079066947,0.000109522014,9.46995e-7,0.00038728476,0.01973257],"genre_scores_gemma":[0.7528226,0.0000014776953,0.24625452,0.0008587171,0.00004239865,0.0000033224046,2.7283627e-7,0.000005791199,0.000010933187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973189,0.00019809837,0.00026554812,0.00078566856,0.0007067015,0.0007250482],"domain_scores_gemma":[0.9980213,0.0002208614,0.00005926494,0.0012233389,0.00012330443,0.00035193315],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022966296,0.00019689206,0.00021936098,0.00016118182,0.00051240646,0.0005292414,0.002959863,0.000047977104,0.00018507676],"category_scores_gemma":[0.00012992045,0.0001590072,0.00007779185,0.0013318313,0.0037549364,0.00073362223,0.00070983655,0.00019374039,0.0003207526],"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.0000011149916,0.00005134463,0.000039642193,0.0000027493093,0.0000021230753,0.000015460997,0.00015282711,0.00001641549,0.00035308162,0.9891718,0.000044717555,0.010148712],"study_design_scores_gemma":[0.00017933486,0.0000990507,0.0008066484,0.000011438793,0.0000018726188,0.00013631025,0.00000481185,0.18181989,0.005623507,0.81045085,0.00062327686,0.00024302854],"about_ca_topic_score_codex":0.0000016528803,"about_ca_topic_score_gemma":1.8860706e-7,"teacher_disagreement_score":0.71630925,"about_ca_system_score_codex":0.00005069088,"about_ca_system_score_gemma":0.00013073675,"threshold_uncertainty_score":0.99895626},"labels":[],"label_agreement":null},{"id":"W2912588130","doi":"10.1016/j.tcs.2011.12.024","title":"Relativized codes","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Canada Research Chairs","keywords":"Prefix code; Alphabet; Prefix; Mathematics; Class (philosophy); Factorization; Discrete mathematics; Block code; Word (group theory); Code (set theory); Set (abstract data type); Computer science; Combinatorics; Decoding methods; Linear code; Algorithm; Programming language; Linguistics","score_opus":0.018758539228213668,"score_gpt":0.230878302459858,"score_spread":0.21211976323164433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912588130","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.023701001,0.00002260974,0.9376823,0.0002194853,0.00053928903,0.00009427889,5.930815e-7,0.00048843067,0.037252024],"genre_scores_gemma":[0.69868517,0.0000019095949,0.30078143,0.0004651302,0.00004371711,0.0000035926205,1.5318078e-7,0.0000050349645,0.00001387299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978951,0.00011186592,0.00023801943,0.00066597847,0.0005214081,0.0005676246],"domain_scores_gemma":[0.9983282,0.00019692414,0.0000614554,0.0010386022,0.0001105079,0.0002642728],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016632852,0.00016865163,0.00019264134,0.00016488269,0.00035347915,0.00024293226,0.003322278,0.000047011345,0.00017965824],"category_scores_gemma":[0.00006796464,0.00012922267,0.000067358254,0.0010442793,0.0028480995,0.0009871935,0.0012266703,0.0001694404,0.00031457792],"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.0000049082205,0.0000492058,0.00005895003,0.0000018165532,0.000002672671,0.000016188818,0.0009975968,0.0000023666985,0.00040709446,0.96695644,0.000037300153,0.03146547],"study_design_scores_gemma":[0.00016706108,0.00012772047,0.0018831905,0.000015353166,0.0000025634358,0.00004564454,0.0000060882776,0.2980994,0.010349356,0.68902564,0.00007600486,0.00020200008],"about_ca_topic_score_codex":0.0000042098936,"about_ca_topic_score_gemma":1.7435626e-7,"teacher_disagreement_score":0.67498416,"about_ca_system_score_codex":0.000031138537,"about_ca_system_score_gemma":0.00008187256,"threshold_uncertainty_score":0.9998656},"labels":[],"label_agreement":null},{"id":"W2912680787","doi":"10.1016/j.tcs.2003.06.004","title":"Packing arrays","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Alphabet; Upper and lower bounds; Row; Packing problems; Row and column spaces; Set (abstract data type); Equivalence (formal languages); Matching (statistics); Class (philosophy); Discrete mathematics; Computer science","score_opus":0.005519304663409126,"score_gpt":0.19487625343632034,"score_spread":0.1893569487729112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912680787","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.28266567,0.000022159567,0.70268893,0.000046504138,0.0006571916,0.000050302704,4.7280665e-7,0.00030843297,0.0135603305],"genre_scores_gemma":[0.9926018,0.000001460688,0.0071889614,0.00007268386,0.00012234808,0.0000025838056,1.9995953e-7,0.00000873539,0.0000012385924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913806,0.0000145304475,0.000118519594,0.00018060002,0.00022477524,0.00032349615],"domain_scores_gemma":[0.99954814,0.000031221276,0.000008165105,0.00025487845,0.000026464822,0.00013115817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004973203,0.00009485189,0.00009628234,0.00007450091,0.00015090768,0.000095715084,0.00043964808,0.000027263106,0.00003274233],"category_scores_gemma":[0.000010709974,0.000079219004,0.00003478786,0.00044539358,0.0011055348,0.00016447136,0.000060079812,0.000107075306,0.00013822025],"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.000001041565,0.00000610256,0.000010951782,0.000006700319,0.0000018445463,0.000005110538,0.00028599313,0.01692516,0.0031195316,0.9768834,0.000005099354,0.0027490475],"study_design_scores_gemma":[0.0002455756,0.000064272,0.000307883,0.00006454773,0.0000037242528,0.00005531897,0.000022612207,0.09109101,0.03669578,0.87103266,0.00016225828,0.00025436704],"about_ca_topic_score_codex":5.192024e-7,"about_ca_topic_score_gemma":1.644477e-7,"teacher_disagreement_score":0.70993614,"about_ca_system_score_codex":0.000037476846,"about_ca_system_score_gemma":0.000014697256,"threshold_uncertainty_score":0.40733892},"labels":[],"label_agreement":null},{"id":"W2913061818","doi":"10.1016/j.tcs.2019.08.005","title":"Refining the r-index","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","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":"Dalhousie University","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Japan Society for the Promotion of Science","keywords":"Index (typography); Computer science; Parsing; Matching (statistics); Lemma (botany); Product (mathematics); Data mining; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Programming language; Biology","score_opus":0.014765413942284405,"score_gpt":0.2647630129646452,"score_spread":0.24999759902236082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913061818","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.0018302932,0.00011982422,0.98461795,0.002409286,0.0044904454,0.00022501741,0.000006792848,0.0003114905,0.0059889182],"genre_scores_gemma":[0.8427301,0.000010449312,0.15547603,0.0012561494,0.00044275177,0.000015509817,0.0000040413547,0.00001507566,0.00004986998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954332,0.00020404112,0.00041781028,0.0016192031,0.001521651,0.0008040814],"domain_scores_gemma":[0.9946037,0.0004670228,0.00021345461,0.004199912,0.00026686225,0.000249049],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0026682587,0.0003881325,0.00038583874,0.0001947899,0.0007205976,0.0020727667,0.012939252,0.00018476835,0.0000404454],"category_scores_gemma":[0.00009103439,0.00023272623,0.0001515266,0.0008102729,0.002638767,0.0006049199,0.026361672,0.0012461101,0.0002842082],"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.0000035262674,0.00002589195,0.000058492224,0.000015110648,0.0000056837575,0.000010197713,0.00020816733,0.00456621,0.000023020713,0.9110966,0.00047399793,0.0835131],"study_design_scores_gemma":[0.00010207213,0.00005872148,0.000978025,0.00012591304,0.0000049429595,0.0000261293,0.0000023334376,0.85812193,0.00016917454,0.13850245,0.0015881837,0.00032012674],"about_ca_topic_score_codex":0.00002044854,"about_ca_topic_score_gemma":5.1421296e-7,"teacher_disagreement_score":0.85355574,"about_ca_system_score_codex":0.00009569968,"about_ca_system_score_gemma":0.00053234,"threshold_uncertainty_score":0.9989632},"labels":[],"label_agreement":null},{"id":"W2913376930","doi":"10.1016/j.tcs.2009.05.010","title":"Predictable semiautomata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.005467650429001623,"score_gpt":0.2282123256084742,"score_spread":0.22274467517947258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913376930","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.0216761,0.000048750437,0.9585672,0.0024174205,0.0005349795,0.0001255004,0.0000011973657,0.0010059712,0.015622887],"genre_scores_gemma":[0.8316801,0.0000035144276,0.16569507,0.002456113,0.00013790012,0.0000021995777,5.893592e-7,0.0000046307246,0.00001986833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728185,0.0000714684,0.00027165213,0.00081076956,0.000789406,0.0007748714],"domain_scores_gemma":[0.9979598,0.00014625424,0.00005982532,0.0013637688,0.000117148156,0.0003532069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015524109,0.00020269344,0.00021233942,0.00018990248,0.00044649633,0.0007042208,0.0042753955,0.00004516981,0.00006276896],"category_scores_gemma":[0.00006806454,0.00016164707,0.00006777565,0.0014209178,0.001343241,0.0013730815,0.00081875065,0.00019489163,0.00019818774],"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.0000022080776,0.0000522731,0.000010176657,0.0000016491811,0.000001290803,0.000019983125,0.00013686092,0.000044706198,0.0011960082,0.90598404,0.00034682045,0.09220399],"study_design_scores_gemma":[0.00013670359,0.00019400973,0.0011075006,0.000019363608,0.000001905507,0.000091034366,0.0000020791317,0.5551643,0.0054205726,0.43740472,0.00027342243,0.0001843984],"about_ca_topic_score_codex":0.000001003829,"about_ca_topic_score_gemma":4.126983e-8,"teacher_disagreement_score":0.810004,"about_ca_system_score_codex":0.000055343833,"about_ca_system_score_gemma":0.00012628497,"threshold_uncertainty_score":0.794482},"labels":[],"label_agreement":null},{"id":"W2914651966","doi":"10.1016/j.tcs.2005.11.006","title":"Uniqueness logic","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linear logic; Uniqueness; Type theory; Mathematics; Equivalence (formal languages); Computer science; Intuitionistic logic; Programming language; Algebra over a field; Theoretical computer science; Discrete mathematics; Calculus (dental); Type (biology); Pure mathematics","score_opus":0.018186929450197606,"score_gpt":0.2621283830519768,"score_spread":0.24394145360177916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914651966","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.0021998694,0.00005442932,0.9741633,0.0018902175,0.00068596,0.00015507915,1.2140357e-7,0.00044543762,0.020405572],"genre_scores_gemma":[0.8678828,0.0000026557577,0.13057923,0.0011777545,0.00029532134,0.0000073773854,2.8081962e-7,0.000005465747,0.000049111648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975854,0.00011149062,0.0002634514,0.0007204076,0.0006471493,0.0006720953],"domain_scores_gemma":[0.9984006,0.00011718771,0.000066235996,0.0009348911,0.00018560712,0.0002954518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016469621,0.00017996335,0.00019729536,0.0001488302,0.00039151454,0.00061422546,0.0032149884,0.00006257111,0.000047081423],"category_scores_gemma":[0.00004764851,0.0001317744,0.00006751248,0.0010781488,0.0018593199,0.00081225875,0.0009835189,0.00016717707,0.00048842904],"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.0000013700171,0.000043538097,0.0000386138,0.000003334404,0.0000016222891,0.000009049868,0.00022387164,0.000080764796,0.00013658,0.89324635,0.00005132033,0.106163606],"study_design_scores_gemma":[0.00018405232,0.00018261407,0.0002999123,0.0000037851253,0.000002464873,0.00009962401,0.0000040403124,0.3027485,0.004007985,0.68514025,0.007035205,0.00029156895],"about_ca_topic_score_codex":0.0000046628516,"about_ca_topic_score_gemma":0.000001189506,"teacher_disagreement_score":0.8656829,"about_ca_system_score_codex":0.00007640965,"about_ca_system_score_gemma":0.0001257545,"threshold_uncertainty_score":0.68507415},"labels":[],"label_agreement":null},{"id":"W2914993520","doi":"10.1016/s0304-3975(02)00589-3","title":"Euclidean strings","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Euclidean geometry; String (physics); Euclidean algorithm; Euclidean domain; Discrete mathematics; Graph; Prime (order theory); Euclidean distance matrix; Euclidean space","score_opus":0.008417326049985073,"score_gpt":0.23900861291711745,"score_spread":0.23059128686713237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914993520","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.009313599,0.000026696076,0.977297,0.0002861106,0.00071823463,0.00008822697,8.39081e-7,0.0002294398,0.012039818],"genre_scores_gemma":[0.6549694,0.0000024820956,0.34459153,0.00036972587,0.000047095513,0.000001987193,2.73931e-7,0.000004127776,0.000013397089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976759,0.00009654709,0.00021852569,0.0007314751,0.0006965526,0.0005810233],"domain_scores_gemma":[0.9982488,0.00014604158,0.000051011662,0.0010888966,0.00013093182,0.00033430502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013975672,0.00015896233,0.0001541109,0.0001415381,0.00047754834,0.00057801383,0.0026344657,0.00003884505,0.000081464335],"category_scores_gemma":[0.00011872223,0.00012283715,0.00004937019,0.001071019,0.0013060363,0.0010657075,0.0010166264,0.0001767154,0.00017792494],"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":[8.469361e-7,0.000029879086,0.000027539638,0.0000014993392,9.788322e-7,0.000009719382,0.000081537364,0.000029633433,0.00026869387,0.953125,0.00012334816,0.04630132],"study_design_scores_gemma":[0.00033365347,0.00016489676,0.00092115364,0.000029552206,0.000002853693,0.000114006354,0.0000056487097,0.45597628,0.014668705,0.52014536,0.007227182,0.0004107042],"about_ca_topic_score_codex":0.0000020554808,"about_ca_topic_score_gemma":8.571536e-8,"teacher_disagreement_score":0.6456558,"about_ca_system_score_codex":0.00003871112,"about_ca_system_score_gemma":0.00012643969,"threshold_uncertainty_score":0.5573801},"labels":[],"label_agreement":null},{"id":"W2916766399","doi":"10.1016/j.tcs.2013.05.025","title":"The 2-surviving rate of planar graphs without 6-cycles","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Graph; Computer science; Discrete mathematics; Computer graphics (images)","score_opus":0.01347688049830958,"score_gpt":0.27745239259162785,"score_spread":0.26397551209331827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916766399","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.104302235,0.000058877744,0.89137894,0.001322682,0.0003438599,0.00030219276,7.370261e-7,0.00012985521,0.0021606034],"genre_scores_gemma":[0.9119085,0.000015928124,0.087791935,0.0002043051,0.000031251282,0.0000192547,1.4312614e-7,0.0000088125,0.000019872654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.00040651188,0.00036546332,0.0006370139,0.0007952311,0.00085946685],"domain_scores_gemma":[0.99614394,0.0016016003,0.00011840054,0.0014182539,0.00042530347,0.0002924947],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038553246,0.00019029604,0.00023638997,0.00021196656,0.000878519,0.0005981405,0.005457862,0.00003987716,0.00002457998],"category_scores_gemma":[0.00030162997,0.000116987394,0.00008638547,0.0017619752,0.008051184,0.0010723617,0.0012410466,0.00027253648,0.00010375341],"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.000006235216,0.000021490594,0.00041526396,0.0000043508057,0.000005173425,0.0000018267374,0.00018640334,0.00004999052,0.0029696045,0.9592094,0.00003235336,0.03709795],"study_design_scores_gemma":[0.0001156778,0.00011670445,0.005783167,0.000021203405,0.0000014182007,0.000011893917,0.000015562619,0.17188309,0.006716038,0.81515026,0.000040679934,0.00014430235],"about_ca_topic_score_codex":0.00001409611,"about_ca_topic_score_gemma":0.0000015824394,"teacher_disagreement_score":0.8076063,"about_ca_system_score_codex":0.00002752363,"about_ca_system_score_gemma":0.000109228335,"threshold_uncertainty_score":0.9999231},"labels":[],"label_agreement":null},{"id":"W2922342170","doi":"10.1016/j.tcs.2019.03.005","title":"Edit distance neighbourhoods of input-driven pushdown automata","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Deterministic pushdown automaton; Pushdown automaton; Neighbourhood (mathematics); Embedded pushdown automaton; Context-free language; Automaton; Discrete mathematics; Nondeterministic algorithm; Nested word; Deterministic context-free grammar; Mathematics; Computer science; Combinatorics; Regular language; Theoretical computer science; Automata theory; Nondeterministic finite automaton; Quantum finite automata; Context-free grammar; Rule-based machine translation; Artificial intelligence","score_opus":0.004905713422251415,"score_gpt":0.22424705956990149,"score_spread":0.21934134614765008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922342170","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.10647921,0.0000315678,0.8822357,0.00073437864,0.001552237,0.0002138038,0.000005349091,0.0003287932,0.008418938],"genre_scores_gemma":[0.9008819,0.0000050620215,0.098469794,0.00045228808,0.00013688096,0.0000042846027,0.0000016617439,0.000011426362,0.00003672552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966843,0.000117074305,0.00045455154,0.0009381854,0.0010800048,0.0007258596],"domain_scores_gemma":[0.99700856,0.00035735572,0.00017738674,0.001971014,0.00020346261,0.00028219688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014295953,0.0002550866,0.00039604816,0.00021849037,0.00018607284,0.00032279646,0.0051562493,0.000075302865,0.00023336265],"category_scores_gemma":[0.000072513525,0.00020511754,0.0001180286,0.0015218367,0.002282873,0.001159888,0.0020461348,0.00023080685,0.00029273343],"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.000007214204,0.00008328332,0.00033627287,0.000020767748,0.0000053032636,0.0000067456162,0.00033937275,0.00018745419,0.003195592,0.9673943,0.00006371945,0.028359978],"study_design_scores_gemma":[0.0003980717,0.00030803357,0.0030168567,0.00008983325,0.0000045166016,0.000033748107,0.000009327721,0.8385248,0.006295713,0.15036693,0.00062503124,0.0003270908],"about_ca_topic_score_codex":0.000003871034,"about_ca_topic_score_gemma":2.5884088e-7,"teacher_disagreement_score":0.8383374,"about_ca_system_score_codex":0.00006182101,"about_ca_system_score_gemma":0.00018023391,"threshold_uncertainty_score":0.958168},"labels":[],"label_agreement":null},{"id":"W2942613632","doi":"10.1016/j.tcs.2019.05.010","title":"Palindromic Ziv–Lempel and Crochemore factorizations of m-bonacci infinite words","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences; Fonds De La Recherche Scientifique - FNRS","keywords":"Palindrome; Fibonacci number; Word (group theory); Factorization; Variation (astronomy); Mathematics; Computer science; Combinatorics; Algorithm; Physics","score_opus":0.010676924602460596,"score_gpt":0.25030753162492947,"score_spread":0.23963060702246888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942613632","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.21909414,0.00015063495,0.7774992,0.0004071889,0.0012961684,0.00029219352,0.000022961074,0.00017763216,0.0010599019],"genre_scores_gemma":[0.9064618,0.000037754617,0.09308777,0.000240144,0.00012247654,0.000008150881,0.0000070162464,0.00001770882,0.000017219827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641687,0.0001410512,0.0006082708,0.0013454943,0.0008794207,0.00060887233],"domain_scores_gemma":[0.9965479,0.0005445271,0.00032304283,0.002004791,0.0002891794,0.00029055524],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014057681,0.00041946076,0.0006240993,0.0004186599,0.00022594834,0.00066134305,0.004343484,0.0002476906,0.000044387503],"category_scores_gemma":[0.00012905114,0.00036105557,0.00013907884,0.0008870318,0.003069332,0.00046973833,0.008580731,0.000629878,0.000032941385],"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.000005302381,0.000058050675,0.00033370027,0.00009717416,0.000013803638,0.0000054432876,0.0012289081,0.0006747213,0.00058078376,0.9796542,0.000030143814,0.017317794],"study_design_scores_gemma":[0.0002622555,0.00011394542,0.0034416,0.00026842768,0.000016994076,0.000028695331,0.000014921241,0.5959091,0.0040688203,0.39529565,0.00008112901,0.00049844367],"about_ca_topic_score_codex":0.000009280372,"about_ca_topic_score_gemma":4.0825418e-7,"teacher_disagreement_score":0.6873676,"about_ca_system_score_codex":0.000062290426,"about_ca_system_score_gemma":0.0004660292,"threshold_uncertainty_score":0.9998841},"labels":[],"label_agreement":null},{"id":"W2946240107","doi":"10.1016/j.tcs.2019.04.007","title":"Ranking and unranking fixed-density necklaces and Lyndon words","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ranking (information retrieval); Prefix; Combinatorics; Mathematics; Time complexity; Running time; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.003989916041867961,"score_gpt":0.20771983853182152,"score_spread":0.20372992248995356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946240107","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.5680674,0.000092843686,0.42971462,0.00043195742,0.00033927304,0.00010364184,2.684493e-7,0.00014318484,0.0011068309],"genre_scores_gemma":[0.94607466,0.000015455063,0.053075325,0.0007466434,0.00006854854,0.000001592921,2.0910818e-7,0.000007036907,0.000010536641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978037,0.000103788145,0.00020563006,0.00085248664,0.0005123394,0.0005220968],"domain_scores_gemma":[0.99858844,0.00042127605,0.00006372942,0.0006479106,0.000066542896,0.00021208989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895419,0.00019608211,0.0002550028,0.00015843383,0.0003906967,0.0008379704,0.0012246121,0.000054623328,0.000029255727],"category_scores_gemma":[0.00004403105,0.000157542,0.00003421583,0.0006258829,0.0017462266,0.00096283306,0.0018164658,0.00019143366,0.000032617274],"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.000006659507,0.000012876721,0.0016176444,0.000013777374,0.0000029356936,0.000008121569,0.0007900693,0.000010060822,0.0018186239,0.9260891,0.0000068669046,0.069623254],"study_design_scores_gemma":[0.0004238875,0.00015428876,0.011249034,0.00009637851,0.0000051691623,0.00014157975,0.000027200485,0.71900785,0.0035201036,0.26499012,0.00006519855,0.00031918054],"about_ca_topic_score_codex":0.0000062088393,"about_ca_topic_score_gemma":5.1990617e-7,"teacher_disagreement_score":0.7189978,"about_ca_system_score_codex":0.000024489458,"about_ca_system_score_gemma":0.000044306078,"threshold_uncertainty_score":0.8080568},"labels":[],"label_agreement":null},{"id":"W2946472266","doi":"10.1016/j.tcs.2019.05.016","title":"Polygon simplification by minimizing convex corners","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Simple polygon; Mathematics; Combinatorics; Convex polygon; Rectilinear polygon; Polygon covering; Regular polygon; Equiangular polygon; Star-shaped polygon; Convex set; Geometry; Convex optimization; Computer science","score_opus":0.0056026312033588856,"score_gpt":0.228981535080546,"score_spread":0.22337890387718712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946472266","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.111366704,0.000038589384,0.8825444,0.001341347,0.0008878209,0.00018830606,0.0000016076382,0.00016248954,0.0034687193],"genre_scores_gemma":[0.925949,0.0000031209338,0.07270229,0.0011396216,0.000083697836,0.0000049363994,0.0000068229965,0.0000058565915,0.00010468142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780846,0.000078270736,0.00026283838,0.0007449452,0.000684158,0.00042134823],"domain_scores_gemma":[0.9986238,0.00023919411,0.000085692394,0.0006351667,0.00020198025,0.00021416944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095756404,0.00015516925,0.00016278037,0.00019091115,0.00026484247,0.0004564179,0.0015276048,0.000049268237,0.000067013156],"category_scores_gemma":[0.000046993675,0.00014143957,0.000049973718,0.0013275346,0.0006054597,0.0008690519,0.0004379539,0.00013393439,0.00038438672],"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.000005047337,0.000037942977,0.000058850084,0.0000046817618,0.0000026414634,8.86459e-7,0.00020186434,0.0009964874,0.019207546,0.94893926,0.0007382395,0.02980653],"study_design_scores_gemma":[0.00026504614,0.00016605588,0.0005932836,0.0000123114605,0.000002591643,0.000019512237,0.000008414015,0.9413645,0.02500797,0.030399164,0.0019094239,0.00025172887],"about_ca_topic_score_codex":0.0000016450597,"about_ca_topic_score_gemma":7.1783475e-8,"teacher_disagreement_score":0.940368,"about_ca_system_score_codex":0.00006695776,"about_ca_system_score_gemma":0.00012934273,"threshold_uncertainty_score":0.5767738},"labels":[],"label_agreement":null},{"id":"W2949692144","doi":"10.1016/j.tcs.2015.02.015","title":"Influence diffusion in social networks under time window constraints","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Bounded function; Set (abstract data type); Node (physics); Combinatorics; Mathematics; Time complexity; Integer (computer science); Discrete mathematics; Interval (graph theory); Graph; Cardinal number (linguistics); Computer science; Data mining","score_opus":0.009222613740755411,"score_gpt":0.2639103993097142,"score_spread":0.2546877855689588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949692144","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.80245507,0.0000027740132,0.1904022,0.000344695,0.00014612792,0.00010135196,0.000004052241,0.000025895548,0.0065178494],"genre_scores_gemma":[0.99851197,2.2922853e-7,0.00090048305,0.00028855467,0.0002756341,0.0000034320387,0.00000311333,0.000005974021,0.0000105919635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986596,0.00007026492,0.00020418601,0.00031356516,0.00033672282,0.00041562223],"domain_scores_gemma":[0.9993806,0.00007412092,0.000050987637,0.00015504878,0.00013350285,0.00020574832],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006959755,0.00012373632,0.00017024907,0.00006278944,0.00024259272,0.00015031618,0.00049464096,0.00004420176,0.000093270384],"category_scores_gemma":[0.000010929932,0.0001109817,0.000040207426,0.0005237575,0.003440103,0.00023065752,0.00031364852,0.00021316651,0.00006776823],"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.0000059930253,0.000050847706,0.0048202346,5.568324e-7,0.0000018315525,0.0000012664229,0.00033447752,0.009986505,0.0000837074,0.9790465,0.000025751999,0.0056422963],"study_design_scores_gemma":[0.0005267729,0.0000553205,0.027852718,0.000024285893,0.000002769426,0.0000011740154,0.00006757149,0.5606194,0.000039669896,0.41054478,0.000023782275,0.00024173246],"about_ca_topic_score_codex":0.000018569639,"about_ca_topic_score_gemma":3.13089e-7,"teacher_disagreement_score":0.5685017,"about_ca_system_score_codex":0.000054870037,"about_ca_system_score_gemma":0.0001548766,"threshold_uncertainty_score":0.999272},"labels":[],"label_agreement":null},{"id":"W2950599253","doi":"10.1016/j.tcs.2016.06.045","title":"Simultaneous visibility representations of plane st-graphs using L-shapes","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Visibility; Vertex (graph theory); Mathematics; Visibility graph; Plane (geometry); Embedding; Representation (politics); Geometry; Graph; Computer science; Physics; Artificial intelligence; Optics; Regular polygon","score_opus":0.01628924726108992,"score_gpt":0.2906817391612559,"score_spread":0.27439249190016596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950599253","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.22675195,0.00001370073,0.7721399,0.00040097555,0.00025136495,0.00010984177,0.0000075194803,0.00007205638,0.00025266665],"genre_scores_gemma":[0.80913,0.0000024184583,0.19071326,0.00008963576,0.000052724627,0.0000015923567,7.5129935e-7,0.0000031741627,0.0000064137375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787533,0.000121665435,0.0003554247,0.0006358751,0.0006886696,0.0003230428],"domain_scores_gemma":[0.9976206,0.001136282,0.00011251155,0.0005528146,0.00040620044,0.00017161641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009982622,0.00012924334,0.00017256389,0.00025578216,0.00026116354,0.00012301048,0.0012258921,0.000037042653,0.000057076253],"category_scores_gemma":[0.00036005882,0.00008870703,0.00006561573,0.0013701457,0.0015579509,0.0006676285,0.0005342274,0.00006320068,0.000014749434],"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.000009520674,0.000068537294,0.00015153403,0.000005386909,0.0000046678456,0.0000057894604,0.00013650658,0.008408453,0.024160597,0.9203718,0.000012592419,0.046664625],"study_design_scores_gemma":[0.00020536498,0.00013363862,0.0014082856,0.000026737307,0.000004337182,0.000032256925,0.0000028014408,0.7621389,0.020239504,0.21563956,0.000028718076,0.00013991905],"about_ca_topic_score_codex":0.000004902706,"about_ca_topic_score_gemma":8.3664753e-7,"teacher_disagreement_score":0.7537304,"about_ca_system_score_codex":0.000046932288,"about_ca_system_score_gemma":0.00017120718,"threshold_uncertainty_score":0.5740335},"labels":[],"label_agreement":null},{"id":"W2950744132","doi":"10.1016/j.tcs.2018.02.020","title":"Scheduling maintenance jobs in networks","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Preemption; Scheduling (production processes); Computer science; Time complexity; Mathematical optimization; Job shop scheduling; Simple (philosophy); Distributed computing; Mathematics; Algorithm; Computer network","score_opus":0.01711956884023272,"score_gpt":0.27661183589703037,"score_spread":0.2594922670567976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950744132","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.0033990846,0.000060905968,0.98795915,0.0017969551,0.0020900206,0.00041235323,0.0000011706924,0.000291705,0.003988663],"genre_scores_gemma":[0.57145923,0.0000370344,0.42750522,0.00072509795,0.00023121723,0.000016908709,0.0000016040135,0.000011376137,0.00001226593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534,0.00025923172,0.000574622,0.0016646275,0.00097567437,0.0011858552],"domain_scores_gemma":[0.996955,0.00021370873,0.00015913982,0.001760069,0.0005003902,0.00041171644],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003941069,0.0003592419,0.00042450745,0.00049344596,0.00031333402,0.0014206702,0.006666301,0.00024045206,0.000060646606],"category_scores_gemma":[0.00021022694,0.00031378603,0.00010533916,0.001795391,0.00389898,0.0005769495,0.009732799,0.0011867716,0.000096376505],"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.000004441714,0.000046436377,0.00012927272,0.000016098391,0.0000026525172,0.000019414205,0.00027662024,0.17658006,0.000005270451,0.81349415,0.00007508057,0.009350528],"study_design_scores_gemma":[0.00017359425,0.00007278253,0.000546488,0.00023822657,0.0000013601979,0.000010555755,0.0000017956648,0.81298417,0.0000551283,0.1855478,0.000049383216,0.00031872012],"about_ca_topic_score_codex":0.000009308749,"about_ca_topic_score_gemma":0.000002938643,"teacher_disagreement_score":0.6364041,"about_ca_system_score_codex":0.00019867958,"about_ca_system_score_gemma":0.0005135368,"threshold_uncertainty_score":0.9999314},"labels":[],"label_agreement":null},{"id":"W2951107219","doi":"10.1016/j.tcs.2019.05.004","title":"Approximability of covering cells with line segments","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; United States-Israel Binational Science Foundation","keywords":"Parameterized complexity; Line segment; Line (geometry); Combinatorics; Cover (algebra); Plane (geometry); Orientation (vector space); Set (abstract data type); Mathematics; Computer science; Geometry","score_opus":0.011110302829467116,"score_gpt":0.2442435876333809,"score_spread":0.23313328480391377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951107219","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.112527415,0.000026707597,0.88459384,0.00016046401,0.0011587009,0.000423089,0.00000820812,0.00009131299,0.0010102721],"genre_scores_gemma":[0.6795452,0.000003244319,0.3202346,0.00010073849,0.00008679431,0.0000067483334,0.00000457355,0.000006338153,0.0000117277095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662846,0.00011856864,0.00044499227,0.0011876202,0.001210191,0.0004101761],"domain_scores_gemma":[0.99735457,0.0002485339,0.00025912042,0.0014210282,0.00053663127,0.00018014891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398929,0.00028999377,0.00042243357,0.00026911445,0.0001404629,0.0003357469,0.0027474728,0.00011015304,0.000017482442],"category_scores_gemma":[0.000036307527,0.00023225264,0.000095063486,0.0009875316,0.0015192558,0.00039087338,0.004013053,0.00040502567,0.000024140994],"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.000022308648,0.0001542149,0.00004871263,0.0001474557,0.000014354278,0.000003437531,0.00028489102,0.44161448,0.0012365775,0.5436227,0.000011802606,0.012839108],"study_design_scores_gemma":[0.00022790198,0.00030165524,0.00041990128,0.00011664431,0.0000089348605,0.000008117344,0.0000014633863,0.90272063,0.040041346,0.055863507,0.000018135413,0.00027178664],"about_ca_topic_score_codex":0.000004380631,"about_ca_topic_score_gemma":2.2983554e-7,"teacher_disagreement_score":0.5670178,"about_ca_system_score_codex":0.00010228611,"about_ca_system_score_gemma":0.00062439375,"threshold_uncertainty_score":0.9470988},"labels":[],"label_agreement":null},{"id":"W2951631472","doi":"10.1016/j.tcs.2020.06.034","title":"Gathering in the plane of location-aware robots in the presence of spies","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","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":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Computer science; Trajectory; Cartesian coordinate system; Mobile robot; Set (abstract data type); Adversary; Competitive analysis; Upper and lower bounds; Artificial intelligence; Distributed computing; Mathematics; Computer security; Geometry","score_opus":0.03225027025388177,"score_gpt":0.2892882062314384,"score_spread":0.25703793597755664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951631472","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.0100829685,0.00005935268,0.9817541,0.0066011627,0.00018678048,0.0005570492,0.0000027320855,0.000025775998,0.0007300279],"genre_scores_gemma":[0.9530143,0.000023899684,0.046455756,0.0004444008,0.000032239725,0.00002260571,0.0000016288395,0.000004204579,9.257969e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969432,0.00050098315,0.0005158476,0.0005809464,0.0011229513,0.0003360918],"domain_scores_gemma":[0.99752325,0.0008708339,0.0001781551,0.0011540204,0.00021324032,0.00006050996],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0035258753,0.00017208775,0.00028956463,0.00020476722,0.00008533164,0.00026159812,0.007598753,0.00007245679,0.000008213622],"category_scores_gemma":[0.0002628931,0.000102435195,0.000052129108,0.001963034,0.0021479002,0.00024042783,0.0023956855,0.0005964091,0.000003921684],"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.000006404894,0.00007557867,0.0002121678,0.00010168892,0.0000018620158,0.000007685702,0.013226762,0.14162192,0.00004508208,0.8422931,0.000017427004,0.0023903323],"study_design_scores_gemma":[0.000104683866,0.000091466965,0.004030579,0.00023388056,0.0000016409963,0.0000048785428,0.000118757984,0.85958016,0.00029108408,0.135428,0.0000050914437,0.0001098079],"about_ca_topic_score_codex":0.000036942823,"about_ca_topic_score_gemma":0.000007412238,"teacher_disagreement_score":0.94293135,"about_ca_system_score_codex":0.000025583411,"about_ca_system_score_gemma":0.00031687444,"threshold_uncertainty_score":0.9977706},"labels":[],"label_agreement":null},{"id":"W2951748104","doi":"10.1016/j.tcs.2018.10.018","title":"Gathering in dynamic rings","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"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":"Rendezvous; Traverse; Computer science; Constructive; Focus (optics); Characterization (materials science); Class (philosophy); Interval (graph theory); Time complexity; Set (abstract data type); Network topology; Topology (electrical circuits); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Artificial intelligence; Computer network; Process (computing)","score_opus":0.008158914473346624,"score_gpt":0.26923965560583335,"score_spread":0.26108074113248675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951748104","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.03183215,0.0000056222793,0.9582294,0.0009909665,0.00029962134,0.00010174907,1.3170141e-7,0.00015493153,0.008385377],"genre_scores_gemma":[0.76130545,0.0000023479795,0.23821688,0.00042014843,0.000033265307,0.0000028460622,8.2156404e-8,0.0000037777072,0.000015184658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982653,0.000060621373,0.00018795737,0.0005212045,0.00044596853,0.0005189353],"domain_scores_gemma":[0.9990465,0.00007310146,0.000027700264,0.0005358252,0.00013949559,0.00017735633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329524,0.00010148664,0.00010895029,0.00024122358,0.00022504352,0.0003701652,0.002030394,0.000029282535,0.0000672708],"category_scores_gemma":[0.000057221914,0.0000865878,0.000023350894,0.0015699627,0.0023086595,0.00067908247,0.000981814,0.0001406594,0.00019323918],"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.0000017657236,0.00002472613,0.000088101726,0.0000020179152,4.9161196e-7,0.000004902958,0.00070554024,0.0002906329,0.00051263394,0.9687752,0.0000057462676,0.029588208],"study_design_scores_gemma":[0.00013958114,0.000120140845,0.0014855604,0.000020039222,2.4358238e-7,0.000011031182,0.0000028665202,0.9106056,0.00093568227,0.08647055,0.000093935814,0.000114777715],"about_ca_topic_score_codex":0.0000031283491,"about_ca_topic_score_gemma":0.000002771724,"teacher_disagreement_score":0.910315,"about_ca_system_score_codex":0.00006577011,"about_ca_system_score_gemma":0.000086688844,"threshold_uncertainty_score":0.8506352},"labels":[],"label_agreement":null},{"id":"W2951933371","doi":"10.1016/j.tcs.2019.05.025","title":"Quantifying sequential subsumption","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Ulster University; Queen's University Belfast; European Commission","keywords":"Subsequence; Extension (predicate logic); Intension; Multiset; Computer science; Relation (database); Set (abstract data type); Intersection (aeronautics); Interpretation (philosophy); Theoretical computer science; Representation (politics); Domain (mathematical analysis); Axiom; Artificial intelligence; Algorithm; Mathematics; Data mining; Discrete mathematics","score_opus":0.03138973070649824,"score_gpt":0.2808420414297092,"score_spread":0.24945231072321095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951933371","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.16054095,0.000016157508,0.8293215,0.00043469312,0.0014171496,0.00014182141,3.8233716e-7,0.0002216149,0.007905737],"genre_scores_gemma":[0.77427876,0.000002899512,0.22516331,0.00044639173,0.00009574585,0.0000018726489,5.008617e-7,0.0000044829935,0.000006030861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976937,0.00007746725,0.000216895,0.0007449594,0.0006960902,0.0005708468],"domain_scores_gemma":[0.9986647,0.00009668692,0.000056025314,0.0008893682,0.00010265804,0.00019058172],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012389724,0.00015070457,0.00016997203,0.00015514618,0.0002758455,0.000653516,0.0023573134,0.000049761347,0.00012674126],"category_scores_gemma":[0.000016878264,0.000116986295,0.00006950444,0.0009156727,0.0009229728,0.0009367855,0.0009886102,0.0001723128,0.001123709],"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.00000320033,0.000023901479,0.000365639,0.000005080124,0.0000015755871,0.0000064554333,0.00014416511,0.0001461857,0.0011589737,0.9538551,0.000018509894,0.044271205],"study_design_scores_gemma":[0.00022519239,0.00018194698,0.0029561215,0.000019130026,0.0000021215444,0.000044864424,0.0000036290098,0.92266905,0.0018751099,0.07145143,0.00032154395,0.00024983464],"about_ca_topic_score_codex":0.0000032737455,"about_ca_topic_score_gemma":3.5042314e-7,"teacher_disagreement_score":0.9225229,"about_ca_system_score_codex":0.000050144834,"about_ca_system_score_gemma":0.00008431004,"threshold_uncertainty_score":0.99965405},"labels":[],"label_agreement":null},{"id":"W2955563424","doi":"10.1016/j.tcs.2019.05.031","title":"On the complexity of the k-kernel problem on cyclically k-partite digraphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Digraph; Combinatorics; Mathematics; Kernel (algebra); Integer (computer science); Vertex (graph theory); Discrete mathematics; Bipartite graph; Graph; Computer science","score_opus":0.025252963076736835,"score_gpt":0.27816583279390467,"score_spread":0.2529128697171678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955563424","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.45671928,0.000009445047,0.5002633,0.011450039,0.0006112296,0.0011661408,0.0000054799393,0.00016476642,0.029610325],"genre_scores_gemma":[0.9842667,0.0000014315591,0.013783154,0.0018478369,0.000029078661,0.000014748798,1.6212643e-7,0.000010341638,0.00004657227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957562,0.0004916326,0.00035229832,0.0008615459,0.0017777353,0.0007605795],"domain_scores_gemma":[0.99521023,0.0015235621,0.00014196176,0.0026917872,0.00023424295,0.00019823304],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0027190705,0.00023839739,0.00026071034,0.00016070594,0.00054978643,0.0002595458,0.007800674,0.000051406238,0.000087677094],"category_scores_gemma":[0.00022646444,0.00011736415,0.00018006309,0.0023722162,0.012116394,0.0003235845,0.002193445,0.0005835198,0.00027702353],"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.00003466956,0.00011624435,0.00022995913,0.000007181892,0.0000052383234,0.0000011859656,0.00021346194,0.0006691875,0.0014702809,0.9942636,0.000049611856,0.0029394026],"study_design_scores_gemma":[0.00018366061,0.0004456802,0.004772833,0.000073846735,0.0000016816136,0.000006387584,0.0000037063169,0.114711754,0.0096341865,0.86994916,0.00006497928,0.00015209366],"about_ca_topic_score_codex":0.0000029276293,"about_ca_topic_score_gemma":8.927696e-7,"teacher_disagreement_score":0.5275474,"about_ca_system_score_codex":0.000051303254,"about_ca_system_score_gemma":0.0001223425,"threshold_uncertainty_score":0.9975676},"labels":[],"label_agreement":null},{"id":"W2962987831","doi":"10.1016/j.tcs.2011.05.057","title":"The growth function of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>S</mml:mi></mml:math>-recognizable sets","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scroll; Function (biology); Mathematics; Computer science; Algorithm; Computer graphics (images); Theology; Philosophy; Biology","score_opus":0.014901754697260744,"score_gpt":0.22520454045590907,"score_spread":0.21030278575864833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962987831","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.7656783,0.00008247997,0.22885574,0.0002159456,0.001321314,0.00005420572,0.000008442097,0.00017584073,0.0036077492],"genre_scores_gemma":[0.9772881,0.000041117575,0.021618057,0.00075165846,0.00021678225,0.0000309602,0.000006238577,0.000031904852,0.000015161275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967229,0.0001364029,0.0005296359,0.0008133938,0.00097638805,0.0008213129],"domain_scores_gemma":[0.9973391,0.0006356881,0.00031102897,0.0012682539,0.0001585265,0.00028736904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022993812,0.00028175567,0.00020241343,0.00011366143,0.0008995391,0.00052004267,0.002657903,0.00018557173,0.000041444036],"category_scores_gemma":[0.00022268562,0.00023866822,0.00023377787,0.00079804636,0.0024948851,0.0009830898,0.0016911955,0.00035670388,0.00046512697],"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.00007869346,0.00011168616,0.0000099070085,0.00003769381,0.00003182054,0.000029251696,0.00072857173,0.000057042398,0.0006240352,0.9884272,0.00013914896,0.009724937],"study_design_scores_gemma":[0.00025211557,0.00051234977,0.00029827523,0.00010235856,0.00003475966,0.00009622633,0.00005053153,0.88786787,0.013085982,0.097310126,0.00014264992,0.00024676882],"about_ca_topic_score_codex":0.000052135565,"about_ca_topic_score_gemma":0.0000054060024,"teacher_disagreement_score":0.8911171,"about_ca_system_score_codex":0.000014820194,"about_ca_system_score_gemma":0.00024578496,"threshold_uncertainty_score":0.97326076},"labels":[],"label_agreement":null},{"id":"W2963350743","doi":"10.1016/j.tcs.2018.10.004","title":"Hyperopic Cops and Robbers","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; St. Francis Xavier University; Acadia University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Swedish Foundation for International Cooperation in Research and Higher Education; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Countable set; Graph; Discrete mathematics","score_opus":0.049682151329604775,"score_gpt":0.36727250725716903,"score_spread":0.31759035592756424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963350743","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.61164373,0.000007975864,0.3647285,0.0015543328,0.0002365076,0.000077744495,0.0000012892266,0.00004765423,0.021702247],"genre_scores_gemma":[0.982138,9.519217e-7,0.016774112,0.0008080137,0.00017755218,0.00000269248,1.02229244e-7,0.0000032673704,0.0000953383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803513,0.00010559336,0.0002354621,0.00056143984,0.00076612615,0.0002962403],"domain_scores_gemma":[0.99805033,0.00073478743,0.000047615456,0.0006451702,0.0002823784,0.00023970788],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033315697,0.000088786626,0.00013191321,0.00013076524,0.0005966291,0.00041135473,0.0012860844,0.000027914532,0.0005867999],"category_scores_gemma":[0.0005349762,0.00005858091,0.000025924704,0.0011497937,0.012457889,0.00026238605,0.00054691115,0.0000860377,0.0010308586],"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.000004887032,0.000011845428,0.00018339464,2.5757262e-7,5.921158e-7,5.5852644e-7,0.00027033346,0.0000026917062,0.0007837351,0.94741327,0.00016870759,0.05115974],"study_design_scores_gemma":[0.00009632947,0.000143496,0.005539655,0.000004450923,0.0000026464136,0.000025076186,0.000039754297,0.033218354,0.0032787772,0.95495325,0.0025945383,0.00010366687],"about_ca_topic_score_codex":9.3794335e-7,"about_ca_topic_score_gemma":6.7594686e-7,"teacher_disagreement_score":0.37049425,"about_ca_system_score_codex":0.000011410193,"about_ca_system_score_gemma":0.0000445691,"threshold_uncertainty_score":0.999747},"labels":[],"label_agreement":null},{"id":"W2963812988","doi":"10.1016/j.tcs.2013.09.024","title":"Adaptive and optimal online linear regression on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>-balls","year":2013,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche; European Commission","keywords":"Regret; Ball (mathematics); Dimension (graph theory); Mathematics; Linear regression; Minimax; Algorithm; Discrete mathematics; Applied mathematics; Computer science; Combinatorics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.030323114225871677,"score_gpt":0.2978322730377435,"score_spread":0.2675091588118718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963812988","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.7423239,0.00084274367,0.049962673,0.0021214825,0.0036056247,0.00012085372,0.00036755172,0.0002661235,0.2003891],"genre_scores_gemma":[0.9604973,0.0005974955,0.034352537,0.001479082,0.0018789726,0.00032749743,0.00018370392,0.00033229828,0.00035108515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9853652,0.00074869033,0.0018703007,0.0029215373,0.00604317,0.003051094],"domain_scores_gemma":[0.98852855,0.0047254274,0.0013345283,0.0029692403,0.00055180956,0.0018904253],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.004501185,0.0008997749,0.00046309218,0.0007820461,0.0021571508,0.0026426446,0.004644618,0.0015271106,0.19913352],"category_scores_gemma":[0.0039457595,0.0012827392,0.0010463218,0.0023481478,0.009512961,0.0027092071,0.0054641934,0.0022327474,0.0046182447],"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.0014822608,0.00044271356,0.000005229841,0.00021426006,0.00029136,0.0011994872,0.0017195604,0.0054405625,0.0010561317,0.9080134,0.06245868,0.017676355],"study_design_scores_gemma":[0.0012018174,0.002882975,0.00011604575,0.00077032397,0.00018344972,0.0007554562,0.0008804389,0.64001703,0.35039315,0.0009020537,0.00094873115,0.000948529],"about_ca_topic_score_codex":0.00039672476,"about_ca_topic_score_gemma":0.00009751965,"teacher_disagreement_score":0.90711135,"about_ca_system_score_codex":0.00003083574,"about_ca_system_score_gemma":0.001832093,"threshold_uncertainty_score":0.9997691},"labels":[],"label_agreement":null},{"id":"W2963943201","doi":"10.1016/j.tcs.2018.06.039","title":"Constructing de Bruijn sequences by concatenating smaller universal cycles","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Disjoint sets; De Bruijn graph; Set (abstract data type); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Computer science","score_opus":0.010244523004723291,"score_gpt":0.2417172559699828,"score_spread":0.23147273296525953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963943201","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.175996,0.00001708225,0.81043464,0.00071147445,0.0004479893,0.000068274254,0.0000016761707,0.00029581835,0.012027064],"genre_scores_gemma":[0.8207243,0.00000149514,0.17854016,0.0005704137,0.0001509488,0.0000016212895,3.7016653e-7,0.0000056838276,0.0000050161075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976366,0.00019189848,0.00023248733,0.00070797425,0.00047448793,0.0007565428],"domain_scores_gemma":[0.99846226,0.00041468814,0.00009491158,0.0005043802,0.00022768935,0.00029608625],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019576054,0.00018872796,0.00017858567,0.00017653004,0.0008827592,0.0006177855,0.0027937836,0.000059603946,0.000076632554],"category_scores_gemma":[0.0001088743,0.0001640013,0.00006810018,0.0013034432,0.00933404,0.00078725826,0.0009723115,0.00020960416,0.00004661098],"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.0000055402047,0.000017193497,0.000425831,0.0000026219855,0.0000050383205,0.000007860001,0.00075275206,0.000003817678,0.0026379658,0.9301869,0.00007293524,0.065881506],"study_design_scores_gemma":[0.00030307623,0.00040927512,0.00024073261,0.00005819763,0.000007226088,0.00016088292,0.0002088287,0.38412574,0.041111406,0.5726906,0.000245246,0.00043878556],"about_ca_topic_score_codex":0.000011587838,"about_ca_topic_score_gemma":0.0000015983758,"teacher_disagreement_score":0.6447283,"about_ca_system_score_codex":0.0000882635,"about_ca_system_score_gemma":0.00018528383,"threshold_uncertainty_score":0.993362},"labels":[],"label_agreement":null},{"id":"W2963945095","doi":"10.1016/j.tcs.2019.07.018","title":"Energy-optimal broadcast and exploration in a tree using mobile agents","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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","keywords":"Tree (set theory); Node (physics); Computer science; Enhanced Data Rates for GSM Evolution; Mobile agent; Root (linguistics); Set (abstract data type); Broadcasting (networking); Energy (signal processing); Algorithm; Mathematics; Combinatorics; Theoretical computer science; Distributed computing; Computer network; Artificial intelligence","score_opus":0.023103416894729476,"score_gpt":0.2757461246963497,"score_spread":0.2526427078016202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963945095","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.17083596,0.000016447608,0.8276325,0.00015395199,0.00017059039,0.00015063143,2.7950213e-7,0.000051968847,0.000987714],"genre_scores_gemma":[0.8383829,0.000011523174,0.16130462,0.00025284564,0.000020269514,0.000006596182,4.6846645e-7,0.000004411227,0.00001638715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983081,0.00010029012,0.00020171738,0.00055175397,0.00045233726,0.00038579298],"domain_scores_gemma":[0.9992394,0.00006995698,0.0000393717,0.00039297287,0.00008829562,0.00017003069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007632848,0.000114685965,0.00013763546,0.00025276505,0.00012995371,0.0004367053,0.0008366191,0.000037079557,0.000040001374],"category_scores_gemma":[0.000012266879,0.00010050356,0.000021275968,0.0010148507,0.00062176445,0.0015046882,0.0007591662,0.000101985,0.000026423799],"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.0000053823987,0.00005153474,0.0002866033,0.000005120848,0.0000010769185,0.0000055645187,0.00094555493,0.02918507,0.0007331908,0.90697795,0.0000051274424,0.061797794],"study_design_scores_gemma":[0.0002875583,0.0001623655,0.00024894817,0.000022380533,6.297281e-7,0.000012602576,0.000013842547,0.9830645,0.0006271444,0.015351363,0.00007839336,0.0001302971],"about_ca_topic_score_codex":0.000008105823,"about_ca_topic_score_gemma":9.612105e-7,"teacher_disagreement_score":0.9538794,"about_ca_system_score_codex":0.00005148707,"about_ca_system_score_gemma":0.00008700504,"threshold_uncertainty_score":0.42111593},"labels":[],"label_agreement":null},{"id":"W2963996369","doi":"10.1016/j.tcs.2017.08.018","title":"Compressed cliques graphs, clique coverings and positive zero forcing","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Clique problem; Clique graph; Clique-sum; Clique; Uniqueness; Discrete mathematics; Split graph; Vertex (graph theory); Forcing (mathematics); Chordal graph; Graph; Line graph; 1-planar graph; Voltage graph; Mathematical analysis","score_opus":0.014143678941328121,"score_gpt":0.30547091327431436,"score_spread":0.29132723433298624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963996369","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.10786908,0.000042126034,0.88652194,0.0011324995,0.00027731538,0.0002551418,0.0000038856633,0.00018887901,0.0037091507],"genre_scores_gemma":[0.8776349,0.00002655373,0.12180118,0.00046436637,0.000041219908,0.000008256954,4.6288716e-7,0.0000116846995,0.000011416418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968785,0.00016333364,0.00027137063,0.0010709071,0.00075331074,0.0008625988],"domain_scores_gemma":[0.996726,0.0005186308,0.00015642837,0.0018163183,0.000320763,0.00046190707],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0020681755,0.0002579756,0.00030902927,0.00024671428,0.0022658457,0.0020903505,0.0049067605,0.0000722085,0.000007224949],"category_scores_gemma":[0.0002969541,0.00022114464,0.00007580281,0.00038857223,0.009195416,0.0025194383,0.004309311,0.00037994716,0.000016788525],"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.000024281428,0.000027538767,0.00039648844,0.0000080115615,0.0000057480524,0.00003075555,0.00032943554,0.000032374806,0.0022454394,0.97341275,0.000013227489,0.023473924],"study_design_scores_gemma":[0.0003012589,0.00026278934,0.008888208,0.00006724676,0.0000028888946,0.000053457756,0.000002894768,0.1827513,0.017785067,0.78957564,0.00003552465,0.00027373145],"about_ca_topic_score_codex":0.000017756744,"about_ca_topic_score_gemma":0.0000013560395,"teacher_disagreement_score":0.7697658,"about_ca_system_score_codex":0.000048913455,"about_ca_system_score_gemma":0.00009844611,"threshold_uncertainty_score":0.9990331},"labels":[],"label_agreement":null},{"id":"W2967821251","doi":"10.1016/j.tcs.2019.08.017","title":"Perfect Roman domination in graphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Interval graph; Bipartite graph; Vertex (graph theory); Minimum weight; Discrete mathematics; Dominating set; Strong perfect graph theorem; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.007997550992975874,"score_gpt":0.27476650948472203,"score_spread":0.26676895849174614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967821251","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.41806746,0.00001580817,0.5737574,0.0003664832,0.0003491738,0.00026152312,2.884813e-7,0.000114830895,0.0070670075],"genre_scores_gemma":[0.93963456,0.0000030098538,0.060095124,0.00020385023,0.0000220018,0.000009480695,3.5513997e-7,0.000007513973,0.000024089039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969654,0.00021979162,0.00024934046,0.0008931429,0.0009234337,0.0007488791],"domain_scores_gemma":[0.99811316,0.00041197168,0.000046805417,0.0010766732,0.00014287714,0.00020852612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028987662,0.00016763565,0.00020857998,0.0006847938,0.00017504078,0.0003139021,0.0032721916,0.00004984172,0.000083476276],"category_scores_gemma":[0.00010001137,0.00014240177,0.00006467288,0.0031113727,0.0017169957,0.0013317426,0.0011936148,0.00031046645,0.00036817836],"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.000010690021,0.000046188252,0.0010414515,0.0000057187235,0.0000010371464,0.000011243305,0.0002787478,0.0002464002,0.0022491822,0.97057563,0.000004553765,0.02552917],"study_design_scores_gemma":[0.00032952844,0.00021311291,0.0073293834,0.000022601616,5.1062204e-7,0.000018886354,0.0000055327628,0.38037905,0.0034101005,0.6080825,0.000035000343,0.00017383533],"about_ca_topic_score_codex":0.0000026573919,"about_ca_topic_score_gemma":0.0000011111582,"teacher_disagreement_score":0.5215671,"about_ca_system_score_codex":0.00009998499,"about_ca_system_score_gemma":0.00010138659,"threshold_uncertainty_score":0.6326342},"labels":[],"label_agreement":null},{"id":"W2969288761","doi":"10.1016/j.tcs.2020.11.015","title":"Bounding game temperature using confusion intervals","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Concordia University of Edmonton","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Upper and lower bounds; Combinatorics; Confusion; Mathematics; Bounded function; Interval (graph theory); Bounding overwatch; Closure (psychology); Class (philosophy); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.052806332973846626,"score_gpt":0.33198652342372825,"score_spread":0.2791801904498816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969288761","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.11199266,0.00008756756,0.87848663,0.0030179622,0.0046620574,0.00043993208,0.000005639457,0.00054983335,0.0007577001],"genre_scores_gemma":[0.77957517,0.000010821404,0.21834941,0.0013974472,0.0006272383,0.000007708223,0.000001987105,0.000024390016,0.0000058071446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940036,0.00031658512,0.0008127114,0.0023007928,0.001533978,0.0010323446],"domain_scores_gemma":[0.99617267,0.00034399863,0.00032054356,0.0019998509,0.00052918046,0.00063373544],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020026274,0.0005972687,0.0007046732,0.00038557753,0.00058227323,0.003540933,0.008896891,0.00035037944,0.00008336765],"category_scores_gemma":[0.00043901324,0.00052643975,0.0002640757,0.0014181162,0.004670763,0.0008423122,0.016989611,0.001625419,0.00018019199],"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.000009172919,0.000043679694,0.000019398285,0.000051006267,0.000011343854,0.00007198038,0.002724202,0.0030551818,0.016613483,0.9630581,0.00007758176,0.014264852],"study_design_scores_gemma":[0.000035410103,0.00009002392,0.00003073699,0.00030351002,0.000010066931,0.000038294,0.000014118998,0.6506827,0.03017815,0.31808785,0.00008958631,0.0004395804],"about_ca_topic_score_codex":0.000018522032,"about_ca_topic_score_gemma":8.6646236e-7,"teacher_disagreement_score":0.6675825,"about_ca_system_score_codex":0.00030873282,"about_ca_system_score_gemma":0.0007969648,"threshold_uncertainty_score":0.9997187},"labels":[],"label_agreement":null},{"id":"W2970627438","doi":"10.1016/j.tcs.2019.08.031","title":"Searching for a non-adversarial, uncooperative agent on a cycle","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Perimeter; Position (finance); RADIUS; Computer science; Upper and lower bounds; Constant (computer programming); Turning radius; Mobile robot; Mathematics; Algorithm; Artificial intelligence; Engineering; Geometry; Computer network","score_opus":0.01357223503755122,"score_gpt":0.28620262882830155,"score_spread":0.2726303937907503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970627438","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.01591741,0.000001669978,0.97187203,0.0017254304,0.0006702237,0.00072852185,0.0000016221531,0.00011481037,0.008968307],"genre_scores_gemma":[0.77897644,0.000001521643,0.21960223,0.0012651082,0.00006702722,0.000018431467,9.064841e-7,0.000006862261,0.0000615014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976927,0.00010017447,0.00019587422,0.0007355572,0.0006826073,0.00059309386],"domain_scores_gemma":[0.99836713,0.00040346256,0.000040821193,0.000663296,0.0002533303,0.000271977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016380568,0.00014995498,0.0001776989,0.00018934041,0.00041655503,0.0006464,0.0018649898,0.000036831014,0.000062015766],"category_scores_gemma":[0.00009699464,0.00011626061,0.00006814244,0.00083292625,0.0007086428,0.000617891,0.00072602544,0.00018544369,0.0003422123],"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.00001706255,0.000060209775,0.000007542968,0.0000074165314,0.0000034198006,0.0000018009042,0.0010115023,0.025326999,0.0005117833,0.9599742,0.00006006293,0.013017974],"study_design_scores_gemma":[0.0005392423,0.000714475,0.00006469686,0.000032493084,0.0000010356817,0.0000032016542,0.000008696681,0.9463731,0.0019267238,0.049857818,0.00031505577,0.00016345394],"about_ca_topic_score_codex":0.000002768377,"about_ca_topic_score_gemma":2.842813e-7,"teacher_disagreement_score":0.92104614,"about_ca_system_score_codex":0.00008289854,"about_ca_system_score_gemma":0.00023158891,"threshold_uncertainty_score":0.623325},"labels":[],"label_agreement":null},{"id":"W2974488648","doi":"10.1016/j.tcs.2019.09.020","title":"Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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","keywords":"Computer science; Synchronization (alternating current); Parallel computing; Clock synchronization; Channel (broadcasting); Real-time computing; Task (project management); Computer network","score_opus":0.015206644522195873,"score_gpt":0.2740966418056096,"score_spread":0.2588899972834137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974488648","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.39541873,0.00004224967,0.6032764,0.00019792495,0.00040896804,0.00023562048,0.00000567262,0.00006012078,0.0003543078],"genre_scores_gemma":[0.9782651,0.0000020230277,0.021476742,0.00019750479,0.000046231205,0.0000040316086,0.0000011483525,0.000004904222,0.0000023068267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774736,0.00009594556,0.0003140257,0.00080293644,0.0004901031,0.0005496282],"domain_scores_gemma":[0.9988878,0.00011755782,0.000088797715,0.00055064895,0.00016372837,0.00019150479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008441861,0.00017981936,0.000261062,0.00011863521,0.0001777996,0.0006896088,0.001490174,0.00006802298,0.0000061891365],"category_scores_gemma":[0.000070429334,0.00015925083,0.000027618076,0.0016803534,0.000943368,0.00075111625,0.0011423829,0.00011169609,0.000019859985],"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.00001780173,0.000091679736,0.013771501,0.000046470934,0.000004504365,0.0000314131,0.00038295012,0.019750424,0.00031391354,0.9471617,0.000015483509,0.018412191],"study_design_scores_gemma":[0.0005516168,0.00006580951,0.012862538,0.000094907606,0.0000015925606,0.00007857531,0.000010103335,0.9716826,0.00012467848,0.0143002765,0.000015908852,0.00021140813],"about_ca_topic_score_codex":0.00006446635,"about_ca_topic_score_gemma":0.000009379602,"teacher_disagreement_score":0.95193213,"about_ca_system_score_codex":0.00014738705,"about_ca_system_score_gemma":0.00014488814,"threshold_uncertainty_score":0.6649913},"labels":[],"label_agreement":null},{"id":"W2975694009","doi":"10.1016/j.tcs.2019.09.026","title":"Priority evacuation from a disk: The case of n = 1,2,3","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Robot; Servant; Queen (butterfly); Computer science; Position (finance); Simulation; Mathematics; Artificial intelligence; Business; Programming language","score_opus":0.010608038022033667,"score_gpt":0.2689961043936256,"score_spread":0.25838806637159195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975694009","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.20078959,0.000010925243,0.7958081,0.0011657511,0.0002931528,0.00021735004,0.0000018646774,0.000052257812,0.0016610296],"genre_scores_gemma":[0.904561,0.0000024892752,0.095145345,0.00024398207,0.000032039265,0.00000275624,5.433837e-7,0.0000027333147,0.000009107971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984806,0.00016574212,0.00021558115,0.00041442842,0.00045283444,0.0002708136],"domain_scores_gemma":[0.99827325,0.00040988027,0.000070607035,0.00090171216,0.00022630006,0.00011821906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015293794,0.00009033841,0.0001266854,0.000073709045,0.0002125389,0.00025267937,0.0017685342,0.000029193707,0.00011532363],"category_scores_gemma":[0.0000804729,0.000056071225,0.0000436376,0.0009084498,0.0011940546,0.00055731507,0.0008484085,0.00014021488,0.00010084838],"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.0000027658075,0.00002820867,0.00013556337,0.0000030067233,0.0000020873451,0.000010376557,0.0008044018,0.0007879355,0.0003728054,0.973094,0.000011723851,0.024747124],"study_design_scores_gemma":[0.0001525879,0.00008728861,0.0008663423,0.000010827089,0.0000018212552,0.00003929606,0.000012383853,0.87789243,0.00140176,0.119425446,0.000033689044,0.00007613836],"about_ca_topic_score_codex":0.000035666566,"about_ca_topic_score_gemma":0.0000021766057,"teacher_disagreement_score":0.87710446,"about_ca_system_score_codex":0.000026091253,"about_ca_system_score_gemma":0.00012402584,"threshold_uncertainty_score":0.43995437},"labels":[],"label_agreement":null},{"id":"W2984492834","doi":"10.1016/j.tcs.2019.11.011","title":"Finitely distinguishable erasing pattern languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Ministry of Education - Singapore","keywords":"Decidability; Alphabet; Mathematical proof; Equivalence (formal languages); Mathematics; Regular language; Discrete mathematics; Decision problem; Object (grammar); Dimension (graph theory); Theoretical computer science; Combinatorics; Computer science; Artificial intelligence; Algorithm; Linguistics; Automaton","score_opus":0.0051199541038309685,"score_gpt":0.2525612319938292,"score_spread":0.2474412778899982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984492834","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.0953579,0.000023066688,0.88518065,0.0007913825,0.000798047,0.00009545035,8.475684e-7,0.00033816692,0.017414473],"genre_scores_gemma":[0.89912033,7.363978e-7,0.09976875,0.00080041366,0.0001964082,0.0000017173824,7.9977923e-7,0.0000080583295,0.000102785794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977925,0.00009605156,0.00019582403,0.00071117724,0.00061654655,0.00058794755],"domain_scores_gemma":[0.9985165,0.0002909755,0.00006372092,0.00082139723,0.00010819317,0.0001992037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111333,0.00016733947,0.00018631101,0.00013956647,0.0003022932,0.00071568694,0.0022576898,0.00003656933,0.00015836205],"category_scores_gemma":[0.00012807205,0.00013348446,0.00005684122,0.000806238,0.00062087114,0.00044966998,0.0010360726,0.00027999072,0.0006484921],"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.0000012825471,0.000031243235,0.0026917644,0.000010617285,0.000002346359,0.000021393522,0.00044374308,0.00032572253,0.00026010565,0.7101457,0.000039711547,0.28602636],"study_design_scores_gemma":[0.00018687863,0.00015645608,0.005166565,0.000048064685,0.0000017690512,0.00004422064,0.000008803341,0.9767786,0.00087411003,0.015857093,0.0006176571,0.00025977305],"about_ca_topic_score_codex":0.000018926996,"about_ca_topic_score_gemma":3.028308e-7,"teacher_disagreement_score":0.9764529,"about_ca_system_score_codex":0.000030573246,"about_ca_system_score_gemma":0.00006835267,"threshold_uncertainty_score":0.83352697},"labels":[],"label_agreement":null},{"id":"W2985287154","doi":"10.1016/j.tcs.2019.10.048","title":"Palindromization and construction of Markoff triples","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Diophantine equation; Mathematics; Set (abstract data type); Monoid; Palindrome; Free monoid; Resolution (logic); Combinatorics; Pure mathematics; Algebra over a field; Computer science","score_opus":0.003379876228543957,"score_gpt":0.19893721235105163,"score_spread":0.19555733612250767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985287154","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.39427802,0.000018577299,0.6038404,0.00016574281,0.00031200837,0.00008077597,6.018203e-7,0.000054757194,0.0012491071],"genre_scores_gemma":[0.81760544,0.0000060910206,0.1822662,0.00009333783,0.00002079287,8.839566e-7,3.3100764e-7,0.0000025755564,0.000004315793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988166,0.00006419774,0.0001984138,0.00038891958,0.00032402962,0.0002078315],"domain_scores_gemma":[0.9991211,0.00017780448,0.000077064724,0.00044483322,0.00009111168,0.00008805891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009106261,0.00008998621,0.00015690128,0.00013375263,0.000090115704,0.0001368419,0.0007803995,0.00003404811,0.000042605414],"category_scores_gemma":[0.00003625471,0.00007259148,0.000026832042,0.0005745059,0.0015683803,0.0005205111,0.00048236104,0.00006570575,0.00001811822],"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.0000045672423,0.000012179722,0.00049395557,0.000009236796,0.000001604518,6.3365155e-7,0.00013171365,0.000021382839,0.0016531574,0.94297713,0.0000029690007,0.054691482],"study_design_scores_gemma":[0.0002727552,0.00013476686,0.0040493575,0.00003159461,0.000002462387,0.00005481288,0.000012201798,0.64879405,0.010134349,0.33636802,0.000026739172,0.000118866614],"about_ca_topic_score_codex":0.0000013854583,"about_ca_topic_score_gemma":5.0486815e-8,"teacher_disagreement_score":0.64877266,"about_ca_system_score_codex":0.000012787262,"about_ca_system_score_gemma":0.000048402882,"threshold_uncertainty_score":0.57787627},"labels":[],"label_agreement":null},{"id":"W2985478892","doi":"10.1016/j.tcs.2019.11.015","title":"A modular analysis of adaptive (non-)convex optimization: Optimism, composite objectives, variance reduction, and variational bounds","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta; Engineering and Physical Sciences Research Council; Alberta Machine Intelligence Institute","keywords":"Mathematical proof; Mathematical optimization; Regret; Computer science; Generalization; Convex optimization; Modular design; Mathematics; Convex analysis; Regular polygon; Algorithm; Machine learning","score_opus":0.021383389473001273,"score_gpt":0.33536394111611845,"score_spread":0.31398055164311717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985478892","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.036166087,0.000035885616,0.96189296,0.00027719847,0.0002987367,0.0002769089,0.000019107549,0.00002515319,0.0010079858],"genre_scores_gemma":[0.7024898,0.000005652174,0.29732955,0.000040533963,0.00005347874,0.0000050556437,0.0000034074424,0.0000061196083,0.0000663935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99498564,0.0002686433,0.00061345374,0.0011385372,0.002570581,0.00042314237],"domain_scores_gemma":[0.9959005,0.001109644,0.00025274494,0.00085700076,0.001627079,0.00025302125],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004085592,0.00018744625,0.0005546545,0.0010764938,0.00036556297,0.0004027946,0.001322886,0.00007313131,0.0006192841],"category_scores_gemma":[0.00042944477,0.00014846357,0.00011617181,0.007086887,0.0040288605,0.0010357624,0.0006927904,0.00021727924,0.000033259246],"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.000064429645,0.000055092507,0.0003100681,0.000001934219,0.00007622742,0.0000017523687,0.00051616755,0.7776806,0.0005339263,0.21871582,0.000005389641,0.0020386425],"study_design_scores_gemma":[0.00029825693,0.00020158332,0.015652781,0.000011012618,0.000046202953,0.000014176595,0.00006468487,0.9211148,0.00054987747,0.061872605,0.000012014729,0.0001620133],"about_ca_topic_score_codex":0.000008492262,"about_ca_topic_score_gemma":1.8952515e-7,"teacher_disagreement_score":0.6663237,"about_ca_system_score_codex":0.00009912078,"about_ca_system_score_gemma":0.0002766171,"threshold_uncertainty_score":0.9986816},"labels":[],"label_agreement":null},{"id":"W2991381026","doi":"10.1016/j.tcs.2019.11.022","title":"Unique decipherability in formal languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Chomsky hierarchy; Undecidable problem; Unique factorization domain; Combinatorics; Mathematics; Context (archaeology); Multiset; Factorization; Regular language; Word (group theory); Hierarchy; Context-free language; Formal language; Discrete mathematics; Philosophy of language; Computer science; Decidability; Artificial intelligence; Rule-based machine translation; Automaton; Philosophy; Algorithm","score_opus":0.004845414963894193,"score_gpt":0.2447670603921896,"score_spread":0.23992164542829542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991381026","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.49254256,0.000013862797,0.5004293,0.00030361238,0.00023063476,0.00012785269,4.0371376e-7,0.00013715628,0.0062146503],"genre_scores_gemma":[0.928524,0.0000015530976,0.0707121,0.00070004916,0.000037054706,0.0000045986494,3.379422e-7,0.0000049547757,0.000015320189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978538,0.00013618811,0.00024851895,0.0006488167,0.0004625644,0.00065011],"domain_scores_gemma":[0.99839234,0.00032948257,0.00004151773,0.001013881,0.0000648324,0.00015794963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002658019,0.00014827507,0.00019795728,0.00016588192,0.00011035184,0.00027212416,0.002576443,0.000051827228,0.00016173832],"category_scores_gemma":[0.000059431673,0.00011729761,0.000050757084,0.0010831323,0.0009451724,0.001329864,0.0012512057,0.00020866284,0.00020602155],"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.000004598999,0.00004304982,0.001095034,0.000005670421,7.561305e-7,0.000009413897,0.00035974602,0.00010622824,0.0010924829,0.944094,0.000005306633,0.053183682],"study_design_scores_gemma":[0.00035476167,0.00020292985,0.019355914,0.000037381153,7.995064e-7,0.000033360506,0.000025317077,0.6509535,0.0062815137,0.32236508,0.000117692085,0.00027175466],"about_ca_topic_score_codex":0.00000896886,"about_ca_topic_score_gemma":0.0000015709652,"teacher_disagreement_score":0.65084726,"about_ca_system_score_codex":0.000075084805,"about_ca_system_score_gemma":0.000104296065,"threshold_uncertainty_score":0.47877148},"labels":[],"label_agreement":null},{"id":"W2991631715","doi":"10.1016/j.tcs.2022.01.005","title":"The weighted k-center problem in trees for fixed k","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Center (category theory); Combinatorics; Mathematics; Computer science; Discrete mathematics; Crystallography; Chemistry","score_opus":0.014145522927294412,"score_gpt":0.28492772715649867,"score_spread":0.27078220422920424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991631715","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.011000423,0.000051370185,0.98201764,0.0041398387,0.00045763495,0.00071794854,0.000005466664,0.00012760932,0.0014820809],"genre_scores_gemma":[0.85454744,0.0000038869753,0.14467673,0.000397622,0.00004383717,0.00026520685,0.0000010606692,0.000010132903,0.000054099713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966484,0.00034897725,0.00030678094,0.00076403894,0.00096901756,0.00096278585],"domain_scores_gemma":[0.99746037,0.0012067851,0.00006240845,0.000963942,0.00013936228,0.00016715727],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.004405307,0.00015568994,0.00016498179,0.00026276545,0.0018549161,0.00040496278,0.0055911965,0.000020267878,0.000024924448],"category_scores_gemma":[0.00008758009,0.00010798088,0.00008062272,0.0022634526,0.002512155,0.00046671493,0.0031532673,0.0003668919,0.000011187927],"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.000046050172,0.000084157386,0.000099058445,0.000002432713,0.0000021781527,0.0000063889056,0.00032593313,0.0003334162,0.0002261546,0.9513416,0.00008430896,0.04744829],"study_design_scores_gemma":[0.00041790394,0.0002650724,0.00019450553,0.000004670813,5.465318e-7,0.00001848826,0.000015331429,0.40568566,0.00048937456,0.5898095,0.002977696,0.000121246645],"about_ca_topic_score_codex":0.0000013678069,"about_ca_topic_score_gemma":0.0000028044342,"teacher_disagreement_score":0.843547,"about_ca_system_score_codex":0.00015224698,"about_ca_system_score_gemma":0.00016372514,"threshold_uncertainty_score":0.99978906},"labels":[],"label_agreement":null},{"id":"W2999574320","doi":"10.1016/j.tcs.2018.05.036","title":"On store languages of language acceptors","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Pushdown automaton; Computer science; Nondeterministic algorithm; Regular language; Programming language; Nondeterministic finite automaton; Set (abstract data type); Finite-state machine; Theoretical computer science; Automaton; Automata theory","score_opus":0.005652122416816928,"score_gpt":0.2664795864860257,"score_spread":0.26082746406920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999574320","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.42762893,0.000019101015,0.5621289,0.00021714641,0.00041216382,0.00006761241,0.0000017704425,0.00017687661,0.009347512],"genre_scores_gemma":[0.95159197,7.301319e-7,0.04750401,0.00069024984,0.00018742823,0.0000017323126,3.8078494e-7,0.0000065267377,0.000016970538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821824,0.0000788725,0.00019721941,0.00050825684,0.0005941416,0.0004032502],"domain_scores_gemma":[0.99840325,0.00027677897,0.00007269127,0.0009662089,0.00012279395,0.00015826212],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009832266,0.00014409244,0.00017900443,0.00019337979,0.00019497625,0.00014495407,0.0026910184,0.000040844363,0.0001956704],"category_scores_gemma":[0.00011405999,0.000106571955,0.000057950256,0.0008951027,0.0033907732,0.0003708842,0.00080272474,0.00011476003,0.00016482078],"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.00000671022,0.00004479624,0.000017482897,0.0000036501142,0.0000024024441,0.0000067265473,0.0015399744,0.000005347666,0.0035336919,0.9407792,0.00013604535,0.053923987],"study_design_scores_gemma":[0.0005584349,0.0018958559,0.0035838296,0.00013501721,0.000007833718,0.00004497863,0.000190565,0.3086961,0.34745306,0.33667707,0.00015741032,0.00059984386],"about_ca_topic_score_codex":0.0000045917704,"about_ca_topic_score_gemma":3.8475952e-7,"teacher_disagreement_score":0.60410213,"about_ca_system_score_codex":0.000028757322,"about_ca_system_score_gemma":0.00005985626,"threshold_uncertainty_score":0.9993214},"labels":[],"label_agreement":null},{"id":"W2999689452","doi":"10.1016/j.tcs.2019.12.007","title":"Corrigendum to “The orthogonal colouring game” [Theor. Comput. Sci. 795 (2019) 312–325]","year":2020,"lang":"en","type":"erratum","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Involution (esoterism); Upper and lower bounds; Isomorphism (crystallography); Discrete mathematics; Mathematical analysis","score_opus":0.02459413783598354,"score_gpt":0.28905575378499726,"score_spread":0.26446161594901374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999689452","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.00010184464,0.00040280572,0.91744626,0.012177405,0.055703048,0.0013674624,0.000046702506,0.0007749412,0.011979527],"genre_scores_gemma":[0.2520447,0.00046903832,0.6045351,0.048408367,0.02672622,0.00059752923,0.00020071235,0.0008315732,0.06618677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98570144,0.0010424245,0.0011589781,0.0040045925,0.004879511,0.0032130545],"domain_scores_gemma":[0.99102986,0.00090913253,0.0004177885,0.0044174735,0.000990979,0.0022347819],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.0057739853,0.0012216948,0.0013051184,0.0010209861,0.0020372958,0.002641888,0.024389466,0.00050492695,0.00023299166],"category_scores_gemma":[0.0008670141,0.00092602643,0.0004876441,0.0072410735,0.009504127,0.0010395697,0.014910863,0.0042703133,0.0026004305],"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.00004466427,0.00007256377,0.0000049041146,0.000039196602,0.000026670132,0.00016353517,0.0006178795,0.00042637324,0.000040566345,0.72008836,0.25722244,0.021252854],"study_design_scores_gemma":[0.0004072125,0.00096583704,0.00021990192,0.00032258144,0.000028108265,0.00024392943,0.000017527855,0.38984808,0.0002974982,0.27548456,0.33064184,0.0015229081],"about_ca_topic_score_codex":0.0000069781568,"about_ca_topic_score_gemma":0.0000072206817,"teacher_disagreement_score":0.44460377,"about_ca_system_score_codex":0.0004468536,"about_ca_system_score_gemma":0.001890136,"threshold_uncertainty_score":0.999319},"labels":[],"label_agreement":null},{"id":"W3003022945","doi":"10.1016/j.tcs.2020.01.024","title":"Theory versus practice in annealing-based quantum computing","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Computer science; Quantum computer; Theoretical computer science; Quantum information science; Quantum; Adiabatic quantum computation; Computation; Abstraction; Algorithm; Quantum entanglement","score_opus":0.014502515370097254,"score_gpt":0.27484250850672864,"score_spread":0.26033999313663136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003022945","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.03819954,0.00008881343,0.94734186,0.011561236,0.0009841303,0.00019305608,0.0000011989833,0.00047863772,0.001151522],"genre_scores_gemma":[0.73855865,0.0000013419404,0.25644016,0.0047332505,0.000251633,0.0000015809718,6.1021234e-7,0.0000125129545,2.4723275e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575007,0.00054099323,0.00048780223,0.0012729305,0.0009777911,0.00097040867],"domain_scores_gemma":[0.99529713,0.0030234612,0.0001579683,0.0007807953,0.00021853451,0.000522134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032542169,0.00031909216,0.0003519811,0.00024136592,0.0004725866,0.00063138886,0.0035662383,0.00007883086,0.00001305557],"category_scores_gemma":[0.0014430459,0.0002771146,0.00010273899,0.0028221358,0.0016680015,0.0006289391,0.0014641497,0.00067662,0.00007245059],"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.00010096828,0.00006831549,0.000014713417,0.000011181116,0.0000045431884,0.0001017976,0.0021661737,0.06667977,0.00009574355,0.8540941,0.000017198628,0.07664553],"study_design_scores_gemma":[0.00096942106,0.0006037297,0.00016621717,0.000051163857,0.0000051686097,0.000021146761,0.00003959208,0.9680419,0.00062850193,0.028905177,0.00020569279,0.0003622869],"about_ca_topic_score_codex":0.0000055663163,"about_ca_topic_score_gemma":2.562563e-7,"teacher_disagreement_score":0.9013621,"about_ca_system_score_codex":0.00006528382,"about_ca_system_score_gemma":0.0003286988,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W3004640575","doi":"10.1016/j.tcs.2020.01.035","title":"A computational complexity analysis of tunable type inference for Generic Universe Types","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Computer science; Type inference; Inference; Theoretical computer science; Reduction (mathematics); Time complexity; Type (biology); Boolean satisfiability problem; Programmer; Computational complexity theory; Mathematics; Algorithm; Programming language; Artificial intelligence","score_opus":0.053689186814185594,"score_gpt":0.2856643271098364,"score_spread":0.2319751402956508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004640575","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.00733439,0.000023894829,0.99051064,0.0005332814,0.00021175462,0.00019362693,0.0000037721934,0.0001110404,0.0010775801],"genre_scores_gemma":[0.8387729,0.0000011655533,0.16078761,0.00037473012,0.000046780606,0.0000026822713,0.0000058605556,0.000003583563,0.000004684622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825627,0.00007462644,0.0002848117,0.00055910036,0.00048037863,0.00034479977],"domain_scores_gemma":[0.99841607,0.00029093114,0.00012709964,0.00036779392,0.00056170474,0.00023640077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059451896,0.0001377048,0.0003482859,0.00020908787,0.00021315333,0.00017137804,0.001622368,0.00004043299,0.000040204763],"category_scores_gemma":[0.00013573578,0.00011437152,0.000120351586,0.003803892,0.0015226041,0.00031691685,0.000715494,0.00007988472,0.000023331142],"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.00001376926,0.000038944163,0.00027164756,0.00001707069,0.000054803004,0.0000021379933,0.00058875245,0.0166247,0.000099346944,0.97752637,0.00003621399,0.004726223],"study_design_scores_gemma":[0.00015060887,0.0002824704,0.0007599722,0.0000015458555,0.000047467565,0.0000013571859,0.000008989307,0.8225996,0.00021230898,0.17556585,0.0002458065,0.00012399541],"about_ca_topic_score_codex":0.0000119760425,"about_ca_topic_score_gemma":0.0000013484081,"teacher_disagreement_score":0.8314385,"about_ca_system_score_codex":0.00003203537,"about_ca_system_score_gemma":0.00021597707,"threshold_uncertainty_score":0.5610098},"labels":[],"label_agreement":null},{"id":"W3009875838","doi":"10.1016/j.tcs.2021.05.014","title":"The game of Cops and Eternal Robbers","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Geology","score_opus":0.014841140689940763,"score_gpt":0.295436918663482,"score_spread":0.28059577797354124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009875838","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.08080437,0.0005569607,0.91553473,0.0010188634,0.00089103007,0.00025129094,0.0000026657683,0.00007885467,0.00086121325],"genre_scores_gemma":[0.87800825,0.00014847601,0.12160288,0.00013197535,0.00007151633,0.000012041148,6.2110297e-7,0.000010820254,0.000013445856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574935,0.00040316925,0.00045554322,0.0012050903,0.0014085148,0.0007783038],"domain_scores_gemma":[0.995537,0.0012402778,0.00019638205,0.00212413,0.0005539373,0.00034831444],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0035139336,0.00029107108,0.000400769,0.00020107006,0.0004642705,0.0012855149,0.0065010777,0.00011970191,0.000010905389],"category_scores_gemma":[0.0003129381,0.00020119942,0.0001341544,0.00096133363,0.012540093,0.0003998097,0.014926503,0.0009478083,0.0000047765698],"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.0000109602215,0.000023769304,0.000045957946,0.00002936002,0.000012653237,0.000020728228,0.0005480233,0.00051928323,0.00039906596,0.951264,0.0000063992393,0.04711978],"study_design_scores_gemma":[0.00013648928,0.000114971146,0.0006979843,0.00012884504,0.000005262591,0.000058787424,0.00001780529,0.36412215,0.004422106,0.63001525,0.00004474608,0.00023557333],"about_ca_topic_score_codex":0.0000057222487,"about_ca_topic_score_gemma":0.0000015104952,"teacher_disagreement_score":0.79720384,"about_ca_system_score_codex":0.000063391366,"about_ca_system_score_gemma":0.00049924554,"threshold_uncertainty_score":0.99975127},"labels":[],"label_agreement":null},{"id":"W3017628072","doi":"10.1016/j.tcs.2021.06.043","title":"General Cops and Robbers games with randomness","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Guidance and Control Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Probabilistic logic; Computer science; Theoretical computer science; Adversary; Mathematical economics; Pursuit-evasion; Operations research; Mathematics; Computer security; Artificial intelligence; Statistics","score_opus":0.004000665585847534,"score_gpt":0.19184694153111784,"score_spread":0.1878462759452703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017628072","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.5648739,0.00061541225,0.43158495,0.00008017704,0.0007853135,0.00018402569,0.0000020623104,0.00016214623,0.0017120444],"genre_scores_gemma":[0.98954386,0.00003419747,0.01003709,0.0000834409,0.00024635863,0.000025660536,0.0000023708074,0.000018029374,0.000009009933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854934,0.000047319652,0.00019399797,0.00047999003,0.00036408514,0.00036527863],"domain_scores_gemma":[0.9991916,0.00008019523,0.000026889225,0.00043541772,0.00009817485,0.00016775116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045739196,0.00023114962,0.00039257662,0.00006928552,0.00009065995,0.00048562096,0.00048700641,0.0000886007,0.000017758117],"category_scores_gemma":[0.000012838721,0.00017343898,0.00004483428,0.00019460158,0.0013425744,0.000107248336,0.00044950432,0.00030639928,0.0000038737153],"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.0001293982,0.00005453392,0.00092014315,0.0008106941,0.0001955385,0.00024111479,0.003130754,0.30211273,0.0034139107,0.63243175,0.00019492148,0.056364533],"study_design_scores_gemma":[0.00083284994,0.000047812486,0.0012052513,0.00033670277,0.000028746017,0.0000743626,0.000026756954,0.99209106,0.0011663316,0.003717833,0.000057741025,0.0004145645],"about_ca_topic_score_codex":0.00000806604,"about_ca_topic_score_gemma":0.0000027695846,"teacher_disagreement_score":0.6899783,"about_ca_system_score_codex":0.00003929411,"about_ca_system_score_gemma":0.00008034091,"threshold_uncertainty_score":0.70726365},"labels":[],"label_agreement":null},{"id":"W3017834538","doi":"10.1016/j.tcs.2020.04.009","title":"A linear-space data structure for range-LCP queries in poly-logarithmic time","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Science and Technology, Taiwan; National Science Foundation","keywords":"Linear space; Data structure; Combinatorics; Mathematics; Binary logarithm; Space (punctuation); Logarithm; Log-log plot; Range query (database); Range (aeronautics); Suffix; Time complexity; Inverse; Discrete mathematics; Computer science; Search engine","score_opus":0.020610470389528217,"score_gpt":0.2714613027795172,"score_spread":0.25085083238998895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017834538","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.0039958,0.000101455546,0.9860117,0.008809224,0.00031385163,0.0003390961,0.00011363542,0.00017534802,0.00013990121],"genre_scores_gemma":[0.386539,0.0000055061537,0.6115785,0.0015213477,0.00030669867,0.000005430265,0.000025110676,0.000010785562,0.000007573464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720794,0.0000885349,0.0002943703,0.0012860085,0.00051058544,0.0006125491],"domain_scores_gemma":[0.9976363,0.0002868238,0.00007521668,0.0015364322,0.00011900105,0.00034620828],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007714261,0.00022706711,0.00030557252,0.00011475787,0.00029279248,0.0004443823,0.0063111237,0.000077349934,0.000039904575],"category_scores_gemma":[0.000249328,0.00017945809,0.000040839586,0.001162157,0.0012765994,0.0015886056,0.004841669,0.00025285364,0.00003688559],"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.000051547977,0.000048427744,0.000049973674,0.00002238061,0.0000045103507,0.000019396015,0.0008051099,0.00023501972,0.001407197,0.92238104,0.0009775348,0.07399785],"study_design_scores_gemma":[0.00045743847,0.00019641312,0.0002616398,0.000027811877,0.0000032531977,0.00001622095,0.000004571183,0.95960075,0.0011519424,0.03571794,0.002315435,0.00024657138],"about_ca_topic_score_codex":0.000009755989,"about_ca_topic_score_gemma":0.0000020668713,"teacher_disagreement_score":0.9593657,"about_ca_system_score_codex":0.00003145323,"about_ca_system_score_gemma":0.00021959425,"threshold_uncertainty_score":0.9990652},"labels":[],"label_agreement":null},{"id":"W3020479143","doi":"10.1016/j.tcs.2020.04.007","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">NP</mml:mi></mml:math>-completeness of the game Kingdomino<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.svg\"><mml:msup><mml:mrow/><mml:mrow><mml:mtext mathvariant=\"italic\">TM</mml:mtext></mml:mrow></mml:msup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"Campus France; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Mathematics; Scalable Vector Graphics; Domino; Completeness (order theory); Combinatorics; Algebra over a field; Computer science; Artificial intelligence; Discrete mathematics; Pure mathematics; World Wide Web","score_opus":0.027275776130689044,"score_gpt":0.25469439900238244,"score_spread":0.2274186228716934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020479143","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.8708686,0.00072825106,0.0696044,0.0038569141,0.005972997,0.00022881445,0.00036409943,0.00070149597,0.047674432],"genre_scores_gemma":[0.9712428,0.00047379645,0.01902048,0.0052160714,0.002476536,0.0006390681,0.00017393785,0.0006514433,0.00010588172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9807026,0.0009897652,0.0037566833,0.0043396354,0.00566852,0.0045428025],"domain_scores_gemma":[0.98512983,0.0033365672,0.003120883,0.005708022,0.00060375704,0.0021009247],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.005261028,0.0018799884,0.0010521521,0.0006548482,0.003169981,0.0044399886,0.010937158,0.0024053126,0.008753292],"category_scores_gemma":[0.0026969875,0.0024550864,0.0025161589,0.0034869248,0.01059584,0.0035025647,0.009927299,0.0030429664,0.00673541],"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.00093395857,0.0006209435,0.000008163021,0.0010546718,0.0006860982,0.0018321287,0.00867151,0.004018624,0.005410595,0.9660685,0.003601659,0.0070931455],"study_design_scores_gemma":[0.00096585223,0.0019646625,0.000092652,0.0012693619,0.0007012075,0.0023595868,0.0011357083,0.8141039,0.1711125,0.0019636329,0.0024960972,0.0018348433],"about_ca_topic_score_codex":0.0010992296,"about_ca_topic_score_gemma":0.00020616947,"teacher_disagreement_score":0.9641049,"about_ca_system_score_codex":0.00007040873,"about_ca_system_score_gemma":0.0030638385,"threshold_uncertainty_score":0.9993944},"labels":[],"label_agreement":null},{"id":"W3021772469","doi":"10.1016/j.tcs.2020.03.013","title":"Makespan minimization on unrelated parallel machines with a few bags","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Minification; Combinatorics; Approximation algorithm; Time complexity; Mathematics; Schedule; Polynomial-time approximation scheme; Scheduling (production processes); Computer science; Polynomial; Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.008816355427615812,"score_gpt":0.2082529349930051,"score_spread":0.1994365795653893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021772469","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.024672281,0.000012541391,0.970906,0.0011749415,0.00014726224,0.000087709355,0.00000132564,0.00047736,0.0025205594],"genre_scores_gemma":[0.73962605,0.0000031636303,0.25962836,0.0006465947,0.00007389828,0.0000022995903,0.0000029001994,0.000013128047,0.0000036066835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910367,0.000021947315,0.00012229319,0.00025310827,0.0002817231,0.00021725158],"domain_scores_gemma":[0.99951905,0.00005833165,0.000014773948,0.00015127411,0.000056880646,0.00019966181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117687225,0.00012454597,0.00011184081,0.00005885404,0.000107913555,0.00011269146,0.00029110615,0.00003563194,0.0000828032],"category_scores_gemma":[0.00003428176,0.00009274607,0.000018318216,0.00074430613,0.00045621986,0.00010097961,0.000039983763,0.0001397718,0.00007618079],"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.000023639843,0.000011359509,0.00003791665,0.000007098707,0.0000048319303,0.0000058309015,0.0003627573,0.857564,0.000033488544,0.13587232,0.00003616612,0.006040604],"study_design_scores_gemma":[0.00027516144,0.00016485034,0.00020403751,0.000021662041,0.000005199495,0.0000057274588,0.0000057603343,0.9980036,0.00037117873,0.00077409844,0.00002652948,0.00014217487],"about_ca_topic_score_codex":3.2040083e-7,"about_ca_topic_score_gemma":8.8045695e-8,"teacher_disagreement_score":0.7149538,"about_ca_system_score_codex":0.00001705099,"about_ca_system_score_gemma":0.000018866214,"threshold_uncertainty_score":0.3782075},"labels":[],"label_agreement":null},{"id":"W3022258227","doi":"10.1016/j.tcs.2018.03.016","title":"Swapping colored tokens on graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan","funders":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Colored; Security token; Combinatorics; Vertex (graph theory); Parameterized complexity; Bipartite graph; Mathematics; Time complexity; Discrete mathematics; Computer science; Graph","score_opus":0.008224338296942463,"score_gpt":0.2485510264796883,"score_spread":0.24032668818274583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022258227","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.88588846,0.000016244629,0.09765671,0.00027084196,0.00046665067,0.0001458341,0.0000020982736,0.00003072552,0.015522427],"genre_scores_gemma":[0.98718464,0.0000049405235,0.011689529,0.00071724236,0.00034724496,0.0000041143035,0.000003154002,0.000007979349,0.000041137682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987871,0.000035989546,0.00010945485,0.0004400211,0.00026618605,0.00036125805],"domain_scores_gemma":[0.9992947,0.000013604895,0.000025682652,0.0004013539,0.0001299136,0.00013476073],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00046067644,0.00010946241,0.00008325305,0.000070842085,0.00022876647,0.00006544404,0.0005450222,0.000046617028,0.000084798216],"category_scores_gemma":[0.00004285984,0.00009155743,0.000042261974,0.00029565237,0.0027469813,0.0000039965057,0.00032024263,0.000059859565,0.0001711025],"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.00008390301,0.00010601502,0.00024627266,0.000005729153,0.000019912537,0.000005452059,0.00020620445,0.000024003159,0.4215004,0.56062734,0.0009415682,0.016233167],"study_design_scores_gemma":[0.0011477191,0.006041272,0.0075393454,0.000047557045,0.000019977484,0.000046139256,0.0000365287,0.02670308,0.88840884,0.056881223,0.0123003265,0.00082801486],"about_ca_topic_score_codex":6.606565e-7,"about_ca_topic_score_gemma":4.8490364e-7,"teacher_disagreement_score":0.5037461,"about_ca_system_score_codex":0.00001259468,"about_ca_system_score_gemma":0.00004104435,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W3023452807","doi":"10.1016/j.tcs.2010.01.007","title":"Remembering without memory: Tree exploration by asynchronous oblivious robots","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Robot; Computer science; Asynchronous communication; Task (project management); Theoretical computer science; Node (physics); Tree (set theory); Swarm robotics; Graph; Mobile robot; Constructive; Self-reconfiguring modular robot; Computation; Distributed computing; Algorithm; Artificial intelligence; Mathematics; Robot control; Combinatorics","score_opus":0.013010429633134717,"score_gpt":0.25849732909190537,"score_spread":0.24548689945877064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023452807","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.011610231,0.000009330842,0.9751519,0.002097497,0.00095803925,0.00025440712,7.551283e-7,0.00041933014,0.009498495],"genre_scores_gemma":[0.7042872,0.0000049151195,0.2951487,0.00039741493,0.000099221805,0.000012468646,0.0000016363908,0.000009929271,0.0000385415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720615,0.00010288813,0.00029793006,0.00081831217,0.00090196804,0.0006727635],"domain_scores_gemma":[0.99810356,0.0001146892,0.00008154605,0.0009957108,0.0002724638,0.00043200795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016291906,0.00020686534,0.00020086953,0.00019502628,0.0005625551,0.0010370149,0.002485157,0.00007775513,0.000094192015],"category_scores_gemma":[0.00012797875,0.00017761588,0.000050202972,0.0011457064,0.0017230518,0.0020612369,0.00090789975,0.00041000472,0.00014994782],"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.0000041655567,0.00008164173,0.000045541172,0.00000518556,0.0000027753185,0.0000052340088,0.00069100683,0.0026941705,0.013754273,0.8957092,0.00029737956,0.08670943],"study_design_scores_gemma":[0.00028423444,0.00016011205,0.0000995937,0.000012972673,0.0000021847152,0.000031456024,0.000005899404,0.9532411,0.01162307,0.034054942,0.00021424863,0.00027016024],"about_ca_topic_score_codex":0.0000061239357,"about_ca_topic_score_gemma":0.000007748739,"teacher_disagreement_score":0.950547,"about_ca_system_score_codex":0.000047162688,"about_ca_system_score_gemma":0.00017752897,"threshold_uncertainty_score":0.9999959},"labels":[],"label_agreement":null},{"id":"W3023624987","doi":"10.1016/j.tcs.2019.10.008","title":"Ranked document selection","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Selection (genetic algorithm); Computer science; Information retrieval; Mathematics; Natural language processing; Artificial intelligence","score_opus":0.004385236818466683,"score_gpt":0.23341579447857627,"score_spread":0.2290305576601096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023624987","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.041232724,0.000013732302,0.95284307,0.00048038547,0.0010431483,0.00018234333,4.3412953e-7,0.0002391367,0.0039650574],"genre_scores_gemma":[0.77515024,0.0000020853324,0.22432204,0.0004009569,0.000085934094,0.000003426914,6.2489715e-7,0.000004057493,0.00003066431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778825,0.000068491965,0.00019964126,0.0007245723,0.00074515236,0.00047386895],"domain_scores_gemma":[0.99872124,0.00010264352,0.00005182482,0.00078401325,0.00013547688,0.00020480857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841071,0.00014294234,0.00015491998,0.00014213438,0.00028147292,0.00054422027,0.00220822,0.000039189606,0.00020171962],"category_scores_gemma":[0.000016639277,0.000108428976,0.000046978592,0.0009999431,0.00054800423,0.0013274284,0.0013256044,0.00016032715,0.0006984215],"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.000004483345,0.000024193598,0.00008437984,0.0000029826551,0.0000021396033,0.0000018665612,0.000086897366,0.00016889519,0.0012719352,0.95811534,0.00009194357,0.04014493],"study_design_scores_gemma":[0.00029918956,0.000222311,0.0013199568,0.0000214967,0.000001759429,0.00003384692,0.0000018426574,0.86891574,0.0059706755,0.12197421,0.0010337711,0.0002051853],"about_ca_topic_score_codex":0.0000046366845,"about_ca_topic_score_gemma":1.336972e-7,"teacher_disagreement_score":0.8687469,"about_ca_system_score_codex":0.00006510509,"about_ca_system_score_gemma":0.000096724434,"threshold_uncertainty_score":0.8977028},"labels":[],"label_agreement":null},{"id":"W3026005886","doi":"10.1016/j.tcs.2019.06.024","title":"State grammars with stores","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Embedded pushdown automaton; Rule-based machine translation; Tree-adjoining grammar; L-attributed grammar; Bounded function; State (computer science); Phrase structure grammar; Indexed grammar; Context-sensitive grammar; Terminal and nonterminal symbols; Context-free grammar; Mathematics; Definite clause grammar; Production (economics); Computer science; Algorithm; Artificial intelligence","score_opus":0.0037112011740026846,"score_gpt":0.20199407623767815,"score_spread":0.19828287506367548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026005886","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.25530583,0.0000145127415,0.74105436,0.00039433557,0.00039281874,0.0001442875,7.673069e-7,0.00028687814,0.0024062349],"genre_scores_gemma":[0.82971996,0.0000017225407,0.16952638,0.000658862,0.00003616244,0.0000034374514,3.281884e-7,0.00000840494,0.000044713994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974991,0.00007517168,0.00018360063,0.000783558,0.00080023636,0.00065831747],"domain_scores_gemma":[0.9981908,0.00020122198,0.00006194557,0.0011618084,0.0001263124,0.00025788383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011195671,0.00019260948,0.0002037477,0.00016159912,0.00021228423,0.0005640226,0.0029447537,0.000028072262,0.000077833814],"category_scores_gemma":[0.000015356329,0.00012940947,0.00004411298,0.0010663909,0.0018475002,0.0009571849,0.0009273306,0.0001753832,0.000437899],"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.000010100434,0.00003044818,0.00034084154,0.0000051318552,0.0000035499293,0.000015936519,0.0002967082,0.0002456776,0.00070566277,0.96669513,0.000027291684,0.031623535],"study_design_scores_gemma":[0.00045303116,0.0006457948,0.0029269857,0.0000500241,0.0000030809338,0.000096497315,0.000011309377,0.5424533,0.007182347,0.44534674,0.00038984593,0.00044104495],"about_ca_topic_score_codex":0.000004234404,"about_ca_topic_score_gemma":4.930027e-7,"teacher_disagreement_score":0.57441413,"about_ca_system_score_codex":0.000045631023,"about_ca_system_score_gemma":0.00013320058,"threshold_uncertainty_score":0.68071914},"labels":[],"label_agreement":null},{"id":"W3026976675","doi":"10.1016/j.tcs.2020.10.029","title":"Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Binary number; Mathematics; Least-squares function approximation; Combinatorics; Arithmetic; Statistics; Materials science; Nanotechnology","score_opus":0.012494494510200358,"score_gpt":0.23389598394775504,"score_spread":0.2214014894375547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026976675","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.5470175,0.000046925543,0.4508206,0.00076469773,0.00075210835,0.00025643344,0.000015713813,0.00007988479,0.00024612757],"genre_scores_gemma":[0.9873385,0.000011411257,0.012010136,0.0004718461,0.0001383168,0.000007898013,0.000002621005,0.000016404898,0.0000029095493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970824,0.00030254747,0.0005283497,0.0009094272,0.00080288283,0.00037435722],"domain_scores_gemma":[0.9975585,0.00027023625,0.00043246397,0.0013429923,0.00023946204,0.00015639106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001405704,0.0002999398,0.00050929864,0.00015289494,0.00019219202,0.00025092377,0.0037758772,0.00014209,0.000024397386],"category_scores_gemma":[0.00014304297,0.00021317633,0.00015012565,0.00071267475,0.0033896328,0.0003229551,0.0061145164,0.0003741449,0.00000466877],"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.000014975513,0.000052557883,0.0005843972,0.00015876924,0.000014775067,0.000004310433,0.0020223043,0.00007187545,0.071098156,0.9223281,0.0000041864155,0.0036455512],"study_design_scores_gemma":[0.00029617813,0.0002980794,0.01859941,0.0008057198,0.000024809691,0.000017858802,0.000027544174,0.8195203,0.035465643,0.12438075,0.000108291395,0.00045540358],"about_ca_topic_score_codex":0.000018476034,"about_ca_topic_score_gemma":3.1406174e-7,"teacher_disagreement_score":0.8194484,"about_ca_system_score_codex":0.000031317093,"about_ca_system_score_gemma":0.00023767352,"threshold_uncertainty_score":0.9993226},"labels":[],"label_agreement":null},{"id":"W3027490412","doi":"10.1016/j.tcs.2020.05.010","title":"Local search is a PTAS for feedback vertex set in minor-free graphs","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Vertex (graph theory); Minor (academic); Robertson–Seymour theorem; Local search (optimization); Mathematics; Feedback vertex set; Set (abstract data type); Combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Graph; 1-planar graph; Chordal graph","score_opus":0.03530793057521974,"score_gpt":0.30885142335840005,"score_spread":0.2735434927831803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027490412","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.02567782,0.000049560353,0.9630397,0.009525991,0.0002133829,0.0005928382,0.000018227272,0.00017390626,0.00070859154],"genre_scores_gemma":[0.85061604,0.0000049657892,0.14605984,0.0032164995,0.000047229667,0.000029041626,0.0000013443425,0.000016766126,0.000008255058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507713,0.00024550938,0.00041427018,0.0015104767,0.0013410973,0.0014114897],"domain_scores_gemma":[0.9964742,0.00087992265,0.00004767931,0.0014773727,0.00031974757,0.0008010822],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023541371,0.000295031,0.00037764572,0.00039889736,0.00036661793,0.0004340378,0.007831434,0.000100543315,0.00006254457],"category_scores_gemma":[0.00036355856,0.0002615173,0.00015098907,0.004049372,0.0052928855,0.0009527629,0.0034414527,0.00054416247,0.00013607655],"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.000090573405,0.000054021264,0.00010058765,0.00003047059,0.000005039231,0.000028940358,0.0019782898,0.00046262826,0.00046799093,0.9624081,0.00051006087,0.03386325],"study_design_scores_gemma":[0.0006984916,0.00045541496,0.00026737398,0.00002085876,0.000001656152,0.000012141877,0.000035554374,0.5570766,0.0048941053,0.43615812,0.00015021408,0.000229519],"about_ca_topic_score_codex":0.0000057163506,"about_ca_topic_score_gemma":0.0000017439272,"teacher_disagreement_score":0.82493824,"about_ca_system_score_codex":0.000096308046,"about_ca_system_score_gemma":0.0002900135,"threshold_uncertainty_score":0.9999837},"labels":[],"label_agreement":null},{"id":"W3029537934","doi":"10.1016/j.tcs.2020.05.012","title":"Group sweep coverage with guaranteed approximation ratio","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Scalability; Computer science; Point of interest; Sweep frequency response analysis; Wireless sensor network; Mathematical optimization; Algorithm; Mathematics; Computer network; Electrical engineering; Engineering; Artificial intelligence; Database","score_opus":0.007776781844890055,"score_gpt":0.20037539231195914,"score_spread":0.19259861046706908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029537934","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.045385577,0.000012320309,0.9489452,0.0020976858,0.00024869552,0.00021342532,7.4937776e-7,0.00047387514,0.0026224551],"genre_scores_gemma":[0.7996579,0.0000017282708,0.19737904,0.0027789245,0.0001611581,0.0000064027204,0.0000015987424,0.000011042688,0.000002196112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969122,0.00012837375,0.0002977124,0.0009944987,0.0010450595,0.0006221906],"domain_scores_gemma":[0.99843115,0.00019261803,0.00010577901,0.0007296774,0.00016043628,0.0003803294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064599083,0.00024507297,0.0002503168,0.000106470194,0.0004105216,0.0007169343,0.002530554,0.000057595804,0.000041329968],"category_scores_gemma":[0.000051138057,0.0001867043,0.00005340886,0.0020855265,0.001703769,0.0008571916,0.0007313822,0.00026227,0.000076700046],"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.000023877088,0.000045753142,0.00003516897,0.0000073912297,0.000003902749,0.000022813918,0.00066295924,0.042823654,0.0012806685,0.9387928,0.000020888067,0.016280092],"study_design_scores_gemma":[0.00042879852,0.0004585367,0.00025240844,0.000025626914,0.000004242248,0.000026818874,0.0000048275583,0.98629487,0.0039174426,0.008206578,0.00009338411,0.00028645396],"about_ca_topic_score_codex":0.0000027520932,"about_ca_topic_score_gemma":4.2074998e-7,"teacher_disagreement_score":0.94347125,"about_ca_system_score_codex":0.000049474835,"about_ca_system_score_gemma":0.00008041907,"threshold_uncertainty_score":0.7613581},"labels":[],"label_agreement":null},{"id":"W3035317803","doi":"10.1016/j.tcs.2021.03.010","title":"The undirected repetition threshold and undirected pattern avoidance","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Infimum and supremum; Mathematics; Word (group theory); Repetition (rhetorical device); Binary number; Discrete mathematics; Arithmetic; Geometry; Philosophy","score_opus":0.008529589075174234,"score_gpt":0.23205111697758085,"score_spread":0.22352152790240662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035317803","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.13054152,0.0009122976,0.8607365,0.0028615452,0.0024828687,0.000326818,0.0000059800923,0.0006689974,0.0014634648],"genre_scores_gemma":[0.97123086,0.0002633526,0.027312567,0.00084512774,0.00025924738,0.000033353797,0.000008672402,0.000022113141,0.000024678506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953047,0.00038731276,0.00052440196,0.001836633,0.0010729694,0.000873986],"domain_scores_gemma":[0.99566835,0.0008270245,0.00024279545,0.0025271962,0.00040514168,0.00032946785],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0027910755,0.00045504264,0.00044481896,0.00016572318,0.0012692529,0.0039759194,0.004507182,0.00020750804,0.000023057331],"category_scores_gemma":[0.00020575833,0.00032550117,0.00013399542,0.0010452918,0.0043691425,0.00053027435,0.008626279,0.000965793,0.000019504592],"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.000005355882,0.00005017243,0.000080192105,0.000038535116,0.000019492029,0.000056291392,0.0005843302,0.00009546268,0.00052552804,0.8823906,0.00007736232,0.11607668],"study_design_scores_gemma":[0.00017364949,0.00007039734,0.004322759,0.00035568106,0.000015127407,0.000104580555,0.000020128675,0.71287566,0.0031168791,0.27828345,0.00012640812,0.00053527806],"about_ca_topic_score_codex":0.000018618053,"about_ca_topic_score_gemma":0.000009866201,"teacher_disagreement_score":0.84068936,"about_ca_system_score_codex":0.00012509774,"about_ca_system_score_gemma":0.00036614627,"threshold_uncertainty_score":0.9999197},"labels":[],"label_agreement":null},{"id":"W3037831187","doi":"10.1016/j.tcs.2022.08.001","title":"APX-hardness and approximation for the k-burning number problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; APX; Generalization; Approximation algorithm; Sequence (biology); Binary logarithm; Running time; Graph; Discrete mathematics; Physics; Algorithm; Chemistry","score_opus":0.008813310435495127,"score_gpt":0.2630747561018924,"score_spread":0.2542614456663973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037831187","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.018820617,0.000009073717,0.97773737,0.0004396328,0.000080114805,0.00028679773,0.0000031626546,0.000044192242,0.0025790164],"genre_scores_gemma":[0.95576906,2.401739e-7,0.04385037,0.0000823225,0.00013548408,0.00013209146,0.0000031938748,0.000005330569,0.000021902804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912757,0.000052545885,0.00012094718,0.00025039018,0.00023849783,0.00021003549],"domain_scores_gemma":[0.99946284,0.00017937204,0.00004883616,0.00021002362,0.00005513598,0.000043794225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072126,0.00007354993,0.00009402583,0.000029569275,0.0010544965,0.00015606551,0.00046043022,0.0000049879745,0.0002852372],"category_scores_gemma":[0.000003529924,0.000052032854,0.000043677846,0.00037904418,0.0006975546,0.00009167693,0.0005995848,0.00011692437,0.0000019705947],"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.000003951932,0.000018641347,0.00058722234,0.0000019060838,0.000005771524,5.7535082e-8,0.00020939914,0.00039785358,0.000045153876,0.93002224,0.00019833111,0.06850949],"study_design_scores_gemma":[0.0000722032,0.000028002243,0.00015418789,0.000002865112,0.0000124695625,0.0000018518347,0.000041682088,0.602345,0.00019362719,0.395326,0.0017521718,0.000069944406],"about_ca_topic_score_codex":0.000005342122,"about_ca_topic_score_gemma":6.054437e-8,"teacher_disagreement_score":0.9369485,"about_ca_system_score_codex":0.000018087963,"about_ca_system_score_gemma":0.000024464774,"threshold_uncertainty_score":0.81104416},"labels":[],"label_agreement":null},{"id":"W3040025217","doi":"10.1016/j.tcs.2021.02.023","title":"Squarefree words with interior disposable factors","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Word (group theory); Mathematics; Combinatorics; Ternary operation; Position (finance); Symbol (formal); Property (philosophy); Arithmetic; Computer science; Geometry; Philosophy; Business","score_opus":0.009752978889501072,"score_gpt":0.23538600739585205,"score_spread":0.22563302850635097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040025217","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.2867472,0.00008979507,0.7090728,0.00044325236,0.0015553724,0.00022526228,0.0000063566363,0.00046948827,0.001390434],"genre_scores_gemma":[0.8243224,0.000008816577,0.17501159,0.00041371436,0.00016678829,0.000018982437,0.000009946771,0.00002665314,0.000021094767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458206,0.00022162753,0.00049875,0.0021929615,0.0014107911,0.0010938116],"domain_scores_gemma":[0.9953134,0.0003401613,0.00021991432,0.0032432694,0.00034693404,0.00053630635],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001367174,0.0006437748,0.000710093,0.0003244456,0.00046571493,0.0034008273,0.008209666,0.00021402127,0.00014187484],"category_scores_gemma":[0.00008558446,0.00045516,0.00020699135,0.0013881742,0.0039644395,0.000989266,0.012352548,0.0009919025,0.000035073008],"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.000012697076,0.00010259442,0.00023526572,0.00006822743,0.000027726603,0.00016438533,0.0023402506,0.00039852934,0.00028429818,0.97552216,0.000044551165,0.020799285],"study_design_scores_gemma":[0.00046279133,0.00057644973,0.0030754318,0.0013438454,0.000041063682,0.00020048284,0.00018251309,0.7968337,0.011851989,0.18355161,0.00011985376,0.0017602834],"about_ca_topic_score_codex":0.000022431308,"about_ca_topic_score_gemma":0.0000065162094,"teacher_disagreement_score":0.7964352,"about_ca_system_score_codex":0.00018712951,"about_ca_system_score_gemma":0.00074367074,"threshold_uncertainty_score":0.99979},"labels":[],"label_agreement":null},{"id":"W3041213598","doi":"10.1016/j.tcs.2019.12.009","title":"Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Deutscher Akademischer Austauschdienst France","keywords":"Job shop scheduling; Combinatorics; Approximation algorithm; Bounded function; Mathematics; Intersection (aeronautics); Discrete mathematics; Conjecture; Minification; Algorithm; Computer science; Schedule; Mathematical optimization","score_opus":0.004419485381486819,"score_gpt":0.20785143527257327,"score_spread":0.20343194989108646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041213598","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.54789233,0.0000045910674,0.45102623,0.000041034487,0.00024850285,0.000092925016,0.0000017377862,0.00012548127,0.00056718546],"genre_scores_gemma":[0.9188509,0.0000019966756,0.08097493,0.00009867978,0.000038421807,0.0000014525236,0.000005602995,0.000013681669,0.000014362154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991091,0.000027191587,0.000119455806,0.00027003043,0.00026667464,0.00020757558],"domain_scores_gemma":[0.99960464,0.000048806276,0.000021278218,0.00017723069,0.00004880688,0.000099260964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012258285,0.00013462607,0.000113830014,0.00010159356,0.00011907703,0.00017335732,0.00015867375,0.00005397111,0.00010572786],"category_scores_gemma":[0.0000118240405,0.00010060705,0.0000128526435,0.0003366778,0.00032118912,0.00015687998,0.00003904801,0.00014074307,0.000015751652],"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.000067386194,0.000016318685,0.0032251163,0.000019633464,0.000020520632,0.0000029144146,0.0004177573,0.86023927,0.00061503384,0.1278151,0.000018300974,0.007542652],"study_design_scores_gemma":[0.00043617655,0.00017360876,0.005497274,0.000026537193,0.0000064470823,0.000013772209,0.000009640711,0.9878339,0.0007873288,0.005063816,0.000005944298,0.00014555907],"about_ca_topic_score_codex":0.0000018020027,"about_ca_topic_score_gemma":8.452004e-7,"teacher_disagreement_score":0.37095857,"about_ca_system_score_codex":0.000044855562,"about_ca_system_score_gemma":0.000013121712,"threshold_uncertainty_score":0.41026366},"labels":[],"label_agreement":null},{"id":"W3046970181","doi":"10.1016/j.tcs.2020.07.035","title":"Generating a Gray code for prefix normal words in amortized polylogarithmic time per word","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Prefix; Substring; Word (group theory); Amortized analysis; Gray code; Combinatorics; Prefix code; Mathematics; Arithmetic; Time complexity; Computer science; Discrete mathematics; Set (abstract data type); Algorithm; Data structure; Decoding methods; Linear code; Programming language; Linguistics","score_opus":0.013084670613608457,"score_gpt":0.2519275911630902,"score_spread":0.23884292054948175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046970181","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.042057414,0.000029711358,0.9540285,0.0027718765,0.00029176293,0.00037620257,0.000016085467,0.00020294121,0.00022554226],"genre_scores_gemma":[0.45877513,0.000001418803,0.5389462,0.001995129,0.00023672594,0.00002363261,0.0000042909846,0.000009805843,0.000007679361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970227,0.00010989129,0.0004337919,0.0010340537,0.00062314793,0.00077641284],"domain_scores_gemma":[0.9983882,0.00024855405,0.00009504976,0.00063049176,0.00012701785,0.00051069417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011141793,0.00024357752,0.00032794336,0.00014790359,0.000392078,0.0005915668,0.0028035808,0.00007049616,0.000056436897],"category_scores_gemma":[0.00020483683,0.0001965766,0.00008485031,0.001047915,0.0008837681,0.0010160978,0.0018174637,0.00026695343,0.00007842641],"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.0001201504,0.00017501686,0.00018559351,0.00003367738,0.000009356464,0.00003985523,0.0029378873,0.005535146,0.021726228,0.7960229,0.0008117808,0.1724024],"study_design_scores_gemma":[0.0006579191,0.00022961022,0.00024774027,0.000031820935,0.0000032466776,0.0000141980345,0.000004770235,0.98735064,0.0019153224,0.008758591,0.000505214,0.00028095313],"about_ca_topic_score_codex":0.0000047800845,"about_ca_topic_score_gemma":0.0000014869353,"teacher_disagreement_score":0.98181546,"about_ca_system_score_codex":0.000052245654,"about_ca_system_score_gemma":0.00022555291,"threshold_uncertainty_score":0.8016161},"labels":[],"label_agreement":null},{"id":"W3047376977","doi":"10.1016/j.tcs.2020.07.042","title":"Exact algorithms for the repetition-bounded longest common subsequence problem","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Hong Kong Polytechnic University","keywords":"Subsequence; Longest common subsequence problem; Algorithm; Combinatorics; Longest increasing subsequence; Bounded function; Sequence (biology); Constraint (computer-aided design); Upper and lower bounds; Symbol (formal); Mathematics; Function (biology); Exponential time hypothesis; Exponential function; Time complexity; Discrete mathematics; Computer science","score_opus":0.0279039761775633,"score_gpt":0.2783191148854392,"score_spread":0.2504151387078759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047376977","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.0010187498,0.000092729555,0.98095137,0.015875127,0.00052175584,0.0005988298,0.000014814953,0.00031058167,0.00061603484],"genre_scores_gemma":[0.5773306,0.000016367438,0.4192583,0.0029296773,0.00039507408,0.000047396657,0.000004974104,0.000011620526,0.00000602374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996866,0.000104625746,0.00038334003,0.0010764737,0.0008773189,0.00069224107],"domain_scores_gemma":[0.9970778,0.0008830001,0.0001290372,0.0012076816,0.00027860817,0.0004238782],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014435108,0.00025447883,0.00026349595,0.0000645697,0.0012187735,0.0011582094,0.005099915,0.00006225645,0.00003412434],"category_scores_gemma":[0.00013167456,0.0001629438,0.00010773804,0.001191867,0.00247104,0.0011782458,0.0017672518,0.00029383056,0.00006252133],"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.000013285611,0.000036666257,0.000019768375,0.000013401527,0.0000048572933,0.000010207212,0.00037820695,0.00026574775,0.00032499165,0.91645694,0.0003789383,0.08209702],"study_design_scores_gemma":[0.000270773,0.00035244715,0.00034559413,0.00003273466,0.0000075664598,0.000036547965,0.000008619735,0.8713386,0.00221236,0.12273326,0.0024098435,0.00025162406],"about_ca_topic_score_codex":0.000013836562,"about_ca_topic_score_gemma":0.0000011299414,"teacher_disagreement_score":0.8710729,"about_ca_system_score_codex":0.00005699982,"about_ca_system_score_gemma":0.00019867157,"threshold_uncertainty_score":0.9998787},"labels":[],"label_agreement":null},{"id":"W3084213112","doi":"10.1016/j.tcs.2006.06.012","title":"Preface","year":2006,"lang":"en","type":"article","venue":"Theoretical 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":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","score_opus":0.006194485593333101,"score_gpt":0.2398046339403179,"score_spread":0.2336101483469848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084213112","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.47793725,0.000015768606,0.43172243,0.00031234138,0.00030302224,0.00014412076,0.0000039860674,0.00046916358,0.0890919],"genre_scores_gemma":[0.95763266,9.249032e-8,0.041962147,0.00014053,0.00020584174,0.000002587956,7.8308295e-7,0.000015620524,0.000039741673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980155,0.00005826527,0.00016538952,0.00047754275,0.0007153676,0.00056789274],"domain_scores_gemma":[0.9990956,0.00009850201,0.000032210683,0.000497776,0.000122060854,0.00015381738],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011314309,0.00012204718,0.00011390966,0.00011740953,0.00027723535,0.00021053154,0.0010089128,0.00002625159,0.0002522055],"category_scores_gemma":[0.000041216324,0.00009650001,0.000036414338,0.0010794981,0.0066919196,0.00028714287,0.00040906138,0.00011478225,0.00444935],"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.0000065436666,0.00004912694,0.00019291531,0.0000012536548,5.2412196e-7,0.0000051959023,0.000030124178,0.0003283397,0.007782425,0.9893493,0.00055443234,0.0016997966],"study_design_scores_gemma":[0.00029716743,0.00012557667,0.015682258,0.000015632726,0.000006191561,0.000048384827,0.0000022445497,0.27329916,0.03723003,0.6716021,0.0013688869,0.00032239535],"about_ca_topic_score_codex":0.000008520885,"about_ca_topic_score_gemma":8.050175e-7,"teacher_disagreement_score":0.47969538,"about_ca_system_score_codex":0.000069890295,"about_ca_system_score_gemma":0.00006399101,"threshold_uncertainty_score":0.9963258},"labels":[],"label_agreement":null},{"id":"W3100079455","doi":"10.1016/j.tcs.2020.11.019","title":"Maximal unbordered factors of random strings","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Horizon 2020 Framework Programme; Israel Science Foundation; Danmarks Frie Forskningsfond; United States-Israel Binational Science Foundation","keywords":"Combinatorics; String (physics); Mathematics; Conjecture; Suffix; Prefix; Alphabet; Unary operation; Discrete mathematics","score_opus":0.014780486485901885,"score_gpt":0.23757626745817365,"score_spread":0.22279578097227176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100079455","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.0776173,0.000021614309,0.9203515,0.00090548873,0.00024770678,0.0001175421,0.0000053131516,0.00014101343,0.000592499],"genre_scores_gemma":[0.84496164,0.0000025901836,0.154654,0.0003104368,0.000063329906,0.0000010871621,0.0000012126707,0.0000045847046,0.0000011031362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997858,0.00006719463,0.00030405162,0.00063023425,0.0007427757,0.0003977416],"domain_scores_gemma":[0.99856204,0.00021712438,0.00009627057,0.0005947223,0.000155529,0.00037429528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004942152,0.00016481655,0.00027643942,0.00008653905,0.00020204241,0.00021213785,0.0030125796,0.000040667623,0.000052778025],"category_scores_gemma":[0.00013117139,0.00012012963,0.00007390254,0.0011049795,0.0014418025,0.00078185997,0.0019018368,0.0001631384,0.000022187263],"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.000027554997,0.00004315382,0.00015026814,0.000011105705,0.000003867733,0.000006857972,0.00077461556,0.00015593215,0.0021776932,0.961908,0.000078716665,0.03466227],"study_design_scores_gemma":[0.00075797027,0.0003223845,0.0021855016,0.000024916244,0.0000043422506,0.0000058533165,0.000012242455,0.9424621,0.027504187,0.026180932,0.00030769737,0.00023188145],"about_ca_topic_score_codex":0.0000053433696,"about_ca_topic_score_gemma":4.2146436e-8,"teacher_disagreement_score":0.94230616,"about_ca_system_score_codex":0.000015292177,"about_ca_system_score_gemma":0.00010834561,"threshold_uncertainty_score":0.55981725},"labels":[],"label_agreement":null},{"id":"W3101685628","doi":"10.1016/j.tcs.2020.11.018","title":"Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Sequence (biology); Combinatorics; Mathematics; Representation (politics); Construct (python library); Greedy algorithm; Simple (philosophy); Discrete mathematics; Algorithm; Computer science","score_opus":0.02492197415689523,"score_gpt":0.2510284939185019,"score_spread":0.22610651976160667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101685628","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.09373164,0.000065285094,0.8896894,0.013427279,0.00016451368,0.0001653971,0.000002201453,0.00028157138,0.0024727206],"genre_scores_gemma":[0.909018,0.000009991637,0.08735502,0.0033664622,0.00023463761,0.0000070769515,2.2989502e-7,0.000006036785,0.000002567092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978104,0.00026557548,0.00024173797,0.0007242033,0.00041724285,0.00054081413],"domain_scores_gemma":[0.9982726,0.0005176141,0.00007427129,0.0006248268,0.00011555767,0.00039513232],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014818609,0.00018271532,0.00018665314,0.000101105536,0.0009717121,0.00083983573,0.0022636363,0.000036977155,0.000024166691],"category_scores_gemma":[0.00015049409,0.00013048272,0.0000687674,0.0019013443,0.0036155882,0.0006341774,0.0013586734,0.0003395774,0.000021053598],"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.00000631828,0.0000051809834,0.0004366649,0.0000104284245,0.0000046104306,0.0000043526816,0.0014582747,0.00004958052,0.0017334456,0.93210435,0.000012043873,0.06417474],"study_design_scores_gemma":[0.00019304777,0.00017136685,0.0027793678,0.000067311594,0.000016651367,0.00021508787,0.00004025033,0.52013165,0.0030886019,0.47247556,0.00050256646,0.00031856884],"about_ca_topic_score_codex":0.0000033922981,"about_ca_topic_score_gemma":5.035159e-7,"teacher_disagreement_score":0.81528634,"about_ca_system_score_codex":0.000027281245,"about_ca_system_score_gemma":0.00011296318,"threshold_uncertainty_score":0.999096},"labels":[],"label_agreement":null},{"id":"W3108864434","doi":"10.1016/j.tcs.2020.11.022","title":"Automedian sets of permutations: direct sum and shuffle","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Combinatorics; Mathematics; Set (abstract data type); Separable space; Permutation (music); Function (biology); Discrete mathematics; Computer science","score_opus":0.015218746994989584,"score_gpt":0.27381356770253873,"score_spread":0.25859482070754913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108864434","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.01175486,0.00007162812,0.9799008,0.0045233886,0.00016789,0.000106691325,0.0000024948802,0.000114035756,0.0033582507],"genre_scores_gemma":[0.5732601,0.000004676443,0.42594156,0.0007563156,0.000031395586,0.0000016081575,1.7231667e-7,0.0000028651746,0.000001305761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998418,0.00011796491,0.0002137637,0.0005447344,0.00040235135,0.0003031929],"domain_scores_gemma":[0.99885535,0.00023998845,0.00005390085,0.00036451427,0.000114778835,0.00037144174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481828,0.00012138779,0.0002147489,0.00009040855,0.0001570887,0.00016427352,0.0011570252,0.00003742451,0.000012048441],"category_scores_gemma":[0.00014622558,0.00009716359,0.000040297895,0.0009050323,0.0018362614,0.00044034058,0.0006699509,0.00012229958,0.000008597983],"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.0000023504742,0.000013979944,0.000036986992,0.000011666851,0.000001921698,0.0000052107926,0.0016609749,0.00001082611,0.001016743,0.9160365,0.00003378832,0.08116908],"study_design_scores_gemma":[0.00015382358,0.00019423902,0.00097236264,0.000017412616,0.000004553381,0.000015478265,0.0000045434954,0.77742404,0.0054231854,0.21555646,0.00008430645,0.00014958343],"about_ca_topic_score_codex":0.0000017249323,"about_ca_topic_score_gemma":1.5382305e-7,"teacher_disagreement_score":0.77741325,"about_ca_system_score_codex":0.000011021364,"about_ca_system_score_gemma":0.0001099795,"threshold_uncertainty_score":0.6765781},"labels":[],"label_agreement":null},{"id":"W3116363031","doi":"10.1016/j.tcs.2020.12.028","title":"Decision problems and projection languages for restricted variants of two-dimensional automata","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Deterministic automaton; Decidability; Mathematics; Nondeterministic algorithm; Discrete mathematics; Deterministic finite automaton; Büchi automaton; Decision problem; Regular language; Combinatorics; Two-way deterministic finite automaton; Quantum finite automata; Unary operation; Equivalence (formal languages); Deterministic pushdown automaton; Automata theory; Automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","score_opus":0.017174068509438905,"score_gpt":0.27142118068754834,"score_spread":0.2542471121781094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116363031","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.17733045,0.000033003347,0.8210356,0.000839084,0.0001665128,0.00028382675,0.000004827542,0.00017405329,0.00013262009],"genre_scores_gemma":[0.6985068,0.0000014822282,0.30110422,0.00031935892,0.000055413166,0.000006174142,9.471077e-7,0.0000046238965,0.0000010038156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831074,0.000060988892,0.00026787922,0.0006039384,0.00046237552,0.00029404508],"domain_scores_gemma":[0.99869245,0.0004978701,0.000091653914,0.00037173138,0.00015894407,0.00018736994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843555,0.00012992069,0.00019544717,0.00011525091,0.00019542282,0.00017151392,0.001032472,0.00003825768,0.0000065261843],"category_scores_gemma":[0.00023368052,0.000099468,0.000038779337,0.00088637415,0.0008304547,0.000499107,0.0008087315,0.00008825136,0.0000046473147],"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.000026458816,0.000045873323,0.000029242303,0.000024939038,0.0000037912855,0.0000033996787,0.00051029987,0.00035966997,0.012381679,0.90681165,0.0000552237,0.07974777],"study_design_scores_gemma":[0.00054701563,0.00040985615,0.0015665445,0.000048770027,0.000004467049,0.00002627039,0.0000046578984,0.8713595,0.0040660943,0.121829435,0.000017438333,0.000119925535],"about_ca_topic_score_codex":0.000004380968,"about_ca_topic_score_gemma":2.393876e-7,"teacher_disagreement_score":0.8709999,"about_ca_system_score_codex":0.000014366886,"about_ca_system_score_gemma":0.00008272311,"threshold_uncertainty_score":0.40561876},"labels":[],"label_agreement":null},{"id":"W3120172643","doi":"10.1016/j.tcs.2021.01.018","title":"Ostrowski-automatic sequences: Theory and applications","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"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":"Conjecture; Enumeration; Computation; Computer science; Algebra over a field; Order (exchange); Mathematics; Automated theorem proving; Theoretical computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.007005801093417205,"score_gpt":0.2402572451134385,"score_spread":0.2332514440200213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120172643","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.018355954,0.00025031908,0.9759145,0.00074299506,0.00021230707,0.00014752497,0.0000020507812,0.00036799491,0.004006388],"genre_scores_gemma":[0.84457433,0.000016467697,0.15397058,0.0012776807,0.00010499777,0.000025366135,0.00000121754,0.000007061601,0.000022273614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759936,0.00026661385,0.00027561633,0.00084047316,0.0005138434,0.00050407666],"domain_scores_gemma":[0.99757326,0.0007949202,0.000063238025,0.0010932584,0.00017973209,0.0002955946],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022865492,0.00018022516,0.00020711952,0.000118230215,0.0005256088,0.0007263491,0.001767229,0.00004934162,0.00010650574],"category_scores_gemma":[0.00013212109,0.00014942318,0.000052145722,0.0012819353,0.0030044948,0.0007249277,0.0013859421,0.00016733691,0.00008766995],"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":[8.8627763e-7,0.000032164415,0.00003181813,0.000010284709,0.0000037154193,0.000019203771,0.00020461765,0.000010072927,0.0012422662,0.87016344,0.000009965355,0.1282716],"study_design_scores_gemma":[0.00012235911,0.000043666507,0.00049984216,0.000028288596,0.000005211296,0.0002608514,0.000033187673,0.18622495,0.006744666,0.8055239,0.0003117723,0.00020130753],"about_ca_topic_score_codex":9.901703e-7,"about_ca_topic_score_gemma":3.3127665e-7,"teacher_disagreement_score":0.8262184,"about_ca_system_score_codex":0.00003634761,"about_ca_system_score_gemma":0.0002423076,"threshold_uncertainty_score":0.9997088},"labels":[],"label_agreement":null},{"id":"W3128085259","doi":"10.1016/j.tcs.2021.02.003","title":"Improved hardness and approximation results for single allocation hub location problems","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Hardness of approximation; Mathematics; Clique; Graph; Node (physics); Metric (unit); Approximation algorithm; Discrete mathematics; Integer (computer science); Computer science; Physics","score_opus":0.01807884128422667,"score_gpt":0.25378342178509666,"score_spread":0.23570458050086998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128085259","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.0098859975,0.00003268959,0.98836225,0.0003010082,0.0003680936,0.00024145731,0.0000026406165,0.00019468424,0.000611199],"genre_scores_gemma":[0.6157376,0.000002549767,0.38414413,0.00003149205,0.0000458711,0.000013467853,0.000010405321,0.000007832486,0.0000066406587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905133,0.00004848806,0.00022135087,0.0003187029,0.00015642689,0.0002037199],"domain_scores_gemma":[0.9991394,0.00012406059,0.00003333848,0.00024197107,0.0003846115,0.00007661068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012463848,0.00008809235,0.00009853177,0.00005808325,0.00014822539,0.00019441164,0.00014586537,0.000044505974,0.0000019343152],"category_scores_gemma":[0.0004065211,0.00008817539,0.00001437887,0.0005525851,0.00035869295,0.0002598328,0.00006688084,0.000060372135,0.0000014769593],"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.000020752856,0.00006926892,0.000010442979,0.00025883535,0.000008481464,5.22551e-7,0.0013756286,0.29496405,0.18475656,0.4115341,0.000043122047,0.10695822],"study_design_scores_gemma":[0.0002792062,0.00004301296,0.00008562734,0.00003337714,0.000005357619,0.000008470117,0.000010524987,0.91167575,0.08038287,0.0073351474,0.000036212146,0.00010447307],"about_ca_topic_score_codex":3.8166863e-7,"about_ca_topic_score_gemma":3.3387195e-7,"teacher_disagreement_score":0.6167117,"about_ca_system_score_codex":0.00005527561,"about_ca_system_score_gemma":0.000040550043,"threshold_uncertainty_score":0.3595688},"labels":[],"label_agreement":null},{"id":"W3171062666","doi":"10.1016/j.tcs.2022.11.020","title":"Colouring graphs with no induced six-vertex path or diamond","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Tianjin City; Nankai University; KU Leuven; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Diamond; Perfect graph; Vertex (graph theory); Perfect graph theorem; Discrete mathematics; Graph; Line graph; Pathwidth; Chemistry","score_opus":0.01722655445675764,"score_gpt":0.27155464520713374,"score_spread":0.2543280907503761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171062666","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.31206688,0.000019016332,0.6822845,0.0005115857,0.00071778,0.00048259855,0.000004841234,0.00039714196,0.0035156612],"genre_scores_gemma":[0.9131063,0.0000022720765,0.08615375,0.0005485926,0.000040161263,0.0000733603,7.574934e-7,0.000019841085,0.000054936692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947259,0.0004095895,0.00030414938,0.001283111,0.002072853,0.0012044115],"domain_scores_gemma":[0.9969262,0.0006884448,0.00010273838,0.001480779,0.00029814395,0.0005037302],"candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0024893624,0.0002921355,0.0003089166,0.00047305407,0.001844874,0.00047154952,0.0058445456,0.00003697693,0.00026564617],"category_scores_gemma":[0.00014921947,0.00021027001,0.00007637914,0.0044451947,0.0028565656,0.0009900132,0.0048510144,0.0007352374,0.00007967327],"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.00014289406,0.00012894686,0.00022157347,0.0000073906317,0.0000078961075,0.00015195369,0.00047082274,0.00042031906,0.0019239916,0.9840581,0.000044472457,0.012421667],"study_design_scores_gemma":[0.0012969733,0.0049174074,0.0021475768,0.00004808035,0.000008494659,0.00045284734,0.00006982514,0.47076768,0.00547138,0.51328766,0.00058665255,0.00094543485],"about_ca_topic_score_codex":0.00000428712,"about_ca_topic_score_gemma":0.0000019574436,"teacher_disagreement_score":0.6010394,"about_ca_system_score_codex":0.0001701707,"about_ca_system_score_gemma":0.0004356294,"threshold_uncertainty_score":0.99985707},"labels":[],"label_agreement":null},{"id":"W3177770101","doi":"10.1016/j.tcs.2021.06.038","title":"On synchronization and orientation in distributed barrier coverage with relocatable sensors","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orientation (vector space); Asynchronous communication; Visibility; Synchronization (alternating current); Position (finance); Range (aeronautics); Cover (algebra); Computer science; Focus (optics); Algorithm; Mathematics; Geometry; Telecommunications; Physics; Engineering; Aerospace engineering; Channel (broadcasting)","score_opus":0.00543839597750751,"score_gpt":0.23059370979311655,"score_spread":0.22515531381560905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177770101","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.060955565,0.0000073139827,0.93705124,0.0007745417,0.00009002495,0.00011562123,0.0000023883256,0.00005939152,0.00094390387],"genre_scores_gemma":[0.9417108,0.000010112149,0.05783975,0.0003964075,0.000011543787,0.0000041742833,0.0000088307015,0.0000043426703,0.000014007271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984143,0.000101593534,0.000153832,0.00055148127,0.00047286972,0.00030592436],"domain_scores_gemma":[0.9990475,0.0001508937,0.000031958913,0.0003726741,0.00023321166,0.00016375522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000549716,0.00010147152,0.000110752204,0.00012117121,0.0002145394,0.00044012858,0.00036051287,0.000030184452,0.00004472014],"category_scores_gemma":[0.00011340712,0.000082121995,0.000009867564,0.0016985307,0.0006551655,0.0006439312,0.00027468035,0.00012897824,0.00001152817],"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.000008728078,0.000040941944,0.00038754358,0.0000057084258,0.0000011453722,0.000031759933,0.0002953508,0.03942591,0.00006742343,0.9557463,0.000012846823,0.003976347],"study_design_scores_gemma":[0.00044039908,0.00016113429,0.0018215074,0.000042898937,0.000001100032,0.000025355175,0.00000904564,0.949715,0.0020724195,0.04556113,0.000022512168,0.00012750909],"about_ca_topic_score_codex":0.0000021613791,"about_ca_topic_score_gemma":0.0000019427002,"teacher_disagreement_score":0.9102891,"about_ca_system_score_codex":0.000073608484,"about_ca_system_score_gemma":0.0001985844,"threshold_uncertainty_score":0.424417},"labels":[],"label_agreement":null},{"id":"W3188608413","doi":"10.1016/j.tcs.2021.07.038","title":"One-visibility cops and robber on trees","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visibility; Computer science; Tree (set theory); Variation (astronomy); Mathematics; Theoretical computer science; Combinatorics; Geography","score_opus":0.027342755584197152,"score_gpt":0.2922411713208605,"score_spread":0.2648984157366634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188608413","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.17404257,0.000041682153,0.8165608,0.0029319813,0.00047987635,0.000094955605,9.519877e-7,0.00016511387,0.005682085],"genre_scores_gemma":[0.8869108,0.000007912627,0.11161398,0.0013426119,0.00009293426,0.0000032643543,2.6449658e-7,0.0000053980784,0.000022837507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721086,0.00016151469,0.00028489795,0.001079648,0.0007362115,0.0005268711],"domain_scores_gemma":[0.99761486,0.0005832777,0.000047086127,0.0011675941,0.00028288606,0.00030432153],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001199065,0.00016770263,0.00021794817,0.000100977806,0.00038486978,0.00070280005,0.0015525297,0.000055456094,0.00008341425],"category_scores_gemma":[0.000351746,0.00015024125,0.000053373547,0.001013089,0.0033948913,0.00058507564,0.0014331446,0.00022472064,0.00016016903],"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.000004208956,0.00009043957,0.00016648814,0.0000028777838,0.000002318215,0.000016965469,0.0003700771,0.00010208425,0.0010622751,0.8732513,0.000023681614,0.124907285],"study_design_scores_gemma":[0.00007588484,0.00024079497,0.007146155,0.0000428116,0.0000037647085,0.00003458333,0.000019398874,0.3458904,0.07934321,0.5667535,0.00017157753,0.00027790244],"about_ca_topic_score_codex":0.000003972682,"about_ca_topic_score_gemma":0.000003958435,"teacher_disagreement_score":0.7128682,"about_ca_system_score_codex":0.000055661174,"about_ca_system_score_gemma":0.00017232126,"threshold_uncertainty_score":0.9993173},"labels":[],"label_agreement":null},{"id":"W3196411836","doi":"10.1016/j.tcs.2022.03.013","title":"Positive planar satisfiability problems under 3-connectivity constraints","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Bangladesh University of Engineering and Technology","keywords":"Combinatorics; Mathematics; Planar graph; Planarity testing; Satisfiability; Discrete mathematics; Planar; Matching (statistics); Graph; Time complexity; Computer science","score_opus":0.009563311863093891,"score_gpt":0.2284865948402183,"score_spread":0.2189232829771244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196411836","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.14205226,0.000017983926,0.8513893,0.0018977924,0.0006642787,0.00029349627,0.000020672811,0.0003381548,0.003326042],"genre_scores_gemma":[0.96142364,6.3915763e-7,0.036674023,0.0018006669,0.000055121036,0.00002960188,0.0000023798698,0.00000847654,0.0000054365087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962586,0.00051696145,0.00030205384,0.0011177107,0.001065964,0.0007387197],"domain_scores_gemma":[0.99767786,0.0007569758,0.00010023081,0.0010655643,0.00011521696,0.00028416328],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0037477922,0.00022699941,0.00026479102,0.00017774841,0.0013825173,0.0003731575,0.0031039456,0.000035326262,0.00031918875],"category_scores_gemma":[0.00007407601,0.0002037538,0.000092537455,0.0013532158,0.004814401,0.00066985894,0.0022753545,0.00042532446,0.000042492007],"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.000006671807,0.00013656818,0.0001338778,0.0000041395047,0.000006285751,0.000017225442,0.00067120476,0.0008881727,0.0009854828,0.96594965,0.00004122612,0.031159462],"study_design_scores_gemma":[0.00025782196,0.00032144415,0.0066647525,0.000009969093,0.000003696356,0.00018840234,0.000046378795,0.2898913,0.0013198872,0.70095474,0.000041284227,0.0003003444],"about_ca_topic_score_codex":0.00001511294,"about_ca_topic_score_gemma":9.951813e-7,"teacher_disagreement_score":0.8193714,"about_ca_system_score_codex":0.00024068938,"about_ca_system_score_gemma":0.0002662609,"threshold_uncertainty_score":0.99991757},"labels":[],"label_agreement":null},{"id":"W3201276541","doi":"10.1016/j.tcs.2021.08.025","title":"Symmetric PMC model of diagnosis, b-matchings in graphs and fault identification in t-diagnosable systems","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Bipartite graph; Hypercube; Matching (statistics); Combinatorics; Algorithm; Graph theory; Computer science; Identification (biology); Mathematics; Graph; Discrete mathematics; Statistics","score_opus":0.013057115727586714,"score_gpt":0.24194940384525296,"score_spread":0.22889228811766624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201276541","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.44583946,0.00033404908,0.55255073,0.00023448454,0.00051225006,0.00014676365,0.0000012860638,0.000031107484,0.0003498403],"genre_scores_gemma":[0.9912047,0.00009995434,0.0085585555,0.00006602825,0.000019151556,0.000035631365,4.9258966e-7,0.0000049306136,0.000010601485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997685,0.00019781322,0.0005924708,0.0006629655,0.0004920084,0.0003697056],"domain_scores_gemma":[0.998545,0.00045654102,0.00011930838,0.00052730646,0.00023979091,0.00011205047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022709956,0.00013198388,0.00029925033,0.00056136743,0.00010208302,0.00040749175,0.0008973961,0.0000669657,0.0000024828473],"category_scores_gemma":[0.00016911351,0.00012065858,0.00004190904,0.0029551012,0.00052024797,0.000726381,0.00047630788,0.0001786764,0.0000042526276],"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.000001751154,0.00008372178,0.0035822287,0.000033162494,0.000001623444,0.000012288206,0.0006005757,0.023955446,0.00042424895,0.96702534,0.000014515734,0.00426509],"study_design_scores_gemma":[0.00019129876,0.00004405281,0.0024749623,0.00017957685,0.000001457641,0.00003074844,0.000038686085,0.9020434,0.0024810648,0.09238306,0.000004047038,0.00012765753],"about_ca_topic_score_codex":0.00006801285,"about_ca_topic_score_gemma":0.000012618036,"teacher_disagreement_score":0.87808794,"about_ca_system_score_codex":0.000067171284,"about_ca_system_score_gemma":0.000101108,"threshold_uncertainty_score":0.49203143},"labels":[],"label_agreement":null},{"id":"W320810298","doi":"10.1016/j.tcs.2015.04.035","title":"Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamwidth; Omnidirectional antenna; Antenna (radio); Orientation (vector space); Computer science; Directional antenna; Algorithm; Mathematics; Telecommunications; Geometry","score_opus":0.013291151686099257,"score_gpt":0.2316010301662544,"score_spread":0.21830987848015515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W320810298","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.39644745,0.000027846443,0.6021266,0.0005198843,0.0003153622,0.00016787458,0.0000010911358,0.00011979807,0.0002740825],"genre_scores_gemma":[0.95741224,0.0000059957883,0.042096596,0.00029866255,0.00015964657,0.000011940533,5.5963017e-7,0.000011310784,0.000003031901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699694,0.00022549408,0.00026379107,0.0010131965,0.0007576913,0.00074289466],"domain_scores_gemma":[0.99813974,0.0004808903,0.00007645991,0.00062389084,0.00013112836,0.0005478823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012391097,0.0002622572,0.00032864293,0.0001574666,0.00019696742,0.00044390312,0.0011902688,0.00009047477,0.000010046864],"category_scores_gemma":[0.000046506488,0.00020168457,0.00003136032,0.0014665693,0.00255028,0.0008427685,0.00069695606,0.0004192594,0.000005076213],"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.00006987541,0.00016452318,0.013466007,0.000006817903,0.000009030623,0.00010402548,0.00089997065,0.006222201,0.0001206658,0.8969265,0.000037108868,0.08197326],"study_design_scores_gemma":[0.00057590904,0.00034879183,0.037473574,0.00004434197,0.0000024717187,0.00016571379,0.000014362519,0.9532989,0.00025940654,0.007498534,0.000018608065,0.00029934788],"about_ca_topic_score_codex":0.000017309354,"about_ca_topic_score_gemma":0.00001861186,"teacher_disagreement_score":0.94707674,"about_ca_system_score_codex":0.00012408427,"about_ca_system_score_gemma":0.0002025377,"threshold_uncertainty_score":0.9396613},"labels":[],"label_agreement":null},{"id":"W4205114821","doi":"10.1016/j.tcs.2019.10.009","title":"Preface","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004675915981703264,"score_gpt":0.21808375355248175,"score_spread":0.21340783757077847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205114821","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.15429685,0.000021259837,0.8260482,0.00069900195,0.0009190578,0.00014429678,4.338893e-7,0.0003808032,0.017490115],"genre_scores_gemma":[0.8883473,0.000001490109,0.11053824,0.00097483955,0.00006594518,0.0000026390508,2.1266239e-7,0.0000059309837,0.00006338533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978081,0.00006470544,0.00018634829,0.0007340271,0.00064082775,0.0005659646],"domain_scores_gemma":[0.9981966,0.0001862813,0.000045763933,0.0012594245,0.00009225753,0.0002196852],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012593581,0.00015170491,0.00016908029,0.0001324121,0.00018956332,0.0004649372,0.0035739178,0.000039418457,0.0002047538],"category_scores_gemma":[0.000029087554,0.00011767247,0.00005835485,0.0009881414,0.0011250916,0.0009618804,0.0014583409,0.00015438505,0.0016297896],"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.0000019226325,0.000024918822,0.00009377165,0.0000037798238,0.0000015092417,0.000003931615,0.00017039428,0.00006510972,0.0018838369,0.96700835,0.000048915383,0.03069355],"study_design_scores_gemma":[0.00018559165,0.00015319635,0.0014192166,0.000020080059,0.0000012826495,0.000039743056,0.000004503354,0.66770184,0.008459629,0.32116842,0.0006146948,0.00023175891],"about_ca_topic_score_codex":0.0000011895049,"about_ca_topic_score_gemma":4.55351e-8,"teacher_disagreement_score":0.73405045,"about_ca_system_score_codex":0.000039919636,"about_ca_system_score_gemma":0.0000921101,"threshold_uncertainty_score":0.99914753},"labels":[],"label_agreement":null},{"id":"W4205118740","doi":"10.1016/s0304-3975(04)00130-6","title":"Deletion along trajectories*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Decidability; Closure (psychology); Regular language; Mathematical proof; Formal language; Mathematics; Inverse; Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Algorithm; Automaton","score_opus":0.007638670920687556,"score_gpt":0.24085453925113437,"score_spread":0.2332158683304468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205118740","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.67574936,0.00002273127,0.32239878,0.00016646489,0.00019995372,0.000051387164,6.178935e-7,0.000025872194,0.0013848119],"genre_scores_gemma":[0.9813472,0.000003888548,0.017758394,0.0005157882,0.00035873582,0.0000018234582,0.000005396192,0.0000046864757,0.000004080033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989127,0.000030099569,0.00013240513,0.00040918367,0.00018927427,0.00032636052],"domain_scores_gemma":[0.9995177,0.000013599808,0.000025860896,0.00023476097,0.000083215324,0.00012488641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004774777,0.000103885825,0.000085022555,0.000028809922,0.00021738536,0.00006346939,0.00044078263,0.00006430039,0.0000119925735],"category_scores_gemma":[0.000080222446,0.000076555676,0.000049432187,0.00023821417,0.0014244936,0.000005438652,0.00028813694,0.000078965284,0.000022651462],"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.000029250576,0.000060815422,0.0005080824,0.0000031932473,0.0000041774397,0.000005825521,0.000038544695,0.0005751055,0.23847781,0.743454,0.000016530974,0.016826667],"study_design_scores_gemma":[0.0011746021,0.0025251391,0.016235324,0.000042676576,0.000012969166,0.00015576743,0.000021895814,0.0050503737,0.79182595,0.1802086,0.0019759273,0.00077080366],"about_ca_topic_score_codex":0.0000035205674,"about_ca_topic_score_gemma":0.000001007861,"teacher_disagreement_score":0.5632454,"about_ca_system_score_codex":0.000018315455,"about_ca_system_score_gemma":0.000066592285,"threshold_uncertainty_score":0.5248606},"labels":[],"label_agreement":null},{"id":"W4205165567","doi":"10.1016/s0304-3975(03)00604-2","title":"Metrics for labelled Markov processes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Markov process; Metric (unit); Equivalence (formal languages); Markov chain; Property (philosophy); Markov property; Stochastic process; Discrete mathematics; Markov model; Statistics","score_opus":0.021845036099777202,"score_gpt":0.30266108810126563,"score_spread":0.2808160520014884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205165567","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.0042516734,0.00004343195,0.99184537,0.0008699086,0.00073302735,0.00036518474,0.0000016422408,0.00027552425,0.0016142679],"genre_scores_gemma":[0.39681053,0.0000044404132,0.6027512,0.0003360686,0.000064952335,0.000022326354,3.8397795e-7,0.000005231704,0.000004851079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776864,0.000051919542,0.00027818765,0.0006930351,0.00064909586,0.0005591378],"domain_scores_gemma":[0.9979407,0.00037323972,0.000088495704,0.00080814696,0.0005770776,0.00021234788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025470583,0.00016047245,0.000179309,0.00028474338,0.00046354454,0.00044020545,0.0031278392,0.0000548864,0.000006344564],"category_scores_gemma":[0.001309015,0.00013226042,0.000050173163,0.0034684464,0.0015306625,0.001029996,0.0006472168,0.00012219159,0.00003855536],"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.0000074757218,0.000055811026,0.000005799136,0.000026920057,0.000001876384,0.000001182319,0.00023712478,0.00021797673,0.00033533652,0.9604479,0.0000132797695,0.03864929],"study_design_scores_gemma":[0.0005280471,0.0003766961,0.00012694756,0.000029041355,0.0000052629925,0.000027650149,0.0000044478506,0.3199833,0.05500562,0.62320065,0.00043973565,0.00027258927],"about_ca_topic_score_codex":0.0000012722948,"about_ca_topic_score_gemma":2.2714364e-7,"teacher_disagreement_score":0.39255884,"about_ca_system_score_codex":0.00011486244,"about_ca_system_score_gemma":0.00039730003,"threshold_uncertainty_score":0.5812355},"labels":[],"label_agreement":null},{"id":"W4205520528","doi":"10.1016/j.tcs.2018.07.015","title":"Complexity of proper prefix-convex regular languages","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Prefix; Regular language; Mathematics; Combinatorics; Regular polygon; Prefix code; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Automaton; Linguistics","score_opus":0.017698645149661598,"score_gpt":0.26388378525127937,"score_spread":0.24618514010161777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205520528","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.15979026,0.000037430113,0.82946396,0.0007277637,0.00037511557,0.00015169918,0.00000219084,0.0002457156,0.009205859],"genre_scores_gemma":[0.8223314,0.0000010951175,0.17700957,0.00046080767,0.00016562674,0.000002866246,4.2679963e-7,0.0000065462013,0.000021623882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976877,0.00012977027,0.00030301206,0.00066661445,0.00069451536,0.00051836873],"domain_scores_gemma":[0.9979886,0.000111723915,0.00010001881,0.0012820814,0.00032019868,0.00019741055],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016037639,0.0001748241,0.00026684278,0.00015384659,0.000291067,0.00020524343,0.003297191,0.000050004586,0.00013386215],"category_scores_gemma":[0.00008205377,0.00012716034,0.000068832,0.0010097373,0.012552691,0.00061061565,0.0015121879,0.00012581218,0.00012487518],"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.0000066172843,0.000056995555,0.00004340048,0.000010222965,0.0000039716533,0.000004856171,0.0006129101,0.0000023208743,0.0059129046,0.9660798,0.00008054992,0.027185502],"study_design_scores_gemma":[0.00025103672,0.0004981975,0.0025204767,0.000063344,0.0000052743603,0.00005327941,0.000022707693,0.3252405,0.15285425,0.5179242,0.0002783915,0.0002883745],"about_ca_topic_score_codex":0.000007048477,"about_ca_topic_score_gemma":5.9019436e-7,"teacher_disagreement_score":0.66254115,"about_ca_system_score_codex":0.000028177563,"about_ca_system_score_gemma":0.00010792806,"threshold_uncertainty_score":0.9901346},"labels":[],"label_agreement":null},{"id":"W4205548359","doi":"10.1016/j.tcs.2006.01.028","title":"Sequential?","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal","keywords":"Undecidable problem; Multiplicity (mathematics); Idempotence; Semiring; Automaton; Mathematics; Series (stratigraphy); Discrete mathematics; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Decidability; Theoretical computer science; Geometry","score_opus":0.00672751249240781,"score_gpt":0.22558577782933412,"score_spread":0.21885826533692632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205548359","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.031962883,0.000030401996,0.94866157,0.00087876694,0.0006761474,0.000079500496,7.072051e-7,0.0004943428,0.017215686],"genre_scores_gemma":[0.84043443,7.7794414e-7,0.1587466,0.00055819674,0.00022124054,0.0000031633697,5.929741e-7,0.0000056126078,0.000029388313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978255,0.000070232025,0.00023296164,0.000650176,0.000627883,0.0005932523],"domain_scores_gemma":[0.99866164,0.00012530733,0.000050219292,0.0009026515,0.00010406116,0.00015613648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011972259,0.00015553072,0.00014960478,0.0001606839,0.00037990793,0.0006341842,0.0028718286,0.000039082617,0.000070769616],"category_scores_gemma":[0.000019958074,0.0001242122,0.00006596502,0.0010844696,0.0021647653,0.00080886134,0.0010681038,0.00012517019,0.00025957444],"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.0000011011047,0.000036331796,0.000026848033,0.0000018467649,9.314368e-7,0.000016414408,0.00003942988,0.000085488595,0.0022703572,0.97719884,0.0002104899,0.020111926],"study_design_scores_gemma":[0.000109993845,0.00004870911,0.0008198881,0.00000816484,0.0000015291425,0.00005042079,0.0000010398063,0.36595422,0.011720884,0.6206767,0.00043901362,0.00016944144],"about_ca_topic_score_codex":0.0000110802475,"about_ca_topic_score_gemma":4.2064545e-7,"teacher_disagreement_score":0.80847156,"about_ca_system_score_codex":0.00004711987,"about_ca_system_score_gemma":0.00008709745,"threshold_uncertainty_score":0.7976168},"labels":[],"label_agreement":null},{"id":"W4205574221","doi":"10.1016/j.tcs.2016.12.016","title":"The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Reduction (mathematics); Mathematics; Combinatory logic; Abstraction; Arithmetic; Algorithm; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Programming language; Epistemology","score_opus":0.024488078321077935,"score_gpt":0.29311052181205216,"score_spread":0.26862244349097425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205574221","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.07475657,0.000030441566,0.9065571,0.015916003,0.0018025337,0.00046945055,9.555229e-7,0.00011956485,0.00034742345],"genre_scores_gemma":[0.96494955,0.000013067664,0.034369603,0.00030293813,0.00019016418,0.000069067144,1.4238056e-7,0.000006596613,0.00009889704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973735,0.00013844245,0.00030521033,0.00080539525,0.00055934774,0.00081810163],"domain_scores_gemma":[0.99828035,0.00035005843,0.000048372487,0.0008138378,0.00025053666,0.00025686662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025249515,0.00016060332,0.00016027536,0.00017149305,0.0010275557,0.00019612104,0.0022064303,0.00004276763,0.000010338455],"category_scores_gemma":[0.00013151948,0.00008709066,0.00006116553,0.0011197829,0.002244831,0.0005832845,0.0012002587,0.00012804511,0.000050020994],"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.000019391606,0.000056474233,0.0000070427263,0.0000024340086,0.0000012835492,0.0000013324027,0.00029714467,0.00015345254,0.0022725265,0.9117432,0.00014348776,0.085302226],"study_design_scores_gemma":[0.00044519012,0.0008545778,0.00044417256,0.000057971723,0.0000017907882,0.000054436794,0.000027182987,0.016076105,0.015228449,0.9650123,0.0015455098,0.00025227864],"about_ca_topic_score_codex":8.7286776e-7,"about_ca_topic_score_gemma":5.095472e-7,"teacher_disagreement_score":0.8901929,"about_ca_system_score_codex":0.00017697972,"about_ca_system_score_gemma":0.00014442587,"threshold_uncertainty_score":0.8271174},"labels":[],"label_agreement":null},{"id":"W4205583413","doi":"10.1016/j.tcs.2006.05.005","title":"Preface","year":2006,"lang":"en","type":"article","venue":"Theoretical 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","funders":"","keywords":"Computer science; Mathematics; Philosophy","score_opus":0.006194485593333101,"score_gpt":0.2398046339403179,"score_spread":0.2336101483469848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205583413","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.47793725,0.000015768606,0.43172243,0.00031234138,0.00030302224,0.00014412076,0.0000039860674,0.00046916358,0.0890919],"genre_scores_gemma":[0.95763266,9.249032e-8,0.041962147,0.00014053,0.00020584174,0.000002587956,7.8308295e-7,0.000015620524,0.000039741673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980155,0.00005826527,0.00016538952,0.00047754275,0.0007153676,0.00056789274],"domain_scores_gemma":[0.9990956,0.00009850201,0.000032210683,0.000497776,0.000122060854,0.00015381738],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011314309,0.00012204718,0.00011390966,0.00011740953,0.00027723535,0.00021053154,0.0010089128,0.00002625159,0.0002522055],"category_scores_gemma":[0.000041216324,0.00009650001,0.000036414338,0.0010794981,0.0066919196,0.00028714287,0.00040906138,0.00011478225,0.00444935],"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.0000065436666,0.00004912694,0.00019291531,0.0000012536548,5.2412196e-7,0.0000051959023,0.000030124178,0.0003283397,0.007782425,0.9893493,0.00055443234,0.0016997966],"study_design_scores_gemma":[0.00029716743,0.00012557667,0.015682258,0.000015632726,0.000006191561,0.000048384827,0.0000022445497,0.27329916,0.03723003,0.6716021,0.0013688869,0.00032239535],"about_ca_topic_score_codex":0.000008520885,"about_ca_topic_score_gemma":8.050175e-7,"teacher_disagreement_score":0.47969538,"about_ca_system_score_codex":0.000069890295,"about_ca_system_score_gemma":0.00006399101,"threshold_uncertainty_score":0.9963258},"labels":[],"label_agreement":null},{"id":"W4205676256","doi":"10.1016/s0304-3975(04)00194-x","title":"Families of languages defined by ciliate bio-operations*1","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Protist diversity and phylogeny","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Inversion (geology); Closure (psychology); Computer science; Ciliate; Closed loop; Mathematics; Biology; Combinatorics; Genetics; Programming language; Algorithm; Engineering","score_opus":0.004414630226866611,"score_gpt":0.22343872126900008,"score_spread":0.21902409104213347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205676256","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.8697397,0.000101686004,0.1288438,0.00022409935,0.000057031557,0.000057807403,0.000021693088,0.000008286542,0.0009458696],"genre_scores_gemma":[0.9882306,0.000018081924,0.011440216,0.0002518848,0.000032424843,0.0000011464562,0.000012614534,0.000002263505,0.000010811238],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994334,0.00001861244,0.00007845096,0.00020019778,0.00012677422,0.00014257437],"domain_scores_gemma":[0.99966246,0.0000071900567,0.00001360884,0.000195786,0.00006407701,0.000056851146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017925502,0.00006147934,0.00006583882,0.000027978738,0.00011199484,0.000021626445,0.00034017125,0.00003571256,0.000014542907],"category_scores_gemma":[0.00003959678,0.000052550487,0.000028432169,0.00014070337,0.0014549333,0.0000050153494,0.00020431927,0.000033922246,0.000011859237],"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.000016348744,0.00007958769,0.0011066864,0.0000073816195,0.000007238403,0.0000016084989,0.00013066859,0.00047244868,0.56404823,0.431853,0.000090613925,0.0021862234],"study_design_scores_gemma":[0.00033432076,0.0003118004,0.003285162,0.000008745678,0.0000054953757,0.000006318089,0.000022579654,0.00043329416,0.9878099,0.007513942,0.00014205868,0.00012638127],"about_ca_topic_score_codex":0.000014732021,"about_ca_topic_score_gemma":0.0000023714676,"teacher_disagreement_score":0.42433906,"about_ca_system_score_codex":0.00000638612,"about_ca_system_score_gemma":0.000055624634,"threshold_uncertainty_score":0.53607625},"labels":[],"label_agreement":null},{"id":"W4206036020","doi":"10.1016/j.tcs.2018.09.026","title":"Bounded disagreement","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Mathematics; Impossibility; Task (project management); Set (abstract data type); Generalization; Object (grammar); Limit (mathematics); Discrete mathematics; Value (mathematics); Uniform consensus; Combinatorics; Consensus; Computer science; Artificial intelligence; Statistics; Multi-agent system","score_opus":0.009824130688016975,"score_gpt":0.2601939464758559,"score_spread":0.25036981578783896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206036020","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.027353132,0.000009226168,0.95577717,0.0011237151,0.00094596035,0.0001025678,2.97462e-7,0.00026821502,0.014419718],"genre_scores_gemma":[0.74796057,0.0000010154039,0.25051302,0.0012469188,0.0002541803,0.0000031403167,1.4327252e-7,0.0000034512123,0.000017589107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775636,0.000050925562,0.00019620864,0.00071391335,0.00064966275,0.0006329338],"domain_scores_gemma":[0.9984562,0.00009494976,0.000045504446,0.00094297796,0.00018519987,0.00027517675],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007678012,0.00015193311,0.00013946976,0.00011117757,0.0006380793,0.00042552687,0.0028675855,0.000030252937,0.00011566739],"category_scores_gemma":[0.000052852713,0.00011341788,0.000045719295,0.001120698,0.0054129236,0.00077712064,0.0013970773,0.000113083224,0.0005497232],"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.0000023238356,0.0000319995,0.000022609338,0.0000010930518,0.000001362686,0.00000543351,0.00030273956,0.0000042652323,0.0003915279,0.9506551,0.000048606325,0.04853292],"study_design_scores_gemma":[0.00015077434,0.0003849646,0.0008648217,0.000009125041,0.0000015539831,0.00002636644,0.0000038643084,0.20114352,0.007300956,0.7890605,0.00085382344,0.00019974048],"about_ca_topic_score_codex":8.936796e-7,"about_ca_topic_score_gemma":5.7798087e-7,"teacher_disagreement_score":0.7206074,"about_ca_system_score_codex":0.000056559704,"about_ca_system_score_gemma":0.00008925388,"threshold_uncertainty_score":0.9972938},"labels":[],"label_agreement":null},{"id":"W4206036233","doi":"10.1016/s0304-3975(04)00125-2","title":"Packing arrays","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Alphabet; Disjoint sets; Upper and lower bounds; Row; Packing problems; Set (abstract data type); Row and column spaces; Equivalence (formal languages); Class (philosophy); Matching (statistics); Discrete mathematics; Computer science","score_opus":0.005519304663409126,"score_gpt":0.19487625343632034,"score_spread":0.1893569487729112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206036233","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.28266567,0.000022159567,0.70268893,0.000046504138,0.0006571916,0.000050302704,4.7280665e-7,0.00030843297,0.0135603305],"genre_scores_gemma":[0.9926018,0.000001460688,0.0071889614,0.00007268386,0.00012234808,0.0000025838056,1.9995953e-7,0.00000873539,0.0000012385924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913806,0.0000145304475,0.000118519594,0.00018060002,0.00022477524,0.00032349615],"domain_scores_gemma":[0.99954814,0.000031221276,0.000008165105,0.00025487845,0.000026464822,0.00013115817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004973203,0.00009485189,0.00009628234,0.00007450091,0.00015090768,0.000095715084,0.00043964808,0.000027263106,0.00003274233],"category_scores_gemma":[0.000010709974,0.000079219004,0.00003478786,0.00044539358,0.0011055348,0.00016447136,0.000060079812,0.000107075306,0.00013822025],"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.000001041565,0.00000610256,0.000010951782,0.000006700319,0.0000018445463,0.000005110538,0.00028599313,0.01692516,0.0031195316,0.9768834,0.000005099354,0.0027490475],"study_design_scores_gemma":[0.0002455756,0.000064272,0.000307883,0.00006454773,0.0000037242528,0.00005531897,0.000022612207,0.09109101,0.03669578,0.87103266,0.00016225828,0.00025436704],"about_ca_topic_score_codex":5.192024e-7,"about_ca_topic_score_gemma":1.644477e-7,"teacher_disagreement_score":0.70993614,"about_ca_system_score_codex":0.000037476846,"about_ca_system_score_gemma":0.000014697256,"threshold_uncertainty_score":0.40733892},"labels":[],"label_agreement":null},{"id":"W4206081855","doi":"10.1016/j.tcs.2015.10.044","title":"Preface","year":2015,"lang":"en","type":"article","venue":"Theoretical 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":"University of Regina; Simon Fraser University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.028209863694724245,"score_gpt":0.2886773331008409,"score_spread":0.2604674694061167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206081855","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.41238627,0.000022591785,0.49783692,0.00059374515,0.0007429917,0.00018663639,0.0000034660152,0.0005653871,0.087662004],"genre_scores_gemma":[0.9488717,1.02128375e-7,0.050685555,0.0002683994,0.00013466363,0.0000023946216,3.6526887e-7,0.000014584962,0.00002226099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785197,0.00008660387,0.00013904757,0.00044544332,0.0009555591,0.0005214062],"domain_scores_gemma":[0.9984456,0.00007636903,0.000028937095,0.00055893173,0.00026638937,0.000623801],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002456122,0.0001146359,0.000118806,0.00010870318,0.0001442005,0.0001938228,0.0012143365,0.000025827252,0.00009773774],"category_scores_gemma":[0.0002558866,0.000087983746,0.000026287982,0.0010791752,0.006447777,0.00037437506,0.00065744977,0.00012507981,0.008072844],"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.000015525306,0.000036141606,0.00011030714,8.389487e-7,9.549135e-7,0.000005846281,0.000378864,0.00019734511,0.0009213293,0.9943581,0.0009012325,0.003073482],"study_design_scores_gemma":[0.000573534,0.000366591,0.0014198709,0.000017469372,0.000007146703,0.00008142122,0.000023204397,0.44383234,0.014438939,0.53634065,0.0025420752,0.00035672425],"about_ca_topic_score_codex":0.0000019730173,"about_ca_topic_score_gemma":2.0019671e-7,"teacher_disagreement_score":0.53648543,"about_ca_system_score_codex":0.00010873395,"about_ca_system_score_gemma":0.00019737819,"threshold_uncertainty_score":0.9962561},"labels":[],"label_agreement":null},{"id":"W4206154636","doi":"10.1016/j.tcs.2010.12.052","title":"Preface","year":2010,"lang":"en","type":"article","venue":"Theoretical 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":"University of Regina","funders":"","keywords":"Mathematics; Philosophy; Computer science","score_opus":0.006793216343050369,"score_gpt":0.2597232525758913,"score_spread":0.25293003623284094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206154636","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.82645035,0.0000019534702,0.13428243,0.0003655744,0.00097425695,0.00012475428,0.000002865865,0.00036848767,0.037429336],"genre_scores_gemma":[0.9252757,8.104634e-8,0.07427259,0.00022415054,0.00019346016,0.0000026617995,2.956926e-7,0.00001560336,0.000015454109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981152,0.000039002745,0.00013665373,0.00048927794,0.00067325245,0.00054662366],"domain_scores_gemma":[0.9986283,0.00012833998,0.000029443441,0.00072362344,0.0001507035,0.00033954487],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017109986,0.000119390694,0.000108297434,0.00011256051,0.00029816953,0.00022609066,0.0014614937,0.000039996194,0.00074381096],"category_scores_gemma":[0.00019732538,0.00009177116,0.000034530047,0.00090055645,0.009812113,0.0003238187,0.0005715731,0.00035912576,0.006236985],"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.000005779663,0.000033222488,0.00012714685,9.2922016e-7,6.944483e-7,0.0000030596789,0.000108773726,0.000011301155,0.090157785,0.903775,0.00012302991,0.005653272],"study_design_scores_gemma":[0.00039646737,0.0001965523,0.012566955,0.0000125111355,0.000008568317,0.00013418021,0.0000048059737,0.35327154,0.12588395,0.5038446,0.0031850173,0.0004947843],"about_ca_topic_score_codex":0.0000013990476,"about_ca_topic_score_gemma":0.0000011675548,"teacher_disagreement_score":0.39993036,"about_ca_system_score_codex":0.000020480511,"about_ca_system_score_gemma":0.00009265925,"threshold_uncertainty_score":0.99453676},"labels":[],"label_agreement":null},{"id":"W4206231269","doi":"10.1016/j.tcs.2012.12.010","title":"Preface","year":2012,"lang":"en","type":"article","venue":"Theoretical 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é de Montréal","funders":"","keywords":"Mathematics; Computer science","score_opus":0.01422251860748348,"score_gpt":0.2759455894990075,"score_spread":0.261723070891524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206231269","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.5895446,0.000046128393,0.3580535,0.0002242149,0.0008434406,0.00015528532,0.0000029406704,0.00040606168,0.050723847],"genre_scores_gemma":[0.9569504,2.5128216e-7,0.042440716,0.00026984588,0.0003050507,0.0000029363437,3.1282323e-7,0.000015944936,0.000014505372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792546,0.00007956492,0.00013220447,0.0002978757,0.0006806019,0.0008842873],"domain_scores_gemma":[0.9987513,0.00011918714,0.000028758195,0.0005119529,0.000087572815,0.00050124584],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002278023,0.00011762275,0.00010961685,0.000101476784,0.00025624738,0.00011577854,0.0009384873,0.000026751493,0.00045065992],"category_scores_gemma":[0.00011149106,0.00008971574,0.00003357286,0.0009233766,0.0055562276,0.0007031824,0.0005716091,0.00013165364,0.0098866625],"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.000006208869,0.000066307795,0.0009150529,0.0000014672836,0.0000011351734,6.4361376e-7,0.00036976932,0.00001558053,0.0041222824,0.9901676,0.00022017435,0.0041137496],"study_design_scores_gemma":[0.0011250279,0.00054138084,0.116162546,0.00007724169,0.00004614072,0.00033851236,0.000047435846,0.33109567,0.17246462,0.3646427,0.0117255375,0.0017331764],"about_ca_topic_score_codex":8.056334e-7,"about_ca_topic_score_gemma":4.4607535e-8,"teacher_disagreement_score":0.62552494,"about_ca_system_score_codex":0.0000702368,"about_ca_system_score_gemma":0.00004320096,"threshold_uncertainty_score":0.99715006},"labels":[],"label_agreement":null},{"id":"W4206300419","doi":"10.1016/j.tcs.2012.10.017","title":"Preface","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics","score_opus":0.01422251860748348,"score_gpt":0.2759455894990075,"score_spread":0.261723070891524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206300419","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.5895446,0.000046128393,0.3580535,0.0002242149,0.0008434406,0.00015528532,0.0000029406704,0.00040606168,0.050723847],"genre_scores_gemma":[0.9569504,2.5128216e-7,0.042440716,0.00026984588,0.0003050507,0.0000029363437,3.1282323e-7,0.000015944936,0.000014505372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792546,0.00007956492,0.00013220447,0.0002978757,0.0006806019,0.0008842873],"domain_scores_gemma":[0.9987513,0.00011918714,0.000028758195,0.0005119529,0.000087572815,0.00050124584],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002278023,0.00011762275,0.00010961685,0.000101476784,0.00025624738,0.00011577854,0.0009384873,0.000026751493,0.00045065992],"category_scores_gemma":[0.00011149106,0.00008971574,0.00003357286,0.0009233766,0.0055562276,0.0007031824,0.0005716091,0.00013165364,0.0098866625],"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.000006208869,0.000066307795,0.0009150529,0.0000014672836,0.0000011351734,6.4361376e-7,0.00036976932,0.00001558053,0.0041222824,0.9901676,0.00022017435,0.0041137496],"study_design_scores_gemma":[0.0011250279,0.00054138084,0.116162546,0.00007724169,0.00004614072,0.00033851236,0.000047435846,0.33109567,0.17246462,0.3646427,0.0117255375,0.0017331764],"about_ca_topic_score_codex":8.056334e-7,"about_ca_topic_score_gemma":4.4607535e-8,"teacher_disagreement_score":0.62552494,"about_ca_system_score_codex":0.0000702368,"about_ca_system_score_gemma":0.00004320096,"threshold_uncertainty_score":0.99715006},"labels":[],"label_agreement":null},{"id":"W4206524171","doi":"10.1016/j.tcs.2018.07.013","title":"How to choose friends strategically","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Viral marketing; Product (mathematics); Set (abstract data type); Maximization; Computer science; Join (topology); Social network (sociolinguistics); Combinatorics; Alice (programming language); Time complexity; Mathematics; Contrast (vision); Discrete mathematics; Mathematical optimization; Artificial intelligence; Graph; Social media; World Wide Web","score_opus":0.009369950261705692,"score_gpt":0.2678645503272397,"score_spread":0.25849460006553404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206524171","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.13985565,0.0000011772642,0.829636,0.0008231075,0.0000992824,0.00008782492,0.0000016707529,0.000099357836,0.029395955],"genre_scores_gemma":[0.9278217,5.9582977e-8,0.07088461,0.00026217522,0.00095807965,0.0000066259695,0.0000010355725,0.0000067877727,0.000058918115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985259,0.00003974616,0.0001364315,0.00047718053,0.00036702523,0.0004536947],"domain_scores_gemma":[0.99886775,0.000051984796,0.00003305174,0.00051582605,0.00022736668,0.00030404143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994809,0.00013627861,0.00016081342,0.000108217624,0.00030271724,0.0005319305,0.0009745036,0.00001685133,0.00067993934],"category_scores_gemma":[0.000006720715,0.000107312415,0.000065410706,0.0010275919,0.0020585833,0.00018861853,0.0005186289,0.00011130764,0.000117693315],"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.0000044585872,0.000023578548,0.00020613335,3.4407802e-7,0.000005396713,6.2464954e-7,0.00009063685,0.000007704548,0.0006618947,0.9521995,0.00026402925,0.046535667],"study_design_scores_gemma":[0.00013410077,0.00044846965,0.0020612022,0.000019851472,0.000018533803,0.0000019501929,0.00003330284,0.11703734,0.0154728135,0.8614196,0.0029753419,0.000377481],"about_ca_topic_score_codex":0.0000069963944,"about_ca_topic_score_gemma":6.5314543e-7,"teacher_disagreement_score":0.7879661,"about_ca_system_score_codex":0.000026607207,"about_ca_system_score_gemma":0.000062759435,"threshold_uncertainty_score":0.75849366},"labels":[],"label_agreement":null},{"id":"W4206956776","doi":"10.1016/j.tcs.2017.03.001","title":"Specular sets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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":"Conseil Régional, Île-de-France; Agence Nationale de la Recherche","keywords":"Generalization; Cardinality (data modeling); Specular reflection; Mathematics; Set (abstract data type); Combinatorics; Interval (graph theory); Natural (archaeology); Group (periodic table); Discrete mathematics; Computer science; Geography; Data mining; Mathematical analysis","score_opus":0.011435490035065918,"score_gpt":0.26523298001445667,"score_spread":0.2537974899793907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206956776","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.047043256,0.000018705487,0.9314873,0.0022943465,0.0010100957,0.00009273192,8.5029774e-7,0.0002702304,0.01778245],"genre_scores_gemma":[0.85328215,0.0000027684634,0.14591847,0.0006503931,0.00012164719,0.0000025712243,2.1478901e-7,0.0000058984006,0.000015883588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977521,0.000053244254,0.00018637725,0.00074019417,0.00066633796,0.0006017827],"domain_scores_gemma":[0.9965413,0.00009604126,0.00010543757,0.0028513249,0.00010928915,0.00029656224],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0016048922,0.00016838164,0.00018104812,0.00010278337,0.0016182876,0.0022083616,0.008167901,0.000043473367,0.0000761335],"category_scores_gemma":[0.00014582167,0.00013334598,0.00007544601,0.00023601372,0.0041433102,0.0014963648,0.003066318,0.00016012986,0.0003255691],"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.0000013822956,0.000023596867,0.000053542688,0.0000020954374,0.0000020173172,0.000037903348,0.00010821874,0.000007249764,0.0004521114,0.92025274,0.00007962611,0.07897953],"study_design_scores_gemma":[0.0001625962,0.000070190035,0.004558142,0.00002022857,0.0000021033034,0.000056701898,0.0000018343673,0.42864227,0.005683898,0.5601185,0.00046696555,0.00021658059],"about_ca_topic_score_codex":0.000004027589,"about_ca_topic_score_gemma":2.7874043e-7,"teacher_disagreement_score":0.8062389,"about_ca_system_score_codex":0.000035094756,"about_ca_system_score_gemma":0.000086392974,"threshold_uncertainty_score":0.9996815},"labels":[],"label_agreement":null},{"id":"W4210459942","doi":"10.1016/j.tcs.2008.02.008","title":"On fractional dynamic faults with thresholds","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","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":"Carleton University","funders":"","keywords":"Computer science; Hypercube; Broadcasting (networking); Chordal graph; Simple (philosophy); Time complexity; Constant (computer programming); Set (abstract data type); Enhanced Data Rates for GSM Evolution; Focus (optics); Theoretical computer science; Leader election; Distributed computing; Topology (electrical circuits); Computer network; Algorithm; Mathematics; Graph; Combinatorics; Parallel computing; Telecommunications","score_opus":0.007390070477403671,"score_gpt":0.23384963839680353,"score_spread":0.22645956791939986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210459942","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.13027535,0.000011556481,0.8612466,0.00068110175,0.00043412717,0.00012249868,0.0000039968104,0.00020534194,0.0070194323],"genre_scores_gemma":[0.96236783,0.0000024336266,0.036805667,0.00070455717,0.000062014034,0.00000913327,0.0000015887515,0.0000072624125,0.000039526316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719656,0.000050250026,0.0002253034,0.0008086088,0.0011672155,0.00055207906],"domain_scores_gemma":[0.9983879,0.00017646886,0.00007223501,0.0008755447,0.00021160702,0.0002762904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957466,0.00020670678,0.00020743418,0.00013943952,0.00071513484,0.0001698785,0.0019602966,0.000052024865,0.000029816465],"category_scores_gemma":[0.000027610882,0.00014416402,0.000051829014,0.0011376437,0.0023262466,0.0007233916,0.00030928812,0.00025155285,0.00021711442],"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.00001985427,0.00009223989,0.00014212994,0.0000025391473,0.00000380586,0.00008566483,0.00015422713,0.0015302973,0.000060868897,0.99460405,0.00016088216,0.0031434563],"study_design_scores_gemma":[0.0005802783,0.0007040114,0.011898413,0.00006671137,0.000002206017,0.00089929404,0.0000035673638,0.9324473,0.0004030183,0.052051056,0.00053758954,0.0004065547],"about_ca_topic_score_codex":0.0000032499795,"about_ca_topic_score_gemma":7.509228e-7,"teacher_disagreement_score":0.942553,"about_ca_system_score_codex":0.00009121506,"about_ca_system_score_gemma":0.00018965139,"threshold_uncertainty_score":0.85711527},"labels":[],"label_agreement":null},{"id":"W4210962357","doi":"10.1016/j.tcs.2010.12.002","title":"Preface","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.0060113087908003175,"score_gpt":0.244440654640883,"score_spread":0.23842934585008269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210962357","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.09491672,0.0000053361878,0.89613575,0.0011899557,0.0015801245,0.00008367153,3.6827305e-7,0.00020005126,0.005888048],"genre_scores_gemma":[0.6774964,4.6376113e-7,0.32188874,0.00040976942,0.0001795089,0.0000028875934,4.3672603e-7,0.000002424746,0.000019392473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834365,0.000033689386,0.00016318305,0.00052993355,0.0005798333,0.00034970863],"domain_scores_gemma":[0.9987332,0.00014370854,0.00003699661,0.00064179144,0.00021045866,0.00023384992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611793,0.000110648725,0.000093838185,0.00017073963,0.00038944537,0.00046649307,0.0018884123,0.000039141694,0.00007764938],"category_scores_gemma":[0.00009785101,0.00009307211,0.000039075094,0.0012355449,0.0011026209,0.00078691967,0.0006656409,0.00023685087,0.00018691894],"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.0000010949391,0.000026797024,0.000017800126,0.0000010893334,8.58826e-7,0.0000022862419,0.00008727254,0.00027935766,0.010853426,0.9190001,0.00006477943,0.069665164],"study_design_scores_gemma":[0.00011323804,0.000073286334,0.0019116355,0.000002758713,0.0000011996547,0.000055499535,6.442781e-7,0.7214768,0.023295915,0.2512199,0.001690462,0.00015866548],"about_ca_topic_score_codex":8.1469926e-7,"about_ca_topic_score_gemma":6.800322e-7,"teacher_disagreement_score":0.7211974,"about_ca_system_score_codex":0.000014404962,"about_ca_system_score_gemma":0.00015238806,"threshold_uncertainty_score":0.44984034},"labels":[],"label_agreement":null},{"id":"W4210967890","doi":"10.1016/s0304-3975(01)00052-4","title":"Foreword","year":2002,"lang":"en","type":"article","venue":"Theoretical 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":"Carleton University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.018197191207315742,"score_gpt":0.24800933253625662,"score_spread":0.22981214132894087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210967890","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.33371216,0.000043578362,0.56860125,0.0010714952,0.00065716257,0.00022063102,0.000009716595,0.0007072698,0.094976716],"genre_scores_gemma":[0.96467036,6.697041e-7,0.034606494,0.00049619534,0.00015355732,0.0000029981268,2.0021047e-7,0.000017166994,0.00005238198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979619,0.000052924668,0.00015926469,0.00047295858,0.0007234718,0.0006295194],"domain_scores_gemma":[0.99886477,0.000121418685,0.000029257186,0.0005736869,0.000108408094,0.00030248612],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000919999,0.00012655319,0.00012514132,0.0001473162,0.00030838678,0.00013224813,0.0011861773,0.000028770273,0.0022527326],"category_scores_gemma":[0.00010723913,0.00009943573,0.000045655157,0.0012856816,0.007105513,0.00033331584,0.00043147657,0.00014754568,0.0143523775],"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.0000033412405,0.000048703856,0.00006958841,0.0000011843913,0.000001076426,0.00000817975,0.00018501574,0.00002696842,0.00072009023,0.9761988,0.0011494566,0.021587605],"study_design_scores_gemma":[0.0001832231,0.0001253991,0.0009965425,0.000011018366,0.0000038426037,0.000047471538,0.0000024285202,0.85693765,0.0027307698,0.13792153,0.0008458731,0.00019424804],"about_ca_topic_score_codex":6.3642227e-7,"about_ca_topic_score_gemma":1.6791184e-7,"teacher_disagreement_score":0.8569107,"about_ca_system_score_codex":0.000058896338,"about_ca_system_score_gemma":0.000013622903,"threshold_uncertainty_score":0.9986594},"labels":[],"label_agreement":null},{"id":"W4211000163","doi":"10.1016/s0304-3975(00)00130-4","title":"Foreword","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science; Philosophy","score_opus":0.012961758910863156,"score_gpt":0.27070829004078895,"score_spread":0.2577465311299258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211000163","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.44438353,0.000008277687,0.52169436,0.00042394907,0.0003044068,0.00010298065,0.0000027105978,0.0003199992,0.032759752],"genre_scores_gemma":[0.9665368,8.278046e-7,0.032696646,0.00051946053,0.00018964963,0.0000031003322,4.6037476e-7,0.000017349486,0.00003570038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791545,0.000053087755,0.00016206005,0.00048082377,0.00071704044,0.00067156705],"domain_scores_gemma":[0.9988295,0.00011933843,0.0000295985,0.0005691368,0.00013563427,0.0003167964],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013665872,0.0001279043,0.00012748645,0.00015757285,0.00031018438,0.00013214584,0.001217229,0.000029079689,0.0006511662],"category_scores_gemma":[0.000103711915,0.000099934485,0.000044716668,0.0016247082,0.0067094993,0.00034981218,0.000478522,0.00014087108,0.005868033],"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.000018526902,0.000038399266,0.0004572658,7.721132e-7,0.0000011172191,0.000021713455,0.00009144473,0.000043862692,0.0011358671,0.9787891,0.0002512153,0.01915072],"study_design_scores_gemma":[0.0003211568,0.00020262397,0.008304636,0.000018991392,0.000006308468,0.00022239509,0.0000060506613,0.51267374,0.0034462851,0.47191137,0.0025751048,0.00031136686],"about_ca_topic_score_codex":0.0000016635375,"about_ca_topic_score_gemma":5.572095e-7,"teacher_disagreement_score":0.52215326,"about_ca_system_score_codex":0.00006743314,"about_ca_system_score_gemma":0.00006148173,"threshold_uncertainty_score":0.9959937},"labels":[],"label_agreement":null},{"id":"W4211066449","doi":"10.1016/j.tcs.2008.02.002","title":"Preface","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"","field":"","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mathematics","score_opus":0.017120368114107443,"score_gpt":0.2562859153566268,"score_spread":0.23916554724251937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211066449","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.71359843,0.000012517119,0.2528719,0.00021292428,0.00027630976,0.00012076289,0.0000023633613,0.00038721395,0.03251759],"genre_scores_gemma":[0.9563332,0.0000010369534,0.043225676,0.00027671305,0.000113683964,0.000002568169,3.207632e-7,0.000015614944,0.00003115054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792826,0.000065570945,0.00015048085,0.0004883929,0.0008061434,0.0005611344],"domain_scores_gemma":[0.9988519,0.0001091626,0.000029149578,0.0005675557,0.00014028934,0.00030191836],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008967644,0.00012321901,0.0001286153,0.00011930491,0.0005349731,0.000066537825,0.0011591438,0.000026448417,0.0003112802],"category_scores_gemma":[0.00010514661,0.0000969133,0.000039283128,0.0011423654,0.012549031,0.0003305549,0.00050309463,0.00014364248,0.006588438],"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.000010911104,0.0000482328,0.0003104131,0.0000011146237,0.0000011917733,0.00002536036,0.00037397383,0.00009859684,0.003840146,0.9933364,0.00045033314,0.0015033206],"study_design_scores_gemma":[0.0009859647,0.00062468543,0.04684367,0.00004181781,0.000012810123,0.001345029,0.0000115099265,0.5978318,0.07980317,0.2685678,0.0029323038,0.0009994367],"about_ca_topic_score_codex":0.0000014890219,"about_ca_topic_score_gemma":1.0094093e-7,"teacher_disagreement_score":0.7247686,"about_ca_system_score_codex":0.000062595886,"about_ca_system_score_gemma":0.00012096733,"threshold_uncertainty_score":0.99418503},"labels":[],"label_agreement":null},{"id":"W4211072247","doi":"10.1016/j.tcs.2007.04.022","title":"Preface","year":2007,"lang":"en","type":"article","venue":"Theoretical 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 en Outaouais","funders":"","keywords":"Mathematics; Computer science; Philosophy","score_opus":0.01017389285586698,"score_gpt":0.28046535832560554,"score_spread":0.27029146546973853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211072247","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.32825035,0.0000072677735,0.62659305,0.00011187999,0.0002912116,0.00009430551,0.0000010898184,0.00026465594,0.044386163],"genre_scores_gemma":[0.93366504,1.5295531e-7,0.06583949,0.00030948533,0.00015307665,7.164872e-7,2.6730575e-7,0.000015206596,0.000016557833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976889,0.00003765905,0.00019079915,0.00047672144,0.00082982576,0.00077608624],"domain_scores_gemma":[0.9986876,0.00021812729,0.000033974036,0.0005330553,0.00014992653,0.00037727432],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046622334,0.00012105752,0.00011265188,0.00017047019,0.00027920384,0.00013853316,0.0011502439,0.000031849522,0.0002464936],"category_scores_gemma":[0.00013466766,0.00009582369,0.00003562245,0.001382532,0.007206811,0.00028459483,0.0004937891,0.00015693565,0.0043405243],"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.000019754812,0.00003866499,0.0001749925,0.0000013111016,0.0000010280669,0.000012232628,0.0001877352,0.000029516796,0.009237547,0.97757006,0.00009968578,0.012627495],"study_design_scores_gemma":[0.000799491,0.0005405521,0.047845192,0.000049994036,0.000015527734,0.00020135677,0.000031691645,0.19787356,0.22151871,0.5269179,0.0033276086,0.000878464],"about_ca_topic_score_codex":0.0000013511066,"about_ca_topic_score_gemma":6.4295284e-7,"teacher_disagreement_score":0.6054147,"about_ca_system_score_codex":0.00008947981,"about_ca_system_score_gemma":0.00006200041,"threshold_uncertainty_score":0.9964347},"labels":[],"label_agreement":null},{"id":"W4211076574","doi":"10.1016/j.tcs.2007.03.036","title":"Foreword","year":2007,"lang":"en","type":"article","venue":"Theoretical 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":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.010467206674651683,"score_gpt":0.28121235236990577,"score_spread":0.2707451456952541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211076574","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.30457303,0.00000524322,0.6706599,0.000108807006,0.00030982366,0.00008143367,0.0000020187663,0.00022803327,0.024031693],"genre_scores_gemma":[0.9211852,1.0960241e-7,0.078136444,0.0004421961,0.0002044102,8.102836e-7,3.5824556e-7,0.000016218666,0.000014239448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976574,0.000029881467,0.0002054526,0.00045730497,0.00081351673,0.00083644706],"domain_scores_gemma":[0.99866754,0.00023997467,0.000034785116,0.00051744573,0.00015364299,0.00038663502],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046891146,0.00012398853,0.00011971643,0.00021128685,0.00029348306,0.000094120485,0.0011390067,0.00003418191,0.00025144854],"category_scores_gemma":[0.00013670637,0.00009766013,0.000043755554,0.001519848,0.0076407874,0.0002794343,0.00046556108,0.00016108002,0.0034804535],"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.000022631857,0.00003297692,0.0002254938,0.0000011569526,0.0000010259645,0.000016222128,0.00013124457,0.000011772358,0.0030492726,0.97029287,0.00013343686,0.026081908],"study_design_scores_gemma":[0.0005259566,0.00036463854,0.03313373,0.00003174453,0.0000100600155,0.000143059,0.000019112362,0.22848178,0.061866928,0.6733373,0.0015334613,0.00055226753],"about_ca_topic_score_codex":0.0000013212887,"about_ca_topic_score_gemma":0.0000011073938,"teacher_disagreement_score":0.6166122,"about_ca_system_score_codex":0.00008692642,"about_ca_system_score_gemma":0.000056516532,"threshold_uncertainty_score":0.99729544},"labels":[],"label_agreement":null},{"id":"W4211137933","doi":"10.1016/j.tcs.2013.09.017","title":"Preface","year":2013,"lang":"en","type":"article","venue":"Theoretical 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":"University of Alberta","funders":"","keywords":"Computer science; Mathematics","score_opus":0.00829221122938674,"score_gpt":0.24383633507699598,"score_spread":0.23554412384760925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211137933","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.6803987,0.000009340896,0.26959616,0.0007546853,0.00033900648,0.000324212,0.0000016011683,0.0004490038,0.04812727],"genre_scores_gemma":[0.9511991,2.0009064e-7,0.048240345,0.00040681433,0.00009525306,0.000010941736,2.7854213e-7,0.000015540392,0.000031523345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804616,0.00006514038,0.00015184337,0.0004685339,0.00066602783,0.0006023193],"domain_scores_gemma":[0.9987197,0.00011777249,0.000029375751,0.0005826542,0.0002088573,0.0003416344],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008688742,0.00012313548,0.00011634227,0.000108321394,0.00024861944,0.000353641,0.0012549232,0.000026731803,0.001937008],"category_scores_gemma":[0.00009964938,0.000091377195,0.000033076194,0.00093257683,0.0067297146,0.0006167212,0.0005947488,0.00013395249,0.037027713],"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.0000022152863,0.000032262342,0.000108780376,0.000001440299,0.0000010814967,0.0000012971057,0.00013488716,0.00004311717,0.009807588,0.97973245,0.0007982085,0.0093366625],"study_design_scores_gemma":[0.00023237245,0.00016845416,0.015308643,0.000017718381,0.0000043864006,0.0000353912,0.000008579204,0.4819215,0.020145215,0.48135963,0.00047554672,0.00032256448],"about_ca_topic_score_codex":0.000006840241,"about_ca_topic_score_gemma":1.2454387e-7,"teacher_disagreement_score":0.49837282,"about_ca_system_score_codex":0.000056379267,"about_ca_system_score_gemma":0.000058748756,"threshold_uncertainty_score":0.99897534},"labels":[],"label_agreement":null},{"id":"W4211175028","doi":"10.1016/j.tcs.2007.03.016","title":"Preface","year":2007,"lang":"en","type":"article","venue":"Theoretical 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.01017389285586698,"score_gpt":0.28046535832560554,"score_spread":0.27029146546973853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211175028","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.32825035,0.0000072677735,0.62659305,0.00011187999,0.0002912116,0.00009430551,0.0000010898184,0.00026465594,0.044386163],"genre_scores_gemma":[0.93366504,1.5295531e-7,0.06583949,0.00030948533,0.00015307665,7.164872e-7,2.6730575e-7,0.000015206596,0.000016557833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976889,0.00003765905,0.00019079915,0.00047672144,0.00082982576,0.00077608624],"domain_scores_gemma":[0.9986876,0.00021812729,0.000033974036,0.0005330553,0.00014992653,0.00037727432],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046622334,0.00012105752,0.00011265188,0.00017047019,0.00027920384,0.00013853316,0.0011502439,0.000031849522,0.0002464936],"category_scores_gemma":[0.00013466766,0.00009582369,0.00003562245,0.001382532,0.007206811,0.00028459483,0.0004937891,0.00015693565,0.0043405243],"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.000019754812,0.00003866499,0.0001749925,0.0000013111016,0.0000010280669,0.000012232628,0.0001877352,0.000029516796,0.009237547,0.97757006,0.00009968578,0.012627495],"study_design_scores_gemma":[0.000799491,0.0005405521,0.047845192,0.000049994036,0.000015527734,0.00020135677,0.000031691645,0.19787356,0.22151871,0.5269179,0.0033276086,0.000878464],"about_ca_topic_score_codex":0.0000013511066,"about_ca_topic_score_gemma":6.4295284e-7,"teacher_disagreement_score":0.6054147,"about_ca_system_score_codex":0.00008947981,"about_ca_system_score_gemma":0.00006200041,"threshold_uncertainty_score":0.9964347},"labels":[],"label_agreement":null},{"id":"W4211219205","doi":"10.1016/j.tcs.2009.05.015","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Theoretical 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":"University of Prince Edward Island","funders":"","keywords":"Mathematics; Computer science","score_opus":0.00905714772692766,"score_gpt":0.2675520916150978,"score_spread":0.2584949438881701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211219205","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.4228061,0.000019497955,0.49389085,0.0016055434,0.00032332077,0.00020631382,0.0000026208593,0.00067242247,0.08047331],"genre_scores_gemma":[0.954952,3.0281404e-7,0.04399805,0.0009136885,0.00011279136,7.9673504e-7,2.9588978e-7,0.000007962936,0.000014121686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980557,0.00005644405,0.00014587617,0.00047612953,0.00069879345,0.000567046],"domain_scores_gemma":[0.99894696,0.00006924066,0.0000283234,0.0005520447,0.00011582252,0.00028757515],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012243668,0.0001225121,0.0001216255,0.00011740801,0.00025831466,0.00019731703,0.0011852222,0.000026355337,0.00020239933],"category_scores_gemma":[0.000091841386,0.00009546416,0.00003649194,0.0011187098,0.0038708467,0.00033926254,0.00020217583,0.00013805198,0.0035965072],"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.000010839026,0.00005098696,0.000019953826,4.921196e-7,5.3405057e-7,0.0000053235117,0.00013104164,0.00008414438,0.008368262,0.9701968,0.0002191613,0.020912474],"study_design_scores_gemma":[0.00029860908,0.0005138944,0.014440229,0.000021145834,0.000005969903,0.00005810116,0.00000350124,0.24022788,0.027871905,0.71560663,0.0006223925,0.0003297538],"about_ca_topic_score_codex":3.843026e-7,"about_ca_topic_score_gemma":5.215071e-8,"teacher_disagreement_score":0.53214586,"about_ca_system_score_codex":0.00006097392,"about_ca_system_score_gemma":0.00006481596,"threshold_uncertainty_score":0.99884003},"labels":[],"label_agreement":null},{"id":"W4211221730","doi":"10.1016/j.tcs.2008.06.018","title":"Foreword","year":2008,"lang":"en","type":"article","venue":"Theoretical 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":"McGill University","funders":"","keywords":"Mathematics; Philosophy; Computer science","score_opus":0.017611793333206265,"score_gpt":0.25693902478430847,"score_spread":0.2393272314511022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211221730","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.61723995,0.000008402935,0.36565384,0.00019262593,0.00027365476,0.0000970541,0.000004073267,0.0003104961,0.016219873],"genre_scores_gemma":[0.9475827,7.452159e-7,0.051819846,0.00039723364,0.00015249933,0.000002915334,4.3168947e-7,0.000016726057,0.000026906642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979218,0.000052027823,0.00016207984,0.00046858186,0.00079049455,0.0006050073],"domain_scores_gemma":[0.9988459,0.00012013831,0.000029845745,0.0005509159,0.00014377912,0.00030945294],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000902848,0.00012620067,0.00013667012,0.0001479177,0.0005621307,0.000045214685,0.0011478055,0.000028390192,0.00031769625],"category_scores_gemma":[0.00010674981,0.00009876969,0.00004824815,0.0012560348,0.013296972,0.000324535,0.0004743334,0.00014745243,0.005286163],"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.000011817943,0.000038876562,0.00037816796,9.298106e-7,0.0000011239889,0.000031774707,0.00024695657,0.00003714914,0.0011936035,0.9945158,0.0005691558,0.0029746601],"study_design_scores_gemma":[0.00060075975,0.00039029968,0.030060388,0.000024598417,0.000007688876,0.0008841752,0.0000064320925,0.60878706,0.020366943,0.3370379,0.0012518206,0.00058197137],"about_ca_topic_score_codex":0.0000014561357,"about_ca_topic_score_gemma":1.7391226e-7,"teacher_disagreement_score":0.6574779,"about_ca_system_score_codex":0.000060821432,"about_ca_system_score_gemma":0.00011023032,"threshold_uncertainty_score":0.99548835},"labels":[],"label_agreement":null},{"id":"W4212817891","doi":"10.1016/j.tcs.2022.02.009","title":"Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Chordal graph; Mathematics; Feedback vertex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.016109313204729876,"score_gpt":0.27365762230865104,"score_spread":0.2575483091039212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212817891","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.07298154,0.00008593039,0.91546744,0.0021209933,0.0016777914,0.00040749335,0.000009370148,0.0005981592,0.006651284],"genre_scores_gemma":[0.9132002,0.0000046490754,0.085532345,0.0010543525,0.00006033643,0.00007154588,0.0000011107276,0.0000206193,0.000054816355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993686,0.0004903735,0.00040474941,0.0014692309,0.0024990216,0.0014505782],"domain_scores_gemma":[0.99557817,0.00068519305,0.000100544785,0.0028181432,0.00024639245,0.00057157094],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.0041487226,0.00030784978,0.0003285473,0.0006884487,0.002351611,0.0005508456,0.012808971,0.00004288899,0.00024499698],"category_scores_gemma":[0.00029011295,0.00029339708,0.00015725262,0.0050007473,0.0045871977,0.0011881448,0.013425962,0.00083950884,0.000096318836],"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.000028449851,0.00010207242,0.00007336621,0.000005656113,0.0000066199095,0.00008089261,0.00051239104,0.0017329506,0.0012011346,0.9800755,0.00029295485,0.01588801],"study_design_scores_gemma":[0.00045266838,0.00048825037,0.00035723447,0.000008952134,0.0000030505903,0.00009013688,0.000029255345,0.2664214,0.0019428529,0.72900546,0.00085946586,0.0003412988],"about_ca_topic_score_codex":0.0000047202934,"about_ca_topic_score_gemma":6.958786e-7,"teacher_disagreement_score":0.84021866,"about_ca_system_score_codex":0.00025801884,"about_ca_system_score_gemma":0.00032327723,"threshold_uncertainty_score":0.99995184},"labels":[],"label_agreement":null},{"id":"W4212834144","doi":"10.1016/s0304-3975(03)00311-6","title":"Reducing NFAs by invariant equivalences","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":33,"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":"Automaton; Merge (version control); Invariant (physics); Nondeterministic finite automaton; Mathematics; Equivalence (formal languages); Discrete mathematics; Combinatorics; Automata theory; Computer science; Theoretical computer science","score_opus":0.010824583969180577,"score_gpt":0.23935752065838203,"score_spread":0.22853293668920147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212834144","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.03136501,0.00013796613,0.9506178,0.0007696439,0.0008837363,0.00011804381,0.0000014172903,0.0003168921,0.015789505],"genre_scores_gemma":[0.8528177,0.000008605024,0.14617857,0.0008930097,0.00005808663,0.000005258912,3.8948625e-7,0.000007630361,0.00003074704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968706,0.0002364708,0.0003184727,0.00096141064,0.00079416897,0.0008189033],"domain_scores_gemma":[0.9980323,0.00034464398,0.00008328823,0.0010768368,0.00010560149,0.00035738345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030802034,0.00022231038,0.00022420207,0.0001485033,0.00056543655,0.00078398496,0.003252359,0.00005688745,0.00017239063],"category_scores_gemma":[0.00021721654,0.0001755856,0.000068089816,0.0013317982,0.0024935224,0.0010877881,0.00076058833,0.00020901179,0.0001520249],"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.0000013102333,0.000048459468,0.000014680401,0.000003934873,0.0000025859854,0.000010895151,0.0002984872,0.00003668099,0.00487328,0.97592914,0.00043627815,0.018344238],"study_design_scores_gemma":[0.00024990895,0.00021987327,0.00009186216,0.000054735207,0.0000047293743,0.0001505866,0.000021267622,0.31645644,0.061070018,0.6199629,0.0012445875,0.00047313614],"about_ca_topic_score_codex":0.0000052789887,"about_ca_topic_score_gemma":8.716716e-8,"teacher_disagreement_score":0.8214527,"about_ca_system_score_codex":0.000055968794,"about_ca_system_score_gemma":0.00017891177,"threshold_uncertainty_score":0.9187487},"labels":[],"label_agreement":null},{"id":"W4212973001","doi":"10.1016/j.tcs.2009.09.027","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Theoretical 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":"Memorial University of Newfoundland; University of Regina","funders":"","keywords":"Computer science; Mathematics","score_opus":0.00905714772692766,"score_gpt":0.2675520916150978,"score_spread":0.2584949438881701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212973001","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.4228061,0.000019497955,0.49389085,0.0016055434,0.00032332077,0.00020631382,0.0000026208593,0.00067242247,0.08047331],"genre_scores_gemma":[0.954952,3.0281404e-7,0.04399805,0.0009136885,0.00011279136,7.9673504e-7,2.9588978e-7,0.000007962936,0.000014121686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980557,0.00005644405,0.00014587617,0.00047612953,0.00069879345,0.000567046],"domain_scores_gemma":[0.99894696,0.00006924066,0.0000283234,0.0005520447,0.00011582252,0.00028757515],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012243668,0.0001225121,0.0001216255,0.00011740801,0.00025831466,0.00019731703,0.0011852222,0.000026355337,0.00020239933],"category_scores_gemma":[0.000091841386,0.00009546416,0.00003649194,0.0011187098,0.0038708467,0.00033926254,0.00020217583,0.00013805198,0.0035965072],"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.000010839026,0.00005098696,0.000019953826,4.921196e-7,5.3405057e-7,0.0000053235117,0.00013104164,0.00008414438,0.008368262,0.9701968,0.0002191613,0.020912474],"study_design_scores_gemma":[0.00029860908,0.0005138944,0.014440229,0.000021145834,0.000005969903,0.00005810116,0.00000350124,0.24022788,0.027871905,0.71560663,0.0006223925,0.0003297538],"about_ca_topic_score_codex":3.843026e-7,"about_ca_topic_score_gemma":5.215071e-8,"teacher_disagreement_score":0.53214586,"about_ca_system_score_codex":0.00006097392,"about_ca_system_score_gemma":0.00006481596,"threshold_uncertainty_score":0.99884003},"labels":[],"label_agreement":null},{"id":"W4224095417","doi":"10.1016/j.tcs.2022.04.006","title":"Properties of a class of Toeplitz words","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Toeplitz matrix; Uncountable set; Mathematics; Automaton; Class (philosophy); Permutation (music); Mathematical proof; Set (abstract data type); Discrete mathematics; Combinatorics; Algebra over a field; Theoretical computer science; Computer science; Pure mathematics; Artificial intelligence; Countable set; Programming language","score_opus":0.012783376803217462,"score_gpt":0.2203714539050505,"score_spread":0.20758807710183305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224095417","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.40949154,0.0001071803,0.58762676,0.00049318594,0.000417907,0.00012360471,0.0000028822105,0.000094797375,0.0016421634],"genre_scores_gemma":[0.96956897,0.0000013053442,0.030128049,0.00025000525,0.00002560059,0.000010391059,1.8285581e-7,0.000005056914,0.000010416065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977969,0.000161662,0.0003386924,0.00044084937,0.00091541646,0.00034646984],"domain_scores_gemma":[0.99865067,0.000115430645,0.00012839228,0.0008871648,0.00011909912,0.000099241384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018832,0.0001155645,0.00023939708,0.0001912066,0.00026965706,0.00006234616,0.0034352771,0.000017398139,0.00007253311],"category_scores_gemma":[0.00004690884,0.00009142808,0.000077397635,0.0013941198,0.002651161,0.00033068305,0.0030601106,0.00015590986,0.0000045399606],"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.000012053923,0.00009860158,0.000026944039,0.000015324955,0.0000033812464,0.0000027107465,0.0012118514,0.00031806942,0.01769091,0.9598469,0.000016911112,0.020756334],"study_design_scores_gemma":[0.00024658884,0.0005409694,0.00033668382,0.000040394472,0.000004515868,0.00004478726,0.000095660085,0.6791639,0.11348481,0.20564218,0.00018762467,0.0002119085],"about_ca_topic_score_codex":0.000005707009,"about_ca_topic_score_gemma":8.373918e-8,"teacher_disagreement_score":0.75420475,"about_ca_system_score_codex":0.000041010375,"about_ca_system_score_gemma":0.00017034238,"threshold_uncertainty_score":0.9768313},"labels":[],"label_agreement":null},{"id":"W4225162735","doi":"10.1016/j.tcs.2022.04.052","title":"A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Modular design; Mathematics; Orthogonality; Time complexity; Decomposition; Scheme (mathematics); Polynomial; Focus (optics); Discrete mathematics; Combinatorics; Algorithm; Computer science","score_opus":0.006917649435479797,"score_gpt":0.27963597498471354,"score_spread":0.27271832554923375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225162735","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.09420871,0.00001310281,0.9033883,0.0008488568,0.00028716362,0.0009501849,0.000032835615,0.00012320837,0.0001476469],"genre_scores_gemma":[0.5342804,3.7347084e-7,0.46515957,0.00015410718,0.000045025445,0.00034400492,0.000005335283,0.000009180623,0.000002002409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702543,0.00016241289,0.00031652115,0.00085816695,0.0010143087,0.0006231402],"domain_scores_gemma":[0.99775016,0.00031201364,0.00009255842,0.001045682,0.00046359395,0.00033600588],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012560725,0.00018761332,0.00025839213,0.00043875605,0.0013456576,0.00013583846,0.003013878,0.000026950278,0.000013147033],"category_scores_gemma":[0.00002766078,0.00017515062,0.000100494646,0.003068692,0.0014124559,0.0004133536,0.0014853086,0.0002249613,0.000005994504],"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.000073396084,0.00022049897,0.000021223723,0.0000062477875,0.000010036477,0.000002486352,0.00016677694,0.015240194,0.03573719,0.9443107,0.000017145789,0.0041940873],"study_design_scores_gemma":[0.00050239346,0.0010301959,0.00011259472,0.0000067330047,0.0000050766484,0.000043199307,0.000007996566,0.60799885,0.010090546,0.3798708,0.00014571454,0.00018593018],"about_ca_topic_score_codex":0.000004049849,"about_ca_topic_score_gemma":4.4083558e-7,"teacher_disagreement_score":0.59275866,"about_ca_system_score_codex":0.00013809356,"about_ca_system_score_gemma":0.00021040357,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W4226238874","doi":"10.1016/j.tcs.2022.01.010","title":"Efficient and compact representations of some non-canonical prefix-free codes","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Prefix code; Code word; Lexicographical order; Prefix; ENCODE; Word (group theory); Constant (computer programming); Mathematics; Code (set theory); Decoding methods; Encoding (memory); Combinatorics; Discrete mathematics; Alphabet; Universal code; Order (exchange); Computer science; Arithmetic; Algorithm; Code rate; Linear code; Systematic code; Block code","score_opus":0.01079473506623293,"score_gpt":0.26916367326847823,"score_spread":0.2583689382022453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226238874","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.14802432,0.000057600908,0.8490224,0.0010671379,0.00042966727,0.00020110648,0.00003817347,0.00008009606,0.001079487],"genre_scores_gemma":[0.9136024,0.0000028180857,0.086124845,0.00020356859,0.000045559325,0.000007166676,0.0000017045364,0.000005080671,0.000006820521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973764,0.00015565111,0.00032326742,0.00070407166,0.0010374296,0.00040322513],"domain_scores_gemma":[0.9977987,0.0003746118,0.00010929915,0.001369425,0.00010359099,0.00024437997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012942471,0.00014319154,0.00024497058,0.0001903211,0.0008070197,0.0001892593,0.0031930415,0.000022087765,0.00005710448],"category_scores_gemma":[0.0000769333,0.00011887986,0.000054152762,0.0008941583,0.0022449857,0.0003173436,0.006009173,0.0002367225,0.0000045199545],"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.00001183138,0.00014965539,0.00009625027,0.0000066229723,0.0000039790352,0.00000814281,0.00041762553,0.009118673,0.0011751765,0.98231524,0.00024003226,0.00645678],"study_design_scores_gemma":[0.00036821124,0.0002924695,0.005921568,0.000013717385,0.000004639947,0.000052920837,0.000018907913,0.935605,0.00154279,0.055940114,0.00008569995,0.00015399004],"about_ca_topic_score_codex":0.000020250067,"about_ca_topic_score_gemma":2.247807e-7,"teacher_disagreement_score":0.9264863,"about_ca_system_score_codex":0.000050838564,"about_ca_system_score_gemma":0.00018255362,"threshold_uncertainty_score":0.8271743},"labels":[],"label_agreement":null},{"id":"W4226482498","doi":"10.1016/j.tcs.2022.04.002","title":"An efficient oracle for counting shortest paths in planar graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Planar graph; Shortest path problem; Voronoi diagram; Vertex (graph theory); Mathematics; Discrete mathematics; Data structure; Computer science; Graph; Geometry","score_opus":0.010823555602555292,"score_gpt":0.2515598887280446,"score_spread":0.24073633312548928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226482498","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.05817122,0.00001362778,0.93960667,0.00045570283,0.00069354207,0.00034615595,0.000015445472,0.00016358701,0.0005340433],"genre_scores_gemma":[0.8383157,6.476042e-7,0.1610382,0.00053494767,0.000045645385,0.000045853467,0.000008411875,0.000007085705,0.000003499493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728274,0.000100923324,0.00027160987,0.0008754184,0.0008078594,0.00066145824],"domain_scores_gemma":[0.9986937,0.00018091746,0.00006302707,0.00083669776,0.000067306864,0.0001583215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033611706,0.00015039564,0.00016831477,0.00035390627,0.0008067674,0.0005947283,0.003971282,0.000016368418,0.000025065687],"category_scores_gemma":[0.000032816257,0.00014169027,0.000047105856,0.0018135842,0.0006734431,0.00070857425,0.0013628129,0.00018262152,0.000008930889],"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.0000061049145,0.00017930946,0.00017299804,0.0000037221666,0.0000013108448,0.000020144642,0.00032572725,0.0054253205,0.00012432797,0.96104705,0.00005447284,0.032639496],"study_design_scores_gemma":[0.0002614453,0.0003348072,0.0009792306,0.00000599085,0.0000022055747,0.000009368788,0.000040070125,0.9273008,0.00014922857,0.07024491,0.00046579028,0.00020611867],"about_ca_topic_score_codex":0.00000783875,"about_ca_topic_score_gemma":0.000001428357,"teacher_disagreement_score":0.92187554,"about_ca_system_score_codex":0.0000788922,"about_ca_system_score_gemma":0.00007778575,"threshold_uncertainty_score":0.73796964},"labels":[],"label_agreement":null},{"id":"W4250205828","doi":"10.1016/s0304-3975(04)00113-6","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Abelian group; Binary number; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250205828","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.23148263,0.000033066557,0.76372385,0.0012974993,0.00090491393,0.00011128002,6.7324754e-7,0.0001453499,0.002300754],"genre_scores_gemma":[0.91656834,0.000013765398,0.083057724,0.00026101427,0.000080070444,0.0000051930447,2.0761253e-7,0.00000846037,0.000005210734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972402,0.00018194747,0.00037785078,0.0006321409,0.00085953134,0.0007083669],"domain_scores_gemma":[0.9977956,0.0005199308,0.00012769167,0.0011372877,0.00016848068,0.00025100654],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003352275,0.00021262463,0.00020931411,0.00016928953,0.0012693673,0.00047558485,0.004168345,0.00005292693,0.000023648341],"category_scores_gemma":[0.00011172146,0.00014705896,0.00016870642,0.002112562,0.0046123797,0.0006886302,0.0013390954,0.0003094401,0.000052286447],"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.00001960305,0.00006360052,0.00008131861,0.000004627583,0.000008060892,0.00001143674,0.0010433829,0.00022836574,0.0027476957,0.98094475,0.000013132747,0.014834027],"study_design_scores_gemma":[0.0003953789,0.00024212446,0.00082534744,0.00008123122,0.00000774477,0.00006722635,0.000052943997,0.019731758,0.008495491,0.96964264,0.0001693898,0.00028874702],"about_ca_topic_score_codex":0.00000538657,"about_ca_topic_score_gemma":7.336635e-7,"teacher_disagreement_score":0.6850857,"about_ca_system_score_codex":0.00004805957,"about_ca_system_score_gemma":0.00018354115,"threshold_uncertainty_score":0.9980965},"labels":[],"label_agreement":null},{"id":"W4254341276","doi":"10.1016/j.tcs.2020.12.029","title":"Partial derivatives of regular expressions over alphabet-invariant and user-defined labels","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Regular language; Prefix; Free monoid; Regular expression; Invariant (physics); Mathematics; Bounded function; Discrete mathematics; Word (group theory); Existential quantification; Combinatorics; Set (abstract data type); Alphabet; Combinatorics on words; Automaton; Monoid; Computer science; Theoretical computer science","score_opus":0.014049410970877715,"score_gpt":0.24079460233805858,"score_spread":0.22674519136718085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254341276","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.24847151,0.000056838777,0.7483945,0.0024757069,0.00012777276,0.00010567755,0.0000036718573,0.0001346614,0.00022966872],"genre_scores_gemma":[0.8493814,0.0000064537726,0.14933595,0.0011888035,0.00007447758,0.0000037230175,4.52138e-7,0.000006828899,0.000001913661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978389,0.0001541505,0.0003188333,0.0007072174,0.000551998,0.0004288637],"domain_scores_gemma":[0.998436,0.00036943407,0.000105363884,0.00061577064,0.00009053119,0.00038290385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422532,0.00018417944,0.00028979094,0.0000790221,0.00025026064,0.00022896635,0.0017332137,0.000050920196,0.000053945932],"category_scores_gemma":[0.00017737827,0.00014142386,0.000052663105,0.00084367016,0.0026384233,0.00073891017,0.0018109658,0.00014137484,0.000010507342],"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.00001045763,0.000038383107,0.00009298065,0.000011865529,0.0000054169514,0.0000098770815,0.0010975493,0.000027040118,0.045275632,0.9478065,0.000087238324,0.00553711],"study_design_scores_gemma":[0.0006299923,0.0004407988,0.0051799393,0.00009311201,0.000010520857,0.000017384315,0.000030846142,0.7074733,0.13429658,0.15109937,0.00036032384,0.00036786695],"about_ca_topic_score_codex":0.0000021476872,"about_ca_topic_score_gemma":5.0537995e-8,"teacher_disagreement_score":0.7967071,"about_ca_system_score_codex":0.000010464055,"about_ca_system_score_gemma":0.00007603824,"threshold_uncertainty_score":0.97213805},"labels":[],"label_agreement":null},{"id":"W4256357822","doi":"10.1016/s0304-3975(04)00121-5","title":"The generalized Weil pairing and the discrete logarithm problem on elliptic curves","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Mathematics; Elliptic curve; Pairing; Logarithm; TRACE (psycholinguistics); Generalization; Reduction (mathematics); Modulo; Edwards curve; Discrete mathematics; Pure mathematics; Simple (philosophy); Finite field; Combinatorics; Schoof's algorithm; Mathematical analysis; Computer science; Public-key cryptography; Quarter period; Geometry; Physics","score_opus":0.0056954008353222035,"score_gpt":0.22177431581755602,"score_spread":0.2160789149822338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256357822","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.015028136,0.0011573127,0.947245,0.033742867,0.0004245602,0.00046942264,6.3859017e-7,0.00016744931,0.0017646423],"genre_scores_gemma":[0.93503916,0.00046337539,0.062097006,0.002265303,0.000092618226,0.000024361221,1.90231e-7,0.0000075029643,0.000010507152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974767,0.0002428229,0.00027614058,0.0006339016,0.00075257866,0.00061787275],"domain_scores_gemma":[0.99789125,0.0008089339,0.00007447018,0.0009415981,0.000094215444,0.00018951796],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0028727008,0.0002083664,0.00020524948,0.00009002465,0.0017312735,0.00091495266,0.0025746294,0.000036603036,0.000002814344],"category_scores_gemma":[0.00008773518,0.0000943956,0.00010569605,0.0010378483,0.009404722,0.00031848325,0.0010421376,0.00030804134,0.000019465037],"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.000018115012,0.0000217472,0.000010538485,0.000010207262,0.0000073495785,0.0000065776844,0.00036982182,0.00046195075,0.000028187567,0.98458445,0.000021361318,0.014459709],"study_design_scores_gemma":[0.0012218392,0.00021083638,0.0007616301,0.00018387173,0.000012263818,0.00007723292,0.000009438137,0.1348934,0.0009081415,0.86121696,0.0002745217,0.00022983823],"about_ca_topic_score_codex":0.000012876565,"about_ca_topic_score_gemma":0.00000282085,"teacher_disagreement_score":0.920011,"about_ca_system_score_codex":0.000028126473,"about_ca_system_score_gemma":0.00009268187,"threshold_uncertainty_score":0.99956834},"labels":[],"label_agreement":null},{"id":"W4285773650","doi":"10.1016/j.tcs.2022.12.014","title":"The Maker-Breaker Largest Connected Subgraph game","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Agence Nationale de la Recherche; H2020 European Research Council; Providence Health Care; University for the Creative Arts","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Connected component; Induced subgraph; Graph; Discrete mathematics; Factor-critical graph; Planar graph; Distance-hereditary graph; Graph power; Line graph","score_opus":0.010715997083649407,"score_gpt":0.26696795117937877,"score_spread":0.2562519540957294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285773650","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.037402622,0.00015886092,0.9516558,0.005315783,0.0012558759,0.00041324258,0.000007125649,0.00045683933,0.0033338345],"genre_scores_gemma":[0.9805079,0.00001047902,0.01820152,0.001014032,0.000080042344,0.00007953137,0.0000012723664,0.000016935846,0.00008825246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994424,0.0007207812,0.00035851847,0.0010785834,0.0020414838,0.0013766582],"domain_scores_gemma":[0.9956683,0.0015012814,0.000099961006,0.0020299337,0.00029968435,0.00040086007],"candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0052033914,0.00024856225,0.00022378082,0.00029813114,0.0036828069,0.0008332814,0.00823984,0.000032494296,0.00016560663],"category_scores_gemma":[0.00025524996,0.00017763209,0.00012919445,0.0044914824,0.0063731847,0.00061577413,0.0060576834,0.0007650861,0.00010065685],"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.000028508792,0.000066540175,0.00007782404,0.000001684414,0.0000062600993,0.000040313895,0.0002513707,0.00035415104,0.0005322443,0.9775305,0.00017344182,0.020937188],"study_design_scores_gemma":[0.00035624506,0.0003812944,0.0011721787,0.000004705573,0.0000028326524,0.00019362544,0.000031746054,0.26516405,0.0012712011,0.72298265,0.008120936,0.0003185215],"about_ca_topic_score_codex":0.0000034015202,"about_ca_topic_score_gemma":0.0000013563432,"teacher_disagreement_score":0.94310534,"about_ca_system_score_codex":0.00013672542,"about_ca_system_score_gemma":0.0002569168,"threshold_uncertainty_score":0.99761426},"labels":[],"label_agreement":null},{"id":"W4286796610","doi":"10.1016/j.tcs.2023.113760","title":"A simple certifying algorithm for 3-edge-connectivity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Edge contraction; Algorithm; Connectivity; Graph; Mathematics; Computer science; Time complexity; Combinatorics; Line graph; Graph power","score_opus":0.039444340114994994,"score_gpt":0.3386094380291295,"score_spread":0.29916509791413454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286796610","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.015588062,0.0000117687805,0.9812186,0.00074307073,0.0005543155,0.0004607202,0.000007459261,0.00089815655,0.000517869],"genre_scores_gemma":[0.6734811,0.0000029239598,0.32600275,0.00025575008,0.00014753114,0.00006598221,0.000001997926,0.000015750882,0.00002619941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962273,0.00015134134,0.00026777392,0.0011606568,0.0008713993,0.0013215248],"domain_scores_gemma":[0.9963994,0.0016191705,0.00005758779,0.0011780257,0.00034194498,0.00040388768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038650015,0.00022041326,0.0002634245,0.00052148174,0.0010138851,0.00052669214,0.003620368,0.00006044588,0.000018604886],"category_scores_gemma":[0.0004343317,0.0001921925,0.00013039305,0.0043255067,0.0025790269,0.0010890118,0.0021841018,0.0002416634,0.0002118642],"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.0000048797997,0.000023938426,0.000016462278,0.0000066991784,0.0000032431883,0.00000984557,0.00023611293,0.00015824195,0.000743811,0.70188946,0.00008834056,0.296819],"study_design_scores_gemma":[0.00017907159,0.00013031783,0.0002724894,0.000006905676,0.0000012111507,0.000009815038,0.000007655462,0.54465586,0.0046385136,0.4497266,0.00021773491,0.00015381443],"about_ca_topic_score_codex":0.0000022051065,"about_ca_topic_score_gemma":5.4574656e-7,"teacher_disagreement_score":0.65789306,"about_ca_system_score_codex":0.000088433095,"about_ca_system_score_gemma":0.00015944485,"threshold_uncertainty_score":0.9502531},"labels":[],"label_agreement":null},{"id":"W4288734880","doi":"10.1016/j.tcs.2022.07.029","title":"Improved algorithms for non-submodular function maximization problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Maximization; Mathematical optimization; Monotone polygon; Mathematics; Constraint (computer-aided design); Function (biology); Greedy algorithm; Set function; Computer science; Set (abstract data type)","score_opus":0.013494570952473108,"score_gpt":0.2375044258966565,"score_spread":0.22400985494418338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288734880","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.0014058448,0.0000134401835,0.9945376,0.00091769913,0.0016453502,0.0006788152,0.000008861167,0.00028209956,0.0005102874],"genre_scores_gemma":[0.48179278,0.0000010084739,0.51731193,0.0005640984,0.00014507861,0.0001504116,0.0000059435097,0.000009990855,0.00001875075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971722,0.00009976824,0.0003247606,0.0009689602,0.0007779904,0.0006563322],"domain_scores_gemma":[0.99846673,0.00014968298,0.000111576875,0.00082669227,0.0002472941,0.000198019],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002084776,0.00020186817,0.00020827749,0.0002948568,0.0018905724,0.00045750785,0.0027620145,0.000034932982,0.00006095281],"category_scores_gemma":[0.000030187422,0.00019493808,0.0001240151,0.0019508236,0.00097453955,0.000716232,0.0020651587,0.0002597341,0.0000074204067],"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.000017494101,0.000101037745,0.0000067249334,0.000009542696,0.00000553827,0.0000018458833,0.00023839899,0.0018046178,0.0006893845,0.86569095,0.00008825602,0.1313462],"study_design_scores_gemma":[0.00032344388,0.00061654515,0.000112704576,0.0000040807604,0.0000049199953,0.000021451016,0.0000072699245,0.67459804,0.0007050456,0.32269314,0.0007215447,0.0001918413],"about_ca_topic_score_codex":0.000004245313,"about_ca_topic_score_gemma":2.442851e-7,"teacher_disagreement_score":0.6727934,"about_ca_system_score_codex":0.00012514959,"about_ca_system_score_gemma":0.00016687578,"threshold_uncertainty_score":0.99940884},"labels":[],"label_agreement":null},{"id":"W4294770181","doi":"10.1016/j.tcs.2022.08.024","title":"Flip-swap languages in binary reflected Gray code order","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Swap (finance); Prefix; Gray code; Combinatorics; Mathematics; Binary number; Arithmetic; Discrete mathematics; Computer science; Algorithm; Linguistics","score_opus":0.00985672457405275,"score_gpt":0.2807230356109046,"score_spread":0.2708663110368519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294770181","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.07698358,0.00010356339,0.9176317,0.0014769511,0.00078207935,0.00020314868,0.000012358786,0.00030798456,0.0024986302],"genre_scores_gemma":[0.8341814,0.000003730752,0.16480906,0.00087377924,0.000067878595,0.000022063181,0.000005834842,0.0000085612755,0.000027637083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969256,0.00027274058,0.0002849996,0.00089465274,0.00098421,0.0006377805],"domain_scores_gemma":[0.99838805,0.00019131218,0.00006578773,0.0010562647,0.00010529285,0.00019327537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015058807,0.00018187468,0.00021128391,0.0003526797,0.00071825285,0.0002798985,0.003793897,0.00003257111,0.00020159726],"category_scores_gemma":[0.000066976565,0.00015231421,0.00003968919,0.00326473,0.0009130723,0.00067727856,0.0050970986,0.00042919224,0.00004106286],"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.000015709811,0.00017079143,0.00012992894,0.000003547284,0.0000019515785,0.0001509861,0.0006927768,0.0018271779,0.0020301621,0.9551273,0.00046759984,0.039382096],"study_design_scores_gemma":[0.0004038724,0.0003493012,0.003284711,0.00001839697,0.0000017748227,0.000080962775,0.000037788486,0.9579932,0.00090491824,0.03459925,0.002007669,0.0003181708],"about_ca_topic_score_codex":0.00002382368,"about_ca_topic_score_gemma":0.000002640376,"teacher_disagreement_score":0.956166,"about_ca_system_score_codex":0.000121225276,"about_ca_system_score_gemma":0.00019460439,"threshold_uncertainty_score":0.7050068},"labels":[],"label_agreement":null},{"id":"W4295763127","doi":"10.1016/j.tcs.2022.09.011","title":"On invertible and stably reversible non-uniform cellular automata","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"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é de Montréal","funders":"","keywords":"Injective function; Cellular automaton; Invertible matrix; Mathematics; Equivalence (formal languages); Abelian group; Pure mathematics; Stochastic cellular automaton; Discrete mathematics; Algorithm","score_opus":0.0075284133935657705,"score_gpt":0.21716065134038054,"score_spread":0.20963223794681476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295763127","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.069309495,0.000014109199,0.9227769,0.0014848121,0.00027151546,0.00021588647,0.000005455101,0.0002528206,0.0056690024],"genre_scores_gemma":[0.9358455,0.0000028451086,0.06306593,0.00095680985,0.000027997814,0.000025738003,0.0000029633593,0.000007960952,0.000064260974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761015,0.00010579917,0.00020451855,0.00077010575,0.0008163576,0.00049306516],"domain_scores_gemma":[0.9983264,0.00015618945,0.00005847411,0.0011414447,0.0000542759,0.00026316955],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017442789,0.00016014035,0.00016166226,0.00023210853,0.0014008398,0.00037645086,0.0025593755,0.000023810833,0.00011612171],"category_scores_gemma":[0.00001915748,0.00014876813,0.00004384898,0.0015350215,0.0010458251,0.00048166246,0.00325366,0.00026073604,0.00006721093],"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.0000023383031,0.000088326764,0.000008588371,0.0000052992336,0.000002123541,0.000013174787,0.00029289475,0.00044279709,0.0033140997,0.98279244,0.0004395229,0.012598391],"study_design_scores_gemma":[0.00024112314,0.00028403208,0.00015598597,0.0000066462576,0.0000031909212,0.00003443467,0.000012295453,0.8484278,0.007449651,0.14175048,0.0014371284,0.00019727887],"about_ca_topic_score_codex":0.0000071564955,"about_ca_topic_score_gemma":2.4405526e-7,"teacher_disagreement_score":0.866536,"about_ca_system_score_codex":0.000096409145,"about_ca_system_score_gemma":0.00014752231,"threshold_uncertainty_score":0.9998992},"labels":[],"label_agreement":null},{"id":"W4317933801","doi":"10.1016/j.tcs.2023.113733","title":"Wait-free approximate agreement on graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; H2020 European Research Council; H2020 Marie Skłodowska-Curie Actions; Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Combinatorics; Mathematics; Longest path problem; Pathwidth; Maximal independent set; Discrete mathematics; Lemma (botany); Impossibility; Computer science; Graph; 1-planar graph; Line graph","score_opus":0.01361083066908813,"score_gpt":0.2486185129397474,"score_spread":0.23500768227065927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317933801","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.025696088,0.000013032153,0.9543314,0.0029864335,0.0015508705,0.00028242136,0.000012535283,0.0008254467,0.0143017955],"genre_scores_gemma":[0.97779286,0.000005486549,0.021224009,0.00077917875,0.00010160607,0.00002395581,0.0000028953518,0.000008804595,0.00006120802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635637,0.00009149265,0.00034229542,0.0009909235,0.0013020125,0.0009168798],"domain_scores_gemma":[0.99719304,0.00016700882,0.000076442586,0.002064518,0.00015633313,0.00034265436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019919737,0.00023657996,0.00025059868,0.0003197267,0.0005260922,0.0006256133,0.005329793,0.0000545487,0.000025474337],"category_scores_gemma":[0.00009130709,0.00018411338,0.000099817036,0.0033594957,0.0013705427,0.0004887468,0.0019064937,0.00019915031,0.00091756374],"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.0000044902636,0.000049647228,0.000021265405,0.00000921571,0.000003855503,0.000035128764,0.00020130312,0.00033951475,0.00018672962,0.972512,0.0022816332,0.02435522],"study_design_scores_gemma":[0.00033685262,0.00024027943,0.0012349465,0.000055831686,0.0000019499746,0.000016267577,0.000007230689,0.65795356,0.0012782459,0.33749488,0.0011031011,0.00027683013],"about_ca_topic_score_codex":0.0000033930924,"about_ca_topic_score_gemma":3.6559553e-7,"teacher_disagreement_score":0.95209676,"about_ca_system_score_codex":0.000057474575,"about_ca_system_score_gemma":0.00007679136,"threshold_uncertainty_score":0.99986035},"labels":[],"label_agreement":null},{"id":"W4318973256","doi":"10.1016/j.tcs.2023.113730","title":"Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Price of anarchy; Nash equilibrium; Price of stability; Epsilon-equilibrium; Inefficiency; Best response; Minimax; Mathematical economics; Mathematical optimization; Correlated equilibrium; Risk dominance; Computer science; Mathematics; Game theory; Equilibrium selection; Economics; Repeated game; Microeconomics","score_opus":0.02193142612724938,"score_gpt":0.24288567516401713,"score_spread":0.22095424903676775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318973256","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.59412986,0.0000148648605,0.40362507,0.00035192576,0.0001344143,0.00018592515,0.000016789558,0.00003524019,0.0015059159],"genre_scores_gemma":[0.9934447,0.000006913703,0.00632513,0.0001141301,0.0000622222,0.000013648914,0.0000028712413,0.000011979662,0.000018415096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988029,0.000008664625,0.0003195622,0.0004814953,0.00005851512,0.0003288566],"domain_scores_gemma":[0.99911904,0.00034084564,0.00015053019,0.00025306677,0.000051191604,0.000085326654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013182393,0.00012178687,0.00025897205,0.00025785132,0.00017320302,0.00009463655,0.00035189703,0.000035280515,0.000014921466],"category_scores_gemma":[0.00016014214,0.00010439519,0.000038248127,0.00050241477,0.0011505494,0.00023265737,0.00016176846,0.00007792001,0.00001490598],"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.000041366686,0.00003214375,0.00037391426,0.000021727781,0.0000035680587,1.8714421e-7,0.00040559392,0.015186361,0.00023349292,0.9804163,0.000003962196,0.0032813926],"study_design_scores_gemma":[0.0003478308,0.00037846196,0.0009730308,0.00003743308,0.0000016914603,0.0000015184381,0.000024929617,0.7683005,0.001746121,0.22800021,0.0000449693,0.00014334104],"about_ca_topic_score_codex":0.00000582913,"about_ca_topic_score_gemma":2.7112713e-7,"teacher_disagreement_score":0.7531141,"about_ca_system_score_codex":0.000028267945,"about_ca_system_score_gemma":0.000029870556,"threshold_uncertainty_score":0.4257112},"labels":[],"label_agreement":null},{"id":"W4328105802","doi":"10.1016/j.tcs.2023.113830","title":"On the average complexity of partial derivative transducers","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Algebraic number; Partial derivative; Expression (computer science); Combinatorics; Discrete mathematics; Pure mathematics; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.03271519382222329,"score_gpt":0.2632422958027282,"score_spread":0.23052710198050488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328105802","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.26707163,0.0000027885383,0.7266458,0.003620696,0.00036543384,0.0001405385,0.0000036358886,0.00024353384,0.0019059331],"genre_scores_gemma":[0.99101615,0.000001917808,0.00794012,0.00097233296,0.000050460007,0.0000071628215,7.068146e-7,0.0000060614457,0.0000050871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977493,0.00021063966,0.00025409524,0.00052000233,0.00076101965,0.000504888],"domain_scores_gemma":[0.9977399,0.001052461,0.00007126093,0.0009091138,0.000092431765,0.00013480171],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021903014,0.00015647938,0.00019679955,0.00015046573,0.00042444083,0.0001710878,0.0030223462,0.000032611893,0.0000928683],"category_scores_gemma":[0.00013181705,0.00009677603,0.00009045523,0.0020786575,0.006169418,0.00029118717,0.00067171635,0.00018250966,0.00015599624],"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.000008199443,0.00003309201,0.0000051476723,0.0000037142306,0.0000043600194,0.0000067452615,0.0012021045,0.00042474436,0.0013286636,0.9900318,0.00012317485,0.0068282606],"study_design_scores_gemma":[0.00009155883,0.00012207642,0.0008195836,0.000017591809,0.0000012394918,0.0000036395288,0.00001222226,0.46844414,0.022360865,0.5080156,0.000019992938,0.000091497226],"about_ca_topic_score_codex":0.0000031795116,"about_ca_topic_score_gemma":1.5731442e-7,"teacher_disagreement_score":0.72394454,"about_ca_system_score_codex":0.000026811074,"about_ca_system_score_gemma":0.0000815083,"threshold_uncertainty_score":0.99653524},"labels":[],"label_agreement":null},{"id":"W4372233695","doi":"10.1016/j.tcs.2023.113936","title":"A refinement on the structure of vertex-critical (P5, gem)-free graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; The King's University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Induced subgraph; Mathematics; Discrete mathematics; Chordal graph; Computer science; Graph","score_opus":0.019315533797664167,"score_gpt":0.3026259989599015,"score_spread":0.28331046516223735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372233695","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.22223455,0.000028044737,0.7542048,0.018020134,0.0012259114,0.00052860525,0.000025970938,0.0005180755,0.0032139244],"genre_scores_gemma":[0.9727681,0.0000059490153,0.026384737,0.0007719176,0.000038416896,0.0000069436414,7.21862e-7,0.0000115543435,0.000011642023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956943,0.00030332006,0.0003468761,0.0008566383,0.0018564491,0.000942458],"domain_scores_gemma":[0.9943112,0.0024499306,0.000058462254,0.002590075,0.00031140907,0.0002788869],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021633508,0.00022908466,0.00025301563,0.0004645176,0.00059198163,0.00024204711,0.007420274,0.00005986494,0.000103561135],"category_scores_gemma":[0.0013282662,0.00014236217,0.00011471908,0.004615312,0.007210686,0.0003630575,0.003391585,0.00044358923,0.000106005136],"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.000019751518,0.000041306026,0.00001766284,0.000011039447,0.0000055772894,0.000017401537,0.00025567354,0.00015990374,0.004866818,0.9847247,0.00043044487,0.009449731],"study_design_scores_gemma":[0.00017876731,0.00036676868,0.0006084972,0.000040128987,0.0000026098471,0.000012505375,0.000013007028,0.12556691,0.017651752,0.85533446,0.000068755064,0.00015585791],"about_ca_topic_score_codex":0.0000016938002,"about_ca_topic_score_gemma":7.63206e-7,"teacher_disagreement_score":0.7505336,"about_ca_system_score_codex":0.000043918553,"about_ca_system_score_gemma":0.00012774488,"threshold_uncertainty_score":0.9979501},"labels":[],"label_agreement":null},{"id":"W4379614944","doi":"10.1016/j.tcs.2023.113999","title":"The nondeterministic state complexity of the site-directed deletion language operation","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Nondeterministic algorithm; Upper and lower bounds; Deterministic finite automaton; String (physics); Combinatorics; Nondeterministic finite automaton; Finite-state machine; Mathematics; Regular language; Prefix; Discrete mathematics; Computer science; Automaton; Algorithm; Data structure; Theoretical computer science; Automata theory; Programming language","score_opus":0.014637803432919032,"score_gpt":0.2707185309608592,"score_spread":0.25608072752794014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379614944","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.9825017,0.00001534914,0.016277134,0.00035759696,0.00021941669,0.000115739014,0.0000059878303,0.000037607642,0.0004694599],"genre_scores_gemma":[0.99882364,0.000005607863,0.0008658156,0.0001794383,0.00007864545,0.000002303104,0.000009287616,0.0000033959338,0.000031865453],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990418,0.00013935765,0.00015170359,0.00023604088,0.0001986518,0.00023246052],"domain_scores_gemma":[0.9994325,0.00007978784,0.000048729897,0.00030921728,0.0000866708,0.000043101223],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00081578654,0.00007472815,0.00007119767,0.000016290483,0.00043218982,0.00006410355,0.000506478,0.000030985928,0.0000053859044],"category_scores_gemma":[0.0001903129,0.00003681251,0.0000471087,0.00033259546,0.0027359456,0.0000025792265,0.00056706916,0.00007020466,0.000014277056],"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.00005759552,0.00003568044,0.00079944293,0.000009458188,0.000007886626,0.0000025238742,0.00022936882,0.0005662663,0.8637069,0.10638185,0.00022584939,0.027977196],"study_design_scores_gemma":[0.00034650118,0.00063476356,0.074667655,0.000030165827,0.000010603541,0.000018396015,0.000044417688,0.5090282,0.39517805,0.019010572,0.0007472508,0.00028340577],"about_ca_topic_score_codex":0.000004402233,"about_ca_topic_score_gemma":0.0000057238353,"teacher_disagreement_score":0.50846195,"about_ca_system_score_codex":0.000006909464,"about_ca_system_score_gemma":0.000037984242,"threshold_uncertainty_score":0.99997807},"labels":[],"label_agreement":null},{"id":"W4379619578","doi":"10.1016/j.tcs.2023.113981","title":"The road problem and homomorphisms of directed graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Generalization; Mathematics; Property (philosophy); Graph; Combinatorics; Product (mathematics); Graph theory; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.008747850501502908,"score_gpt":0.23457104465007958,"score_spread":0.22582319414857668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379619578","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.1622026,0.00013339703,0.8309558,0.0019621083,0.0004806247,0.0002644466,0.0000013649916,0.00071097794,0.0032886576],"genre_scores_gemma":[0.9514755,0.000044583623,0.048326682,0.000105856256,0.000019938954,0.000007635388,2.5834322e-7,0.0000041228695,0.000015397065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998306,0.00007979526,0.00021720359,0.00045592844,0.0004753536,0.00046576496],"domain_scores_gemma":[0.99865943,0.0004088935,0.000066446475,0.0005872124,0.00013106984,0.00014691922],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012111006,0.00011886033,0.0001491862,0.0001332717,0.0005841748,0.0002062476,0.0017770428,0.00002787944,0.000002834283],"category_scores_gemma":[0.00007659689,0.00007116393,0.00003875106,0.002417692,0.0042735804,0.00033217928,0.0011427762,0.00011860342,0.00002234825],"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.0000024149513,0.000009692285,0.000044203472,0.0000033069423,0.0000019338806,0.000004866904,0.00018064043,0.000036238318,0.00042501552,0.9124225,0.000026846064,0.08684236],"study_design_scores_gemma":[0.000093056566,0.000111063935,0.0046796664,0.000011861453,0.0000015265045,0.00001591313,0.00000561146,0.2320978,0.0010496553,0.76177686,0.00006342966,0.00009355171],"about_ca_topic_score_codex":0.0000016421602,"about_ca_topic_score_gemma":3.861669e-7,"teacher_disagreement_score":0.7892729,"about_ca_system_score_codex":0.000009844878,"about_ca_system_score_gemma":0.000051007675,"threshold_uncertainty_score":0.9984362},"labels":[],"label_agreement":null},{"id":"W4382933733","doi":"10.1016/j.tcs.2023.114059","title":"On the g-extra connectivity of augmented cubes","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Hypercube; Social connectedness; Upper and lower bounds; Graph; Discrete mathematics; Graph power; Connected component; Hypercube graph; Line graph","score_opus":0.018132900117005232,"score_gpt":0.25192517906498535,"score_spread":0.2337922789479801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382933733","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.27638796,0.0000039080332,0.71536434,0.0020147006,0.0011084847,0.00015017946,9.786036e-7,0.00020496383,0.0047644554],"genre_scores_gemma":[0.9981473,0.0000018129977,0.001230664,0.0004872938,0.000090085676,0.000009488042,2.261168e-7,0.000004782512,0.000028311773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979888,0.0002152257,0.00025729262,0.00046682596,0.0006565693,0.00041528215],"domain_scores_gemma":[0.9974729,0.001343,0.00007602567,0.00083190436,0.00017343069,0.000102743244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883812,0.00012784141,0.00017990705,0.00017901583,0.00040022194,0.00021414897,0.0020543358,0.000036660567,0.000047851412],"category_scores_gemma":[0.00018176794,0.00007626572,0.000082753904,0.0020911957,0.0015400468,0.00025169892,0.00062331336,0.00016495991,0.00017762482],"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.0000050395133,0.000028066832,0.00002662231,0.0000034264756,0.000004347302,0.000004321846,0.0003104584,0.0011061311,0.0004659271,0.9920314,0.0006872949,0.0053269416],"study_design_scores_gemma":[0.000090941874,0.00019952355,0.0011375835,0.0000386697,0.0000012344937,0.00001327478,0.000014689876,0.82331187,0.0036981541,0.17130399,0.00009580761,0.00009426926],"about_ca_topic_score_codex":0.0000055304195,"about_ca_topic_score_gemma":6.4381373e-7,"teacher_disagreement_score":0.8222057,"about_ca_system_score_codex":0.000031966138,"about_ca_system_score_gemma":0.000057632413,"threshold_uncertainty_score":0.5674367},"labels":[],"label_agreement":null},{"id":"W4384937916","doi":"10.1016/j.tcs.2023.114078","title":"On Simon's congruence closure of a string","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Ministry of Science, ICT and Future Planning","keywords":"Alphabet; Congruence (geometry); Mathematics; Combinatorics; String (physics); Closure (psychology); Regular language; Discrete mathematics; Computer science; Automaton; Linguistics; Theoretical computer science","score_opus":0.009520618453839953,"score_gpt":0.24837631272311528,"score_spread":0.23885569426927533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384937916","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.45532864,0.0000078662715,0.54138386,0.0005250736,0.0004995035,0.00009905482,0.0000023279972,0.0004270534,0.0017265839],"genre_scores_gemma":[0.9826476,0.000003776005,0.016955396,0.00031774084,0.000052248324,0.00000397123,5.498905e-7,0.0000071976783,0.000011543199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757844,0.000088599496,0.0002721661,0.0006501497,0.0008396048,0.0005710117],"domain_scores_gemma":[0.99784005,0.0007391008,0.00008380139,0.0010047234,0.00013879641,0.00019353162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018569031,0.00016315067,0.00022329553,0.0003217537,0.00023585938,0.00019994372,0.0030813625,0.000046375684,0.000025726065],"category_scores_gemma":[0.00019028124,0.00013048823,0.00007615346,0.0026735892,0.0020431646,0.0004595241,0.0011731808,0.00017018757,0.00017108287],"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.000005090646,0.000029756253,0.00015863874,0.0000082453325,0.0000026493562,0.000021449896,0.00020326192,0.0004885582,0.0010041863,0.98024213,0.000116799914,0.017719245],"study_design_scores_gemma":[0.00016748816,0.00023383978,0.0017519067,0.000061579645,0.0000018038974,0.000006582067,0.000011433599,0.5033423,0.014592798,0.47963104,0.00003530405,0.0001639804],"about_ca_topic_score_codex":0.0000027108683,"about_ca_topic_score_gemma":2.2742529e-7,"teacher_disagreement_score":0.5273189,"about_ca_system_score_codex":0.000029320885,"about_ca_system_score_gemma":0.00008588437,"threshold_uncertainty_score":0.7528125},"labels":[],"label_agreement":null},{"id":"W4384938342","doi":"10.1016/j.tcs.2023.114076","title":"Approximate NFA universality and related problems motivated by information theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Universality (dynamical systems); Mathematics; Discrete mathematics; Automaton; Combinatorics; Computer science; Theoretical computer science","score_opus":0.005101673044156291,"score_gpt":0.2008103065029248,"score_spread":0.19570863345876852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384938342","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.11329735,0.000021993314,0.8803579,0.0010207493,0.00034717974,0.0002436584,0.000007056715,0.0012366986,0.0034673985],"genre_scores_gemma":[0.9920061,0.000015761878,0.007559287,0.0003484119,0.000013235621,0.000005839475,0.000010851323,0.000006736309,0.000033746517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786425,0.00020487458,0.00031571233,0.0005118139,0.00053091894,0.00057244045],"domain_scores_gemma":[0.99859077,0.00031516675,0.000099038145,0.00064046256,0.00011824523,0.000236296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034388902,0.00018747099,0.00018469505,0.00026774989,0.0004541213,0.0005759192,0.0015769902,0.000075738004,0.000028079938],"category_scores_gemma":[0.00010973585,0.00015134302,0.000038176586,0.0023987633,0.00225754,0.0024401918,0.0013383736,0.00019746397,0.00016196592],"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.0000034311217,0.000016459266,0.000024367111,0.000014012669,0.000004965562,0.00000311615,0.0012855865,0.000096045704,0.00074543833,0.96156025,0.0002040295,0.036042325],"study_design_scores_gemma":[0.00020431496,0.000060317747,0.0006816283,0.000021850223,0.0000025268153,0.000019787658,0.000029952142,0.5449545,0.0010663042,0.45265102,0.00014833466,0.00015947272],"about_ca_topic_score_codex":0.0000033161648,"about_ca_topic_score_gemma":3.5262037e-8,"teacher_disagreement_score":0.8787088,"about_ca_system_score_codex":0.00004449587,"about_ca_system_score_gemma":0.000059041067,"threshold_uncertainty_score":0.8318},"labels":[],"label_agreement":null},{"id":"W4386071077","doi":"10.1016/j.tcs.2023.114138","title":"An integer linear programming approach to solving the Eternity Puzzle","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Image Processing and 3D Reconstruction","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eternity; Mathematics; Integer (computer science); Linear programming; Integer programming; Set (abstract data type); MATLAB; Algorithm; Computer science; Discrete mathematics; Programming language","score_opus":0.017190002250847543,"score_gpt":0.2769978860806397,"score_spread":0.25980788382979214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386071077","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.03646462,0.000005235721,0.9592879,0.000980607,0.00072438084,0.00018560282,3.4394887e-7,0.0006991368,0.0016521905],"genre_scores_gemma":[0.66376424,4.780601e-7,0.3357329,0.00029928383,0.00016964349,0.000014186099,5.655084e-7,0.000006154778,0.000012524376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976336,0.00013673205,0.00021396932,0.0007486216,0.0006064469,0.0006606391],"domain_scores_gemma":[0.9984932,0.00012563728,0.00004832358,0.0008640111,0.00019959251,0.00026924646],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002766399,0.00015681444,0.00013896642,0.00022529135,0.0012033251,0.0012627711,0.0031052406,0.000043299282,0.0000032425444],"category_scores_gemma":[0.00012302614,0.00010067109,0.000049774393,0.0027313125,0.001652054,0.0009604889,0.0010085526,0.00028815237,0.00015655109],"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.0000033972317,0.00005828855,0.0000619985,0.000011093009,0.0000024325643,0.0000037215757,0.0030243914,0.0012603948,0.0005375587,0.49023652,0.000048028505,0.50475216],"study_design_scores_gemma":[0.00006177883,0.000095341,0.00028403403,0.00002034426,0.0000022910535,0.0000667982,0.00006663287,0.98002946,0.0022404564,0.016710905,0.0002494526,0.00017249215],"about_ca_topic_score_codex":0.000004765275,"about_ca_topic_score_gemma":4.454822e-7,"teacher_disagreement_score":0.97876906,"about_ca_system_score_codex":0.000034177636,"about_ca_system_score_gemma":0.0001203884,"threshold_uncertainty_score":0.99977404},"labels":[],"label_agreement":null},{"id":"W4386376648","doi":"10.1016/j.tcs.2023.114161","title":"Communication costs in a geometric communication network","year":2023,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geometric networks; Convex hull; Mathematics; Asynchronous communication; Node (physics); Upper and lower bounds; Topology (electrical circuits); Computer science; Euclidean geometry; Graph; Discrete mathematics; Combinatorics; Theoretical computer science; Regular polygon; Graph theory; Geometry; Computer network","score_opus":0.01940915620891267,"score_gpt":0.2756832360992582,"score_spread":0.25627407989034556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386376648","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.037740614,0.00020937144,0.95175916,0.003072082,0.0004029687,0.00028133148,0.0000011517645,0.0006409311,0.0058924155],"genre_scores_gemma":[0.83114433,0.000108606895,0.16829261,0.0003777153,0.00004041842,0.000018199838,0.00000434888,0.00000614052,0.000007648836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973577,0.00034506596,0.00036347288,0.0005524543,0.0006707303,0.0007105483],"domain_scores_gemma":[0.99648464,0.0010243191,0.00008379475,0.0020779823,0.00015782386,0.0001714723],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0044335895,0.00015727531,0.00020902141,0.00083131116,0.0007026302,0.0005025585,0.005692104,0.00005878895,0.000019703773],"category_scores_gemma":[0.0001673122,0.00015108501,0.000058155896,0.014317143,0.0021724715,0.00083342317,0.003569302,0.00037057616,0.0002120069],"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.0000023239427,0.000041882988,0.00033773624,0.000002660292,0.0000015258486,0.0000043885766,0.0002684264,0.0013356695,0.00000879366,0.90926117,0.000282636,0.088452816],"study_design_scores_gemma":[0.00016551104,0.00004421495,0.016181145,0.000051675437,0.0000010011619,0.000009117546,0.000007814865,0.61416423,0.00006658604,0.36892983,0.00022949956,0.00014937582],"about_ca_topic_score_codex":0.000027547732,"about_ca_topic_score_gemma":0.000012353248,"teacher_disagreement_score":0.7934037,"about_ca_system_score_codex":0.00013305139,"about_ca_system_score_gemma":0.00008869633,"threshold_uncertainty_score":0.99968755},"labels":[],"label_agreement":null},{"id":"W4386573223","doi":"10.1016/j.tcs.2023.114144","title":"Quantitative estimates for the size of an intersection of sparse automatic sets","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intersection (aeronautics); Extension (predicate logic); Bounded function; Automaton; Mathematics; Natural number; Cellular automaton; Discrete mathematics; Fully automatic; Algorithm; Combinatorics; Computer science; Theoretical computer science","score_opus":0.025482411979982925,"score_gpt":0.3108738027439796,"score_spread":0.28539139076399667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386573223","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.35766777,0.000010813912,0.6413039,0.00025709294,0.00035685886,0.00017793552,0.0000038904345,0.00015530332,0.00006641884],"genre_scores_gemma":[0.7931552,0.0000010860084,0.20674492,0.000064127016,0.000015891981,0.000011464119,6.119674e-7,0.0000051737447,0.0000015315528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998501,0.00008363907,0.0003155997,0.00037135844,0.00041102796,0.00031738312],"domain_scores_gemma":[0.99539626,0.003505162,0.00014406283,0.00067852,0.00019484614,0.00008118166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024632355,0.000121307974,0.00021746742,0.00014423074,0.00021594275,0.00010954551,0.0020200685,0.000029912226,0.000013135302],"category_scores_gemma":[0.0005007966,0.000077931865,0.000077840785,0.0013588218,0.0023905884,0.0005326798,0.0005419558,0.000071051625,0.00001178955],"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.000011694594,0.000041782383,0.000011257714,0.000028527702,0.000008507928,0.0000012210475,0.0015399464,0.00081744324,0.0042533334,0.95195836,0.00002238053,0.04130555],"study_design_scores_gemma":[0.00011048017,0.00042152777,0.002090477,0.000038948303,0.000006727981,0.000006904339,0.00008362637,0.68922126,0.015989678,0.29196146,0.0000015200611,0.000067365865],"about_ca_topic_score_codex":0.0000065815916,"about_ca_topic_score_gemma":7.6038015e-7,"teacher_disagreement_score":0.68840384,"about_ca_system_score_codex":0.000019305644,"about_ca_system_score_gemma":0.00007791841,"threshold_uncertainty_score":0.8808223},"labels":[],"label_agreement":null},{"id":"W4386786301","doi":"10.1016/j.tcs.2023.114186","title":"The one-visibility localization game","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Visibility; Isoperimetric inequality; Constant (computer programming); Multiplicative function; Discrete mathematics; Tree (set theory); Treewidth; Order (exchange); Computer science; Pathwidth; Mathematical analysis; Graph","score_opus":0.02531236495019715,"score_gpt":0.317641038245972,"score_spread":0.29232867329577483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386786301","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.010470748,0.000021009419,0.983968,0.0025167305,0.0004935811,0.00024377949,7.802252e-7,0.000653677,0.001631667],"genre_scores_gemma":[0.9818363,0.000021709811,0.017667053,0.00031881008,0.000086119384,0.00001641147,7.244164e-7,0.000009050666,0.000043772445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625665,0.00030168437,0.0002846905,0.00084045256,0.0013507573,0.00096577883],"domain_scores_gemma":[0.9963829,0.0012018473,0.000053509724,0.0017287055,0.00034117192,0.00029186084],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0056995573,0.00015098875,0.00014555175,0.00022345092,0.0013063095,0.0008325085,0.004852795,0.000042431322,0.000014700603],"category_scores_gemma":[0.0005626929,0.00010232455,0.00006625416,0.005442381,0.006162381,0.00080312917,0.002478421,0.00025733424,0.0005596133],"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.0000071449326,0.000019521798,0.00006059272,0.0000031725253,0.0000021126525,0.000004857071,0.00021718728,0.0009557446,0.00020294783,0.93393075,0.00005747606,0.06453847],"study_design_scores_gemma":[0.00006497459,0.000059848408,0.00091034046,0.0000059698955,6.126348e-7,0.0000037545428,0.000004504964,0.4896726,0.0012532166,0.5076005,0.00033937563,0.00008432562],"about_ca_topic_score_codex":0.0000012011943,"about_ca_topic_score_gemma":8.541923e-7,"teacher_disagreement_score":0.9713656,"about_ca_system_score_codex":0.000076731965,"about_ca_system_score_gemma":0.00015137314,"threshold_uncertainty_score":0.99999386},"labels":[],"label_agreement":null},{"id":"W4387618924","doi":"10.1016/j.tcs.2023.114254","title":"A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; China Scholarship Council; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Combinatorics; Cardinality (data modeling); Approximation algorithm; Discrete mathematics; Infimum and supremum; Monotone polygon; Monotonic function; Maximization; Algorithm; Mathematical optimization; Computer science","score_opus":0.0218563223892489,"score_gpt":0.2614628641893752,"score_spread":0.2396065418001263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387618924","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.036829785,0.0000046534824,0.96034455,0.0010780693,0.0005416049,0.0005876233,0.000015297386,0.00031522513,0.00028321793],"genre_scores_gemma":[0.5785441,0.0000030707338,0.42097947,0.00031280424,0.0000955718,0.000037099213,0.000006092095,0.00000973806,0.000012093587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975232,0.00010539996,0.0002937361,0.0009031079,0.0006304947,0.0005440694],"domain_scores_gemma":[0.9980291,0.00078001164,0.00010232019,0.00063164317,0.00025138655,0.0002055407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013124774,0.00023367126,0.00025251662,0.00033667104,0.0006950004,0.00071121886,0.0011193801,0.00007723595,0.000006969919],"category_scores_gemma":[0.00021063091,0.00020669412,0.00007556373,0.0017570741,0.0013491532,0.0009982556,0.0007371073,0.00019445088,0.000024437202],"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.0000064530377,0.00009273288,0.000008763367,0.000014921415,0.0000050780513,0.0000023591479,0.00076691207,0.00035447438,0.0006518798,0.70336103,0.000027030886,0.29470834],"study_design_scores_gemma":[0.00026293943,0.0002924964,0.0007509419,0.000022343607,0.0000035648761,0.000005410014,0.000008308043,0.727645,0.00953648,0.26124036,0.000039212344,0.00019295157],"about_ca_topic_score_codex":0.0000033151239,"about_ca_topic_score_gemma":7.905118e-7,"teacher_disagreement_score":0.7272905,"about_ca_system_score_codex":0.00008162245,"about_ca_system_score_gemma":0.00007426095,"threshold_uncertainty_score":0.84287417},"labels":[],"label_agreement":null},{"id":"W4388906604","doi":"10.1016/j.tcs.2023.114313","title":"Deterministic rendezvous in infinite trees","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Rendezvous; Computer science; Combinatorics; Node (physics); Tree (set theory); Mathematics; Discrete mathematics; Time complexity; Graph; Binary logarithm; Set (abstract data type); Algorithm","score_opus":0.02155835231924106,"score_gpt":0.28771762123303984,"score_spread":0.26615926891379876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388906604","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.018276082,0.0000054371644,0.97198355,0.0017843487,0.00041223722,0.00015784708,8.9053475e-7,0.00050847,0.006871147],"genre_scores_gemma":[0.9416544,0.000010692155,0.057790477,0.00044012675,0.000037888716,0.000010507988,9.38257e-7,0.0000059878744,0.000048992333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772495,0.000117179465,0.00027048143,0.00058777124,0.0006396856,0.00065991044],"domain_scores_gemma":[0.9986596,0.00033376817,0.000035446865,0.00064281863,0.00009564653,0.00023273623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017179069,0.00012716588,0.00015547678,0.0006091697,0.00022209634,0.00045728555,0.0021624651,0.00004015776,0.000033892407],"category_scores_gemma":[0.00019002905,0.00010857065,0.000035731486,0.004257944,0.0013521509,0.0005522947,0.0011545868,0.00017791922,0.00043230722],"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.000002249699,0.000024876394,0.00015070799,0.000003577258,6.85928e-7,0.00005349753,0.0005788797,0.004709694,0.0001067827,0.95137024,0.00006522317,0.042933576],"study_design_scores_gemma":[0.00018806348,0.00010897034,0.0043568015,0.00001900906,4.802757e-7,0.000013384108,0.000004698638,0.88540596,0.00016176912,0.109445125,0.00015716445,0.00013855251],"about_ca_topic_score_codex":0.0000027366825,"about_ca_topic_score_gemma":0.0000030304648,"teacher_disagreement_score":0.9233783,"about_ca_system_score_codex":0.000042292177,"about_ca_system_score_gemma":0.00014611139,"threshold_uncertainty_score":0.5556579},"labels":[],"label_agreement":null},{"id":"W4389719752","doi":"10.1016/j.tcs.2023.114343","title":"A note on the Lie complexity and beyond","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Simple Lie group; Lie theory; Representation of a Lie group; Adjoint representation of a Lie algebra; Prefix; Algebra over a field; Discrete mathematics; Pure mathematics; Lie group; Lie conformal algebra; Linguistics; Philosophy","score_opus":0.02409785001389637,"score_gpt":0.2646157875610625,"score_spread":0.24051793754716616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389719752","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.17320918,0.000014292694,0.7898198,0.026612803,0.0006616799,0.00021215477,0.0000033721328,0.00073088444,0.008735847],"genre_scores_gemma":[0.9743629,0.0000057304014,0.020977825,0.0045275316,0.000094012285,0.000006963427,4.7913e-7,0.0000065066542,0.000018040866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997883,0.00013287511,0.00016965633,0.0006357102,0.0006289521,0.00054976495],"domain_scores_gemma":[0.9976858,0.0010683385,0.000041028045,0.0009501834,0.000059987433,0.0001947001],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024244958,0.0001611833,0.00015163326,0.00015354776,0.00076860597,0.0006017765,0.002468853,0.00003499023,0.000031535317],"category_scores_gemma":[0.00012656182,0.00009690671,0.00004452017,0.0016254914,0.004533845,0.00032700383,0.001810092,0.00021027346,0.00038749547],"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.0000028442105,0.000016366395,0.000006570012,0.0000022595561,0.0000014628502,0.000011375067,0.0005033686,0.000010373495,0.0002684161,0.9627701,0.00042236468,0.035984498],"study_design_scores_gemma":[0.00006631067,0.00008726135,0.0013658106,0.000010152135,0.000001029571,0.000015241163,0.000007650916,0.42181307,0.0009030102,0.57541466,0.00021511775,0.000100719786],"about_ca_topic_score_codex":0.0000014134414,"about_ca_topic_score_gemma":3.0949707e-7,"teacher_disagreement_score":0.8011537,"about_ca_system_score_codex":0.000023273655,"about_ca_system_score_gemma":0.000052886644,"threshold_uncertainty_score":0.99817526},"labels":[],"label_agreement":null},{"id":"W4390338595","doi":"10.1016/j.tcs.2023.114363","title":"Proving properties of some greedily-defined integer recurrences via automata theory","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Simple (philosophy); Conjecture; Automaton; Integer (computer science); Property (philosophy); Sequence (biology); Integer sequence; Discrete mathematics; Mathematics; Automata theory; Computer science; Combinatorics; Integer programming; Algorithm; Theoretical computer science; Generating function; Programming language","score_opus":0.01861407997515179,"score_gpt":0.2358628531487552,"score_spread":0.21724877317360342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390338595","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.2379868,0.00013505768,0.75606775,0.0012655732,0.0018703792,0.0003061307,0.0000037544726,0.0013475304,0.0010170459],"genre_scores_gemma":[0.9817321,0.000014873086,0.017714808,0.00029620712,0.000179775,0.000018621808,0.0000012400209,0.000014320328,0.000028094491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964058,0.0002707084,0.0005280762,0.00091426424,0.001056526,0.0008246377],"domain_scores_gemma":[0.9976588,0.0004633383,0.00017106796,0.0012573688,0.00022304112,0.00022639817],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0047584632,0.00028206338,0.00038030007,0.00049965625,0.00039759532,0.00036931134,0.0045758854,0.00007541631,0.000023260525],"category_scores_gemma":[0.00033805103,0.00019849613,0.00011523583,0.002534784,0.0045313155,0.00161776,0.0026830048,0.00024540894,0.00021779553],"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.000013324015,0.000055899654,0.00003595776,0.00004219951,0.000006808978,0.000010376627,0.0011235595,0.00004470755,0.011070911,0.91325754,0.000059636397,0.074279055],"study_design_scores_gemma":[0.00015263626,0.0001865228,0.0004023238,0.00015659536,0.0000051823513,0.000025296958,0.000033464366,0.49926955,0.022292567,0.47718826,0.00003939015,0.00024822436],"about_ca_topic_score_codex":0.000006349661,"about_ca_topic_score_gemma":2.8116943e-7,"teacher_disagreement_score":0.74374527,"about_ca_system_score_codex":0.00004268608,"about_ca_system_score_gemma":0.00022432218,"threshold_uncertainty_score":0.99817777},"labels":[],"label_agreement":null},{"id":"W4391247836","doi":"10.1016/j.tcs.2024.114416","title":"Edge searching and fast searching with constraints","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; City University of Hong Kong; Glaucoma Research Foundation","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Combinatorics; Algorithm; Artificial intelligence","score_opus":0.009893848445170378,"score_gpt":0.2657364047234484,"score_spread":0.255842556278278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391247836","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.056750905,0.000092774055,0.9381527,0.0013863313,0.00031139876,0.000109682594,0.00000124291,0.00021389322,0.0029810895],"genre_scores_gemma":[0.81551576,0.0000037781401,0.1841266,0.0002044154,0.00012470885,0.0000028122013,7.706099e-7,0.000004834618,0.000016305094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980766,0.000087890694,0.00014056094,0.0006650281,0.000636028,0.00039385],"domain_scores_gemma":[0.9989703,0.00038957092,0.000015635062,0.00027109685,0.000103512684,0.0002498315],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014493541,0.00012995042,0.00010914972,0.00029875172,0.0004464048,0.0016203342,0.0007224897,0.000022758564,0.000021845119],"category_scores_gemma":[0.000034802804,0.0000957964,0.000023593846,0.0012425411,0.0023913367,0.0009251528,0.00063035596,0.00024456214,0.000034398803],"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.0000020454208,0.000008291531,0.000011747696,0.0000126180685,0.0000033461936,0.000027062595,0.0005650379,0.0005855492,0.00051547086,0.7076454,0.000011783776,0.2906116],"study_design_scores_gemma":[0.00009140938,0.00015407287,0.0005818488,0.00008148813,0.0000025726888,0.00028652474,0.000008915379,0.9148318,0.0013631348,0.0822822,0.00016748322,0.00014855292],"about_ca_topic_score_codex":0.0000013593665,"about_ca_topic_score_gemma":3.6319074e-7,"teacher_disagreement_score":0.91424626,"about_ca_system_score_codex":0.0000340759,"about_ca_system_score_gemma":0.00026519634,"threshold_uncertainty_score":0.99941605},"labels":[],"label_agreement":null},{"id":"W4392066353","doi":"10.1016/j.tcs.2024.114421","title":"The compatibility of the minimalist foundation with homotopy type theory","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","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":"Canadian Mennonite University; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Constructive; Axiom; Mathematics; Extensional definition; Constructive set theory; Type theory; Extensionality; Foundations of mathematics; Mathematical proof; Type (biology); Algebra over a field; Homotopy; Axiom of choice; Foundation (evidence); Interpretation (philosophy); Pure mathematics; Calculus (dental); Set (abstract data type); Computer science; Discrete mathematics; Set theory; Mathematics education; Programming language","score_opus":0.01414369110853793,"score_gpt":0.25969898968490757,"score_spread":0.24555529857636962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392066353","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.021674937,0.00014830467,0.97036034,0.0009431725,0.0016246893,0.0003007342,3.1487897e-7,0.00014098555,0.0048065083],"genre_scores_gemma":[0.9941156,0.0000026815155,0.0056338203,0.000094320654,0.000087435634,0.000005824566,2.64864e-7,0.000005341526,0.000054701424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997979,0.00028541745,0.00024924168,0.00047917257,0.0006747762,0.00033241356],"domain_scores_gemma":[0.99782467,0.00068946014,0.000070701055,0.0010848965,0.00025043948,0.00007981374],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0032200916,0.00013022382,0.00013639951,0.000046590616,0.00061596767,0.0008591195,0.002599284,0.00003102893,0.000011202601],"category_scores_gemma":[0.00010542105,0.000055069784,0.00006241413,0.0014754055,0.0050405785,0.00033796325,0.00066079193,0.00017192197,0.000037464848],"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.000010575096,0.000021074287,0.00018897864,0.000016371052,0.0000065035993,0.0000019518327,0.0005743764,0.000014729653,0.000084358355,0.95551306,0.000026083353,0.04354194],"study_design_scores_gemma":[0.0000902439,0.00033741153,0.0031054176,0.000026045233,0.000009956556,0.000043481406,0.000025689049,0.19633293,0.0021075627,0.7953597,0.0024168852,0.00014470983],"about_ca_topic_score_codex":0.000009545242,"about_ca_topic_score_gemma":0.0000056984477,"teacher_disagreement_score":0.97244066,"about_ca_system_score_codex":0.00004670858,"about_ca_system_score_gemma":0.0002655829,"threshold_uncertainty_score":0.99766713},"labels":[],"label_agreement":null},{"id":"W4392245251","doi":"10.1016/j.tcs.2024.114469","title":"Two-stage BP maximization under p-matroid constraint","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Mathematics; Constraint (computer-aided design); Combinatorics; Monotonic function; Function (biology); Approximation algorithm; Discrete mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.016197485799270432,"score_gpt":0.274274897290326,"score_spread":0.25807741149105556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392245251","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.0028761574,0.00011390145,0.98521507,0.0024408482,0.001818835,0.00015155257,0.000005011092,0.00078707724,0.006591538],"genre_scores_gemma":[0.68627435,0.0000055494515,0.31276816,0.00076292304,0.00014641105,0.0000044068943,0.0000011661285,0.000007923726,0.000029077273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972466,0.00009807193,0.00029870923,0.00095471647,0.00078012934,0.0006217393],"domain_scores_gemma":[0.99842507,0.00030744352,0.00003511182,0.00082912535,0.00013280082,0.00027045104],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013497515,0.00021789745,0.00018716483,0.00034200458,0.0004493263,0.0017133424,0.0023108807,0.00003722198,0.0001835199],"category_scores_gemma":[0.000031469535,0.00018261849,0.00010875349,0.0020795313,0.0037590067,0.0010083101,0.0011543023,0.00030254506,0.00021362246],"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.0000014765004,0.000027561808,0.000003659245,0.000012687099,0.000005307244,0.000038476504,0.0002295909,0.0019671118,0.00034681434,0.94994205,0.000051876177,0.047373407],"study_design_scores_gemma":[0.00008749804,0.000050869527,0.00004504942,0.000035338817,0.0000026851772,0.00007120529,0.000008595244,0.5986454,0.0011018132,0.39947402,0.0003128591,0.0001646544],"about_ca_topic_score_codex":0.0000056603967,"about_ca_topic_score_gemma":0.0000010538436,"teacher_disagreement_score":0.6833982,"about_ca_system_score_codex":0.00008370593,"about_ca_system_score_gemma":0.00024177626,"threshold_uncertainty_score":0.99932295},"labels":[],"label_agreement":null},{"id":"W4392869357","doi":"10.1016/j.tcs.2024.114506","title":"Converting finite width AFAs to nondeterministic and universal finite automata","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Mathematics; Deterministic finite automaton; Multiplicative function; Finite-state machine; Discrete mathematics; Combinatorics; Deterministic automaton; ω-automaton; String (physics); Automaton; Quantum finite automata; Algorithm; Automata theory; Computer science; Mathematical analysis; Theoretical computer science","score_opus":0.008332763396113298,"score_gpt":0.24151685799936656,"score_spread":0.23318409460325326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392869357","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.029432828,0.00006651143,0.9642003,0.0022428646,0.001070983,0.00015708034,0.000005907182,0.0008185094,0.0020049934],"genre_scores_gemma":[0.9112746,0.0000058141827,0.0871994,0.00134142,0.0001238481,0.0000043691325,7.691958e-7,0.000013628133,0.000036149817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727404,0.00009755846,0.0002912315,0.0010747806,0.0005762907,0.00068609184],"domain_scores_gemma":[0.9973768,0.001225053,0.000035964575,0.00081517745,0.000077519195,0.00046948742],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014366453,0.00025058366,0.00023743013,0.00036755527,0.00038676907,0.001416113,0.0020972798,0.000056793164,0.000042562864],"category_scores_gemma":[0.00019634077,0.00020946104,0.000058326463,0.0015077968,0.0021328302,0.00094027864,0.0021865321,0.00022901697,0.00029319612],"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.000004747222,0.000016180491,0.000011666916,0.00002427345,0.0000046637333,0.00014516774,0.0010113209,0.000119039505,0.0004696637,0.8815321,0.000056566518,0.11660466],"study_design_scores_gemma":[0.0001238733,0.0002312368,0.0002579628,0.00015316902,0.0000071288136,0.00008006045,0.0000105679765,0.8660677,0.0009361424,0.13120124,0.00065157237,0.0002793635],"about_ca_topic_score_codex":0.000003452925,"about_ca_topic_score_gemma":3.1931165e-7,"teacher_disagreement_score":0.8818418,"about_ca_system_score_codex":0.000060880284,"about_ca_system_score_gemma":0.00018036239,"threshold_uncertainty_score":0.9996205},"labels":[],"label_agreement":null},{"id":"W4393132206","doi":"10.1016/j.tcs.2024.114476","title":"On the complexity of nucleolus computation for bipartite b-matching games","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Matching (statistics); Mathematics; Complement (music); Computation; Discrete mathematics; 3-dimensional matching; Bounded function; Simple (philosophy); Time complexity; Algorithm; Graph","score_opus":0.062216164890382175,"score_gpt":0.2716958774834759,"score_spread":0.20947971259309373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393132206","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.30086985,0.00007953486,0.692304,0.001314889,0.0007176957,0.00019046674,0.000027731397,0.00005657881,0.00443924],"genre_scores_gemma":[0.9954339,0.0000010461384,0.0042216657,0.00021045844,0.000099258505,0.000007470531,0.0000011862419,0.000009005697,0.00001599519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989672,0.00003890936,0.00035508617,0.00033734768,0.00007229864,0.00022921505],"domain_scores_gemma":[0.9987605,0.0008360735,0.000091745176,0.00022356797,0.000038419657,0.000049693197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035899,0.00009136341,0.0002024152,0.00013066121,0.0002148227,0.00019821952,0.0004334607,0.000026338856,0.0000681528],"category_scores_gemma":[0.00013211691,0.00006740331,0.000087544555,0.00038332812,0.0024086803,0.00012455278,0.00009067575,0.00010138545,0.00014055299],"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.000010270824,0.000020208869,0.0000163757,0.00004191581,0.0000070849837,3.5484913e-7,0.00078688347,0.0007982401,0.000059386577,0.9970093,0.00007680366,0.0011731851],"study_design_scores_gemma":[0.000047202626,0.00008473575,0.00017706752,0.000057096328,0.0000014480532,0.0000017762319,0.0000111726695,0.35836017,0.000259612,0.6408162,0.00012609726,0.000057390684],"about_ca_topic_score_codex":0.0000065178388,"about_ca_topic_score_gemma":3.1967807e-7,"teacher_disagreement_score":0.69456404,"about_ca_system_score_codex":0.000029974759,"about_ca_system_score_gemma":0.00001590644,"threshold_uncertainty_score":0.8874883},"labels":[],"label_agreement":null},{"id":"W4394913316","doi":"10.1016/j.tcs.2024.114580","title":"List homomorphisms to separable signed graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Agence Nationale de la Recherche; Univerzita Karlova v Praze; HORIZON EUROPE Framework Programme; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; European Commission","keywords":"Signed graph; Separable space; Homomorphism; Mathematics; Focus (optics); Combinatorics; Conjecture; Discrete mathematics; Chordal graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.013531344058050261,"score_gpt":0.3004726099934867,"score_spread":0.2869412659354364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394913316","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.012711795,0.00015719018,0.97411126,0.0024368316,0.0012022696,0.00034055294,0.0000038057658,0.0009134558,0.008122814],"genre_scores_gemma":[0.8304865,0.0000046123564,0.16840611,0.0008500518,0.000095488875,0.00002711247,5.531143e-7,0.000017813458,0.000111777306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955251,0.00016765275,0.0003122338,0.0014671149,0.0013322645,0.0011956153],"domain_scores_gemma":[0.9968532,0.0006177191,0.000023171187,0.0014639363,0.00024173396,0.0008002931],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027349188,0.0002771153,0.00026071866,0.00084715144,0.0005900859,0.0018151617,0.004958016,0.00005963719,0.00014462892],"category_scores_gemma":[0.00014225578,0.00022701948,0.00012637682,0.006612454,0.00322137,0.0013652636,0.0021965837,0.00037980024,0.0010252721],"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.000009417495,0.000034893266,0.000004637069,0.00001306863,0.0000055057803,0.00011479496,0.00035906074,0.00019626308,0.004749629,0.95854425,0.00033683077,0.035631638],"study_design_scores_gemma":[0.000074475895,0.00028406383,0.000042394924,0.000057187794,0.0000025064794,0.00006785957,0.0000035597736,0.26645026,0.008069033,0.72350776,0.0011659162,0.00027499854],"about_ca_topic_score_codex":0.0000035297069,"about_ca_topic_score_gemma":5.960148e-7,"teacher_disagreement_score":0.8177747,"about_ca_system_score_codex":0.00011279017,"about_ca_system_score_gemma":0.00024923237,"threshold_uncertainty_score":0.9997525},"labels":[],"label_agreement":null},{"id":"W4399357727","doi":"10.1016/j.tcs.2024.114676","title":"The zero-visibility cops and robber game on graph products","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Partition (number theory); Vertex (graph theory); Graph; Graph partition; Discrete mathematics; Monotonic function; Zero (linguistics)","score_opus":0.01449946632246951,"score_gpt":0.2950471680457049,"score_spread":0.2805477017232354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399357727","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.042290594,0.00052712305,0.9467622,0.006653735,0.0010428464,0.00039084838,0.000001781908,0.00041865217,0.0019122424],"genre_scores_gemma":[0.9775893,0.000043578122,0.021833612,0.00034211876,0.00010190054,0.00001576504,2.2005474e-7,0.000011736973,0.00006174899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961318,0.00028197843,0.00025885852,0.0013976966,0.0010749777,0.0008547401],"domain_scores_gemma":[0.99626464,0.001558119,0.000028618217,0.0016084774,0.00023095269,0.0003092093],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004584177,0.00022711205,0.00017394045,0.00022706643,0.0008060519,0.0017997768,0.0029072273,0.000044582706,0.00000764786],"category_scores_gemma":[0.00040167783,0.00013442805,0.000059607875,0.0027198798,0.008483643,0.00079440436,0.0016479729,0.00050417014,0.00011501243],"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.000014221075,0.00002458616,0.000013402068,0.000014053321,0.0000044322132,0.000019000943,0.00025045354,0.000056154044,0.00045440628,0.89921594,0.00010490007,0.09982846],"study_design_scores_gemma":[0.00007841894,0.00026898723,0.00048487593,0.000043753178,0.0000020912973,0.000047580994,0.0000035593653,0.16866063,0.0034915674,0.8256493,0.001095725,0.00017350905],"about_ca_topic_score_codex":0.0000010407815,"about_ca_topic_score_gemma":3.0747873e-7,"teacher_disagreement_score":0.93529874,"about_ca_system_score_codex":0.00006261571,"about_ca_system_score_gemma":0.00018069509,"threshold_uncertainty_score":0.99923646},"labels":[],"label_agreement":null},{"id":"W4399358836","doi":"10.1016/j.tcs.2024.114678","title":"Group encryption: Full dynamicity, message filtering and code-based instantiation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Xi’an Jiaotong-Liverpool University; Shanghai Jiao Tong University; Ministry of Education - Singapore; University of Wollongong; Nanyang Technological University; University of Calgary","keywords":"Encryption; Computer science; Ciphertext; Theoretical computer science; Substring; Code (set theory); Group (periodic table); Group signature; Computer security; Programming language; Public-key cryptography; Data structure","score_opus":0.008000793048411788,"score_gpt":0.2405117744760298,"score_spread":0.23251098142761803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399358836","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.06223715,0.00011921279,0.9349414,0.0009824493,0.0006435228,0.000114080445,0.000021246198,0.00043797176,0.0005029685],"genre_scores_gemma":[0.8381374,0.000013954365,0.16146272,0.00030168597,0.00007049923,0.0000042200863,0.0000039909633,0.000005307034,2.4774334e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979346,0.00008042908,0.0002250411,0.0008177084,0.0005477966,0.00039446665],"domain_scores_gemma":[0.9989037,0.00022593094,0.000030649564,0.000572969,0.00006598749,0.00020076812],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013108443,0.00017103259,0.00014471223,0.0003047674,0.0003745714,0.001526677,0.0012336904,0.000053259257,0.000034278506],"category_scores_gemma":[0.000023708999,0.00014613534,0.000057512698,0.0015195173,0.0015793943,0.001521098,0.00089618034,0.00021141398,0.000022051094],"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.000006472432,0.000027359172,0.00003144093,0.000034928496,0.0000027210797,0.000022507804,0.00020863289,0.000037034726,0.0022004775,0.9683544,0.000018192926,0.029055828],"study_design_scores_gemma":[0.0001089616,0.00012459526,0.001022162,0.00007220538,0.000004172506,0.000033490414,0.0000027397364,0.7853988,0.00064915547,0.21218841,0.00022358132,0.00017176289],"about_ca_topic_score_codex":0.0000026657067,"about_ca_topic_score_gemma":0.0000035460416,"teacher_disagreement_score":0.7853617,"about_ca_system_score_codex":0.00004247223,"about_ca_system_score_gemma":0.00007294556,"threshold_uncertainty_score":0.9995098},"labels":[],"label_agreement":null},{"id":"W4400571454","doi":"10.1016/j.tcs.2024.114728","title":"On suffix tree detection","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Generalized suffix tree; Suffix tree; Compressed suffix array; Suffix; String (physics); Time complexity; Mathematics; K-ary tree; Combinatorics; Tree (set theory); Data structure; Algorithm; Discrete mathematics; Binary tree; Tree structure; Computer science","score_opus":0.007287958903204772,"score_gpt":0.2471090558013316,"score_spread":0.23982109689812683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400571454","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.0069548655,0.00007058166,0.9844244,0.00060661655,0.0021283058,0.00008907776,0.0000015056106,0.0006149065,0.0051097213],"genre_scores_gemma":[0.94251364,0.0000046044474,0.056868598,0.00036688603,0.00021281258,0.00000497487,5.865163e-7,0.000007040328,0.000020843694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978176,0.000058326623,0.00017257522,0.00082676107,0.00070279685,0.0004219698],"domain_scores_gemma":[0.99859786,0.00030204694,0.000018945953,0.00080464914,0.00006612815,0.00021036452],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008632769,0.00015536745,0.00011815639,0.0002568466,0.0003528243,0.0011314158,0.0018638464,0.000044684395,0.000040868737],"category_scores_gemma":[0.000045658133,0.000110881076,0.00005974756,0.0013171003,0.0008826753,0.00095654465,0.00088339666,0.00024179426,0.00047957213],"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.0000023458522,0.000017716695,3.191588e-7,0.000003260614,0.0000011300613,0.000019488174,0.0000693192,0.000045575187,0.00065276056,0.6572398,0.00012457122,0.3418237],"study_design_scores_gemma":[0.00005640373,0.00023931554,0.000114319744,0.00004764039,0.0000015834228,0.000036960686,7.970749e-7,0.75873053,0.007588968,0.23208225,0.00096905767,0.00013218628],"about_ca_topic_score_codex":0.0000026079808,"about_ca_topic_score_gemma":4.479671e-7,"teacher_disagreement_score":0.9355588,"about_ca_system_score_codex":0.00006564339,"about_ca_system_score_gemma":0.00008364434,"threshold_uncertainty_score":0.9999055},"labels":[],"label_agreement":null},{"id":"W4401269927","doi":"10.1016/j.tcs.2024.114761","title":"Overcoming probabilistic faults in disoriented linear search","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences; Toronto Metropolitan University","keywords":"Probabilistic logic; Competitive analysis; Randomized algorithm; Deterministic algorithm; Mathematics; Algorithm; Path (computing); Constant (computer programming); Computer science; Leverage (statistics); Mathematical optimization; Upper and lower bounds; Artificial intelligence","score_opus":0.01692713087326652,"score_gpt":0.29772330390821694,"score_spread":0.2807961730349504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401269927","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.019661695,0.000041807685,0.9749825,0.0017322939,0.00054942904,0.00027972867,0.0000014535841,0.00034408254,0.0024070216],"genre_scores_gemma":[0.8819534,0.000007208362,0.11774094,0.00018890208,0.00006263518,0.000009573164,0.0000011479912,0.000008005253,0.000028148726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723595,0.00014986265,0.0002913121,0.00083660136,0.0008221494,0.00066410116],"domain_scores_gemma":[0.9987045,0.00035437505,0.000013811509,0.0005658792,0.00010702402,0.00025440103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158753,0.00014903497,0.00015486602,0.0004302864,0.00020080029,0.00060366787,0.0017918543,0.00004606251,0.000044081586],"category_scores_gemma":[0.00013144276,0.000119043354,0.000047405214,0.0031668402,0.0014345003,0.00095251994,0.0010956131,0.0003640131,0.00013609427],"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.000003367362,0.00005025227,0.000046801495,0.000027353884,0.0000014134232,0.000031093692,0.0010443103,0.008593124,0.00012784397,0.96794796,0.000013997586,0.022112487],"study_design_scores_gemma":[0.00013758779,0.000102899256,0.0003262543,0.00010393497,8.2535314e-7,0.00001681145,0.000005367832,0.9362243,0.0002799421,0.06243779,0.0002149293,0.00014937612],"about_ca_topic_score_codex":0.000007748317,"about_ca_topic_score_gemma":0.0000015836342,"teacher_disagreement_score":0.92763114,"about_ca_system_score_codex":0.000121651305,"about_ca_system_score_gemma":0.00025094853,"threshold_uncertainty_score":0.58211833},"labels":[],"label_agreement":null},{"id":"W4401560526","doi":"10.1016/j.tcs.2024.114780","title":"On the difference set of two transductions","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.015666242829783853,"score_gpt":0.26695198594823516,"score_spread":0.2512857431184513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401560526","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.10441045,0.000043664048,0.88804495,0.0042787897,0.0008471524,0.00009915903,0.000003963034,0.00024040154,0.0020314592],"genre_scores_gemma":[0.9844989,0.0000040122745,0.014883709,0.00048003803,0.00010346271,0.0000066928524,2.5809473e-7,0.0000056062017,0.000017312706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982307,0.000118150885,0.00020755596,0.0005269557,0.0005755864,0.00034106107],"domain_scores_gemma":[0.99781865,0.0011144016,0.000025976811,0.0008709655,0.00006337767,0.00010663676],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013681559,0.00013902398,0.00013693089,0.00016049304,0.00027296614,0.00042023428,0.0026291835,0.000023581048,0.00009343106],"category_scores_gemma":[0.000050961837,0.00007818526,0.000085930216,0.0014763407,0.0028268534,0.00028566903,0.00038471873,0.00022252483,0.00008661839],"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.0000014857854,0.000017991068,0.000001610384,0.0000067427454,0.000003747899,0.000005274702,0.00063878176,0.000052743642,0.002699708,0.94687915,0.00005835052,0.049634416],"study_design_scores_gemma":[0.000036102363,0.000087370165,0.00011889366,0.000056042507,0.0000027619685,0.000022079403,0.0000045849592,0.40717953,0.012177301,0.5801975,0.000041071326,0.000076769866],"about_ca_topic_score_codex":0.000003404732,"about_ca_topic_score_gemma":2.6832546e-7,"teacher_disagreement_score":0.88008845,"about_ca_system_score_codex":0.000024187857,"about_ca_system_score_gemma":0.00010121174,"threshold_uncertainty_score":0.9998869},"labels":[],"label_agreement":null},{"id":"W4402161717","doi":"10.1016/j.tcs.2024.114782","title":"Binary distinguishability operation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Mathematics; Algorithm; Programming language","score_opus":0.008019538985371126,"score_gpt":0.2567818053675138,"score_spread":0.2487622663821427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402161717","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.04815766,0.00012117867,0.9428938,0.0017089141,0.0016088024,0.000109276494,0.0000015154487,0.0009276821,0.004471142],"genre_scores_gemma":[0.9149469,0.0000021764924,0.0844067,0.00039615738,0.00022252083,0.0000059196664,8.8803034e-7,0.000006453087,0.000012281217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788463,0.00009506576,0.00022281842,0.0008437345,0.00052523124,0.00042853068],"domain_scores_gemma":[0.9985776,0.00032610833,0.000017519715,0.0008073546,0.00008327371,0.00018814762],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020951615,0.0001492156,0.00013112651,0.00015289728,0.00036256804,0.001505563,0.0020341466,0.000038135157,0.00008523021],"category_scores_gemma":[0.00010579901,0.00011200975,0.00006442086,0.0011533771,0.0018292079,0.0011123855,0.0010788611,0.00018097706,0.00030031367],"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.0000011456624,0.000024804478,0.000014659362,0.000012764203,0.0000016454301,0.000027674985,0.00030331954,0.000068189074,0.0011346843,0.9159249,0.000107126194,0.082379065],"study_design_scores_gemma":[0.00003282108,0.000081450096,0.0006490022,0.000033881355,0.000001677648,0.000033503373,0.0000023136006,0.72342896,0.0016189687,0.2736622,0.00032500536,0.00013021717],"about_ca_topic_score_codex":0.000002582644,"about_ca_topic_score_gemma":1.3587747e-7,"teacher_disagreement_score":0.8667892,"about_ca_system_score_codex":0.00007254182,"about_ca_system_score_gemma":0.00015245247,"threshold_uncertainty_score":0.999531},"labels":[],"label_agreement":null},{"id":"W4402487352","doi":"10.1016/j.tcs.2024.114781","title":"On recursive tiling of some mathematical objects","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Western University","keywords":"Mathematics; Algebra over a field; Combinatorics; Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Pure mathematics","score_opus":0.008791995234660378,"score_gpt":0.24765854332906326,"score_spread":0.2388665480944029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402487352","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.93807626,0.0001679975,0.055192053,0.00028776273,0.0009490427,0.00013100247,0.0000064894307,0.00011957831,0.0050697885],"genre_scores_gemma":[0.98993677,0.0000025345996,0.009736338,0.00016858842,0.00013160474,0.0000023652653,2.2396523e-7,0.000007925217,0.000013662977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985309,0.000051453295,0.00020793082,0.0003742343,0.00052149413,0.0003139879],"domain_scores_gemma":[0.99918747,0.00034689656,0.000025196656,0.00027086315,0.00005784635,0.00011171081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008060712,0.00011518835,0.0001712547,0.00008610462,0.00013039273,0.00021344799,0.0005437229,0.00003648449,0.0006644415],"category_scores_gemma":[0.00011825206,0.00007149784,0.000052570907,0.00028847088,0.0027005058,0.00022250386,0.00022954441,0.000116845404,0.00024384579],"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.000019086194,0.0000143703355,2.1752462e-7,0.000059249065,0.0000012876159,0.000008914103,0.0006768341,0.000090382986,0.09855248,0.8976796,0.000027537153,0.0028700063],"study_design_scores_gemma":[0.000033025633,0.00023448098,0.0000067952665,0.00016646543,0.0000038611493,0.00001599958,0.000011826361,0.024365963,0.29725328,0.67780644,0.000022369612,0.000079474514],"about_ca_topic_score_codex":0.0000013302972,"about_ca_topic_score_gemma":6.014673e-8,"teacher_disagreement_score":0.21987318,"about_ca_system_score_codex":0.000029388459,"about_ca_system_score_gemma":0.00007094438,"threshold_uncertainty_score":0.99501264},"labels":[],"label_agreement":null},{"id":"W4403268005","doi":"10.1016/j.tcs.2024.114900","title":"Algorithms for the thief orienteering problem on directed acyclic graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Directed acyclic graph; Computer science; Combinatorics; Mathematics; Directed graph; Theoretical computer science; Algorithm; Mathematical optimization","score_opus":0.014807567598796405,"score_gpt":0.2794228516752325,"score_spread":0.2646152840764361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403268005","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.0034790074,0.0001048591,0.9914302,0.00038327425,0.0013042801,0.00029495778,0.0000035484334,0.0013790828,0.0016207589],"genre_scores_gemma":[0.6274757,0.000011957526,0.37221667,0.00008614499,0.00013858378,0.00003311914,7.8743756e-7,0.000025403011,0.000011683268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987762,0.000038244412,0.00017311834,0.00032788992,0.00030526344,0.00037931572],"domain_scores_gemma":[0.998584,0.0009502848,0.000009688089,0.00030269555,0.00006277819,0.000090579764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013726874,0.0001388176,0.0001095507,0.00012719871,0.00026774564,0.00034658157,0.000563754,0.00003770653,0.000018815243],"category_scores_gemma":[0.000087857276,0.00009095445,0.000060392696,0.0011256823,0.00069031684,0.00013745604,0.00010576634,0.00020553933,0.00001884734],"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.000002832454,0.000006720777,0.0000031539903,0.000029177572,0.000010162858,0.0000015516126,0.0003248805,0.14191088,0.000390213,0.7640412,0.000101645324,0.09317758],"study_design_scores_gemma":[0.00006877878,0.00005636549,0.00006575706,0.00006730098,0.000009177382,0.0000068174386,0.000004050284,0.9653233,0.0029692906,0.030560207,0.0007447116,0.0001241896],"about_ca_topic_score_codex":5.249317e-7,"about_ca_topic_score_gemma":7.788539e-8,"teacher_disagreement_score":0.8234125,"about_ca_system_score_codex":0.000050574257,"about_ca_system_score_gemma":0.000023008291,"threshold_uncertainty_score":0.37090147},"labels":[],"label_agreement":null},{"id":"W4403432281","doi":"10.1016/j.tcs.2024.114906","title":"Approximation algorithms for minimum ply covering of points with unit squares and unit disks","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unit (ring theory); Algorithm; Mathematics; Least-squares function approximation; Computer science; Combinatorics; Statistics","score_opus":0.02129523637690096,"score_gpt":0.2817064068411324,"score_spread":0.26041117046423146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403432281","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.12179797,0.00006630913,0.8768698,0.00052556995,0.0002484539,0.00020597938,0.000005880884,0.000084238556,0.00019578313],"genre_scores_gemma":[0.70069706,0.0000024129233,0.29915586,0.000058819187,0.000060179806,0.000008678297,0.000003185033,0.000004351046,0.000009424081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986374,0.000039887524,0.00020189527,0.000468396,0.00041995858,0.00023247744],"domain_scores_gemma":[0.998952,0.0004397359,0.000043009444,0.00024018486,0.00021494956,0.0001101396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008301413,0.000121229044,0.00013551972,0.00024521074,0.00019124073,0.00041580078,0.0005183662,0.000029187808,0.000004584407],"category_scores_gemma":[0.00004404835,0.00009310657,0.00002899283,0.0010949619,0.0007745905,0.0007184296,0.00026145618,0.00007609603,0.0000030824428],"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.000011653197,0.000020974865,0.000022326887,0.000059988914,0.000005905064,0.0000019909194,0.0004450147,0.0015274641,0.00078291894,0.9217259,0.00000780919,0.075388044],"study_design_scores_gemma":[0.0001731655,0.00034366656,0.0007992644,0.0000790952,0.0000066056605,0.000027527938,0.000010043611,0.8675437,0.007251891,0.1235427,0.0001034909,0.0001188696],"about_ca_topic_score_codex":0.0000017535097,"about_ca_topic_score_gemma":3.8849714e-7,"teacher_disagreement_score":0.8660162,"about_ca_system_score_codex":0.000015850102,"about_ca_system_score_gemma":0.00013528804,"threshold_uncertainty_score":0.40095764},"labels":[],"label_agreement":null},{"id":"W4403464505","doi":"10.1016/j.tcs.2024.114907","title":"Path partitions of phylogenetic networks","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National University of Singapore","keywords":"Phylogenetic tree; Path (computing); Mathematics; Computer science; Combinatorics; Theoretical computer science; Biology; Genetics; Computer network; Gene","score_opus":0.00600925611002742,"score_gpt":0.23862277593828973,"score_spread":0.2326135198282623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403464505","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.26759124,0.00076193194,0.7294924,0.000114975766,0.00035881993,0.00009687326,0.0000047111093,0.000022128832,0.0015568947],"genre_scores_gemma":[0.9905111,0.000049708644,0.009118809,0.000062001694,0.00022234351,0.0000054159505,0.0000059228046,0.0000075292273,0.000017149983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991318,0.000028510309,0.00012399322,0.00031074387,0.00017309417,0.00023185143],"domain_scores_gemma":[0.9995483,0.000016175074,0.000013940742,0.00027774434,0.00006005481,0.00008377343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036094117,0.00007836115,0.00007373793,0.000047986447,0.00006280065,0.000051290725,0.00032415413,0.0000375441,0.000048747585],"category_scores_gemma":[0.00001414381,0.00006491158,0.000049824528,0.00030952145,0.0013262987,0.0000032719172,0.00022634957,0.00005426538,0.00001672035],"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.000014884049,0.000103376864,0.0003608586,0.00006422115,0.000041158495,0.000012866407,0.00012654607,0.0044017783,0.3110556,0.63388604,0.00058390124,0.049348764],"study_design_scores_gemma":[0.00034483313,0.0013909471,0.004513015,0.00014034516,0.000053504482,0.000065475266,0.000017092709,0.7775579,0.16087341,0.0501466,0.004341592,0.00055526034],"about_ca_topic_score_codex":4.776735e-7,"about_ca_topic_score_gemma":1.7509731e-7,"teacher_disagreement_score":0.77315617,"about_ca_system_score_codex":0.0000067020865,"about_ca_system_score_gemma":0.00005346466,"threshold_uncertainty_score":0.48868027},"labels":[],"label_agreement":null},{"id":"W4403523031","doi":"10.1016/j.tcs.2024.114905","title":"On decision problems concerning contextual insertions and deletions","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Saskatchewan","funders":"Science and Engineering Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision problem; Theoretical computer science; Mathematics; Algorithm","score_opus":0.013864027546685878,"score_gpt":0.27067985772327147,"score_spread":0.2568158301765856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403523031","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.6330283,0.00017077547,0.36529583,0.0001843699,0.0001740465,0.00006281645,0.0000020009816,0.00003421061,0.0010475859],"genre_scores_gemma":[0.99439895,0.000017522143,0.004928475,0.00048912375,0.000140432,0.0000035123487,0.000004220619,0.000004900299,0.000012868285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903005,0.000036722227,0.00012252413,0.00044297916,0.00014629289,0.00022141206],"domain_scores_gemma":[0.9995342,0.0001420701,0.000012012221,0.00015046686,0.00005156887,0.000109674715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044821072,0.0000943775,0.000074999654,0.00004774648,0.00025802202,0.00017531481,0.00022317513,0.000054412147,0.0000190686],"category_scores_gemma":[0.0001371043,0.000064078646,0.000033890563,0.00019932196,0.0013591675,0.0000061070937,0.00030372094,0.0001113045,0.000023382336],"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.000021170308,0.000025341282,0.00007153633,0.000006188973,0.000005240113,0.0000047161197,0.000053055875,0.00026067914,0.064269565,0.84778017,0.00014187374,0.08736044],"study_design_scores_gemma":[0.0010349669,0.0061156093,0.0046552937,0.00073967327,0.000034097393,0.00029304947,0.000047239955,0.5691972,0.052284863,0.34537083,0.01909837,0.0011288326],"about_ca_topic_score_codex":8.105115e-7,"about_ca_topic_score_gemma":5.6634076e-7,"teacher_disagreement_score":0.56893647,"about_ca_system_score_codex":0.000009204031,"about_ca_system_score_gemma":0.000038285674,"threshold_uncertainty_score":0.50079095},"labels":[],"label_agreement":null},{"id":"W4404635566","doi":"10.1016/j.tcs.2024.114976","title":"Finer-grained reductions in fine-grained hardness of approximation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Environment Canada; Israel Science Foundation; European Commission","keywords":"Mathematics","score_opus":0.010950510299227204,"score_gpt":0.26394702072766935,"score_spread":0.2529965104284421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404635566","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.054525875,0.000076061755,0.9403619,0.0023398136,0.0012747082,0.00016857477,0.000002419226,0.00016192254,0.0010887184],"genre_scores_gemma":[0.8592429,0.0000024625426,0.1404829,0.000072966846,0.00013261502,0.000012417187,0.0000049811742,0.000004772184,0.000043981516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980895,0.00009012068,0.00037766807,0.0005854365,0.0005590424,0.00029825684],"domain_scores_gemma":[0.9990142,0.0002185602,0.00004675888,0.00041364724,0.00020126495,0.00010559825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014039114,0.00013525492,0.00017084474,0.00067922636,0.0001375945,0.00030178617,0.00092742115,0.00004357919,0.000028110664],"category_scores_gemma":[0.00013642333,0.00011806496,0.00006625081,0.0039301594,0.0008114848,0.0008475919,0.00032915577,0.00015269712,0.000026235744],"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.000003907484,0.000054079,0.00000998311,0.000025929541,0.0000029170221,0.0000056050767,0.0004886287,0.0053692795,0.0029229433,0.9306983,0.000116166164,0.060302295],"study_design_scores_gemma":[0.00012117955,0.00008325304,0.0008422777,0.000058909198,0.0000027754754,0.000026125044,0.0000041213834,0.8160162,0.005554226,0.1769537,0.0002172542,0.000120001125],"about_ca_topic_score_codex":0.0000041017765,"about_ca_topic_score_gemma":0.0000015092667,"teacher_disagreement_score":0.8106469,"about_ca_system_score_codex":0.00007022592,"about_ca_system_score_gemma":0.00028392964,"threshold_uncertainty_score":0.48145497},"labels":[],"label_agreement":null},{"id":"W4404734773","doi":"10.1016/j.tcs.2024.115006","title":"Sign-then-encrypt with security enhancement and compressed ciphertext","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Sign (mathematics); Ciphertext; Semantic security; Computer science; Computer security; Mathematics; Attribute-based encryption; Public-key cryptography","score_opus":0.005328427276776619,"score_gpt":0.22753379544122562,"score_spread":0.222205368164449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404734773","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.04006319,0.00047488467,0.9544607,0.0011674294,0.00043106184,0.00021462729,0.000005779879,0.00037209506,0.002810236],"genre_scores_gemma":[0.90225595,0.00003325055,0.09709267,0.0005138107,0.000082194696,0.000011205164,0.0000016048933,0.00000769879,0.0000016195382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971431,0.000098002754,0.00023644703,0.001136774,0.0007806904,0.00060500804],"domain_scores_gemma":[0.9982051,0.00041089722,0.000033901408,0.00088168075,0.00011111711,0.00035726427],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010656138,0.00025409381,0.00022668506,0.00016706153,0.00041790574,0.0015619852,0.001797853,0.000051239946,0.000086120424],"category_scores_gemma":[0.000020690342,0.00018060526,0.00005219628,0.0015861437,0.0033661358,0.001273006,0.0011954841,0.0002972324,0.000052795353],"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.0000115543935,0.00006629392,0.000016517415,0.000034926754,0.000010180782,0.0000425585,0.001458064,0.0000067600963,0.0005274798,0.9639818,0.00019653668,0.033647336],"study_design_scores_gemma":[0.00022503868,0.0004644623,0.00026640223,0.0001248641,0.000010704344,0.00008515398,0.0000150541855,0.54634416,0.004595171,0.4455762,0.0019367157,0.00035610786],"about_ca_topic_score_codex":0.0000067705587,"about_ca_topic_score_gemma":0.0000015846431,"teacher_disagreement_score":0.86219275,"about_ca_system_score_codex":0.00003134794,"about_ca_system_score_gemma":0.00013116976,"threshold_uncertainty_score":0.99947447},"labels":[],"label_agreement":null},{"id":"W4404905522","doi":"10.1016/j.tcs.2024.115012","title":"Self-similarity of communities of the ABCD model","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Similarity (geometry); Computer science; Mathematics; Natural language processing; Artificial intelligence","score_opus":0.011179257432995353,"score_gpt":0.2644708579249312,"score_spread":0.25329160049193583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404905522","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.16849422,0.000021411637,0.819473,0.00018886558,0.000066242144,0.00007965637,0.000008113627,0.00006380664,0.011604677],"genre_scores_gemma":[0.96589607,0.0000012700332,0.034026273,0.000023855322,0.00004103729,0.0000021199396,5.519992e-7,0.0000040154596,0.000004791952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920213,0.00006348365,0.00018598109,0.0001233177,0.00027566875,0.00014942094],"domain_scores_gemma":[0.9991849,0.00015235855,0.000038075257,0.0004956459,0.00009611972,0.000032921886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964026,0.000075893186,0.00014691433,0.00005849106,0.00011935016,0.00005160617,0.00097143365,0.000012599437,0.00007102679],"category_scores_gemma":[0.0000017379517,0.000048505022,0.00011514077,0.0005702892,0.0022134567,0.00008574202,0.0006644639,0.000145517,0.0000013049626],"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":[9.818763e-7,0.000036714966,0.0005058846,0.000013070636,0.000012301548,4.8970936e-8,0.0005763371,0.0010196979,0.00015411955,0.9947271,0.000044585482,0.0029092017],"study_design_scores_gemma":[0.000013758668,0.00001240719,0.00011977135,0.00003282739,0.000014019754,1.985875e-7,0.000013529181,0.6425778,0.004435815,0.35271418,0.00002967943,0.000035989837],"about_ca_topic_score_codex":0.000020582675,"about_ca_topic_score_gemma":9.641361e-7,"teacher_disagreement_score":0.79740185,"about_ca_system_score_codex":0.000011145609,"about_ca_system_score_gemma":0.00008154939,"threshold_uncertainty_score":0.8155573},"labels":[],"label_agreement":null},{"id":"W4406943783","doi":"10.1016/j.tcs.2025.115091","title":"A subquadratic certification scheme for P5-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Certification; Scheme (mathematics); Mathematics; Programming language; Computer science; Discrete mathematics; Combinatorics; Calculus (dental); Medicine; Economics; Management","score_opus":0.021426337706722795,"score_gpt":0.31762652775782085,"score_spread":0.29620019005109804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406943783","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.006609997,0.000060608887,0.98475873,0.0044567017,0.00054514606,0.00059428555,0.0000028803427,0.00029540944,0.0026762232],"genre_scores_gemma":[0.549272,0.0000028296934,0.4500353,0.0005308838,0.000027706945,0.000073268064,9.178832e-7,0.000006316639,0.00005077952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700046,0.00010671051,0.0003540114,0.0010355597,0.00068776344,0.0008155113],"domain_scores_gemma":[0.9960969,0.0008721925,0.000066434244,0.0022219077,0.00051032903,0.0002322241],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024235167,0.00020469939,0.00023168615,0.00059700373,0.00075504836,0.00056553626,0.006226555,0.00006397642,0.000013859779],"category_scores_gemma":[0.00072856783,0.00017651088,0.000116560615,0.0035120584,0.0034177639,0.00088973466,0.0016795764,0.00021661684,0.000032339296],"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.00002266324,0.00006044641,0.000035381683,0.000022725726,0.000005788808,0.0000015317546,0.000103166836,0.000037207206,0.0039569857,0.962271,0.00022132268,0.033261806],"study_design_scores_gemma":[0.000269167,0.000096101205,0.00020999713,0.00002464766,0.000002531227,0.000003504276,0.0000037061845,0.35787824,0.009864462,0.6313188,0.0001991703,0.00012965527],"about_ca_topic_score_codex":0.0000010548293,"about_ca_topic_score_gemma":6.9200166e-7,"teacher_disagreement_score":0.542662,"about_ca_system_score_codex":0.00008819391,"about_ca_system_score_gemma":0.00027125175,"threshold_uncertainty_score":0.99929434},"labels":[],"label_agreement":null},{"id":"W4408140300","doi":"10.1016/j.tcs.2025.115160","title":"On 1-planar graphs with bounded cop-number","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Planar graph; Mathematics; Combinatorics; Planar; Discrete mathematics; 1-planar graph; Outerplanar graph; Pathwidth; Chordal graph; Graph; Computer science; Line graph; Mathematical analysis","score_opus":0.008572124148925313,"score_gpt":0.28842919260586986,"score_spread":0.2798570684569445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408140300","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.032252137,0.000010703321,0.9218639,0.0015953145,0.00036453825,0.0002505953,0.0000013551827,0.00030700213,0.043354433],"genre_scores_gemma":[0.86134547,0.000002821683,0.1367131,0.0017904381,0.000019498942,0.000016215326,5.237159e-7,0.000008475934,0.000103434795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964001,0.00018465714,0.0002404031,0.001110937,0.0011382484,0.0009256426],"domain_scores_gemma":[0.99701554,0.00076817116,0.000050414023,0.0015669055,0.00028742797,0.0003115343],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001460445,0.0002614143,0.00026121907,0.00045738977,0.0007582007,0.00062320527,0.0040565995,0.000058474605,0.00006252657],"category_scores_gemma":[0.0001119573,0.00018827064,0.00006726351,0.0040910244,0.0059089884,0.0006589043,0.0007522898,0.00041544306,0.0002274045],"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.00006726441,0.00008263303,0.0001522897,0.0000073458623,0.0000094209945,0.000036821537,0.000086749555,0.00008678353,0.00015247433,0.9871163,0.00018475235,0.0120171895],"study_design_scores_gemma":[0.00043448768,0.00032956904,0.0006328586,0.00007093325,0.0000034525297,0.000034328885,0.0000039687297,0.04849423,0.003360607,0.9461269,0.00026785923,0.0002408123],"about_ca_topic_score_codex":0.000002479397,"about_ca_topic_score_gemma":0.0000011554504,"teacher_disagreement_score":0.82909334,"about_ca_system_score_codex":0.00009523399,"about_ca_system_score_gemma":0.00029704405,"threshold_uncertainty_score":0.99679637},"labels":[],"label_agreement":null},{"id":"W4408393303","doi":"10.1016/j.tcs.2025.115152","title":"The exact spanning ratio of the parallelogram Delaunay graph","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Parallelogram; Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.006757272174536745,"score_gpt":0.2535937312630897,"score_spread":0.24683645908855295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408393303","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.048917778,0.00011339761,0.94372153,0.0035507057,0.0010953071,0.00017529713,4.0782996e-7,0.00005130006,0.0023742947],"genre_scores_gemma":[0.9737691,0.000007648723,0.02545916,0.0005851393,0.000042511692,0.000008221025,3.7318367e-7,0.000002099976,0.00012569208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982694,0.00016452529,0.0002873018,0.00038394696,0.00057518017,0.0003196651],"domain_scores_gemma":[0.99799263,0.00081801665,0.00009444219,0.0007826461,0.00024489977,0.00006735479],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015115427,0.000113836955,0.00011419056,0.000120412464,0.0014062444,0.00030016951,0.0026650222,0.00003153388,0.000005548638],"category_scores_gemma":[0.00021861357,0.00006242736,0.00009441321,0.002467415,0.0022262044,0.00025536207,0.001451883,0.00013553006,0.000006907603],"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.0000046866785,0.000018247798,0.00011509898,0.000002164972,0.000006023914,3.8412318e-7,0.00012078264,0.008933587,0.0010423014,0.9551939,0.00019849102,0.034364328],"study_design_scores_gemma":[0.00012995405,0.000049395578,0.011064718,0.000028653489,0.0000059379295,0.000008116094,0.000004205567,0.6884579,0.014828745,0.28461066,0.0007197768,0.0000919567],"about_ca_topic_score_codex":0.0000021987164,"about_ca_topic_score_gemma":0.0000020515836,"teacher_disagreement_score":0.92485136,"about_ca_system_score_codex":0.00004692228,"about_ca_system_score_gemma":0.00021652502,"threshold_uncertainty_score":0.9998938},"labels":[],"label_agreement":null},{"id":"W4408421927","doi":"10.1016/j.tcs.2025.115183","title":"TCS Special Issue on Selected Papers from AlgoWin 2023","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"2D Materials and Applications","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Computer science; Mathematical economics","score_opus":0.005706109503703983,"score_gpt":0.24822863816442087,"score_spread":0.24252252866071689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408421927","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.8211714,0.000014403537,0.046992622,0.0038391685,0.0040731216,0.00042840897,0.00008287914,0.0003129716,0.12308503],"genre_scores_gemma":[0.9817092,0.000004139869,0.014043041,0.0014772156,0.0025040554,0.000020311065,0.0000070671854,0.00000819381,0.00022677028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818224,0.00009847117,0.00024589724,0.000644152,0.00040083536,0.0004284252],"domain_scores_gemma":[0.99891645,0.00026775186,0.000043578322,0.0005194451,0.00011500586,0.00013776436],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00064312824,0.00015759574,0.00020187157,0.000089563,0.00043651767,0.00036662832,0.0010267696,0.00005718731,0.0062498185],"category_scores_gemma":[0.000119996475,0.00012598527,0.00003403068,0.0009000353,0.001770025,0.00011016761,0.00035433524,0.00009987347,0.0018087162],"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.000022066111,0.00005338953,0.0000054657453,0.000002493975,0.0000015911182,0.000002012968,0.00005595386,0.000028433957,0.39819807,0.5904788,0.0031642413,0.007987524],"study_design_scores_gemma":[0.00038683426,0.00014911733,0.003840203,0.00007689798,0.00001818672,0.000001979269,0.000015907406,0.007039099,0.82613117,0.13083404,0.031152826,0.00035375202],"about_ca_topic_score_codex":0.000023585131,"about_ca_topic_score_gemma":0.0000028810978,"teacher_disagreement_score":0.4596447,"about_ca_system_score_codex":0.00005705917,"about_ca_system_score_gemma":0.00012909756,"threshold_uncertainty_score":0.9989685},"labels":[],"label_agreement":null},{"id":"W4408667083","doi":"10.1016/j.tcs.2025.115190","title":"Improved algorithms for optimal k sink location on path networks","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Science and Technology Agency; Research Grants Council, University Grants Committee; Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Path (computing); Sink (geography); Computer science; Mathematics; Computer network; Geography","score_opus":0.008280889676144442,"score_gpt":0.25603675457510383,"score_spread":0.2477558648989594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408667083","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.00069584855,0.00004344656,0.9939021,0.0012658769,0.001909196,0.00065674866,0.000001059667,0.00029421243,0.0012315199],"genre_scores_gemma":[0.6746154,0.0000034494615,0.32333577,0.0016900523,0.00024623226,0.00006704572,0.000001740547,0.000007969947,0.000032356154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997192,0.00008790208,0.00035761032,0.0011112117,0.0004242332,0.0008269995],"domain_scores_gemma":[0.99746764,0.0005955456,0.000086430504,0.001228839,0.00040139037,0.00022013458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017021837,0.00025138972,0.00025540587,0.00018949069,0.0005555558,0.00064607273,0.003031838,0.000111555644,0.0000068694226],"category_scores_gemma":[0.000111679205,0.00021452393,0.000090159214,0.0019822693,0.0014106556,0.00048683718,0.00093874725,0.00027700947,0.000013625698],"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.000017573655,0.00006005288,0.0000031043114,0.0000064969404,0.0000044565436,0.0000015799371,0.00004671427,0.032439634,0.00004580798,0.7823261,0.00028014378,0.18476835],"study_design_scores_gemma":[0.00038364631,0.000442586,0.00016080697,0.000067865316,0.000006129413,0.000004385193,0.0000018086016,0.9507554,0.0009140504,0.046733957,0.0003042858,0.00022503153],"about_ca_topic_score_codex":0.000001890209,"about_ca_topic_score_gemma":2.4848478e-7,"teacher_disagreement_score":0.9183158,"about_ca_system_score_codex":0.00013349854,"about_ca_system_score_gemma":0.00024734586,"threshold_uncertainty_score":0.8748032},"labels":[],"label_agreement":null},{"id":"W4408691154","doi":"10.1016/j.tcs.2025.115192","title":"A theory of fine-grained lineage for functions on structured objects","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Lineage (genetic); Mathematics; Theoretical computer science; Biology; Genetics; Gene","score_opus":0.05169957440451233,"score_gpt":0.3617755050164918,"score_spread":0.31007593061197947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408691154","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.044378307,0.000010371113,0.9401895,0.0006871935,0.0024858313,0.00032742915,0.000035307345,0.00006545934,0.011820622],"genre_scores_gemma":[0.9701144,1.7075274e-7,0.028288972,0.00052312086,0.00008442599,0.000008282625,0.000003734014,0.000003765247,0.0009731215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663085,0.00018767764,0.00057528215,0.0010089406,0.0012148275,0.0003823989],"domain_scores_gemma":[0.9928999,0.004752946,0.0001348702,0.0015687401,0.0005237155,0.00011984408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011132129,0.00014556643,0.00027045287,0.0007413019,0.0005143805,0.0004531629,0.0024121054,0.0000387112,0.00014595388],"category_scores_gemma":[0.0060046474,0.00009608024,0.0001379762,0.003042193,0.0025420797,0.0001536246,0.0009043062,0.00010898908,0.000045176806],"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.00007997713,0.000055216915,0.000027124026,0.000005315952,0.0000061398155,5.996948e-7,0.00014727743,0.00089899095,0.00027628455,0.8822212,0.0037697887,0.11251207],"study_design_scores_gemma":[0.00042847646,0.00025641074,0.0018527592,0.000042164826,0.000014597349,0.0000010311052,0.00011194967,0.26332408,0.0041351593,0.72739524,0.002314477,0.0001236311],"about_ca_topic_score_codex":0.0000010781158,"about_ca_topic_score_gemma":0.0000020560137,"teacher_disagreement_score":0.9257361,"about_ca_system_score_codex":0.000030396915,"about_ca_system_score_gemma":0.00015359922,"threshold_uncertainty_score":0.93663985},"labels":[],"label_agreement":null},{"id":"W4409252201","doi":"10.1016/j.tcs.2025.115234","title":"Vertex-critical graphs in co-gem-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","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 Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Chordal graph; Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.01258889013089405,"score_gpt":0.3244643890253385,"score_spread":0.31187549889444444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409252201","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.024514195,0.00012213338,0.94975,0.0038410323,0.0009718673,0.00032984966,0.0000038720914,0.0003283032,0.020138713],"genre_scores_gemma":[0.90728134,0.000013783367,0.09135029,0.0012752648,0.000016463773,0.000027213215,6.1892655e-7,0.0000103390175,0.000024683073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949081,0.00039556628,0.00050925545,0.0014520533,0.0012664997,0.001468526],"domain_scores_gemma":[0.99487394,0.0018126417,0.00004003239,0.0025361252,0.00030369952,0.00043358974],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033081265,0.0003188962,0.0003984111,0.001540739,0.0005675973,0.0006039664,0.008814519,0.000112844886,0.000048506132],"category_scores_gemma":[0.0012378645,0.0002853776,0.00014192048,0.0070123854,0.009845346,0.0012567593,0.0032063636,0.0006921059,0.00009195327],"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.000027135166,0.00014140707,0.0005730522,0.000018124814,0.0000043910777,0.00006369677,0.00015138477,0.000046545872,0.0005124043,0.97494596,0.00019994503,0.02331594],"study_design_scores_gemma":[0.0005205396,0.00015499731,0.0025129684,0.00007809514,0.000002629457,0.000020745922,0.000009142689,0.11708089,0.0031098847,0.87612003,0.000115750474,0.00027434077],"about_ca_topic_score_codex":0.000005672186,"about_ca_topic_score_gemma":0.0000033074969,"teacher_disagreement_score":0.88276714,"about_ca_system_score_codex":0.00012643219,"about_ca_system_score_gemma":0.00033870025,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W4409359688","doi":"10.1016/j.tcs.2025.115248","title":"On the existence of EFX (and Pareto-optimal) allocations for binary chores","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Science and Technology Development Fund; National Natural Science Foundation of China","keywords":"Pareto optimal; Binary number; Pareto principle; Mathematics; Combinatorics; Mathematical economics; Mathematical optimization; Computer science; Multi-objective optimization; Arithmetic","score_opus":0.024383141185406566,"score_gpt":0.2482467532580235,"score_spread":0.22386361207261693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409359688","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.60508233,0.00017480597,0.3790977,0.002424837,0.0003767761,0.00031125994,0.000020179123,0.000024186633,0.012487926],"genre_scores_gemma":[0.99623835,0.0000058146156,0.003254467,0.00036563416,0.000025884749,0.00002110288,4.6370795e-7,0.0000034320767,0.000084877494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991577,0.000027699904,0.0002846357,0.00030082068,0.00004023613,0.00018885959],"domain_scores_gemma":[0.99854773,0.00092276186,0.00009336774,0.00034536776,0.000050771607,0.000039988772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020770805,0.000077411336,0.00017677552,0.00012026384,0.00027346177,0.00006751697,0.0005384029,0.000029160783,0.000021467957],"category_scores_gemma":[0.00040595373,0.00005778468,0.00004412386,0.0003566225,0.0019733782,0.00006773571,0.000132911,0.00007176817,0.00001600532],"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.000013178079,0.000025399686,0.00032177928,0.000019362411,0.000005193569,9.398322e-8,0.0002473724,0.00016096163,0.000038771883,0.99864054,0.00006250607,0.00046486413],"study_design_scores_gemma":[0.0001182428,0.00014978778,0.0025458403,0.00006399052,0.0000027314356,9.534639e-7,0.00003192901,0.11005737,0.0005638893,0.8861013,0.00028875057,0.00007518823],"about_ca_topic_score_codex":0.000004102812,"about_ca_topic_score_gemma":2.6405706e-7,"teacher_disagreement_score":0.391156,"about_ca_system_score_codex":0.000017289833,"about_ca_system_score_gemma":0.000021271046,"threshold_uncertainty_score":0.7270995},"labels":[],"label_agreement":null},{"id":"W4409371624","doi":"10.1016/j.tcs.2025.115228","title":"Stable finiteness of monoid algebras and surjunctivity","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","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é de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Monoid; Syntactic monoid; Free monoid; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.015474764524539412,"score_gpt":0.27954358104295857,"score_spread":0.2640688165184192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409371624","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.36657634,0.000019780795,0.6161956,0.00038874458,0.00006143267,0.000096607655,0.0000024715282,0.00004166401,0.01661738],"genre_scores_gemma":[0.9570714,0.0000037821483,0.042723462,0.00010647901,0.000016569862,0.0000044428866,2.3880634e-7,0.0000049630826,0.00006864878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984493,0.00010441942,0.0003453459,0.00038185166,0.00039039468,0.00032863775],"domain_scores_gemma":[0.99735755,0.0017933121,0.00006155988,0.00045592253,0.0001864488,0.00014521922],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017573528,0.00014785341,0.00041436902,0.00016624383,0.00017442444,0.000069020425,0.00048358744,0.00005222433,0.00022955232],"category_scores_gemma":[0.00087980053,0.00010173948,0.0000749419,0.0010207436,0.004814976,0.00011984088,0.0005798617,0.00012444597,0.0000074234986],"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.000018404575,0.00014437837,0.00014078466,0.00013258442,0.000016557828,0.0000013942732,0.00008442468,0.0000024639955,0.00038475645,0.99399304,0.000019842904,0.005061386],"study_design_scores_gemma":[0.00014447497,0.000051898096,0.00029827605,0.000071688264,0.000046396548,0.0000022107122,0.000010389506,0.06209017,0.011346067,0.9258205,0.000013609739,0.000104301515],"about_ca_topic_score_codex":0.000003591796,"about_ca_topic_score_gemma":6.863689e-7,"teacher_disagreement_score":0.5904951,"about_ca_system_score_codex":0.000016515465,"about_ca_system_score_gemma":0.00005678552,"threshold_uncertainty_score":0.99789333},"labels":[],"label_agreement":null},{"id":"W4409449443","doi":"10.1016/j.tcs.2025.115258","title":"Approximation algorithms for maximum weighted throughput on unrelated machines","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Throughput; Algorithm; Computer science; Approximation algorithm; Mathematics","score_opus":0.009445664617846294,"score_gpt":0.2547615915623328,"score_spread":0.2453159269444865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409449443","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.003818227,0.000030624393,0.9885358,0.00041447562,0.0012135784,0.0002307874,0.00000438328,0.0005059783,0.0052461517],"genre_scores_gemma":[0.39358655,0.0000053072804,0.6059592,0.0002861401,0.000094457086,0.000019784064,0.000009547483,0.000012694615,0.00002633752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990034,0.000023780174,0.00019371005,0.00028934955,0.00021017331,0.00027956325],"domain_scores_gemma":[0.99933326,0.00021330609,0.000016853897,0.00024653933,0.00011841447,0.00007165125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190001,0.00013909306,0.00013724461,0.00018184952,0.00021728067,0.00013272838,0.00036871323,0.000066122084,0.000025655881],"category_scores_gemma":[0.00006124448,0.00011537469,0.00004288047,0.0008347482,0.00047434983,0.00012413747,0.000056204717,0.00012912673,0.000023845838],"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.000011376518,0.0000285787,0.000004437516,0.000021601467,0.000010262108,6.019238e-7,0.00009680856,0.08587499,0.000077853394,0.79956853,0.000097448086,0.114207484],"study_design_scores_gemma":[0.00029819703,0.00004596048,0.00004635567,0.000038578644,0.000007309146,0.0000014137106,0.000003397037,0.8816616,0.003387478,0.114330806,0.000060462226,0.00011844337],"about_ca_topic_score_codex":4.5873114e-7,"about_ca_topic_score_gemma":5.7275543e-8,"teacher_disagreement_score":0.7957866,"about_ca_system_score_codex":0.000054258937,"about_ca_system_score_gemma":0.000027297152,"threshold_uncertainty_score":0.47048435},"labels":[],"label_agreement":null},{"id":"W4410091070","doi":"10.1016/j.tcs.2025.115280","title":"Maximal universal width of an AFA is NP-hard","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Computer science; Algorithm; Discrete mathematics","score_opus":0.006597708026147521,"score_gpt":0.2374176688564213,"score_spread":0.23081996083027378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410091070","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.15053363,0.000023289229,0.840888,0.001261761,0.0005278689,0.000096157586,0.000003324703,0.00018897622,0.006476973],"genre_scores_gemma":[0.82399446,0.0000023599725,0.17442507,0.0014951181,0.000038867052,0.0000013813253,5.0230085e-7,0.0000043595105,0.000037921563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997782,0.00011773676,0.00028303184,0.00075081957,0.0005685209,0.0004978943],"domain_scores_gemma":[0.99813664,0.00018953692,0.000073617426,0.001215033,0.00018053946,0.00020466227],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012857885,0.00017975883,0.0002527903,0.00030337507,0.00025431847,0.00026467413,0.00396357,0.000059962254,0.00007393839],"category_scores_gemma":[0.00003809901,0.0001519916,0.000081624705,0.0016488279,0.0030016927,0.0009848209,0.0014583047,0.00016194567,0.000032039596],"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.000012787728,0.000078002864,0.000049058443,0.000008808143,0.00000521841,0.0000101403175,0.00037223872,0.000029838931,0.0016866168,0.9396119,0.000125313,0.05801004],"study_design_scores_gemma":[0.00028363147,0.00022146845,0.0015952687,0.00003844204,0.000006435786,0.000017779535,0.000014664705,0.49452108,0.024539838,0.47831142,0.000266884,0.00018310381],"about_ca_topic_score_codex":0.0000076117885,"about_ca_topic_score_gemma":2.5321103e-7,"teacher_disagreement_score":0.6734608,"about_ca_system_score_codex":0.000049178543,"about_ca_system_score_gemma":0.00022728517,"threshold_uncertainty_score":0.9997116},"labels":[],"label_agreement":null},{"id":"W4411137410","doi":"10.1016/j.tcs.2025.115395","title":"Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Università degli Studi di Milano-Bicocca; Université du Québec en Outaouais","keywords":"Sniffing; Rendezvous; Computer science; Grid; Computer security; Distributed computing; Mathematics; Psychology; Engineering","score_opus":0.021273114272894248,"score_gpt":0.31530384470650036,"score_spread":0.2940307304336061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411137410","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.0133972205,0.000010294954,0.9723757,0.0032748189,0.00044889929,0.00030452907,0.0000011432052,0.00005021304,0.010137175],"genre_scores_gemma":[0.9189322,0.0000022042216,0.07861532,0.0023934317,0.000024788988,0.000011171745,2.1806751e-7,0.0000028151994,0.00001785644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978723,0.00021028354,0.0003352242,0.0004909054,0.0006403102,0.00045100125],"domain_scores_gemma":[0.998535,0.00037644524,0.000046495636,0.00077610713,0.00014821847,0.00011773003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002105256,0.00012124233,0.00017627202,0.00037813326,0.00021592517,0.00031619627,0.0035244727,0.000032401866,0.000013525873],"category_scores_gemma":[0.00023489463,0.000085144406,0.000040989806,0.0027795297,0.0008913692,0.00024393968,0.0010559192,0.00011951731,0.000014191731],"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.0000048087695,0.00006576141,0.00007866713,0.000010583801,0.0000014264232,0.000012821814,0.0013625206,0.003206273,0.00013821879,0.9797917,0.000215894,0.015111311],"study_design_scores_gemma":[0.0002642767,0.00023942189,0.0026495047,0.00009576553,0.0000027876129,0.000014725094,0.000026547894,0.9046473,0.0010495037,0.090602174,0.00025098695,0.00015703977],"about_ca_topic_score_codex":0.000005862032,"about_ca_topic_score_gemma":0.0000042125585,"teacher_disagreement_score":0.905535,"about_ca_system_score_codex":0.000043926186,"about_ca_system_score_gemma":0.00018170617,"threshold_uncertainty_score":0.6549406},"labels":[],"label_agreement":null},{"id":"W4411146828","doi":"10.1016/j.tcs.2025.115392","title":"Full domain functional bootstrapping using the prime cyclotomic ring","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chinese Academy of Sciences; Canadian Anesthesiologists' Society","keywords":"Bootstrapping (finance); Prime (order theory); Ring (chemistry); Domain (mathematical analysis); Mathematics; Computer science; Arithmetic; Discrete mathematics; Combinatorics; Econometrics","score_opus":0.01338887354693723,"score_gpt":0.24919515177760657,"score_spread":0.23580627823066933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411146828","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.14479387,0.000043224118,0.84870815,0.0009857358,0.0010156314,0.00015213055,3.7835994e-7,0.00021020522,0.0040906826],"genre_scores_gemma":[0.9206312,0.0000012460356,0.078334786,0.0008944689,0.000121638885,0.0000060096604,1.6523353e-7,0.0000046576606,0.000005842933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977053,0.00019570124,0.0002782658,0.000699069,0.0005296489,0.0005920085],"domain_scores_gemma":[0.99830353,0.0004163891,0.00006631416,0.00097048905,0.00011731328,0.00012594047],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0023987768,0.00019374522,0.0001694589,0.00031906788,0.0013726506,0.00071236707,0.0027929996,0.00004860063,0.000026171985],"category_scores_gemma":[0.00004372176,0.00013844018,0.00012601171,0.0023436358,0.0029614575,0.0005200262,0.0014638689,0.00029599806,0.00001732266],"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.000018176826,0.000026678019,0.000051306568,0.000004244335,0.000009263004,0.0000033461106,0.00020182086,0.0006238272,0.00914171,0.98027784,0.000012567561,0.0096292365],"study_design_scores_gemma":[0.00014733359,0.000048073867,0.0007082563,0.00004775344,0.0000059207023,0.00003740364,0.000013010235,0.42102185,0.0028472824,0.57479244,0.00018525452,0.00014542318],"about_ca_topic_score_codex":0.000002076132,"about_ca_topic_score_gemma":3.5406686e-7,"teacher_disagreement_score":0.7758373,"about_ca_system_score_codex":0.00007838392,"about_ca_system_score_gemma":0.00022560524,"threshold_uncertainty_score":0.9999274},"labels":[],"label_agreement":null},{"id":"W4411149101","doi":"10.1016/j.tcs.2025.115393","title":"Cuts, cats, and complete graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.013954405158160247,"score_gpt":0.2940944799975862,"score_spread":0.28014007483942593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411149101","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.013871825,0.00016404862,0.9731207,0.0022764264,0.0004077537,0.00020725456,0.0000018074016,0.0002404258,0.009709751],"genre_scores_gemma":[0.8507533,0.000020072366,0.14806172,0.0010798336,0.000020515612,0.00000924199,3.1628903e-7,0.000005190071,0.000049774906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723876,0.0001616882,0.000248763,0.00096553785,0.00062600174,0.00075924647],"domain_scores_gemma":[0.9977806,0.00051269255,0.00003866757,0.0011427127,0.00022004574,0.0003052888],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016434079,0.00019838217,0.00023460321,0.00054702075,0.00071422267,0.0005508714,0.0032352484,0.000047379443,0.00001471949],"category_scores_gemma":[0.00012621074,0.0001666164,0.00005421509,0.0028919983,0.006767168,0.00072611665,0.0027285186,0.00029473667,0.00003685201],"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.0000072111307,0.00002637964,0.00014730688,0.000009814323,0.0000044955045,0.000009429254,0.00011725115,0.000017524204,0.0009896362,0.95142484,0.000067937675,0.047178194],"study_design_scores_gemma":[0.0002060105,0.0000882817,0.00208557,0.000029896964,0.0000024713775,0.000023688484,0.000004816893,0.16476151,0.0013363437,0.8305617,0.0007310192,0.00016867228],"about_ca_topic_score_codex":0.0000032561968,"about_ca_topic_score_gemma":6.927408e-7,"teacher_disagreement_score":0.8368815,"about_ca_system_score_codex":0.00004506431,"about_ca_system_score_gemma":0.00015574123,"threshold_uncertainty_score":0.99593586},"labels":[],"label_agreement":null},{"id":"W4411274961","doi":"10.1016/j.tcs.2025.115414","title":"Parameterized complexity of weighted target set selection","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Artificial Intelligence in Medicine (Canada)","funders":"Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science","keywords":"Parameterized complexity; Set (abstract data type); Selection (genetic algorithm); Mathematics; Computer science; Computational complexity theory; Algorithm; Theoretical computer science; Combinatorics; Artificial intelligence; Programming language","score_opus":0.010843718815755833,"score_gpt":0.260680608681841,"score_spread":0.24983688986608518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411274961","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.5565009,0.000029592653,0.4426895,0.00009796826,0.00007915123,0.000057314952,0.0000020033547,0.000010454392,0.0005331176],"genre_scores_gemma":[0.94541657,0.000003914878,0.054342672,0.00014619436,0.000050924427,0.0000026850757,0.0000105020845,0.0000036427205,0.000022906816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989172,0.00010320804,0.00019446979,0.0003694176,0.0001854717,0.0002302134],"domain_scores_gemma":[0.99935085,0.000018431641,0.000052647854,0.0003385557,0.00017065523,0.0000688436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005145004,0.00010058086,0.00016906405,0.000094408526,0.00012834764,0.000026705278,0.00042424485,0.000058568552,0.000043134973],"category_scores_gemma":[0.00003396473,0.00008756128,0.00008041857,0.0007410642,0.002710042,0.0000038502076,0.00028393994,0.000055970606,0.0000031180437],"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.00010912535,0.000083494335,0.0028548052,0.000019063396,0.00006685196,5.718353e-7,0.000030070754,0.0009891485,0.4938728,0.49832103,0.00036749884,0.0032855687],"study_design_scores_gemma":[0.00030024874,0.00017413641,0.0042930176,0.000013841909,0.000027986596,0.0000045562747,0.0000039862416,0.26531586,0.656283,0.072951645,0.00048195105,0.0001497687],"about_ca_topic_score_codex":0.0000022321165,"about_ca_topic_score_gemma":9.995413e-7,"teacher_disagreement_score":0.42536938,"about_ca_system_score_codex":0.000014474093,"about_ca_system_score_gemma":0.00009982829,"threshold_uncertainty_score":0.99852633},"labels":[],"label_agreement":null},{"id":"W4412031854","doi":"10.1016/j.tcs.2025.115438","title":"Bike-assisted evacuation of robots on a line with asymmetric S/R communication","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Line (geometry); Computer science; Human–computer interaction; Artificial intelligence; Mathematics","score_opus":0.021304030791348322,"score_gpt":0.30058114467350033,"score_spread":0.27927711388215204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412031854","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.0025781414,0.000022895581,0.9816123,0.0029494106,0.00009344007,0.00023226939,5.435742e-7,0.00010611782,0.012404832],"genre_scores_gemma":[0.728725,0.000009388286,0.27078274,0.00044008103,0.0000059456647,0.000006743387,0.0000013675102,0.0000026484377,0.000026062344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982217,0.00018817362,0.0002724624,0.00040735496,0.0006475146,0.00026279502],"domain_scores_gemma":[0.9978699,0.00040382045,0.00009479654,0.0010003733,0.00052688987,0.00010421966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206148,0.00011489628,0.0001676461,0.0006570733,0.0002690947,0.0002192611,0.0019287392,0.000039624996,0.000010373128],"category_scores_gemma":[0.00015367473,0.00008447777,0.00003178608,0.0048743244,0.0012624867,0.00040329053,0.0005547351,0.00016210931,0.000014562299],"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.000015639525,0.00012108142,0.000043145366,0.00000841088,0.0000041888297,5.778441e-7,0.000104171115,0.014442337,0.00011242274,0.9079338,0.000029126297,0.07718511],"study_design_scores_gemma":[0.00040556001,0.00048402708,0.0025075758,0.00011557054,0.000004018325,0.0000030989306,0.0000033209974,0.9520213,0.004228496,0.04009634,0.000029391425,0.00010127716],"about_ca_topic_score_codex":0.000004290072,"about_ca_topic_score_gemma":9.663953e-7,"teacher_disagreement_score":0.937579,"about_ca_system_score_codex":0.000061993545,"about_ca_system_score_gemma":0.00021846192,"threshold_uncertainty_score":0.46516848},"labels":[],"label_agreement":null},{"id":"W4412453354","doi":"10.1016/j.tcs.2025.115455","title":"Path cover using only short paths","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ministry of Science and Technology of the People's Republic of China; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Cover (algebra); Path (computing); Mathematics; Computer science; Algorithm; Combinatorics; Programming language; Engineering","score_opus":0.012300384372274155,"score_gpt":0.2775897903059699,"score_spread":0.26528940593369577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412453354","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.06822662,0.000042628813,0.92430836,0.00048080095,0.0011826608,0.00013307476,0.0000011138828,0.00014113077,0.005483637],"genre_scores_gemma":[0.78010595,0.0000021470846,0.21857892,0.0011680768,0.00009686129,0.0000020688697,0.0000010104501,0.0000029836629,0.000042004118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979137,0.000086020795,0.00026760192,0.0006881606,0.00061996735,0.00042454305],"domain_scores_gemma":[0.9987375,0.00018903932,0.00003311349,0.00061026914,0.00027424988,0.00015579743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010946858,0.00015886922,0.0001663199,0.00032495416,0.00051497313,0.0005376348,0.0015905376,0.00004820905,0.0000264301],"category_scores_gemma":[0.000076137,0.00014052607,0.00006514572,0.0023573153,0.0008666553,0.0007225142,0.0009783227,0.00014750355,0.000045000237],"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.000003263843,0.000045167966,0.00011003545,0.0000058285736,0.000003660674,0.000006750061,0.00006950967,0.0044930447,0.0011981857,0.93050945,0.00011111603,0.06344401],"study_design_scores_gemma":[0.00010434009,0.000055856017,0.0015843707,0.000030646646,0.0000046637574,0.00002704962,0.0000015699388,0.87108696,0.003206669,0.12327104,0.00047138822,0.00015545626],"about_ca_topic_score_codex":0.0000020892817,"about_ca_topic_score_gemma":1.9365466e-7,"teacher_disagreement_score":0.8665939,"about_ca_system_score_codex":0.000101307356,"about_ca_system_score_gemma":0.00061007607,"threshold_uncertainty_score":0.57304865},"labels":[],"label_agreement":null},{"id":"W4413019768","doi":"10.1016/j.tcs.2025.115502","title":"On the complexity of temporal arborescence reconfiguration","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Control reconfiguration; Computer science; Theoretical computer science; Mathematics; Combinatorics; Distributed computing; Embedded system","score_opus":0.02032966206416888,"score_gpt":0.2598789923358944,"score_spread":0.2395493302717255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413019768","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.008472284,0.0000029894338,0.96772087,0.009276794,0.00043722754,0.000157844,9.1997236e-7,0.00007510174,0.013855967],"genre_scores_gemma":[0.94558316,0.0000014250643,0.053315453,0.0010719319,0.000012688785,0.0000033925216,4.392215e-7,0.0000014041232,0.000010076382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987473,0.000114034,0.00023667292,0.00033967083,0.000369849,0.00019248709],"domain_scores_gemma":[0.9987397,0.0003348333,0.000077064746,0.0005992906,0.0001935788,0.000055530254],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00095884793,0.000093403134,0.0001124607,0.00015612718,0.00031705652,0.00017709994,0.0012618994,0.000027520387,0.00008044237],"category_scores_gemma":[0.00017845645,0.00006230039,0.00004081279,0.001208213,0.004444206,0.00027100224,0.00024224982,0.00013130467,0.00001551446],"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.0000051785237,0.00002286717,0.00007780362,0.0000026929063,0.0000017408073,3.7806637e-7,0.00008326186,0.00028009756,0.00024808495,0.9770541,0.00008352475,0.022140272],"study_design_scores_gemma":[0.00007528799,0.000051650204,0.004427812,0.000029595105,0.0000012427275,0.0000017951153,0.000004052205,0.5497103,0.006011894,0.43960893,0.000020918973,0.00005657187],"about_ca_topic_score_codex":0.0000045635848,"about_ca_topic_score_gemma":0.0000017919997,"teacher_disagreement_score":0.9371109,"about_ca_system_score_codex":0.000036731453,"about_ca_system_score_gemma":0.00016307941,"threshold_uncertainty_score":0.99826515},"labels":[],"label_agreement":null},{"id":"W4413388574","doi":"10.1016/j.tcs.2025.115518","title":"Hybrid encryption in correlated randomness model and KEM combiners","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Encryption; Computer science; Cryptography; Mathematics; Theoretical computer science; Algorithm; Statistics; Computer security","score_opus":0.0050077255866025905,"score_gpt":0.2328723140003809,"score_spread":0.2278645884137783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413388574","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.22534165,0.000034143017,0.7715931,0.00091572554,0.0003727505,0.0002186343,7.244594e-7,0.00015460489,0.0013686939],"genre_scores_gemma":[0.9481289,0.000011166487,0.051044058,0.00076237007,0.000015294328,0.000011906566,0.00000129424,0.000005386977,0.000019615942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766064,0.00014710081,0.00036533992,0.00082346995,0.000494828,0.0005086374],"domain_scores_gemma":[0.9986988,0.00032685243,0.00006199953,0.0005804486,0.0001617679,0.0001701673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017904358,0.00020728407,0.00027082113,0.00053202844,0.00024342306,0.00039354197,0.001372917,0.000054897548,0.000007008423],"category_scores_gemma":[0.00013094152,0.00018673287,0.000045889778,0.0015224942,0.0019049713,0.00095874775,0.00087839423,0.0003027073,0.0000186291],"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.000048414542,0.00006409415,0.000097003656,0.000011787973,0.0000023492703,0.000014619108,0.00019106065,0.012348101,0.0028752966,0.96296054,0.000040819275,0.021345923],"study_design_scores_gemma":[0.0012197183,0.00005284609,0.0007073235,0.00006615016,0.0000036621336,0.000016007267,0.000003290843,0.73326343,0.001801642,0.26270828,0.0000049051296,0.00015275685],"about_ca_topic_score_codex":0.000010578354,"about_ca_topic_score_gemma":8.0082225e-7,"teacher_disagreement_score":0.72278726,"about_ca_system_score_codex":0.00014543731,"about_ca_system_score_gemma":0.00023271919,"threshold_uncertainty_score":0.76147455},"labels":[],"label_agreement":null},{"id":"W4413682904","doi":"10.1016/j.tcs.2025.115529","title":"Hypergraph burning, matchings, and zero forcing","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Forcing (mathematics); Zero (linguistics); Mathematics; Combinatorics; Computer science; Mathematical analysis; Linguistics","score_opus":0.0032420095419759543,"score_gpt":0.24814837774201168,"score_spread":0.24490636820003572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413682904","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.18312709,0.00002211304,0.79857135,0.00021686224,0.00005725467,0.000056501423,4.518177e-7,0.00006880842,0.01787959],"genre_scores_gemma":[0.96768874,0.0000010217145,0.03203854,0.00017183644,0.000060318118,0.000003945321,7.241583e-7,0.0000035824364,0.00003128135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990828,0.000029526145,0.00014280227,0.00032494048,0.00015682084,0.00026312226],"domain_scores_gemma":[0.99947655,0.00010603669,0.000030706185,0.00025683973,0.000053611093,0.00007628402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004834649,0.0001027579,0.00014902884,0.00014122405,0.00033910127,0.00019607229,0.00040385933,0.0000134567645,0.000070428396],"category_scores_gemma":[0.0000052088562,0.000085697175,0.000049061786,0.000623334,0.0011544252,0.00011549272,0.0004840249,0.00012370574,0.0000037518312],"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.0000016595804,0.00001250561,0.0050470214,0.0000020423747,0.0000070510273,3.0714108e-7,0.000054256714,0.000030504802,0.0002606678,0.944344,0.00012935982,0.05011064],"study_design_scores_gemma":[0.00007446476,0.000020515134,0.0016309846,0.000038550595,0.000014228352,7.3574535e-7,0.000007895667,0.13368349,0.001644049,0.86242616,0.00035681998,0.0001020762],"about_ca_topic_score_codex":0.00001779434,"about_ca_topic_score_gemma":2.0926751e-7,"teacher_disagreement_score":0.78456163,"about_ca_system_score_codex":0.000010735808,"about_ca_system_score_gemma":0.00002746602,"threshold_uncertainty_score":0.42535278},"labels":[],"label_agreement":null},{"id":"W4414001959","doi":"10.1016/j.tcs.2025.115537","title":"Succinct encodings of binary trees with application to AVL trees","year":2025,"lang":"en","type":"article","venue":"Theoretical 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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Weight-balanced tree; Binary tree; Binary number; Binary search tree; Mathematics; Random binary tree; Computer science; Combinatorics; Arithmetic","score_opus":0.004659458754043663,"score_gpt":0.24415116376089935,"score_spread":0.23949170500685568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414001959","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.049364336,0.000022015254,0.9468206,0.0013466536,0.00016521347,0.0002214712,0.0000024454275,0.00011984822,0.0019373774],"genre_scores_gemma":[0.77019787,0.0000020860207,0.22938816,0.00035273164,0.000028121705,0.000011281355,9.384094e-7,0.0000031955417,0.000015587219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807453,0.00004808922,0.00025730245,0.00071513763,0.0005512049,0.00035373506],"domain_scores_gemma":[0.9983037,0.00018883838,0.000069747795,0.0010526697,0.00020945525,0.00017559493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068713236,0.000159917,0.0002226381,0.00032487285,0.00026886634,0.00018757841,0.0027054814,0.000036941932,0.000008689479],"category_scores_gemma":[0.000032684555,0.000110875866,0.00003714319,0.0021717243,0.0010653847,0.0005794465,0.0015138412,0.000106932064,0.00001894715],"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.000021272748,0.00007197476,0.00023718312,0.0000073501287,0.0000031350824,0.000002783344,0.00020025998,0.0005845967,0.00674274,0.90954286,0.00013575387,0.08245009],"study_design_scores_gemma":[0.0003286219,0.00059950777,0.019919824,0.00016156065,0.000007978855,0.000010849079,0.0000122131005,0.90716547,0.02460145,0.046189144,0.00074538216,0.00025798724],"about_ca_topic_score_codex":0.000018377814,"about_ca_topic_score_gemma":0.0000032849396,"teacher_disagreement_score":0.90658087,"about_ca_system_score_codex":0.000039915543,"about_ca_system_score_gemma":0.00014736425,"threshold_uncertainty_score":0.5027503},"labels":[],"label_agreement":null},{"id":"W4415340732","doi":"10.1016/j.tcs.2025.115597","title":"Degrees are useless in Snort when measuring temperature","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","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":"Memorial University of Newfoundland; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Degree (music); Graph; Measure (data warehouse); Simple (philosophy); Position (finance)","score_opus":0.013955894777330653,"score_gpt":0.2413300981591317,"score_spread":0.22737420338180106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415340732","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.06428794,0.00009285349,0.92825836,0.0038102055,0.00031310084,0.00017117528,0.0000011858724,0.0001603655,0.002904825],"genre_scores_gemma":[0.837678,0.000004123971,0.16175114,0.00045709035,0.000050567396,0.000019312633,3.9295074e-7,0.0000030132994,0.0000363274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814653,0.00006479564,0.0002405043,0.0006821978,0.00043309477,0.00043285787],"domain_scores_gemma":[0.9987779,0.0001406681,0.00004180397,0.00074429816,0.00017221564,0.00012308246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008659633,0.00014465574,0.00017340368,0.00028147374,0.00041218134,0.00035783573,0.002442935,0.000057609956,0.000009737392],"category_scores_gemma":[0.000046089935,0.0001238466,0.000042940945,0.0018889148,0.0010288564,0.00058334117,0.0009599795,0.00025836832,0.000023821445],"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.0000014408706,0.00006681928,0.0018593483,0.0000057755224,0.0000018611966,0.0000064881974,0.00015510146,0.0005368267,0.0003851634,0.988828,0.00011260791,0.00804059],"study_design_scores_gemma":[0.00022278307,0.00002643664,0.064057805,0.00011871591,0.0000024411124,0.000014418844,0.000015224259,0.64809805,0.0014471837,0.285479,0.00029567716,0.00022228363],"about_ca_topic_score_codex":0.000008107928,"about_ca_topic_score_gemma":0.000006846146,"teacher_disagreement_score":0.7733901,"about_ca_system_score_codex":0.00009740773,"about_ca_system_score_gemma":0.0001963978,"threshold_uncertainty_score":0.50503176},"labels":[],"label_agreement":null},{"id":"W4415985875","doi":"10.1016/j.tcs.2025.115642","title":"Single machine controllable scheduling with bounded makespan","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","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 Alberta","funders":"Natural Science Foundation of Ningbo; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Job shop scheduling; Bounded function; Scheduling (production processes); Time complexity; Upper and lower bounds; Dynamic programming; Approximation algorithm","score_opus":0.005159755932363986,"score_gpt":0.21021545954933094,"score_spread":0.20505570361696696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415985875","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.03508252,0.00010976372,0.950044,0.000348375,0.00041566408,0.000092305076,0.0000010406869,0.00043011608,0.01347622],"genre_scores_gemma":[0.6621849,0.0000016825694,0.33753467,0.00020713636,0.000034213863,0.0000028462923,8.6001273e-7,0.0000075631783,0.000026167005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990043,0.00001844769,0.00014838269,0.0002526998,0.0002392,0.00033695376],"domain_scores_gemma":[0.99941057,0.000091689835,0.000013203489,0.00026832073,0.00010730597,0.00010889241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036818333,0.00012870811,0.00015458054,0.0001472808,0.00021570231,0.00027655953,0.0003732232,0.000036291014,0.000049976356],"category_scores_gemma":[0.000038069753,0.00010127009,0.000022438415,0.000918604,0.0009153375,0.00013325633,0.000071338545,0.00014321686,0.000021377844],"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.00002176769,0.000035174173,0.00007404998,0.000015999201,0.000015430183,0.000004946237,0.000082165934,0.37112877,0.0009781881,0.6145296,0.000011789353,0.0131021105],"study_design_scores_gemma":[0.00045348195,0.000057840574,0.000040672934,0.000046279143,0.000008902819,0.0000061696323,0.000008733367,0.98472804,0.006780719,0.007653898,0.000082434926,0.00013283463],"about_ca_topic_score_codex":0.0000012267093,"about_ca_topic_score_gemma":9.158374e-7,"teacher_disagreement_score":0.6271024,"about_ca_system_score_codex":0.000059266462,"about_ca_system_score_gemma":0.000052284628,"threshold_uncertainty_score":0.4129674},"labels":[],"label_agreement":null},{"id":"W4416683196","doi":"10.1016/j.tcs.2025.115656","title":"A tractability gap beyond nim-sums: It’s hard to tell whether a bunch of superstars are losers","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Artificial Intelligence in Games","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":"Mount Saint Vincent University","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Blackout; Simple (philosophy); Intersection (aeronautics); Game theory; Coin flipping","score_opus":0.027934155587959867,"score_gpt":0.30095544958869885,"score_spread":0.273021294000739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416683196","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.20986421,0.00002412566,0.7727018,0.010345404,0.0008604476,0.0004084734,0.000007497152,0.00014162512,0.0056464206],"genre_scores_gemma":[0.8861919,0.0000031935642,0.110142015,0.0035126633,0.00005005366,0.000014322373,2.3175501e-7,0.000008836408,0.00007674935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590576,0.00022218606,0.0006926259,0.0012875015,0.0010471501,0.00084476755],"domain_scores_gemma":[0.9963918,0.00075999706,0.0001205239,0.0017586668,0.0005846447,0.0003844016],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0027002126,0.00030407263,0.00046591723,0.00043122855,0.00030474475,0.00031357037,0.0047139265,0.00010806407,0.000121682126],"category_scores_gemma":[0.0006335639,0.0002605144,0.0001644233,0.002890264,0.0044877296,0.00073963945,0.0017028169,0.00031760248,0.00015110322],"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.00003597077,0.00023256842,0.00138043,0.00003243114,0.0000111914915,0.000008846326,0.003792936,0.0006294843,0.003776882,0.9569658,0.0011941053,0.031939372],"study_design_scores_gemma":[0.00021201193,0.0006961675,0.0063432325,0.00030688784,0.000022060829,0.000014405317,0.00055585575,0.3009477,0.12311936,0.5653357,0.0016986394,0.0007480231],"about_ca_topic_score_codex":0.000038709542,"about_ca_topic_score_gemma":0.000018556073,"teacher_disagreement_score":0.6763277,"about_ca_system_score_codex":0.00017899573,"about_ca_system_score_gemma":0.00038943248,"threshold_uncertainty_score":0.9999847},"labels":[],"label_agreement":null},{"id":"W571512295","doi":"10.1016/j.tcs.2015.06.010","title":"Improved parameterized and exact algorithms for cut problems on trees","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Parameterized complexity; Algorithm; Mathematics; Computer science","score_opus":0.03578921010753701,"score_gpt":0.2855609249262834,"score_spread":0.24977171481874638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571512295","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.035693787,0.000025716983,0.9616813,0.0010752274,0.0006180552,0.00038701322,0.0000025427248,0.00012605479,0.00039030853],"genre_scores_gemma":[0.6790429,0.000001743629,0.3203383,0.00043805043,0.00012914099,0.000026381065,0.0000020511154,0.000004607322,0.000016874958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819547,0.0000703225,0.00022157142,0.0006803572,0.00045153144,0.0003807239],"domain_scores_gemma":[0.99856025,0.00036672663,0.00006329592,0.00039454518,0.00026923983,0.00034593022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014937588,0.00016328106,0.00017964504,0.0001850425,0.00025749646,0.00053439266,0.0008500497,0.00004224563,0.0000022290315],"category_scores_gemma":[0.0001822844,0.00012918492,0.000043868742,0.000653449,0.0007414943,0.00054017984,0.00036669796,0.000090392634,0.000009148178],"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.000026996357,0.00006457581,0.0000041735098,0.0000053841277,0.0000036888284,0.0000012603518,0.00036963087,0.0017968394,0.0016152939,0.84228534,0.000057891564,0.15376894],"study_design_scores_gemma":[0.0006191986,0.00095718773,0.00012977458,0.000011626419,0.0000030093374,0.000018852576,0.000003915379,0.85756326,0.0041407878,0.13595788,0.00042745308,0.00016704403],"about_ca_topic_score_codex":0.0000019136162,"about_ca_topic_score_gemma":6.0368205e-7,"teacher_disagreement_score":0.8557664,"about_ca_system_score_codex":0.000043592678,"about_ca_system_score_gemma":0.00014898699,"threshold_uncertainty_score":0.5268008},"labels":[],"label_agreement":null},{"id":"W613960602","doi":"10.1016/j.tcs.2015.06.019","title":"The decidability of the intensional fragment of classical linear logic","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decidability; Fragment (logic); Substructural logic; Mathematics; Sequent calculus; Linear logic; Sequent; Intermediate logic; Linear temporal logic; Propositional calculus; Natural deduction; Discrete mathematics; Zeroth-order logic; Algorithm; Programming language; Computer science; Description logic; Multimodal logic; Mathematical proof","score_opus":0.030566280566346672,"score_gpt":0.2724491367975593,"score_spread":0.2418828562312126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W613960602","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.027935589,0.000053211825,0.96602595,0.0026014615,0.0013556726,0.00023935722,3.6969996e-7,0.000038893613,0.0017494779],"genre_scores_gemma":[0.9795774,0.0000010031687,0.020115742,0.00020648823,0.000078589415,0.0000044970407,8.187369e-8,0.000002617911,0.000013544474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747103,0.00026550985,0.00040008125,0.00039027154,0.0011245422,0.00034853394],"domain_scores_gemma":[0.99735934,0.0005355855,0.00015798646,0.0011096221,0.00065225834,0.00018523363],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0036978347,0.00011768707,0.0002051417,0.00003562676,0.00025761192,0.00009441851,0.003419081,0.00004945407,0.0000035334067],"category_scores_gemma":[0.00061124994,0.00005190236,0.000109349174,0.00079688086,0.006494786,0.00014623537,0.0019220413,0.0001801011,0.000013352228],"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.0000093892095,0.00007371705,0.00046774422,0.0000042689117,0.0000030825775,8.922964e-7,0.00029823836,0.00008589367,0.00010947583,0.9904607,0.0000845572,0.008402024],"study_design_scores_gemma":[0.00017660626,0.0003039315,0.0022978422,0.0000078139055,0.000003660738,0.000019352225,0.000025122874,0.28692335,0.0039251884,0.7053609,0.0008656239,0.00009063654],"about_ca_topic_score_codex":0.0000075437474,"about_ca_topic_score_gemma":0.0000016124206,"teacher_disagreement_score":0.95164186,"about_ca_system_score_codex":0.000051643994,"about_ca_system_score_gemma":0.000320991,"threshold_uncertainty_score":0.99620897},"labels":[],"label_agreement":null},{"id":"W646988672","doi":"10.1016/j.tcs.2015.05.034","title":"Competitive algorithms for unbounded one-way trading","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Hebei Province; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Competitive analysis; Upper and lower bounds; Value (mathematics); Online algorithm; Product (mathematics); Combinatorics; Mathematics; Integer (computer science); Function (biology); Revenue; Logarithm; Sequence (biology); Algorithm; Discrete mathematics; Computer science; Economics; Statistics; Finance","score_opus":0.06660840790346818,"score_gpt":0.31207445656924127,"score_spread":0.2454660486657731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W646988672","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.0004173448,0.000014067651,0.9797343,0.0026115326,0.0006714808,0.00039579495,0.0000029165114,0.00025999546,0.01589259],"genre_scores_gemma":[0.48439103,0.0000013550259,0.5148932,0.00056554814,0.000101384125,0.000015553174,0.000001408543,0.000006385036,0.00002413536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973794,0.00011404896,0.0002684953,0.0007072992,0.00085375283,0.00067700964],"domain_scores_gemma":[0.99781394,0.00032034755,0.000060805185,0.0005712073,0.00061768596,0.00061602413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025210963,0.00016469092,0.00021853484,0.00020371769,0.0004255663,0.0008444858,0.0022846635,0.00004935837,0.000021749893],"category_scores_gemma":[0.00019790587,0.00014434168,0.00006534042,0.001122163,0.0019751536,0.00094925304,0.00065191614,0.00015737486,0.00005416313],"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.0000070549127,0.00006720281,0.0000045227353,0.0000045071683,0.0000038073683,0.0000022784036,0.00088840094,0.00039785326,0.000083510145,0.98306537,0.00015058686,0.015324879],"study_design_scores_gemma":[0.00047507015,0.00030603042,0.000027367238,0.000016492946,0.0000020266677,0.000014371201,0.000018885517,0.71626174,0.0012837842,0.28068468,0.00074326,0.00016628964],"about_ca_topic_score_codex":0.0000021264323,"about_ca_topic_score_gemma":5.31538e-7,"teacher_disagreement_score":0.7158639,"about_ca_system_score_codex":0.00012322333,"about_ca_system_score_gemma":0.00031659828,"threshold_uncertainty_score":0.81433964},"labels":[],"label_agreement":null},{"id":"W7106241308","doi":"10.1016/j.tcs.2025.115658","title":"Distance-restricted firefighting on finite graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; Verafin (Canada); University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Neighbourhood (mathematics); Firefighting; Vertex (graph theory); Graph; Rest (music); Integer (computer science)","score_opus":0.013059116869591521,"score_gpt":0.29111173967843534,"score_spread":0.2780526228088438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106241308","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.0076921917,0.000040333234,0.9625649,0.0015149474,0.00067294796,0.00022444586,0.0000018090502,0.0004116851,0.026876742],"genre_scores_gemma":[0.9300539,0.000008883853,0.068615235,0.0011305247,0.00003825374,0.000017733682,7.317399e-7,0.000008012045,0.00012675523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963061,0.00021222768,0.00034414037,0.0011442684,0.0010118842,0.0009813327],"domain_scores_gemma":[0.9962408,0.0015639672,0.00006680012,0.0015654393,0.0002754123,0.00028761482],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012312813,0.00025804408,0.0002552199,0.00076367677,0.0009176748,0.00057441706,0.0046614534,0.000065326145,0.000020856422],"category_scores_gemma":[0.00055634324,0.00020892388,0.00010346091,0.0062268768,0.0035353624,0.00068132184,0.0015805135,0.0004673753,0.000090186666],"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.000023271812,0.000065836946,0.00007792471,0.0000072643643,0.0000047382,0.000019963809,0.00008505943,0.0005288845,0.00029192885,0.939837,0.00008501329,0.05897311],"study_design_scores_gemma":[0.00021974485,0.00014952593,0.00070827885,0.00006868854,0.0000018064917,0.0000030616764,0.0000025340048,0.35282585,0.003227195,0.6418998,0.0007146677,0.00017883138],"about_ca_topic_score_codex":0.0000016133074,"about_ca_topic_score_gemma":3.2286061e-7,"teacher_disagreement_score":0.9223617,"about_ca_system_score_codex":0.00010638533,"about_ca_system_score_gemma":0.00020328154,"threshold_uncertainty_score":0.99917644},"labels":[],"label_agreement":null},{"id":"W7116681940","doi":"10.1016/j.tcs.2025.115721","title":"A self-generating sequence","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Sequence (biology); Mathematical proof; Connection (principal bundle); Term (time); Property (philosophy)","score_opus":0.00951093124382479,"score_gpt":0.2583813853861232,"score_spread":0.24887045414229841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116681940","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.019612312,0.000064746666,0.9656688,0.0014137828,0.0008532926,0.00012745798,6.0259276e-7,0.00076630723,0.011492681],"genre_scores_gemma":[0.6122317,0.0000031147626,0.38593432,0.0017467852,0.00005596699,0.0000058370965,2.0107599e-7,0.000003052593,0.00001904844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977217,0.00011110477,0.00027294605,0.00080160145,0.0004878207,0.0006048842],"domain_scores_gemma":[0.99828804,0.00027637114,0.000050589257,0.0010587174,0.00015522153,0.0001710547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001686532,0.00018156553,0.00018729904,0.00024122557,0.0006242628,0.00078676565,0.0035879125,0.00004903725,0.000017582632],"category_scores_gemma":[0.00008933603,0.00014917461,0.000062273575,0.0020614478,0.0014077413,0.00078025943,0.0016846159,0.0001889204,0.0000743776],"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.0000010614167,0.000033901015,0.000018741417,0.000007891021,0.000003692013,0.000010719935,0.00020362364,0.00005264525,0.002795747,0.92519593,0.000058948768,0.07161712],"study_design_scores_gemma":[0.00010372454,0.0000410115,0.00008182111,0.00003115145,0.000002752472,0.000020420954,0.0000035911996,0.7350049,0.008476452,0.25574937,0.00033887505,0.00014589395],"about_ca_topic_score_codex":0.0000021856702,"about_ca_topic_score_gemma":2.3098482e-7,"teacher_disagreement_score":0.7349523,"about_ca_system_score_codex":0.000089391215,"about_ca_system_score_gemma":0.00028513238,"threshold_uncertainty_score":0.7586799},"labels":[],"label_agreement":null},{"id":"W7117429158","doi":"10.1016/j.tcs.2025.115729","title":"Border tracing in oriented adjacency graphs of polygonal tilings","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Adjacency list; Polygon mesh; Tracing; Regular polygon; Hexagonal crystal system; Hexagonal tiling; Adjacency matrix","score_opus":0.004747453472165628,"score_gpt":0.2541377186465959,"score_spread":0.24939026517443028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117429158","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.94927907,0.00011909358,0.047036927,0.00024367137,0.00046809815,0.00009949863,0.0000032508215,0.00003244612,0.0027179508],"genre_scores_gemma":[0.99082106,0.0000034174711,0.0089373905,0.00020234988,0.000016949849,0.0000023157404,3.3577604e-7,0.0000033121826,0.000012886838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985742,0.00006210823,0.00030002414,0.00036036706,0.0003487529,0.00035454376],"domain_scores_gemma":[0.9994355,0.00009673597,0.00004630831,0.00024691893,0.000107264175,0.000067272704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008460206,0.000105956104,0.00019179925,0.00018610185,0.0001395945,0.000064467604,0.00058740133,0.000039627528,0.0002938498],"category_scores_gemma":[0.000086509346,0.00007975697,0.000039731527,0.0009908268,0.0026032627,0.00018373501,0.00028491675,0.00011195466,0.0000059761314],"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.000050563274,0.00003166509,0.00045674978,0.000024451416,8.924873e-7,0.000002030114,0.00043312393,0.0001018434,0.19090432,0.80001026,0.0000063049833,0.007977773],"study_design_scores_gemma":[0.000525479,0.00023446267,0.015117257,0.00027697845,0.000008225588,0.000009277487,0.00007518938,0.026637571,0.60244894,0.35426515,0.00013778386,0.00026370198],"about_ca_topic_score_codex":0.00004245061,"about_ca_topic_score_gemma":0.0000044761737,"teacher_disagreement_score":0.44574514,"about_ca_system_score_codex":0.000026109074,"about_ca_system_score_gemma":0.000110531044,"threshold_uncertainty_score":0.9591829},"labels":[],"label_agreement":null},{"id":"W847683642","doi":"10.1016/j.tcs.2015.07.006","title":"Operational state complexity of unary NFAs with finite nondeterminism","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"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":"National Science Council","keywords":"Unary operation; Concatenation (mathematics); TRACE (psycholinguistics); Regular language; State (computer science); Discrete mathematics; Upper and lower bounds; Property (philosophy); Mathematics; Tree (set theory); Computer science; Combinatorics; Finite-state machine; Algorithm; Theoretical computer science; Automaton","score_opus":0.033405676861885426,"score_gpt":0.2602477206608893,"score_spread":0.22684204379900388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W847683642","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.120785154,0.0000136697545,0.875298,0.0006816927,0.00026179524,0.000118723794,0.0000060559714,0.0001288407,0.0027060215],"genre_scores_gemma":[0.75801516,6.943121e-7,0.24136534,0.00055617583,0.00004167575,0.000003256253,0.000001464052,0.000005709606,0.000010509053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756646,0.0001288091,0.00030916536,0.0005820496,0.0009750124,0.00043851818],"domain_scores_gemma":[0.9980909,0.00024943746,0.00010028985,0.0008266799,0.00037071155,0.00036193742],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015774054,0.0001839887,0.00025125674,0.0001577242,0.00019395132,0.0002643225,0.0023219555,0.000031039206,0.00002532219],"category_scores_gemma":[0.000059384478,0.00013097216,0.000041798714,0.0008839383,0.005792852,0.00089191855,0.0010070772,0.00014732691,0.000044708435],"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.000022051367,0.000077232115,0.000107171014,0.0000051732254,0.0000043164514,0.000022909313,0.0008933781,0.0009790703,0.000259633,0.98989683,0.00003828468,0.00769393],"study_design_scores_gemma":[0.00035957745,0.00050954206,0.0010801455,0.000027239199,0.0000024053522,0.00006597055,0.000010764187,0.62840915,0.005368815,0.36393753,0.00004643262,0.00018243268],"about_ca_topic_score_codex":0.0000069939874,"about_ca_topic_score_gemma":7.5520853e-7,"teacher_disagreement_score":0.63723,"about_ca_system_score_codex":0.000040407776,"about_ca_system_score_gemma":0.00041779748,"threshold_uncertainty_score":0.99691284},"labels":[],"label_agreement":null},{"id":"W941738672","doi":"10.1016/j.tcs.2015.06.037","title":"Three overlapping squares: The general case characterized &amp; applications","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Computer science; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.033579848746125164,"score_gpt":0.29099748231754263,"score_spread":0.25741763357141745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W941738672","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.020977633,0.000048754944,0.97563195,0.0014330897,0.0005474216,0.0003365561,0.000005959309,0.00022639483,0.00079226296],"genre_scores_gemma":[0.60418075,0.0000029908435,0.39421612,0.000997429,0.00053572515,0.000039702314,0.000005108172,0.000009202854,0.0000129583295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758166,0.00009244618,0.00028629586,0.000725656,0.0007745288,0.0005394331],"domain_scores_gemma":[0.9972298,0.0002063099,0.00009417694,0.0017764011,0.00027064036,0.00042264364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017158152,0.00019208292,0.00018406153,0.000104363986,0.00087192626,0.0009163247,0.0032891997,0.000047073238,0.000022323955],"category_scores_gemma":[0.000062262465,0.00011936469,0.00006174592,0.0010895627,0.0017208265,0.00095483894,0.0023616953,0.00023449924,0.00019055602],"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.000004408985,0.00003865061,0.000014915447,0.000002168359,0.0000026441958,0.00004464478,0.0004150731,0.00006537784,0.00040661945,0.9433306,0.0003452497,0.05532966],"study_design_scores_gemma":[0.00029163974,0.000064904365,0.00020554652,0.000013608365,0.0000047887397,0.001154362,0.00001103807,0.8332849,0.0001642032,0.15348189,0.011083521,0.00023960667],"about_ca_topic_score_codex":0.000041268722,"about_ca_topic_score_gemma":0.0000076293045,"teacher_disagreement_score":0.8332195,"about_ca_system_score_codex":0.00006462317,"about_ca_system_score_gemma":0.00020367879,"threshold_uncertainty_score":0.883614},"labels":[],"label_agreement":null}]}