{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061168,0.00009442324,0.000212676,0.00007278996,0.00009898767,0.0001315313,0.0001564699,0.00005669226,0.000004176144],"category_scores_gemma":[0.00002334228,0.00007384953,0.00008510029,0.00007771469,0.00009380087,0.0002327322,0.00002898587,0.0001664093,8.171748e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003768666,"about_ca_system_score_gemma":0.00008260143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001834093,"about_ca_topic_score_gemma":3.506089e-8,"domain_scores_codex":[0.9990492,0.00002246369,0.0003701047,0.0001379941,0.000244825,0.0001754379],"domain_scores_gemma":[0.9994034,0.0001078494,0.0001107099,0.00008503559,0.0001473056,0.000145746],"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.000006709025,0.0001162298,0.000001463179,0.00005663999,0.00002660199,0.000004081021,0.0005900221,0.8381348,0.000111405,0.1015573,0.00003944267,0.05935538],"study_design_scores_gemma":[0.0006535512,0.00009710074,5.373603e-7,0.00004524051,0.000009629301,0.0003139699,0.000128677,0.9560559,0.0004049618,0.04217558,0.00002977161,0.00008504048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001941645,0.00011099,0.9970385,0.0005600236,0.000052383,0.0001020187,0.000002310454,0.00001859699,0.0001735594],"genre_scores_gemma":[0.1849004,0.000039807,0.8149064,0.00005720218,0.00005695827,0.000002098161,7.750413e-7,0.000005583983,0.00003073211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1829588,"threshold_uncertainty_score":0.3011496,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000853916,0.0001149827,0.0002148587,0.00006204178,0.0001667547,0.0000921647,0.00007383082,0.00005028197,0.000001505507],"category_scores_gemma":[0.00008563048,0.00007112728,0.00003826251,0.00008306681,0.0001097352,0.0001009155,0.00001617142,0.0003275996,2.927311e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003823002,"about_ca_system_score_gemma":0.00002741103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005009373,"about_ca_topic_score_gemma":5.503065e-7,"domain_scores_codex":[0.999159,0.0000305815,0.0003537951,0.00008277765,0.0001894335,0.0001844352],"domain_scores_gemma":[0.9988587,0.0007609819,0.00007464411,0.000078421,0.0001380464,0.0000892198],"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.000007573267,0.00001794675,0.00001020823,0.0001655613,0.00005440334,0.000001251183,0.001646957,0.9922597,0.00001336262,0.004081399,0.000003772164,0.00173781],"study_design_scores_gemma":[0.0004566442,0.00009455271,0.00001451322,0.0002217221,0.00005374218,0.000128334,0.001022872,0.9657943,0.0001243012,0.03198336,0.00001864186,0.00008703933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09567276,0.0001949343,0.9036165,0.0002720261,0.00004013508,0.0001247212,0.000007384321,0.00003014156,0.00004137824],"genre_scores_gemma":[0.4248149,0.0002384707,0.5748173,0.000008181838,0.00007691964,0.000003819989,2.422194e-7,0.00001704696,0.00002311408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3291422,"threshold_uncertainty_score":0.2900486,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002069871,0.0001708747,0.0008943032,0.0003972839,0.0001040071,0.00000843122,0.0001423127,0.0001644296,0.00006769087],"category_scores_gemma":[0.000291058,0.0001088325,0.0001560335,0.0004075362,0.0002270314,0.0001757959,0.00004408992,0.0008128227,0.000002082586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002999064,"about_ca_system_score_gemma":0.0002654018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000109878,"about_ca_topic_score_gemma":0.000002609612,"domain_scores_codex":[0.9975432,0.000157146,0.001381239,0.0002227741,0.000388412,0.0003072579],"domain_scores_gemma":[0.9977342,0.0006449737,0.0007226542,0.0002213177,0.0003771085,0.000299683],"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.002763106,0.04535306,0.147349,0.01959643,0.004806333,0.00004821878,0.119723,0.4253503,0.02382204,0.1526438,0.0003921574,0.0581525],"study_design_scores_gemma":[0.000451214,0.0002936683,0.002390281,0.0004917902,0.000223101,0.00002016524,0.0004296792,0.8967305,0.00003240819,0.09882712,0.000002533183,0.0001074772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8756008,0.0002146943,0.1234986,0.0002490233,0.00004144666,0.0002493472,0.00001342237,0.000004859858,0.0001278699],"genre_scores_gemma":[0.8817213,0.000130817,0.1179115,0.000006909393,0.0001176299,0.000006884144,0.000004152095,0.00001492262,0.00008593033],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4713802,"threshold_uncertainty_score":0.4438062,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049299,0.0001726046,0.0004893562,0.0001609794,0.00004812968,0.00002466397,0.0001333834,0.0001367336,0.000004379952],"category_scores_gemma":[0.00006580455,0.0001217639,0.0001210005,0.00009125422,0.00006170634,0.0000792136,0.0000140582,0.0003263127,0.000002906296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001616075,"about_ca_system_score_gemma":0.00001066413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001159216,"about_ca_topic_score_gemma":2.806059e-8,"domain_scores_codex":[0.9986372,0.00001400551,0.0007410689,0.00009464564,0.0003161807,0.0001969168],"domain_scores_gemma":[0.9991831,0.0004015221,0.0001397153,0.0001292339,0.00008481694,0.00006168018],"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.00001174726,0.00009761172,0.000001122706,0.0004133296,0.00002097495,0.000005695091,0.0002070896,0.9745913,0.001153527,0.009474942,0.00005688737,0.01396582],"study_design_scores_gemma":[0.0002058705,0.00007329494,3.880632e-7,0.00072584,0.00003627085,0.00003666301,0.0000596803,0.7560074,0.02770891,0.2150403,0.000008446767,0.00009694715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1208497,0.0001778982,0.8774551,0.000107499,0.00002969297,0.00004454175,0.000001633842,0.0001011123,0.001232844],"genre_scores_gemma":[0.6944149,0.0001143599,0.3053204,0.000005451378,0.00007174099,8.959958e-7,2.48461e-7,0.0000231811,0.00004877447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5735652,"threshold_uncertainty_score":0.4965389,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165591,0.0000575626,0.0001546806,0.00005185169,0.0000796433,0.00005531205,0.000187408,0.00002941046,0.000004960456],"category_scores_gemma":[0.00006837616,0.00003369008,0.00006284262,0.00007947073,0.00002323074,0.0001470705,0.00001695572,0.00009710177,4.321318e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006692639,"about_ca_system_score_gemma":0.00004226511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.236303e-7,"about_ca_topic_score_gemma":1.424225e-8,"domain_scores_codex":[0.9992387,0.0000351629,0.0003473239,0.00006766603,0.0002028295,0.0001083217],"domain_scores_gemma":[0.9989361,0.0005881926,0.0001534885,0.0001016142,0.0001682896,0.00005236633],"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.000014256,0.0001093261,0.000004240241,0.0000267249,0.00002511115,0.000001569627,0.0008203821,0.5458834,0.00004996797,0.3799374,0.00001538127,0.07311229],"study_design_scores_gemma":[0.0002790919,0.0001534684,0.0000173841,0.00004752513,0.00001266446,0.00004608241,0.00005292229,0.9426462,0.0002527917,0.05640943,0.00004544658,0.00003700024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002671607,0.000163488,0.9978026,0.001532309,0.00004114764,0.0001125406,8.655001e-7,0.000007279988,0.00007257122],"genre_scores_gemma":[0.2818527,0.0001389303,0.7178741,0.00005485877,0.00004226476,7.553152e-7,6.638528e-8,0.000002418988,0.00003401237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3967628,"threshold_uncertainty_score":0.1373842,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115902,0.00009085897,0.0002276243,0.0001031196,0.00003854903,0.0001302418,0.0001181368,0.00004830741,4.554124e-7],"category_scores_gemma":[0.00001742875,0.00006843601,0.00003298033,0.00007078238,0.00002178837,0.0002921819,0.00003598766,0.0001743937,0.000002051743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005294528,"about_ca_system_score_gemma":0.00002505768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005988052,"about_ca_topic_score_gemma":0.00000170531,"domain_scores_codex":[0.9988194,0.00005010511,0.0005215285,0.0001047401,0.0003775553,0.0001267169],"domain_scores_gemma":[0.9994411,0.00008162593,0.0001791952,0.00006839624,0.0001381707,0.00009150523],"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.000006938319,0.0001029504,0.00002264824,0.00007421705,0.00001152137,0.000005871966,0.0004858765,0.9648342,0.000009112828,0.006598664,0.000003387526,0.02784468],"study_design_scores_gemma":[0.0004461426,0.00006796023,0.00002398648,0.000199545,0.000006281448,0.0001433996,0.00003692512,0.9863789,0.000002121812,0.01257836,0.00003903645,0.00007730949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0835586,0.0002952481,0.9153842,0.0005930212,0.00005827743,0.00006735756,9.357428e-7,0.00000804405,0.0000342594],"genre_scores_gemma":[0.5379325,0.00009595998,0.461852,0.00002732126,0.00008242803,8.903215e-7,5.874363e-7,0.000004159021,0.000004244909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4543739,"threshold_uncertainty_score":0.279074,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003317462,0.0001292882,0.0002426217,0.0000968678,0.00005035214,0.00009352359,0.00008720934,0.00006098882,0.000001894639],"category_scores_gemma":[0.000008989507,0.0000969692,0.00008966945,0.00006112177,0.00002902848,0.0001860883,0.00001013381,0.0001308839,5.74177e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002682261,"about_ca_system_score_gemma":0.000003029461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002865154,"about_ca_topic_score_gemma":1.637905e-7,"domain_scores_codex":[0.9991894,0.00001859637,0.0003746216,0.0001022348,0.0001434712,0.0001716511],"domain_scores_gemma":[0.9996141,0.00007954548,0.00008583353,0.00007448463,0.00008420514,0.00006189167],"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.00001614284,0.0001094976,0.000003913506,0.0001669022,0.00004443182,0.000001005664,0.000289648,0.9938575,0.00001592673,0.0006954361,0.00001476756,0.004784819],"study_design_scores_gemma":[0.0004421549,0.0001215971,0.000001964478,0.00006005989,0.00006039287,0.00001131266,0.0002290616,0.9756597,0.0001129766,0.02310388,0.00007781043,0.0001190412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03924845,0.0001061166,0.9601353,0.00001666558,0.00004368548,0.0001916615,0.000001730041,0.00004844877,0.0002079786],"genre_scores_gemma":[0.4022682,0.00001065945,0.597437,0.000006417963,0.0001967262,0.000008112193,0.000006387625,0.00002185625,0.00004468273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3630197,"threshold_uncertainty_score":0.3954289,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068287,0.00009710158,0.0001884069,0.0001556251,0.00009964739,0.000177378,0.0002171936,0.00005434179,0.000001481734],"category_scores_gemma":[0.00001142471,0.00007760061,0.00006955897,0.0001705671,0.00002758542,0.0003721828,0.00002084968,0.0001053471,2.415447e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002335897,"about_ca_system_score_gemma":0.00003711289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004785898,"about_ca_topic_score_gemma":1.647418e-7,"domain_scores_codex":[0.9989228,0.00005369865,0.0004507475,0.0001388491,0.0003255342,0.0001083579],"domain_scores_gemma":[0.9991269,0.00006451257,0.000287678,0.0001712532,0.0002681395,0.00008158308],"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.00001578825,0.001283416,0.0001217606,0.0001452305,0.00003158276,0.00002120636,0.0005577129,0.1767395,0.001234568,0.7858165,0.00009161916,0.0339411],"study_design_scores_gemma":[0.0001145319,0.00006285188,0.00001172706,0.00008031922,0.00001090788,0.00003435612,0.000004558722,0.8058607,0.001207792,0.1925135,0.00002160476,0.00007718262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03268109,0.0001008255,0.9669573,0.00008530082,0.00005153448,0.00005269683,5.801198e-7,0.00005000784,0.00002072646],"genre_scores_gemma":[0.6223476,0.000008355401,0.3775427,0.00001938667,0.00007277144,6.946905e-7,8.381663e-7,0.000005468222,0.000002204756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6291211,"threshold_uncertainty_score":0.3164461,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000395572,0.00007665525,0.0001692899,0.0001511295,0.00005660924,0.0000775749,0.0001232421,0.00004284757,0.000016475],"category_scores_gemma":[0.00006300679,0.0000581659,0.00004369816,0.0002370082,0.0000157258,0.0003277117,0.00003389002,0.0001379213,0.000005405068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001498379,"about_ca_system_score_gemma":0.00001077741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.011602e-7,"about_ca_topic_score_gemma":2.458642e-7,"domain_scores_codex":[0.999132,0.00002979655,0.0003711397,0.0001108949,0.0002451495,0.0001110627],"domain_scores_gemma":[0.9993583,0.0002479821,0.0001262252,0.00008741258,0.0001031856,0.00007689589],"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":[7.283234e-7,0.0001193798,0.000006042727,0.00001448892,0.000006043908,0.000005774115,0.000309416,0.9820318,0.00001768171,0.01262926,0.00002409981,0.004835242],"study_design_scores_gemma":[0.0002234125,0.00006581538,0.000005434875,0.00007726352,0.000004530822,0.0001005412,0.00000629872,0.8844121,0.0000125752,0.1149759,0.00005536803,0.00006086217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004689132,0.0008091386,0.9931339,0.00103031,0.00007341866,0.00006070978,2.968528e-7,0.00001155549,0.0001915587],"genre_scores_gemma":[0.2854643,0.0001929074,0.7141303,0.00008369456,0.00006570637,0.00000177422,3.589057e-7,0.000004626705,0.0000562625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2807752,"threshold_uncertainty_score":0.2371936,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001760982,0.0001238018,0.0002986388,0.0001089369,0.00003868416,0.00002531753,0.00007204895,0.00004687258,0.00008154083],"category_scores_gemma":[0.00005230303,0.00009419318,0.0001063717,0.0001292084,0.0000378124,0.0001470954,0.00001435287,0.0002708284,0.00001671124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003844459,"about_ca_system_score_gemma":0.000001784862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.682765e-7,"about_ca_topic_score_gemma":9.933592e-8,"domain_scores_codex":[0.9991198,0.00001330833,0.0004235604,0.00008375172,0.000214881,0.0001447555],"domain_scores_gemma":[0.9994051,0.0002482951,0.00008578291,0.00007632574,0.00007101997,0.0001134482],"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.000007396918,0.000283099,0.000009438208,0.0000965306,0.0001092906,0.00004480271,0.0003530475,0.9602399,0.002821887,0.0004772347,0.0006559453,0.03490147],"study_design_scores_gemma":[0.0001612247,0.0001030215,3.804697e-7,0.0001178323,0.00003807861,0.0002162672,0.00002980593,0.9621099,0.002183755,0.03481157,0.0001231603,0.0001050296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03845805,0.000677599,0.9596688,0.00008881775,0.00005752395,0.00003564438,0.000001171943,0.0000915959,0.0009208407],"genre_scores_gemma":[0.7010393,0.0001733697,0.2984836,0.0000216948,0.0001528319,0.000001869056,2.361842e-7,0.00002176018,0.0001053608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6625813,"threshold_uncertainty_score":0.3841086,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003467599,0.00007637114,0.0001851265,0.0001028024,0.00007546496,0.0001031916,0.0001646683,0.00003529626,0.00002912609],"category_scores_gemma":[0.00003296309,0.00005824522,0.00006523542,0.0001433358,0.00002151992,0.0002650722,0.00003723217,0.0001288568,0.00001774803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009216607,"about_ca_system_score_gemma":0.00001115914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.740347e-7,"about_ca_topic_score_gemma":1.412628e-8,"domain_scores_codex":[0.9991637,0.00002712313,0.0003375483,0.0001002141,0.000251876,0.0001194723],"domain_scores_gemma":[0.9993293,0.000195982,0.0001364427,0.00009966644,0.000117765,0.0001208619],"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.000008518251,0.000595857,0.00001149001,0.0001100386,0.0001179345,0.0000824873,0.002726007,0.2010653,0.0006365039,0.5443457,0.001959979,0.2483402],"study_design_scores_gemma":[0.000165989,0.00007406101,0.000003887399,0.00002885844,0.000007559484,0.0003419454,0.00001087273,0.8445067,0.0001926177,0.1542455,0.000362504,0.00005947991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01162215,0.0006891939,0.9854779,0.00150822,0.000115713,0.00003033574,4.626947e-7,0.00001482734,0.0005412315],"genre_scores_gemma":[0.5154006,0.0001466586,0.4838405,0.0001424193,0.0001878672,7.524525e-7,1.41127e-7,0.000004532088,0.0002764596],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6434414,"threshold_uncertainty_score":0.2375171,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005314795,0.00006857863,0.0001804445,0.000152944,0.00007180875,0.00005442882,0.000137185,0.00003128607,0.00001330364],"category_scores_gemma":[0.00006825645,0.00005483626,0.00006708788,0.0002118016,0.0000211215,0.0002502208,0.00003028263,0.000114801,0.000004953798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001200051,"about_ca_system_score_gemma":0.00000911741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.577952e-7,"about_ca_topic_score_gemma":4.140293e-8,"domain_scores_codex":[0.9989704,0.00003235476,0.0005080668,0.0001012763,0.0002929361,0.00009489364],"domain_scores_gemma":[0.9991777,0.0002322236,0.0002607057,0.0001016512,0.0001568651,0.00007084158],"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.00004048424,0.0008001585,0.000004575445,0.0001598064,0.0001516288,0.00003214307,0.006374079,0.818932,0.0006594027,0.08433262,0.001682439,0.08683063],"study_design_scores_gemma":[0.0003778216,0.0001074759,0.000006939707,0.00008680818,0.00001142978,0.00008494421,0.00004394749,0.9367505,0.000771261,0.06143534,0.0002681011,0.00005538145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02456736,0.0002510678,0.9733894,0.0005841168,0.0001650535,0.00003749712,0.0000016514,0.00000893088,0.0009948518],"genre_scores_gemma":[0.5317371,0.0001476629,0.4676228,0.0000224085,0.0001784954,6.12537e-7,3.622635e-7,0.000003538019,0.0002869873],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5071697,"threshold_uncertainty_score":0.2236158,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004010589,0.00008703477,0.0002281816,0.00005245209,0.00006301123,0.00004889369,0.00005179921,0.0000274719,0.000003745363],"category_scores_gemma":[0.000008134999,0.00006611955,0.00006213375,0.00005246183,0.00001279805,0.00006522742,0.00000484012,0.0001297886,4.377774e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004485728,"about_ca_system_score_gemma":0.00001293691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001785546,"about_ca_topic_score_gemma":6.542756e-8,"domain_scores_codex":[0.9993455,0.000009083275,0.0003213068,0.00009391849,0.00009929428,0.0001309001],"domain_scores_gemma":[0.9995032,0.0001966412,0.0001333117,0.00005366323,0.0000472717,0.00006589158],"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.0000199542,0.0002885538,0.0000197566,0.00003625044,0.00001513321,0.00000145651,0.0004300174,0.001935903,0.0003959551,0.9390014,0.00002073811,0.05783487],"study_design_scores_gemma":[0.0002677949,0.00008831968,0.000008415994,0.0001110165,0.00001127198,0.0000026716,0.00007930212,0.4323349,0.0001322524,0.5668561,0.00006213888,0.00004584112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2878596,0.00006581984,0.7114817,0.0003900879,0.0000136889,0.00008803686,0.000006303248,0.000002602927,0.00009217902],"genre_scores_gemma":[0.9451841,0.00003247229,0.05462839,0.00004720032,0.00008807586,0.00000462534,8.055711e-7,0.00000647616,0.000007881828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6573245,"threshold_uncertainty_score":0.2696277,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144018,0.00007952093,0.0001760275,0.0000324598,0.00006786704,0.00001678507,0.0001056525,0.00004611038,0.000009544867],"category_scores_gemma":[0.0001776649,0.0000417733,0.00008367728,0.0001430561,0.00003049772,0.00006905896,0.000006075478,0.000230481,0.000001425838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001886409,"about_ca_system_score_gemma":0.000009923718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.269847e-7,"about_ca_topic_score_gemma":8.82259e-9,"domain_scores_codex":[0.9991392,0.00007872834,0.0003731638,0.00004872398,0.0002554798,0.0001046376],"domain_scores_gemma":[0.9989974,0.0006770184,0.0001140375,0.0001029217,0.00006394341,0.00004465905],"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.00001740393,0.0001256356,0.000006927518,0.000029923,0.00002914885,5.977815e-7,0.0003495822,0.9057934,0.003325779,0.07285374,0.0001659753,0.01730185],"study_design_scores_gemma":[0.0001164868,0.000134487,0.0001491161,0.00006874795,0.0000202855,0.000008450527,0.00001338947,0.8306978,0.001376101,0.1673428,0.00003122686,0.0000410929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0892675,0.0002528937,0.9074368,0.002688998,0.00008839117,0.00007070534,6.105149e-7,0.00001427222,0.0001798664],"genre_scores_gemma":[0.9187217,0.00008939306,0.08084352,0.0001619392,0.0001340471,0.000001037226,1.64566e-7,0.000007740102,0.00004045627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8294542,"threshold_uncertainty_score":0.1703465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}