{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":14,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":14,"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":"1ca8e3933452","filters":{"venue":"Journal of Mathematical Modelling and Algorithms"}},"results":[{"id":"W2001157763","doi":"10.1023/b:jmma.0000026709.24659.da","title":"A General Approach for Constraint Solving by Local Search","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Guided Local Search; Tabu search; Constraint programming; Mathematical optimization; Constraint (computer-aided design); Set (abstract data type); Computer science; Local search (optimization); Constraint satisfaction; Resolution (logic); Mathematics; Artificial intelligence; Stochastic programming","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Jin‐Kao Hao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03257880984352848,"gpt":0.2623488479533102,"spread":0.2297700381097817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084425,0.001433259,0.002012935,0.001718272,0.001308899,0.002075166,0.005165814,0.00235851,0.01125226],"category_scores_gemma":[0.006865683,0.001016514,0.002393596,0.003683547,0.002338839,0.00391646,0.003666231,0.004081358,0.002874718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028434,"about_ca_system_score_gemma":0.001563523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004196543,"about_ca_topic_score_gemma":0.005403104,"domain_scores_codex":[0.9984369,0.000533907,0.00007728465,0.0002867235,0.0005719324,0.00009333206],"domain_scores_gemma":[0.9985337,0.0007856243,0.00006403206,0.0003121919,0.0002534689,0.00005096193],"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.00004020459,0.00006602396,0.0001815568,0.000395507,0.0001241539,0.0001246222,0.0002375017,0.2641504,0.002656066,0.6285625,0.007175711,0.09628583],"study_design_scores_gemma":[0.0000345744,0.00003652781,0.00005391215,0.00004275712,0.00003892271,0.00009259625,0.00003288931,0.6846849,0.0008681284,0.3009865,0.0131012,0.00002706172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002540245,0.00008474146,0.9974983,0.00009246083,0.00001886869,0.00002400987,0.00001615344,0.00008273778,0.001928607],"genre_scores_gemma":[0.03121635,0.0005554345,0.9605497,0.0002235386,0.0001129795,0.000445664,0.0001283646,0.0002818886,0.006486087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01125226,"threshold_uncertainty_score":0.03764254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002282904","doi":"10.1023/b:jmma.0000038618.37710.f8","title":"Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Ministero dell'Università e della Ricerca","keywords":"Arc routing; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Routing (electronic design automation); Constructive; Set (abstract data type); Computer science; Upper and lower bounds; Arc (geometry); Vehicle routing problem; Mathematics; Algorithm; Process (computing)","authors":[{"name":"Gianpaolo Ghiani","is_ca":false},{"name":"Francesca Guerriero","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Roberto Musmanno","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05607874453509868,"gpt":0.2693621043498414,"spread":0.2132833598147428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003172194,0.001231978,0.002058827,0.002726231,0.001357629,0.002173036,0.002983925,0.003114529,0.01031915],"category_scores_gemma":[0.007970089,0.001528531,0.001459798,0.005027626,0.001645295,0.002853312,0.001124906,0.002198913,0.001208007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002477306,"about_ca_system_score_gemma":0.003081487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01494226,"about_ca_topic_score_gemma":0.01625196,"domain_scores_codex":[0.9983836,0.001001672,0.00004977102,0.0001245177,0.0001558208,0.000284604],"domain_scores_gemma":[0.9926806,0.006186879,0.0003383229,0.0002803004,0.0003265697,0.0001872953],"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.0002224099,0.0001344763,0.0002693602,0.0001226424,0.00005571781,0.00004842649,0.00006980779,0.9441907,0.0002503853,0.01185054,0.005091545,0.03769402],"study_design_scores_gemma":[0.0001253764,0.00007611936,0.0001267774,0.00002975954,0.00002987272,0.00001988087,0.00004578044,0.983829,0.0002061477,0.01426524,0.001232342,0.00001371093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1076144,0.003564182,0.8584298,0.001136598,0.0003287075,0.0006795755,0.001469288,0.002900151,0.02387731],"genre_scores_gemma":[0.3883056,0.00130589,0.5991306,0.0004307363,0.0001458421,0.0008529165,0.001325356,0.0006675563,0.007835451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01494226,"threshold_uncertainty_score":0.03452098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019705613","doi":"10.1007/s10852-010-9134-0","title":"Mathematical Analysis of an HIV/AIDS Model: Impact of Educational Programs and Abstinence in Sub-Saharan Africa","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Adolescent Sexual and Reproductive Health","field":"Health Professions","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Human immunodeficiency virus (HIV); Abstinence; Affect (linguistics); Resource (disambiguation); Antiretroviral therapy; Sexual abstinence; Medicine; Psychology; Social psychology; Demography; Family medicine; Computer science; Environmental health; Psychiatry; Sociology; Research methodology; Population; Viral load; Family planning; Communication","authors":[{"name":"C. P. Bhunu","is_ca":false},{"name":"Steady Mushayabasa","is_ca":false},{"name":"Hristo V. Kojouharov","is_ca":false},{"name":"Jean M. Tchuenche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09691485799688777,"gpt":0.4237884310873098,"spread":0.3268735730904221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001804479,0.001043208,0.001935024,0.001194535,0.001265823,0.002179452,0.001987651,0.002903042,0.006480283],"category_scores_gemma":[0.009898429,0.0007886555,0.00149612,0.0008901627,0.00196985,0.001657915,0.001891015,0.00217741,0.0003635677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002640172,"about_ca_system_score_gemma":0.003202166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.06631476,"about_ca_topic_score_gemma":0.02550455,"domain_scores_codex":[0.9994436,0.0002690839,0.00001431606,0.00004993889,0.00004820095,0.0001747723],"domain_scores_gemma":[0.9931219,0.005472152,0.0005019697,0.00007635901,0.0004834329,0.0003442044],"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.00005857921,0.00005919426,0.001375842,0.0000437968,0.00003268166,0.0001410613,0.00006420343,0.967952,0.0001500665,0.0284226,0.0008672916,0.0008325317],"study_design_scores_gemma":[0.00002690942,0.00001620358,0.0002709597,0.000008237945,0.00002019796,0.00002050414,0.00006981836,0.9946233,0.00003828631,0.004658736,0.000238158,0.000008708775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7895647,0.003624179,0.1450731,0.01425737,0.0003443714,0.0002224587,0.001886497,0.0002132872,0.04481399],"genre_scores_gemma":[0.9752744,0.001152818,0.006852877,0.0003512764,0.0001228223,0.0001479649,0.0003401412,0.00006367241,0.01569418],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06631476,"threshold_uncertainty_score":0.1318575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072147873","doi":"10.1007/s10852-006-9043-4","title":"Mathematical Model of Ice Melting on Transmission Lines","year":2006,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Icing and De-icing Technologies","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; Memorial University of Newfoundland","funders":"","keywords":"Melting pot; Electric power transmission; Transmission (telecommunications); Computer science; Geology; Chemistry; Geography; Telecommunications; Archaeology","authors":[{"name":"Sergey Sadov","is_ca":true},{"name":"P. N. Shivakumar","is_ca":true},{"name":"D. Firsov","is_ca":true},{"name":"S. H. Lui","is_ca":true},{"name":"Ruppa K. Thulasiram","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02682921616390199,"gpt":0.2345726268257732,"spread":0.2077434106618712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013427,0.0007680258,0.001081248,0.001083177,0.000765649,0.001695828,0.001824179,0.002467585,0.004943122],"category_scores_gemma":[0.002459883,0.0006087347,0.0007907652,0.00101977,0.001627796,0.001983139,0.001079408,0.00135347,0.0005249302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001292742,"about_ca_system_score_gemma":0.00101514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01160381,"about_ca_topic_score_gemma":0.004771269,"domain_scores_codex":[0.9997842,0.00006753139,0.00001188201,0.00004209234,0.00005612897,0.00003820844],"domain_scores_gemma":[0.9993131,0.0003559871,0.00009735533,0.00003590921,0.000157445,0.00004021767],"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.00001514969,0.00001613633,0.0001797766,0.00002896573,0.00001062531,0.0000824173,0.00004420218,0.9545698,0.0007032241,0.04272265,0.0004059825,0.001221128],"study_design_scores_gemma":[0.000006340635,0.000005314898,0.00005263842,0.000003638042,0.000003663146,0.00001707593,0.00001118384,0.9915199,0.00007932157,0.008030513,0.0002654839,0.000004935328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1184159,0.00172659,0.8200248,0.001933291,0.0003268143,0.0001046389,0.0005994181,0.0003083058,0.05656015],"genre_scores_gemma":[0.9451453,0.001197426,0.0164521,0.0001673173,0.0001462417,0.000150017,0.0002792641,0.0001107859,0.03635155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01160381,"threshold_uncertainty_score":0.02307254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979684104","doi":"10.1007/s10852-008-9100-2","title":"Principles for the Design of Large Neighborhood Search","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":28,"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":"Heuristics; Mathematical optimization; Computer science; Set (abstract data type); Constraint programming; Scheduling (production processes); Job shop scheduling; Constraint (computer-aided design); Mathematics; Stochastic programming; Schedule","authors":[{"name":"Tom Carchrae","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07347995078575735,"gpt":0.2978228350086319,"spread":0.2243428842228745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002579875,0.0006786369,0.001352169,0.00110874,0.0009991095,0.00169835,0.003134897,0.001382641,0.004715831],"category_scores_gemma":[0.009092733,0.0007621446,0.0009458894,0.001247894,0.001992015,0.002508073,0.002451765,0.002219178,0.001101413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116899,"about_ca_system_score_gemma":0.001527851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002236277,"about_ca_topic_score_gemma":0.003125795,"domain_scores_codex":[0.9987198,0.0005089685,0.00006982341,0.0001485595,0.0004870707,0.00006584824],"domain_scores_gemma":[0.9978137,0.001194789,0.000129882,0.000319269,0.0004472346,0.00009502172],"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.00002999495,0.00003608626,0.0001829559,0.0001194691,0.00003177957,0.00004121636,0.0001110741,0.1818761,0.001297344,0.7722088,0.002774924,0.04129024],"study_design_scores_gemma":[0.00003112773,0.00004815345,0.00007532744,0.000040481,0.00001357934,0.00006387216,0.00002751074,0.7095341,0.0006565318,0.2756777,0.01381497,0.00001653327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007930325,0.0001992493,0.9964228,0.00008115156,0.00002466065,0.00003351009,0.00001745639,0.00006333429,0.002364726],"genre_scores_gemma":[0.09939633,0.0008130479,0.8916273,0.0001771759,0.0001074788,0.0008362095,0.0001272793,0.0002389743,0.006676222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004715831,"threshold_uncertainty_score":0.01577604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061006016","doi":"10.1007/s10852-004-3519-x","title":"Parallel Computation and Measurement Uncertainty in Nonlinear Dynamical Systems","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Nonlinear Dynamics and Pattern Formation","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":"Queen's University","funders":"","keywords":"Nonlinear system; Computation; State variable; Control theory (sociology); State (computer science); Variable (mathematics); Nonlinear dynamical systems; Dynamical systems theory; Dynamical system (definition); Computer science; Applied mathematics; Physical system; Mathematics; Statistical physics; Algorithm; Physics; Mathematical analysis; Thermodynamics; Artificial intelligence; Control (management)","authors":[{"name":"Selim G. Akl","is_ca":true},{"name":"Weiguang Yao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03752290115610688,"gpt":0.2598546122589003,"spread":0.2223317111027934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002650478,0.0007289994,0.001693704,0.0007215563,0.001039947,0.002090785,0.001203366,0.001058946,0.001700423],"category_scores_gemma":[0.01570417,0.0008201028,0.0006109285,0.001218262,0.002199276,0.00355174,0.00248211,0.001664709,0.0002435241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001148867,"about_ca_system_score_gemma":0.001379102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005423542,"about_ca_topic_score_gemma":0.003651487,"domain_scores_codex":[0.9985239,0.0005088293,0.0001186274,0.0002623737,0.0004666756,0.0001195417],"domain_scores_gemma":[0.9927637,0.00510742,0.0003974699,0.0009084468,0.0007084079,0.000114454],"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.0002515869,0.00003891323,0.0008296152,0.00008196727,0.00006041121,0.0001071142,0.00008306598,0.8511633,0.001092137,0.1109159,0.0007862575,0.03458962],"study_design_scores_gemma":[0.000007089717,0.000006131188,0.00008367782,0.000002648991,0.000004776718,0.00001057054,0.000005383387,0.9341136,0.0002950233,0.06525866,0.0002079037,0.000004517868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.033627,0.0007047234,0.9620361,0.0008703301,0.0001460071,0.00002402254,0.00005596136,0.0002063957,0.002329363],"genre_scores_gemma":[0.9101117,0.0008055874,0.08583657,0.0001304242,0.0002174185,0.00008931554,0.0001158155,0.0001086424,0.002584568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005423542,"threshold_uncertainty_score":0.01401728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970647354","doi":"10.1007/s10852-006-9042-5","title":"An Interval-Parameter Fuzzy Approach for Multiobjective Linear Programming Under Uncertainty","year":2006,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Water resources management and optimization","field":"Engineering","cited_by":11,"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":"Interval (graph theory); Mathematical optimization; Fuzzy logic; Goal programming; Linear programming; Pareto principle; Computer science; Preference; Mathematics; Artificial intelligence; Statistics","authors":[{"name":"Simon Wu","is_ca":true},{"name":"Guohe Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02529634040296552,"gpt":0.2452207822065231,"spread":0.2199244418035576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001798792,0.0009588909,0.001390259,0.0008415041,0.0005046995,0.001624771,0.001790252,0.001677916,0.003252791],"category_scores_gemma":[0.00393165,0.0006211655,0.001209605,0.001306367,0.0007782703,0.00219777,0.001122154,0.001804257,0.0003263424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001133818,"about_ca_system_score_gemma":0.0007691027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003363033,"about_ca_topic_score_gemma":0.00274569,"domain_scores_codex":[0.9993517,0.0002515337,0.0000349432,0.00009224923,0.0002245408,0.00004506845],"domain_scores_gemma":[0.9990766,0.0006509313,0.00005954379,0.00004244216,0.0001407215,0.0000296463],"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.00003270346,0.00004059742,0.0001128416,0.00008911052,0.0000510413,0.00006289542,0.00007355934,0.921092,0.0009231739,0.04347838,0.0005736629,0.03347005],"study_design_scores_gemma":[0.000005859954,0.00001398042,0.00002156074,0.00001016447,0.00000915817,0.000009495167,0.00000664009,0.9838059,0.00008926075,0.01563369,0.0003885281,0.000005819233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003811682,0.0002781999,0.9935809,0.0001054234,0.00003265694,0.00002097922,0.00002432233,0.00003473404,0.002111187],"genre_scores_gemma":[0.4262857,0.0008418416,0.5685909,0.0001711334,0.0001596439,0.0002928914,0.0001018683,0.00009948568,0.00345646],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003363033,"threshold_uncertainty_score":0.01088172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071404612","doi":"10.1007/s10852-005-9036-8","title":"Mesh Simplification Using an Area-Based Distortion Measure","year":2006,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Computer Graphics and Visualization Techniques","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":"McMaster University","funders":"","keywords":"Distortion (music); Vertex (graph theory); Polygon (computer graphics); Algorithm; Computation; Mathematics; Measure (data warehouse); Computer science; Mathematical optimization; Combinatorics; Graph; Data mining","authors":[{"name":"Insu Park","is_ca":true},{"name":"Shahram Shirani","is_ca":true},{"name":"David W. Capson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0665257566991924,"gpt":0.2987156077922042,"spread":0.2321898510930118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001607783,0.0008382382,0.001211369,0.002619398,0.0004749342,0.002357617,0.001295436,0.0009968128,0.002347994],"category_scores_gemma":[0.007142403,0.0005411225,0.001179968,0.001710078,0.001005493,0.002183069,0.001670268,0.00102953,0.0004982539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008872806,"about_ca_system_score_gemma":0.0005436544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001403514,"about_ca_topic_score_gemma":0.001659784,"domain_scores_codex":[0.9983659,0.000299312,0.0001218059,0.0002219894,0.0009103206,0.00008065275],"domain_scores_gemma":[0.9966776,0.00119703,0.0003254733,0.0007294466,0.0009286636,0.0001418295],"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.000850659,0.0001942566,0.00324714,0.0005590625,0.0002971597,0.0002864704,0.0002866986,0.3403998,0.109566,0.101403,0.004642598,0.4382672],"study_design_scores_gemma":[0.00004194348,0.0001820295,0.001160811,0.00002302573,0.00007713474,0.0004358726,0.00003771158,0.9628136,0.02235713,0.008496126,0.004320039,0.00005454186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0218921,0.0005403792,0.974979,0.0001595793,0.0001290645,0.00004603212,0.00005768785,0.0003172765,0.001878992],"genre_scores_gemma":[0.4417536,0.001038509,0.5524728,0.00008751568,0.00018915,0.0000734648,0.0001727941,0.000534226,0.003677874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002619398,"threshold_uncertainty_score":0.008502841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1549928317","doi":"10.1023/a:1021666512528","title":"Aperture-Angle Optimization Problems in Three Dimensions","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"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":"Combinatorics; Polyhedron; Mathematics; Regular polygon; Line segment; Point (geometry); Computational geometry; Line (geometry); Computation; Geometry; Algorithm","authors":[{"name":"Elsa Omaña-Pulido","is_ca":false},{"name":"Godfried T. Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04591818117153679,"gpt":0.2377815172724265,"spread":0.1918633361008897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116515,0.0007557437,0.001272663,0.0006378386,0.0004723771,0.001776457,0.0006825624,0.001910147,0.003552398],"category_scores_gemma":[0.00409522,0.0006200227,0.0008077318,0.000950432,0.00111499,0.001557628,0.00197302,0.001497169,0.0005375763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004374895,"about_ca_system_score_gemma":0.0006164006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001536917,"about_ca_topic_score_gemma":0.001078101,"domain_scores_codex":[0.9994438,0.0001937751,0.00004297029,0.00007843743,0.0001965402,0.0000443935],"domain_scores_gemma":[0.9977276,0.001691371,0.0001637877,0.0001112496,0.0002106492,0.00009543926],"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.0001168921,0.00006216382,0.0005386595,0.0002063075,0.00004112302,0.000118873,0.0001118403,0.8748241,0.003161668,0.06913834,0.002293198,0.04938681],"study_design_scores_gemma":[0.00002477255,0.00002886003,0.0001417919,0.0000191449,0.00001034799,0.0000621361,0.00004210787,0.9572013,0.001005738,0.03872942,0.002717605,0.00001672519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01370767,0.0006599698,0.977413,0.000328805,0.0001116436,0.00004013357,0.00009407049,0.00009800869,0.007546737],"genre_scores_gemma":[0.505964,0.002320283,0.4768507,0.0002939642,0.000261141,0.0002688926,0.0003773431,0.000401803,0.0132618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003552398,"threshold_uncertainty_score":0.01188397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118197096","doi":"10.1023/a:1021642308852","title":"A Two-Dimensional Ellipse–Rectangle Intersection Test","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ellipse; Convexity; Rectangle; Monotonic function; Simple (philosophy); Mathematics; Quadratic equation; Polynomial; Algorithm; Time complexity; Computer science; Mathematical optimization; Geometry; Mathematical analysis","authors":[{"name":"H. Ratschek","is_ca":false},{"name":"Jon Rokne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02015139002648595,"gpt":0.2358428518921702,"spread":0.2156914618656843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337404,0.0004986366,0.0009879392,0.0007584897,0.0007885074,0.001248903,0.001514127,0.002161891,0.01098684],"category_scores_gemma":[0.007704494,0.0003301014,0.0005606966,0.0008430961,0.001326805,0.002009413,0.003224084,0.0009530736,0.0007367079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004310466,"about_ca_system_score_gemma":0.0006338034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271983,"about_ca_topic_score_gemma":0.0005978519,"domain_scores_codex":[0.998792,0.0003464249,0.00005365096,0.0001784057,0.0004268957,0.0002026592],"domain_scores_gemma":[0.9963552,0.002289545,0.0002134391,0.0003853843,0.0004385438,0.0003179509],"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.007888978,0.001392386,0.01353013,0.0005119384,0.0003127053,0.003272756,0.0008396853,0.5353839,0.06032053,0.2651214,0.01221705,0.09920847],"study_design_scores_gemma":[0.0002677137,0.0007033469,0.003045187,0.00005658867,0.00005186661,0.0006401188,0.0003787184,0.9384705,0.02612519,0.02580849,0.004352156,0.0001001098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7027283,0.0003225571,0.2324048,0.0009210447,0.000280512,0.0001360567,0.0005130788,0.0005106341,0.06218296],"genre_scores_gemma":[0.9800837,0.00005260804,0.01487836,0.00008508619,0.0000192371,0.00003327067,0.0003418453,0.0000609413,0.004444825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01098684,"threshold_uncertainty_score":0.03675461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1480727810","doi":"10.1023/a:1015626820950","title":"Implicit Convex Polygons","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Partition (number theory); Regular polygon; Simple (philosophy); Computer science; Representation (politics); Combinatorics; Mathematics; Computer graphics; Time complexity; Computational geometry; Algorithm; Artificial intelligence; Geometry","authors":[{"name":"Francisco Gómez","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"Suneeta Ramaswami","is_ca":false},{"name":"Vera Sacristán","is_ca":false},{"name":"Godfried Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04273633534547535,"gpt":0.2520657650801522,"spread":0.2093294297346769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002347369,0.000625629,0.0006977687,0.0009335251,0.0006805728,0.001676814,0.00080658,0.0006868653,0.01483517],"category_scores_gemma":[0.001958746,0.000577366,0.0004564688,0.0008036991,0.0008295794,0.001819831,0.002151644,0.002129279,0.002801778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004121513,"about_ca_system_score_gemma":0.0003668785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009143845,"about_ca_topic_score_gemma":0.001331188,"domain_scores_codex":[0.999688,0.00004579878,0.00001267028,0.00004597856,0.0001828068,0.00002477504],"domain_scores_gemma":[0.9996209,0.0001015886,0.00002896748,0.0001170097,0.0001018258,0.00002965499],"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.00009017747,0.00005740476,0.000342592,0.0001484537,0.00001692062,0.0001456951,0.000216162,0.06475917,0.006641459,0.755568,0.01046133,0.1615527],"study_design_scores_gemma":[0.0000343815,0.00006003512,0.0003850249,0.00009845237,0.00002581143,0.0005234806,0.0001458721,0.432777,0.009255213,0.3934811,0.1631842,0.000029441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03777393,0.001316437,0.7864212,0.0005703844,0.0005669477,0.00009834118,0.0004743983,0.0004606789,0.1723178],"genre_scores_gemma":[0.5015705,0.002114953,0.3263252,0.0001836546,0.0002154135,0.0001334204,0.001248484,0.0009277288,0.1672805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01483517,"threshold_uncertainty_score":0.04962862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W60875001","doi":"10.1023/a:1015648719133","title":"Finding Specified Sections of Arrangements: 2D Results","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; McGill University; Queen's University; Carleton University","funders":"McGill University","keywords":"Computer science; Class (philosophy); Motion (physics); Line (geometry); Mathematics; Combinatorics; Geometry; Artificial intelligence","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"F. Hurtado","is_ca":false},{"name":"Henk Meijer","is_ca":true},{"name":"Seshan Ramaswami","is_ca":false},{"name":"David Rappaport","is_ca":true},{"name":"Vera Sacristán","is_ca":false},{"name":"Thomas C. Shermer","is_ca":true},{"name":"Godfried Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08735776650559834,"gpt":0.2715975922062917,"spread":0.1842398257006934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123816,0.001402702,0.001943068,0.002349789,0.001564526,0.003222697,0.002420645,0.002616211,0.0152702],"category_scores_gemma":[0.01105208,0.001799012,0.002101776,0.001857064,0.002980677,0.006142518,0.005840883,0.003103929,0.00241963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007991544,"about_ca_system_score_gemma":0.0006122713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001959373,"about_ca_topic_score_gemma":0.002228834,"domain_scores_codex":[0.9987805,0.0002407633,0.00009433096,0.0002761155,0.0004903518,0.0001179723],"domain_scores_gemma":[0.9927609,0.004596176,0.000514072,0.001277349,0.0005458003,0.0003056857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006239326,0.0005226388,0.004663945,0.0007126288,0.0001099901,0.0005333023,0.001050091,0.3352559,0.009997095,0.4183235,0.01571599,0.2124912],"study_design_scores_gemma":[0.00008798457,0.0001839466,0.0008221035,0.00008158851,0.00004976345,0.0005459026,0.0003417488,0.6251817,0.005296024,0.3552587,0.01209312,0.00005745683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05565492,0.0009009086,0.9124333,0.0004310496,0.0001547887,0.0001746178,0.0004755559,0.0005647447,0.02921012],"genre_scores_gemma":[0.3316698,0.001644947,0.6378407,0.0003586394,0.0002068999,0.000255217,0.002076291,0.0008908935,0.02505676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0152702,"threshold_uncertainty_score":0.05108392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032322713","doi":"10.1007/s10852-009-9111-7","title":"A Note on Observables for Counting Trails and Paths in Graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Massachusetts Institute of Technology","keywords":"Observable; Formalism (music); Quantum; Mathematics; Simple (philosophy); Point (geometry); Undirected graph; Graph theory; Graph; Computer science; Theoretical physics; Statistical physics; Combinatorics; Theoretical computer science; Physics; Geometry; Quantum mechanics; Epistemology","authors":[{"name":"Fotini Markopoulou","is_ca":true},{"name":"Simone Severini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03562865635358684,"gpt":0.2833784926211417,"spread":0.2477498362675549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006724049,0.001617536,0.003087501,0.004081017,0.004904468,0.005985832,0.004473877,0.004395914,0.01181732],"category_scores_gemma":[0.03424089,0.001263421,0.003733843,0.00634654,0.01316953,0.03652366,0.007770008,0.01222115,0.001106677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002599692,"about_ca_system_score_gemma":0.002373376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004787668,"about_ca_topic_score_gemma":0.004720132,"domain_scores_codex":[0.9961856,0.00127537,0.0004204882,0.0008407404,0.0009284149,0.0003494094],"domain_scores_gemma":[0.975279,0.01685178,0.00103806,0.00306723,0.001991757,0.001772064],"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.00002103849,0.00001532261,0.0002246187,0.00005693577,0.000008514371,0.0001111382,0.0002757774,0.0008232375,0.0002326927,0.990838,0.002513188,0.004879501],"study_design_scores_gemma":[0.00000494743,0.00001233448,0.00007657502,0.00002089795,0.000007857175,0.0000357286,0.0000474408,0.003520834,0.00009681947,0.9930549,0.003103344,0.00001840177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03292324,0.003411898,0.9102519,0.01558394,0.00671643,0.0001503158,0.0008611242,0.0007400805,0.02936112],"genre_scores_gemma":[0.6124746,0.005680928,0.325703,0.005195107,0.01224723,0.0005190045,0.001041664,0.001121698,0.03601689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01181732,"threshold_uncertainty_score":0.0395329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135268635","doi":"10.1007/s10852-009-9112-6","title":"Some Observations on the TLM Numerical Solution of the Laplace Equation","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Alberta Energy","funders":"","keywords":"Discretization; Mathematics; Laplace transform; Spectral radius; Mathematical analysis; Laplace's equation; Fourier transform; Convergence (economics); Rate of convergence; Applied mathematics; Fourier series; Matrix (chemical analysis); Harmonic; Basis (linear algebra); Partial differential equation; Eigenvalues and eigenvectors; Physics; Geometry; Computer science","authors":[{"name":"Donard de Cogan","is_ca":false},{"name":"Xiang Gui","is_ca":true},{"name":"Mirosława Rak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06809642960304381,"gpt":0.2745888473636556,"spread":0.2064924177606118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003472146,0.0004952477,0.0005494396,0.001409449,0.001471852,0.001897814,0.001343878,0.002230502,0.006316309],"category_scores_gemma":[0.02133454,0.0005146171,0.0007418367,0.001212477,0.005244132,0.003684186,0.002036347,0.00452266,0.0009373133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007343076,"about_ca_system_score_gemma":0.0004025809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001471669,"about_ca_topic_score_gemma":0.0006057266,"domain_scores_codex":[0.9984397,0.0004650125,0.00009744609,0.0001401692,0.0007713228,0.00008639505],"domain_scores_gemma":[0.9916753,0.005606843,0.0005394287,0.001192264,0.0008611613,0.0001249531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003563779,0.0001259497,0.001511912,0.0008275601,0.00003354557,0.001172085,0.003159969,0.03812328,0.03459463,0.8517865,0.009010425,0.05929773],"study_design_scores_gemma":[0.0001041545,0.0002085336,0.003421419,0.0004330535,0.00003259632,0.002290698,0.0007736799,0.2325761,0.04499212,0.6207627,0.09417,0.0002349246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07352359,0.01071206,0.7448491,0.01438449,0.002199658,0.0001395632,0.0002211086,0.0007703903,0.1532],"genre_scores_gemma":[0.7933279,0.008932512,0.1522861,0.002762156,0.00265458,0.0001470649,0.0002274666,0.0006854688,0.03897673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006316309,"threshold_uncertainty_score":0.02113014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}