{"meta":{"query_hash":"1ca8e3933452","filters":{"venue":"Journal of Mathematical Modelling and Algorithms"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1ca8e3933452","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Mathematical+Modelling+and+Algorithms"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04273633534547535,"score_gpt":0.2520657650801522,"score_spread":0.20932942973467686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480727810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011622152,0.0006891939,0.98547786,0.0015082203,0.000115713025,0.000030335745,4.626947e-7,0.000014827341,0.00054123154],"genre_scores_gemma":[0.51540065,0.00014665858,0.4838405,0.00014241933,0.00018786723,7.524525e-7,1.41127e-7,0.000004532088,0.00027645956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916375,0.000027123131,0.00033754826,0.00010021408,0.00025187596,0.0001194723],"domain_scores_gemma":[0.99932927,0.00019598196,0.00013644269,0.00009966644,0.000117764954,0.00012086187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034675992,0.000076371136,0.0001851265,0.00010280239,0.00007546496,0.00010319159,0.00016466831,0.000035296263,0.00002912609],"category_scores_gemma":[0.000032963086,0.000058245216,0.00006523542,0.00014333584,0.000021519923,0.00026507225,0.000037232167,0.0001288568,0.000017748032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008518251,0.00059585704,0.000011490011,0.00011003861,0.00011793452,0.0000824873,0.002726007,0.20106532,0.0006365039,0.5443457,0.001959979,0.24834022],"study_design_scores_gemma":[0.00016598903,0.00007406101,0.0000038873986,0.000028858442,0.0000075594844,0.00034194536,0.000010872732,0.84450674,0.00019261774,0.1542455,0.00036250404,0.00005947991],"about_ca_topic_score_codex":3.7403473e-7,"about_ca_topic_score_gemma":1.4126276e-8,"teacher_disagreement_score":0.64344144,"about_ca_system_score_codex":0.000009216607,"about_ca_system_score_gemma":0.000011159137,"threshold_uncertainty_score":0.23751709},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04591818117153679,"score_gpt":0.23778151727242647,"score_spread":0.19186333610088968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549928317","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004689132,0.0008091386,0.9931339,0.0010303103,0.00007341866,0.000060709783,2.9685282e-7,0.000011555489,0.00019155868],"genre_scores_gemma":[0.28546435,0.00019290744,0.71413034,0.00008369456,0.00006570637,0.0000017742202,3.589057e-7,0.000004626705,0.000056262503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999132,0.000029796547,0.00037113973,0.00011089489,0.00024514954,0.0001110627],"domain_scores_gemma":[0.9993583,0.00024798207,0.00012622522,0.00008741258,0.000103185615,0.000076895885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039557202,0.00007665525,0.00016928987,0.00015112948,0.000056609242,0.0000775749,0.00012324215,0.00004284757,0.000016475],"category_scores_gemma":[0.00006300679,0.000058165897,0.000043698165,0.00023700821,0.000015725796,0.0003277117,0.000033890017,0.00013792134,0.0000054050684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.283234e-7,0.00011937984,0.000006042727,0.0000144889245,0.000006043908,0.000005774115,0.00030941598,0.9820318,0.000017681712,0.012629257,0.000024099807,0.004835242],"study_design_scores_gemma":[0.00022341254,0.00006581538,0.0000054348748,0.00007726352,0.0000045308216,0.000100541234,0.0000062987197,0.88441205,0.000012575199,0.11497586,0.000055368033,0.000060862167],"about_ca_topic_score_codex":7.0116016e-7,"about_ca_topic_score_gemma":2.4586416e-7,"teacher_disagreement_score":0.28077522,"about_ca_system_score_codex":0.000014983792,"about_ca_system_score_gemma":0.00001077741,"threshold_uncertainty_score":0.23719364},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025296340402965516,"score_gpt":0.24522078220652313,"score_spread":0.2199244418035576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970647354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03924845,0.00010611661,0.9601353,0.00001666558,0.00004368548,0.00019166154,0.0000017300413,0.000048448772,0.00020797856],"genre_scores_gemma":[0.4022682,0.000010659445,0.59743696,0.000006417963,0.00019672622,0.000008112193,0.0000063876246,0.000021856255,0.000044682725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918944,0.000018596375,0.00037462162,0.00010223479,0.0001434712,0.00017165106],"domain_scores_gemma":[0.99961406,0.00007954548,0.00008583353,0.000074484626,0.000084205145,0.00006189167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033174624,0.00012928822,0.0002426217,0.0000968678,0.000050352137,0.000093523595,0.000087209344,0.000060988823,0.0000018946395],"category_scores_gemma":[0.0000089895075,0.000096969205,0.00008966945,0.00006112177,0.000029028484,0.0001860883,0.000010133814,0.00013088393,5.7417697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016142838,0.00010949758,0.000003913506,0.00016690216,0.000044431818,0.000001005664,0.000289648,0.9938575,0.000015926733,0.0006954361,0.0000147675555,0.004784819],"study_design_scores_gemma":[0.00044215488,0.000121597135,0.0000019644779,0.00006005989,0.000060392875,0.000011312662,0.00022906161,0.9756597,0.00011297655,0.02310388,0.00007781043,0.00011904121],"about_ca_topic_score_codex":0.0000028651543,"about_ca_topic_score_gemma":1.6379047e-7,"teacher_disagreement_score":0.36301973,"about_ca_system_score_codex":0.000026822612,"about_ca_system_score_gemma":0.0000030294611,"threshold_uncertainty_score":0.39542893},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07347995078575735,"score_gpt":0.2978228350086319,"score_spread":0.22434288422287452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979684104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002671607,0.00016348797,0.9978026,0.0015323089,0.00004114764,0.000112540634,8.655001e-7,0.0000072799885,0.000072571216],"genre_scores_gemma":[0.28185266,0.0001389303,0.71787405,0.00005485877,0.000042264757,7.553152e-7,6.638528e-8,0.0000024189883,0.00003401237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923867,0.000035162895,0.00034732386,0.000067666035,0.00020282951,0.00010832174],"domain_scores_gemma":[0.99893606,0.0005881926,0.00015348852,0.00010161419,0.0001682896,0.000052366326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655906,0.000057562596,0.0001546806,0.000051851686,0.0000796433,0.000055312048,0.00018740803,0.000029410463,0.0000049604564],"category_scores_gemma":[0.00006837616,0.000033690085,0.00006284262,0.00007947073,0.000023230736,0.00014707055,0.000016955722,0.000097101765,4.3213177e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014256005,0.00010932606,0.000004240241,0.000026724898,0.000025111147,0.0000015696272,0.00082038215,0.5458834,0.00004996797,0.37993735,0.000015381265,0.07311229],"study_design_scores_gemma":[0.00027909188,0.00015346838,0.0000173841,0.000047525125,0.000012664463,0.00004608241,0.000052922293,0.9426462,0.00025279165,0.05640943,0.000045446584,0.00003700024],"about_ca_topic_score_codex":1.236303e-7,"about_ca_topic_score_gemma":1.4242251e-8,"teacher_disagreement_score":0.3967628,"about_ca_system_score_codex":0.0000066926386,"about_ca_system_score_gemma":0.000042265114,"threshold_uncertainty_score":0.13738418},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03257880984352848,"score_gpt":0.2623488479533102,"score_spread":0.22977003810978172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001157763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001941645,0.000110990026,0.9970385,0.00056002365,0.000052383,0.00010201871,0.0000023104542,0.000018596993,0.00017355941],"genre_scores_gemma":[0.18490043,0.000039806997,0.8149064,0.00005720218,0.00005695827,0.000002098161,7.7504126e-7,0.0000055839832,0.00003073211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990492,0.00002246369,0.0003701047,0.00013799411,0.000244825,0.00017543793],"domain_scores_gemma":[0.99940336,0.000107849395,0.00011070988,0.000085035594,0.00014730565,0.00014574599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061168,0.00009442324,0.00021267596,0.00007278996,0.00009898767,0.00013153125,0.00015646992,0.000056692264,0.000004176144],"category_scores_gemma":[0.000023342282,0.00007384953,0.00008510029,0.000077714685,0.00009380087,0.00023273216,0.000028985869,0.00016640934,8.171748e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067090255,0.00011622981,0.0000014631787,0.000056639994,0.000026601987,0.000004081021,0.0005900221,0.83813477,0.00011140496,0.10155726,0.00003944267,0.059355382],"study_design_scores_gemma":[0.0006535512,0.00009710074,5.373603e-7,0.00004524051,0.000009629301,0.00031396988,0.00012867701,0.95605594,0.00040496181,0.04217558,0.000029771607,0.00008504048],"about_ca_topic_score_codex":0.0000018340927,"about_ca_topic_score_gemma":3.5060886e-8,"teacher_disagreement_score":0.1829588,"about_ca_system_score_codex":0.000037686663,"about_ca_system_score_gemma":0.00008260143,"threshold_uncertainty_score":0.30114964},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.05607874453509868,"score_gpt":0.2693621043498414,"score_spread":0.21328335981474275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002282904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095672764,0.00019493428,0.9036165,0.00027202614,0.000040135077,0.0001247212,0.0000073843207,0.000030141564,0.000041378244],"genre_scores_gemma":[0.4248149,0.0002384707,0.5748173,0.000008181838,0.00007691964,0.0000038199887,2.4221944e-7,0.000017046963,0.000023114078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999159,0.000030581497,0.0003537951,0.00008277765,0.00018943349,0.00018443524],"domain_scores_gemma":[0.9988587,0.0007609819,0.000074644115,0.000078421,0.00013804635,0.0000892198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085391605,0.000114982715,0.00021485868,0.000062041785,0.0001667547,0.0000921647,0.000073830815,0.000050281968,0.0000015055072],"category_scores_gemma":[0.000085630476,0.00007112728,0.00003826251,0.000083066814,0.00010973516,0.0001009155,0.00001617142,0.0003275996,2.9273113e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075732673,0.000017946748,0.000010208231,0.0001655613,0.000054403336,0.0000012511834,0.0016469571,0.99225974,0.000013362619,0.004081399,0.0000037721643,0.0017378102],"study_design_scores_gemma":[0.0004566442,0.00009455271,0.000014513218,0.00022172215,0.00005374218,0.00012833402,0.0010228723,0.96579427,0.00012430124,0.03198336,0.000018641864,0.000087039334],"about_ca_topic_score_codex":0.000005009373,"about_ca_topic_score_gemma":5.503065e-7,"teacher_disagreement_score":0.32914215,"about_ca_system_score_codex":0.000038230017,"about_ca_system_score_gemma":0.00002741103,"threshold_uncertainty_score":0.29004863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09691485799688777,"score_gpt":0.42378843108730985,"score_spread":0.3268735730904221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019705613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87560076,0.00021469433,0.1234986,0.0002490233,0.00004144666,0.00024934718,0.000013422372,0.000004859858,0.00012786986],"genre_scores_gemma":[0.8817213,0.00013081702,0.117911465,0.000006909393,0.000117629854,0.0000068841437,0.000004152095,0.00001492262,0.000085930325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754316,0.000157146,0.0013812392,0.00022277412,0.000388412,0.0003072579],"domain_scores_gemma":[0.99773425,0.00064497365,0.00072265416,0.0002213177,0.00037710855,0.00029968296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002069871,0.00017087469,0.0008943032,0.00039728393,0.00010400709,0.00000843122,0.00014231268,0.00016442957,0.00006769087],"category_scores_gemma":[0.00029105798,0.00010883254,0.0001560335,0.00040753622,0.00022703137,0.00017579587,0.000044089924,0.00081282266,0.000002082586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002763106,0.045353055,0.14734899,0.019596433,0.004806333,0.00004821878,0.11972302,0.42535034,0.023822041,0.1526438,0.00039215738,0.058152504],"study_design_scores_gemma":[0.00045121403,0.00029366827,0.002390281,0.00049179024,0.00022310104,0.000020165242,0.00042967923,0.89673054,0.00003240819,0.09882712,0.0000025331829,0.00010747722],"about_ca_topic_score_codex":0.000010987804,"about_ca_topic_score_gemma":0.0000026096116,"teacher_disagreement_score":0.4713802,"about_ca_system_score_codex":0.000029990639,"about_ca_system_score_gemma":0.00026540185,"threshold_uncertainty_score":0.4438062},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035628656353586835,"score_gpt":0.28337849262114173,"score_spread":0.2477498362675549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032322713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2878596,0.00006581984,0.7114817,0.00039008787,0.0000136888975,0.00008803686,0.000006303248,0.0000026029272,0.00009217902],"genre_scores_gemma":[0.94518405,0.000032472286,0.054628395,0.000047200316,0.00008807586,0.00000462534,8.0557106e-7,0.0000064761603,0.000007881828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993455,0.0000090832755,0.0003213068,0.00009391849,0.00009929428,0.0001309001],"domain_scores_gemma":[0.9995032,0.00019664117,0.00013331173,0.00005366323,0.0000472717,0.00006589158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004010589,0.00008703477,0.00022818161,0.000052452087,0.000063011226,0.00004889369,0.00005179921,0.000027471897,0.0000037453628],"category_scores_gemma":[0.000008134999,0.00006611955,0.00006213375,0.000052461834,0.000012798055,0.00006522742,0.00000484012,0.00012978862,4.377774e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000199542,0.0002885538,0.000019756602,0.00003625044,0.000015133213,0.0000014565101,0.00043001742,0.0019359033,0.00039595505,0.93900144,0.000020738109,0.05783487],"study_design_scores_gemma":[0.00026779488,0.000088319684,0.000008415994,0.00011101655,0.000011271975,0.0000026715998,0.000079302125,0.43233487,0.0001322524,0.5668561,0.00006213888,0.00004584112],"about_ca_topic_score_codex":0.0000017855461,"about_ca_topic_score_gemma":6.542756e-8,"teacher_disagreement_score":0.6573245,"about_ca_system_score_codex":0.000004485728,"about_ca_system_score_gemma":0.000012936908,"threshold_uncertainty_score":0.26962772},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03752290115610688,"score_gpt":0.2598546122589003,"score_spread":0.2223317111027934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061006016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0835586,0.00029524814,0.91538423,0.0005930212,0.00005827743,0.00006735756,9.357428e-7,0.00000804405,0.0000342594],"genre_scores_gemma":[0.53793246,0.00009595998,0.46185195,0.000027321263,0.00008242803,8.9032153e-7,5.874363e-7,0.0000041590206,0.000004244909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881935,0.000050105114,0.00052152853,0.00010474009,0.00037755526,0.00012671688],"domain_scores_gemma":[0.9994411,0.000081625934,0.00017919524,0.00006839624,0.00013817073,0.00009150523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011590201,0.00009085897,0.00022762427,0.00010311961,0.000038549035,0.00013024178,0.00011813677,0.000048307407,4.5541236e-7],"category_scores_gemma":[0.000017428754,0.00006843601,0.000032980326,0.00007078238,0.000021788373,0.0002921819,0.000035987658,0.00017439366,0.0000020517427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069383186,0.00010295045,0.00002264824,0.00007421705,0.000011521367,0.000005871966,0.00048587646,0.96483415,0.000009112828,0.0065986644,0.000003387526,0.027844677],"study_design_scores_gemma":[0.00044614257,0.00006796023,0.000023986484,0.00019954496,0.0000062814483,0.00014339958,0.000036925117,0.9863789,0.000002121812,0.012578358,0.000039036448,0.00007730949],"about_ca_topic_score_codex":0.000005988052,"about_ca_topic_score_gemma":0.0000017053097,"teacher_disagreement_score":0.45437387,"about_ca_system_score_codex":0.000052945277,"about_ca_system_score_gemma":0.000025057681,"threshold_uncertainty_score":0.27907395},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0665257566991924,"score_gpt":0.2987156077922042,"score_spread":0.23218985109301177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071404612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032681085,0.00010082551,0.9669573,0.000085300824,0.00005153448,0.00005269683,5.801198e-7,0.00005000784,0.000020726458],"genre_scores_gemma":[0.6223476,0.000008355401,0.3775427,0.000019386667,0.00007277144,6.9469047e-7,8.3816633e-7,0.0000054682223,0.0000022047561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989228,0.00005369865,0.0004507475,0.00013884911,0.00032553423,0.0001083579],"domain_scores_gemma":[0.99912685,0.00006451257,0.00028767798,0.00017125317,0.0002681395,0.00008158308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068287004,0.000097101576,0.00018840686,0.00015562508,0.00009964739,0.00017737804,0.00021719358,0.000054341792,0.000001481734],"category_scores_gemma":[0.000011424712,0.000077600605,0.00006955897,0.00017056713,0.000027585416,0.00037218284,0.000020849682,0.00010534715,2.415447e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015788248,0.0012834161,0.00012176061,0.0001452305,0.00003158276,0.000021206357,0.00055771286,0.17673954,0.001234568,0.7858165,0.000091619164,0.033941098],"study_design_scores_gemma":[0.00011453189,0.00006285188,0.000011727061,0.00008031922,0.000010907885,0.000034356115,0.0000045587217,0.8058607,0.0012077919,0.19251348,0.000021604761,0.00007718262],"about_ca_topic_score_codex":0.0000047858985,"about_ca_topic_score_gemma":1.6474183e-7,"teacher_disagreement_score":0.6291211,"about_ca_system_score_codex":0.00002335897,"about_ca_system_score_gemma":0.000037112888,"threshold_uncertainty_score":0.3164461},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026829216163901985,"score_gpt":0.23457262682577323,"score_spread":0.20774341066187124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072147873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12084973,0.00017789818,0.87745506,0.00010749904,0.000029692968,0.000044541754,0.0000016338416,0.0001011123,0.0012328438],"genre_scores_gemma":[0.6944149,0.00011435986,0.3053204,0.0000054513785,0.000071740986,8.959958e-7,2.4846105e-7,0.000023181101,0.000048774473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986372,0.000014005507,0.0007410689,0.00009464564,0.00031618073,0.00019691676],"domain_scores_gemma":[0.99918306,0.00040152212,0.00013971528,0.00012923393,0.000084816944,0.000061680184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049299,0.00017260463,0.00048935617,0.00016097937,0.00004812968,0.000024663968,0.00013338336,0.00013673364,0.0000043799523],"category_scores_gemma":[0.00006580455,0.00012176394,0.00012100051,0.000091254224,0.00006170634,0.0000792136,0.000014058201,0.0003263127,0.000002906296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011747258,0.000097611715,0.0000011227063,0.00041332963,0.000020974949,0.0000056950907,0.00020708959,0.97459126,0.0011535267,0.009474942,0.000056887373,0.013965824],"study_design_scores_gemma":[0.00020587048,0.00007329494,3.8806317e-7,0.00072584004,0.00003627085,0.000036663012,0.0000596803,0.7560074,0.027708912,0.21504034,0.000008446767,0.00009694715],"about_ca_topic_score_codex":0.0000011592159,"about_ca_topic_score_gemma":2.8060589e-8,"teacher_disagreement_score":0.5735652,"about_ca_system_score_codex":0.000016160753,"about_ca_system_score_gemma":0.000010664126,"threshold_uncertainty_score":0.4965389},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02015139002648595,"score_gpt":0.23584285189217022,"score_spread":0.21569146186568428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118197096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03845805,0.00067759905,0.95966876,0.000088817746,0.00005752395,0.000035644378,0.0000011719434,0.0000915959,0.00092084066],"genre_scores_gemma":[0.7010393,0.00017336967,0.29848355,0.000021694797,0.00015283185,0.0000018690557,2.3618423e-7,0.000021760181,0.00010536081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911976,0.000013308331,0.0004235604,0.00008375172,0.00021488099,0.00014475545],"domain_scores_gemma":[0.99940515,0.00024829508,0.000085782915,0.00007632574,0.00007101997,0.00011344818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017609823,0.0001238018,0.0002986388,0.00010893692,0.000038684157,0.000025317531,0.00007204895,0.000046872578,0.000081540835],"category_scores_gemma":[0.00005230303,0.00009419318,0.000106371706,0.00012920839,0.0000378124,0.00014709537,0.000014352867,0.00027082843,0.000016711238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007396918,0.00028309898,0.000009438208,0.0000965306,0.00010929062,0.00004480271,0.00035304748,0.9602399,0.0028218871,0.00047723475,0.0006559453,0.034901466],"study_design_scores_gemma":[0.0001612247,0.00010302152,3.8046971e-7,0.00011783231,0.000038078608,0.00021626716,0.000029805933,0.96210986,0.002183755,0.034811575,0.0001231603,0.00010502956],"about_ca_topic_score_codex":6.6827647e-7,"about_ca_topic_score_gemma":9.933592e-8,"teacher_disagreement_score":0.66258126,"about_ca_system_score_codex":0.000038444592,"about_ca_system_score_gemma":0.000001784862,"threshold_uncertainty_score":0.38410863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06809642960304381,"score_gpt":0.27458884736365563,"score_spread":0.20649241776061183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135268635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0892675,0.00025289372,0.9074368,0.002688998,0.00008839117,0.00007070534,6.1051486e-7,0.000014272218,0.00017986642],"genre_scores_gemma":[0.91872174,0.00008939306,0.080843516,0.00016193918,0.0001340471,0.0000010372257,1.6456598e-7,0.000007740102,0.00004045627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913925,0.00007872834,0.00037316384,0.000048723985,0.00025547977,0.00010463764],"domain_scores_gemma":[0.9989974,0.00067701837,0.000114037495,0.000102921746,0.000063943415,0.00004465905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144018,0.00007952093,0.00017602752,0.000032459797,0.00006786704,0.00001678507,0.000105652456,0.00004611038,0.000009544867],"category_scores_gemma":[0.00017766487,0.000041773295,0.00008367728,0.00014305612,0.000030497718,0.00006905896,0.000006075478,0.00023048096,0.0000014258384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017403925,0.00012563565,0.000006927518,0.000029922996,0.000029148847,5.9778154e-7,0.00034958223,0.9057934,0.0033257792,0.07285374,0.00016597527,0.01730185],"study_design_scores_gemma":[0.00011648679,0.00013448701,0.00014911607,0.00006874795,0.000020285499,0.000008450527,0.000013389472,0.83069783,0.0013761014,0.16734275,0.000031226864,0.000041092902],"about_ca_topic_score_codex":4.2698468e-7,"about_ca_topic_score_gemma":8.82259e-9,"teacher_disagreement_score":0.8294542,"about_ca_system_score_codex":0.00001886409,"about_ca_system_score_gemma":0.000009923718,"threshold_uncertainty_score":0.17034654},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08735776650559834,"score_gpt":0.2715975922062917,"score_spread":0.18423982570069336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60875001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024567358,0.00025106783,0.97338945,0.0005841168,0.00016505351,0.000037497117,0.0000016514002,0.00000893088,0.0009948518],"genre_scores_gemma":[0.5317371,0.00014766293,0.46762285,0.0000224085,0.00017849542,6.12537e-7,3.622635e-7,0.0000035380185,0.00028698726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897045,0.000032354757,0.00050806685,0.00010127629,0.00029293614,0.00009489364],"domain_scores_gemma":[0.9991777,0.00023222358,0.00026070568,0.00010165125,0.0001568651,0.00007084158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053147954,0.00006857863,0.00018044453,0.00015294396,0.00007180875,0.000054428816,0.00013718502,0.00003128607,0.000013303641],"category_scores_gemma":[0.00006825645,0.000054836255,0.00006708788,0.0002118016,0.000021121503,0.00025022076,0.000030282634,0.000114800976,0.0000049537985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040484236,0.0008001585,0.000004575445,0.00015980635,0.00015162877,0.00003214307,0.0063740793,0.818932,0.0006594027,0.08433262,0.0016824389,0.08683063],"study_design_scores_gemma":[0.00037782156,0.00010747588,0.0000069397074,0.00008680818,0.000011429784,0.000084944215,0.00004394749,0.93675053,0.000771261,0.061435338,0.0002681011,0.000055381446],"about_ca_topic_score_codex":4.577952e-7,"about_ca_topic_score_gemma":4.1402934e-8,"teacher_disagreement_score":0.5071697,"about_ca_system_score_codex":0.000012000511,"about_ca_system_score_gemma":0.00000911741,"threshold_uncertainty_score":0.22361577},"labels":[],"label_agreement":null}]}