{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002310033,0.0009517315,0.001068799,0.002499811,0.002510147,0.007172164,0.002725904,0.003171517,0.01215095],"category_scores_gemma":[0.005285321,0.0008596564,0.001507901,0.003094226,0.01030194,0.01942824,0.003631198,0.004758609,0.001922341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003300817,"about_ca_system_score_gemma":0.002020009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003356108,"about_ca_topic_score_gemma":0.00240657,"domain_scores_codex":[0.9981217,0.0006615,0.000126525,0.0003660768,0.0005097784,0.0002144981],"domain_scores_gemma":[0.9976571,0.001105569,0.0001630143,0.0005679631,0.0003448972,0.0001614079],"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":[6.451368e-7,9.406489e-7,0.000006165401,0.000004526963,8.801969e-7,0.000004886578,0.00001585912,0.0001535543,0.00001906637,0.9991724,0.0002801484,0.0003408277],"study_design_scores_gemma":[0.000002122619,0.000001567326,0.00001240205,0.000006909486,0.000002032891,0.00002283433,0.00001584555,0.001513604,0.00002905193,0.9932582,0.005132161,0.000003209755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01404965,0.006369123,0.7405571,0.01546731,0.0007475053,0.00007984582,0.0007826111,0.0002367629,0.2217101],"genre_scores_gemma":[0.6651026,0.009314484,0.2170812,0.003825147,0.002340161,0.0006932874,0.0008410421,0.0003334529,0.1004687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01215095,"threshold_uncertainty_score":0.04064894,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540828,0.001266529,0.001505199,0.001890072,0.002305426,0.003754718,0.002524487,0.002125193,0.00687647],"category_scores_gemma":[0.01981508,0.001037744,0.002436092,0.001610774,0.004253785,0.006728659,0.004241829,0.004198548,0.001177328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004292408,"about_ca_system_score_gemma":0.002911022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004552702,"about_ca_topic_score_gemma":0.004086094,"domain_scores_codex":[0.9938681,0.002399092,0.0004096803,0.001117544,0.001398509,0.0008071667],"domain_scores_gemma":[0.9836573,0.01182342,0.001114703,0.001462927,0.001356189,0.0005854107],"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.0001031727,0.00004304783,0.0001279304,0.00006154831,0.0000239137,0.00005074131,0.0002196108,0.02115649,0.0007699492,0.971307,0.0003426664,0.005793987],"study_design_scores_gemma":[0.00003340397,0.0000212442,0.00003931939,0.00002310009,0.0000181342,0.00001635288,0.00002570305,0.07419014,0.0009709726,0.9236257,0.001019965,0.0000158647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03061905,0.0002165682,0.9579888,0.0003564596,0.00007631912,0.0001377303,0.0001995618,0.00055031,0.009855207],"genre_scores_gemma":[0.7598712,0.0005379377,0.2244706,0.0004245935,0.000133357,0.001074314,0.0008176789,0.0005058799,0.01216436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00687647,"threshold_uncertainty_score":0.03114378,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004320655,0.0008167509,0.001471128,0.002288539,0.001730556,0.004681414,0.002385586,0.004270988,0.01228019],"category_scores_gemma":[0.02623585,0.0006582581,0.001543945,0.003341868,0.003139411,0.01230268,0.00541569,0.00613305,0.002485572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001177171,"about_ca_system_score_gemma":0.00101124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002012132,"about_ca_topic_score_gemma":0.0001865615,"domain_scores_codex":[0.994379,0.001954701,0.0003602635,0.001316522,0.001506008,0.0004834622],"domain_scores_gemma":[0.9665434,0.02685403,0.0009372442,0.003854993,0.001064735,0.0007456481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000423408,0.0001603554,0.001491378,0.0002354122,0.00004148676,0.0001899447,0.0002341999,0.006250408,0.001652357,0.8672848,0.0136678,0.1083686],"study_design_scores_gemma":[0.00002953851,0.00003701064,0.000261611,0.00002374396,0.00001597838,0.0001736391,0.00005786261,0.02800006,0.001797052,0.9642855,0.005306372,0.00001158387],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1512481,0.003092619,0.7624175,0.01383813,0.0009079062,0.0002078106,0.0009716353,0.001227905,0.06608844],"genre_scores_gemma":[0.8170556,0.001784148,0.1430096,0.002267529,0.001955765,0.0002681713,0.00339277,0.0005519689,0.02971443],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01228019,"threshold_uncertainty_score":0.04108137,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005195637,0.000977546,0.001830428,0.002591199,0.00249079,0.009447038,0.002185173,0.003711568,0.004475492],"category_scores_gemma":[0.02270518,0.001548927,0.001150317,0.003269918,0.008332499,0.01372783,0.005730097,0.004936873,0.0009121104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002634877,"about_ca_system_score_gemma":0.001489695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006475155,"about_ca_topic_score_gemma":0.0004658532,"domain_scores_codex":[0.9892522,0.005372216,0.0004479765,0.001009712,0.003016116,0.0009017697],"domain_scores_gemma":[0.9717848,0.01865222,0.002161886,0.005258132,0.001435807,0.0007070652],"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.0000753796,0.00001526823,0.000107142,0.0000271497,0.00001065053,0.00005562068,0.0001969798,0.01632785,0.0004372121,0.9791692,0.0005223452,0.003055092],"study_design_scores_gemma":[0.00001645727,0.00001211859,0.00003817517,0.00001484199,0.00001465458,0.00005524686,0.00004540848,0.07650601,0.0006314946,0.9207149,0.001934034,0.00001674739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07283562,0.001343825,0.8894809,0.003848263,0.0002814288,0.0001213964,0.0002758995,0.0005596672,0.03125305],"genre_scores_gemma":[0.9356296,0.001032857,0.04705426,0.0003937723,0.0003200373,0.0001981642,0.0001002951,0.0001574626,0.01511363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009447038,"threshold_uncertainty_score":0.02747744,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006097498,0.00113006,0.002738138,0.003144052,0.003867462,0.008166187,0.005002664,0.005099284,0.01461891],"category_scores_gemma":[0.02702711,0.001208374,0.002584398,0.003950836,0.007238871,0.01845817,0.009088867,0.01744456,0.001821282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003972527,"about_ca_system_score_gemma":0.002622185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001950521,"about_ca_topic_score_gemma":0.001709836,"domain_scores_codex":[0.994609,0.001765263,0.00022207,0.001130785,0.001543417,0.0007294407],"domain_scores_gemma":[0.977019,0.01903363,0.0005684256,0.001344159,0.001297311,0.0007375108],"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.00005296092,0.00005362959,0.000170767,0.00007373542,0.00001614176,0.00003599775,0.0001206566,0.001784111,0.000329024,0.9842934,0.005748023,0.007321541],"study_design_scores_gemma":[0.00001901765,0.000007373025,0.00004689908,0.00001502721,0.000006419561,0.00001688623,0.00002202447,0.01179651,0.0001209131,0.9866506,0.001291951,0.000006293223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05266651,0.001635686,0.8016187,0.03392016,0.001028921,0.0001808109,0.0008846699,0.0008131407,0.1072513],"genre_scores_gemma":[0.650587,0.002384215,0.2918137,0.01578589,0.0041702,0.001009122,0.002585296,0.0008948838,0.03076962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01461891,"threshold_uncertainty_score":0.04890507,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003849077,0.0008117252,0.0006378587,0.0011477,0.002014645,0.004127518,0.0009579354,0.001221875,0.1192834],"category_scores_gemma":[0.002830754,0.0004754738,0.0009156168,0.001090275,0.001268047,0.006799798,0.001956876,0.002156978,0.07109369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110814,"about_ca_system_score_gemma":0.000933457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00153556,"about_ca_topic_score_gemma":0.001757352,"domain_scores_codex":[0.9995073,0.00006999625,0.00003060985,0.0001883804,0.000134875,0.00006885673],"domain_scores_gemma":[0.9984389,0.0003786494,0.00005943925,0.0005903817,0.0004398763,0.00009277158],"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.00005854927,0.00004238192,0.0002563539,0.00008137426,0.00001099856,0.0001207745,0.0003235281,0.0003492676,0.001519499,0.8883502,0.05692345,0.05196361],"study_design_scores_gemma":[0.00002432615,0.00002371326,0.000218683,0.00002955562,0.00001858976,0.0001950042,0.0001554116,0.001812019,0.003065414,0.6641359,0.330303,0.00001838263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0177335,0.001156988,0.2367877,0.005374275,0.002139866,0.000422588,0.006914678,0.007062869,0.7224075],"genre_scores_gemma":[0.226749,0.001586755,0.04239464,0.0017978,0.000626042,0.0005152268,0.005204509,0.002022574,0.7191035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1192834,"threshold_uncertainty_score":0.3990428,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738704,0.0008715608,0.002027507,0.001007372,0.001600184,0.002764839,0.00210682,0.002858772,0.003152167],"category_scores_gemma":[0.01678981,0.001451728,0.001108823,0.001241297,0.003138125,0.004876412,0.006816924,0.001860683,0.000416534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018449,"about_ca_system_score_gemma":0.0009149828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002425696,"about_ca_topic_score_gemma":0.001434801,"domain_scores_codex":[0.9982826,0.0005999012,0.00006342747,0.0003503953,0.0003518816,0.0003519043],"domain_scores_gemma":[0.9903674,0.006733363,0.00123388,0.0006685582,0.0003905024,0.0006062802],"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.001580115,0.0001615531,0.003287911,0.0002965771,0.0002287537,0.0006985832,0.001227767,0.5632069,0.00536092,0.3860859,0.002689438,0.03517549],"study_design_scores_gemma":[0.00007925597,0.0001053471,0.0007029111,0.00002644791,0.00003830157,0.0001697622,0.0001720628,0.7393546,0.001474411,0.2567272,0.001112565,0.00003708232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2665323,0.0006249535,0.7169294,0.0009746728,0.00009858324,0.00005366737,0.0001068914,0.0002272546,0.01445214],"genre_scores_gemma":[0.9644834,0.0001576411,0.02931669,0.0001022378,0.00005773832,0.00005678671,0.0000680181,0.00008938473,0.005668113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003152167,"threshold_uncertainty_score":0.01054502,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006015151,0.0009092557,0.001618678,0.0029241,0.003696901,0.006281464,0.002419276,0.00220852,0.007045334],"category_scores_gemma":[0.02578058,0.001118288,0.002492022,0.002275743,0.008795652,0.01195876,0.005676593,0.007188178,0.0007462683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002954093,"about_ca_system_score_gemma":0.002139147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002499958,"about_ca_topic_score_gemma":0.001897013,"domain_scores_codex":[0.9916416,0.002554754,0.0006885197,0.001583733,0.002441716,0.001089774],"domain_scores_gemma":[0.9724776,0.01940642,0.001207158,0.003425869,0.002228999,0.001254029],"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.00002414323,0.00001387079,0.0001120375,0.00002422834,0.000007074565,0.00004486936,0.0001661816,0.00112493,0.0001553042,0.9958094,0.0002224643,0.002295462],"study_design_scores_gemma":[0.000008147204,0.000007952422,0.00004088607,0.000008940431,0.000008218149,0.00005173577,0.00002289805,0.007320318,0.0002420289,0.991447,0.0008323439,0.00000964805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09837066,0.001825231,0.8386015,0.002983398,0.0004006556,0.0001153261,0.0004090401,0.0006825486,0.05661165],"genre_scores_gemma":[0.9131007,0.0008370875,0.07573026,0.0005329892,0.0005519935,0.0002661815,0.0003874008,0.0002163038,0.008377073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007045334,"threshold_uncertainty_score":0.03181154,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287797,0.0006257748,0.000892346,0.001048428,0.0007193811,0.001163481,0.00104143,0.001170333,0.01796814],"category_scores_gemma":[0.008084506,0.0004149209,0.0008949165,0.001018529,0.0008355436,0.002036458,0.002223138,0.001999172,0.003736418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004994836,"about_ca_system_score_gemma":0.0009252006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001420307,"about_ca_topic_score_gemma":0.003692269,"domain_scores_codex":[0.9991488,0.0002596344,0.000041075,0.0001403587,0.0002943713,0.0001158007],"domain_scores_gemma":[0.9974043,0.001447302,0.00006138584,0.0006817105,0.0002968733,0.0001084458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007990856,0.0002401172,0.002304914,0.0005621138,0.00008597897,0.0003440086,0.0006897127,0.04065366,0.01099079,0.1484241,0.05410964,0.7407959],"study_design_scores_gemma":[0.0001421168,0.0001544738,0.0005964891,0.0001755586,0.000116266,0.0003620338,0.0001634024,0.4619446,0.01185596,0.4587483,0.06570411,0.00003670145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05566914,0.001292468,0.8632355,0.001776896,0.0003917003,0.0002571189,0.0009606539,0.01299645,0.06342021],"genre_scores_gemma":[0.3922389,0.0005215384,0.5683169,0.0006257214,0.0001423394,0.0002214101,0.001152955,0.00226998,0.03451031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01796814,"threshold_uncertainty_score":0.06010944,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481065,0.0009990932,0.002284375,0.001164477,0.002091053,0.0064872,0.002919145,0.002584605,0.01515244],"category_scores_gemma":[0.02515207,0.001064971,0.001922165,0.003239243,0.003278009,0.01144826,0.003083839,0.004694068,0.0006748828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005045694,"about_ca_system_score_gemma":0.004880677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01656329,"about_ca_topic_score_gemma":0.01340747,"domain_scores_codex":[0.9956643,0.00153623,0.0002232984,0.0006507997,0.001231545,0.0006938156],"domain_scores_gemma":[0.9707946,0.02437701,0.001334524,0.001513541,0.001134446,0.0008457884],"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.0002859222,0.0001708471,0.001255932,0.0003162387,0.0001121824,0.0001680012,0.0003741207,0.174,0.0005428608,0.7941092,0.008458029,0.02020657],"study_design_scores_gemma":[0.00005042008,0.00001289709,0.0002277287,0.00001590001,0.0000206832,0.00003620573,0.00006834626,0.1987702,0.0001396566,0.7994757,0.001165892,0.00001633435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.315708,0.002199328,0.5904886,0.01812725,0.0003148961,0.0004283048,0.004248929,0.0007460135,0.06773878],"genre_scores_gemma":[0.8965877,0.001416715,0.08329656,0.0009282341,0.0004296546,0.0004262163,0.002251396,0.0002740694,0.01438946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01656329,"threshold_uncertainty_score":0.05069,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007122683,0.0008308016,0.0009007835,0.001256929,0.001380058,0.003088739,0.002712263,0.001559683,0.003092597],"category_scores_gemma":[0.04245144,0.0008361186,0.0006629779,0.0009782973,0.001894561,0.004816392,0.003485164,0.002701034,0.0004628621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001168874,"about_ca_system_score_gemma":0.003497391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003293689,"about_ca_topic_score_gemma":0.003302984,"domain_scores_codex":[0.9898477,0.002885895,0.0009799547,0.001402725,0.003314382,0.001569345],"domain_scores_gemma":[0.94716,0.02474601,0.005494354,0.01654851,0.005014335,0.001036732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004133313,0.0006497593,0.02371126,0.001093533,0.0003708951,0.002691787,0.002451352,0.1776271,0.060545,0.3505012,0.02434002,0.3518848],"study_design_scores_gemma":[0.0002057021,0.0001561504,0.001980647,0.0001908137,0.0001851261,0.0004411994,0.000214932,0.7836702,0.08446483,0.1174459,0.0109768,0.00006754924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.234959,0.0008480658,0.7258976,0.003083916,0.0004247624,0.0002856893,0.0004786041,0.01500136,0.01902091],"genre_scores_gemma":[0.9525049,0.0001220527,0.04432438,0.0003143108,0.00008940141,0.00007829166,0.0001467221,0.000389326,0.002030732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007122683,"threshold_uncertainty_score":0.03766876,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006350662,0.0009125485,0.001365305,0.003408656,0.001409954,0.002087808,0.002318641,0.002319246,0.02562056],"category_scores_gemma":[0.005683406,0.0006036631,0.001245127,0.003642443,0.001417054,0.004096113,0.002615552,0.001547398,0.00373222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001183079,"about_ca_system_score_gemma":0.001299614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002436019,"about_ca_topic_score_gemma":0.003418689,"domain_scores_codex":[0.9991862,0.0002294688,0.00003040338,0.0002791705,0.0002135711,0.00006113426],"domain_scores_gemma":[0.9984988,0.0007032253,0.00009418661,0.0004248334,0.0001846372,0.0000943973],"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.0002605766,0.0002222469,0.0009411795,0.0006010411,0.0001508351,0.0001842752,0.0002016555,0.1113419,0.003674774,0.4982992,0.03247676,0.3516455],"study_design_scores_gemma":[0.00007074526,0.00006539911,0.0003513628,0.00009174145,0.00007318425,0.000181454,0.00009009778,0.4317009,0.002934619,0.5435342,0.02088127,0.00002519555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03021533,0.002130423,0.8959588,0.001509367,0.0003421073,0.0003188191,0.0008186461,0.001632529,0.06707399],"genre_scores_gemma":[0.325173,0.001513659,0.6265388,0.000779647,0.0002172262,0.0003967709,0.00222844,0.0009110205,0.04224147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02562056,"threshold_uncertainty_score":0.08570927,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001849559,0.001437183,0.00266066,0.001702193,0.001138248,0.002918016,0.002243194,0.001957897,0.01256125],"category_scores_gemma":[0.01230425,0.001128256,0.001384656,0.005160495,0.000879887,0.004272989,0.002967168,0.00277821,0.002394724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765913,"about_ca_system_score_gemma":0.003013743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007087376,"about_ca_topic_score_gemma":0.01185608,"domain_scores_codex":[0.9981,0.0004561538,0.0001040004,0.000178046,0.0009134253,0.0002483985],"domain_scores_gemma":[0.995644,0.0022208,0.0002424832,0.0009841131,0.0006918791,0.0002168306],"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.000851569,0.000282769,0.000827714,0.0006042233,0.00009514178,0.0001405552,0.0001641235,0.5649655,0.002758859,0.08124566,0.02802736,0.3200365],"study_design_scores_gemma":[0.00006153817,0.00003891905,0.000104532,0.00001844376,0.00001102598,0.00004250345,0.0000265228,0.9539722,0.0006055546,0.04268269,0.002427831,0.000008224039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02399063,0.001463641,0.9616386,0.0006930277,0.0002727394,0.0002263071,0.0006199686,0.001615745,0.009479407],"genre_scores_gemma":[0.243456,0.001180905,0.7453016,0.0003428553,0.0002999582,0.0006931729,0.001797578,0.0005624482,0.006365553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01256125,"threshold_uncertainty_score":0.04202163,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003100908,0.0006574638,0.001993236,0.001522188,0.001343486,0.005875134,0.002488408,0.002064943,0.01237318],"category_scores_gemma":[0.0276492,0.0008653142,0.002045055,0.001849302,0.003158939,0.01541734,0.00281572,0.003935843,0.0008601943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002062082,"about_ca_system_score_gemma":0.002193633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001531146,"about_ca_topic_score_gemma":0.001352883,"domain_scores_codex":[0.9972048,0.0007299404,0.0002285096,0.0004615432,0.0008870434,0.0004881575],"domain_scores_gemma":[0.953989,0.03498785,0.001638292,0.006444414,0.001879368,0.001060968],"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.0004674945,0.0001345641,0.001200615,0.000150257,0.00002887668,0.0001440605,0.0003171711,0.03913746,0.004103403,0.9311361,0.002046532,0.02113348],"study_design_scores_gemma":[0.00003196071,0.00004719056,0.0003737129,0.00001172354,0.00002840197,0.00009248799,0.00005498032,0.1765112,0.003081947,0.8191835,0.0005471883,0.00003580884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5143172,0.0006803813,0.4484307,0.002278168,0.0002052786,0.0001624427,0.0008420839,0.001189201,0.03189455],"genre_scores_gemma":[0.9732739,0.0002406593,0.02191744,0.0001017796,0.0001559487,0.0001016207,0.000364672,0.000204558,0.003639461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01237318,"threshold_uncertainty_score":0.04139239,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317198,0.0008694507,0.001385781,0.001974783,0.00120497,0.002802317,0.001743317,0.001353937,0.006573049],"category_scores_gemma":[0.008386495,0.0006414852,0.0005803339,0.002719546,0.001258221,0.004015801,0.002196601,0.002299926,0.0011443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443925,"about_ca_system_score_gemma":0.001641667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002820321,"about_ca_topic_score_gemma":0.006677039,"domain_scores_codex":[0.9992005,0.0001459372,0.00004670036,0.0002229674,0.0001643528,0.0002195493],"domain_scores_gemma":[0.9949799,0.002620815,0.0005090692,0.0008218202,0.0005185528,0.0005497822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004644831,0.0008295171,0.01599234,0.001146797,0.0003153173,0.000588462,0.001145136,0.2538597,0.02897558,0.2418365,0.03864683,0.412019],"study_design_scores_gemma":[0.0001803503,0.0001881541,0.001914854,0.0000550465,0.0000918046,0.0001867905,0.0004369817,0.5166153,0.01276374,0.4630421,0.004488142,0.00003670155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8089803,0.0007203073,0.1700904,0.001473884,0.0001502482,0.00007971523,0.00171852,0.002262319,0.01452424],"genre_scores_gemma":[0.9075339,0.0001808202,0.08534321,0.0001579912,0.00006138829,0.00004034907,0.002453087,0.0002359573,0.003993398],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006573049,"threshold_uncertainty_score":0.02198905,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006647013,0.002888157,0.003585129,0.004037356,0.003398815,0.01101154,0.008425167,0.004852858,0.02370249],"category_scores_gemma":[0.05893384,0.002125205,0.002813941,0.004378504,0.006610753,0.02565557,0.007196305,0.00834576,0.004133999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005511072,"about_ca_system_score_gemma":0.003075822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001000453,"about_ca_topic_score_gemma":0.001529787,"domain_scores_codex":[0.9906881,0.001708113,0.0006786523,0.002085597,0.002776505,0.002063081],"domain_scores_gemma":[0.8850276,0.09458952,0.00359289,0.009810133,0.003752603,0.003227078],"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.00442238,0.0006970793,0.005272193,0.0016545,0.0003111252,0.0006542723,0.001189439,0.06909447,0.01945557,0.7944064,0.02477756,0.07806503],"study_design_scores_gemma":[0.0002033663,0.0001376409,0.0009469728,0.000147787,0.0001855131,0.000637572,0.0001313711,0.1444168,0.006687176,0.840969,0.005432974,0.0001037475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3200283,0.009981264,0.5339245,0.01908436,0.001552552,0.0003791672,0.004710548,0.003410301,0.106929],"genre_scores_gemma":[0.852554,0.004190317,0.09999193,0.002512694,0.002632023,0.001077574,0.003358564,0.001735812,0.03194724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02370249,"threshold_uncertainty_score":0.07929277,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007907448,0.0006469308,0.0006397652,0.001260175,0.00149756,0.002001893,0.001055845,0.0008231908,0.05686858],"category_scores_gemma":[0.004450475,0.0003374815,0.0005945548,0.0009066987,0.001307119,0.003573043,0.002936839,0.001303431,0.01121787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007892509,"about_ca_system_score_gemma":0.001158734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005322963,"about_ca_topic_score_gemma":0.0004918351,"domain_scores_codex":[0.9989815,0.00018368,0.00005645563,0.0003735465,0.0002412241,0.0001634652],"domain_scores_gemma":[0.9979165,0.0004739476,0.0001330278,0.0008784868,0.0004102999,0.0001877573],"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.0002143736,0.00004714819,0.000471919,0.0001210336,0.00002992444,0.0001774139,0.0004844015,0.002087005,0.01268942,0.9184569,0.01525932,0.04996115],"study_design_scores_gemma":[0.0001184691,0.00014786,0.001102122,0.00006331815,0.00006786519,0.000504924,0.0004720255,0.02391809,0.02288991,0.8088174,0.1418466,0.00005141522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04264586,0.0006525696,0.4542088,0.002130713,0.001358892,0.0004475387,0.001204776,0.00378003,0.4935709],"genre_scores_gemma":[0.7449858,0.0005151598,0.04169646,0.0009371465,0.0004732306,0.000566266,0.00156397,0.001030307,0.2082316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05686858,"threshold_uncertainty_score":0.1902444,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00474538,0.001235155,0.001544765,0.005634666,0.002253074,0.005104444,0.002228245,0.002598522,0.009524456],"category_scores_gemma":[0.02405293,0.0007902959,0.0009344064,0.002714517,0.003771144,0.008792938,0.0025973,0.003589538,0.001417797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002642241,"about_ca_system_score_gemma":0.001117309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007645597,"about_ca_topic_score_gemma":0.0005935644,"domain_scores_codex":[0.9977386,0.000670764,0.0001564405,0.0002640912,0.0008698542,0.000300374],"domain_scores_gemma":[0.9805047,0.01280501,0.001248794,0.001075249,0.003082048,0.001284162],"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.00004113144,0.00001264377,0.00009662363,0.00003458538,0.000005777145,0.00003968361,0.00007479273,0.002835906,0.0007708994,0.9913183,0.00101242,0.003757228],"study_design_scores_gemma":[0.00001634255,0.00001940785,0.00009288399,0.00002422319,0.000007981731,0.00007970484,0.00004005205,0.04324646,0.0006755556,0.9541625,0.00161781,0.00001698468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1139783,0.001629031,0.7992262,0.002119536,0.0003480524,0.0001938135,0.0003151957,0.0003164357,0.08187353],"genre_scores_gemma":[0.8563081,0.002126421,0.1039001,0.0008024745,0.001027312,0.0004082249,0.0005513394,0.0005097996,0.03436631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009524456,"threshold_uncertainty_score":0.0318625,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002849484,0.001519501,0.002424221,0.001478929,0.003091029,0.005962445,0.003090097,0.002172498,0.01935011],"category_scores_gemma":[0.01734391,0.0008122273,0.001344458,0.002453952,0.004032596,0.01658748,0.005985332,0.004565507,0.00395379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002914131,"about_ca_system_score_gemma":0.00284213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002134973,"about_ca_topic_score_gemma":0.003438983,"domain_scores_codex":[0.9948235,0.001276321,0.000237113,0.001138998,0.001359922,0.001164232],"domain_scores_gemma":[0.9833107,0.01087895,0.0006352421,0.003295311,0.001161959,0.0007177863],"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.00144015,0.0001861475,0.0005813742,0.000532905,0.0001038693,0.0001671048,0.0006870504,0.04267868,0.006132907,0.8052534,0.02762898,0.1146074],"study_design_scores_gemma":[0.0001366782,0.00009136758,0.0001408533,0.00004235349,0.00007005609,0.0001251944,0.0001430277,0.0941569,0.004381484,0.8923277,0.008347589,0.00003675197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0996931,0.00395467,0.7916876,0.00891772,0.000936194,0.0002798003,0.00102715,0.005334227,0.08816953],"genre_scores_gemma":[0.7658703,0.001524556,0.1498967,0.002081435,0.00114067,0.0004782944,0.0007399895,0.001439875,0.07682819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01935011,"threshold_uncertainty_score":0.06473255,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00480425,0.0008230723,0.001659635,0.001367858,0.001983229,0.004635688,0.004327483,0.001356884,0.01306122],"category_scores_gemma":[0.02455173,0.001282983,0.001328063,0.002915823,0.00306971,0.01312099,0.006577821,0.002840217,0.002194885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812337,"about_ca_system_score_gemma":0.002128245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004484851,"about_ca_topic_score_gemma":0.00771704,"domain_scores_codex":[0.9948137,0.001793653,0.0003932482,0.0006621015,0.001584923,0.0007523995],"domain_scores_gemma":[0.9752638,0.01171033,0.0005872717,0.01038835,0.001553671,0.0004965488],"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.002490186,0.0004684626,0.003997976,0.000831564,0.0001708094,0.0007100294,0.003552343,0.06670754,0.01558342,0.4542457,0.02792773,0.4233142],"study_design_scores_gemma":[0.0003908038,0.0001841017,0.0005972533,0.0001027547,0.0003008622,0.0003215919,0.0007751376,0.4630667,0.03380073,0.4748942,0.02545866,0.0001071249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1171974,0.001085832,0.8396054,0.001169989,0.0001997173,0.0002402301,0.0006174457,0.0220681,0.01781594],"genre_scores_gemma":[0.6273587,0.0003525261,0.350646,0.0004825867,0.0001430247,0.0002908043,0.001152459,0.003803127,0.01577081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01306122,"threshold_uncertainty_score":0.04369414,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005014201,0.001412235,0.003041721,0.001391536,0.00215059,0.007819025,0.002777567,0.003217597,0.0160634],"category_scores_gemma":[0.0255069,0.001503695,0.002477802,0.00249667,0.005716682,0.0136223,0.003578906,0.007820068,0.001209646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005540713,"about_ca_system_score_gemma":0.003400936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003761731,"about_ca_topic_score_gemma":0.003143145,"domain_scores_codex":[0.9952257,0.002172949,0.0002712268,0.0009957224,0.0007466335,0.0005877755],"domain_scores_gemma":[0.9612786,0.03390953,0.001049225,0.001140497,0.001279471,0.001342799],"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.000120133,0.00008897795,0.0001771826,0.0001447456,0.0000385299,0.00007359618,0.000232194,0.01732579,0.0002655963,0.9676648,0.004802042,0.009066434],"study_design_scores_gemma":[0.00003006789,0.00001416253,0.00003964278,0.0000151671,0.00001036972,0.0000219246,0.00005104847,0.03903,0.00015701,0.959626,0.0009951184,0.000009415115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1292001,0.003208983,0.7877523,0.01508562,0.0004069472,0.0004069918,0.001736769,0.0004716728,0.06173067],"genre_scores_gemma":[0.7884161,0.002780691,0.1500109,0.001591892,0.001089582,0.0009148442,0.002489022,0.0004259377,0.05228095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0160634,"threshold_uncertainty_score":0.0537374,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007228386,0.0009981005,0.00372835,0.002041149,0.002937513,0.008686011,0.005518695,0.003924584,0.01555168],"category_scores_gemma":[0.07276886,0.001212668,0.001790211,0.005032846,0.005800918,0.02717644,0.004275991,0.005833408,0.001428369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007393413,"about_ca_system_score_gemma":0.006337033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007494465,"about_ca_topic_score_gemma":0.005164004,"domain_scores_codex":[0.9891583,0.003245439,0.0005331431,0.001528401,0.003840241,0.001694639],"domain_scores_gemma":[0.8746242,0.1066035,0.00288433,0.0100887,0.003611973,0.002187313],"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.002811344,0.0004347537,0.004985244,0.000691634,0.0002302139,0.0003174629,0.001061363,0.1481153,0.004781732,0.7264121,0.02975396,0.08040483],"study_design_scores_gemma":[0.000184882,0.00007327074,0.0009476284,0.00003456005,0.00009310414,0.0002075829,0.0002153485,0.3497246,0.001552103,0.6450539,0.0018662,0.00004679834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4610665,0.007321529,0.4277036,0.03783026,0.0007536077,0.0003785444,0.004032085,0.001632974,0.0592808],"genre_scores_gemma":[0.9433627,0.002229917,0.04233414,0.0008786524,0.0009258942,0.000181934,0.001377066,0.0005241615,0.0081856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01555168,"threshold_uncertainty_score":0.05364329,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002003769,0.001003428,0.001373886,0.0009867037,0.0009102451,0.002215019,0.001533591,0.002225366,0.002862378],"category_scores_gemma":[0.01338775,0.0009095164,0.0008357104,0.001293343,0.001729177,0.002806084,0.00209353,0.001126342,0.0002820868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047969,"about_ca_system_score_gemma":0.001225459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003923278,"about_ca_topic_score_gemma":0.004797625,"domain_scores_codex":[0.998498,0.0005961964,0.00007047743,0.0001840035,0.0003033445,0.0003480387],"domain_scores_gemma":[0.993874,0.005012427,0.0002973845,0.0003157485,0.0002506307,0.0002499633],"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.0003690613,0.00004453451,0.0006110749,0.0001038162,0.00004820254,0.0001206247,0.00005096896,0.9760276,0.0006614926,0.01229677,0.001350603,0.008315207],"study_design_scores_gemma":[0.00001796474,0.00003532715,0.0001551854,0.00001272835,0.00001670386,0.00006215411,0.00003934505,0.9704685,0.0004700687,0.02837594,0.0003388888,0.000007198162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2807916,0.003555571,0.6863426,0.001963725,0.0001566943,0.00008787591,0.000661454,0.0004297346,0.02601085],"genre_scores_gemma":[0.9308335,0.0006004259,0.06355604,0.0001167346,0.00007511952,0.00006453292,0.0003526903,0.0001706929,0.00423032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003923278,"threshold_uncertainty_score":0.01059711,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894942,0.0008764493,0.0009766147,0.001885258,0.0009888465,0.002622325,0.001569021,0.001515879,0.02542282],"category_scores_gemma":[0.007624865,0.0005019107,0.001098477,0.001313516,0.0009876057,0.003947529,0.0025362,0.001830253,0.0112877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007806207,"about_ca_system_score_gemma":0.001004071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002586024,"about_ca_topic_score_gemma":0.004383812,"domain_scores_codex":[0.9986011,0.0002023509,0.0001034636,0.0004110009,0.0005269785,0.0001551009],"domain_scores_gemma":[0.9968535,0.0007602614,0.000112186,0.001434349,0.00066608,0.0001735963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005005954,0.0001888522,0.002681957,0.0003427174,0.00006007359,0.0004796485,0.0004581205,0.02781973,0.01595507,0.1627736,0.05537479,0.7333649],"study_design_scores_gemma":[0.00006182738,0.00008265057,0.0009083898,0.0001039284,0.00007123002,0.0004745769,0.0002304657,0.3495667,0.03488508,0.5228091,0.09073944,0.00006655641],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03338823,0.0002676296,0.8833774,0.0009889926,0.0005119851,0.0002112657,0.001564418,0.02550367,0.05418631],"genre_scores_gemma":[0.4436649,0.0003004857,0.4990744,0.0004993514,0.0002416894,0.0001964182,0.004198097,0.002978023,0.04884661],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02542282,"threshold_uncertainty_score":0.08504778,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008545397,0.0002772728,0.0006766133,0.0008344297,0.0006605648,0.001516351,0.0009073962,0.001165096,0.001567135],"category_scores_gemma":[0.007943787,0.0004907369,0.0004333697,0.0004720501,0.001515544,0.003081841,0.001252228,0.0009135024,0.0002965502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003384084,"about_ca_system_score_gemma":0.0004143536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004947671,"about_ca_topic_score_gemma":0.0006456886,"domain_scores_codex":[0.9992332,0.0001466602,0.00007694907,0.0003010157,0.0001431266,0.00009895205],"domain_scores_gemma":[0.9895551,0.006852038,0.001183187,0.001306339,0.0007079362,0.0003954682],"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.005190173,0.0007202622,0.09751566,0.0008721351,0.000149026,0.004443833,0.005333681,0.04286451,0.3039412,0.3107176,0.00304392,0.225208],"study_design_scores_gemma":[0.0002398439,0.0007100016,0.01248368,0.00009817538,0.0001274192,0.002410805,0.002522764,0.3563802,0.1486171,0.4719293,0.00435889,0.0001219055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9139327,0.0001099591,0.08311388,0.0001335273,0.00002103274,0.00003861914,0.0001813749,0.0004543754,0.002014563],"genre_scores_gemma":[0.9747277,0.00002482074,0.02429563,0.00003227309,0.000009552708,0.00002263753,0.0001766337,0.00005105646,0.0006597057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001567135,"threshold_uncertainty_score":0.005242586,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00258081,0.0008168773,0.001288115,0.002848516,0.003388856,0.006229951,0.001423637,0.002294149,0.01810216],"category_scores_gemma":[0.01201646,0.001147803,0.001361947,0.002512337,0.006386335,0.01972356,0.003890949,0.003145626,0.00333823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001717955,"about_ca_system_score_gemma":0.001592053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00115679,"about_ca_topic_score_gemma":0.0009402802,"domain_scores_codex":[0.9969049,0.0008828318,0.0003685171,0.0007737764,0.0006605087,0.0004094343],"domain_scores_gemma":[0.9839728,0.01076307,0.000675018,0.001980732,0.001761011,0.0008473388],"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.00006979105,0.00001566745,0.0001831064,0.00004935781,0.000006659175,0.000210683,0.0005566406,0.0002876308,0.001114562,0.9895462,0.0008761171,0.007083472],"study_design_scores_gemma":[0.000009843101,0.00001355075,0.00007684022,0.00001622893,0.00001087561,0.000103601,0.0001451891,0.00165965,0.00143481,0.9921416,0.004372428,0.00001532917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1746251,0.00242364,0.7036402,0.004148192,0.0009660608,0.0002960537,0.001601844,0.00173951,0.1105594],"genre_scores_gemma":[0.8674085,0.001572572,0.08485999,0.0008714259,0.001069297,0.0005005739,0.00144072,0.0008061648,0.04147072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01810216,"threshold_uncertainty_score":0.06055778,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981159,0.001166349,0.001367578,0.00194709,0.003375695,0.006646003,0.00233328,0.002101339,0.0133962],"category_scores_gemma":[0.005067741,0.0008418779,0.001765232,0.00216429,0.005725432,0.009721826,0.003405092,0.004376856,0.003234779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360766,"about_ca_system_score_gemma":0.002397408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009826898,"about_ca_topic_score_gemma":0.0007222893,"domain_scores_codex":[0.9951756,0.0009417482,0.0003995527,0.0008838279,0.001729888,0.0008693035],"domain_scores_gemma":[0.9948235,0.001879804,0.000572481,0.0009367848,0.001132996,0.0006544996],"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.00002727071,0.00002394644,0.00005031172,0.00001797317,0.00000699921,0.00007172216,0.00006501445,0.0004797224,0.000545762,0.9962454,0.0006117878,0.001854006],"study_design_scores_gemma":[0.00003147087,0.00002545394,0.00004908567,0.00001139454,0.00001721993,0.0001998005,0.00005102316,0.006744753,0.001503898,0.9864581,0.004872826,0.00003497795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06399894,0.0007625959,0.8299478,0.001729877,0.001127669,0.0002627268,0.00127895,0.001636912,0.09925447],"genre_scores_gemma":[0.7949846,0.0008568777,0.1585253,0.001116356,0.001103976,0.0005287929,0.0007934552,0.0004039902,0.04168655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0133962,"threshold_uncertainty_score":0.04481477,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04567955,0.001305365,0.002923593,0.003607979,0.002907755,0.009674834,0.005135472,0.003345054,0.002386292],"category_scores_gemma":[0.1812805,0.002765158,0.004064463,0.003540799,0.01454661,0.02493863,0.008761885,0.01060628,0.0003629499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00322117,"about_ca_system_score_gemma":0.003384501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003467494,"about_ca_topic_score_gemma":0.002286498,"domain_scores_codex":[0.9639562,0.01553646,0.003696759,0.004074454,0.01063474,0.002101443],"domain_scores_gemma":[0.7511079,0.1806715,0.008275899,0.0512494,0.007750425,0.0009448616],"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.0001914631,0.00006412017,0.001255638,0.0002399109,0.00009380425,0.0001200171,0.001178758,0.0353573,0.001140283,0.9398444,0.0005345927,0.01997983],"study_design_scores_gemma":[0.00005117264,0.00004670631,0.000211256,0.0001722588,0.0000884054,0.00007059137,0.0001534334,0.03568309,0.001819401,0.9598808,0.001792252,0.00003066775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08982673,0.002072188,0.8899511,0.004717215,0.0001804905,0.000162136,0.0004396312,0.0006623403,0.01198808],"genre_scores_gemma":[0.780152,0.001844878,0.2135269,0.0007771752,0.0003722455,0.00032986,0.0007374372,0.0004055104,0.001853948],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04567955,"threshold_uncertainty_score":0.2415795,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00593775,0.001497578,0.001618705,0.001980664,0.001924177,0.007370335,0.004178258,0.002994135,0.009448541],"category_scores_gemma":[0.02215179,0.001728705,0.002697074,0.003343795,0.006154208,0.01771231,0.007698135,0.005363039,0.001043454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001846572,"about_ca_system_score_gemma":0.002627868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005368592,"about_ca_topic_score_gemma":0.004460668,"domain_scores_codex":[0.9921553,0.00300751,0.0007583883,0.000989655,0.002063659,0.001025564],"domain_scores_gemma":[0.9810488,0.01033396,0.001156723,0.00520949,0.001485386,0.0007656319],"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.00004591506,0.0000177219,0.0003339842,0.00005577323,0.00002470143,0.0001778364,0.0003220772,0.02717739,0.0005639957,0.9651257,0.0004300625,0.005724803],"study_design_scores_gemma":[0.00004417443,0.00002897312,0.00007084641,0.00003272019,0.00004611647,0.0001780732,0.0001292029,0.1518203,0.001526912,0.8358615,0.01023009,0.00003106717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01977784,0.0005837278,0.9699423,0.0005409085,0.0001724335,0.00009379902,0.00009714787,0.0004542852,0.00833757],"genre_scores_gemma":[0.6277435,0.001082629,0.3484817,0.00039472,0.0004287426,0.0004715715,0.0003227689,0.0007220795,0.02035224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009448541,"threshold_uncertainty_score":0.03160846,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004335475,0.0009268222,0.001314457,0.003690426,0.003014879,0.008552858,0.00292212,0.002228814,0.005285233],"category_scores_gemma":[0.008699295,0.001249406,0.002238077,0.004305164,0.01048114,0.02101252,0.005367999,0.006463022,0.001230224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003461739,"about_ca_system_score_gemma":0.002123284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002818077,"about_ca_topic_score_gemma":0.002480721,"domain_scores_codex":[0.996769,0.00114625,0.000282696,0.0004939625,0.001073735,0.0002344518],"domain_scores_gemma":[0.9958246,0.001899881,0.0003071016,0.0007544031,0.0009749419,0.0002390203],"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.000003008756,0.000004634856,0.00003259709,0.00001324536,0.000003024966,0.00001113882,0.00006284404,0.0004565016,0.00004167021,0.9970936,0.0004562315,0.001821468],"study_design_scores_gemma":[0.00000474557,0.000003438035,0.0000176992,0.000008403508,0.000004539271,0.00002069753,0.00002588107,0.00356519,0.00004735938,0.9925585,0.003739103,0.000004434787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008413746,0.001981654,0.9538867,0.004747496,0.0003687856,0.00005148021,0.0001666832,0.0002636593,0.03011977],"genre_scores_gemma":[0.3395196,0.004521733,0.6342331,0.002017439,0.002124922,0.0003532572,0.000553483,0.00026892,0.01640746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008552858,"threshold_uncertainty_score":0.02511674,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003153269,0.0006547294,0.001065927,0.002542661,0.002652066,0.007513447,0.002529597,0.003264117,0.01229145],"category_scores_gemma":[0.005375323,0.0006845529,0.001412299,0.002429006,0.01395377,0.01665942,0.003895366,0.007011776,0.001799669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003416831,"about_ca_system_score_gemma":0.001339534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00279349,"about_ca_topic_score_gemma":0.001903722,"domain_scores_codex":[0.9981672,0.0008220793,0.00009570284,0.0002969565,0.0004502201,0.0001678987],"domain_scores_gemma":[0.9962095,0.002266406,0.000175632,0.0005845724,0.000480615,0.0002832226],"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.000001568963,0.000001500863,0.00001101879,0.000006351409,6.958725e-7,0.000003538471,0.00002963963,0.00007469588,0.00001605924,0.9990251,0.0003195325,0.0005102133],"study_design_scores_gemma":[0.000002110632,0.000002496673,0.00001571995,0.000008418111,8.809943e-7,0.000008446007,0.00002611135,0.0004293409,0.00002166527,0.9947594,0.004722824,0.00000263256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01552526,0.02162313,0.6903844,0.04999756,0.002036767,0.00005609906,0.0009066259,0.000540394,0.2189298],"genre_scores_gemma":[0.6844128,0.02085073,0.2236726,0.01000054,0.00710502,0.0005075045,0.0008784962,0.0004611016,0.05211115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01229145,"threshold_uncertainty_score":0.04111892,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006962619,0.0003887615,0.0004077239,0.0005355273,0.0005628464,0.001627426,0.0009247366,0.0009608305,0.0177865],"category_scores_gemma":[0.006383286,0.0002995558,0.0004627178,0.0004535831,0.001219472,0.003546571,0.001349669,0.001848722,0.002615954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006534119,"about_ca_system_score_gemma":0.0004857303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005275875,"about_ca_topic_score_gemma":0.0006551319,"domain_scores_codex":[0.9994761,0.0001181784,0.00001781413,0.0001794226,0.0001480605,0.00006027976],"domain_scores_gemma":[0.9979388,0.0007536095,0.0001168374,0.0007312538,0.0003290725,0.0001304597],"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.0001102778,0.0001072918,0.00103991,0.0001359303,0.0000752255,0.00009740039,0.0002629209,0.01300757,0.006393201,0.7708873,0.01743826,0.1904447],"study_design_scores_gemma":[0.00001829201,0.00003791729,0.001200936,0.00001506182,0.00003029391,0.0001217402,0.00007025573,0.06975283,0.002962362,0.9056504,0.02012626,0.00001361215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08035801,0.001605893,0.7434539,0.008222717,0.001094387,0.0001067051,0.0003325582,0.001616757,0.1632092],"genre_scores_gemma":[0.8034432,0.0008068418,0.1257392,0.001248323,0.000439522,0.0001125445,0.0003226181,0.0004952931,0.06739248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0177865,"threshold_uncertainty_score":0.05950177,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002687778,0.0008865742,0.0007765641,0.001436292,0.0007316045,0.002919919,0.00194555,0.001054573,0.003639625],"category_scores_gemma":[0.01249567,0.0008248963,0.001432065,0.001599014,0.002196596,0.006082706,0.002426452,0.002248807,0.0003979177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093957,"about_ca_system_score_gemma":0.001599783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005384499,"about_ca_topic_score_gemma":0.003978363,"domain_scores_codex":[0.9980676,0.0006795938,0.0001579417,0.0003134605,0.0005517044,0.0002298038],"domain_scores_gemma":[0.9926245,0.005128722,0.0005258023,0.0009655179,0.0004712767,0.0002841516],"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.0001188758,0.00006559856,0.001155347,0.00006699542,0.00004227529,0.0002588844,0.0003408581,0.3210791,0.001260325,0.6581187,0.000324284,0.01716873],"study_design_scores_gemma":[0.00001520115,0.00001992591,0.0000667219,0.00002200154,0.000028751,0.00003684927,0.00004635481,0.7146444,0.001233332,0.2823978,0.001476767,0.00001186353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01641133,0.000104524,0.9800674,0.0001037603,0.00002795382,0.00002649549,0.00005025247,0.0002588122,0.002949457],"genre_scores_gemma":[0.7653117,0.0004094939,0.2283836,0.00006403364,0.00007531117,0.0001507712,0.0002292997,0.0001609504,0.005214879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005384499,"threshold_uncertainty_score":0.01421452,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001978566,0.0006406234,0.0008569827,0.002314289,0.001552813,0.005495398,0.001246307,0.001657128,0.01251387],"category_scores_gemma":[0.01056314,0.0007098426,0.001548533,0.003508573,0.00345429,0.009424535,0.003782464,0.005261012,0.00210678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005327865,"about_ca_system_score_gemma":0.002214737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004336074,"about_ca_topic_score_gemma":0.00198686,"domain_scores_codex":[0.9975538,0.0004926322,0.0001751444,0.0005588119,0.001010321,0.0002092864],"domain_scores_gemma":[0.9931152,0.004334109,0.0003119046,0.001153497,0.0008119135,0.0002733165],"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.00002344699,0.0000117177,0.0001932559,0.00008508471,0.00001018695,0.00002047052,0.0001655435,0.002237267,0.000267609,0.9714488,0.006911377,0.01862527],"study_design_scores_gemma":[0.000006245842,0.00000577981,0.0001576188,0.00002964402,0.000006076305,0.00004749436,0.00003144666,0.006127052,0.0003458824,0.974669,0.01855941,0.00001427987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1026301,0.01914869,0.6246566,0.03915161,0.003244494,0.0002861202,0.0075554,0.001586026,0.2017409],"genre_scores_gemma":[0.8552114,0.006385047,0.09107051,0.001889597,0.002667416,0.0004607256,0.004843676,0.0006183608,0.03685325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01251387,"threshold_uncertainty_score":0.04186308,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008933363,0.0004121963,0.0008806679,0.001172194,0.001179205,0.001808681,0.000732834,0.001495794,0.006312474],"category_scores_gemma":[0.005256592,0.0005187995,0.0004889796,0.001014321,0.00127772,0.001716839,0.001362355,0.001072801,0.0006554424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008489043,"about_ca_system_score_gemma":0.0007984666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003822367,"about_ca_topic_score_gemma":0.000615667,"domain_scores_codex":[0.9992328,0.0003301021,0.00004715721,0.0001210563,0.0001675945,0.0001012541],"domain_scores_gemma":[0.996937,0.001977853,0.000226185,0.0004165648,0.00028694,0.0001555434],"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.00007231365,0.00003691518,0.0002172305,0.00009612802,0.0000124763,0.00007367537,0.0001205393,0.01790527,0.003850791,0.9636963,0.001078869,0.01283962],"study_design_scores_gemma":[0.00007249488,0.00007094262,0.0001972355,0.00004367994,0.00002066938,0.0001201578,0.00007621048,0.1334339,0.002036385,0.8592226,0.00468204,0.00002376126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2251032,0.0008061072,0.7239157,0.0006721268,0.0003796285,0.0002330143,0.0003309629,0.0005138279,0.0480454],"genre_scores_gemma":[0.86575,0.0003616388,0.1208029,0.0002707351,0.0001296741,0.0003621444,0.0003103067,0.0000950637,0.01191758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006312474,"threshold_uncertainty_score":0.02111727,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011228,0.0003152974,0.0009811929,0.0005563765,0.0008727949,0.001589779,0.001625839,0.001121821,0.003744712],"category_scores_gemma":[0.005834402,0.0005605593,0.0007543356,0.0006173942,0.002156288,0.00221418,0.002100292,0.0020011,0.0005819977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000798467,"about_ca_system_score_gemma":0.0005586434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007423993,"about_ca_topic_score_gemma":0.0007830909,"domain_scores_codex":[0.9991952,0.0002888265,0.00004047174,0.0001415694,0.000218476,0.0001154601],"domain_scores_gemma":[0.9969085,0.002252298,0.0001144252,0.0004306461,0.0001780399,0.0001161031],"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.0001178223,0.0000324613,0.0001894828,0.00007989777,0.00001294418,0.00005145685,0.0001615774,0.02372088,0.004206254,0.9500592,0.001109473,0.02025847],"study_design_scores_gemma":[0.00001468223,0.00001896188,0.00007039955,0.00001219135,0.000007854997,0.00004386701,0.00002053536,0.0592907,0.002473091,0.9364752,0.001563111,0.000009349513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1412917,0.0007151508,0.8183103,0.0009921421,0.00009451597,0.00006858187,0.0001462654,0.0006884221,0.03769307],"genre_scores_gemma":[0.867866,0.0003604299,0.121351,0.0002100709,0.00007183589,0.0001520241,0.0002569242,0.0003876381,0.009344008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003744712,"threshold_uncertainty_score":0.01252735,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480127,0.0004579004,0.001335356,0.00145398,0.0008549755,0.001700709,0.001885349,0.001963658,0.003271535],"category_scores_gemma":[0.01689477,0.0005397728,0.001151307,0.001945998,0.001491357,0.00424842,0.002121557,0.001230382,0.0007668092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260372,"about_ca_system_score_gemma":0.002011301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003932812,"about_ca_topic_score_gemma":0.003898408,"domain_scores_codex":[0.9974753,0.000617101,0.0002215424,0.0006864103,0.0007919234,0.0002077357],"domain_scores_gemma":[0.9906436,0.006344633,0.0003282606,0.001959032,0.0005986823,0.0001257041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009832468,0.0002788561,0.003707501,0.0003928674,0.0002115165,0.0009871289,0.0008253571,0.4315696,0.01890913,0.2432854,0.004253461,0.294596],"study_design_scores_gemma":[0.00003224006,0.00005712172,0.0003484056,0.00002265714,0.0000382535,0.0001474016,0.00007876665,0.7704337,0.007565314,0.2199547,0.001303604,0.00001771837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07982592,0.0001957708,0.9155418,0.0002742441,0.0000780832,0.00006990701,0.0003428264,0.001954576,0.001716871],"genre_scores_gemma":[0.6845078,0.0001388496,0.311034,0.0001672233,0.00005197428,0.0001464239,0.000894751,0.0003720667,0.002686982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003932812,"threshold_uncertainty_score":0.01094431,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006554837,0.0009617374,0.001633685,0.002769509,0.002557628,0.004742908,0.002814384,0.003062234,0.02015571],"category_scores_gemma":[0.0536829,0.0009337047,0.0021206,0.003159761,0.004989357,0.01808921,0.004978907,0.005471168,0.001731986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001673738,"about_ca_system_score_gemma":0.001724249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001377372,"about_ca_topic_score_gemma":0.001424825,"domain_scores_codex":[0.9965183,0.001089437,0.0003760034,0.0008348471,0.0008393817,0.0003420799],"domain_scores_gemma":[0.9507023,0.0387666,0.001269214,0.003751551,0.004171296,0.001338993],"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.00006198083,0.0000378402,0.000290853,0.0000896477,0.00001128614,0.00008986812,0.0001534264,0.0009647388,0.0002539293,0.9851183,0.004220488,0.008707814],"study_design_scores_gemma":[0.00002794795,0.00001913284,0.0001510019,0.00002784242,0.00001254206,0.000104641,0.00005771146,0.01124261,0.000415644,0.9852149,0.002713113,0.00001283882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04915608,0.002474113,0.8538113,0.01147558,0.0008779618,0.0003092945,0.001983527,0.001077097,0.07883509],"genre_scores_gemma":[0.7274346,0.003503174,0.2293498,0.004363764,0.004181703,0.001738739,0.00410079,0.0008814477,0.02444601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02015571,"threshold_uncertainty_score":0.06742752,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454814,0.001161787,0.001339585,0.00137429,0.003599758,0.002771893,0.003092925,0.003040258,0.04342704],"category_scores_gemma":[0.00460634,0.0003776453,0.001257669,0.0009150059,0.004181628,0.01011904,0.00362615,0.003938416,0.007248966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337134,"about_ca_system_score_gemma":0.0005832813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002769856,"about_ca_topic_score_gemma":0.001435687,"domain_scores_codex":[0.9984415,0.0003386576,0.0000689961,0.0002692816,0.0006211888,0.0002602893],"domain_scores_gemma":[0.9985097,0.0006727677,0.00006698538,0.0003354769,0.0002822977,0.0001326464],"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.00004013316,0.00001789315,0.00006237692,0.0001073133,0.000006499868,0.0002024573,0.0001889516,0.00057208,0.0008020175,0.9648938,0.02594821,0.00715825],"study_design_scores_gemma":[0.00001674093,0.00001554845,0.0001469291,0.00004077642,0.000005851414,0.0001663525,0.0001776672,0.002590958,0.001478573,0.9012227,0.09411538,0.00002253447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.01662364,0.005449654,0.3481313,0.1374695,0.02028858,0.0002262553,0.001212267,0.001573452,0.4690254],"genre_scores_gemma":[0.4230267,0.006006981,0.1399577,0.03855525,0.01522412,0.0009502132,0.001317554,0.00187106,0.3730904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.04342704,"threshold_uncertainty_score":0.145278,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009418529,0.0004891859,0.0009134936,0.001426818,0.001291968,0.001862384,0.001160877,0.001158358,0.01167462],"category_scores_gemma":[0.004055216,0.000393702,0.001384674,0.001158165,0.002435282,0.005511772,0.002512955,0.001735032,0.001574376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006954753,"about_ca_system_score_gemma":0.0006152713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004919073,"about_ca_topic_score_gemma":0.0004278582,"domain_scores_codex":[0.9993648,0.0001371139,0.00004484797,0.0001919958,0.0001774948,0.00008384428],"domain_scores_gemma":[0.9980513,0.001005453,0.000131405,0.0003917802,0.0002888778,0.0001312309],"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.00002781766,0.00001414811,0.00008208981,0.00005265083,0.000005852001,0.0001195668,0.0001554581,0.001007384,0.001142944,0.9879032,0.001152654,0.008336314],"study_design_scores_gemma":[0.000009018369,0.00001713411,0.00009430405,0.00001100647,0.00000573523,0.00009391319,0.00002115021,0.006319903,0.0004760317,0.9887723,0.004167778,0.00001173587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1212493,0.002197041,0.6828035,0.00356063,0.001335362,0.00008909564,0.0003544394,0.0005326365,0.187878],"genre_scores_gemma":[0.8501492,0.002280259,0.0875165,0.001726408,0.002339556,0.0001809914,0.0003587528,0.0003110885,0.05513731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01167462,"threshold_uncertainty_score":0.03905547,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003279932,0.001124896,0.002667131,0.001584021,0.001727199,0.003218284,0.003018074,0.004777933,0.01530262],"category_scores_gemma":[0.03166251,0.0009050593,0.000964504,0.003174733,0.002839073,0.008724076,0.00305159,0.003842153,0.0012781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002045574,"about_ca_system_score_gemma":0.00242075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01001794,"about_ca_topic_score_gemma":0.009678677,"domain_scores_codex":[0.9978793,0.0008206102,0.0001051387,0.0003522578,0.0005045056,0.0003382032],"domain_scores_gemma":[0.9803812,0.01660783,0.0005014937,0.001043151,0.0009234211,0.0005430066],"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.001269794,0.0004743077,0.002091864,0.0006280561,0.0001203647,0.0003040872,0.0005532758,0.2169596,0.0009304774,0.5541279,0.05206606,0.1704742],"study_design_scores_gemma":[0.0001596248,0.00005287031,0.0002510729,0.00005553346,0.00004083713,0.00006339544,0.00006416928,0.4873809,0.0003209802,0.5083214,0.003269065,0.00002027245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09645324,0.003897808,0.845377,0.01292892,0.0005552114,0.0002520276,0.0008519402,0.001120874,0.03856304],"genre_scores_gemma":[0.5731719,0.002696469,0.3659486,0.001853779,0.001281389,0.0003904994,0.001565696,0.0009162216,0.05217557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01530262,"threshold_uncertainty_score":0.0511924,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009711919,0.00120973,0.001354873,0.00261793,0.002044726,0.006444969,0.006688212,0.00279223,0.004973465],"category_scores_gemma":[0.02703765,0.002416932,0.004455931,0.001799849,0.01076132,0.021112,0.01041698,0.009784448,0.0006342364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002555918,"about_ca_system_score_gemma":0.001361485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00129246,"about_ca_topic_score_gemma":0.00141056,"domain_scores_codex":[0.9924821,0.002481224,0.0005939957,0.001488955,0.002438789,0.0005147841],"domain_scores_gemma":[0.9743817,0.0172309,0.001163973,0.005083516,0.001471655,0.000668171],"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.00001483172,0.00001279818,0.00006762279,0.00005504997,0.00001529426,0.00006459705,0.0002318082,0.00344966,0.0006608007,0.9928341,0.0001344641,0.002458951],"study_design_scores_gemma":[0.00001286828,0.00001636297,0.00004902995,0.00002325332,0.0000244809,0.00006929792,0.00005308433,0.01592566,0.000739245,0.9809625,0.0021078,0.00001628004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01135003,0.0005633491,0.9722181,0.001777902,0.00006135544,0.00007182187,0.0001599514,0.0002432832,0.01355415],"genre_scores_gemma":[0.5981922,0.001577766,0.3904895,0.0006334907,0.0004240731,0.0003817096,0.0003841275,0.0003122496,0.007604817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009711919,"threshold_uncertainty_score":0.05136216,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003762758,0.001611162,0.003162228,0.002110254,0.003543448,0.006181754,0.007131618,0.003589164,0.02181041],"category_scores_gemma":[0.01969157,0.001392372,0.004621562,0.004445618,0.00725595,0.02938908,0.008487346,0.01229058,0.001847892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004001747,"about_ca_system_score_gemma":0.002133531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001353732,"about_ca_topic_score_gemma":0.001558295,"domain_scores_codex":[0.992156,0.001371538,0.0004849538,0.0022658,0.002726665,0.0009950137],"domain_scores_gemma":[0.9752435,0.01794859,0.0007690315,0.004292362,0.001085139,0.0006613345],"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.0003671949,0.0001630807,0.0006927953,0.0004357664,0.00008886913,0.0002344737,0.0005402307,0.007795211,0.002004106,0.956744,0.007204612,0.02372961],"study_design_scores_gemma":[0.00004156823,0.00002917289,0.000235351,0.00002389502,0.00006918066,0.0001405888,0.00005671266,0.01300055,0.001247585,0.9820701,0.003060738,0.00002457191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1608737,0.001955615,0.7168034,0.009911763,0.0006638365,0.0003895692,0.002074083,0.002654932,0.104673],"genre_scores_gemma":[0.8577325,0.001249823,0.1087341,0.002286548,0.001107718,0.0005233453,0.002379927,0.001102198,0.02488389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02181041,"threshold_uncertainty_score":0.07296312,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005423422,0.0007975237,0.001101098,0.001335875,0.001825992,0.004467356,0.002672632,0.002233365,0.003952887],"category_scores_gemma":[0.02146793,0.001135073,0.001880565,0.00132714,0.005257831,0.01178438,0.006096507,0.004820574,0.0004841746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001779104,"about_ca_system_score_gemma":0.002187333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002166072,"about_ca_topic_score_gemma":0.002553871,"domain_scores_codex":[0.9949202,0.001372048,0.0005182018,0.0008533375,0.001581611,0.0007546418],"domain_scores_gemma":[0.9702362,0.02325233,0.001313245,0.002853319,0.001667081,0.0006778932],"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.0002170631,0.00007031159,0.001392122,0.0002769143,0.00005637042,0.001176923,0.001391878,0.09240966,0.009243797,0.8687634,0.0007308917,0.02427063],"study_design_scores_gemma":[0.00003178613,0.00002105488,0.00008057624,0.00003348526,0.00003964258,0.0001094661,0.0001135783,0.1530357,0.006406936,0.8385032,0.001601085,0.00002353447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04855588,0.0001636007,0.9471607,0.0003484671,0.00006173538,0.00004899989,0.00008522261,0.001174231,0.002401146],"genre_scores_gemma":[0.7492532,0.0002811322,0.2449786,0.0001809542,0.00009612492,0.0001227596,0.0003365681,0.000413275,0.004337482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005423422,"threshold_uncertainty_score":0.02868217,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01006977,0.001427007,0.003178222,0.003087219,0.005444186,0.01258048,0.006485983,0.005875914,0.01188303],"category_scores_gemma":[0.06829184,0.002011697,0.007239481,0.005058376,0.01156583,0.03408039,0.007122403,0.01458471,0.0007922167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007022583,"about_ca_system_score_gemma":0.005773006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005716029,"about_ca_topic_score_gemma":0.004802931,"domain_scores_codex":[0.9873768,0.004098884,0.0009362189,0.003133518,0.002632441,0.001822176],"domain_scores_gemma":[0.7790489,0.2052806,0.00412148,0.007196721,0.002103868,0.002248476],"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.0008920531,0.0006931169,0.004459341,0.0008789914,0.0002769851,0.0006648613,0.001960663,0.0539103,0.001979849,0.8924438,0.008645696,0.03319435],"study_design_scores_gemma":[0.00007902891,0.00002602126,0.0003735898,0.00003083742,0.00005561248,0.0001324394,0.0001702446,0.05620015,0.001000628,0.9409392,0.0009590967,0.00003304362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.425691,0.003999454,0.479607,0.03722586,0.0005213727,0.0005798713,0.003044582,0.001376441,0.04795437],"genre_scores_gemma":[0.8825103,0.001867031,0.09682773,0.001823858,0.001372852,0.0004722221,0.002886731,0.0004986908,0.01174071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01258048,"threshold_uncertainty_score":0.05325466,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006082974,0.0007487979,0.001435793,0.004164753,0.001948905,0.006241108,0.002268548,0.002001048,0.008232515],"category_scores_gemma":[0.05680115,0.001355902,0.001532112,0.002482342,0.004958941,0.01333436,0.001890389,0.003779391,0.0006894042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00315372,"about_ca_system_score_gemma":0.001690774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001089984,"about_ca_topic_score_gemma":0.0009278919,"domain_scores_codex":[0.9960496,0.0009620473,0.0003749717,0.0009959273,0.00104602,0.0005714708],"domain_scores_gemma":[0.8531241,0.1175547,0.0100177,0.008499309,0.00634117,0.004462994],"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.0001279903,0.00005530921,0.002433797,0.0001023586,0.00002159142,0.00009151687,0.0007344249,0.008378841,0.003770338,0.9768139,0.0004551065,0.007014902],"study_design_scores_gemma":[0.00002558362,0.00003569402,0.001153214,0.00003892044,0.00002407963,0.0002465461,0.0001831673,0.05390105,0.002976738,0.9403604,0.001013637,0.00004108267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.659701,0.001155145,0.3137764,0.002077283,0.0001049594,0.0001396348,0.001214867,0.0007100635,0.02112065],"genre_scores_gemma":[0.9675688,0.0004905333,0.02744775,0.0001020522,0.0001714671,0.0002119799,0.0004307174,0.0002330254,0.003343625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008232515,"threshold_uncertainty_score":0.03217018,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001694166,0.0008551173,0.002505892,0.001524149,0.001294959,0.003564651,0.001837321,0.001933365,0.007170592],"category_scores_gemma":[0.01356604,0.000868505,0.001369539,0.001865106,0.003431983,0.003601913,0.002627467,0.00171161,0.0006105569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001444381,"about_ca_system_score_gemma":0.001626303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005262135,"about_ca_topic_score_gemma":0.004626542,"domain_scores_codex":[0.9986039,0.0005096594,0.00006025301,0.0002163981,0.0002701171,0.0003397589],"domain_scores_gemma":[0.9912556,0.006370353,0.0007130066,0.0004308606,0.0004100103,0.0008200374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001647371,0.0002457825,0.008892687,0.0003572546,0.0001137459,0.0003201381,0.0006232712,0.537872,0.00502136,0.4017516,0.005250765,0.03790394],"study_design_scores_gemma":[0.0002038267,0.0003182142,0.003857065,0.00005531053,0.00007120534,0.0002300645,0.0004526738,0.5919722,0.002590138,0.397096,0.003115172,0.00003801912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7789997,0.001419608,0.1714725,0.001700754,0.0001006717,0.0001190898,0.000585934,0.000250555,0.04535124],"genre_scores_gemma":[0.9503621,0.0005534561,0.04274348,0.00009158396,0.00009606836,0.0001158104,0.000451106,0.0002416893,0.005344614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007170592,"threshold_uncertainty_score":0.02398801,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235288,0.0005252496,0.0009756372,0.002002762,0.0008428583,0.001943607,0.001588798,0.0009465808,0.003938964],"category_scores_gemma":[0.01008032,0.0007816029,0.001448003,0.001083165,0.0008252469,0.005252472,0.001951464,0.00233858,0.000968689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007882783,"about_ca_system_score_gemma":0.001183396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001481219,"about_ca_topic_score_gemma":0.00377027,"domain_scores_codex":[0.998839,0.0002495115,0.000134062,0.0004096355,0.0002595952,0.0001082374],"domain_scores_gemma":[0.9911712,0.004516635,0.0005718064,0.002100703,0.001227865,0.0004118285],"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.000866498,0.0005143026,0.02871091,0.0008008169,0.0002135637,0.0007210161,0.000796436,0.02185209,0.03543212,0.1182956,0.02324579,0.7685509],"study_design_scores_gemma":[0.00008569779,0.0001044929,0.00447587,0.0001508975,0.00009165255,0.0007426063,0.0004122184,0.6642105,0.01699009,0.3009797,0.0117179,0.00003836654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3062166,0.0008792593,0.6717965,0.001521528,0.000167575,0.0002572289,0.002351722,0.00817338,0.008636124],"genre_scores_gemma":[0.7159927,0.0004070577,0.2707729,0.0003877312,0.0001188071,0.0002149491,0.005992186,0.001053387,0.005060273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003938964,"threshold_uncertainty_score":0.01317716,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008000167,0.0007236818,0.001390018,0.002758308,0.002835063,0.008660678,0.002653699,0.002872851,0.009929375],"category_scores_gemma":[0.01769506,0.00116205,0.003303413,0.001749035,0.008674558,0.02234502,0.007711113,0.008871674,0.001288173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002353038,"about_ca_system_score_gemma":0.001706838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000888692,"about_ca_topic_score_gemma":0.000716402,"domain_scores_codex":[0.9925621,0.002734775,0.0006905625,0.001431188,0.001918202,0.000663184],"domain_scores_gemma":[0.9866282,0.007197404,0.0007876087,0.002657193,0.002004742,0.0007248605],"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.000007865699,0.000005740839,0.00004322461,0.00001222247,0.000003849133,0.00002472093,0.00007066489,0.0002811441,0.00008367132,0.9978111,0.0002560036,0.001399712],"study_design_scores_gemma":[0.000004561326,0.000003793059,0.00002324661,0.000007300721,0.000005032631,0.00004003872,0.00002127946,0.002703091,0.0001190555,0.9955015,0.001566054,0.000005043355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02099787,0.00076215,0.9315302,0.005183999,0.0003884339,0.0000644375,0.0003732376,0.0002891802,0.04041053],"genre_scores_gemma":[0.6940266,0.001063951,0.2866617,0.00246897,0.001386559,0.0002768146,0.0007716709,0.0002480756,0.01309563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009929375,"threshold_uncertainty_score":0.0423094,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004919099,0.00108234,0.00219013,0.001629012,0.002365744,0.007005503,0.003166006,0.002936743,0.02594076],"category_scores_gemma":[0.03189985,0.0009165294,0.002519627,0.002221178,0.003498182,0.01452537,0.004354854,0.00450438,0.001906025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005395846,"about_ca_system_score_gemma":0.006568772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004497572,"about_ca_topic_score_gemma":0.005711645,"domain_scores_codex":[0.9913568,0.002438798,0.0004723688,0.001308906,0.002978523,0.001444441],"domain_scores_gemma":[0.9510012,0.0382347,0.001639504,0.005628774,0.002173866,0.00132197],"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.0006758948,0.000174382,0.001719565,0.0004783263,0.00009756978,0.0001840525,0.0007132654,0.04944695,0.002830542,0.8967043,0.010677,0.03629809],"study_design_scores_gemma":[0.00006797593,0.00002136735,0.0001865316,0.00002887528,0.00003682306,0.00006825806,0.00005692475,0.08275544,0.001100828,0.9141338,0.001521073,0.00002217078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3333544,0.002488503,0.5998474,0.01244643,0.0005023463,0.0004670005,0.003961657,0.00260467,0.04432753],"genre_scores_gemma":[0.9252646,0.0006811306,0.05885917,0.0008119564,0.0003554452,0.0003252917,0.001473132,0.0005850604,0.01164417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02594076,"threshold_uncertainty_score":0.08678043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}