{"meta":{"query_hash":"4cef4bdf43be","filters":{"venue":"Optimization methods & software"},"cohort_total":31,"direct_labels_cover":0,"predictions_cover":31,"exported":31,"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/4cef4bdf43be","api":"https://metacan.xera.ac/api/v1/cohort?venue=Optimization+methods+%26+software"},"results":[{"id":"W1821374938","doi":"10.1080/10556788.2015.1062891","title":"An efficient optimization approach for a cardinality-constrained index tracking problem","year":2015,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Key Research and Development Program of China; University of Otago","keywords":"Cardinality (data modeling); Mathematical optimization; Computer science; Tracking (education); Tracking error; Portfolio; Regularization (linguistics); Thresholding; Mathematics; Artificial intelligence; Data mining","score_opus":0.05089273698655643,"score_gpt":0.3335022468907675,"score_spread":0.2826095099042111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1821374938","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.0027676157,0.000103051105,0.99581075,0.0001453564,0.000014506731,0.000037850416,0.000029738583,0.00006705919,0.001024053],"genre_scores_gemma":[0.16992784,0.00038608498,0.8245601,0.000199904,0.00010588286,0.00040877404,0.00028443587,0.00016722016,0.003959757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990683,0.00033830706,0.000050971423,0.00020206149,0.000257448,0.00008291196],"domain_scores_gemma":[0.9980032,0.001346224,0.0001682227,0.00013337523,0.000262455,0.00008659248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023635465,0.0011656715,0.0014019682,0.0009865364,0.0006073655,0.0013501927,0.0013645686,0.001979844,0.004115816],"category_scores_gemma":[0.0059287134,0.00087712595,0.0010491402,0.0012382211,0.00086323684,0.0017587317,0.0018815311,0.0021731362,0.00071137986],"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.00005174601,0.00006926733,0.00044003554,0.00011085727,0.000034921664,0.00010015874,0.000057029287,0.9175522,0.0018135065,0.023944726,0.0020504785,0.053775065],"study_design_scores_gemma":[0.0000072227963,0.000015633752,0.000043899876,0.0000052661744,0.000003980067,0.000016513462,0.000004936561,0.9941122,0.00022035847,0.005189801,0.0003768951,0.0000033431058],"about_ca_topic_score_codex":0.0036165786,"about_ca_topic_score_gemma":0.003207803,"teacher_disagreement_score":0.004115816,"about_ca_system_score_codex":0.0009945253,"about_ca_system_score_gemma":0.0019642976,"threshold_uncertainty_score":0.013768792},"labels":[],"label_agreement":null},{"id":"W1981321991","doi":"10.1080/10556780412331332024","title":"An adaptive self-regular proximity-based large-update IPM for LO","year":2005,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Canada Research Chairs","keywords":"Interior point method; Mathematics; Value (mathematics); Position (finance); Point (geometry); Combinatorics; Degree (music); Class (philosophy); Algorithm; Upper and lower bounds; Power (physics); Discrete mathematics; Mathematical optimization; Computer science; Statistics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.05297343988889592,"score_gpt":0.4344821924655114,"score_spread":0.3815087525766155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981321991","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.0030656199,0.00008644442,0.99560153,0.00009093627,0.000026584266,0.00003586897,0.0000109670145,0.0002751398,0.00080695754],"genre_scores_gemma":[0.14505464,0.00012482012,0.8505851,0.00027206182,0.00009803252,0.00042869162,0.000103110884,0.00023398304,0.0030995174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993426,0.000209533,0.000033683074,0.00014859361,0.00021399723,0.000051557843],"domain_scores_gemma":[0.99889463,0.00052925176,0.000115381416,0.0001684671,0.00020244779,0.000089898225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013530505,0.0007460762,0.0011368234,0.000566167,0.00048113393,0.0008468977,0.0026524514,0.0016720082,0.0031881507],"category_scores_gemma":[0.0049320916,0.00051891146,0.0008047267,0.00046810915,0.00092499616,0.0015141021,0.0026999202,0.0022861832,0.0009542084],"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.0002350956,0.00020055378,0.0010871161,0.0002559198,0.00006456281,0.00012980847,0.00023750823,0.73049253,0.008941568,0.04314598,0.004935096,0.21027431],"study_design_scores_gemma":[0.000011501876,0.000027105521,0.000026706191,0.000005059317,0.000003125313,0.000014251154,0.0000044881112,0.99630827,0.00060155673,0.002305597,0.00068779517,0.000004488269],"about_ca_topic_score_codex":0.0012044425,"about_ca_topic_score_gemma":0.0013130883,"teacher_disagreement_score":0.0031881507,"about_ca_system_score_codex":0.00059934956,"about_ca_system_score_gemma":0.0011308764,"threshold_uncertainty_score":0.010665476},"labels":[],"label_agreement":null},{"id":"W1982277563","doi":"10.1080/1055678021000012480","title":"Discovering the Characteristics of Mathematical Programs via Sampling","year":2002,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Statistics Education and Methodologies","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Sampling (signal processing); Computer science; Data science; Telecommunications","score_opus":0.26658484846747105,"score_gpt":0.44752384355568237,"score_spread":0.18093899508821132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982277563","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.057086837,0.00016975876,0.9405275,0.00047624213,0.0000115137,0.00010526859,0.00013018464,0.00034102012,0.0011517043],"genre_scores_gemma":[0.4787515,0.0005066848,0.518205,0.00019017879,0.00007729143,0.00050185225,0.00065096526,0.00020652436,0.00091001537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950185,0.0025222723,0.0002538785,0.00080688926,0.0011987757,0.00019975787],"domain_scores_gemma":[0.93477464,0.054243006,0.0036304558,0.004685925,0.0021088975,0.0005571526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007786274,0.00072613836,0.0012264631,0.002897453,0.0008396839,0.0019515686,0.0012964928,0.0010432841,0.0014762185],"category_scores_gemma":[0.068014815,0.0009399044,0.0014348892,0.0017425831,0.0025305757,0.0056455075,0.0018711702,0.0024370214,0.00028066925],"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.00040005712,0.00027817354,0.02815848,0.0006103556,0.00021417848,0.0003573887,0.0012101124,0.3717389,0.006665,0.38990635,0.0032195766,0.19724143],"study_design_scores_gemma":[0.00003804937,0.00007105583,0.0011296321,0.00003161668,0.000019664894,0.000089618145,0.0000966691,0.810961,0.0022830158,0.18359695,0.0016604756,0.000022339334],"about_ca_topic_score_codex":0.0014147984,"about_ca_topic_score_gemma":0.0015389139,"teacher_disagreement_score":0.007786274,"about_ca_system_score_codex":0.0011894454,"about_ca_system_score_gemma":0.0018871956,"threshold_uncertainty_score":0.041178226},"labels":[],"label_agreement":null},{"id":"W1999360615","doi":"10.1080/10556780903239568","title":"Bi-parametric convex quadratic optimization","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Direktion für Entwicklung und Zusammenarbeit","keywords":"Quadratic equation; Parametric statistics; Mathematical optimization; Convex optimization; Quadratic function; Regular polygon; Perturbation (astronomy); Mathematics; Convex function; Function (biology); Optimization problem; Invariant (physics); Parametric equation; Quadratic programming; Computer science; Geometry; Physics","score_opus":0.07474502751145072,"score_gpt":0.4498631699427029,"score_spread":0.3751181424312522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999360615","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.0062476215,0.00026049174,0.99090064,0.00012146673,0.000021447226,0.00001410272,0.000030640742,0.00008629091,0.0023173634],"genre_scores_gemma":[0.63272387,0.00076572906,0.35584697,0.00017747494,0.00010522395,0.00018379389,0.00030292667,0.00030002173,0.009594063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848,0.00067345635,0.0000539987,0.00029311152,0.00038533006,0.00011412995],"domain_scores_gemma":[0.9980793,0.0011901319,0.00015365162,0.00024396605,0.00026203183,0.000071029186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018723159,0.0012328811,0.0012489127,0.0004668062,0.00042075483,0.0014931657,0.0012195109,0.0011736657,0.0025860674],"category_scores_gemma":[0.006823057,0.00044621326,0.0007641303,0.00097139843,0.0014626426,0.0015421933,0.0020555826,0.0016852298,0.00092892855],"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.00009085941,0.000033519507,0.00032157268,0.00013943425,0.000048575777,0.00011911416,0.000056862482,0.91653997,0.003537239,0.043264188,0.0009943121,0.03485442],"study_design_scores_gemma":[0.0000028060574,0.000022275091,0.00006905904,0.000003653902,0.0000037807408,0.000030372748,0.000008213795,0.98876023,0.0006547314,0.009766374,0.00067324674,0.0000052851146],"about_ca_topic_score_codex":0.0015677821,"about_ca_topic_score_gemma":0.001075964,"teacher_disagreement_score":0.0025860674,"about_ca_system_score_codex":0.0006195649,"about_ca_system_score_gemma":0.00069346663,"threshold_uncertainty_score":0.009901881},"labels":[],"label_agreement":null},{"id":"W2035488027","doi":"10.1080/10556780903420135","title":"Optimal scenario tree reduction for stochastic streamflows in power generation planning problems","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Water resources management and optimization","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Reduction (mathematics); Autoregressive model; Mathematical optimization; Resampling; A priori and a posteriori; Time horizon; Tree (set theory); Mathematics; Stochastic optimization; Set (abstract data type); Computer science; Algorithm; Statistics","score_opus":0.02767541781681218,"score_gpt":0.2891533921802617,"score_spread":0.26147797436344955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035488027","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.05551082,0.00032908528,0.9427229,0.00013405822,0.000014568481,0.000054269116,0.00007650888,0.000105568564,0.001052232],"genre_scores_gemma":[0.6434442,0.0004853176,0.35439152,0.000054936263,0.00003085412,0.00025537834,0.0004092732,0.000105282306,0.00082327146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930954,0.00048307248,0.00002048791,0.000046150057,0.00009796894,0.000042825508],"domain_scores_gemma":[0.99810994,0.0016432359,0.00007152671,0.00005085551,0.00008396723,0.00004050732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018661808,0.00051321555,0.0008082939,0.0008065543,0.00033656915,0.0004909566,0.0004503497,0.0005478849,0.0010400877],"category_scores_gemma":[0.004665548,0.00043891542,0.0008154216,0.0006941583,0.0005543137,0.00083919516,0.00057639857,0.00083155156,0.0001340014],"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.00002215359,0.000016243783,0.00020440605,0.000021327669,0.000010498151,0.000018872575,0.000021572692,0.98406214,0.00031408013,0.0061830096,0.00011794753,0.009007876],"study_design_scores_gemma":[0.0000029620358,0.00000974518,0.00005214386,0.000002248364,0.000001936491,0.0000035109624,0.0000034579114,0.99549794,0.000121885816,0.004204419,0.00009799845,0.0000017710009],"about_ca_topic_score_codex":0.0028926793,"about_ca_topic_score_gemma":0.0024951429,"teacher_disagreement_score":0.0028926793,"about_ca_system_score_codex":0.0005003039,"about_ca_system_score_gemma":0.000869054,"threshold_uncertainty_score":0.009869397},"labels":[],"label_agreement":null},{"id":"W2055184420","doi":"10.1080/10556788.2012.693928","title":"Sparse interpolatory reduced-order models for simulation of light-induced molecular transformations","year":2012,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; McMaster University; National Science Foundation","keywords":"Robustness (evolution); Interpolation (computer graphics); Algorithm; Computer science; Relaxation (psychology); Excitation; Biological system; Mathematical optimization; Applied mathematics; Mathematics; Chemistry; Artificial intelligence; Physics","score_opus":0.04470793301297124,"score_gpt":0.3512505846530016,"score_spread":0.30654265164003036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055184420","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.022540634,0.00009345928,0.97273266,0.00021043446,0.00003617793,0.000037880713,0.00019637503,0.0005553682,0.0035970397],"genre_scores_gemma":[0.6147447,0.00034217563,0.3769674,0.00016694926,0.000045541867,0.0005059841,0.0006314736,0.00047086275,0.006124864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978906,0.00006303329,0.00000855675,0.000019084433,0.00009887744,0.000021290369],"domain_scores_gemma":[0.99942774,0.0003190905,0.000048862577,0.0000876486,0.00008051929,0.00003612052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049499964,0.00038141332,0.0006990823,0.0003512701,0.00047485312,0.00051924767,0.0012091639,0.00095979846,0.0022358513],"category_scores_gemma":[0.0024054216,0.0004116795,0.00058572413,0.00064801244,0.00052960817,0.0008994974,0.00068534276,0.0014782809,0.00044826433],"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.000012890016,0.000011273201,0.00008646782,0.000013472224,0.000005305603,0.000010846162,0.000018518074,0.98600036,0.0006964314,0.010403347,0.00025769707,0.0024834857],"study_design_scores_gemma":[0.0000020523469,0.0000018510437,0.0000073859233,7.7913757e-7,5.070974e-7,0.0000010678991,0.0000010119019,0.99803036,0.00017669592,0.0015962712,0.00018076612,0.0000013017896],"about_ca_topic_score_codex":0.007596121,"about_ca_topic_score_gemma":0.0074999463,"teacher_disagreement_score":0.007596121,"about_ca_system_score_codex":0.0007926547,"about_ca_system_score_gemma":0.0012676724,"threshold_uncertainty_score":0.015103817},"labels":[],"label_agreement":null},{"id":"W2055391493","doi":"10.1080/10556780701661393","title":"Mehrotra-type predictor-corrector algorithm revisited","year":2008,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Predictor–corrector method; Perspective (graphical); Mathematics; Algorithm; Type (biology); Point (geometry); Interior point method; Upper and lower bounds; Polynomial; Combinatorics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.09444654323418775,"score_gpt":0.4244460149172123,"score_spread":0.32999947168302457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055391493","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.014976983,0.0002795044,0.9788193,0.0005447523,0.0001059606,0.00006956612,0.00004632574,0.0010355732,0.0041220677],"genre_scores_gemma":[0.3314008,0.0002551657,0.65737545,0.0003261973,0.00008836171,0.00020388837,0.00013355167,0.00025953545,0.009957027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817,0.0005845002,0.00012361704,0.00022132718,0.0006807326,0.00021980656],"domain_scores_gemma":[0.99689555,0.0014337309,0.00018570469,0.0006729041,0.00064368267,0.0001683915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026053775,0.0008880135,0.001401756,0.00068027555,0.0010369227,0.00150597,0.0025751046,0.001475643,0.0063350215],"category_scores_gemma":[0.008908638,0.0005017469,0.0006204294,0.0012062157,0.001783668,0.0017015857,0.0019481734,0.0034705934,0.0015427036],"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.0013126314,0.00021366401,0.0024762,0.00032610242,0.00013033093,0.00044454983,0.0004957494,0.5088878,0.006712336,0.24546736,0.00730878,0.22622448],"study_design_scores_gemma":[0.0000617898,0.000050441173,0.00009257515,0.000018365376,0.000009490432,0.00003853215,0.000017889148,0.97651947,0.0024734924,0.018676996,0.0020281968,0.000012757382],"about_ca_topic_score_codex":0.0075908,"about_ca_topic_score_gemma":0.006454371,"teacher_disagreement_score":0.0075908,"about_ca_system_score_codex":0.0012794075,"about_ca_system_score_gemma":0.0037501794,"threshold_uncertainty_score":0.02119273},"labels":[],"label_agreement":null},{"id":"W2077119768","doi":"10.1080/10556780108805808","title":"The Gauss-Newton direction in semidefinite programming","year":2001,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gauss; Computer science; Newton's method; Applied mathematics; Scaling; Nonlinear system; Mathematics; Physics","score_opus":0.07224147369964559,"score_gpt":0.4460038399389775,"score_spread":0.3737623662393319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077119768","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.0010136144,0.0009684163,0.9891088,0.00039244362,0.00015912385,0.000026503145,0.000043640997,0.00015577402,0.008131787],"genre_scores_gemma":[0.073528916,0.0043445984,0.9078173,0.0005757923,0.00039399756,0.00032218124,0.00023783618,0.0003421829,0.012437167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987866,0.00046871166,0.000042395503,0.00013870452,0.000520686,0.000042877295],"domain_scores_gemma":[0.9990583,0.0004923209,0.00008801912,0.000101960344,0.00021096313,0.000048491496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016698884,0.00090405945,0.0006872257,0.00064755033,0.0005233338,0.0014551661,0.00074898096,0.00085705833,0.0034978113],"category_scores_gemma":[0.0033375002,0.0006782086,0.0005711717,0.0010704681,0.0026399235,0.001501376,0.001412041,0.0037569162,0.0026053838],"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.00005783299,0.0000528465,0.00019528763,0.00037828519,0.000037588816,0.000087762106,0.00018812556,0.07346599,0.0026429237,0.74822915,0.01620098,0.15846325],"study_design_scores_gemma":[0.000050751132,0.000060078397,0.00012654666,0.0001309068,0.000014283621,0.00014539715,0.0000370973,0.34553942,0.003316837,0.5922668,0.058271047,0.000040876323],"about_ca_topic_score_codex":0.0010960444,"about_ca_topic_score_gemma":0.00149937,"teacher_disagreement_score":0.0034978113,"about_ca_system_score_codex":0.00050309044,"about_ca_system_score_gemma":0.0012073341,"threshold_uncertainty_score":0.011701345},"labels":[],"label_agreement":null},{"id":"W2081215000","doi":"10.1080/1055678021000039175","title":"A dynamic large-update primal‐dual interior-point method for linear optimization","year":2002,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Duality gap; Duality (order theory); Interior point method; Path (computing); Mathematical optimization; Mathematics; Dual (grammatical number); Function (biology); Simple (philosophy); Optimization problem; Point (geometry); Power (physics); Computer science; Discrete mathematics","score_opus":0.05516734349933614,"score_gpt":0.4375199633420161,"score_spread":0.38235261984267993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081215000","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.0027401822,0.00009181552,0.99562126,0.00008478074,0.00002726176,0.000027045196,0.00001102818,0.000081395796,0.0013151465],"genre_scores_gemma":[0.27350423,0.0003167446,0.7200912,0.00016446337,0.000115989096,0.00044321976,0.00011861023,0.0001647802,0.0050806943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965143,0.00014142129,0.000013625283,0.0000675842,0.00010226177,0.000023760513],"domain_scores_gemma":[0.99963164,0.00019376975,0.000041601546,0.00004086181,0.00006163451,0.000030513911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087484234,0.0006897072,0.0009213116,0.00038001168,0.00038761727,0.00072372245,0.0013338539,0.0009620489,0.0023820978],"category_scores_gemma":[0.0021469113,0.0004373013,0.00068334345,0.00042345806,0.00072658446,0.0010346782,0.0016905369,0.0017674698,0.00048524557],"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.000085538995,0.000089605215,0.00040367362,0.0001417,0.000038268503,0.000100820915,0.00011174372,0.84917796,0.003961597,0.0774078,0.0028391033,0.065642215],"study_design_scores_gemma":[0.000006010862,0.000014714798,0.000014583949,0.0000028561437,0.0000019075399,0.0000087749095,0.0000026308915,0.9963415,0.00023960482,0.0027476684,0.00061716244,0.0000024788187],"about_ca_topic_score_codex":0.0011108489,"about_ca_topic_score_gemma":0.00087706157,"teacher_disagreement_score":0.0023820978,"about_ca_system_score_codex":0.00051707576,"about_ca_system_score_gemma":0.00090689445,"threshold_uncertainty_score":0.007968903},"labels":[],"label_agreement":null},{"id":"W2098204196","doi":"10.1080/10556788.2014.936438","title":"Penalty decomposition methods for rank minimization","year":2014,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Minification; Mathematical optimization; Penalty method; Mathematics; Low-rank approximation; Matrix (chemical analysis); Sequence (biology); Algorithm; Computer science; Combinatorics; Hankel matrix","score_opus":0.03348095355379413,"score_gpt":0.39550123841638335,"score_spread":0.3620202848625892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098204196","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.0008896248,0.0002980029,0.9976672,0.00009784562,0.000031218093,0.000015620268,0.00002002028,0.000047925772,0.00093255757],"genre_scores_gemma":[0.07105533,0.0016068416,0.91891736,0.00021245625,0.00024218371,0.00021210704,0.00025863358,0.00025342708,0.007241612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989108,0.00048968237,0.000046536574,0.00014131704,0.0003560053,0.000055590215],"domain_scores_gemma":[0.99827135,0.000956916,0.00016323027,0.00022467678,0.00030826282,0.00007551691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825512,0.0012562427,0.0010333887,0.0006662107,0.00041079783,0.000954102,0.0009302017,0.0013475477,0.0036274611],"category_scores_gemma":[0.005190806,0.00043438032,0.00069253874,0.00090736384,0.001207341,0.0014707155,0.0014464987,0.0023740951,0.0015091434],"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.00013955134,0.000104734754,0.0005433738,0.0007992348,0.00012342486,0.0002073068,0.00016461052,0.44525737,0.018940741,0.32224634,0.009882045,0.20159118],"study_design_scores_gemma":[0.000012213936,0.000043400727,0.00007947522,0.00003139158,0.000009861224,0.00009788249,0.000013873293,0.94683707,0.0028292167,0.0421957,0.007835754,0.000014195992],"about_ca_topic_score_codex":0.0007833406,"about_ca_topic_score_gemma":0.0008820473,"teacher_disagreement_score":0.0036274611,"about_ca_system_score_codex":0.00043416093,"about_ca_system_score_gemma":0.00075853016,"threshold_uncertainty_score":0.012135029},"labels":[],"label_agreement":null},{"id":"W2110069759","doi":"10.1080/10556780902917735","title":"Provably near-optimal solutions for very large single-row facility layout problems","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Princeton University","keywords":"Relaxation (psychology); Semidefinite programming; Mathematical optimization; Facility location problem; Mathematics; Linear programming relaxation; Set (abstract data type); Representation (politics); Linear programming; Matrix (chemical analysis); Quadratic equation; Computer science","score_opus":0.035586968543957785,"score_gpt":0.29406588871605993,"score_spread":0.25847892017210217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110069759","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.04850624,0.0014307948,0.9278346,0.0014469037,0.00013132242,0.00017465783,0.0007610451,0.001146392,0.018568028],"genre_scores_gemma":[0.46522227,0.0012954882,0.52488804,0.00058092846,0.00028110814,0.00055925024,0.0016320767,0.00058319326,0.004957565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771667,0.0009469275,0.000107787346,0.00041714348,0.00049642933,0.00031508628],"domain_scores_gemma":[0.9900205,0.008128416,0.00058847934,0.00064543705,0.0003654666,0.00025165852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034712942,0.0017222114,0.0019254705,0.0008122041,0.001017233,0.0023727438,0.0018717769,0.0018234765,0.0075973514],"category_scores_gemma":[0.013824107,0.0010409371,0.0012989567,0.0015408532,0.0017143592,0.0030750423,0.0026679374,0.0036472618,0.0012059744],"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.00020805829,0.00015102894,0.0003919545,0.00046621804,0.000083110644,0.00014804988,0.00011858468,0.90490043,0.0018744239,0.050418053,0.007907214,0.03333285],"study_design_scores_gemma":[0.0001090418,0.00009157596,0.00016286134,0.000042823398,0.000025311267,0.00009264942,0.00008622823,0.87046885,0.0011339753,0.12485321,0.0029170567,0.00001644267],"about_ca_topic_score_codex":0.0012826028,"about_ca_topic_score_gemma":0.0024789893,"teacher_disagreement_score":0.0075973514,"about_ca_system_score_codex":0.0014068478,"about_ca_system_score_gemma":0.0015022513,"threshold_uncertainty_score":0.025415719},"labels":[],"label_agreement":null},{"id":"W2117753887","doi":"10.1080/10556780802414049","title":"An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners","year":2008,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Preconditioner; Solver; Mathematics; Path (computing); Iterative method; Interior point method; Regular polygon; Linear programming; Mathematical optimization; Algorithm; Computer science","score_opus":0.07167003668825579,"score_gpt":0.42188048575709164,"score_spread":0.35021044906883586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117753887","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.0010834903,0.000035181016,0.9977938,0.00005269332,0.000019874109,0.00004292013,0.000012682074,0.0001759143,0.00078338257],"genre_scores_gemma":[0.03528968,0.00008995488,0.96200424,0.000078764046,0.000023838034,0.00026130088,0.00009831104,0.00012911914,0.0020247013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994978,0.00015911463,0.000027001868,0.00008759976,0.00017758731,0.000050971652],"domain_scores_gemma":[0.999255,0.00036526844,0.00006730949,0.00009772052,0.00016648251,0.00004815198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010736116,0.00094171334,0.001030949,0.0005149912,0.00058869325,0.00074560824,0.001368366,0.001321028,0.0056219236],"category_scores_gemma":[0.0024713366,0.00053088914,0.0007915772,0.00055766554,0.0007646009,0.001091003,0.0016102386,0.0029285636,0.0017149256],"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.00020333081,0.0001527924,0.00066225237,0.00026551983,0.00007067181,0.00019729389,0.0002232143,0.6247709,0.009780877,0.08242561,0.008382579,0.272865],"study_design_scores_gemma":[0.000024626732,0.000030866755,0.000033883658,0.000008843685,0.0000040429372,0.000031541473,0.000006195284,0.9918349,0.0011347365,0.0044782665,0.0024037038,0.000008433128],"about_ca_topic_score_codex":0.0029764927,"about_ca_topic_score_gemma":0.0034099354,"teacher_disagreement_score":0.0056219236,"about_ca_system_score_codex":0.000627432,"about_ca_system_score_gemma":0.0021261699,"threshold_uncertainty_score":0.018807173},"labels":[],"label_agreement":null},{"id":"W2127485070","doi":"10.1080/10556780802079958","title":"The smoothed Monte Carlo method in robustness optimization","year":2008,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vancouver Island University","keywords":"Robustness (evolution); Monte Carlo method; Mathematical optimization; Classification of discontinuities; Computer science; Nonlinear system; Monte Carlo integration; Robust optimization; Hybrid Monte Carlo; Algorithm; Mathematics; Markov chain Monte Carlo; Statistics; Physics","score_opus":0.0963803541285717,"score_gpt":0.40177578685875887,"score_spread":0.30539543273018716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127485070","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.0006475439,0.00062399963,0.99721956,0.000087825465,0.000036664944,0.000013112032,0.000015110867,0.000111801775,0.0012443786],"genre_scores_gemma":[0.20151938,0.0033484888,0.78652185,0.000407492,0.00046133433,0.0004187949,0.00021472848,0.0004546667,0.0066532665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977163,0.0012306023,0.00006194074,0.00021804347,0.0007012483,0.00007184854],"domain_scores_gemma":[0.99568653,0.003306753,0.00024147311,0.0003418371,0.00034363286,0.000079885336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851635,0.0010855187,0.0015715199,0.001825326,0.0005249955,0.0012447033,0.0013666286,0.001689623,0.0031886294],"category_scores_gemma":[0.010121703,0.00075588626,0.0014969835,0.0018851202,0.0024594786,0.001540275,0.0014989633,0.0023824559,0.00082547026],"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.000055074983,0.000020371352,0.00022384705,0.00015924305,0.00009333825,0.00005850726,0.00004409071,0.7337896,0.001968321,0.22341052,0.0014361729,0.0387409],"study_design_scores_gemma":[0.0000112488515,0.000030403722,0.000099231824,0.00002608417,0.000018658235,0.00003670328,0.000003690508,0.9299486,0.0007691001,0.06435739,0.004675914,0.000022929018],"about_ca_topic_score_codex":0.0033413693,"about_ca_topic_score_gemma":0.0017973379,"teacher_disagreement_score":0.003851635,"about_ca_system_score_codex":0.0013235417,"about_ca_system_score_gemma":0.0016706429,"threshold_uncertainty_score":0.020369649},"labels":[],"label_agreement":null},{"id":"W2131570268","doi":"10.1080/10556780701374633","title":"Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming","year":2007,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Semidefinite programming; Mathematics; Interior point method; Semidefinite embedding; Path (computing); Quadratically constrained quadratic program; Positive-definite matrix; Linear programming; Matrix (chemical analysis); Limit point; Mathematical optimization; Limiting; Applied mathematics; Combinatorics; Quadratic programming; Mathematical analysis; Computer science; Eigenvalues and eigenvectors","score_opus":0.06043185546229511,"score_gpt":0.4208278119046966,"score_spread":0.36039595644240147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131570268","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.13607994,0.00042745913,0.8539032,0.000534275,0.00003502386,0.0000780305,0.00009215141,0.00017908314,0.008670936],"genre_scores_gemma":[0.820922,0.0006365758,0.1663052,0.00025189848,0.000045291057,0.00040915346,0.00027469563,0.00034692974,0.010808225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998845,0.000601703,0.000034778743,0.00016456579,0.00023111222,0.00012284056],"domain_scores_gemma":[0.9876987,0.008814594,0.001285804,0.0005433764,0.0010118643,0.00064570666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038745534,0.0012730277,0.0008562355,0.001221634,0.001032803,0.0017713998,0.0015193657,0.0013244591,0.0041698324],"category_scores_gemma":[0.027175574,0.000667582,0.00090910925,0.0006159607,0.0034368099,0.0036764422,0.002332539,0.0026391854,0.00037835698],"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.00020795307,0.0001006621,0.001764869,0.00020980323,0.00006524957,0.00039012515,0.00039973547,0.35058478,0.0039685396,0.62754464,0.0016247225,0.013138923],"study_design_scores_gemma":[0.00001385025,0.000038272337,0.00014194737,0.000027695756,0.0000072144317,0.000076727425,0.00004833419,0.871021,0.0010266965,0.12701955,0.00056224596,0.00001641204],"about_ca_topic_score_codex":0.0019121807,"about_ca_topic_score_gemma":0.0016292988,"teacher_disagreement_score":0.0041698324,"about_ca_system_score_codex":0.001436458,"about_ca_system_score_gemma":0.0010345175,"threshold_uncertainty_score":0.020490825},"labels":[],"label_agreement":null},{"id":"W2152778795","doi":"10.1080/10556788.2012.732074","title":"A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods","year":2012,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chebyshev filter; Newton's method; Convergence (economics); Newton's method in optimization; Chebyshev iteration; Mathematical optimization; Displacement (psychology); Computer science; Acceleration; Order (exchange); Applied mathematics; Mathematics; Iterative method; Algorithm; Local convergence; Nonlinear system; Mathematical analysis","score_opus":0.07117554534218135,"score_gpt":0.42126790628190786,"score_spread":0.3500923609397265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152778795","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.0023099205,0.00083379087,0.99310005,0.00010633658,0.0001257392,0.00004031611,0.00004055744,0.0001077233,0.003335499],"genre_scores_gemma":[0.05572735,0.002124001,0.931721,0.00018601328,0.00020106886,0.00031185488,0.00018372224,0.00026224426,0.009282787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993625,0.00019502552,0.000036594516,0.00007656511,0.00029295537,0.00003642026],"domain_scores_gemma":[0.99924445,0.00027575498,0.0000690242,0.00008577863,0.00027350517,0.00005158352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012103089,0.0010453371,0.000850417,0.0012397564,0.0006152575,0.0011369771,0.0010243069,0.0010909821,0.0029308563],"category_scores_gemma":[0.0021962046,0.00044929233,0.0010314088,0.0012388339,0.0012145385,0.0014320074,0.0010306033,0.0022440592,0.0014554925],"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.000103071245,0.00007828111,0.0009213228,0.00041939857,0.000067054316,0.00010605271,0.00018997336,0.14070952,0.01870764,0.60993373,0.0075125215,0.22125137],"study_design_scores_gemma":[0.000042953525,0.00012681627,0.00042397247,0.000078445126,0.000020071026,0.00019946738,0.000025256157,0.8081008,0.005351968,0.12886547,0.056692887,0.000071873066],"about_ca_topic_score_codex":0.0016093457,"about_ca_topic_score_gemma":0.0017265051,"teacher_disagreement_score":0.0029308563,"about_ca_system_score_codex":0.00066538295,"about_ca_system_score_gemma":0.0015265021,"threshold_uncertainty_score":0.009804666},"labels":[],"label_agreement":null},{"id":"W2155945500","doi":"10.1080/10556780903334682","title":"Robust portfolio selection based on a joint ellipsoidal uncertainty set","year":2009,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Portfolio; Robust optimization; Selection (genetic algorithm); Ellipsoid; Mathematics; Portfolio optimization; Mathematical optimization; Modern portfolio theory; Set (abstract data type); Project portfolio management; Computer science; Artificial intelligence; Economics; Financial economics","score_opus":0.13396194156147348,"score_gpt":0.40509937454343903,"score_spread":0.2711374329819656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155945500","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.013784329,0.00037469136,0.98332894,0.00015121693,0.000013803251,0.000027146394,0.000054107302,0.00005049313,0.0022151563],"genre_scores_gemma":[0.7957404,0.0014602268,0.19771384,0.0002176177,0.0001274773,0.00029168994,0.00047560202,0.000075225085,0.003897899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949267,0.0022505687,0.00022045597,0.0006729375,0.0015813089,0.0003479241],"domain_scores_gemma":[0.99196047,0.0057912283,0.0008187787,0.00040429368,0.0007762101,0.00024901945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064576254,0.0014670674,0.0022475487,0.0019653365,0.00053547625,0.0025650288,0.0017085823,0.001298591,0.0021483246],"category_scores_gemma":[0.013517568,0.0010316957,0.0018972983,0.0018252444,0.0016157205,0.0032737153,0.0031519097,0.0021155565,0.00036411785],"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.00010320857,0.000024461942,0.00064969505,0.000076085766,0.0000978529,0.00014889483,0.00007793764,0.8661999,0.0008655734,0.1120565,0.00073854125,0.01896134],"study_design_scores_gemma":[0.00000793893,0.000028089613,0.000120537625,0.000013164232,0.00001184542,0.000030962703,0.000007457629,0.97044814,0.00025927424,0.028748503,0.0003114574,0.0000126261575],"about_ca_topic_score_codex":0.002340218,"about_ca_topic_score_gemma":0.0009793573,"teacher_disagreement_score":0.0064576254,"about_ca_system_score_codex":0.0013828278,"about_ca_system_score_gemma":0.0009911333,"threshold_uncertainty_score":0.034151614},"labels":[],"label_agreement":null},{"id":"W2162546528","doi":"10.1080/10556788.2014.968158","title":"A derivative-free comirror algorithm for convex optimization","year":2014,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Mathematical optimization; Convex function; Rate of convergence; Interpolation (computer graphics); Convex optimization; Convex combination; Convergence (economics); Algorithm; Regular polygon; Computer science; Key (lock)","score_opus":0.021308854748996735,"score_gpt":0.3018796195636025,"score_spread":0.28057076481460574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162546528","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.0014571396,0.0001143168,0.99719363,0.0000898091,0.000032527503,0.000022587363,0.000012726857,0.00008388102,0.0009933858],"genre_scores_gemma":[0.07288168,0.00028668658,0.9230063,0.00015620899,0.00007149389,0.0001410169,0.00008692781,0.00012216654,0.0032474946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934655,0.00016036247,0.000035306162,0.00012481601,0.0002890825,0.000043889315],"domain_scores_gemma":[0.999298,0.00036427722,0.00005992051,0.00010341307,0.00012993772,0.00004445849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011975038,0.0008674105,0.00096476125,0.00043318054,0.00036141256,0.0009040802,0.0014863167,0.0014271996,0.0025517386],"category_scores_gemma":[0.0035618541,0.0004212975,0.00070166704,0.00054629234,0.000930931,0.001134007,0.001800405,0.0021561207,0.0008270544],"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.00023205948,0.00011159535,0.0006902816,0.00034069974,0.000079823076,0.00020567447,0.00017127016,0.5973629,0.0185251,0.11686431,0.004664265,0.2607521],"study_design_scores_gemma":[0.00001941396,0.00005110874,0.000047280028,0.000014262329,0.0000042378774,0.00006220084,0.000007888245,0.9874326,0.0027576596,0.006860238,0.0027340367,0.000009008109],"about_ca_topic_score_codex":0.0013115465,"about_ca_topic_score_gemma":0.001819621,"teacher_disagreement_score":0.0025517386,"about_ca_system_score_codex":0.00060803565,"about_ca_system_score_gemma":0.0010980311,"threshold_uncertainty_score":0.008536398},"labels":[],"label_agreement":null},{"id":"W2619018971","doi":"10.1080/10556788.2017.1322080","title":"ARC<sub>q</sub>: a new adaptive regularization by cubics","year":2017,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc (geometry); Corollary; Regularization (linguistics); Convergence (economics); Factorization; Computer science; Algorithm; Key (lock); Mathematics; Discrete mathematics; Geometry; Artificial intelligence","score_opus":0.02612210389689576,"score_gpt":0.29507553039938456,"score_spread":0.26895342650248877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619018971","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.0019338818,0.00009500008,0.99640465,0.00011884006,0.000049163948,0.000020700167,0.00003197829,0.000224443,0.0011213796],"genre_scores_gemma":[0.08159457,0.00026584076,0.91169345,0.00020246272,0.00009086864,0.000099963516,0.00013492702,0.00038057094,0.005537425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927455,0.00014157695,0.00003028625,0.000097657685,0.00038344736,0.00007255428],"domain_scores_gemma":[0.9989889,0.00034768166,0.00008636923,0.00017681014,0.0003119026,0.00008837561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118401,0.00057487795,0.0005725512,0.00058589777,0.00044871212,0.0008621151,0.001339926,0.0011008673,0.004945169],"category_scores_gemma":[0.00287073,0.00038071207,0.00075603544,0.00097079936,0.0010124868,0.0010466649,0.0018596991,0.00224519,0.0015990012],"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.00035235618,0.00011638727,0.0009473364,0.00043087226,0.000087388864,0.00020363642,0.00026842378,0.38168883,0.043546997,0.12501541,0.019211838,0.42813063],"study_design_scores_gemma":[0.000017609227,0.000046931207,0.00007294145,0.000009743657,0.0000058156515,0.000082261016,0.000013945729,0.98156655,0.0035760782,0.007656818,0.006936251,0.000015078497],"about_ca_topic_score_codex":0.0061559817,"about_ca_topic_score_gemma":0.006214006,"teacher_disagreement_score":0.0061559817,"about_ca_system_score_codex":0.0006597118,"about_ca_system_score_gemma":0.0016746464,"threshold_uncertainty_score":0.01654321},"labels":[],"label_agreement":null},{"id":"W2755905518","doi":"10.1080/10556788.2017.1374385","title":"Computationally relevant generalized derivatives: theory, evaluation and applications","year":2017,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Process Optimization and Integration","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Novartis-MIT Center for Continuous Manufacturing; Science and Engineering Research Council; Statoil","keywords":"Extension (predicate logic); Automatic differentiation; Mathematics; Context (archaeology); Mathematical optimization; Lexicographical order; Inverse; Computer science; Calculus (dental); Algorithm","score_opus":0.029733858417360495,"score_gpt":0.36173984780559043,"score_spread":0.33200598938822995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755905518","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.0022862563,0.010854322,0.97326905,0.0005357509,0.00030275786,0.000036867947,0.00008691655,0.00018725428,0.012440774],"genre_scores_gemma":[0.22418754,0.040031314,0.70925105,0.0005924287,0.0012735975,0.00030064772,0.0003954954,0.0009463797,0.023021484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907076,0.00027047162,0.000075475895,0.00011679527,0.0004206236,0.0000457441],"domain_scores_gemma":[0.99890435,0.00059107924,0.00010989088,0.00011250909,0.00023374918,0.00004840959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012916434,0.0012823518,0.0013392721,0.0017534574,0.00056493795,0.0027031256,0.0010656386,0.0011755369,0.0044305166],"category_scores_gemma":[0.0039596665,0.00047473342,0.0010735579,0.0021171696,0.0016956805,0.0025212516,0.0017243935,0.0021345862,0.0012054794],"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.000027730051,0.000031604806,0.00045303715,0.00087197917,0.000060691265,0.00020315686,0.00012747163,0.10853372,0.004006604,0.7256498,0.0064975326,0.15353674],"study_design_scores_gemma":[0.000009767363,0.000051675757,0.0003455981,0.00025013465,0.00004590819,0.00035036934,0.00007010732,0.45959187,0.0026701353,0.4750264,0.061532363,0.00005565454],"about_ca_topic_score_codex":0.0014863068,"about_ca_topic_score_gemma":0.0015791768,"teacher_disagreement_score":0.0044305166,"about_ca_system_score_codex":0.0009868315,"about_ca_system_score_gemma":0.0012213605,"threshold_uncertainty_score":0.014821529},"labels":[],"label_agreement":null},{"id":"W2760492644","doi":"10.1080/10556788.2019.1692344","title":"mts: a light framework for parallelizing tree search codes","year":2019,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science","keywords":"Computer science; Backtracking; Enumeration; Satisfiability; Debugging; Search tree; Parallel computing; Vertex (graph theory); Theoretical computer science; Branch and bound; Search algorithm; Algorithm; Graph; Programming language; Discrete mathematics; Mathematics","score_opus":0.0714005721263264,"score_gpt":0.40162440456002696,"score_spread":0.33022383243370057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760492644","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022599483,0.00008129245,0.98873353,0.00009955268,0.000043664062,0.0000861366,0.00011397139,0.006415589,0.002166359],"genre_scores_gemma":[0.06005082,0.00023524757,0.9307174,0.00017489334,0.00008642835,0.0006443101,0.00051031256,0.0036874935,0.0038932168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978325,0.00049881625,0.0002046193,0.00026905962,0.00091719226,0.00027787648],"domain_scores_gemma":[0.99752015,0.00077690044,0.00019603154,0.0008340459,0.00051401433,0.00015867036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016996129,0.0012750948,0.0010774148,0.0015758377,0.0012167982,0.0021070784,0.0031899333,0.0010963326,0.010450741],"category_scores_gemma":[0.0061235125,0.0010083383,0.0020786626,0.001968342,0.0024857302,0.0032692093,0.0030598887,0.0029376908,0.0035942567],"study_design_candidate":"not_applicable","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.0006002251,0.00017759447,0.0013371399,0.00063040666,0.00010021426,0.0004084515,0.00063659286,0.17673518,0.024201315,0.47968608,0.025030617,0.29045615],"study_design_scores_gemma":[0.0002135733,0.00014519015,0.00026642488,0.00011254135,0.00005733323,0.00021910017,0.00008906176,0.6332071,0.025048455,0.24940555,0.09116028,0.000075473945],"about_ca_topic_score_codex":0.00464805,"about_ca_topic_score_gemma":0.0052824565,"teacher_disagreement_score":0.010450741,"about_ca_system_score_codex":0.0017817816,"about_ca_system_score_gemma":0.0023900545,"threshold_uncertainty_score":0.034961224},"labels":[],"label_agreement":null},{"id":"W3020649264","doi":"10.1080/10556788.2020.1751154","title":"Exponential augmented Lagrangian methods for equilibrium problems","year":2020,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Lagrangian; Applied mathematics; Augmented Lagrangian method; Exponential function; Mathematics; Mathematical optimization; Mathematical economics; Computer science; Mathematical analysis","score_opus":0.048229573428117165,"score_gpt":0.3630258536378706,"score_spread":0.3147962802097534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020649264","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.0009725522,0.00025056704,0.99509144,0.00007964018,0.00004787554,0.000017091123,0.000032121494,0.00009158288,0.0034170789],"genre_scores_gemma":[0.19546136,0.0020401753,0.7717804,0.00028677617,0.00022085331,0.00048167518,0.00048667655,0.00043910573,0.028803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946123,0.00018752785,0.000029710885,0.000059459326,0.00021173184,0.000050339902],"domain_scores_gemma":[0.99925524,0.00033330012,0.0000717165,0.00006945567,0.00021876708,0.000051475814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011590829,0.001097515,0.0008315222,0.0008369878,0.00044956844,0.001228484,0.0014381298,0.0010435241,0.008436607],"category_scores_gemma":[0.0025548646,0.0003967499,0.00083374535,0.00068127207,0.0010473477,0.001771705,0.002151066,0.0018915172,0.0018945769],"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.000051696716,0.00007718275,0.00037058425,0.00032823428,0.000048045582,0.00010887865,0.00013515179,0.54700404,0.0030512938,0.34070417,0.0058158697,0.10230486],"study_design_scores_gemma":[0.000011198108,0.000022956634,0.00004575314,0.000024924562,0.0000051476354,0.00002904942,0.000016944457,0.94670457,0.0005319373,0.04281235,0.009784435,0.0000106838725],"about_ca_topic_score_codex":0.0023185937,"about_ca_topic_score_gemma":0.0029691516,"teacher_disagreement_score":0.008436607,"about_ca_system_score_codex":0.00049972866,"about_ca_system_score_gemma":0.0011213068,"threshold_uncertainty_score":0.028223336},"labels":[],"label_agreement":null},{"id":"W3021430041","doi":"10.1080/10556788.2020.1864370","title":"Sparktope: linear programs from algorithms","year":2021,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; McGill University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; Algorithm; Polynomial; Matching (statistics); Bipartite graph; Extension (predicate logic); TRACE (psycholinguistics); Time complexity; Linear programming; Exponential function; Graph; Programming language; Theoretical computer science; Mathematics","score_opus":0.06472395234384083,"score_gpt":0.3537934815381213,"score_spread":0.2890695291942805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021430041","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.0010250881,0.00057724566,0.9772524,0.00048030735,0.000122255,0.00014657888,0.00060276996,0.009899721,0.009893642],"genre_scores_gemma":[0.025811998,0.0011133892,0.9560429,0.0005637796,0.00018565124,0.001068068,0.0027415322,0.005127076,0.007345626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973623,0.0006589807,0.00018760737,0.00048763017,0.0011204039,0.00018305937],"domain_scores_gemma":[0.9969638,0.0020807735,0.000120329605,0.00044683067,0.00030269416,0.00008564394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033193,0.0020056618,0.0013019106,0.0015853567,0.00071808795,0.00252319,0.002494889,0.001144426,0.02131932],"category_scores_gemma":[0.007973906,0.0013955183,0.00241576,0.0021517782,0.0016759584,0.003354381,0.0031743285,0.0045037935,0.008823865],"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.00021820066,0.00015279885,0.00028726133,0.0016290401,0.00011155818,0.00028276836,0.00040328418,0.091958895,0.004122002,0.46321705,0.09184224,0.34577486],"study_design_scores_gemma":[0.0002175984,0.00008392182,0.00015151767,0.00024675333,0.000029737539,0.0002835566,0.00006259738,0.27301776,0.0065987823,0.48120984,0.23804438,0.00005358702],"about_ca_topic_score_codex":0.0016858982,"about_ca_topic_score_gemma":0.0018717081,"teacher_disagreement_score":0.02131932,"about_ca_system_score_codex":0.0012573776,"about_ca_system_score_gemma":0.0020698889,"threshold_uncertainty_score":0.071320236},"labels":[],"label_agreement":null},{"id":"W3085334717","doi":"10.1080/10556788.2020.1817447","title":"Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding","year":2020,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounding overwatch; Travelling salesman problem; Morin; Computer science; Mathematical optimization; Mathematics; Algorithm; Artificial intelligence","score_opus":0.025209316645392842,"score_gpt":0.301731733635452,"score_spread":0.2765224169900592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085334717","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.037256718,0.0013630487,0.9309194,0.0009758616,0.00022310771,0.00017715259,0.00030592296,0.0029258109,0.025853],"genre_scores_gemma":[0.19613272,0.0005436771,0.79498464,0.00045554544,0.00014051267,0.00034926302,0.00066012994,0.0011809624,0.00555243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981371,0.00046507205,0.000097113414,0.0003714443,0.0005689104,0.00036036345],"domain_scores_gemma":[0.9980081,0.0010022981,0.00014953154,0.00047006528,0.00025660958,0.0001134551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001976123,0.0018397841,0.001498535,0.0013542668,0.0009767867,0.0022584521,0.002349821,0.0012354308,0.009079669],"category_scores_gemma":[0.0075242925,0.00074408355,0.0019124681,0.0017108603,0.0009920412,0.0033702832,0.0031967498,0.0034105303,0.0018113236],"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.0002211452,0.00022022903,0.0011300093,0.00024948912,0.00009737968,0.000121594545,0.00027863757,0.67833877,0.0045493995,0.101739444,0.011910984,0.20114289],"study_design_scores_gemma":[0.000029127366,0.000026793778,0.000102081875,0.000022513444,0.000011397774,0.000019656942,0.000017517776,0.9699555,0.0007663588,0.023982946,0.005056179,0.000009880758],"about_ca_topic_score_codex":0.011420277,"about_ca_topic_score_gemma":0.014360816,"teacher_disagreement_score":0.011420277,"about_ca_system_score_codex":0.002396481,"about_ca_system_score_gemma":0.00270569,"threshold_uncertainty_score":0.030374527},"labels":[],"label_agreement":null},{"id":"W4367182219","doi":"10.1080/10556788.2023.2189716","title":"Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems","year":2023,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"National Natural Science Foundation of China","keywords":"Conjugate gradient method; Orthogonalization; Conjugate; Derivation of the conjugate gradient method; Mathematics; Conjugate residual method; Linear system; Nonlinear conjugate gradient method; Krylov subspace; Positive-definite matrix; Mathematical analysis; Applied mathematics; Algorithm; Computer science; Gradient descent; Physics","score_opus":0.04614607138990487,"score_gpt":0.34296162124064855,"score_spread":0.29681554985074365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367182219","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.005957441,0.0003198719,0.99066585,0.00015842739,0.000045282977,0.00004637545,0.000021888127,0.0001189857,0.0026658801],"genre_scores_gemma":[0.34554923,0.0017158497,0.64309263,0.0003471807,0.00020485323,0.00065885833,0.00021106872,0.000601422,0.007618966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990343,0.0003954242,0.000051643987,0.00008004118,0.00039147388,0.00004708597],"domain_scores_gemma":[0.9963575,0.0021487623,0.00027477165,0.00028867694,0.00078874256,0.00014147998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002711476,0.0010074127,0.00075328536,0.00097040215,0.0005448179,0.0011507192,0.0008646709,0.0010088398,0.0042677014],"category_scores_gemma":[0.007434211,0.0005304787,0.00094207004,0.0007769127,0.0022393877,0.0017477858,0.0015612101,0.0020488708,0.0011184515],"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.00029002797,0.00014353565,0.0020317344,0.0006678007,0.0001411934,0.00023819516,0.0006458282,0.35037452,0.025930349,0.46113494,0.004782991,0.15361895],"study_design_scores_gemma":[0.000017956185,0.00007740449,0.00016907822,0.000021778556,0.0000095789155,0.00006653183,0.000021269716,0.9564025,0.003220371,0.03740593,0.002570165,0.00001746685],"about_ca_topic_score_codex":0.00095428695,"about_ca_topic_score_gemma":0.0008679508,"teacher_disagreement_score":0.0042677014,"about_ca_system_score_codex":0.0003717464,"about_ca_system_score_gemma":0.0010258151,"threshold_uncertainty_score":0.014339805},"labels":[],"label_agreement":null},{"id":"W4390339149","doi":"10.1080/10556788.2023.2285492","title":"An ADMM based method for underdetermined box-constrained integer least squares problems","year":2023,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Underdetermined system; Solver; Integer (computer science); Mathematical optimization; Computer science; Least-squares function approximation; Integer programming; Algorithm; Tree (set theory); Mathematics; Statistics","score_opus":0.03514432945428824,"score_gpt":0.35674848051052077,"score_spread":0.3216041510562325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390339149","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.00055274356,0.000064397405,0.9985526,0.00004582488,0.00002470377,0.000014983765,0.000025753054,0.0001240806,0.00059499335],"genre_scores_gemma":[0.027644342,0.00020366909,0.96956325,0.00014777036,0.0000625646,0.00016650467,0.00021835277,0.00012214022,0.0018714697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921525,0.00031848947,0.000036592155,0.00012846399,0.00025059917,0.000050576076],"domain_scores_gemma":[0.99879223,0.00067928544,0.00012265591,0.00011332096,0.00023838316,0.000054161355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013832301,0.0011428872,0.00096284534,0.0006033398,0.0004764466,0.000904068,0.0010885108,0.0011516677,0.0049588676],"category_scores_gemma":[0.0035158342,0.0005291979,0.0008637955,0.0009634478,0.00067240983,0.0012247517,0.0012248195,0.0024706388,0.0015726665],"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.000107925334,0.00008088795,0.00052565994,0.0003269969,0.00008628051,0.00012977784,0.00012355718,0.6892266,0.0076920865,0.04830401,0.011104023,0.24229218],"study_design_scores_gemma":[0.00001102277,0.000020672976,0.000032836622,0.000011524002,0.0000047767917,0.000033591637,0.0000073267574,0.9919228,0.0008375164,0.004320515,0.0027906832,0.0000066549164],"about_ca_topic_score_codex":0.0018229914,"about_ca_topic_score_gemma":0.0024119425,"teacher_disagreement_score":0.0049588676,"about_ca_system_score_codex":0.00037093094,"about_ca_system_score_gemma":0.0015482827,"threshold_uncertainty_score":0.016589046},"labels":[],"label_agreement":null},{"id":"W4391532996","doi":"10.1080/10556788.2023.2296443","title":"Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods","year":2024,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Tensor (intrinsic definition); Dual (grammatical number); Norm (philosophy); Regular polygon; Convex function; Mathematical optimization; Applied mathematics; Pure mathematics; Geometry; Political science","score_opus":0.045805575752337714,"score_gpt":0.37152345829503497,"score_spread":0.32571788254269723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391532996","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.0016176164,0.00037115763,0.9959202,0.00020975908,0.00008049138,0.000024865845,0.000027034539,0.00014353807,0.0016052377],"genre_scores_gemma":[0.082796164,0.0010444482,0.908316,0.00025553376,0.00031551562,0.0002688406,0.00020862822,0.00050828897,0.006286559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984464,0.0006435694,0.000073211915,0.0001896808,0.0005203922,0.00012678582],"domain_scores_gemma":[0.99815136,0.0007052183,0.00020104376,0.00034456566,0.00044757695,0.00015014062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024362877,0.0022823568,0.0015084335,0.0012849359,0.00058051787,0.0018500938,0.002029341,0.0022189643,0.004355402],"category_scores_gemma":[0.0072005372,0.0008724141,0.0016090063,0.001081892,0.0020453997,0.0033169312,0.0028288215,0.004413743,0.0018727419],"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.0002068203,0.00010437309,0.00044455967,0.00043211385,0.000094774114,0.00016240998,0.0002261401,0.51431674,0.009858511,0.37794656,0.0066289096,0.08957809],"study_design_scores_gemma":[0.000012725822,0.000031507283,0.000042599768,0.000019457077,0.000007650008,0.00004251981,0.000010779931,0.9656092,0.0012230172,0.029858913,0.0031277663,0.000013802121],"about_ca_topic_score_codex":0.002244102,"about_ca_topic_score_gemma":0.0020561276,"teacher_disagreement_score":0.004355402,"about_ca_system_score_codex":0.0014172831,"about_ca_system_score_gemma":0.0016485018,"threshold_uncertainty_score":0.014570296},"labels":[],"label_agreement":null},{"id":"W4392808390","doi":"10.1080/10556788.2024.2322095","title":"Decentralized gradient tracking with local steps","year":2024,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tracking (education); Computer science; Psychology","score_opus":0.014664457297787563,"score_gpt":0.28191548322002674,"score_spread":0.2672510259222392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392808390","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.0142688565,0.000095620046,0.9829999,0.00013523197,0.00003208734,0.00003554208,0.00004276735,0.0006703236,0.0017195898],"genre_scores_gemma":[0.7795758,0.00011728145,0.21510246,0.0001754169,0.00005648792,0.00024760715,0.00019558815,0.0001802425,0.0043491046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993278,0.00016055976,0.00003467008,0.00022152241,0.00018152627,0.00007394851],"domain_scores_gemma":[0.99794704,0.0008549905,0.0002520219,0.00053244544,0.00032040122,0.00009318846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010527446,0.00063928554,0.0011072013,0.00035527447,0.00062934245,0.0008297738,0.0015882787,0.0009399067,0.0020489485],"category_scores_gemma":[0.005117957,0.00045031903,0.00045625764,0.0005984349,0.0010296406,0.0016272484,0.0018938935,0.0013030203,0.0005636318],"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.00020641401,0.00006455066,0.0009154209,0.00008401019,0.000049193986,0.00010108208,0.00007987128,0.8845964,0.006441992,0.033148453,0.0031999722,0.071112655],"study_design_scores_gemma":[0.000019084046,0.00002760419,0.000076321696,0.0000034581778,0.0000039244187,0.00001929586,0.0000047762146,0.99091434,0.0013876706,0.0070232237,0.0005153774,0.000004930136],"about_ca_topic_score_codex":0.0029911094,"about_ca_topic_score_gemma":0.003397581,"teacher_disagreement_score":0.0029911094,"about_ca_system_score_codex":0.00074402115,"about_ca_system_score_gemma":0.0013965366,"threshold_uncertainty_score":0.006854415},"labels":[],"label_agreement":null},{"id":"W4398183091","doi":"10.1080/10556788.2024.2346641","title":"Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations","year":2024,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ordinary differential equation; Parametric statistics; Regular polygon; Applied mathematics; Mathematical optimization; Subderivative; Differential (mechanical device); Convex optimization; Mathematical analysis; Differential equation; Statistics; Geometry","score_opus":0.14334393503401258,"score_gpt":0.4705291716964854,"score_spread":0.3271852366624728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398183091","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.0034430327,0.00004781741,0.9952662,0.000043631146,0.00001671962,0.000034571578,0.000017927545,0.00017502747,0.0009551875],"genre_scores_gemma":[0.19469355,0.00024481336,0.80089736,0.000112953436,0.00004112189,0.000248465,0.00019238304,0.0006666189,0.0029026791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993019,0.0002647718,0.000035698544,0.000087499866,0.00023022539,0.000079856276],"domain_scores_gemma":[0.99832696,0.0009965785,0.00013300168,0.00012764068,0.0003214118,0.00009430053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024440878,0.0016489454,0.0013168254,0.0008198028,0.0004098143,0.0014835728,0.0010017405,0.00087384717,0.0027569747],"category_scores_gemma":[0.0069815814,0.0006585126,0.0010741195,0.00045462284,0.0010307196,0.0013030538,0.0018328715,0.0023458514,0.000837145],"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.0000936853,0.00006125661,0.0005198511,0.00023037627,0.00005011462,0.00012755304,0.00017603963,0.8529625,0.009562446,0.05353681,0.0021740876,0.080505334],"study_design_scores_gemma":[0.000004828153,0.000016915206,0.00004587264,0.000010833405,0.0000028953632,0.00001051264,0.000009226418,0.99288577,0.001348679,0.004970596,0.0006892991,0.000004510926],"about_ca_topic_score_codex":0.0028628635,"about_ca_topic_score_gemma":0.0030422965,"teacher_disagreement_score":0.0028628635,"about_ca_system_score_codex":0.001001314,"about_ca_system_score_gemma":0.0017038179,"threshold_uncertainty_score":0.012925744},"labels":[],"label_agreement":null},{"id":"W4413812281","doi":"10.1080/10556788.2025.2531478","title":"A general framework for floating point error analysis of first-order simplex derivatives","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simplex; Order (exchange); Point (geometry); Mathematical optimization; Simplex algorithm; Algorithm; Applied mathematics; Combinatorics; Linear programming; Geometry; Economics","score_opus":0.035310281368347456,"score_gpt":0.39890740731886803,"score_spread":0.36359712595052057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413812281","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.00067976525,0.00030820473,0.99770254,0.000110070934,0.000038227518,0.000015749765,0.000022310247,0.000084585285,0.001038607],"genre_scores_gemma":[0.13477826,0.002442614,0.85538137,0.00040164829,0.00035980038,0.00029316833,0.00021244265,0.00077710254,0.005353653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968432,0.0009661545,0.00021507079,0.00035679262,0.0014561476,0.0001625559],"domain_scores_gemma":[0.99430144,0.0028873861,0.00037012718,0.00078602426,0.0015142448,0.00014071782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060106306,0.0015480939,0.0013583221,0.0022859788,0.000921359,0.0025225373,0.0028459027,0.0017053605,0.0029688822],"category_scores_gemma":[0.02104017,0.00060777494,0.0019545364,0.0018543359,0.0027460142,0.0039727055,0.0031062004,0.0046296585,0.0011640288],"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.00003934113,0.000023099175,0.00044231687,0.00023624137,0.00004912101,0.00013147859,0.00021710401,0.2920468,0.004058074,0.65811414,0.0025934372,0.04204884],"study_design_scores_gemma":[0.000005866594,0.000026752075,0.00013604,0.00005683607,0.000014460649,0.00007691915,0.000023426373,0.8373291,0.0016233763,0.15358596,0.007097697,0.000023635836],"about_ca_topic_score_codex":0.0048498814,"about_ca_topic_score_gemma":0.002540851,"teacher_disagreement_score":0.0060106306,"about_ca_system_score_codex":0.0017331046,"about_ca_system_score_gemma":0.0017236244,"threshold_uncertainty_score":0.031787694},"labels":[],"label_agreement":null},{"id":"W4413826392","doi":"10.1080/10556788.2025.2541095","title":"Blackbox optimization for origami-inspired bistable structures","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; McGill University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bistability; Mathematics; Mathematical optimization","score_opus":0.012790296069541095,"score_gpt":0.3155962837775207,"score_spread":0.3028059877079796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413826392","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.0753535,0.00074188504,0.9113772,0.00033597896,0.000060981663,0.00008680138,0.00015570907,0.00050922483,0.011378722],"genre_scores_gemma":[0.7058824,0.0003847358,0.28623337,0.00028149362,0.000024181516,0.0005618268,0.00037384673,0.00038305402,0.005875198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985516,0.000049883092,0.000005701032,0.000024001256,0.000046000143,0.000019263327],"domain_scores_gemma":[0.9994205,0.00042184806,0.000048623388,0.00003222775,0.0000470832,0.000029750161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300678,0.0006971881,0.0007478003,0.00047231585,0.0002996549,0.0007080103,0.00069622236,0.0010372911,0.0031614255],"category_scores_gemma":[0.0016494681,0.00042327444,0.00052814226,0.00031884803,0.0006030124,0.0004944635,0.00090012065,0.0006942737,0.0004109543],"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.00004558102,0.000031069718,0.00030380843,0.000069380505,0.000022839018,0.00006341099,0.000029567023,0.9739647,0.0035672241,0.011062303,0.0003999539,0.010440164],"study_design_scores_gemma":[0.0000064839396,0.000011064657,0.0000299913,0.0000044740227,0.000001734432,0.0000037496834,0.0000034973361,0.99695873,0.00047220866,0.0022492716,0.00025707667,0.0000018504093],"about_ca_topic_score_codex":0.0012887727,"about_ca_topic_score_gemma":0.0014334079,"teacher_disagreement_score":0.0031614255,"about_ca_system_score_codex":0.00064918544,"about_ca_system_score_gemma":0.0007563438,"threshold_uncertainty_score":0.01057601},"labels":[],"label_agreement":null},{"id":"W4414845944","doi":"10.1080/10556788.2025.2545846","title":"Near-optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation","keywords":"Saddle point; Separation (statistics); Point (geometry); Composite number; Computational complexity theory; Separation method","score_opus":0.02667676483093195,"score_gpt":0.33738743854053665,"score_spread":0.3107106737096047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414845944","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.0053142807,0.00019685109,0.99190485,0.00021943558,0.000053726457,0.00006333622,0.000027075714,0.00068536977,0.0015351438],"genre_scores_gemma":[0.14207368,0.00019526659,0.8533456,0.0003087541,0.00012675607,0.000340499,0.0002815193,0.00045573755,0.0028722568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882,0.00034165452,0.000091994356,0.00023715103,0.00035167142,0.00015741854],"domain_scores_gemma":[0.99724823,0.0017249226,0.0001734256,0.00034305506,0.00035699067,0.00015329603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019356158,0.0016767262,0.001959647,0.00084520277,0.00074000546,0.0016320669,0.0021437246,0.002070666,0.005897017],"category_scores_gemma":[0.006905578,0.0008927669,0.0012043271,0.00071186613,0.0011237732,0.0023453482,0.002988028,0.0032983816,0.0022666112],"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.00062900723,0.00027278435,0.0014196812,0.00038241045,0.000117735166,0.00024216092,0.00022334837,0.73861545,0.0054901405,0.05988596,0.009193918,0.1835273],"study_design_scores_gemma":[0.000049907256,0.00003729805,0.000045071414,0.000010008054,0.000006034452,0.000024853534,0.000012659332,0.9864785,0.0005234035,0.011971056,0.0008346057,0.0000065669356],"about_ca_topic_score_codex":0.0023224796,"about_ca_topic_score_gemma":0.0030155012,"teacher_disagreement_score":0.005897017,"about_ca_system_score_codex":0.0009175281,"about_ca_system_score_gemma":0.0026587471,"threshold_uncertainty_score":0.019727468},"labels":[],"label_agreement":null}]}