{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":93,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":93,"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","author_layer_release":"2026-06-26"},"query_hash":"e1e0608db5e6","filters":{"venue":"Information and Computation"}},"results":[{"id":"W2096204190","doi":"10.1016/j.ic.2016.02.008","title":"A mathematical theory of resources","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":313,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Ministero dello Sviluppo Economico; Institut Périmètre de physique théorique; Industry Canada; Government of Canada; John Templeton Foundation","keywords":"Resource (disambiguation); Computer science; Class (philosophy); Convertibility; Quantum entanglement; Resource dependence theory; Management science; Mathematical economics; Quantum; Mathematics; Economics; Artificial intelligence; Quantum mechanics; Physics","authors":[{"name":"Bob Coecke","is_ca":false},{"name":"T. A. Fritz","is_ca":true},{"name":"Robert W. Spekkens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009347383831875451,"gpt":0.237595091294617,"spread":0.2282477074627415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009270685,0.000030027,0.00004327198,0.00002966479,0.00002926588,0.00001309619,0.00002360998,0.000009037952,0.0001001777],"category_scores_gemma":[0.000003456773,0.00001944063,0.00001423971,0.00003799868,0.00001716695,0.0001855835,0.00001096399,0.00001157719,0.00004159268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001899488,"about_ca_system_score_gemma":0.000005818807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001485602,"about_ca_topic_score_gemma":2.468708e-8,"domain_scores_codex":[0.9997315,0.000009095387,0.0001456037,0.00002608395,0.00005150406,0.00003614934],"domain_scores_gemma":[0.9997715,0.00005581258,0.00007939335,0.00003719514,0.00003835344,0.00001773162],"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.000002455255,0.000006777458,0.00008152272,0.000004031317,0.00000347305,2.185563e-9,0.000288107,0.00000261989,0.000103182,0.7907278,0.00003910097,0.208741],"study_design_scores_gemma":[0.000225748,0.00001431736,0.0009562948,0.00001850201,0.000004491279,3.538187e-7,0.0004021469,0.005439378,0.0006137708,0.9900214,0.002264884,0.00003868888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2518947,0.000002181383,0.7432376,0.000129391,0.000008156097,0.00004828495,0.000008122807,0.000009029897,0.004662537],"genre_scores_gemma":[0.9993196,8.045636e-7,0.0006054429,0.00002353661,0.00001205171,0.000008159428,0.000006278291,0.000001283478,0.00002289459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7474248,"threshold_uncertainty_score":0.1096876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100893927","doi":"10.1006/inco.2001.2962","title":"Bisimulation for Labelled Markov Processes","year":2002,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":307,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Markov chain; Markov process; State space; Discrete mathematics; Algebra over a field; Pure mathematics","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03763854844124866,"gpt":0.2940433828801528,"spread":0.2564048344389042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002395702,0.00007302651,0.00006906344,0.0001394484,0.0001536827,0.0002310217,0.0001242073,0.0000439685,0.000005918521],"category_scores_gemma":[0.0001842657,0.00007182327,0.00001556719,0.0003228054,0.00001495916,0.003099735,0.00002827475,0.00003424335,0.00003602219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002039006,"about_ca_system_score_gemma":0.00001345739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000226559,"about_ca_topic_score_gemma":5.194583e-7,"domain_scores_codex":[0.9993668,0.00002511612,0.0002712274,0.00009555624,0.0001412353,0.0001001056],"domain_scores_gemma":[0.9993184,0.0001010114,0.0001632115,0.0001005072,0.0002813963,0.00003553987],"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.000009714227,0.00002088111,0.0000926215,0.00015248,0.000005608,4.54798e-8,0.002568832,0.004831388,0.00002197416,0.04762426,0.0008134797,0.9438587],"study_design_scores_gemma":[0.0004476286,0.00005778566,0.0009022747,0.00000952351,0.000002684489,0.000004247879,0.00003039938,0.9840585,0.0002718402,0.003631752,0.01048965,0.00009371329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007189399,0.00005280951,0.9899232,0.0004238538,0.0001662245,0.0003382115,0.00000231456,0.0001720774,0.001731901],"genre_scores_gemma":[0.5102012,0.00002878043,0.4892802,0.0003615386,0.00002140135,0.00004380115,0.00002611825,0.000002719096,0.00003431451],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9792271,"threshold_uncertainty_score":0.2928868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964541472","doi":"10.1016/s0890-5401(03)00057-9","title":"Distinguishing string selection problems","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":236,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Substring; String (physics); String metric; String searching algorithm; Approximate string matching; Mathematics; Combinatorics; Commentz-Walter algorithm; Time complexity; Edit distance; Set (abstract data type); Hamming distance; Discrete mathematics; Algorithm; Computer science; Pattern matching; Artificial intelligence","authors":[{"name":"J. Kevin Lanctot","is_ca":true},{"name":"Ming Li","is_ca":true},{"name":"Bin Ma","is_ca":true},{"name":"Shaojiu Wang","is_ca":false},{"name":"Louxin Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0130856715713156,"gpt":0.2360714225352947,"spread":0.2229857509639791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001944419,0.00005978956,0.00005041523,0.00008101902,0.0001923338,0.0004115827,0.00007700154,0.00002687078,0.000002621973],"category_scores_gemma":[0.00004962961,0.00005585283,0.00001071152,0.0001977474,0.00000688814,0.002802794,0.00003859657,0.00006035636,0.00001512828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001954578,"about_ca_system_score_gemma":0.00002276012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001663589,"about_ca_topic_score_gemma":0.000001226853,"domain_scores_codex":[0.9994743,0.00002721859,0.0001852671,0.00008430855,0.000136023,0.00009291395],"domain_scores_gemma":[0.9996867,0.0000260788,0.0001027494,0.0000603164,0.00008431679,0.0000398976],"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.000001892869,0.00001864705,0.001204217,0.0000452079,0.000006021415,3.263847e-7,0.002068381,0.02273725,0.0000658127,0.2949246,0.0005534595,0.6783742],"study_design_scores_gemma":[0.0002598437,0.00002982658,0.003166568,0.00002235265,0.000001460821,0.00002429241,0.00006321479,0.9698035,0.0001726772,0.008047234,0.01830435,0.0001047363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01270667,0.00002325369,0.9840382,0.00005533399,0.0001618884,0.00008896536,6.640166e-7,0.000140259,0.002784748],"genre_scores_gemma":[0.9022503,0.000006884106,0.09756918,0.0001247919,0.00001198607,0.000005526522,0.00001844332,0.000001707715,0.00001110528],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9470662,"threshold_uncertainty_score":0.3968902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056277260","doi":"10.1016/j.ic.2007.07.003","title":"Anonymity protocols as noisy channels","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":198,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Anonymity; Computer science; Theoretical computer science; Probabilistic logic; Covert; Relation (database); Channel (broadcasting); Covert channel; Computer security; Data mining; Artificial intelligence; Computer network","authors":[{"name":"Konstantinos Chatzikokolakis","is_ca":false},{"name":"Catuscia Palamidessi","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01467375131921011,"gpt":0.2855515065472919,"spread":0.2708777552280818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000541085,0.00007639598,0.00008381391,0.0001409738,0.0001110642,0.0003420756,0.0001457519,0.00004411384,0.000007663154],"category_scores_gemma":[0.00002526584,0.00006941777,0.00003187834,0.0002204602,0.00001458695,0.001514397,0.00005237379,0.00007064026,0.0001151406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002076437,"about_ca_system_score_gemma":0.00002356018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009400624,"about_ca_topic_score_gemma":0.000005978118,"domain_scores_codex":[0.9992161,0.00001756457,0.0003242322,0.00009340294,0.0002104611,0.0001382791],"domain_scores_gemma":[0.9995471,0.00003904695,0.000150857,0.00005820354,0.000146247,0.00005858106],"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.00001552447,0.00002775009,0.0001037616,0.00003031185,0.00001467412,0.000002916636,0.005647328,0.0140298,0.00001006036,0.4661722,0.0005474606,0.5133982],"study_design_scores_gemma":[0.0002804617,0.00006355951,0.001150509,0.00001780043,0.000001943349,0.00001788527,0.0001536363,0.9907997,0.0001571387,0.0003427822,0.006913078,0.0001015679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04084196,0.000003500478,0.9543633,0.0001636457,0.0001096083,0.0009074347,2.487847e-7,0.0001142429,0.003496088],"genre_scores_gemma":[0.9920443,6.746203e-7,0.007075234,0.0007319273,0.00004216051,0.000058338,0.00001157475,0.000001654687,0.00003409727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9767699,"threshold_uncertainty_score":0.3298643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131358503","doi":"10.1016/j.ic.2006.09.005","title":"Towards a dichotomy theorem for the counting constraint satisfaction problem","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":137,"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; Discrete mathematics; Counting problem; Homomorphism; Complexity of constraint satisfaction; Combinatorics; Time complexity; Class (philosophy); Constraint (computer-aided design); Constraint graph; Set (abstract data type); Constraint satisfaction dual problem; Constraint satisfaction; Local consistency; Computer science","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Víctor Dalmau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01361824642734606,"gpt":0.278929148448292,"spread":0.265310902020946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259155,0.00007193493,0.00006026497,0.00009318988,0.0003151383,0.0003716806,0.0001285625,0.0000290624,0.000002197763],"category_scores_gemma":[0.0000281391,0.00005251174,0.00002697587,0.0002087859,0.00007244126,0.001587359,0.00004263943,0.00006984296,0.000007560578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949883,"about_ca_system_score_gemma":0.00004537084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005651456,"about_ca_topic_score_gemma":0.00001024398,"domain_scores_codex":[0.9993042,0.00003000579,0.0002357934,0.00008745963,0.0002035368,0.0001389718],"domain_scores_gemma":[0.9993209,0.0002261536,0.0001334817,0.00009380203,0.0002034436,0.00002223185],"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.000006867746,0.000002782664,0.000140838,0.00001485541,0.000003670599,5.537564e-8,0.0003433744,0.005315599,0.00002731065,0.5300096,0.0001054371,0.4640296],"study_design_scores_gemma":[0.0004622655,0.00003724811,0.01192595,0.00001028,0.000003131669,0.00001492876,0.0002003145,0.676091,0.0001657375,0.3069376,0.004066169,0.00008537693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009397312,0.0000314538,0.9866529,0.0007936696,0.00008367066,0.0005581792,0.000004042428,0.0001102786,0.002368556],"genre_scores_gemma":[0.9511014,0.000006374371,0.04854,0.0002145487,0.00002865784,0.00008003114,0.00001643538,0.000002629066,0.00000994445],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9417041,"threshold_uncertainty_score":0.3584124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912608078","doi":"10.1016/s0890-5401(03)00090-7","title":"Follow automata","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","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":"Nondeterministic finite automaton; Regular expression; Automaton; Nondeterministic algorithm; Quotient; Combinatorics; Computer science; Mathematics; Discrete mathematics; Equivalence relation; Deterministic automaton; Equivalence (formal languages); Theoretical computer science; Automata theory; Programming language","authors":[{"name":"Lucian Ilie","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009556904921695659,"gpt":0.2247056589438139,"spread":0.2151487540221183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002019414,0.00005520454,0.00005118402,0.00007914181,0.00008843455,0.0002324979,0.00009912835,0.00002507395,0.000005985386],"category_scores_gemma":[0.00002646253,0.00005102137,0.00001561735,0.000153464,0.00001086445,0.001953847,0.00002715883,0.00003221788,0.00009767753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001001729,"about_ca_system_score_gemma":0.00002189467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000293059,"about_ca_topic_score_gemma":2.483504e-7,"domain_scores_codex":[0.9995511,0.00002910861,0.0001569405,0.00006392269,0.0001150393,0.00008389002],"domain_scores_gemma":[0.9997202,0.00003241027,0.00006646724,0.0001027264,0.00004003298,0.00003822057],"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":[8.996964e-7,0.000007570055,0.00005519853,0.000008167655,0.00000314703,3.679655e-7,0.0007732029,0.0003314012,0.00001259102,0.5976205,0.0007433203,0.4004436],"study_design_scores_gemma":[0.0006953179,0.00004354256,0.003194215,0.00001030339,0.000002303856,0.00004829923,0.0001550389,0.893082,0.0003512068,0.06465684,0.03760453,0.0001564365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02709728,0.00002548184,0.958279,0.0002398164,0.0001921048,0.00006664002,5.993554e-7,0.0002382742,0.01386086],"genre_scores_gemma":[0.9647955,0.000007779603,0.03433308,0.0008186159,0.000005686275,0.000004472786,0.000008832393,0.000001491174,0.00002459683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9376982,"threshold_uncertainty_score":0.2241982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963114728","doi":"10.1016/j.ic.2016.09.005","title":"Mutual visibility by luminous robots without collisions","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","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":"Carleton University; University of Ottawa","funders":"","keywords":"Visibility; Robot; Computer science; Convergence (economics); Computer vision; Plane (geometry); Artificial intelligence; Point (geometry); Topology (electrical circuits); Mathematics; Physics; Geometry; Optics; Combinatorics; Economics","authors":[{"name":"Giuseppe Antonio Di Luna","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Sruti Gan Chaudhuri","is_ca":false},{"name":"Federico Poloni","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Giovanni Viglietta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0127036894534556,"gpt":0.2644667625921533,"spread":0.2517630731386977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002418674,0.0000787512,0.00008015567,0.0000953558,0.0001537161,0.0002405541,0.0001527574,0.00004455107,0.00001487011],"category_scores_gemma":[0.00005707245,0.00005610393,0.00001863652,0.0001952314,0.00004128204,0.002708924,0.00007988635,0.00004148902,0.0001384827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003511434,"about_ca_system_score_gemma":0.00005186162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008980813,"about_ca_topic_score_gemma":0.000001615647,"domain_scores_codex":[0.9991816,0.00005069223,0.0002760012,0.0001246637,0.0002313189,0.0001356721],"domain_scores_gemma":[0.9994019,0.00007357955,0.0001035468,0.0001350685,0.0001846876,0.0001012319],"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.0000183458,0.00006721608,0.004740661,0.00002389,0.00001244648,4.045158e-7,0.002849367,0.005940105,0.00029732,0.03142291,0.009286766,0.9453406],"study_design_scores_gemma":[0.001185607,0.0001225923,0.007145034,0.00002449639,0.000002211328,0.00001142297,0.00005672436,0.97839,0.000336116,0.002646806,0.009887941,0.0001910471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02118596,0.00001222879,0.9746259,0.001693934,0.0001047622,0.000202242,0.000006559826,0.0001670745,0.002001274],"genre_scores_gemma":[0.9723319,0.00003259885,0.0267638,0.0006398954,0.00001000514,0.00001314651,0.00002671305,0.000002609055,0.0001793701],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9724499,"threshold_uncertainty_score":0.2319668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078103992","doi":"10.1016/j.ic.2005.02.004","title":"Bisimulation and cocongruence for probabilistic systems","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Bisimulation; Mathematics; Equivalence (formal languages); Probabilistic logic; Event (particle physics); Characterization (materials science); Algebra over a field; Discrete mathematics; Pure mathematics","authors":[{"name":"Vincent Danos","is_ca":false},{"name":"Josée Desharnais","is_ca":true},{"name":"François Laviolette","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01105095026478895,"gpt":0.2372247477449823,"spread":0.2261737974801933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001692594,0.0000659639,0.00007265854,0.00007696254,0.000135276,0.0003932124,0.00006156777,0.00003645767,2.864462e-7],"category_scores_gemma":[0.00003462072,0.00005888106,0.00001172818,0.0001065602,0.00002199009,0.001341653,0.00002549327,0.00002364364,0.000006510223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000195482,"about_ca_system_score_gemma":0.00002290425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004988892,"about_ca_topic_score_gemma":0.000005395944,"domain_scores_codex":[0.9994952,0.00001647083,0.0002186261,0.000092305,0.00008847986,0.00008891675],"domain_scores_gemma":[0.9995166,0.00009822965,0.0001186773,0.00005875491,0.0001786141,0.00002912405],"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.000008526627,0.00001751826,0.001244718,0.0001934793,0.000004269669,1.756329e-7,0.001147943,0.05738368,0.00001863512,0.8323973,0.0006284427,0.1069553],"study_design_scores_gemma":[0.0003899894,0.00004673967,0.0117451,0.00001325639,0.000002961695,0.000009066227,0.0000355283,0.9671335,0.00001106417,0.01716943,0.003362321,0.0000810424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05040921,0.00009642971,0.946988,0.0001058294,0.0001853171,0.0003995154,0.000002083588,0.0001011746,0.001712413],"genre_scores_gemma":[0.9938852,0.000003689423,0.005914967,0.00005634359,0.00003489008,0.00003139531,0.00003667258,0.000001626052,0.0000352568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.943476,"threshold_uncertainty_score":0.3791756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038319432","doi":"10.1016/j.ic.2008.07.005","title":"Tree exploration with advice","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":63,"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":"Agence Nationale de la Recherche","keywords":"Advice (programming); Tree (set theory); Forestry; Computer science; Data science; Geography; Mathematics; Combinatorics","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02485964979787116,"gpt":0.2401858564494084,"spread":0.2153262066515372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008734732,0.0000604911,0.00005295633,0.0001260986,0.0001840265,0.0001393324,0.00008577706,0.00002334892,0.000004682609],"category_scores_gemma":[0.000008685276,0.0000507628,0.000008734214,0.0002828907,0.00002544587,0.005172402,0.00002739556,0.0000457,0.00006028014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001013936,"about_ca_system_score_gemma":0.00004681483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008694933,"about_ca_topic_score_gemma":0.000003628791,"domain_scores_codex":[0.9994467,0.00002379525,0.0001674131,0.00007505824,0.0002025622,0.00008449782],"domain_scores_gemma":[0.9995908,0.00002062352,0.00008132737,0.00007825348,0.0001753121,0.00005366744],"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.00004242999,0.0000590323,0.0008608777,0.00004570771,0.00001754001,0.000004778913,0.02336414,0.1208654,0.00001897113,0.09097617,0.005392815,0.7583522],"study_design_scores_gemma":[0.0005424248,0.0001002686,0.002806442,0.000006793694,9.500577e-7,0.0000455363,0.0001621181,0.9913503,0.00004538295,0.0008338022,0.004014935,0.00009108137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004619237,0.000008145646,0.9837323,0.0009998495,0.00004008164,0.0001339957,4.008199e-7,0.0002373826,0.01022856],"genre_scores_gemma":[0.8486655,0.00006290391,0.1500741,0.001009975,0.00001405448,0.00002037602,0.00004904262,0.000002914887,0.000101091],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8704849,"threshold_uncertainty_score":0.3749866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076946745","doi":"10.1016/j.ic.2009.05.003","title":"The complexity of constraint satisfaction games and QCSP","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":62,"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":"Engineering and Physical Sciences Research Council; Ministerio de Educación, Cultura y Deporte","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Local consistency; Constraint (computer-aided design); Constraint satisfaction dual problem; Mathematics; Predicate (mathematical logic); Surjective function; Sentence; Set (abstract data type); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","authors":[{"name":"Ferdinand Börner","is_ca":false},{"name":"А. А. Булатов","is_ca":true},{"name":"H. Chen","is_ca":false},{"name":"Peter Jeavons","is_ca":false},{"name":"Andrei Krokhin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01776225052734606,"gpt":0.2474102144643625,"spread":0.2296479639370164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000175196,0.00006212114,0.00006926864,0.00007454691,0.0001990151,0.0001994117,0.00005096711,0.0000290101,0.000002783883],"category_scores_gemma":[0.00002840045,0.00004965562,0.00001503757,0.0001285669,0.0001665748,0.001086296,0.00001937434,0.00005078502,0.000002574066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001278763,"about_ca_system_score_gemma":0.00002709177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001560766,"about_ca_topic_score_gemma":0.00001108127,"domain_scores_codex":[0.9994357,0.00003177281,0.0002699789,0.00006688283,0.0001241703,0.00007147311],"domain_scores_gemma":[0.9995357,0.00006052597,0.0001751233,0.0000741687,0.0001173867,0.00003705882],"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.000003732209,0.000002299354,0.0004122739,0.000004029826,0.000002588119,3.825165e-8,0.0005293504,0.0005560817,0.00002174534,0.2217159,0.00005092119,0.7767011],"study_design_scores_gemma":[0.0004127365,0.0000796118,0.4422566,0.00001167783,0.000003507654,0.00003480892,0.0003432143,0.5223083,0.0001160484,0.03372984,0.0006145247,0.00008913771],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03575245,0.00004071354,0.9592411,0.003135141,0.0001027387,0.0001440413,0.000002000343,0.00006953243,0.001512284],"genre_scores_gemma":[0.9845179,0.00009138959,0.01505792,0.0003145305,0.000005893468,0.000001638826,0.000006721679,7.257605e-7,0.000003257064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9487655,"threshold_uncertainty_score":0.2024898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976635413","doi":"10.1016/j.ic.2007.07.009","title":"Execution monitoring enforcement under memory-limitation constraints","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Université Laval","funders":"","keywords":"Computer science; Enforcement; Automaton; Class (philosophy); Security policy; Computer security; Bounded function; Theoretical computer science; Distributed computing; Artificial intelligence; Law","authors":[{"name":"Chamseddine Talhi","is_ca":true},{"name":"Nadia Tawbi","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03018069831504839,"gpt":0.2908001041920741,"spread":0.2606194058770257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642051,0.00009561386,0.00007327103,0.0002125095,0.000246822,0.000293648,0.000132847,0.00006011889,0.00000530601],"category_scores_gemma":[0.00003019245,0.000104693,0.00002379257,0.0002769431,0.00004258663,0.002108762,0.00005190022,0.00008702208,0.0000581221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008076976,"about_ca_system_score_gemma":0.00003659328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000136896,"about_ca_topic_score_gemma":7.596322e-7,"domain_scores_codex":[0.998984,0.00002576512,0.0004221932,0.0001253645,0.0002766741,0.0001659371],"domain_scores_gemma":[0.9992904,0.0001161457,0.0002121364,0.0001113611,0.0001966514,0.00007332521],"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.000006971489,0.00001777502,0.0003582583,0.00002566877,0.0000100568,4.888337e-7,0.006500524,0.01104917,0.0001707064,0.2729898,0.0001119928,0.7087586],"study_design_scores_gemma":[0.001506841,0.0001126331,0.07207811,0.00008290101,0.00001117568,0.00006441893,0.006961862,0.8917657,0.006496154,0.0167454,0.003692776,0.0004820397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0726741,0.0000238309,0.9209821,0.0002354407,0.00044095,0.000154303,5.121984e-7,0.0001906512,0.005298161],"genre_scores_gemma":[0.9665322,0.00001043107,0.03303794,0.0003137947,0.00005854759,0.000004659777,0.00002854031,0.000002353041,0.00001155217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8938581,"threshold_uncertainty_score":0.4269256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053218689","doi":"10.1016/j.ic.2012.08.004","title":"Connected graph searching","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":44,"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":"Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Graph; Vertex (graph theory); Conjecture; Theoretical computer science; Connected component; Mathematics; Discrete mathematics","authors":[{"name":"Lali Barrière","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Fedor V. Fomin","is_ca":false},{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Nicolas Nisse","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01970005602923106,"gpt":0.2710275313583589,"spread":0.2513274753291278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002909676,0.00004998296,0.00004601328,0.0001579071,0.0001340005,0.0002388393,0.00008895879,0.00002405101,0.000008460664],"category_scores_gemma":[0.00002774522,0.00004673434,0.00001297857,0.0002606176,0.00001497443,0.003952069,0.00005671363,0.00006067207,0.00007820108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001081637,"about_ca_system_score_gemma":0.00001727945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007058308,"about_ca_topic_score_gemma":3.230006e-7,"domain_scores_codex":[0.9994411,0.00004418681,0.0001594137,0.00004611356,0.0001613089,0.0001478497],"domain_scores_gemma":[0.9996434,0.00004375129,0.0000576496,0.00006488001,0.00009320451,0.00009710392],"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.000004576709,0.00003294512,0.001902174,0.00003454121,0.00001060891,1.493502e-7,0.01150323,0.01201466,0.00003990427,0.4035522,0.00112961,0.5697753],"study_design_scores_gemma":[0.0003848782,0.00002832034,0.01301437,0.000007652571,0.000001197757,0.00001356198,0.0001719109,0.975813,0.00008060038,0.003497126,0.00687607,0.0001113073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01340176,0.00002857867,0.980634,0.0005125519,0.0001310384,0.0001099806,6.209683e-7,0.0001621946,0.005019269],"genre_scores_gemma":[0.953328,0.00001585632,0.04586112,0.000730373,0.00001702072,0.000005908109,0.00002518898,0.000001578454,0.00001500962],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9637983,"threshold_uncertainty_score":0.2865154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116455242","doi":"10.1016/j.ic.2004.10.001","title":"Fast approximate PCPs for multidimensional bin-packing problems","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":40,"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":"Computer science; Bin packing problem; Bin; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics","authors":[{"name":"Tuğkan Batu","is_ca":true},{"name":"Ronitt Rubinfeld","is_ca":false},{"name":"Patrick White","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01218179140506341,"gpt":0.2194373216403773,"spread":0.2072555302353139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009231098,0.00008828566,0.00007345309,0.000110116,0.00009904124,0.00007454739,0.00002228249,0.00004647415,0.000004776191],"category_scores_gemma":[0.000008630896,0.00008918382,0.00002129485,0.0001059686,0.000012716,0.0006612324,0.000007741667,0.00004746192,0.00002176345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003175609,"about_ca_system_score_gemma":0.00001322648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003809334,"about_ca_topic_score_gemma":0.000001825101,"domain_scores_codex":[0.9995037,0.000003995123,0.0002354064,0.00005410653,0.00009204503,0.0001107655],"domain_scores_gemma":[0.9997638,0.00001819704,0.00005153963,0.00003759375,0.00008804306,0.00004076021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003464971,0.000005230257,0.00001953296,0.0001176424,0.00000704874,3.369171e-8,0.001317609,0.9687999,0.00009187047,0.005426736,0.0001221561,0.0240887],"study_design_scores_gemma":[0.001085632,0.00002685421,0.0002284685,0.00004906282,0.00000470862,0.000006801431,0.0001126592,0.9911222,0.000422052,0.001406033,0.005403754,0.0001318076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01906975,0.00003739197,0.9787952,0.0001136348,0.0002104528,0.0003446537,0.00001204842,0.0003044224,0.001112441],"genre_scores_gemma":[0.9091993,0.00002957493,0.09006853,0.0002083276,0.00002950999,0.00004886552,0.0003881624,0.00001374571,0.00001400495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8901295,"threshold_uncertainty_score":0.3636811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066620717","doi":"10.1016/j.ic.2008.03.018","title":"State complexity of basic language operations combined with reversal","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"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":"State (computer science); Computer science; Theoretical computer science; Programming language; Algorithm","authors":[{"name":"Guangwu Liu","is_ca":false},{"name":"Carlos Martı́n-Vide","is_ca":false},{"name":"Arto Salomaa","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01625832527142936,"gpt":0.2311490287129097,"spread":0.2148907034414804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009571309,0.00005931095,0.0000840947,0.0000829308,0.0001165174,0.00005147859,0.00009987493,0.0000148264,0.000004475038],"category_scores_gemma":[0.000006960584,0.0000491026,0.0000124599,0.0001804132,0.00008316193,0.001391609,0.00003672127,0.00003897238,0.00001060514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009605185,"about_ca_system_score_gemma":0.00003875469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006149166,"about_ca_topic_score_gemma":0.00001033521,"domain_scores_codex":[0.9995083,0.00002661644,0.0001949103,0.00006078355,0.000140888,0.00006855364],"domain_scores_gemma":[0.9996806,0.00002541674,0.00007821442,0.0001003411,0.0000830298,0.00003239353],"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.0002422388,0.0002640479,0.003188106,0.0002362428,0.0000975445,0.00001875456,0.1249781,0.07889218,0.0009974986,0.5077166,0.00190371,0.281465],"study_design_scores_gemma":[0.001083262,0.000237382,0.03381025,0.00002106889,0.000003228996,0.00006023675,0.0004588958,0.9603531,0.001229408,0.002483605,0.0001283158,0.0001312571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4893164,0.00000777783,0.509967,0.0001504115,0.00002545893,0.00007533073,0.000004230964,0.00006031692,0.0003930109],"genre_scores_gemma":[0.973356,0.00000657996,0.02628871,0.0002812176,0.000004092043,0.000003368776,0.00004300291,0.000001633809,0.00001540741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8814609,"threshold_uncertainty_score":0.2002346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973873776","doi":"10.1016/j.ic.2004.03.005","title":"Computing the vertex separation of unicyclic graphs","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Computer science; Vertex (graph theory); Mathematics; Discrete mathematics; Graph","authors":[{"name":"John Ellis","is_ca":true},{"name":"Minko Markov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0162835703785676,"gpt":0.3142700028112472,"spread":0.2979864324326796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042563,0.00005841784,0.00006520959,0.0001419309,0.0001661524,0.0001008731,0.0002083058,0.00002464253,6.857759e-7],"category_scores_gemma":[0.00002655498,0.00004485544,0.00002385365,0.0004680557,0.00006538474,0.00147194,0.00007783275,0.00007393703,0.00001357986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001859867,"about_ca_system_score_gemma":0.00003955463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001418294,"about_ca_topic_score_gemma":0.000002281203,"domain_scores_codex":[0.9993234,0.00004337523,0.0002511872,0.00006874325,0.000215481,0.00009786389],"domain_scores_gemma":[0.999461,0.00009338708,0.0001474954,0.0001312181,0.000138022,0.00002891124],"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.000004447049,0.000009597201,0.00007387632,0.00001163354,0.000005876559,1.370542e-7,0.002985948,0.05457233,0.00008094573,0.6592419,0.00001939467,0.2829939],"study_design_scores_gemma":[0.0006981235,0.00008745702,0.009102453,0.00002348042,0.000002548937,0.00001674814,0.0003159095,0.6757287,0.001067369,0.3125476,0.0003150069,0.00009465955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1498044,0.00002912318,0.848695,0.0004052547,0.00006915262,0.0001356901,5.851022e-7,0.00005134314,0.0008093899],"genre_scores_gemma":[0.9870726,0.0000119698,0.01266381,0.0002323258,0.000004075452,0.000002602975,0.00000879956,0.000001530705,0.000002322983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8372682,"threshold_uncertainty_score":0.1829152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159509242","doi":"10.1016/j.ic.2007.02.004","title":"Exponential lower bounds for the number of words of uniform length avoiding a pattern","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"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":"Alphabet; Exponential growth; Mathematics; Exponential function; Combinatorics; Combinatorics on words; Finite set; Upper and lower bounds; Word length; Discrete mathematics; Word (group theory); Computer science; Natural language processing; Linguistics; Mathematical analysis; Geometry","authors":[{"name":"Jason P. Bell","is_ca":true},{"name":"Teow Lim Goh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01120924040276972,"gpt":0.2644339057006853,"spread":0.2532246652979155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006842926,0.00005233076,0.0000715116,0.00006155708,0.00009601661,0.00006339115,0.0001389036,0.00002794652,0.000004289715],"category_scores_gemma":[0.00001923071,0.00003915388,0.00003486376,0.0001322227,0.00003121652,0.000876549,0.00004564517,0.00003960619,0.000002768373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009751252,"about_ca_system_score_gemma":0.00001668649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002063894,"about_ca_topic_score_gemma":0.000002570928,"domain_scores_codex":[0.9993966,0.00001151196,0.0003150495,0.00004695234,0.0001431337,0.00008671213],"domain_scores_gemma":[0.9993218,0.0002471607,0.0002180123,0.00009147206,0.0001032127,0.00001833631],"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.00002890849,0.00002350634,0.0004908181,0.00006442473,0.00001769829,1.156476e-7,0.007096768,0.0007289015,0.0001041371,0.04790017,0.000132041,0.9434125],"study_design_scores_gemma":[0.000775888,0.00007223653,0.01043094,0.00004121516,0.000009697778,0.00001266373,0.001496054,0.9746579,0.002408401,0.008091282,0.001895552,0.0001081804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.239457,0.00001104736,0.7597823,0.00009270703,0.0001888965,0.00009531406,0.000002358485,0.00002078653,0.0003495915],"genre_scores_gemma":[0.9944777,0.000005521827,0.005318783,0.0001540951,0.0000217359,0.000003432379,0.000009350582,0.000001787696,0.000007586715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.973929,"threshold_uncertainty_score":0.1596649,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4211050463","doi":"10.1016/j.ic.2008.03.005","title":"Synchronization","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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":"Synchronizing; Synchronization (alternating current); Computer science; Automaton; Coding (social sciences); Conjecture; Sequence (biology); Connection (principal bundle); Theoretical computer science; Mathematics; Discrete mathematics; Computer network; Telecommunications; Transmission (telecommunications)","authors":[{"name":"Helmut Jürgensen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009007121495195454,"gpt":0.2116909079881659,"spread":0.2026837864929704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000709567,0.00004297215,0.00003987889,0.00007647437,0.0001358385,0.0000800368,0.00007944115,0.00002110053,0.00000389681],"category_scores_gemma":[0.00001041635,0.00004067395,0.000009710167,0.0001521465,0.00001776179,0.002160342,0.00003496126,0.00002597061,0.00007742059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001155654,"about_ca_system_score_gemma":0.00002084025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000461374,"about_ca_topic_score_gemma":1.443088e-7,"domain_scores_codex":[0.9996378,0.00001332351,0.0001344444,0.00005163069,0.0001024416,0.00006030907],"domain_scores_gemma":[0.9997713,0.00002014652,0.00006016732,0.00006532182,0.00005512308,0.00002792667],"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.00000232545,0.0000122659,0.0004986495,0.00001478832,0.000004387151,0.000001547303,0.003817841,0.002966474,0.00001902098,0.157667,0.001666198,0.8333294],"study_design_scores_gemma":[0.0002169326,0.00002204069,0.01126312,0.000004666063,7.143555e-7,0.00008072636,0.00004143987,0.979526,0.00008626642,0.00566923,0.003015554,0.00007327765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05432789,0.00002666892,0.9428116,0.0002482077,0.00009732231,0.00005058009,3.95362e-7,0.0001800519,0.002257284],"genre_scores_gemma":[0.9841419,0.00002596928,0.01515825,0.000624032,0.00001320836,0.00000288501,0.00001787277,0.000001135453,0.00001473757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9765596,"threshold_uncertainty_score":0.1658636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964481900","doi":"10.1016/j.ic.2006.01.004","title":"Aperiodic propagation criteria for Boolean functions","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Aperiodic graph; Computer science; Boolean function; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics","authors":[{"name":"Lars Eirik Danielsen","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Matthew G. Parker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01123016333092186,"gpt":0.2428316702034836,"spread":0.2316015068725618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001731448,0.00006309658,0.0000525738,0.0001439624,0.0002455474,0.0003553644,0.00007450543,0.00002862634,0.000003909955],"category_scores_gemma":[0.000009995328,0.00006234157,0.00003070194,0.0001920462,0.00002012052,0.001678226,0.00002086186,0.00002839294,0.0000191086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001102062,"about_ca_system_score_gemma":0.00001727503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007105484,"about_ca_topic_score_gemma":0.000002033438,"domain_scores_codex":[0.9995262,0.00001815083,0.0002017129,0.00008100933,0.00008576674,0.00008712962],"domain_scores_gemma":[0.9996704,0.00003395581,0.00008784672,0.00007427566,0.0001102257,0.000023312],"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.00002384974,0.00002904018,0.0001427703,0.00005125389,0.000006262214,1.055558e-7,0.0008842872,0.001762671,0.0002668522,0.5119044,0.004523349,0.4804052],"study_design_scores_gemma":[0.000764064,0.0001654342,0.009868255,0.00001603663,0.000008707761,0.00001376391,0.0001585098,0.8396832,0.0002971475,0.1013083,0.04751707,0.0001994691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02992706,0.00001500884,0.9671438,0.0004529267,0.0002112346,0.0002112072,0.000005043632,0.0001574165,0.001876306],"genre_scores_gemma":[0.978618,0.000001081741,0.02083408,0.0002903211,0.00004933154,0.00004241848,0.0001311047,0.000002017357,0.00003169432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9486909,"threshold_uncertainty_score":0.3426787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156839950","doi":"10.1016/j.ic.2012.10.011","title":"Range majority in constant time and linear space","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Dalhousie University; University of Manitoba","funders":"","keywords":"Range (aeronautics); Range query (database); Linear space; Upper and lower bounds; Constant (computer programming); Logarithm; Mathematics; Space (punctuation); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Search engine; Sargable; Web search query; Information retrieval","authors":[{"name":"Stéphane Durocher","is_ca":true},{"name":"Meng He","is_ca":true},{"name":"J. Ian Munro","is_ca":true},{"name":"Patrick K. Nicholson","is_ca":true},{"name":"Matthew Skala","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01094876597766336,"gpt":0.2330161496424142,"spread":0.2220673836647509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003272599,0.00005068692,0.00007000796,0.00009084817,0.00005233555,0.00009938116,0.00003811276,0.00003505576,0.000004104179],"category_scores_gemma":[0.00001006571,0.00004665009,0.000008806982,0.0001197469,0.00001362424,0.001789684,0.00003307397,0.00005010038,0.00004822103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657744,"about_ca_system_score_gemma":0.000008674728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003207781,"about_ca_topic_score_gemma":0.000003728528,"domain_scores_codex":[0.9995505,0.00003620268,0.0001856185,0.00004777452,0.00008076816,0.00009917706],"domain_scores_gemma":[0.9997572,0.00003870626,0.00006823255,0.00004719709,0.00004239101,0.0000462345],"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.00005812426,0.0001153027,0.03417674,0.0001513482,0.00002471667,0.000003166314,0.05296373,0.007645909,0.0001060607,0.5613981,0.004213701,0.339143],"study_design_scores_gemma":[0.0004229312,0.00002977468,0.01406134,0.00001955467,9.656824e-7,0.00004535645,0.0001666134,0.9797698,0.00001682081,0.0004565587,0.004922116,0.00008818291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2503062,0.0001397185,0.7433491,0.0004679605,0.0003320158,0.000160478,0.00000143027,0.00006925565,0.005173821],"genre_scores_gemma":[0.9967135,0.000008853742,0.00295347,0.0002678416,0.00002773525,0.000003302927,0.000004267754,0.000001070084,0.00001998738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9721239,"threshold_uncertainty_score":0.1902335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045841926","doi":"10.1016/s0890-5401(03)00017-8","title":"Incremental recomputation in local languages","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":21,"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":"Recursion (computer science); Computer science; Transitive closure; Closure (psychology); Property (philosophy); Impossibility; Locality; Relation (database); SQL; Transitive relation; Theoretical computer science; Aggregate (composite); Programming language; Mathematics; Discrete mathematics; Linguistics; Database; Combinatorics","authors":[{"name":"Guozhu Dong","is_ca":false},{"name":"Leonid Libkin","is_ca":true},{"name":"Limsoon Wong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008492860012480948,"gpt":0.2587277269577096,"spread":0.2502348669452286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000192935,0.00005893694,0.00006307965,0.0001277822,0.00005298298,0.0000605971,0.00003915721,0.000023262,0.000003162208],"category_scores_gemma":[0.00002106161,0.0000575604,0.000009153223,0.0001885383,0.00001562111,0.002406141,0.00002361472,0.0000436868,0.00002583018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003233625,"about_ca_system_score_gemma":0.00002254598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004496692,"about_ca_topic_score_gemma":0.00001887308,"domain_scores_codex":[0.9994606,0.00004464159,0.0002268366,0.00007660257,0.0001070282,0.00008428453],"domain_scores_gemma":[0.9997681,0.00002847517,0.00007751732,0.00006069462,0.00003698679,0.00002817977],"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.000003473123,0.00001249015,0.0007527237,0.0000256422,0.000002411062,0.000001672777,0.002026436,0.01101065,0.00002263453,0.4467097,0.0001204795,0.5393118],"study_design_scores_gemma":[0.002255371,0.0001436346,0.02974861,0.00008793638,0.000002875832,0.0001272025,0.006265996,0.9002379,0.001493132,0.00971283,0.04943354,0.0004910015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03604937,0.00004319515,0.9608672,0.00007596471,0.00009309392,0.0001001938,0.00000170013,0.00005896552,0.002710278],"genre_scores_gemma":[0.9238278,0.000007640212,0.07588348,0.000231924,0.000005057846,0.000007363965,0.00003014285,0.000001416354,0.000005183328],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8892272,"threshold_uncertainty_score":0.2347245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2676854164","doi":"10.1016/j.ic.2010.11.009","title":"Decision problems for convex languages","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":20,"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":"Prefix; Suffix; Regular language; Mathematics; Computer science; Combinatorics; Abstract family of languages; Time complexity; Discrete mathematics; Linguistics; Automaton; Artificial intelligence; Programming language","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Zhi Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006772956264340065,"gpt":0.2565013127934235,"spread":0.2497283565290834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002048718,0.00004939157,0.00005160111,0.00007274916,0.00008649929,0.0002289663,0.0001143628,0.00003600126,0.000003977842],"category_scores_gemma":[0.00003582345,0.00004236569,0.00001635329,0.00007808711,0.00001383323,0.001324215,0.00003516639,0.00004662937,0.00002428946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003467698,"about_ca_system_score_gemma":0.00001379405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004335298,"about_ca_topic_score_gemma":0.00000284634,"domain_scores_codex":[0.999617,0.000005553499,0.0001535299,0.00006397969,0.0000871492,0.00007283559],"domain_scores_gemma":[0.9996266,0.0001067711,0.00007344624,0.00008370013,0.00007717016,0.00003225798],"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.000002819205,0.000005605394,0.00004329375,0.00001616773,0.00000184323,6.431902e-8,0.0009505085,0.0002463158,0.0002980219,0.1360325,0.0005886855,0.8618141],"study_design_scores_gemma":[0.000507172,0.00004426877,0.003342766,0.00001083437,0.000001677509,0.00001471198,0.0001143039,0.9255173,0.0005019735,0.04896327,0.02088394,0.00009784364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1003275,0.0000133517,0.8981115,0.0002652054,0.0002650487,0.0001597946,0.000002218439,0.0001251206,0.0007302093],"genre_scores_gemma":[0.9066108,0.000003312012,0.09275766,0.0005450576,0.00002570135,0.00001719885,0.00002564306,0.00000176484,0.00001284265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9252709,"threshold_uncertainty_score":0.2207927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973682419","doi":"10.1016/j.ic.2004.04.001","title":"The query complexity of order-finding","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"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":"Bounded function; Permutation (music); Constant (computer programming); Order (exchange); Mathematics; Combinatorics; Exponential function; Probabilistic logic; Time complexity; Polynomial; Discrete mathematics; Computer science; Statistics","authors":[{"name":"Richard Cleve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01917764641239443,"gpt":0.2557719705680923,"spread":0.2365943241556978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002048278,0.00005697431,0.00006213435,0.00006063945,0.0002791658,0.0001672902,0.0001671593,0.00002063363,2.801212e-7],"category_scores_gemma":[0.00002631343,0.00004065846,0.00001871938,0.0002443521,0.0000754366,0.0005040687,0.00007888261,0.00006751547,0.000005769911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001296865,"about_ca_system_score_gemma":0.00004700535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003642106,"about_ca_topic_score_gemma":0.000004336514,"domain_scores_codex":[0.9994447,0.00001993542,0.0002322931,0.00005801541,0.0001511822,0.0000938868],"domain_scores_gemma":[0.999559,0.00006279893,0.0001489002,0.00009440036,0.0001074545,0.00002745206],"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.000003600751,0.00001006373,0.00005344177,0.00001885045,0.000005969725,2.462811e-7,0.003021696,0.1143641,0.00001800952,0.391871,0.00003659794,0.4905964],"study_design_scores_gemma":[0.0003551045,0.000051327,0.007423207,0.00002158448,0.000001270307,0.00001896094,0.0001194168,0.9135114,0.0002232597,0.07713838,0.001063834,0.00007228493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1341272,0.00003148287,0.863745,0.001358589,0.0001511399,0.00006989025,7.642153e-7,0.00006307263,0.0004527815],"genre_scores_gemma":[0.939118,0.000009201936,0.06066627,0.0001828195,0.00001434828,0.00000151083,0.000004677435,0.000001233324,0.000001884339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8049908,"threshold_uncertainty_score":0.2147146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044973122","doi":"10.1016/j.ic.2013.02.001","title":"Worst-case optimal exploration of terrains with obstacles","year":2013,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":20,"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":"Terrain; Point (geometry); Artificial intelligence; Convex hull; Computer vision; Computer science; Robot; Mobile robot; Trajectory; Regular polygon; Algorithm; Mathematics; Geography; Geometry; Cartography","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"David Ilcinkas","is_ca":false},{"name":"Arnaud Labourel","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02538619896032181,"gpt":0.2494876185426832,"spread":0.2241014195823614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001042902,0.00006560151,0.00006952539,0.000153874,0.00008786787,0.0002595973,0.00007821161,0.00002696243,0.00001091248],"category_scores_gemma":[0.00001187175,0.00005370833,0.00001156333,0.0002443302,0.0000346402,0.007169622,0.00003737922,0.00004315644,0.00002955974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001048872,"about_ca_system_score_gemma":0.00003069963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004153767,"about_ca_topic_score_gemma":0.000003867526,"domain_scores_codex":[0.999404,0.00002400093,0.0002478946,0.00007181339,0.0001650988,0.00008716713],"domain_scores_gemma":[0.9994084,0.00003073727,0.0001413355,0.00008804868,0.0002766364,0.00005484736],"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.00001334971,0.00005386904,0.0001940765,0.00007964484,0.00001925194,0.000004596766,0.02314336,0.2444239,0.00005774885,0.08299247,0.0005137766,0.648504],"study_design_scores_gemma":[0.0004156322,0.0001228986,0.0006557199,0.00001447502,0.000001579512,0.00006845113,0.001000931,0.9954618,0.0001247048,0.001786116,0.0002650062,0.00008268454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04811142,0.000006401494,0.9499223,0.0005988821,0.00003060532,0.0002585533,9.713094e-7,0.00007443019,0.000996449],"genre_scores_gemma":[0.8524492,0.000006999014,0.1472884,0.0001877013,0.000005113147,0.00002375858,0.0000225274,0.000002012687,0.00001431328],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8043378,"threshold_uncertainty_score":0.5197803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2251394987","doi":"10.1016/j.ic.2016.01.005","title":"Topology recognition with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Advice (programming); Topology (electrical circuits); Oracle; Computer science; Node (physics); Network topology; Computation; Upper and lower bounds; Graph; Logical topology; Theoretical computer science; Mathematics; Computer network; Combinatorics; Algorithm","authors":[{"name":"Emanuele G. Fusco","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Rossella Petreschi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01577560285626095,"gpt":0.2353759725628819,"spread":0.2196003697066209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008637387,0.0000533784,0.00004845025,0.0001028692,0.00008787307,0.00008387669,0.00008488735,0.00002469148,0.00001009017],"category_scores_gemma":[0.000007978251,0.00003473516,0.000009918739,0.0001511512,0.0000381696,0.001943733,0.00003517844,0.00002686173,0.00007710772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001108978,"about_ca_system_score_gemma":0.00001767015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000103662,"about_ca_topic_score_gemma":0.000002768361,"domain_scores_codex":[0.9995899,0.00002031297,0.0001331257,0.00007477939,0.00009946284,0.00008246634],"domain_scores_gemma":[0.9996556,0.00006058232,0.00007480381,0.00007140196,0.0001033872,0.00003420074],"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.000006933299,0.000005433898,0.0000761485,0.000007742848,0.00000337913,3.56956e-7,0.0003689828,0.00001838727,0.000009212534,0.02540204,0.0001868717,0.9739145],"study_design_scores_gemma":[0.005704199,0.001204716,0.04646429,0.0003340522,0.00001894934,0.0005175377,0.0005402028,0.4828061,0.001530095,0.4060274,0.0538603,0.0009921432],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01603038,0.000007243103,0.9790093,0.002090652,0.0001020672,0.00006836609,0.000002247771,0.0001803741,0.002509377],"genre_scores_gemma":[0.8855536,0.00001819177,0.1134843,0.0008533951,0.0000304176,0.00001215217,0.00001542108,0.00000203262,0.00003048121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9729224,"threshold_uncertainty_score":0.1416459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982678879","doi":"10.1016/j.ic.2008.06.007","title":"Detecting palindromes, patterns and borders in regular languages","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"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":"Palindrome; Word (group theory); Regular language; Automaton; Computer science; Combinatorics on words; Combinatorics; Matching (statistics); Mathematics; Artificial intelligence; Biology","authors":[{"name":"Terry Anderson","is_ca":true},{"name":"John A. Loftus","is_ca":false},{"name":"Narad Rampersad","is_ca":true},{"name":"Nicolae Sântean","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00515848780118209,"gpt":0.2469158703377372,"spread":0.2417573825365551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001642237,0.00005007991,0.00005421624,0.0001167298,0.00004715401,0.000162752,0.00005898596,0.00002586683,8.830173e-7],"category_scores_gemma":[0.00001293906,0.00004812648,0.000007050135,0.0001136259,0.000006634759,0.001115065,0.00002282675,0.00004331615,0.000002488974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008615622,"about_ca_system_score_gemma":0.000006949552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003095753,"about_ca_topic_score_gemma":0.000005855025,"domain_scores_codex":[0.9996168,0.00001940753,0.0001478215,0.00006532842,0.00007472703,0.00007593101],"domain_scores_gemma":[0.9998183,0.00002687176,0.00005858481,0.00005589919,0.0000166718,0.00002369797],"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.000001474139,0.000004214022,0.0009556061,0.00001027681,0.000001030185,0.000001350421,0.002562332,0.0003649391,0.00002308529,0.008036792,0.00001158957,0.9880273],"study_design_scores_gemma":[0.0005892296,0.00007536522,0.2671842,0.00005005446,0.000001475013,0.00004287302,0.001407256,0.7173878,0.0002325593,0.01258349,0.0003005915,0.0001450854],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6330258,0.00005914905,0.3660333,0.0004591754,0.00002415693,0.00005448509,4.770146e-7,0.00006746837,0.0002760325],"genre_scores_gemma":[0.9948283,0.00001926642,0.004422457,0.0007118504,0.000006256937,0.000001345863,0.000007568108,8.864788e-7,0.000002108171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9878822,"threshold_uncertainty_score":0.1962541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077748761","doi":"10.1016/j.ic.2006.09.003","title":"Subword conditions and subword histories","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"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":"Decidability; Computer science; Automaton; Characterization (materials science); Sequence (biology); Word (group theory); Event (particle physics); Inference; Natural language processing; Artificial intelligence; Theoretical computer science; Linguistics","authors":[{"name":"Arto Salomaa","is_ca":false},{"name":"Sheng Yü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00459844806734157,"gpt":0.2073627092062013,"spread":0.2027642611388598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009932659,0.00006381014,0.0000613439,0.00009910224,0.0001621158,0.0002550544,0.00006644648,0.00002844499,0.000004050415],"category_scores_gemma":[0.000006790083,0.00006225923,0.00001157918,0.0001303168,0.00004071295,0.001883115,0.00004025365,0.00003651002,0.00001550243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000178908,"about_ca_system_score_gemma":0.00001898133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005390055,"about_ca_topic_score_gemma":0.000006986687,"domain_scores_codex":[0.9995475,0.00001646754,0.0001829474,0.00007281417,0.00009844534,0.00008180056],"domain_scores_gemma":[0.9997132,0.00004728041,0.00008422385,0.00006903197,0.00005646961,0.00002975091],"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.000002772403,0.00001120596,0.0006813312,0.00001977671,0.000003121689,6.465817e-7,0.001110862,0.0004646847,0.00004477978,0.8845879,0.002536305,0.1105366],"study_design_scores_gemma":[0.0009027613,0.00007960181,0.1322023,0.00002344692,0.000008877641,0.00008390478,0.0003502082,0.6078436,0.000266492,0.2035001,0.05438819,0.0003505062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2159851,0.0001116581,0.7782797,0.001124614,0.0002096779,0.00009528724,0.000004768408,0.0002311065,0.003958092],"genre_scores_gemma":[0.9932988,0.000008667033,0.006183512,0.0003754803,0.00002377234,0.000006265742,0.00006059224,0.000001658478,0.00004128394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7773136,"threshold_uncertainty_score":0.2538858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044323336","doi":"10.1006/inco.2001.3035","title":"An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types","year":2001,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Decidability; Channel (broadcasting); Computer science; Syntax; Substitution (logic); Expression (computer science); Class (philosophy); Code (set theory); Bounded function; Type (biology); Error detection and correction; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Programming language; Artificial intelligence","authors":[{"name":"Stavros Konstantinidis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02471510570129745,"gpt":0.2725282171927089,"spread":0.2478131114914114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009941671,0.00005427754,0.00007344374,0.00004318202,0.0000396262,0.0000154509,0.00005338715,0.00005476069,0.000003851068],"category_scores_gemma":[0.00001677228,0.00004486104,0.00002427302,0.00006961235,0.00004264771,0.0000306293,0.00002713038,0.00002405037,0.000001409148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002304747,"about_ca_system_score_gemma":0.00001161434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000111407,"about_ca_topic_score_gemma":0.000007194561,"domain_scores_codex":[0.9996148,0.00001955595,0.000179841,0.00005884664,0.00006792807,0.00005906945],"domain_scores_gemma":[0.9996582,0.00000991284,0.0001416713,0.00005956669,0.0001051749,0.00002545604],"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.0005530677,0.0007013708,0.1350477,0.0003386368,0.0001998832,0.000001153146,0.003460127,0.03258987,0.1163099,0.0294122,0.0005457572,0.6808403],"study_design_scores_gemma":[0.005105743,0.004155647,0.3755562,0.0001401385,0.00007749389,0.00003910141,0.00245428,0.4623195,0.121964,0.01987944,0.007493447,0.0008149635],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9180512,0.00005201935,0.08112855,0.00005759553,0.00005111937,0.00008546791,0.000006018901,0.000008318611,0.0005596722],"genre_scores_gemma":[0.9989186,0.0000245836,0.0006092018,0.0001018753,0.00001831806,0.000002221998,0.0003176948,0.000001856351,0.000005670253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6800253,"threshold_uncertainty_score":0.182938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005831808","doi":"10.1016/j.ic.2010.08.001","title":"On the consistency, expressiveness, and precision of partial modeling formalisms","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"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":"Rotation formalisms in three dimensions; Computer science; Consistency (knowledge bases); Model checking; Theoretical computer science; Logical consequence; Transition system; Succinctness; Expressive power; Class (philosophy); Interpretation (philosophy); Algorithm; Programming language; Mathematics; Artificial intelligence","authors":[{"name":"Ou Wei","is_ca":true},{"name":"Arie Gurfinkel","is_ca":false},{"name":"Marsha Chećhik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02899987138335185,"gpt":0.2876211178933243,"spread":0.2586212465099725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005410069,0.00006214172,0.00006829044,0.00007249418,0.0001458024,0.0001273992,0.0001374551,0.00004576361,0.000002237219],"category_scores_gemma":[0.0001578756,0.00004437712,0.00001462778,0.0001028118,0.00005115329,0.001542635,0.00006747017,0.00009915181,0.000003748103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004046285,"about_ca_system_score_gemma":0.00002267233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008874968,"about_ca_topic_score_gemma":6.229271e-7,"domain_scores_codex":[0.9993531,0.00004573226,0.0002802531,0.00007365595,0.000178019,0.0000692532],"domain_scores_gemma":[0.9993702,0.0001424997,0.0001735402,0.0001518361,0.0001336277,0.00002830158],"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.00001723029,0.000009422106,0.00003789757,0.00001950792,0.00000293187,4.757626e-8,0.002195778,0.01089588,0.0005689113,0.7812561,0.00002556859,0.2049707],"study_design_scores_gemma":[0.0001673984,0.00004200767,0.0007460368,0.00001598462,0.000001939819,0.000007171629,0.00009451646,0.9763339,0.002954808,0.01941651,0.0001667604,0.00005293264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3664748,0.000005952921,0.6325755,0.0001428096,0.0001466768,0.0001076383,9.41413e-7,0.00002256883,0.0005231858],"genre_scores_gemma":[0.9152921,0.000008040694,0.08450019,0.0001723632,0.00000911187,0.00001127041,0.000004428331,0.000001417225,0.000001103764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9654381,"threshold_uncertainty_score":0.1809646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140884424","doi":"10.1016/j.ic.2011.08.001","title":"Modelling concurrency with comtraces and generalized comtraces","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Concurrency; Algebraic number; Mathematics; Computer science; Algebra over a field; Order (exchange); Pure mathematics; Programming language; Mathematical analysis","authors":[{"name":"Ryszard Janicki","is_ca":true},{"name":"Dai Le","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03306504258878173,"gpt":0.2357557416152679,"spread":0.2026906990264862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009469156,0.00008034357,0.0000895392,0.00006654457,0.000131512,0.00008971799,0.00005349836,0.0000218209,0.000002169217],"category_scores_gemma":[0.000002555794,0.00006305343,0.000007058256,0.00009212851,0.00004365192,0.003189106,0.0000366705,0.00004223802,0.000004838817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004701959,"about_ca_system_score_gemma":0.00001641021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009164448,"about_ca_topic_score_gemma":0.000005499593,"domain_scores_codex":[0.9995025,0.00001964722,0.0001979928,0.00008941994,0.0001064289,0.00008395679],"domain_scores_gemma":[0.9996411,0.00002073021,0.0001301306,0.00007573687,0.00008524064,0.00004708106],"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.0000347102,0.0000202046,0.0008787154,0.0001066329,0.00001853954,0.000001928294,0.01828401,0.02792094,0.00001146542,0.760306,0.00009828396,0.1923186],"study_design_scores_gemma":[0.0004626864,0.00007638219,0.0007480636,0.00002935518,0.000003357812,0.0000333647,0.0003783658,0.992198,0.0001120486,0.001843974,0.003986885,0.0001275121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0986279,0.0001524604,0.899969,0.00004444701,0.00006037797,0.0001053159,0.000004363691,0.00008073826,0.0009553489],"genre_scores_gemma":[0.7530189,0.00006535174,0.2467655,0.0001043964,0.000007534614,0.000007921097,0.00002207682,0.000001816718,0.0000064848],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9642771,"threshold_uncertainty_score":0.2571244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046619512","doi":"10.1016/j.ic.2004.07.003","title":"Towards an algebraic theory of information integration","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Algebraic number; Algebra over a field; Algebraic theory; Theoretical computer science; Calculus (dental); Mathematics; Pure mathematics","authors":[{"name":"Gösta Grahne","is_ca":true},{"name":"Victoria Kiricenko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01085730189325719,"gpt":0.2494684579497865,"spread":0.2386111560565293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002884147,0.00007871263,0.00008936888,0.0001821189,0.00008330266,0.00009928387,0.00009549607,0.00003809036,0.000002211229],"category_scores_gemma":[0.00004372207,0.00006903896,0.00001825876,0.0002143818,0.00003186855,0.01422773,0.00004379141,0.00004836173,0.00001934882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002820493,"about_ca_system_score_gemma":0.00006988736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000511865,"about_ca_topic_score_gemma":0.000005271112,"domain_scores_codex":[0.9992573,0.00003253709,0.0003890486,0.00005871406,0.0001850203,0.00007734182],"domain_scores_gemma":[0.9993525,0.00001718991,0.0002491526,0.0001325808,0.0002038767,0.00004474513],"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.000005865151,0.000005381304,0.000004208564,0.00001639665,0.000001860281,4.154451e-8,0.003837076,0.002922831,0.00002658513,0.615231,0.00000604028,0.3779427],"study_design_scores_gemma":[0.003716222,0.0009570335,0.02448062,0.0002501706,0.00001806399,0.0001042383,0.008653526,0.3619077,0.01392197,0.5706593,0.01455481,0.0007763006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02988238,0.00001464622,0.9683248,0.0001344743,0.0001383009,0.0001444484,0.000009758503,0.00009963128,0.001251608],"genre_scores_gemma":[0.8625323,0.000009964051,0.1369183,0.000304759,0.00001159122,0.000008838691,0.0002112204,0.000001444074,0.000001589229],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8326499,"threshold_uncertainty_score":0.9995598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068619585","doi":"10.1016/j.ic.2010.09.009","title":"A categorical outlook on relational modalities and simulations","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; University of Ottawa","funders":"","keywords":"Categorical variable; Modal; Predicate (mathematical logic); Mathematics; Computer science; Similarity (geometry); Algebra over a field; Pure mathematics; Artificial intelligence; Image (mathematics)","authors":[{"name":"Claudio Hermida","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04959146735645973,"gpt":0.2518377819830844,"spread":0.2022463146266247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001030526,0.00006420706,0.00006078439,0.0001060692,0.0001377942,0.0001261036,0.00005449789,0.00004168123,0.000005133608],"category_scores_gemma":[0.00001704174,0.00005581825,0.00001258242,0.00009766247,0.0000257106,0.001183304,0.00003265489,0.00004941947,0.00003767101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001448558,"about_ca_system_score_gemma":0.00002056342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003879243,"about_ca_topic_score_gemma":0.000002638033,"domain_scores_codex":[0.999482,0.00002584333,0.0001969271,0.0000812612,0.0001362245,0.00007773619],"domain_scores_gemma":[0.999674,0.00004959309,0.00008615257,0.00006586246,0.00007868426,0.00004566753],"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.000003921772,0.00001094612,0.0009295166,0.00000875466,0.00000428241,2.76906e-7,0.006096377,0.0008080286,5.349949e-7,0.9514445,0.00005932558,0.04063356],"study_design_scores_gemma":[0.0004119938,0.0001285881,0.02814616,0.000002300118,0.000003820546,0.00002018792,0.0002447021,0.7546384,0.00001860546,0.212592,0.003660356,0.0001329467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01885389,0.00002047851,0.9697171,0.0001528925,0.0001377012,0.0001300662,8.166933e-7,0.0001070573,0.01087993],"genre_scores_gemma":[0.9953134,0.000002803206,0.004346086,0.0002389515,0.00001813257,0.000006355723,0.00002115065,0.000001552578,0.00005155145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9764595,"threshold_uncertainty_score":0.2276202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138395462","doi":"10.1016/j.ic.2006.02.004","title":"Mind change efficient learning","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Class (philosophy); Order (exchange); Set (abstract data type); Computer science; Point (geometry); Property (philosophy); Artificial intelligence; Mathematics; Theoretical computer science; Epistemology; Pure mathematics","authors":[{"name":"Wei Luo","is_ca":true},{"name":"Oliver Schulte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009672202445510066,"gpt":0.236707604461616,"spread":0.227035402016106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001393435,0.00005397979,0.00004631152,0.0001034646,0.0001352686,0.0002131796,0.00006503161,0.00002231269,0.000003429968],"category_scores_gemma":[0.000008720217,0.00005052425,0.00001351023,0.0001520121,0.000009316968,0.0006139943,0.00003717333,0.00007445907,0.00008144602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009894669,"about_ca_system_score_gemma":0.000007606332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007052625,"about_ca_topic_score_gemma":6.140019e-7,"domain_scores_codex":[0.9995428,0.00002534081,0.0001460625,0.00006702237,0.000131974,0.00008682544],"domain_scores_gemma":[0.9997755,0.00002288431,0.0000866288,0.00004364007,0.00004756527,0.00002374774],"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":[9.910004e-7,0.000008915667,0.000574282,0.00000833326,0.00000112831,4.213449e-7,0.001437597,0.08523058,0.000004781299,0.01237302,0.0000839677,0.900276],"study_design_scores_gemma":[0.0001796715,0.00002576087,0.01985414,0.000005989359,8.627991e-7,0.000008760415,0.00003686871,0.9670899,0.00002238568,0.0003306798,0.01238009,0.00006487846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1048938,0.00003046834,0.8909437,0.0004662481,0.0001243652,0.00006755405,2.739921e-7,0.0001040068,0.003369583],"genre_scores_gemma":[0.9855168,0.00000164791,0.01417616,0.0001600163,0.00005944032,0.000005435486,0.00002551113,0.000001395098,0.00005352554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9002111,"threshold_uncertainty_score":0.2060319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2190677066","doi":"10.1016/j.ic.2016.12.009","title":"Modeling concurrency with interval traces","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; Interval (graph theory); Programming language; Distributed computing; Theoretical computer science; Parallel computing; Mathematics; Combinatorics","authors":[{"name":"Ryszard Janicki","is_ca":false},{"name":"Xiang Yin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03399494561031575,"gpt":0.2859312596665989,"spread":0.2519363140562832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001892892,0.00007099854,0.0000802232,0.00008059879,0.0003387008,0.001014949,0.0003044356,0.00002713484,7.388855e-7],"category_scores_gemma":[0.00001985006,0.00005925255,0.00001278737,0.00004451995,0.00002217335,0.004906922,0.00008924445,0.00005749544,0.00001655898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001538717,"about_ca_system_score_gemma":0.00003136464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003132712,"about_ca_topic_score_gemma":0.00000505654,"domain_scores_codex":[0.9994096,0.00001396132,0.0002198417,0.00009001444,0.0001760687,0.00009056748],"domain_scores_gemma":[0.9994503,0.00001396762,0.0001695495,0.0001942745,0.000132431,0.0000394522],"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.000009398315,0.000008067144,0.000394574,0.00004359923,0.00001036146,0.000001066337,0.004722738,0.2252824,0.000005992782,0.02537107,0.00004409376,0.7441066],"study_design_scores_gemma":[0.0003365338,0.00003494179,0.000522248,0.00004866436,0.000001862312,0.00002155785,0.0001305985,0.9977042,0.00001669249,0.0009391211,0.0001580844,0.00008550141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1350732,0.00002692045,0.8615582,0.0002456038,0.0001800078,0.00007539269,7.011628e-7,0.00008225984,0.002757746],"genre_scores_gemma":[0.9739371,0.000006873061,0.02593105,0.00008837308,0.00001938085,0.000005423224,0.000004261753,0.000001721859,0.000005836318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8388639,"threshold_uncertainty_score":0.978718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119265231","doi":"10.1016/j.ic.2021.104686","title":"Descriptional Complexity of Formal Systems (DCFS 2019)","year":2021,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Modulo; Alphabet; Congruence (geometry); Computer science; Arithmetic; Mathematics; Combinatorics; Discrete mathematics; Linguistics; Philosophy","authors":[{"name":"Galina Jirásková","is_ca":false},{"name":"Stavros Konstantinidis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02873548115125589,"gpt":0.242582396896716,"spread":0.2138469157454602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001967022,0.00005698445,0.00009101597,0.00007172174,0.00008307779,0.0001686872,0.0001002668,0.00003031483,0.000006306862],"category_scores_gemma":[0.00001379461,0.00005553911,0.00002398358,0.0001652602,0.00003975134,0.002451257,0.00008639615,0.00003980199,0.00002175258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000139149,"about_ca_system_score_gemma":0.00005318229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001996036,"about_ca_topic_score_gemma":8.358595e-7,"domain_scores_codex":[0.9993306,0.00003580404,0.0002913591,0.00006626989,0.0001845329,0.00009138394],"domain_scores_gemma":[0.9994745,0.00003408799,0.0001453518,0.00009613202,0.00021417,0.00003577615],"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.00000541961,0.00001577135,0.0001158359,0.00006247738,0.00000931669,7.476611e-7,0.0009115541,0.003654013,0.0001386251,0.8931116,0.0006019506,0.1013727],"study_design_scores_gemma":[0.0003712515,0.00003687431,0.01400261,0.00002782341,0.000002765861,0.00007457559,0.0003027425,0.9653954,0.0004235306,0.01671619,0.002555267,0.0000910036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06538472,0.0001368601,0.9322047,0.0002462926,0.0002915382,0.00006274419,0.000009704062,0.00006717021,0.001596305],"genre_scores_gemma":[0.9832836,0.00001281245,0.01635524,0.0002054238,0.0000212517,0.000002976535,0.00009855746,0.000001313222,0.00001875665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9617413,"threshold_uncertainty_score":0.2264819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972446935","doi":"10.1006/inco.2001.3044","title":"Quorum Systems Constructed from Combinatorial Designs","year":2001,"lang":"en","type":"article","venue":"Information and Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"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":"Army Research Office; Beijing Institute For Brain Disorders","keywords":"Combinatorial design; Rank (graph theory); Intersection (aeronautics); Computer science; Quorum sensing; Consistency (knowledge bases); Set (abstract data type); Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics","authors":[{"name":"Charles J. Colbourn","is_ca":false},{"name":"Jeffrey H. Dinitz","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009540108577223393,"gpt":0.1934806634987374,"spread":0.183940554921514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008054452,0.00007075266,0.00008465144,0.00007182396,0.00006175583,0.0001184216,0.00003144607,0.00005495799,0.00001106494],"category_scores_gemma":[0.000005197837,0.00007236569,0.00001381024,0.0001063048,0.00001581164,0.0005497597,0.000004932786,0.00004788757,0.00005925633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001601387,"about_ca_system_score_gemma":0.000006153581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004950764,"about_ca_topic_score_gemma":0.000001069191,"domain_scores_codex":[0.9995362,0.00002785452,0.0002307364,0.0000365277,0.00008844034,0.00008020852],"domain_scores_gemma":[0.9997895,0.0000390528,0.00004347122,0.0000445738,0.00004367367,0.00003971844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002058294,0.00004706842,0.02315132,0.0004185597,0.0002996432,0.000009391198,0.01120528,0.4783415,0.001718757,0.3077328,0.01032813,0.1665416],"study_design_scores_gemma":[0.00146201,0.00003873964,0.007644311,0.00005488894,0.00001453587,0.00004248131,0.002440045,0.9646774,0.0001544184,0.009472918,0.01374805,0.0002502275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8059545,0.00009641449,0.1855728,0.00001051867,0.001857624,0.0001603134,0.0000124925,0.0003151658,0.006020214],"genre_scores_gemma":[0.9996876,0.00001168583,0.00009739483,0.00001847743,0.00005589267,0.000008917664,0.0001120769,0.00000407367,0.000003936956],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4863358,"threshold_uncertainty_score":0.2950987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973178331","doi":"10.1016/j.ic.2009.02.009","title":"Minimality in template-guided recombination","year":2009,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Template; Equivalence (formal languages); Decidability; Computer science; Formal language; Set (abstract data type); Closure (psychology); Programming language; Theoretical computer science; Mathematics; Discrete mathematics","authors":[{"name":"Michael Domaratzki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01921337157983488,"gpt":0.2894134458350616,"spread":0.2702000742552267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001635222,0.00004883139,0.00004748461,0.00004268034,0.00003497872,0.00003251618,0.00002895022,0.00005922614,0.000001910433],"category_scores_gemma":[0.0000374208,0.00004415934,0.00001344707,0.00006705123,0.000009311256,0.00002016453,0.00001312303,0.00003165104,0.000005130892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006945578,"about_ca_system_score_gemma":0.000008945065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005341134,"about_ca_topic_score_gemma":0.000002013237,"domain_scores_codex":[0.9996019,0.0000248468,0.000191242,0.00006803192,0.00004558609,0.0000684086],"domain_scores_gemma":[0.9998366,0.000005670386,0.00006099344,0.00003308904,0.00004342589,0.00002024629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001066657,0.00008190129,0.01332717,0.00002193382,0.000006549889,7.548784e-7,0.0003690805,0.002350851,0.02160539,0.002228828,0.001672211,0.9582286],"study_design_scores_gemma":[0.001788914,0.0007391438,0.923298,0.00002452708,0.000003879256,0.00002515619,0.0002008504,0.04722987,0.00797818,0.006744173,0.01165866,0.000308654],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9837049,0.00002093591,0.0123765,0.0002963717,0.00004073517,0.00008434304,8.819653e-7,0.00001347726,0.003461877],"genre_scores_gemma":[0.9981055,0.00001310375,0.0009334941,0.0007380556,0.00001814484,0.00000145745,0.0001779083,7.891142e-7,0.00001159649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.95792,"threshold_uncertainty_score":0.1800766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2258074816","doi":"10.1016/j.ic.2016.02.001","title":"Approximate matching between a context-free grammar and a finite-state automaton","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Edit distance; Affine transformation; Automaton; Deterministic finite automaton; Computer science; Deterministic automaton; Finite-state machine; Nondeterministic finite automaton; Context (archaeology); Matching (statistics); Context-free language; Grammar; Theoretical computer science; State (computer science); Büchi automaton; Time complexity; State diagram; Algorithm; Mathematics; Automata theory; Artificial intelligence; Rule-based machine translation; Pure mathematics","authors":[{"name":"Sang‐Ki Ko","is_ca":false},{"name":"Yo-Sub Han","is_ca":false},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01215280178887532,"gpt":0.2335999126059589,"spread":0.2214471108170836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002191668,0.000105284,0.0001152436,0.0001233845,0.000158348,0.0003544575,0.000208151,0.00003833848,0.000001750607],"category_scores_gemma":[0.00003665309,0.00007327677,0.00001604363,0.0001097954,0.00003245411,0.002956077,0.0003170592,0.00004902301,0.00002136535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001572726,"about_ca_system_score_gemma":0.00002040046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003854273,"about_ca_topic_score_gemma":0.000002242552,"domain_scores_codex":[0.999219,0.00003297569,0.0002910765,0.0001349069,0.0001819059,0.0001401358],"domain_scores_gemma":[0.9993379,0.0001667419,0.000164121,0.0001859951,0.00006176982,0.00008346703],"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.000004500151,0.000003965709,0.000242971,0.00002304385,0.000005346913,8.759428e-7,0.001495473,0.00007934416,0.00001273178,0.008895049,0.0002176755,0.989019],"study_design_scores_gemma":[0.001909168,0.00009486603,0.014313,0.0001438261,0.000006313908,0.00003353218,0.0001334004,0.8910925,0.0001699983,0.08409957,0.007712306,0.0002915381],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05918144,0.00003731483,0.9393523,0.000820134,0.0000746855,0.0001355088,0.00002401162,0.0002006573,0.0001739519],"genre_scores_gemma":[0.9619388,0.00003439943,0.03764168,0.0003084632,0.00001907734,0.000009205924,0.00002937712,0.000003627031,0.0000153476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9887275,"threshold_uncertainty_score":0.3418042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126472279","doi":"10.1016/j.ic.2007.06.002","title":"Some natural conditions on incremental learning","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"National University of Singapore","keywords":"Natural (archaeology); Computer science; Artificial intelligence; Geology","authors":[{"name":"Sanjay Jain","is_ca":false},{"name":"Steffen Lange","is_ca":false},{"name":"Sandra Zilles","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006486232717059994,"gpt":0.2678587035544024,"spread":0.2613724708373424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002663934,0.00005997188,0.00004663054,0.0001557752,0.00022421,0.000170735,0.00007410083,0.00002233766,0.000003060124],"category_scores_gemma":[0.00002571384,0.00005643554,0.00001600478,0.0001279578,0.00001392531,0.001373499,0.00003494434,0.0001564043,0.00008680779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002165286,"about_ca_system_score_gemma":0.00001026756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000125259,"about_ca_topic_score_gemma":6.863483e-7,"domain_scores_codex":[0.9994728,0.00002227697,0.0001682893,0.00006757806,0.000165134,0.0001039443],"domain_scores_gemma":[0.9997192,0.00006546977,0.00008750928,0.00004459924,0.00004191751,0.00004127976],"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.00001158184,0.00002462397,0.0007492849,0.00001542804,0.00001038869,0.000002340141,0.002728879,0.02248187,0.0001181538,0.2033758,0.000502119,0.7699795],"study_design_scores_gemma":[0.0004908369,0.0001227308,0.0439408,0.0000143371,0.000001590295,0.00002109912,0.0002247963,0.9476333,0.0002429411,0.002671472,0.004509069,0.0001270798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2627982,0.0000270334,0.7321746,0.0005910374,0.0004544833,0.00009384855,7.963179e-7,0.0002870847,0.003572953],"genre_scores_gemma":[0.9938484,0.000003294824,0.005047283,0.0009267452,0.00006124143,0.00000152667,0.00005915505,0.000001556201,0.00005074721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9251514,"threshold_uncertainty_score":0.2301375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573386179","doi":"10.1016/j.ic.2017.01.009","title":"Further remarks on DNA overlap assembly","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Western University; National Science Foundation","keywords":"Iterated function; Decidability; String (physics); Completeness (order theory); Computer science; Closure (psychology); Formal language; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","authors":[{"name":"Srujan Kumar Enaganti","is_ca":true},{"name":"Óscar H. Ibarra","is_ca":false},{"name":"Lila Kari","is_ca":true},{"name":"Steffen Kopecki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01262862507050131,"gpt":0.2728790361605946,"spread":0.2602504110900933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001077541,0.00006076632,0.00004803949,0.00001846527,0.0001943894,0.0001462201,0.00007119744,0.00006711173,0.000002889094],"category_scores_gemma":[0.00006446001,0.00004867746,0.00002261581,0.00001020331,0.0000264719,0.00002099521,0.00005153842,0.00003597949,0.00002470797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003701858,"about_ca_system_score_gemma":0.000008788605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004339878,"about_ca_topic_score_gemma":0.000001575177,"domain_scores_codex":[0.9996587,0.0000146287,0.0001155292,0.00007511138,0.00006247155,0.00007358057],"domain_scores_gemma":[0.9996895,0.000006915217,0.0001225051,0.0001065441,0.00004560208,0.00002899812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0002021302,0.00004640677,0.008143306,0.00003214716,0.00003563401,0.000001086682,0.0002637302,0.000955225,0.02586502,0.002744366,0.003004193,0.9587067],"study_design_scores_gemma":[0.003131704,0.001821271,0.7402784,0.00009330613,0.00002096554,0.00003472377,0.0005685471,0.05643503,0.03888333,0.002216372,0.155674,0.0008423748],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9661855,0.00001347443,0.01356567,0.0003267544,0.0001258826,0.00007561041,0.000002433916,0.00001382186,0.01969092],"genre_scores_gemma":[0.9985932,0.00001146638,0.0003746676,0.0007797052,0.0000779012,0.00000202987,0.0001019602,0.00000203047,0.00005711688],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9578644,"threshold_uncertainty_score":0.1985009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018650645","doi":"10.1016/j.ic.2011.01.001","title":"An extension of the Lyndon–Schützenberger result to pseudoperiodic words","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"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":"Extension (predicate logic); Computer science; Combinatorics; Linguistics; Mathematics; Mathematical economics; Philosophy; Programming language","authors":[{"name":"Elena Czeizler","is_ca":true},{"name":"Eugen Czeizler","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Shinnosuke Seki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0170449887814719,"gpt":0.2356523767588667,"spread":0.2186073879773948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573188,0.00006296927,0.00006841336,0.00008908699,0.0001048972,0.00008364008,0.0002611547,0.00002924533,0.000007868763],"category_scores_gemma":[0.00002176472,0.00004365206,0.00002183803,0.0002775222,0.00002512304,0.00144729,0.00009354176,0.00004130511,0.00002446662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008342722,"about_ca_system_score_gemma":0.0000232399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003134664,"about_ca_topic_score_gemma":0.000001899236,"domain_scores_codex":[0.9993752,0.00004421752,0.0002512665,0.00008636915,0.0001607524,0.00008225906],"domain_scores_gemma":[0.9994562,0.00001714665,0.0001231167,0.000244942,0.0001083932,0.00005025035],"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.00005349972,0.00007733053,0.0008508578,0.00003373178,0.00001030357,6.460807e-7,0.05608034,0.002373672,0.001847881,0.1009135,0.0012216,0.8365366],"study_design_scores_gemma":[0.0005295539,0.0002106324,0.2185878,0.00006304945,0.000006351608,0.00002593706,0.001050579,0.7626751,0.005699902,0.009500639,0.001437143,0.000213316],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5490991,0.000007378991,0.448903,0.0001630082,0.0001900698,0.0001159236,0.000001343049,0.00006130159,0.001458812],"genre_scores_gemma":[0.9821053,0.000002488653,0.0168313,0.001032771,0.00000954422,0.00000446631,0.000003889133,0.000001917724,0.000008364006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8363233,"threshold_uncertainty_score":0.1780079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1803135286","doi":"10.1016/j.ic.2016.06.007","title":"On the list update problem with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"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":"Villum Fonden","keywords":"Advice (programming); Computer science; Information retrieval; Programming language","authors":[{"name":"Joan Boyar","is_ca":false},{"name":"Shahin Kamali","is_ca":false},{"name":"Kim S. Larsen","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0087912005124182,"gpt":0.2228605443273354,"spread":0.2140693438149172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001979488,0.00005991457,0.00004046132,0.00006824936,0.0001473122,0.0002642948,0.0001446318,0.00001789012,0.00001903751],"category_scores_gemma":[0.00001593008,0.00002769104,0.00000865626,0.000189045,0.00003040292,0.001562938,0.00003871863,0.00003948593,0.0001392449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001432142,"about_ca_system_score_gemma":0.0000296112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000450366,"about_ca_topic_score_gemma":0.000002572656,"domain_scores_codex":[0.9994608,0.00003710336,0.0001425857,0.00007343006,0.0001936461,0.00009247762],"domain_scores_gemma":[0.9995334,0.0001010051,0.00008542682,0.0001081391,0.0001321356,0.00003991573],"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.00001401851,0.00001145179,0.00004939075,0.00000875754,0.000005863731,2.434383e-7,0.0008852858,0.004908631,0.000007054397,0.7381646,0.004184355,0.2517603],"study_design_scores_gemma":[0.001274266,0.0002823253,0.001180341,0.00009380623,0.000002639628,0.00001850686,0.00009470461,0.9195029,0.000149037,0.03374052,0.04344483,0.0002161866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002719291,0.000002720989,0.9711522,0.01587662,0.00003009124,0.0001905864,0.000001277342,0.0001439024,0.009883261],"genre_scores_gemma":[0.9647614,0.00002340049,0.02985641,0.005133352,0.00001016192,0.00002890518,0.000008973089,0.000003155946,0.0001741767],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9620422,"threshold_uncertainty_score":0.2548601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2944100452","doi":"10.1016/j.ic.2019.04.002","title":"Expressiveness of probabilistic modal logics: A gradual approach","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Agence Nationale de la Recherche; Alan Turing Institute","keywords":"Bisimulation; Mathematical proof; Probabilistic logic; Characterization (materials science); Computer science; Modal; Theoretical computer science; Modal logic; Mathematics; Discrete mathematics; Artificial intelligence","authors":[{"name":"Florence Clerc","is_ca":true},{"name":"Nathanaël Fijalkow","is_ca":false},{"name":"Bartek Klin","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02215723380333302,"gpt":0.2652920306553465,"spread":0.2431347968520134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961256,0.00006857622,0.0001002556,0.0001107932,0.00003656055,0.00008273175,0.0001820883,0.00004318769,0.000001836632],"category_scores_gemma":[0.00004048585,0.0000625274,0.0000196838,0.0002057847,0.0000295663,0.001928429,0.00006947169,0.00005234754,0.00002015253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001743278,"about_ca_system_score_gemma":0.0000317399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006338924,"about_ca_topic_score_gemma":5.33062e-8,"domain_scores_codex":[0.9992682,0.00005662141,0.0002978027,0.00009808905,0.0001976218,0.00008164158],"domain_scores_gemma":[0.9993884,0.00003909513,0.0002325588,0.0001542383,0.0001577215,0.00002799989],"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.00002398312,0.00005572321,0.0008224117,0.0003501252,0.000009116632,8.395182e-8,0.004954129,0.08880579,0.0002589426,0.6936319,0.00003471205,0.211053],"study_design_scores_gemma":[0.0002934735,0.00006826128,0.01091495,0.0000133879,0.000001960932,0.000008565894,0.0001590742,0.9789839,0.0004588423,0.008873766,0.0001428024,0.00008104673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.169068,0.000009821654,0.8275332,0.00002207982,0.000124283,0.0002465611,0.000001274372,0.000055041,0.002939685],"genre_scores_gemma":[0.7305338,0.000001935639,0.2693723,0.00004944666,0.00000523523,0.00001244294,0.00001765677,0.000001343963,0.000005805949],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8901781,"threshold_uncertainty_score":0.2549793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2568552169","doi":"10.1016/j.ic.2012.10.008","title":"Generic expression hardness results for primitive positive formula comparison","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Trichotomy (philosophy); Equivalence (formal languages); Mathematics; Expression (computer science); Discrete mathematics; Pure mathematics; Computer science","authors":[{"name":"Simone Bova","is_ca":false},{"name":"Hubie Chen","is_ca":false},{"name":"Matthew Valeriote","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02384311133039244,"gpt":0.2827658495853759,"spread":0.2589227382549834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003314857,0.00009782401,0.000110138,0.0001017192,0.000186458,0.0001828522,0.0001237015,0.00005080846,6.699823e-7],"category_scores_gemma":[0.00003707577,0.0000863871,0.00003125346,0.0001306334,0.00001767073,0.003647776,0.00007525578,0.00004708911,0.00001813925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003091144,"about_ca_system_score_gemma":0.00001800756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003880156,"about_ca_topic_score_gemma":1.973855e-7,"domain_scores_codex":[0.9992089,0.00003563255,0.0003257847,0.00009568906,0.0001494505,0.0001845451],"domain_scores_gemma":[0.9993392,0.0001201259,0.000227519,0.0001011958,0.0001338094,0.00007818916],"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.0001667506,0.0001237894,0.0003559604,0.00007804953,0.00002152106,1.829649e-7,0.03285618,0.002199232,0.001048633,0.1082338,0.008015941,0.8468999],"study_design_scores_gemma":[0.001517329,0.0001274746,0.02491079,0.0000508869,0.000008153359,0.00001304236,0.0008104132,0.9492148,0.01249052,0.002679567,0.007928288,0.0002487246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06290281,0.00006486051,0.9347371,0.0001932321,0.0003672738,0.0002927626,0.00002006964,0.000125999,0.001295864],"genre_scores_gemma":[0.950083,0.000004775802,0.04913126,0.0004777325,0.00005541067,0.00003066337,0.0001993688,0.000003027777,0.00001477339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9470156,"threshold_uncertainty_score":0.3522764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767753763","doi":"10.1016/j.ic.2017.11.001","title":"Handling infinitely branching well-structured transition systems","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Branching (polymer chemistry); Transition (genetics); Computer science; Theoretical computer science; Statistical physics; Biological system; Chemistry; Physics; Biology","authors":[{"name":"Michael Blondin","is_ca":true},{"name":"Alain Finkel","is_ca":false},{"name":"Pierre McKenzie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0246912400431496,"gpt":0.2898175308023667,"spread":0.2651262907592171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004579787,0.00009781541,0.0001046275,0.0001411948,0.0007025623,0.001682156,0.00030096,0.0000693198,0.000001396759],"category_scores_gemma":[0.00007472731,0.00009737728,0.00002429466,0.00007579689,0.00003725096,0.006507721,0.00005349318,0.00009994721,0.00003358075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002626796,"about_ca_system_score_gemma":0.000025317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005083345,"about_ca_topic_score_gemma":0.000001505817,"domain_scores_codex":[0.9991556,0.00005491671,0.0003413446,0.0001152908,0.0002126842,0.0001202124],"domain_scores_gemma":[0.9991142,0.00003176711,0.0003904047,0.0002768486,0.0001345184,0.00005224241],"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.00002490234,0.00001123943,0.0002496043,0.0001693438,0.00001753644,9.075675e-7,0.009574367,0.05540326,0.0002375733,0.2053894,0.0001194123,0.7288024],"study_design_scores_gemma":[0.0004140036,0.00002851557,0.01510261,0.00003928075,0.000003901421,0.00002649234,0.0001237621,0.9792852,0.0003434982,0.002658311,0.00184737,0.0001271014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0538359,0.0000293573,0.9418353,0.0002309712,0.0007815663,0.0001898212,0.000001941293,0.0001451521,0.002949936],"genre_scores_gemma":[0.8842379,0.00001347112,0.1154832,0.0001798408,0.00004591498,0.000009713644,0.00002128483,0.000002898559,0.000005696194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9238819,"threshold_uncertainty_score":0.9993542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1081471053","doi":"10.1016/j.ic.2017.09.002","title":"On the complexity and decidability of some problems involving shuffle","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Decidability; Combinatorics; Pushdown automaton; Discrete mathematics; Mathematics; Closure (psychology); Time complexity; Bounded function; Decision problem; Finite-state machine; Algorithm","authors":[{"name":"Joseph Eremondi","is_ca":false},{"name":"Óscar H. Ibarra","is_ca":false},{"name":"Ian McQuillan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04185534428189584,"gpt":0.2631921773337993,"spread":0.2213368330519034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004158218,0.00005167598,0.00006769312,0.00003490858,0.0003555002,0.0003492913,0.0002139822,0.0000208734,0.000002050717],"category_scores_gemma":[0.00009031818,0.00003581506,0.00001297519,0.00003025816,0.0001500959,0.001777563,0.0001377477,0.00004613544,0.000004374806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008142951,"about_ca_system_score_gemma":0.00001305182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004172675,"about_ca_topic_score_gemma":0.000003600874,"domain_scores_codex":[0.9995474,0.000030029,0.0001772922,0.00006649044,0.0001180304,0.00006077079],"domain_scores_gemma":[0.9993551,0.0001286566,0.0002190018,0.000217297,0.00005647665,0.00002351134],"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.000003266417,0.00001056714,0.0005937556,0.00003214375,0.000003258444,4.317162e-8,0.001717682,0.0002550382,0.00003105854,0.9221118,0.00007686875,0.07516451],"study_design_scores_gemma":[0.0001578217,0.00003438874,0.07885462,0.00002332062,0.000001039453,0.000001771306,0.0000743226,0.548423,0.0001572566,0.3721476,0.00008139492,0.00004350164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8176817,0.00003040041,0.1793655,0.001727515,0.00008238194,0.0001785771,0.000002326312,0.00004108577,0.0008904658],"genre_scores_gemma":[0.9975939,0.000009149767,0.001975805,0.0004041606,0.000006616274,0.000004692487,0.000002713879,9.301972e-7,0.000002081397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5499642,"threshold_uncertainty_score":0.3368224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3120287019","doi":"10.1016/j.ic.2021.104690","title":"Structural properties of NFAs and growth rates of nondeterminism measures","year":2021,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; String (physics); Computation; Nondeterministic algorithm; Combinatorics; Bounded function; Polynomial; Discrete mathematics; Bounding overwatch; Tree (set theory); GF(2); Exponential function; Path (computing); Nondeterministic finite automaton; Finite field; Automaton; Algorithm; Computer science; Automata theory; Theoretical computer science","authors":[{"name":"Casey Keeler","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02226572246815405,"gpt":0.2352410867577007,"spread":0.2129753642895467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008991336,0.00004449743,0.00008092971,0.00005342892,0.00003544297,0.00006547579,0.00005527895,0.00001968814,9.608128e-7],"category_scores_gemma":[0.00002519273,0.00003621963,0.00001209483,0.00008937315,0.00003842671,0.0009663024,0.00005369193,0.00002154782,5.516608e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002684814,"about_ca_system_score_gemma":0.00002876235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009862889,"about_ca_topic_score_gemma":7.842917e-7,"domain_scores_codex":[0.9995709,0.00002439471,0.0002053744,0.00004870979,0.0001077544,0.00004285804],"domain_scores_gemma":[0.9996096,0.00002153627,0.0001183783,0.00005269585,0.00018073,0.0000170857],"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.00002347774,0.00001946194,0.003315485,0.0005685399,0.00003527503,0.000001272045,0.02296382,0.0005984497,0.01539525,0.1541823,0.00005817452,0.8028384],"study_design_scores_gemma":[0.0006635013,0.0000765782,0.06232503,0.0001072649,0.00000780123,0.00006635104,0.001002773,0.7076394,0.2067153,0.02117545,0.0000673847,0.0001531786],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9068066,0.000195865,0.09257566,0.0001335935,0.0000560823,0.00004370903,0.000001444133,0.00001968612,0.0001673056],"genre_scores_gemma":[0.9955413,0.00002082676,0.004332119,0.0000914336,0.000004181451,0.000001162283,0.000004511795,9.207189e-7,0.000003500763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8026853,"threshold_uncertainty_score":0.1476994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108990830","doi":"10.1016/j.ic.2010.09.005","title":"Optimality and competitiveness of exploring polygons by mobile robots","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"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":"Polygon (computer graphics); Simple polygon; Mobile robot; Focus (optics); Robot; Trajectory; Computer science; Boundary (topology); Metric (unit); Square (algebra); Point (geometry); Convex polygon; Computer vision; Artificial intelligence; Algorithm; Mathematics; Regular polygon; Geometry; Engineering","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Arnaud Labourel","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01863673248393834,"gpt":0.2608629734210505,"spread":0.2422262409371122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001938507,0.00005498943,0.00007411581,0.00008222977,0.00008575377,0.0001360662,0.00008496087,0.00002786714,0.000009514292],"category_scores_gemma":[0.00001445937,0.00005429273,0.00001044234,0.0001367924,0.00004672993,0.002050376,0.00007058947,0.00007403917,0.000003647582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004243389,"about_ca_system_score_gemma":0.00002088583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002400656,"about_ca_topic_score_gemma":0.000002136951,"domain_scores_codex":[0.9994969,0.00002315059,0.0002038572,0.00007375902,0.0001257219,0.00007655099],"domain_scores_gemma":[0.9995978,0.00004833888,0.00009288069,0.00007424632,0.000128778,0.00005794855],"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.00001578651,0.00008867019,0.005527451,0.000169039,0.00001770053,4.023715e-7,0.008776342,0.06392559,0.002268106,0.1273828,0.0001425599,0.7916856],"study_design_scores_gemma":[0.0004871116,0.00007413991,0.01511791,0.00001426249,0.00000182184,0.000009573546,0.0002416765,0.9793395,0.001955971,0.0005413324,0.002101244,0.0001154176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2380356,0.00001463059,0.7608501,0.0001579902,0.00008917443,0.0001245813,0.000004515401,0.00004770486,0.0006757469],"genre_scores_gemma":[0.9599159,0.00004275713,0.0398753,0.00009446473,0.000005386328,0.00003113635,0.00002498324,0.000001620664,0.000008459363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.915414,"threshold_uncertainty_score":0.2213994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037750176","doi":"10.1016/j.ic.2012.07.001","title":"Automatic learning of subclasses of pattern languages","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Learnability; Class (philosophy); Alphabet; Computer science; Variable (mathematics); Abstract family of languages; Regular language; Constant (computer programming); Mathematics; Bounded function; Formal language; Discrete mathematics; Automaton; Artificial intelligence; Algorithm; Programming language; Second-generation programming language; Linguistics","authors":[{"name":"John Case","is_ca":false},{"name":"Sanjay Jain","is_ca":false},{"name":"Trong Dao Le","is_ca":false},{"name":"Yuh Shin Ong","is_ca":false},{"name":"Pavel Semukhin","is_ca":true},{"name":"Frank Stephan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007190676344356576,"gpt":0.2644436623241567,"spread":0.2572529859798002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817455,0.00003814705,0.00006855826,0.00008733814,0.00002910276,0.00002529945,0.00006010888,0.00001703488,0.000005587223],"category_scores_gemma":[0.00003209256,0.00003373878,0.00001413432,0.0001054036,0.00001161611,0.0008942756,0.00003178942,0.00004545912,0.00000728639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003483196,"about_ca_system_score_gemma":0.000008417868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003116252,"about_ca_topic_score_gemma":1.749183e-7,"domain_scores_codex":[0.9995746,0.00003473614,0.0001894174,0.00002601587,0.0001127517,0.00006248205],"domain_scores_gemma":[0.9996387,0.0000562102,0.0001884266,0.00004353917,0.00005028731,0.00002287302],"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":[4.087734e-7,0.00001088325,0.01728699,0.00008630528,0.000004329638,3.405763e-8,0.005248218,0.002086027,0.00003684556,0.002984634,0.00002136468,0.972234],"study_design_scores_gemma":[0.0001356738,0.00003877285,0.09130234,0.00002038582,0.000002207747,0.000004759366,0.0003475566,0.9072977,0.0004576152,0.00007834457,0.0002728584,0.00004181519],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3663206,0.00003893279,0.6328959,0.00005052954,0.00004393043,0.00002527769,3.043271e-7,0.0000417967,0.0005827904],"genre_scores_gemma":[0.9897208,0.000004234378,0.01020781,0.00003821256,0.00001132494,0.000001047257,0.000008281303,0.00000106629,0.000007216921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9721922,"threshold_uncertainty_score":0.1375827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087666725","doi":"10.1016/j.ic.2010.12.005","title":"A logical duality for underspecified probabilistic systems","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Probabilistic logic; Galois connection; Duality (order theory); Connection (principal bundle); Probabilistic automaton; Functor; Bisimulation; Mathematics; Automaton; Evidentiality; Simple (philosophy); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","authors":[{"name":"Josée Desharnais","is_ca":true},{"name":"François Laviolette","is_ca":true},{"name":"Amélie Turgeon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03267041144300124,"gpt":0.27589539379365,"spread":0.2432249823506487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003223182,0.0000731058,0.00008967915,0.00005703776,0.0001400673,0.000340344,0.0001209445,0.00005382047,0.000002187696],"category_scores_gemma":[0.0001155883,0.00005943388,0.00002589404,0.0001090156,0.00003314866,0.0008931205,0.00004162313,0.00007689473,0.00002872179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001697316,"about_ca_system_score_gemma":0.0000409848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000925142,"about_ca_topic_score_gemma":0.000007095441,"domain_scores_codex":[0.9994056,0.00002346071,0.000235912,0.0001059718,0.0001158601,0.0001132594],"domain_scores_gemma":[0.9993829,0.0001283034,0.0001162096,0.0001052205,0.0002067975,0.00006062961],"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.000006009935,0.0000180253,0.00008524159,0.00004985501,0.0000033264,1.169285e-7,0.001239096,0.0005305954,0.00001558776,0.968383,0.0005069797,0.02916219],"study_design_scores_gemma":[0.0005660416,0.00006993759,0.006167675,0.000006596268,0.000003629327,0.00002175843,0.0001725209,0.9391295,0.00001697349,0.03974667,0.01396867,0.0001300449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02777844,0.0000141009,0.9651117,0.0002753889,0.0006272004,0.0003706856,0.000002260692,0.0001476258,0.005672561],"genre_scores_gemma":[0.986733,0.000001727929,0.01296563,0.0001434344,0.00005956586,0.00003793764,0.0000247011,0.000001557038,0.00003246623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9589545,"threshold_uncertainty_score":0.3281945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170001390","doi":"10.1016/j.ic.2017.06.003","title":"Space proof complexity for random 3-CNFs","year":2017,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"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":"European Research Council; Seventh Framework Programme; Sapienza Università di Roma; European Commission; Simons Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Omega; Bipartite graph; Resolution (logic); Monomial; Upper and lower bounds; Discrete mathematics; Space (punctuation); Algebraic number; Disjoint sets; Physics; Computer science; Mathematical analysis; Graph","authors":[{"name":"Patrick Bennett","is_ca":false},{"name":"Ilario Bonacina","is_ca":false},{"name":"Nicola Galesi","is_ca":false},{"name":"Tony Huynh","is_ca":false},{"name":"Mike Molloy","is_ca":true},{"name":"Paul Wollan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03906740328881324,"gpt":0.295286773477019,"spread":0.2562193701882058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005214862,0.0001841064,0.0002513132,0.000140879,0.0003428609,0.001269537,0.0005292969,0.0001436062,0.00000235088],"category_scores_gemma":[0.00007702946,0.0001746421,0.00008516737,0.00004052464,0.00006751999,0.001530961,0.0005254883,0.000163946,0.00001547809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003485972,"about_ca_system_score_gemma":0.0001058614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003037359,"about_ca_topic_score_gemma":0.000003448019,"domain_scores_codex":[0.9990091,0.00004102015,0.0003742713,0.000209526,0.0002052771,0.0001607463],"domain_scores_gemma":[0.9985922,0.0001097954,0.0006089851,0.0003952439,0.0002278841,0.00006587199],"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.00007278367,0.00003530073,0.00003096724,0.0006938706,0.00004945533,6.49143e-7,0.004039366,0.009654651,0.000007857171,0.2912445,0.004980309,0.6891903],"study_design_scores_gemma":[0.001048985,0.00003011593,0.0007486832,0.00007353353,0.000008305564,0.000005946127,0.00003366458,0.7711185,0.0001069136,0.2201316,0.006506957,0.0001868186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004720277,0.000097183,0.9894484,0.001794393,0.0008071011,0.0008841465,0.00003635282,0.0002126804,0.001999526],"genre_scores_gemma":[0.8830544,0.00003391914,0.1153643,0.0006240198,0.000142145,0.0001671361,0.0005305177,0.000009183022,0.00007430369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8783342,"threshold_uncertainty_score":0.9997672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}