{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":797,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":797,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"b418dfbd2b2b","filters":{"venue":"Theoretical Computer Science"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008955706879752091,"gpt":0.2367619103129184,"spread":0.2278062034331663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835954,0.00008841539,0.00009595935,0.00003902059,0.0004884673,0.0003271669,0.0002731773,0.00001550862,0.00005646053],"category_scores_gemma":[0.00001008842,0.00007345195,0.00003216958,0.0003828218,0.001090846,0.0001495862,0.0001679368,0.00009207724,0.00001778146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007210451,"about_ca_system_score_gemma":0.00002381701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006546975,"about_ca_topic_score_gemma":1.603258e-7,"domain_scores_codex":[0.999085,0.0000353849,0.0001212261,0.0002947287,0.0001815849,0.0002820553],"domain_scores_gemma":[0.9994026,0.00007615775,0.00003666984,0.0002338791,0.00007481846,0.0001758673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[8.083028e-7,0.00002713229,0.0004200334,0.000001161044,0.000001521869,3.844325e-8,0.00002316202,0.000001188439,0.0003081359,0.9745163,0.00002597023,0.02467458],"study_design_scores_gemma":[0.00006983048,0.00003307785,0.0009652289,0.000005475862,0.00000284952,7.416559e-7,0.000005744172,0.3131243,0.0004534345,0.6844707,0.0007910682,0.00007760459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2718746,0.000003013213,0.7265786,0.0005667359,0.00006733809,0.00005212972,0.000006606084,0.00002670452,0.0008243151],"genre_scores_gemma":[0.9953542,3.943514e-7,0.004405288,0.00007624061,0.0001412222,0.000006895567,0.00001093123,0.00000426327,5.064271e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7234797,"threshold_uncertainty_score":0.4019266,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02259862416624663,"gpt":0.2786496916886596,"spread":0.256051067522413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093478,0.0001572823,0.0001792822,0.0001093749,0.0003958843,0.0002783721,0.002104458,0.00003167211,0.000004938169],"category_scores_gemma":[0.00007886865,0.0001277642,0.00001603087,0.0006316602,0.002052814,0.002180225,0.004688387,0.0001371192,0.00002219253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003171181,"about_ca_system_score_gemma":0.0001089446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001297832,"about_ca_topic_score_gemma":0.000005115624,"domain_scores_codex":[0.9979727,0.00003425291,0.0002081312,0.0008594324,0.0004611113,0.0004643609],"domain_scores_gemma":[0.9977688,0.00008735156,0.00005110541,0.00177212,0.00008031623,0.0002403538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001432655,0.00001559093,0.00002306982,0.00001702148,0.000001658513,0.00002488542,0.0002260281,0.00008875658,0.0003442235,0.9828438,0.00001548445,0.01639808],"study_design_scores_gemma":[0.001002128,0.0003760813,0.001634038,0.0003267597,0.00001198768,0.000733096,0.0000512466,0.6843181,0.006629903,0.2874835,0.01636316,0.001069931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01358492,0.0001313252,0.9838517,0.001216117,0.0004983465,0.0001093778,0.00001632541,0.0001892188,0.0004027019],"genre_scores_gemma":[0.5212381,0.00002006895,0.4783563,0.0002702004,0.0001034088,0.000001676755,0.000002649328,0.000004900767,0.000002654604],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6953602,"threshold_uncertainty_score":0.7563677,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2025090972907981,"gpt":0.4631392662511002,"spread":0.2606301689603022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004961226,0.0001914336,0.0003035006,0.0006995567,0.000421003,0.0007090758,0.001706918,0.00006412726,0.0001115561],"category_scores_gemma":[0.003552325,0.0001460072,0.00005309462,0.0037928,0.00208444,0.002605985,0.0002164279,0.0002780382,0.0001256053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001589192,"about_ca_system_score_gemma":0.0001891846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003252734,"about_ca_topic_score_gemma":0.000002405841,"domain_scores_codex":[0.9950902,0.0002316002,0.0006439523,0.0009440239,0.002380779,0.0007093957],"domain_scores_gemma":[0.9970365,0.001455825,0.0001241576,0.000624703,0.0004865764,0.0002722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001266582,0.0005823241,0.0006630308,0.000005642567,0.000003935347,0.0001123606,0.004644006,0.2623552,0.01075951,0.4575307,0.00007088121,0.2631457],"study_design_scores_gemma":[0.0003203843,0.0001068653,0.006729311,0.00001971784,0.000001105849,0.00001022147,0.00005283072,0.6571352,0.002933874,0.3325493,0.00001185038,0.0001293375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05795958,0.00002653591,0.9399899,0.001227842,0.0003182754,0.000268552,0.000002364089,0.00006324568,0.0001436943],"genre_scores_gemma":[0.7182841,0.000002867622,0.281456,0.0001675178,0.00006754688,0.000004698677,7.909129e-7,0.00000566004,0.00001083677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6603246,"threshold_uncertainty_score":0.7680205,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009916927238760042,"gpt":0.277172667654482,"spread":0.2672557404157219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001091125,0.0002141118,0.0002158743,0.0003730608,0.0006275537,0.0004107201,0.002306318,0.00005875137,0.00001008116],"category_scores_gemma":[0.00005666094,0.000174196,0.0001652709,0.001483175,0.003165206,0.0009917768,0.0005823653,0.0001363754,0.000005796429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002936641,"about_ca_system_score_gemma":0.00005708399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000132814,"about_ca_topic_score_gemma":2.436396e-7,"domain_scores_codex":[0.9976523,0.00006397354,0.000275722,0.0007806669,0.0004826871,0.0007446874],"domain_scores_gemma":[0.9984195,0.0003086807,0.00006218022,0.0007369823,0.0002481526,0.0002244714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001712771,0.00006470961,0.0001189305,0.000006485463,0.000003344459,0.000004954084,0.0002325342,0.000009559226,0.0005250167,0.9378797,0.00003523062,0.06110234],"study_design_scores_gemma":[0.000193983,0.0004687557,0.000741124,0.00002123733,0.000003329778,0.00004404199,0.000007340608,0.1316076,0.01090179,0.8545012,0.001234161,0.0002754253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02256176,0.00003102417,0.9735809,0.000535443,0.0004333018,0.0003124368,0.000001417315,0.000771496,0.001772231],"genre_scores_gemma":[0.5860887,0.000007811394,0.4134405,0.0003391693,0.00008133745,0.00003283106,5.060098e-7,0.000005791882,0.000003372356],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5635269,"threshold_uncertainty_score":0.9995476,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007225679416192487,"gpt":0.2328950077014554,"spread":0.2256693282852629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00180313,0.0002294849,0.0002607886,0.0001737529,0.0002358354,0.0004836553,0.002820535,0.0001009793,0.001214964],"category_scores_gemma":[0.00002204384,0.0002034016,0.00006457797,0.001577433,0.002310702,0.0009359021,0.0005330227,0.0003987852,0.0004082872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113795,"about_ca_system_score_gemma":0.0000684191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002832466,"about_ca_topic_score_gemma":0.000001560132,"domain_scores_codex":[0.9968625,0.000197813,0.0003876212,0.0009578327,0.0006465561,0.0009476428],"domain_scores_gemma":[0.9981197,0.0002743434,0.00005024638,0.00116574,0.00006030354,0.0003296546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001207041,0.00006430415,0.0006127513,0.000001867375,0.000001770746,0.00004075623,0.0002246759,0.01155432,0.00001531883,0.8853256,0.000230161,0.1019164],"study_design_scores_gemma":[0.0003390368,0.0001326277,0.01170076,0.00003927324,0.000001369918,0.00007032013,9.530884e-7,0.9508087,0.00008643256,0.03604455,0.0004965597,0.0002794209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.105109,0.00009465164,0.8851866,0.0004240933,0.0005873466,0.0002347519,3.962778e-7,0.0002399658,0.008123265],"genre_scores_gemma":[0.9574265,0.000040864,0.04145753,0.0008941201,0.0001253863,0.00001356692,6.769322e-7,0.00001000257,0.00003134894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9392544,"threshold_uncertainty_score":0.999698,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01010129519343213,"gpt":0.2481306823814104,"spread":0.2380293871879783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011903,0.0001293612,0.000178054,0.0001449268,0.0001888667,0.0002046545,0.001747823,0.00003172577,0.00005641976],"category_scores_gemma":[0.00004706186,0.00009395608,0.00003650101,0.001217726,0.002004258,0.0007713308,0.000617594,0.0001390876,0.00003056628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005692165,"about_ca_system_score_gemma":0.0001627541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002172021,"about_ca_topic_score_gemma":0.000001162549,"domain_scores_codex":[0.9980201,0.0000830149,0.0002558395,0.0005420213,0.0006644062,0.0004346173],"domain_scores_gemma":[0.9984664,0.0001354691,0.0000694913,0.0008026662,0.0002954756,0.0002305235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008432415,0.0001053301,0.0001528901,0.000007615372,0.000003059466,0.000002187562,0.0005332333,0.04179953,0.000566356,0.8895248,0.00000439432,0.06729221],"study_design_scores_gemma":[0.0002528696,0.0003283722,0.001284808,0.00002777313,0.000001613575,0.00001770977,0.000003058317,0.981804,0.007003725,0.009098463,0.00003534695,0.0001422707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03703757,0.00001257481,0.9580007,0.001004498,0.0000666015,0.0001595082,4.099433e-7,0.0001486674,0.003569494],"genre_scores_gemma":[0.5803678,0.000001878227,0.4194306,0.0001652379,0.00002526234,0.00000200388,1.504743e-7,0.000003392104,0.000003686771],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9400045,"threshold_uncertainty_score":0.7384773,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02381291476889642,"gpt":0.3019455865412595,"spread":0.2781326717723631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033705,0.0001605479,0.0001822042,0.0002687996,0.0004624582,0.0004264944,0.002446124,0.00005429101,0.00001749044],"category_scores_gemma":[0.002997492,0.0001325775,0.00004841767,0.003551433,0.001318659,0.0008635943,0.0003330304,0.0001172999,0.00003275146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006370371,"about_ca_system_score_gemma":0.0003144554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.305225e-7,"about_ca_topic_score_gemma":8.989627e-8,"domain_scores_codex":[0.9976954,0.0001466876,0.000279811,0.0006942222,0.0006094947,0.0005743473],"domain_scores_gemma":[0.9975671,0.0006911971,0.00008922842,0.0008407607,0.0005995613,0.0002121928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004359048,0.00004504735,0.00001851154,0.00002504788,0.000001877729,7.14584e-7,0.0001404547,0.00002751038,0.0002339752,0.9713329,0.0000499849,0.02811963],"study_design_scores_gemma":[0.0003401676,0.0002914986,0.00007909861,0.00001682102,0.000005758255,0.00003099864,0.000005680049,0.5219951,0.05965174,0.4143169,0.002966454,0.0002998085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001970163,0.00005940374,0.9900077,0.0002286696,0.0008492059,0.0003478723,0.000001185143,0.0002044831,0.006331311],"genre_scores_gemma":[0.357307,0.000004704293,0.6423322,0.0002755272,0.00003433552,0.0000245982,2.40925e-7,0.000005557657,0.00001575917],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.557016,"threshold_uncertainty_score":0.5406353,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04184605298491346,"gpt":0.2974343397464628,"spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00341654,0.000129033,0.0001488038,0.0001617189,0.0004479804,0.0002113946,0.003795618,0.00004014512,0.0001321244],"category_scores_gemma":[0.0004343846,0.00007825829,0.00005781038,0.001308711,0.01296404,0.0004549227,0.0006514207,0.0004856347,0.00006965602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001602732,"about_ca_system_score_gemma":0.0001004311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000190429,"about_ca_topic_score_gemma":0.000002051881,"domain_scores_codex":[0.9977493,0.0001720399,0.0002515033,0.0005487584,0.0008461772,0.0004322395],"domain_scores_gemma":[0.9971123,0.0008304449,0.00009103326,0.001503665,0.000308066,0.0001544869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006344228,0.00004694998,0.000008376092,0.000003255692,0.000001575672,8.205675e-7,0.0002038494,0.00007463386,0.01774219,0.9698718,0.00001936212,0.01202089],"study_design_scores_gemma":[0.00006967686,0.0001639968,0.0003971664,0.00001016662,5.751849e-7,0.000009515372,0.000002081478,0.2067305,0.03529591,0.7572078,0.0000329764,0.00007964717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1039117,0.000002151212,0.8822166,0.004071025,0.0004402151,0.0002753094,0.000001326102,0.00008805465,0.008993648],"genre_scores_gemma":[0.9381642,7.034623e-7,0.06144895,0.0003219959,0.00004181478,0.00001004707,2.591675e-7,0.000004720767,0.000007282377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8342525,"threshold_uncertainty_score":0.9897221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007250582662101844,"gpt":0.2241170024500957,"spread":0.2168664197879939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003444177,0.0001425567,0.0001651167,0.00008337495,0.001074432,0.0002811292,0.003373552,0.00003457067,0.00001757615],"category_scores_gemma":[0.0001845667,0.00008803337,0.00007025162,0.001101017,0.004385062,0.0004818471,0.0009340388,0.0001412458,0.00001767535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003224643,"about_ca_system_score_gemma":0.0001326174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002071462,"about_ca_topic_score_gemma":2.592753e-7,"domain_scores_codex":[0.9978111,0.0001734737,0.0002965047,0.0004808563,0.0006891305,0.0005488676],"domain_scores_gemma":[0.9980484,0.0004313071,0.00009462692,0.0011208,0.000144865,0.0001599877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001228867,0.00002125532,0.00001565225,0.000002514642,0.000002636933,0.000003173074,0.0002313445,0.00006797411,0.001797286,0.9692131,0.00001922225,0.0286246],"study_design_scores_gemma":[0.0001261935,0.0001453928,0.0001974533,0.00002621384,0.000002594456,0.00005489817,0.00001562626,0.2003952,0.05067858,0.7471231,0.001073825,0.0001610135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06710277,0.0001709264,0.9233615,0.0005763442,0.0006494941,0.0001010314,4.288276e-7,0.000122133,0.00791537],"genre_scores_gemma":[0.9023858,0.000009474594,0.09736092,0.0001847061,0.00003261021,0.00000335261,6.353857e-8,0.000004479934,0.00001859055],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.835283,"threshold_uncertainty_score":0.9983245,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01135423358031027,"gpt":0.2296839927461103,"spread":0.2183297591658001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319247,0.0002043959,0.0001978248,0.0002129977,0.0007857071,0.0004251479,0.002351122,0.0000648234,0.00008717705],"category_scores_gemma":[0.0000366599,0.0001755473,0.00006169009,0.001170041,0.00186639,0.002069125,0.0008076995,0.000250142,0.0002344768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009003295,"about_ca_system_score_gemma":0.0001922368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006660031,"about_ca_topic_score_gemma":5.597788e-7,"domain_scores_codex":[0.9971718,0.0001413222,0.0003453802,0.00065915,0.0009624618,0.0007199518],"domain_scores_gemma":[0.9984288,0.000118614,0.00008308946,0.0007580139,0.000215606,0.0003958839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005341231,0.0002541319,0.0002417457,0.00001798939,0.00000576817,0.00005554542,0.001862112,0.002466793,0.0009579968,0.8919352,0.004101459,0.09809588],"study_design_scores_gemma":[0.0002922674,0.0002409931,0.0004279935,0.00001816053,0.000001426021,0.000232806,0.000002902508,0.9799327,0.003281956,0.01501502,0.000271448,0.0002823281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0083896,0.0000503886,0.9846596,0.001590577,0.0003064197,0.0002393509,0.000002718002,0.0003837265,0.004377697],"genre_scores_gemma":[0.8455457,0.00004362077,0.1524308,0.001863775,0.0000634902,0.000009900119,0.000005527555,0.000009324222,0.00002785949],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9774659,"threshold_uncertainty_score":0.7158611,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02072302315177952,"gpt":0.2736636665856934,"spread":0.2529406434339138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004488801,0.0002652716,0.0003066057,0.0001899479,0.0009621693,0.000761351,0.002622829,0.00007507625,0.000002877705],"category_scores_gemma":[0.0004646359,0.0002156438,0.0001359397,0.001798774,0.001855137,0.0003914868,0.0008618384,0.000224145,0.000009749255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004826674,"about_ca_system_score_gemma":0.0001362219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001939057,"about_ca_topic_score_gemma":0.000001596961,"domain_scores_codex":[0.9967854,0.0003234648,0.0003598892,0.0009980482,0.0006475222,0.000885645],"domain_scores_gemma":[0.9973001,0.0009270281,0.0001237787,0.0009292844,0.0003891338,0.0003306552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009268281,0.00004885462,0.000126158,0.00001014375,0.000003977838,0.000001009999,0.0001199354,0.003743936,0.0002610223,0.9705116,0.00002477846,0.02513939],"study_design_scores_gemma":[0.0002264672,0.0002819069,0.003290815,0.00003112502,0.000004030207,0.00002713002,8.949534e-7,0.7891644,0.0004541486,0.206029,0.0002335004,0.0002566484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1430088,0.00001563275,0.8551579,0.0003278986,0.0009242425,0.0002471429,0.00001380705,0.0002462885,0.00005832041],"genre_scores_gemma":[0.710078,8.250886e-7,0.2894843,0.0002290244,0.0001867027,0.000005347033,0.000005884276,0.000009288538,6.277794e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7854204,"threshold_uncertainty_score":0.8793698,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Interactivity; Theoretical computer science; Computation; Algorithm; Multimedia","retraction":null,"screen_n_in":null,"score":{"opus":0.01614613090359288,"gpt":0.2451831090415628,"spread":0.2290369781379699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008411097,0.0001287035,0.0001883315,0.0002138389,0.0002102913,0.0003007403,0.001673702,0.00002724025,0.00006084338],"category_scores_gemma":[0.00003883801,0.00009276959,0.00002803962,0.0015089,0.002836589,0.0007199949,0.0005063946,0.0002082683,0.000027101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002807611,"about_ca_system_score_gemma":0.00008515613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005030017,"about_ca_topic_score_gemma":9.91158e-7,"domain_scores_codex":[0.9976901,0.0001045317,0.0001953089,0.0005229441,0.0009776748,0.000509441],"domain_scores_gemma":[0.9986474,0.000187649,0.00007061483,0.0006265594,0.000217926,0.0002498733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008313949,0.00006202642,0.0001389992,0.00001288471,0.000005487493,0.00001952093,0.001956724,0.008462408,0.0001085051,0.9564935,0.00003333736,0.03269828],"study_design_scores_gemma":[0.0003819337,0.0006207745,0.0006583157,0.00009229278,0.000002636812,0.00004999186,0.00001229684,0.9897836,0.001055391,0.006978513,0.0001638395,0.0002003987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03309299,0.00001766845,0.9616089,0.00122696,0.00006359188,0.0001662373,4.875282e-7,0.0001216945,0.003701496],"genre_scores_gemma":[0.6838351,0.00000677868,0.3158219,0.0002950717,0.00001572688,0.000002799997,1.550484e-7,0.000005991066,0.0000164907],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9813212,"threshold_uncertainty_score":0.9998771,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009868126200166685,"gpt":0.2698464193739304,"spread":0.2599782931737638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437512,0.0001524127,0.0001722606,0.000400387,0.0002492458,0.0004319532,0.002031313,0.00004959562,0.00003853445],"category_scores_gemma":[0.00006059222,0.0001361934,0.00004113731,0.001970611,0.001054341,0.0007551633,0.001036415,0.0002538921,0.00007666907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001408314,"about_ca_system_score_gemma":0.0001180432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007911382,"about_ca_topic_score_gemma":0.000005691149,"domain_scores_codex":[0.9974321,0.0000664212,0.0003298305,0.0006480204,0.0006419096,0.0008817366],"domain_scores_gemma":[0.9986827,0.0002253382,0.00004720778,0.0006139838,0.0001176305,0.0003131812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003472967,0.00007397059,0.0002139134,0.000005133061,0.000001038427,0.00004386608,0.001070733,0.02661947,0.0005327346,0.8828974,0.000001885928,0.08853641],"study_design_scores_gemma":[0.0002760071,0.0001774411,0.002156076,0.00003792884,5.807336e-7,0.00003911735,0.00001277769,0.9719089,0.002062674,0.02308052,0.00003784794,0.0002101693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05047896,0.00003205122,0.9417642,0.0001547293,0.0003042003,0.0002376814,1.381701e-7,0.0002119651,0.006816026],"genre_scores_gemma":[0.7524164,0.000005166674,0.2472766,0.0002371911,0.00004476683,0.000007062627,1.433502e-7,0.000006361274,0.000006380842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9452894,"threshold_uncertainty_score":0.5553804,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04045361536678201,"gpt":0.3106491400712147,"spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00217506,0.0001058375,0.0001225357,0.0001169198,0.0009741614,0.0002173172,0.002738653,0.00002444873,0.00003168154],"category_scores_gemma":[0.0001374726,0.00006938363,0.00006509703,0.001408809,0.0150193,0.0007307766,0.0009703197,0.0001909413,0.0001145798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004992185,"about_ca_system_score_gemma":0.00009757566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001097821,"about_ca_topic_score_gemma":0.000002625632,"domain_scores_codex":[0.9978547,0.0001618083,0.0002659381,0.0004134055,0.0007797646,0.0005243713],"domain_scores_gemma":[0.9979419,0.0004596811,0.0000697653,0.001035446,0.0003104666,0.0001828021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007764982,0.0000375174,0.00001752892,0.00000145432,0.000002098548,5.062492e-7,0.00009689214,0.0004013423,0.0006314819,0.9236303,0.00005305828,0.07512006],"study_design_scores_gemma":[0.00009608372,0.0001053865,0.0007206265,0.000006131927,0.000001215869,0.00001149376,0.000005378414,0.3416099,0.006977708,0.649463,0.0009237322,0.00007934462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01020814,0.00003856308,0.9798897,0.005097442,0.0002574704,0.0001343944,0.000001555152,0.0001122185,0.004260549],"genre_scores_gemma":[0.8961343,0.000005752139,0.1035922,0.0001451223,0.00008640872,0.000007773617,2.884546e-7,0.000003581962,0.00002459692],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8859261,"threshold_uncertainty_score":0.9876612,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008223849374187228,"gpt":0.2207880449097986,"spread":0.2125641955356113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000768428,0.0002786182,0.0002718882,0.000191636,0.0006171448,0.0008595905,0.001891328,0.00004314579,0.00002941228],"category_scores_gemma":[0.00005090835,0.0001871061,0.00004227068,0.001106516,0.003621515,0.0004839256,0.00129358,0.000356641,0.00006589821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002458686,"about_ca_system_score_gemma":0.00003866113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003640088,"about_ca_topic_score_gemma":5.628478e-7,"domain_scores_codex":[0.9970511,0.0001185695,0.0002553266,0.001003077,0.0007828717,0.0007891004],"domain_scores_gemma":[0.9979078,0.0005867939,0.00007199502,0.0008778109,0.0001157976,0.000439812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005045453,0.00007791442,0.00005281729,0.000007244897,0.000005055814,0.00005830138,0.0006919072,0.003774985,0.00004107279,0.8962919,0.00007428336,0.09891947],"study_design_scores_gemma":[0.0004469807,0.0005476684,0.0006344186,0.0000468375,0.000004115108,0.0001886682,0.000004246122,0.9330503,0.0001967608,0.06434303,0.0002343068,0.0003026352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1049028,0.00006071241,0.8890579,0.004173642,0.0002668186,0.0001177759,0.00000176116,0.0004390229,0.0009796403],"genre_scores_gemma":[0.792558,0.000009352331,0.206649,0.000646545,0.0001112142,0.0000029557,4.102207e-7,0.00001008301,0.00001251813],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9292753,"threshold_uncertainty_score":0.9990901,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01346512824973406,"gpt":0.2579631548572839,"spread":0.2444980266075498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114079,0.0001363372,0.0001234795,0.0002025152,0.0003959368,0.0007006584,0.001823932,0.00004139156,0.00007726756],"category_scores_gemma":[0.00006377375,0.0001147411,0.00004361604,0.001438848,0.001168217,0.002299391,0.0005615748,0.0001475988,0.0002833978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004518756,"about_ca_system_score_gemma":0.00009071823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001080564,"about_ca_topic_score_gemma":3.43402e-7,"domain_scores_codex":[0.9978758,0.0001005467,0.0002421957,0.000565295,0.0007259984,0.0004902178],"domain_scores_gemma":[0.9987361,0.0001419702,0.00005038867,0.0005982959,0.0001820114,0.0002912778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001554988,0.00005458294,0.000005386856,0.000001862398,0.000001204159,0.000001146082,0.0004658638,0.005866795,0.0003272131,0.9339461,0.0008749659,0.05845338],"study_design_scores_gemma":[0.0001724142,0.00009950474,0.00001839989,0.000008922168,8.433609e-7,0.000005998459,0.000002515826,0.9257401,0.003574315,0.06817894,0.002044458,0.000153587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001017688,0.00002185034,0.9868971,0.007342363,0.000203155,0.0001505767,0.000001102647,0.0004303821,0.003935797],"genre_scores_gemma":[0.6760599,0.00001242065,0.3223915,0.001425604,0.00005873931,0.000009546527,0.000001682295,0.000005002157,0.00003564327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9198733,"threshold_uncertainty_score":0.6756465,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02829764923079037,"gpt":0.2807743840024217,"spread":0.2524767347716313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006436536,0.0001213065,0.0002329448,0.0001089789,0.0002408286,0.00003090987,0.0005453639,0.00008991432,0.0004936605],"category_scores_gemma":[0.0003169214,0.00009739454,0.00004842258,0.0005036764,0.007001058,0.0001429343,0.0002068818,0.0001660593,0.00005596894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002414937,"about_ca_system_score_gemma":0.00003406696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005957166,"about_ca_topic_score_gemma":9.510341e-7,"domain_scores_codex":[0.9985792,0.000123563,0.0003059311,0.0003040069,0.0003155959,0.0003716839],"domain_scores_gemma":[0.9988261,0.0004505982,0.00008853123,0.0004125625,0.00011964,0.0001025553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009500458,0.00008118476,0.0001631752,0.0000114255,0.00000545105,0.000009351261,0.0008570644,0.000002840858,0.0002209857,0.9961151,0.0002904218,0.002233493],"study_design_scores_gemma":[0.0001416663,0.0002519193,0.0001523817,0.000006204545,0.00001445093,0.00005231104,0.00003528077,0.005177103,0.01369004,0.9802344,0.0001335002,0.0001107502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6535591,0.00005719281,0.32573,0.001780326,0.001412364,0.0002031282,0.000004718447,0.0001860496,0.01706718],"genre_scores_gemma":[0.9886233,0.00001091241,0.01107983,0.00008021735,0.0001456418,0.000006482154,5.696194e-7,0.000006548572,0.00004654408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3350642,"threshold_uncertainty_score":0.9957013,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007596805078787223,"gpt":0.243354161246824,"spread":0.2357573561680368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133959,0.0001500226,0.0001696005,0.0003748334,0.0002416832,0.0004947863,0.002040313,0.0000455588,0.00003805926],"category_scores_gemma":[0.00004959411,0.0001301577,0.00004395574,0.001828148,0.001754959,0.0005600508,0.0006528549,0.0001847006,0.00008401408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007546295,"about_ca_system_score_gemma":0.000161991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000165873,"about_ca_topic_score_gemma":0.00000648387,"domain_scores_codex":[0.9976315,0.0001113556,0.000317791,0.0006534706,0.0006242603,0.0006616486],"domain_scores_gemma":[0.9988447,0.0001644948,0.0000478801,0.0006517049,0.0001152394,0.000175962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001964471,0.00007270684,0.0001978814,0.000003431782,4.559499e-7,0.00003771688,0.00009668663,0.003201286,0.0001118696,0.9788424,0.00003051453,0.01740302],"study_design_scores_gemma":[0.0001881492,0.0001033195,0.002479148,0.00001226256,5.966909e-7,0.00003050145,0.000001054393,0.6450401,0.0003122867,0.3516462,0.00004529295,0.000141168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234221,0.00001857522,0.9737111,0.0006469216,0.0002974503,0.0001575459,5.630621e-7,0.0001908603,0.01263479],"genre_scores_gemma":[0.8057923,0.000002584961,0.1938819,0.0002613782,0.00003720339,0.000007209351,6.301177e-7,0.000005131199,0.00001161829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7934501,"threshold_uncertainty_score":0.6466218,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01615962641213541,"gpt":0.2576801945142401,"spread":0.2415205681021047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189816,0.0001526979,0.0001603109,0.0001680182,0.0002651146,0.0006782161,0.002277082,0.00003642001,0.00002617412],"category_scores_gemma":[0.00003188966,0.0001037183,0.00002697996,0.001328212,0.001817904,0.0009817744,0.0008180934,0.0001567049,0.0002176335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007822368,"about_ca_system_score_gemma":0.0004560502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003087938,"about_ca_topic_score_gemma":5.92681e-7,"domain_scores_codex":[0.9976414,0.00008973702,0.0001857154,0.0006322242,0.0008912695,0.00055969],"domain_scores_gemma":[0.998017,0.00007663977,0.00004564873,0.0007857056,0.0004103258,0.0006646811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005378344,0.00005708278,0.00002278768,0.000001886329,0.000001954251,0.0000171192,0.0007716569,0.02340094,0.00002632455,0.9622304,0.0001354236,0.01332906],"study_design_scores_gemma":[0.0003572991,0.0007193605,0.00005825181,0.00001397807,0.000001545793,0.00006701438,0.000008123763,0.9412308,0.001168583,0.05526949,0.0008934426,0.0002121174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003843371,0.0000188183,0.9798011,0.0009918768,0.000297022,0.0002355756,3.210878e-7,0.0003454881,0.01446648],"genre_scores_gemma":[0.6118338,0.000001180034,0.3876382,0.0004133408,0.00004756423,0.00001291327,3.709993e-7,0.000005245649,0.00004740079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9178299,"threshold_uncertainty_score":0.6698142,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01971950583662881,"gpt":0.2498040748160415,"spread":0.2300845689794127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432339,0.0002057197,0.0002539786,0.0003349336,0.0005072937,0.0006869444,0.001985615,0.0000714889,0.000004746478],"category_scores_gemma":[0.0001761133,0.0001599492,0.0001148984,0.00204237,0.001478691,0.0006706633,0.0002735183,0.0001420696,0.00005020832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001952108,"about_ca_system_score_gemma":0.0002413788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001134983,"about_ca_topic_score_gemma":7.777571e-7,"domain_scores_codex":[0.9975482,0.0000608267,0.0003104697,0.00079483,0.0005831355,0.0007024989],"domain_scores_gemma":[0.9983954,0.0002413379,0.00007267946,0.0006264985,0.0003528743,0.0003111773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006674831,0.000120719,0.00001347987,0.00002289256,0.000002379608,0.000007104293,0.0006771827,0.001522421,0.0001146066,0.9934074,0.0000116005,0.00409353],"study_design_scores_gemma":[0.0009403726,0.0008220678,0.0006945981,0.00005973411,0.00001565819,0.0001670342,0.00001217709,0.6218219,0.0008777651,0.37419,0.00003593521,0.00036274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04181741,0.00007296335,0.9544945,0.0004983836,0.001193048,0.0005963941,0.000003052409,0.0002907915,0.001033404],"genre_scores_gemma":[0.9036738,0.000001583982,0.09594779,0.0001422126,0.0001606737,0.00005611365,0.000001434618,0.000008176033,0.000008184757],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8618564,"threshold_uncertainty_score":0.6624221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0173094157674278,"gpt":0.2560617708558215,"spread":0.2387523550883937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002132802,0.0001663014,0.0001917118,0.0002411398,0.0002623477,0.0002971522,0.001521583,0.00003667882,0.00004082347],"category_scores_gemma":[0.0004437434,0.0001330625,0.00005059524,0.001533305,0.001571293,0.000852872,0.0006247224,0.0001768284,0.0001380772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009270749,"about_ca_system_score_gemma":0.0002115169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006056075,"about_ca_topic_score_gemma":0.000005848961,"domain_scores_codex":[0.9976422,0.0002182156,0.0002763089,0.0007616244,0.0005311987,0.0005704062],"domain_scores_gemma":[0.9984468,0.0002623012,0.00005860833,0.0008600809,0.0001376843,0.0002345605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001674168,0.0000809557,0.00105778,0.000004085002,0.000001040124,0.00001924046,0.0002518945,0.00003955448,0.00009817624,0.9765477,0.00002769452,0.02187023],"study_design_scores_gemma":[0.0007816991,0.0002405317,0.00877771,0.0001162795,0.000005624628,0.000172848,0.00002147164,0.5180898,0.01672451,0.4517574,0.002685548,0.0006266025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04696441,0.0001246696,0.9299664,0.0002635801,0.0006517124,0.000147555,6.211509e-7,0.0001312399,0.02174983],"genre_scores_gemma":[0.8765677,0.000009075855,0.1230274,0.0003295416,0.00004118304,0.000006306159,6.086902e-7,0.000004366245,0.00001380361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8296033,"threshold_uncertainty_score":0.5789495,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02041441354726885,"gpt":0.260438264394177,"spread":0.2400238508469081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344309,0.0001222456,0.000130362,0.0001479813,0.0004458744,0.0002924493,0.003058756,0.00003237805,0.00003971893],"category_scores_gemma":[0.00003778734,0.0000793042,0.00003547247,0.001463397,0.001699279,0.0005515664,0.000613329,0.0002300269,0.00009621276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003396782,"about_ca_system_score_gemma":0.00007767962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005258614,"about_ca_topic_score_gemma":9.496126e-7,"domain_scores_codex":[0.9979109,0.0001665476,0.0002088561,0.0004687564,0.0007274841,0.0005174425],"domain_scores_gemma":[0.9988297,0.0002408788,0.00003213323,0.0006847105,0.0000736612,0.0001389153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002236766,0.00006725981,0.0001438224,0.00000291343,8.026436e-7,0.00005043462,0.003225646,0.01689081,0.0001365232,0.9710054,0.00007749901,0.008396606],"study_design_scores_gemma":[0.0002344182,0.0001901113,0.001548278,0.00001828717,5.777833e-7,0.0001749823,0.00002013502,0.9716216,0.0005579641,0.02515939,0.0002986756,0.0001755824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03452335,0.00002939739,0.9589333,0.001021073,0.0002015046,0.0002573262,3.250651e-7,0.0001138107,0.004919931],"genre_scores_gemma":[0.9007551,0.0000210857,0.09817092,0.0009598405,0.0000552092,0.0000183048,3.908847e-7,0.000004099161,0.0000150151],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9547308,"threshold_uncertainty_score":0.6261066,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008541897466011434,"gpt":0.2632950407095936,"spread":0.2547531432435822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003394283,0.0001378466,0.0006222902,0.0005716127,0.0002206001,0.000276266,0.001898534,0.00003168027,0.0009561434],"category_scores_gemma":[0.0000913379,0.0001053503,0.0002416257,0.004672198,0.003961053,0.0005201633,0.0003732544,0.0001283928,0.0000440105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002687346,"about_ca_system_score_gemma":0.00008809678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008084495,"about_ca_topic_score_gemma":6.004889e-7,"domain_scores_codex":[0.9973611,0.0003539698,0.0004511581,0.0005553968,0.0008573942,0.0004210245],"domain_scores_gemma":[0.998095,0.0006296893,0.00008463021,0.0006482695,0.0003227323,0.0002196596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001010339,0.00004594006,0.000007380757,0.000002047305,0.000069289,0.000002646904,0.0006670746,0.01135252,0.00003003765,0.9526325,0.000004016641,0.03508545],"study_design_scores_gemma":[0.00425428,0.0000456333,0.0001241082,0.00001275204,0.00005760959,0.000002842917,0.000004798731,0.9666694,0.0004384223,0.02817253,0.00008659009,0.0001309957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00242172,0.00002050614,0.9628409,0.0006763919,0.0001028411,0.0002150622,0.000002510626,0.0001084067,0.03361172],"genre_scores_gemma":[0.7388724,0.00002569932,0.2606899,0.0003484808,0.00001897886,0.000006356352,0.000001967511,0.000003233633,0.00003297355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9553169,"threshold_uncertainty_score":0.9999571,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01072900924257724,"gpt":0.2432926968346178,"spread":0.2325636875920406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.006630495,0.0002984693,0.0003491033,0.0003025532,0.001178204,0.00120275,0.005464156,0.00005851793,0.00002160595],"category_scores_gemma":[0.001436179,0.000144288,0.0001228545,0.006135699,0.006713334,0.0004614906,0.001556262,0.0005309744,0.00003512951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009998308,"about_ca_system_score_gemma":0.00009408786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004882281,"about_ca_topic_score_gemma":6.232655e-7,"domain_scores_codex":[0.9958031,0.0005775063,0.0003736606,0.001099865,0.001396497,0.0007494373],"domain_scores_gemma":[0.9923295,0.005139927,0.0001107734,0.001929966,0.0002317697,0.0002580557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001589327,0.00007494442,0.00001820186,0.000001679523,0.000003048619,0.000006285916,0.0002144225,0.0002278718,0.00000447166,0.9225156,0.00007550397,0.07684208],"study_design_scores_gemma":[0.0002623961,0.0001883502,0.00422007,0.000006226168,0.000004503039,0.00002036721,0.000002937388,0.473444,0.0001313841,0.5215073,0.0000757797,0.0001366112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081945,0.0002036788,0.9578375,0.02509462,0.0005096057,0.0004676372,0.000001233564,0.000208055,0.004858175],"genre_scores_gemma":[0.9503016,0.00001326304,0.04390583,0.005644714,0.0001116673,0.000008342065,1.3329e-7,0.000004956737,0.000009494172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9394822,"threshold_uncertainty_score":0.9999167,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008116660906839171,"gpt":0.2500124413008852,"spread":0.241895780394046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516515,0.0001626664,0.0001672505,0.0000592576,0.0003067462,0.0001480238,0.0006537794,0.00006307913,0.000003316683],"category_scores_gemma":[0.00006039759,0.000125747,0.00006163567,0.0002858796,0.001880379,0.000009465584,0.0004936927,0.0001083311,0.00002254696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005558984,"about_ca_system_score_gemma":0.0001769064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001147418,"about_ca_topic_score_gemma":0.000001693233,"domain_scores_codex":[0.9983865,0.00006248296,0.0002064846,0.0005720118,0.0003625768,0.0004099439],"domain_scores_gemma":[0.9991895,0.00003174166,0.00007974706,0.0002886456,0.0002230526,0.0001873306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006376082,0.0001636107,0.001924293,0.00002093797,0.00001986625,0.00002970342,0.00020392,0.04930694,0.04432052,0.9027077,0.00003899377,0.001199742],"study_design_scores_gemma":[0.01398526,0.009818445,0.06383055,0.00114229,0.000161548,0.001550139,0.001597085,0.5941949,0.214873,0.08764955,0.005295689,0.005901458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6999958,0.00005327819,0.298553,0.0001140062,0.0003000649,0.0001189272,0.000004520223,0.00003749055,0.0008230142],"genre_scores_gemma":[0.9915766,0.000002576576,0.007759986,0.000290079,0.0003305064,0.000002128767,0.00001430538,0.000007565709,0.00001631526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8150582,"threshold_uncertainty_score":0.6928335,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009636575686006338,"gpt":0.2453413383062421,"spread":0.2357047626202357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251844,0.0002447856,0.0002483804,0.0002374866,0.0006894821,0.0007272599,0.003580257,0.00005605159,0.00001321564],"category_scores_gemma":[0.00007299381,0.0001959051,0.00009761377,0.001521089,0.001108867,0.0005449308,0.0006575313,0.0003328776,0.00009409816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004214654,"about_ca_system_score_gemma":0.0001277326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001346827,"about_ca_topic_score_gemma":6.180969e-8,"domain_scores_codex":[0.9969219,0.00009296808,0.0003086523,0.0009413107,0.0008306124,0.000904567],"domain_scores_gemma":[0.9981955,0.0001661478,0.00007477978,0.001032691,0.0001453554,0.0003855341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.259738e-7,0.00003841134,0.000005681802,0.000001459553,0.000001247053,0.00002248043,0.0002696155,0.00112594,0.0005613115,0.755514,0.00004035947,0.2424186],"study_design_scores_gemma":[0.0001251921,0.000248388,0.00143755,0.00002324662,0.000001432168,0.00009125986,0.000001428947,0.688265,0.0007938901,0.3086303,0.0001651865,0.0002170831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05393927,0.00005677818,0.9379464,0.003771767,0.0007071348,0.0001135771,3.747926e-7,0.0005709768,0.002893674],"genre_scores_gemma":[0.8467134,0.000002918897,0.1510354,0.001997127,0.0002397767,0.000001167706,2.844675e-7,0.000005431026,0.000004431004],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7927742,"threshold_uncertainty_score":0.798878,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01116320134667742,"gpt":0.2351134554278947,"spread":0.2239502540812173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836393,0.0001034638,0.0001092226,0.0003125076,0.0002239774,0.0002479296,0.0009770647,0.00003031476,0.00007014469],"category_scores_gemma":[0.00003599549,0.00009404594,0.00002209985,0.001594036,0.0006656058,0.0005997237,0.0004177882,0.0001188205,0.00006395295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008835911,"about_ca_system_score_gemma":0.0001438253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002685362,"about_ca_topic_score_gemma":0.000006498279,"domain_scores_codex":[0.998503,0.00004374915,0.0002295125,0.0004435555,0.0004038032,0.0003764385],"domain_scores_gemma":[0.9993365,0.00008211182,0.00003457507,0.0003169576,0.00007978896,0.0001500931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002704318,0.000023968,0.002488123,0.000001025078,8.206798e-7,0.00001504867,0.0004294388,0.001134956,0.00008213061,0.8487735,0.000004775812,0.1470435],"study_design_scores_gemma":[0.0004523612,0.0000645412,0.06693605,0.00003731313,0.000001044034,0.00008122958,0.00001185779,0.8699444,0.002199694,0.05910911,0.000829844,0.000332558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09607591,0.000005626883,0.8975837,0.000560933,0.0003550904,0.00009384772,6.409378e-8,0.000130515,0.005194379],"genre_scores_gemma":[0.7476379,0.000004151887,0.2520613,0.0002627735,0.00001999711,0.000004581352,2.124687e-7,0.000002263665,0.000006822331],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8688095,"threshold_uncertainty_score":0.3835082,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.004772503037445953,"gpt":0.1974227877428128,"spread":0.1926502847053669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146408,0.0001915703,0.0001277113,0.00005607634,0.0005235586,0.0004084861,0.001039935,0.0000355646,0.00005597351],"category_scores_gemma":[0.00002973004,0.00008067008,0.00003244897,0.0004908479,0.001046032,0.0002223217,0.0002656836,0.0001762153,0.00005241494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009057255,"about_ca_system_score_gemma":0.00003319897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002901188,"about_ca_topic_score_gemma":3.667984e-7,"domain_scores_codex":[0.9982356,0.00005243523,0.0002089867,0.0003697264,0.0005742555,0.0005589706],"domain_scores_gemma":[0.9989377,0.0002902434,0.00003312782,0.0004777052,0.00008995363,0.000171248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000127639,0.00003255198,0.00002694111,0.00001400367,0.00002590861,0.000006613707,0.002080337,0.04967047,0.005756429,0.1518155,0.0003866134,0.7901719],"study_design_scores_gemma":[0.0001812754,0.0001169772,0.00007320192,0.0001063432,0.00000952186,0.00002009543,0.00009116574,0.9882178,0.009097137,0.001704863,0.0001559417,0.0002256849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00600379,0.00005864875,0.9903935,0.002006194,0.0002949407,0.0002659343,0.000003452922,0.0002558458,0.0007177095],"genre_scores_gemma":[0.6889623,0.000006720108,0.3104542,0.0003660833,0.0001393221,0.00002361377,2.96718e-7,0.00002166688,0.00002573816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9385473,"threshold_uncertainty_score":0.4026843,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01940488099735775,"gpt":0.2512589619389404,"spread":0.2318540809415826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00229663,0.0001968921,0.000219361,0.0001611818,0.0005124065,0.0005292414,0.002959863,0.0000479771,0.0001850768],"category_scores_gemma":[0.0001299204,0.0001590072,0.00007779185,0.001331831,0.003754936,0.0007336222,0.0007098365,0.0001937404,0.0003207526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005069088,"about_ca_system_score_gemma":0.0001307367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000165288,"about_ca_topic_score_gemma":1.886071e-7,"domain_scores_codex":[0.9973189,0.0001980984,0.0002655481,0.0007856686,0.0007067015,0.0007250482],"domain_scores_gemma":[0.9980213,0.0002208614,0.00005926494,0.001223339,0.0001233044,0.0003519332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001114992,0.00005134463,0.00003964219,0.000002749309,0.000002123075,0.000015461,0.0001528271,0.00001641549,0.0003530816,0.9891718,0.00004471756,0.01014871],"study_design_scores_gemma":[0.0001793349,0.0000990507,0.0008066484,0.00001143879,0.000001872619,0.0001363102,0.00000481185,0.1818199,0.005623507,0.8104509,0.0006232769,0.0002430285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03651332,0.00002922217,0.9418839,0.0005525567,0.0007906695,0.000109522,9.46995e-7,0.0003872848,0.01973257],"genre_scores_gemma":[0.7528226,0.000001477695,0.2462545,0.0008587171,0.00004239865,0.000003322405,2.728363e-7,0.000005791199,0.00001093319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7163092,"threshold_uncertainty_score":0.9989563,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01690291130505945,"gpt":0.3131132280734893,"spread":0.2962103167684298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001572688,0.0001870768,0.00026339,0.0001032786,0.0001737876,0.0001466138,0.001331013,0.00004472033,0.00002237067],"category_scores_gemma":[0.0002088401,0.0001192225,0.00005028868,0.000526967,0.0009529819,0.0002153363,0.0001037694,0.0002472834,0.00008912176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008558916,"about_ca_system_score_gemma":0.00005113296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001325279,"about_ca_topic_score_gemma":0.000001084341,"domain_scores_codex":[0.9982473,0.0001088891,0.0003391149,0.0003632585,0.0004375086,0.0005039535],"domain_scores_gemma":[0.9977666,0.001215496,0.00007920227,0.0007873761,0.00005407337,0.00009724434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001206187,0.0001494972,0.000006437108,0.000005091491,0.000001113762,0.00001554131,0.001911545,0.00001969061,0.0002016419,0.9955323,0.00006034945,0.002084672],"study_design_scores_gemma":[0.0004751044,0.0003765548,0.0002822856,0.00003080962,0.000006709031,0.00004391267,0.00006126071,0.0323503,0.0005126506,0.9656484,0.00004754687,0.000164499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7013263,0.000007556952,0.2778554,0.002788517,0.0006278408,0.0005222654,0.00000137782,0.000123313,0.01674745],"genre_scores_gemma":[0.9203959,0.000001021071,0.07861684,0.0007717399,0.0001953876,0.000006207944,2.882461e-7,0.000008225208,0.000004466024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2190696,"threshold_uncertainty_score":0.4861754,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04614077629257694,"gpt":0.2645989169087647,"spread":0.2184581406161878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009784144,0.0001311015,0.000153373,0.00008593116,0.0004944424,0.0002499867,0.0003065194,0.0000610128,0.00006978856],"category_scores_gemma":[0.0001312429,0.0001028848,0.0000425669,0.0005702777,0.00337145,0.0004165639,0.0002019057,0.0001552189,0.00001097201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002710775,"about_ca_system_score_gemma":0.00003653562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009779305,"about_ca_topic_score_gemma":0.000003468671,"domain_scores_codex":[0.998669,0.00006083865,0.0002062381,0.0003423745,0.0003351821,0.000386383],"domain_scores_gemma":[0.9991663,0.0001219711,0.00006361779,0.0003079808,0.0001301662,0.000209936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001365456,0.00004950008,0.000327284,0.00001053069,0.000003271593,0.000002267876,0.0003269066,9.223582e-8,0.0001343658,0.9895439,0.00003100821,0.009557238],"study_design_scores_gemma":[0.0001721037,0.0002277199,0.003090349,0.00002585481,0.00001198234,0.0000478484,0.0000219766,0.03861235,0.002503381,0.9549853,0.0001303425,0.0001708466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3466251,0.000008981581,0.6504666,0.0000848967,0.0001852658,0.0000846277,0.000002284091,0.0001075089,0.002434838],"genre_scores_gemma":[0.9498212,0.000001817805,0.05003027,0.00006921057,0.0000630709,0.00000386512,0.000001283128,0.000007485252,0.000001799587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6031961,"threshold_uncertainty_score":0.9993408,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008001504721208781,"gpt":0.2507749841629514,"spread":0.2427734794417426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001569341,0.000311199,0.000301665,0.0002623383,0.0009246896,0.0007382034,0.003556648,0.00005467758,0.00001405571],"category_scores_gemma":[0.00005468641,0.0002498304,0.0001126522,0.00146234,0.001955026,0.0004583652,0.002133815,0.0003746266,0.0001203698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001457977,"about_ca_system_score_gemma":0.0002519785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001097389,"about_ca_topic_score_gemma":5.62029e-7,"domain_scores_codex":[0.9962432,0.00008696639,0.0004149094,0.001109624,0.001099708,0.001045637],"domain_scores_gemma":[0.998058,0.000133192,0.0001149331,0.001079933,0.0001762862,0.0004376791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002778604,0.0000851392,0.00005813959,0.000005682919,0.000004816502,0.00002924453,0.0008286314,0.01350549,0.0004422692,0.936596,0.000009128799,0.04843266],"study_design_scores_gemma":[0.0004543318,0.0002643838,0.0007067863,0.00006310188,0.00000317694,0.0001411866,0.000007104252,0.762116,0.003167511,0.2326504,0.0001132228,0.0003128036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1793654,0.000027254,0.8160198,0.002056648,0.001044213,0.0001687534,7.657408e-7,0.0005230402,0.0007941047],"genre_scores_gemma":[0.6645251,0.000001244579,0.3344349,0.0008089531,0.0002165147,0.00000160324,4.642082e-7,0.000009610605,0.000001630763],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7486104,"threshold_uncertainty_score":0.9999954,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01831742266785005,"gpt":0.2810696077821045,"spread":0.2627521851142545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446134,0.0001804643,0.0002173673,0.0001432443,0.0004713589,0.0006203376,0.002358091,0.00005148377,0.00003523594],"category_scores_gemma":[0.0001046354,0.0001371573,0.0001125555,0.0008251704,0.001055991,0.001000104,0.0005877949,0.0001244494,0.00009962799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006653259,"about_ca_system_score_gemma":0.00009257733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002241449,"about_ca_topic_score_gemma":7.738911e-7,"domain_scores_codex":[0.9976285,0.00008108995,0.0002979014,0.0008219819,0.0005445874,0.0006259988],"domain_scores_gemma":[0.9981883,0.0003919881,0.00008148521,0.000905727,0.0001803279,0.0002521503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001029449,0.00004120814,0.00002011598,0.000002279611,0.000002786455,0.000002027979,0.0002974301,0.0001107029,0.0002063814,0.7936134,0.0002144177,0.2054789],"study_design_scores_gemma":[0.00032533,0.0002383707,0.0005905495,0.000009309988,0.000003664732,0.00002279141,0.000005946516,0.6647345,0.002812255,0.3301839,0.0008914961,0.0001818442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01074695,0.00003102766,0.9755012,0.003694845,0.0004355413,0.0003538742,0.000002027695,0.0002540138,0.008980489],"genre_scores_gemma":[0.6276357,0.000002705557,0.3707357,0.001345111,0.000252506,0.00001420192,0.000001027485,0.000005650134,0.000007440458],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6646238,"threshold_uncertainty_score":0.5981929,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.007139911694959688,"gpt":0.2310666929667581,"spread":0.2239267812717984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610826,0.000187752,0.0003479765,0.0002036581,0.0001494489,0.00007409166,0.001821892,0.00006816073,0.000005523541],"category_scores_gemma":[0.0000508788,0.0001603728,0.000129051,0.0008434773,0.0013858,0.0002821129,0.0002416105,0.0001099094,0.000001763886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004478743,"about_ca_system_score_gemma":0.00009113597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001747362,"about_ca_topic_score_gemma":1.056405e-7,"domain_scores_codex":[0.9975963,0.00007277842,0.0004762011,0.0006250772,0.0006994791,0.0005301608],"domain_scores_gemma":[0.998099,0.0003298107,0.0002007417,0.0008760727,0.0002989887,0.0001953412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002986076,0.000114712,0.00001321725,0.000009125775,0.00000396315,0.000005430451,0.0003916091,0.2018685,0.002739144,0.780858,0.00003809759,0.01392842],"study_design_scores_gemma":[0.0004000457,0.001276755,0.0002096808,0.00005784956,0.000005768913,0.00001187656,0.000006631159,0.9083446,0.05383857,0.03559262,0.00006202395,0.0001935883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2335923,0.00002403419,0.7650498,0.0001650352,0.0002209842,0.0002592104,0.000002849309,0.00005809446,0.0006276586],"genre_scores_gemma":[0.778446,0.000007393276,0.2211869,0.0002871777,0.00005050046,0.000006096247,7.710466e-7,0.000005303429,0.000009897572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7452653,"threshold_uncertainty_score":0.6539814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01300710459324179,"gpt":0.2663847769236825,"spread":0.2533776723304407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481301,0.00009179881,0.00008988773,0.0001155979,0.0003116739,0.0006381684,0.003324376,0.00002490261,0.0001760687],"category_scores_gemma":[0.00004175498,0.00005833079,0.00002908403,0.001786183,0.00129415,0.0006255055,0.0002677643,0.0002124337,0.0002012451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000225149,"about_ca_system_score_gemma":0.00008527375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000266144,"about_ca_topic_score_gemma":4.936202e-7,"domain_scores_codex":[0.9981261,0.0001765683,0.0001820047,0.000416629,0.0006471419,0.0004515426],"domain_scores_gemma":[0.998967,0.0001896481,0.00001635153,0.0006576143,0.00005852716,0.0001108789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001502512,0.0000335409,0.00002790135,0.000001077666,3.404415e-7,0.00000731455,0.0008858589,0.009073423,0.00001853127,0.915225,0.00002453425,0.07470101],"study_design_scores_gemma":[0.0001247893,0.00005636322,0.0006375732,0.00001031411,3.625873e-7,0.00002078784,0.000006642367,0.873897,0.00006825905,0.124786,0.0003041976,0.00008764856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02680027,0.00001376498,0.936141,0.004846807,0.0001123545,0.0001469755,1.647174e-7,0.00008987408,0.03184885],"genre_scores_gemma":[0.8048467,0.000007890613,0.1929836,0.002102933,0.00003675589,0.000005110765,1.790241e-7,0.000002319468,0.00001450669],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8648236,"threshold_uncertainty_score":0.6177574,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01521811981985313,"gpt":0.2520598938413013,"spread":0.2368417740214482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001923823,0.000125904,0.0002198223,0.0001058346,0.0001477621,0.00007219854,0.002775993,0.00002424594,0.00002943789],"category_scores_gemma":[0.0001365901,0.00007637068,0.00007495566,0.0008339825,0.006155908,0.0002320988,0.0007255087,0.0001236348,0.00001746413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002869053,"about_ca_system_score_gemma":0.00007819841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001679302,"about_ca_topic_score_gemma":4.58066e-7,"domain_scores_codex":[0.9982391,0.0001227407,0.0002842534,0.0003689864,0.00067395,0.0003109816],"domain_scores_gemma":[0.9981025,0.0004408742,0.0001365373,0.001090948,0.000137761,0.00009139721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006859019,0.00006278033,0.000003489387,0.000008168926,0.000003948789,0.000004388206,0.0007823117,0.0004871474,0.003898061,0.9905009,0.00001996004,0.00422193],"study_design_scores_gemma":[0.0001578647,0.0002063078,0.0005871889,0.00006880288,0.000002036402,0.000008685327,0.00001708642,0.0253466,0.1255782,0.8479343,0.000004775947,0.00008821042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3601982,0.00002094887,0.6369161,0.001397813,0.0001083026,0.000101687,0.000003754652,0.00005624818,0.001196946],"genre_scores_gemma":[0.9362475,0.000002596685,0.06321209,0.0005101979,0.00001736362,0.000001533204,2.270994e-7,0.000004144418,0.000004391817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5760492,"threshold_uncertainty_score":0.9965488,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DNA computing; DNA; Computation; Computer science; Theoretical computer science; Computational biology; Algorithm; Biology; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.01792685408095541,"gpt":0.2842121613217367,"spread":0.2662853072407813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004195501,0.0001030728,0.00009510662,0.00005629914,0.000188746,0.00006219151,0.000238942,0.00005325866,0.000002721648],"category_scores_gemma":[0.00005470582,0.00008366197,0.00006289943,0.0002219057,0.001107113,0.000005420976,0.00007499421,0.0000353698,0.000003052387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009103015,"about_ca_system_score_gemma":0.00001255775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.978245e-7,"about_ca_topic_score_gemma":8.950138e-8,"domain_scores_codex":[0.9990436,0.00004109534,0.0001273514,0.0003846467,0.0001620136,0.0002413341],"domain_scores_gemma":[0.9995046,0.00002875761,0.000035152,0.0002056464,0.0001405495,0.00008534811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000429418,0.00008021309,0.000008132522,0.000006131048,0.00001442176,0.000002319365,0.00002498891,0.000390752,0.9159901,0.02851899,0.000570489,0.05435054],"study_design_scores_gemma":[0.000207765,0.0005299405,0.00001458166,0.000006893451,0.00001150191,0.00001445498,0.00000215214,0.2639368,0.7249399,0.00986148,0.0003193371,0.0001551687],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03357219,0.00004073037,0.9657096,0.0001932085,0.00005522455,0.0001676477,0.000002995374,0.00003911537,0.0002193467],"genre_scores_gemma":[0.722925,0.000009354596,0.2767606,0.0002057146,0.00007672802,0.000003453477,0.00000494822,0.000005596807,0.000008552674],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6893528,"threshold_uncertainty_score":0.4079205,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0127800864432951,"gpt":0.2474901808504944,"spread":0.2347100944071993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002125675,0.0003635714,0.000397746,0.0002856574,0.001002503,0.00204222,0.002711199,0.0000817457,0.00001908877],"category_scores_gemma":[0.0002476773,0.0002833343,0.0001083422,0.001637806,0.003873476,0.0007360587,0.0008641175,0.0005190194,0.00008398563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173248,"about_ca_system_score_gemma":0.0004616323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009827033,"about_ca_topic_score_gemma":5.019737e-7,"domain_scores_codex":[0.995872,0.0004109539,0.0004320453,0.001239379,0.001003784,0.001041882],"domain_scores_gemma":[0.9972036,0.0006177502,0.0001659309,0.001209687,0.000344849,0.0004581199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005555285,0.00009008433,0.00001834205,0.0000119716,0.000009212466,0.00004404676,0.0008837485,0.002555465,0.0002671419,0.9889884,0.0000984191,0.007027641],"study_design_scores_gemma":[0.0002698428,0.0003084354,0.00004358976,0.00008790318,0.000004633974,0.000341269,0.00003415793,0.8487307,0.002096928,0.1463762,0.001332695,0.0003736971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03529698,0.0001319491,0.9550339,0.001098181,0.002664281,0.000346839,0.000002210981,0.0003416,0.005084078],"genre_scores_gemma":[0.892573,0.00000178238,0.1069387,0.0003047325,0.0001353797,0.000009598166,3.833481e-7,0.00001462951,0.00002185905],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.857276,"threshold_uncertainty_score":0.9999619,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01301042963313472,"gpt":0.2584973290919054,"spread":0.2454868994587706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629191,0.0002068653,0.0002008695,0.0001950263,0.0005625551,0.001037015,0.002485157,0.00007775513,0.00009419202],"category_scores_gemma":[0.0001279788,0.0001776159,0.00005020297,0.001145706,0.001723052,0.002061237,0.0009078998,0.0004100047,0.0001499478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004716269,"about_ca_system_score_gemma":0.000177529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006123936,"about_ca_topic_score_gemma":0.000007748739,"domain_scores_codex":[0.9972062,0.0001028881,0.0002979301,0.0008183122,0.000901968,0.0006727635],"domain_scores_gemma":[0.9981036,0.0001146892,0.00008154605,0.0009957108,0.0002724638,0.0004320079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004165557,0.00008164173,0.00004554117,0.00000518556,0.000002775319,0.000005234009,0.0006910068,0.00269417,0.01375427,0.8957092,0.0002973796,0.08670943],"study_design_scores_gemma":[0.0002842344,0.000160112,0.0000995937,0.00001297267,0.000002184715,0.00003145602,0.000005899404,0.9532411,0.01162307,0.03405494,0.0002142486,0.0002701602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01161023,0.000009330842,0.9751519,0.002097497,0.0009580393,0.0002544071,7.551283e-7,0.0004193301,0.009498495],"genre_scores_gemma":[0.7042872,0.000004915119,0.2951487,0.0003974149,0.0000992218,0.00001246865,0.000001636391,0.000009929271,0.0000385415],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.950547,"threshold_uncertainty_score":0.9999959,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009692261270437333,"gpt":0.2472509920357312,"spread":0.2375587307652939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003849485,0.0001219183,0.00009585636,0.00004196841,0.0002278219,0.00008870211,0.000589145,0.00007342544,0.00005780563],"category_scores_gemma":[0.00009783093,0.00009635974,0.00004988938,0.0001634282,0.001150922,0.000006993531,0.0002661724,0.00007212575,0.00005856581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001575128,"about_ca_system_score_gemma":0.00009310873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001699036,"about_ca_topic_score_gemma":2.55833e-7,"domain_scores_codex":[0.9988295,0.0000373471,0.0001268659,0.0004151515,0.0002623406,0.0003288169],"domain_scores_gemma":[0.9993332,0.00001227013,0.00003274948,0.0003813392,0.00009731324,0.0001431181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001503913,0.000009861081,0.00000487939,0.000002283982,0.000002664733,0.000002161459,0.00001563768,0.00008310455,0.5848855,0.4088369,0.00001445814,0.006127526],"study_design_scores_gemma":[0.0002166498,0.0002482187,0.0001955882,0.00001208754,0.000003287578,0.00002285623,0.000003051807,0.0004951918,0.8623796,0.1358533,0.0004108615,0.0001592358],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4795387,0.00004154799,0.5158944,0.0002414646,0.0003848663,0.000100983,0.000001380472,0.00002916066,0.003767576],"genre_scores_gemma":[0.9343089,0.000007138387,0.06478803,0.0005591293,0.0003074746,0.000004040399,0.000001916674,0.000009118237,0.00001423359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4547703,"threshold_uncertainty_score":0.424062,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Degree (music); Simplex; Combinatorics; Discrete mathematics; Upper and lower bounds; Polynomial; Integer (computer science); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05602989794902363,"gpt":0.3618705996515992,"spread":0.3058407017025756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001327144,0.00008869352,0.0001689354,0.00007039626,0.0002237569,0.00004122682,0.0008499746,0.0000312244,0.00009707497],"category_scores_gemma":[0.0008657702,0.00004658186,0.00006630485,0.0006256764,0.003189959,0.0001019694,0.000245182,0.00007005074,0.000001203966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002351396,"about_ca_system_score_gemma":0.00008803463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006129443,"about_ca_topic_score_gemma":0.000001642464,"domain_scores_codex":[0.9985664,0.00008351357,0.0003551216,0.000193163,0.0005475067,0.0002542252],"domain_scores_gemma":[0.9953566,0.003581025,0.0001582405,0.0004795907,0.0003882837,0.00003621896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002515033,0.00004934711,0.00001497424,0.00001721657,0.000004782074,1.154916e-7,0.0001352489,0.00578152,0.0003378857,0.9842334,0.0003765687,0.0090238],"study_design_scores_gemma":[0.0002602187,0.00005849629,0.0006397481,0.00001125171,0.00001119327,0.000001578906,0.00001684653,0.6617353,0.008867264,0.3282425,0.0001018266,0.00005384593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009720004,0.00002097003,0.988537,0.0005623112,0.00007528468,0.000528699,0.0000145999,0.00001776703,0.0005233869],"genre_scores_gemma":[0.6948952,0.000002552563,0.3049225,0.00005256787,0.00007393103,0.00001459659,0.000001143035,0.000008907412,0.00002856926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6851752,"threshold_uncertainty_score":0.9995228,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01896866439580035,"gpt":0.2679945130767457,"spread":0.2490258486809453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003049233,0.0001417626,0.0002136406,0.0002038854,0.000320406,0.0001988184,0.002500884,0.00002959613,0.00004122468],"category_scores_gemma":[0.00006453324,0.0001156642,0.00006012397,0.001260939,0.005257633,0.0006071354,0.0009846165,0.0001359135,0.0000394046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003669326,"about_ca_system_score_gemma":0.0001032026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001057412,"about_ca_topic_score_gemma":0.000003448245,"domain_scores_codex":[0.9979126,0.00006900405,0.0003924806,0.0004758928,0.0006222273,0.0005277745],"domain_scores_gemma":[0.9983377,0.0002449325,0.00005867234,0.0008691497,0.0002465429,0.0002429604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007947692,0.00008249321,0.00004508792,0.000004007342,0.000002737931,0.000006588264,0.000432065,0.0001687269,0.003510064,0.9760783,0.00001266397,0.01964937],"study_design_scores_gemma":[0.0002235758,0.0002010073,0.004684904,0.00001580476,0.000001736867,0.00001652287,0.000007326389,0.4982521,0.04057647,0.4558494,0.00001881505,0.0001523132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1967539,0.000009147967,0.8000614,0.0004198877,0.0003495873,0.0001071965,0.000002138135,0.0001558395,0.002140905],"genre_scores_gemma":[0.7629954,0.000001042315,0.2366159,0.0003457542,0.00002954592,0.000001005721,6.294954e-7,0.000004017064,0.000006706471],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5662415,"threshold_uncertainty_score":0.9974495,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01555006412774927,"gpt":0.2578851609787024,"spread":0.2423350968509531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827266,0.000120374,0.0001676952,0.0002017551,0.0003042694,0.00008155328,0.001506101,0.00002912575,0.00003038116],"category_scores_gemma":[0.00003344947,0.00009631783,0.00005180355,0.0009972791,0.001375493,0.0003305872,0.0006183593,0.0001356453,0.00007775616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004683021,"about_ca_system_score_gemma":0.000126901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001256333,"about_ca_topic_score_gemma":3.888028e-8,"domain_scores_codex":[0.99793,0.00009303863,0.0002522299,0.0004818307,0.0008384661,0.0004043714],"domain_scores_gemma":[0.9987146,0.000165736,0.00005931695,0.0006478276,0.0001856798,0.0002268607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003644845,0.0001481302,0.00004103337,0.000007289464,0.000002893008,0.00001304952,0.001294778,0.01100982,0.000206,0.9836702,0.00002653786,0.003576645],"study_design_scores_gemma":[0.0002267483,0.0005055055,0.000208142,0.00001980897,0.000001053321,0.00003824082,0.000004222444,0.9801518,0.01137175,0.007135409,0.0002020078,0.0001352763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09802427,0.000009383612,0.8933218,0.0002935956,0.0002199932,0.000233534,4.861388e-7,0.0002909403,0.007605962],"genre_scores_gemma":[0.7541283,0.00001526328,0.2455995,0.0002077318,0.00002451021,0.000006919143,1.036791e-7,0.000004564088,0.00001305752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9765348,"threshold_uncertainty_score":0.5068062,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007316668029087797,"gpt":0.2601985053427479,"spread":0.2528818373136601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00236935,0.0001681062,0.000179003,0.0001606685,0.0005838955,0.0006244772,0.001608865,0.0000597811,0.00001023578],"category_scores_gemma":[0.00007121933,0.000129063,0.00004586515,0.0006557016,0.001753954,0.0008723389,0.001165959,0.0001440136,0.000009061354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003169372,"about_ca_system_score_gemma":0.00008935645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002326927,"about_ca_topic_score_gemma":4.376581e-7,"domain_scores_codex":[0.9978408,0.00002695037,0.0002343788,0.000724851,0.0004973995,0.0006756825],"domain_scores_gemma":[0.9984781,0.0004121867,0.00005126259,0.0005735732,0.0001736721,0.0003112525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003039319,0.00004143381,0.00004537272,0.000005205252,0.000002464937,0.000008041648,0.0001698899,0.00003894886,0.000595662,0.9013503,0.0001453977,0.09756687],"study_design_scores_gemma":[0.0006059979,0.0006197638,0.001962294,0.00002954593,0.000004913131,0.00008241127,0.000004050008,0.9104412,0.00635826,0.07727003,0.002283003,0.0003385531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05595393,0.00005376359,0.9422053,0.0003415271,0.00062637,0.0001858987,0.000002560322,0.0001364455,0.000494269],"genre_scores_gemma":[0.5822266,0.000002640876,0.4173099,0.0003129503,0.0001321687,0.000003020226,6.855835e-7,0.000004549452,0.000007488164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9104022,"threshold_uncertainty_score":0.6462516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01071225163422513,"gpt":0.2594873612681509,"spread":0.2487751096339258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001867603,0.0001162555,0.0001457769,0.0002242864,0.0002288482,0.0001502487,0.001529601,0.00004638466,0.00005669726],"category_scores_gemma":[0.00006344343,0.00009899014,0.00005019026,0.00107108,0.002948696,0.0005235983,0.000530092,0.0001309966,0.00003666134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003156983,"about_ca_system_score_gemma":0.0000672348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003911548,"about_ca_topic_score_gemma":5.743824e-7,"domain_scores_codex":[0.9979697,0.00006497555,0.0003187314,0.0004548858,0.0007164613,0.0004752235],"domain_scores_gemma":[0.9986632,0.000208043,0.00008581177,0.0004957786,0.0002747492,0.0002723527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005120755,0.00005627928,0.0003392832,0.00000633767,0.000002354878,0.000002005952,0.0001902355,0.0001525585,0.001264511,0.9679481,0.0001964916,0.0298367],"study_design_scores_gemma":[0.0004488461,0.0002055421,0.0007316648,0.00002231862,0.000002142585,0.0000183892,0.00001029701,0.8393288,0.0284041,0.1296229,0.0009966564,0.0002083234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0168092,0.0000149641,0.9794729,0.0004398478,0.0005698132,0.0001490553,0.000001632267,0.0001123258,0.002430257],"genre_scores_gemma":[0.6762913,0.000004046058,0.3234783,0.0001935502,0.00001536568,0.000001049191,9.999135e-7,0.000003187419,0.00001215404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8391763,"threshold_uncertainty_score":0.9997647,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Random variable; Set (abstract data type); Order (exchange); Discrete mathematics; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01110638169363145,"gpt":0.2534107792008292,"spread":0.2423043975071978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410612,0.0001380332,0.0001605821,0.0001668348,0.0004629553,0.0004481437,0.0012353,0.0000447303,0.00002736803],"category_scores_gemma":[0.0002326369,0.000114691,0.00007286738,0.0008936697,0.001191313,0.0006610653,0.0003001348,0.00009542704,0.0000661918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000515756,"about_ca_system_score_gemma":0.0001117693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001743676,"about_ca_topic_score_gemma":0.000001403433,"domain_scores_codex":[0.9981244,0.00005781015,0.0002963593,0.0006321662,0.0004310355,0.0004582213],"domain_scores_gemma":[0.9984214,0.0004399481,0.00007025204,0.0006020323,0.0002457676,0.0002205458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006582385,0.00002421764,0.0000286479,0.00000168348,0.000002042401,0.00000490856,0.0001916363,0.001007779,0.00009129958,0.8776513,0.0001713391,0.1207593],"study_design_scores_gemma":[0.001665946,0.0001529444,0.0006730928,0.00001081873,0.000003357013,0.00008688302,0.000003526435,0.9123986,0.0005811125,0.08237204,0.00186238,0.0001892788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003289905,0.000008421133,0.9854616,0.002991371,0.0008518701,0.0002996493,0.00000331265,0.0002815281,0.006812362],"genre_scores_gemma":[0.7039872,0.000006250111,0.2952616,0.0005863193,0.0001059302,0.000009526894,0.000002084769,0.000003902286,0.00003724364],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9113908,"threshold_uncertainty_score":0.4676963,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01505732805158794,"gpt":0.2993394964102967,"spread":0.2842821683587087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00248951,0.0002085399,0.0002247202,0.0003933143,0.0005912127,0.0005601206,0.004723408,0.00004847014,0.00009769015],"category_scores_gemma":[0.0001828865,0.00017441,0.000080562,0.002725777,0.003075098,0.001833872,0.002034958,0.0003571419,0.000498263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251079,"about_ca_system_score_gemma":0.0001130466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.179318e-7,"about_ca_topic_score_gemma":1.767667e-7,"domain_scores_codex":[0.9964616,0.0001499589,0.0003065983,0.0009754897,0.001109465,0.0009968862],"domain_scores_gemma":[0.9974242,0.0003654603,0.00005986038,0.001405316,0.0002651778,0.0004799343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006219807,0.00003580035,0.00004994603,0.000003392203,0.0000022789,0.0000118831,0.000162138,0.0001954522,0.001251161,0.8896527,0.00003456055,0.1085945],"study_design_scores_gemma":[0.0003089225,0.0001608216,0.0006830332,0.00003433129,0.000002298091,0.0000665386,0.000002831576,0.5950605,0.01496743,0.3853117,0.00306171,0.0003399306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02381196,0.00005890368,0.96277,0.001721215,0.0002202082,0.0002258865,6.718613e-7,0.0004498952,0.01074128],"genre_scores_gemma":[0.6958839,0.000006248466,0.3032374,0.0006440771,0.0001847873,0.00001028605,2.338934e-7,0.000007929609,0.00002518019],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6720719,"threshold_uncertainty_score":0.999638,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01276918873415195,"gpt":0.2434179504003676,"spread":0.2306487616662157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007210198,0.00008086475,0.0001226343,0.0001579587,0.0001885123,0.0001979841,0.0004798601,0.00002723378,0.00001483177],"category_scores_gemma":[0.0001081517,0.00006866446,0.00001877419,0.0007027502,0.000869533,0.0005046168,0.0001626591,0.00007380125,0.000005368766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001775109,"about_ca_system_score_gemma":0.00006418047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003124241,"about_ca_topic_score_gemma":3.040503e-7,"domain_scores_codex":[0.9989309,0.00004408809,0.00022503,0.00028189,0.000325168,0.0001929212],"domain_scores_gemma":[0.999177,0.000206694,0.0000711274,0.0002758868,0.0001744956,0.0000947552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.968395e-7,0.00001431692,0.00008787848,0.000002900537,8.123487e-7,0.000001029785,0.0001323597,0.002537407,0.0003391601,0.9562262,0.000004320312,0.04065267],"study_design_scores_gemma":[0.0001118319,0.0001204134,0.00535435,0.00002108828,0.00000222543,0.00002285083,0.000007413964,0.941218,0.0001990972,0.05284569,0.00000943404,0.00008761976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01028564,0.00003195388,0.985191,0.0009982694,0.0002201065,0.00009675758,6.958632e-7,0.00008869259,0.003086827],"genre_scores_gemma":[0.8869597,0.000004817036,0.1127244,0.0002762716,0.0000296497,7.972748e-7,4.06362e-7,0.000001239505,0.000002758852],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9386806,"threshold_uncertainty_score":0.3203831,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0262796194452426,"gpt":0.2461781794776854,"spread":0.2198985600324428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226497,0.0001376738,0.0001614022,0.00007712712,0.0003549083,0.0001664119,0.001633638,0.00004741495,0.00007380312],"category_scores_gemma":[0.00002564259,0.00008528576,0.00005549276,0.0008196534,0.001503273,0.001047755,0.0005766878,0.0001943576,0.00009696513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002251715,"about_ca_system_score_gemma":0.0000524683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.164626e-7,"about_ca_topic_score_gemma":1.728422e-8,"domain_scores_codex":[0.9981532,0.0001404715,0.0002589813,0.0003069959,0.0005982885,0.0005420275],"domain_scores_gemma":[0.9979672,0.0008412641,0.00009851452,0.0007645581,0.0001123531,0.0002161146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005810422,0.00004788277,0.00001223247,0.000001172755,0.000002264584,0.000001099397,0.0003073228,0.001468572,0.0000378832,0.9571469,0.0002299685,0.04073893],"study_design_scores_gemma":[0.00006552214,0.0000986919,0.00003710595,0.0000242,0.000003076774,0.000008030712,0.00000277815,0.9096573,0.0003697168,0.08959914,0.00002825305,0.000106173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00467148,0.00003172676,0.9823406,0.0008806026,0.000690864,0.0001323031,3.521396e-7,0.00008152878,0.01117059],"genre_scores_gemma":[0.9795883,0.00000516624,0.01908231,0.001056277,0.0002441699,0.000005058543,5.769025e-7,0.000005433036,0.00001267181],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9749169,"threshold_uncertainty_score":0.5538872,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0108842540742893,"gpt":0.2659373913081476,"spread":0.2550531372338584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506819,0.000211451,0.0002309924,0.0001799845,0.0004246264,0.0006097996,0.003286829,0.00005907168,0.00006933901],"category_scores_gemma":[0.0001915241,0.0001714478,0.0001036467,0.0009447043,0.001535342,0.0008561254,0.001015378,0.0001213158,0.0002013676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004040587,"about_ca_system_score_gemma":0.0001028816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002026117,"about_ca_topic_score_gemma":1.914381e-7,"domain_scores_codex":[0.9975528,0.00006496729,0.0002729378,0.0007925907,0.0005601638,0.0007565017],"domain_scores_gemma":[0.9976035,0.0008604829,0.00007285747,0.001057976,0.0001438315,0.0002613954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001440204,0.00006331205,0.00003169626,0.000006545579,0.000003567015,0.00001870272,0.0002150439,0.00009821014,0.0006721432,0.9305323,0.00032408,0.06801994],"study_design_scores_gemma":[0.0004370485,0.0002925964,0.0004094237,0.00002530984,0.000004675978,0.00007883849,0.00001152863,0.8375713,0.003818084,0.1538194,0.003249617,0.0002821213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02922505,0.0000495616,0.9620371,0.001565727,0.0005254345,0.0002241961,0.000006470128,0.0005192121,0.005847239],"genre_scores_gemma":[0.8030336,0.000007879313,0.1952347,0.00141621,0.000213682,0.00001617517,0.000001984429,0.00001019614,0.00006560934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8374731,"threshold_uncertainty_score":0.6991439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}