{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037773933,0.0013164368,0.78642124,0.00057038444,0.00056694774,0.00009834118,0.00047439834,0.00046067894,0.17231777],"genre_scores_gemma":[0.5015705,0.0021149525,0.32632524,0.00018365459,0.00021541347,0.00013342036,0.0012484837,0.00092772883,0.16728051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999688,0.000045798777,0.000012670284,0.000045978555,0.0001828068,0.000024775038],"domain_scores_gemma":[0.9996209,0.000101588645,0.000028967483,0.00011700969,0.0001018258,0.00002965499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023473689,0.000625629,0.0006977687,0.0009335251,0.0006805728,0.0016768138,0.00080658,0.0006868653,0.014835168],"category_scores_gemma":[0.0019587462,0.000577366,0.00045646884,0.0008036991,0.00082957937,0.0018198305,0.002151644,0.0021292788,0.002801778],"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.00009017747,0.000057404755,0.00034259201,0.00014845366,0.000016920623,0.00014569508,0.000216162,0.064759165,0.006641459,0.755568,0.0104613295,0.16155267],"study_design_scores_gemma":[0.000034381497,0.00006003512,0.00038502493,0.00009845237,0.000025811427,0.0005234806,0.00014587205,0.432777,0.009255213,0.39348108,0.16318421,0.000029440997],"about_ca_topic_score_codex":0.0009143845,"about_ca_topic_score_gemma":0.0013311881,"teacher_disagreement_score":0.014835168,"about_ca_system_score_codex":0.0004121513,"about_ca_system_score_gemma":0.0003668785,"threshold_uncertainty_score":0.049628615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013707667,0.0006599698,0.977413,0.000328805,0.00011164363,0.000040133567,0.00009407049,0.00009800869,0.0075467373],"genre_scores_gemma":[0.50596404,0.0023202826,0.47685072,0.0002939642,0.00026114096,0.00026889265,0.00037734307,0.00040180297,0.013261804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994438,0.00019377511,0.00004297029,0.00007843743,0.00019654019,0.0000443935],"domain_scores_gemma":[0.9977276,0.0016913705,0.00016378768,0.00011124955,0.0002106492,0.00009543926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011651497,0.0007557437,0.0012726627,0.0006378386,0.0004723771,0.0017764566,0.0006825624,0.0019101469,0.003552398],"category_scores_gemma":[0.00409522,0.0006200227,0.00080773176,0.00095043203,0.0011149899,0.0015576282,0.0019730201,0.0014971694,0.0005375763],"study_design_candidate":"theoretical_or_conceptual","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.00011689213,0.000062163825,0.00053865946,0.0002063075,0.00004112302,0.00011887295,0.00011184025,0.8748241,0.0031616683,0.06913834,0.0022931977,0.049386814],"study_design_scores_gemma":[0.00002477255,0.000028860031,0.00014179188,0.000019144896,0.00001034799,0.000062136096,0.00004210787,0.9572013,0.0010057384,0.038729418,0.0027176053,0.000016725187],"about_ca_topic_score_codex":0.0015369172,"about_ca_topic_score_gemma":0.0010781012,"teacher_disagreement_score":0.003552398,"about_ca_system_score_codex":0.0004374895,"about_ca_system_score_gemma":0.00061640056,"threshold_uncertainty_score":0.011883974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003811682,0.0002781999,0.99358094,0.00010542342,0.000032656942,0.000020979222,0.000024322331,0.000034734036,0.0021111867],"genre_scores_gemma":[0.4262857,0.00084184157,0.56859094,0.00017113345,0.00015964388,0.0002928914,0.00010186832,0.00009948568,0.00345646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993517,0.0002515337,0.000034943205,0.000092249225,0.0002245408,0.000045068446],"domain_scores_gemma":[0.9990766,0.00065093127,0.000059543785,0.00004244216,0.00014072155,0.000029646304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001798792,0.00095889095,0.0013902587,0.00084150414,0.0005046995,0.0016247706,0.001790252,0.0016779158,0.0032527912],"category_scores_gemma":[0.00393165,0.0006211655,0.0012096053,0.0013063673,0.0007782703,0.0021977704,0.0011221541,0.0018042567,0.00032634244],"study_design_candidate":"theoretical_or_conceptual","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.000032703458,0.000040597417,0.00011284162,0.000089110516,0.000051041297,0.00006289542,0.00007355934,0.92109203,0.00092317385,0.043478377,0.0005736629,0.033470053],"study_design_scores_gemma":[0.000005859954,0.000013980424,0.000021560742,0.000010164468,0.00000915817,0.000009495167,0.00000664009,0.9838059,0.00008926075,0.015633691,0.00038852813,0.000005819233],"about_ca_topic_score_codex":0.0033630326,"about_ca_topic_score_gemma":0.0027456903,"teacher_disagreement_score":0.0033630326,"about_ca_system_score_codex":0.0011338184,"about_ca_system_score_gemma":0.0007691027,"threshold_uncertainty_score":0.010881722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007930325,0.00019924926,0.9964228,0.00008115156,0.000024660649,0.000033510092,0.000017456394,0.00006333429,0.0023647258],"genre_scores_gemma":[0.099396326,0.0008130479,0.8916273,0.00017717585,0.00010747878,0.00083620945,0.00012727927,0.00023897435,0.0066762217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987198,0.0005089685,0.00006982341,0.00014855951,0.0004870707,0.00006584824],"domain_scores_gemma":[0.9978137,0.0011947886,0.00012988201,0.00031926896,0.00044723463,0.00009502172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025798746,0.00067863695,0.0013521687,0.0011087396,0.0009991095,0.0016983504,0.003134897,0.0013826414,0.0047158306],"category_scores_gemma":[0.009092733,0.0007621446,0.0009458894,0.0012478937,0.0019920147,0.0025080733,0.0024517647,0.0022191785,0.0011014133],"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.000029994952,0.00003608626,0.00018295589,0.000119469085,0.00003177957,0.00004121636,0.00011107414,0.18187612,0.0012973436,0.77220875,0.0027749238,0.041290242],"study_design_scores_gemma":[0.000031127733,0.000048153448,0.000075327436,0.000040480998,0.000013579339,0.00006387216,0.00002751074,0.7095341,0.00065653183,0.27567774,0.013814975,0.000016533266],"about_ca_topic_score_codex":0.0022362766,"about_ca_topic_score_gemma":0.0031257947,"teacher_disagreement_score":0.0047158306,"about_ca_system_score_codex":0.0011168991,"about_ca_system_score_gemma":0.0015278509,"threshold_uncertainty_score":0.015776038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025402455,0.00008474146,0.99749833,0.00009246083,0.000018868692,0.00002400987,0.000016153443,0.00008273778,0.0019286075],"genre_scores_gemma":[0.031216353,0.0005554345,0.96054965,0.00022353856,0.00011297948,0.00044566405,0.00012836458,0.00028188858,0.006486087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843687,0.00053390703,0.000077284654,0.00028672346,0.0005719324,0.00009333206],"domain_scores_gemma":[0.9985337,0.0007856243,0.00006403206,0.0003121919,0.0002534689,0.000050961935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020844254,0.0014332592,0.0020129345,0.0017182718,0.0013088987,0.0020751662,0.0051658144,0.0023585104,0.011252262],"category_scores_gemma":[0.006865683,0.0010165137,0.0023935963,0.0036835473,0.0023388392,0.00391646,0.0036662314,0.004081358,0.002874718],"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.00004020459,0.00006602396,0.00018155681,0.00039550697,0.00012415387,0.00012462222,0.00023750169,0.26415038,0.0026560656,0.62856245,0.0071757105,0.09628583],"study_design_scores_gemma":[0.000034574397,0.000036527807,0.000053912154,0.000042757125,0.000038922713,0.00009259625,0.000032889307,0.68468493,0.0008681284,0.3009865,0.0131012015,0.000027061724],"about_ca_topic_score_codex":0.004196543,"about_ca_topic_score_gemma":0.005403104,"teacher_disagreement_score":0.011252262,"about_ca_system_score_codex":0.0010284338,"about_ca_system_score_gemma":0.0015635227,"threshold_uncertainty_score":0.03764254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10761439,0.0035641815,0.85842985,0.0011365976,0.00032870745,0.00067957555,0.0014692879,0.0029001513,0.023877311],"genre_scores_gemma":[0.38830563,0.0013058903,0.5991306,0.0004307363,0.0001458421,0.0008529165,0.0013253562,0.0006675563,0.007835451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838364,0.0010016724,0.000049771024,0.00012451773,0.00015582079,0.00028460397],"domain_scores_gemma":[0.9926806,0.006186879,0.00033832295,0.00028030042,0.0003265697,0.00018729531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031721941,0.0012319783,0.0020588269,0.0027262308,0.001357629,0.0021730359,0.0029839254,0.0031145287,0.010319149],"category_scores_gemma":[0.007970089,0.0015285312,0.0014597977,0.005027626,0.0016452953,0.0028533116,0.0011249064,0.0021989127,0.0012080071],"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.00022240987,0.00013447631,0.00026936017,0.00012264239,0.000055717814,0.000048426486,0.00006980779,0.94419074,0.00025038526,0.011850541,0.0050915447,0.037694022],"study_design_scores_gemma":[0.00012537639,0.00007611936,0.00012677738,0.000029759543,0.000029872715,0.000019880874,0.000045780438,0.98382896,0.00020614768,0.014265237,0.0012323419,0.000013710927],"about_ca_topic_score_codex":0.014942256,"about_ca_topic_score_gemma":0.016251963,"teacher_disagreement_score":0.014942256,"about_ca_system_score_codex":0.0024773062,"about_ca_system_score_gemma":0.0030814868,"threshold_uncertainty_score":0.034520984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7895647,0.0036241794,0.14507315,0.014257369,0.00034437136,0.00022245866,0.0018864967,0.00021328716,0.044813994],"genre_scores_gemma":[0.9752744,0.0011528184,0.006852877,0.0003512764,0.00012282231,0.00014796489,0.00034014115,0.000063672414,0.015694179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994436,0.00026908392,0.000014316058,0.00004993889,0.00004820095,0.00017477226],"domain_scores_gemma":[0.9931219,0.0054721516,0.0005019697,0.00007635901,0.00048343293,0.00034420443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018044792,0.0010432081,0.0019350243,0.0011945354,0.0012658228,0.0021794518,0.0019876512,0.0029030421,0.0064802826],"category_scores_gemma":[0.009898429,0.0007886555,0.0014961205,0.0008901627,0.00196985,0.0016579152,0.001891015,0.0021774098,0.0003635677],"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.00005857921,0.00005919426,0.0013758419,0.000043796797,0.000032681663,0.00014106132,0.00006420343,0.967952,0.0001500665,0.028422596,0.00086729164,0.0008325317],"study_design_scores_gemma":[0.000026909416,0.000016203578,0.00027095975,0.000008237945,0.000020197958,0.000020504136,0.00006981836,0.9946233,0.000038286315,0.0046587363,0.00023815801,0.000008708775],"about_ca_topic_score_codex":0.06631476,"about_ca_topic_score_gemma":0.025504552,"teacher_disagreement_score":0.06631476,"about_ca_system_score_codex":0.0026401721,"about_ca_system_score_gemma":0.0032021664,"threshold_uncertainty_score":0.13185751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03292324,0.003411898,0.91025186,0.0155839445,0.00671643,0.00015031577,0.0008611242,0.00074008055,0.029361121],"genre_scores_gemma":[0.61247456,0.0056809275,0.32570302,0.005195107,0.01224723,0.00051900453,0.0010416639,0.0011216978,0.036016893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961856,0.0012753702,0.00042048824,0.0008407404,0.0009284149,0.0003494094],"domain_scores_gemma":[0.97527903,0.016851783,0.0010380597,0.0030672303,0.0019917574,0.0017720644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067240493,0.0016175361,0.0030875013,0.004081017,0.0049044676,0.005985832,0.004473877,0.004395914,0.011817324],"category_scores_gemma":[0.034240894,0.0012634209,0.0037338429,0.0063465396,0.013169527,0.036523663,0.007770008,0.012221152,0.0011066772],"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.00002103849,0.000015322608,0.00022461869,0.000056935773,0.000008514371,0.00011113824,0.0002757774,0.0008232375,0.00023269274,0.990838,0.0025131882,0.0048795007],"study_design_scores_gemma":[0.00000494743,0.00001233448,0.00007657502,0.000020897945,0.000007857175,0.000035728597,0.0000474408,0.0035208343,0.00009681947,0.9930549,0.0031033435,0.00001840177],"about_ca_topic_score_codex":0.004787668,"about_ca_topic_score_gemma":0.004720132,"teacher_disagreement_score":0.011817324,"about_ca_system_score_codex":0.0025996915,"about_ca_system_score_gemma":0.002373376,"threshold_uncertainty_score":0.0395329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033627,0.0007047234,0.96203613,0.00087033014,0.00014600712,0.000024022542,0.000055961358,0.0002063957,0.0023293633],"genre_scores_gemma":[0.9101117,0.0008055874,0.08583657,0.00013042416,0.00021741849,0.000089315545,0.0001158155,0.000108642445,0.002584568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985239,0.0005088293,0.00011862739,0.00026237365,0.0004666756,0.00011954172],"domain_scores_gemma":[0.9927637,0.0051074196,0.00039746988,0.00090844685,0.0007084079,0.000114453964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002650478,0.00072899944,0.001693704,0.00072155625,0.0010399469,0.002090785,0.0012033656,0.0010589462,0.001700423],"category_scores_gemma":[0.015704166,0.00082010275,0.0006109285,0.0012182624,0.002199276,0.0035517395,0.0024821102,0.0016647094,0.00024352407],"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.00025158693,0.000038913233,0.00082961516,0.00008196727,0.000060411214,0.00010711416,0.00008306598,0.8511633,0.0010921373,0.110915944,0.0007862575,0.034589622],"study_design_scores_gemma":[0.000007089717,0.0000061311875,0.00008367782,0.0000026489913,0.000004776718,0.000010570541,0.000005383387,0.93411356,0.0002950233,0.06525866,0.00020790368,0.0000045178676],"about_ca_topic_score_codex":0.005423542,"about_ca_topic_score_gemma":0.0036514872,"teacher_disagreement_score":0.005423542,"about_ca_system_score_codex":0.0011488666,"about_ca_system_score_gemma":0.0013791024,"threshold_uncertainty_score":0.014017284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0218921,0.0005403792,0.974979,0.00015957927,0.00012906446,0.000046032124,0.00005768785,0.00031727648,0.001878992],"genre_scores_gemma":[0.44175363,0.0010385092,0.55247283,0.000087515684,0.00018915,0.0000734648,0.0001727941,0.000534226,0.0036778743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836594,0.00029931197,0.00012180593,0.00022198942,0.0009103206,0.000080652746],"domain_scores_gemma":[0.99667764,0.0011970302,0.0003254733,0.00072944665,0.0009286636,0.00014182946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016077827,0.00083823816,0.0012113693,0.0026193983,0.00047493418,0.0023576173,0.0012954362,0.0009968128,0.0023479941],"category_scores_gemma":[0.007142403,0.00054112246,0.0011799678,0.0017100784,0.0010054935,0.0021830685,0.0016702684,0.0010295303,0.0004982539],"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.000850659,0.00019425659,0.0032471397,0.00055906246,0.0002971597,0.0002864704,0.00028669863,0.34039977,0.109566,0.10140299,0.0046425983,0.4382672],"study_design_scores_gemma":[0.000041943476,0.0001820295,0.0011608106,0.000023025732,0.00007713474,0.00043587264,0.00003771158,0.9628136,0.022357127,0.008496126,0.0043200394,0.000054541862],"about_ca_topic_score_codex":0.0014035138,"about_ca_topic_score_gemma":0.0016597843,"teacher_disagreement_score":0.0026193983,"about_ca_system_score_codex":0.0008872806,"about_ca_system_score_gemma":0.0005436544,"threshold_uncertainty_score":0.008502841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11841589,0.0017265902,0.82002485,0.001933291,0.00032681428,0.00010463888,0.0005994181,0.00030830578,0.05656015],"genre_scores_gemma":[0.9451453,0.0011974258,0.016452104,0.00016731725,0.00014624168,0.00015001697,0.0002792641,0.00011078588,0.03635155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997842,0.000067531386,0.000011882011,0.000042092335,0.00005612897,0.000038208436],"domain_scores_gemma":[0.9993131,0.00035598705,0.000097355325,0.000035909212,0.00015744504,0.000040217674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013427,0.00076802575,0.0010812476,0.0010831769,0.00076564896,0.0016958282,0.0018241787,0.002467585,0.0049431217],"category_scores_gemma":[0.0024598832,0.00060873467,0.0007907652,0.0010197699,0.0016277962,0.0019831387,0.0010794079,0.0013534699,0.0005249302],"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.000015149689,0.00001613633,0.00017977659,0.000028965727,0.000010625311,0.0000824173,0.00004420218,0.95456976,0.0007032241,0.042722654,0.00040598252,0.0012211278],"study_design_scores_gemma":[0.000006340635,0.0000053148983,0.000052638425,0.0000036380416,0.0000036631463,0.000017075932,0.000011183835,0.99151987,0.00007932157,0.008030513,0.0002654839,0.0000049353275],"about_ca_topic_score_codex":0.011603814,"about_ca_topic_score_gemma":0.0047712694,"teacher_disagreement_score":0.011603814,"about_ca_system_score_codex":0.0012927417,"about_ca_system_score_gemma":0.00101514,"threshold_uncertainty_score":0.02307254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70272833,0.00032255714,0.23240481,0.0009210447,0.00028051203,0.00013605668,0.00051307876,0.0005106341,0.06218296],"genre_scores_gemma":[0.9800837,0.000052608037,0.014878356,0.00008508619,0.000019237099,0.000033270666,0.00034184533,0.000060941304,0.004444825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998792,0.0003464249,0.000053650958,0.00017840572,0.0004268957,0.00020265917],"domain_scores_gemma":[0.9963552,0.0022895446,0.00021343913,0.00038538434,0.0004385438,0.00031795088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013374035,0.0004986366,0.0009879392,0.00075848965,0.0007885074,0.0012489032,0.0015141274,0.0021618907,0.010986839],"category_scores_gemma":[0.0077044936,0.00033010144,0.0005606966,0.0008430961,0.0013268049,0.0020094134,0.0032240837,0.00095307356,0.0007367079],"study_design_candidate":"theoretical_or_conceptual","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.007888978,0.0013923858,0.013530132,0.00051193836,0.00031270535,0.0032727562,0.00083968526,0.53538394,0.060320534,0.2651214,0.012217046,0.099208474],"study_design_scores_gemma":[0.00026771374,0.00070334686,0.003045187,0.000056588666,0.00005186661,0.0006401188,0.0003787184,0.93847054,0.026125193,0.025808493,0.004352156,0.00010010985],"about_ca_topic_score_codex":0.0012719835,"about_ca_topic_score_gemma":0.00059785193,"teacher_disagreement_score":0.010986839,"about_ca_system_score_codex":0.0004310466,"about_ca_system_score_gemma":0.00063380337,"threshold_uncertainty_score":0.03675461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07352359,0.010712057,0.74484915,0.014384488,0.0021996582,0.0001395632,0.0002211086,0.0007703903,0.1532],"genre_scores_gemma":[0.7933279,0.008932512,0.15228614,0.0027621563,0.00265458,0.00014706493,0.00022746665,0.00068546884,0.03897673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984397,0.00046501253,0.00009744609,0.00014016921,0.00077132275,0.00008639505],"domain_scores_gemma":[0.99167526,0.0056068427,0.0005394287,0.0011922644,0.0008611613,0.00012495306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034721456,0.00049524766,0.00054943963,0.0014094495,0.0014718517,0.0018978141,0.0013438783,0.0022305015,0.0063163093],"category_scores_gemma":[0.021334542,0.0005146171,0.0007418367,0.001212477,0.005244132,0.003684186,0.0020363466,0.00452266,0.0009373133],"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.00035637786,0.00012594974,0.0015119116,0.00082756014,0.000033545573,0.0011720851,0.0031599689,0.038123284,0.03459463,0.8517865,0.009010425,0.059297726],"study_design_scores_gemma":[0.00010415446,0.00020853363,0.0034214188,0.0004330535,0.000032596323,0.0022906978,0.00077367993,0.23257607,0.044992123,0.6207627,0.094170004,0.00023492464],"about_ca_topic_score_codex":0.0014716687,"about_ca_topic_score_gemma":0.0006057266,"teacher_disagreement_score":0.0063163093,"about_ca_system_score_codex":0.0007343076,"about_ca_system_score_gemma":0.00040258095,"threshold_uncertainty_score":0.021130145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05565492,0.0009009086,0.9124333,0.00043104956,0.00015478866,0.00017461779,0.0004755559,0.0005647447,0.029210119],"genre_scores_gemma":[0.3316698,0.0016449466,0.6378407,0.00035863943,0.00020689995,0.000255217,0.0020762912,0.0008908935,0.025056757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878055,0.00024076334,0.00009433096,0.00027611552,0.00049035175,0.000117972304],"domain_scores_gemma":[0.9927609,0.0045961756,0.000514072,0.0012773494,0.0005458003,0.00030568568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381603,0.0014027021,0.0019430685,0.0023497886,0.0015645259,0.003222697,0.0024206454,0.002616211,0.015270202],"category_scores_gemma":[0.011052082,0.0017990121,0.0021017762,0.0018570635,0.0029806772,0.006142518,0.0058408827,0.0031039286,0.0024196303],"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.0006239326,0.00052263885,0.004663945,0.00071262877,0.0001099901,0.0005333023,0.001050091,0.3352559,0.009997095,0.4183235,0.015715992,0.21249115],"study_design_scores_gemma":[0.00008798457,0.00018394657,0.0008221035,0.000081588514,0.000049763454,0.0005459026,0.0003417488,0.6251817,0.0052960245,0.35525867,0.012093119,0.00005745683],"about_ca_topic_score_codex":0.0019593728,"about_ca_topic_score_gemma":0.002228834,"teacher_disagreement_score":0.015270202,"about_ca_system_score_codex":0.0007991544,"about_ca_system_score_gemma":0.00061227125,"threshold_uncertainty_score":0.051083922},"labels":[],"label_agreement":null}]}