{"meta":{"query_hash":"866aad7d93e9","filters":{"venue":"Mathematical Programming"},"cohort_total":195,"direct_labels_cover":0,"predictions_cover":195,"exported":195,"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/866aad7d93e9","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+Programming"},"results":[{"id":"W1516152095","doi":"10.1007/s101079900110","title":"Restricted 2-factor polytopes","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Travelling salesman problem; Facet (psychology); Uniform k 21 polytope; Birkhoff polytope; Graph; Discrete mathematics; Complete graph; Mathematical optimization; Geometry; Convex optimization; Regular polygon","score_opus":0.029632310202253837,"score_gpt":0.30495063517821547,"score_spread":0.27531832497596165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516152095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06735173,0.0001478759,0.90909886,0.00096297404,0.000051561878,0.0006301419,0.0000014670662,0.001125015,0.020630363],"genre_scores_gemma":[0.4882364,0.000008965004,0.50822014,0.0001089021,0.00005631512,0.000076264456,0.0000011760245,0.00002490581,0.003266966],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.00008267597,0.00025657803,0.00034665066,0.0004282355,0.00054998597],"domain_scores_gemma":[0.99879736,0.0002819567,0.00003213042,0.0006494955,0.00004285817,0.0001962094],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019709732,0.00014372455,0.00018414426,0.00009540927,0.0001527171,0.00025043986,0.00094376976,0.000059363363,0.0007982387],"category_scores_gemma":[0.00018672534,0.0001161172,0.00007982561,0.00073118653,0.00011162008,0.000412498,0.00014876314,0.00021617733,0.0010782355],"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.000006124243,0.0001092476,0.00002656196,0.000024669205,0.000008516973,0.000025808322,0.0002583629,0.0000037798595,0.0002131307,0.23626223,0.000034007466,0.76302755],"study_design_scores_gemma":[0.00066412083,0.0003112573,0.0005829551,0.00011236404,0.000008355286,0.00011234939,0.000057983874,0.026899252,0.0032103444,0.90616834,0.061217993,0.0006546768],"about_ca_topic_score_codex":0.000001908235,"about_ca_topic_score_gemma":3.5466414e-7,"teacher_disagreement_score":0.7623729,"about_ca_system_score_codex":0.000027265942,"about_ca_system_score_gemma":0.000024541974,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W1530501119","doi":"10.1007/s101079900106","title":"A branch and cut algorithm for nonconvex quadratically constrained quadratic programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":183,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Mathematics; Tree (set theory); Linearization; Mathematical optimization; Quadratic programming; Quadratic equation; Node (physics); Quadratically constrained quadratic program; Branch and cut; Second-order cone programming; Algorithm; Linear programming; Combinatorics; Convex optimization; Nonlinear system","score_opus":0.03949063608831347,"score_gpt":0.35372067884664565,"score_spread":0.31423004275833216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530501119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028032411,0.00009282822,0.9903378,0.00057670206,0.000039323353,0.003673022,0.000016567967,0.0005348636,0.0019256397],"genre_scores_gemma":[0.009373119,0.000016008793,0.9863354,0.00009788556,0.00015288866,0.0012226352,0.000022622928,0.00013534185,0.00264409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625474,0.00013358636,0.0010784949,0.0007126952,0.0007012106,0.001119287],"domain_scores_gemma":[0.9962541,0.0022929485,0.00017061102,0.0005170277,0.00028534656,0.00048000933],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001177344,0.00047968706,0.0008136349,0.00015168951,0.0004260847,0.00041040828,0.00032780762,0.00024532306,0.0011135709],"category_scores_gemma":[0.0016767182,0.00042403702,0.00019959468,0.00047408795,0.0006075249,0.00035122415,0.00008820053,0.0003993522,0.00009663561],"study_design_candidate":"design_other","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.000029406297,0.0004987181,0.000006698116,0.00075426203,0.000082593484,0.000015375968,0.0008869472,0.000010899988,0.000029724812,0.037195764,0.000066632856,0.960423],"study_design_scores_gemma":[0.0032911468,0.0006803828,0.0000040718683,0.00043515218,0.00017898176,0.00025560166,0.0008975644,0.5156506,0.0003629132,0.4657559,0.011479059,0.0010086718],"about_ca_topic_score_codex":0.0000029468301,"about_ca_topic_score_gemma":0.0000057202465,"teacher_disagreement_score":0.9594143,"about_ca_system_score_codex":0.00008257894,"about_ca_system_score_gemma":0.000111778245,"threshold_uncertainty_score":0.9998211},"labels":[],"label_agreement":null},{"id":"W1544526981","doi":"10.1007/s101079900111","title":"A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Predictor–corrector method; Interior point method; Monotone polygon; Monotonic function; Quadratic growth; Path (computing); Smoothing; Linear complementarity problem; Mathematical optimization; Convergence (economics); Complementarity (molecular biology); Applied mathematics; Algorithm; Nonlinear system; Mathematical analysis; Computer science; Geometry; Statistics","score_opus":0.04868698048524479,"score_gpt":0.3654539087922773,"score_spread":0.3167669283070325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544526981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033975055,0.0000546473,0.99013746,0.00036164516,0.00011111143,0.004967909,0.000041848605,0.00036312648,0.00056473265],"genre_scores_gemma":[0.0066875187,0.000010560421,0.98828983,0.00008140346,0.000246909,0.002246091,0.000034556604,0.00012611347,0.0022769955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968186,0.00007732702,0.00088932714,0.00052466674,0.0007669138,0.00092315936],"domain_scores_gemma":[0.99710613,0.0016953049,0.00016070226,0.00064189045,0.00016377679,0.00023220525],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001276621,0.000383014,0.00057826424,0.00007482631,0.00059277227,0.000209015,0.0006018306,0.00012452166,0.0012814621],"category_scores_gemma":[0.00047728067,0.00027015,0.00038949834,0.00037763146,0.00016684135,0.00024065924,0.00016822969,0.00041891503,0.000107128886],"study_design_candidate":"design_other","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.00007629034,0.00095114234,0.000085960375,0.0006495397,0.00042672845,0.000024640975,0.0026230216,0.00022621237,0.00005086999,0.0043674856,0.0009826835,0.98953545],"study_design_scores_gemma":[0.0016204139,0.00027470422,0.000007754514,0.00025832147,0.00016370336,0.000021712622,0.00061064615,0.9246994,0.0002506126,0.056910448,0.014784114,0.00039812407],"about_ca_topic_score_codex":0.000018493056,"about_ca_topic_score_gemma":0.0000072017847,"teacher_disagreement_score":0.9891373,"about_ca_system_score_codex":0.00016192213,"about_ca_system_score_gemma":0.00006378335,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W1554183532","doi":"10.1007/s10107-016-1041-3","title":"An axiomatic duality framework for the theta body and related convex corners","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Mathematics; Polytope; Combinatorics; Discrete mathematics","score_opus":0.03534091095242158,"score_gpt":0.3469610993440978,"score_spread":0.3116201883916762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554183532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009836519,0.00010763295,0.9859368,0.0026506344,0.00007034414,0.0009442967,0.0000014474047,0.00025833835,0.00019399622],"genre_scores_gemma":[0.7506502,0.0000051477555,0.24889107,0.000057115074,0.000021293792,0.00020685786,4.1494954e-7,0.00001921337,0.00014865343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982175,0.00018050475,0.00034186212,0.00041488558,0.00033281036,0.0005124],"domain_scores_gemma":[0.9941557,0.004519764,0.00010465945,0.0009727762,0.000061754006,0.00018534901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019694162,0.00016622036,0.00023930363,0.000051602117,0.00031082117,0.00025877083,0.00091911753,0.00010069927,0.000023222066],"category_scores_gemma":[0.0014672969,0.000081384875,0.00008279658,0.00029934605,0.0005140413,0.00041547915,0.00021442816,0.00016979157,0.000040696035],"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.000009090813,0.000068241745,0.000036845162,0.000053994576,0.000028044544,0.0000029653042,0.0006256899,4.5653422e-7,0.00027711884,0.8293428,0.000004824932,0.16954994],"study_design_scores_gemma":[0.0002837963,0.00015422836,0.000086856206,0.00010924975,0.000014525566,0.000030473377,0.00016826415,0.037960906,0.0003855309,0.96034974,0.00030895844,0.00014748097],"about_ca_topic_score_codex":7.565861e-7,"about_ca_topic_score_gemma":2.929592e-7,"teacher_disagreement_score":0.74081373,"about_ca_system_score_codex":0.000023969013,"about_ca_system_score_gemma":0.000022813507,"threshold_uncertainty_score":0.3318779},"labels":[],"label_agreement":null},{"id":"W1581729816","doi":"10.1007/s10107-015-0947-5","title":"On integrality ratios for asymmetric TSP in the Sherali–Adams hierarchy","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Travelling salesman problem; Digraph; Linear programming relaxation; Relaxation (psychology); Linear programming; Discrete mathematics; Algorithm","score_opus":0.06647276221161304,"score_gpt":0.3280434873934523,"score_spread":0.26157072518183927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581729816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020781707,0.00006553439,0.9715898,0.00047817393,0.000109513865,0.0011040113,0.0000019114816,0.0003339926,0.0055353474],"genre_scores_gemma":[0.5292319,0.0000011629718,0.47014922,0.00013929572,0.00006666469,0.00030953018,0.000009318658,0.000039833536,0.000053038166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864626,0.00016405902,0.0003836969,0.00016742261,0.00029784962,0.000340715],"domain_scores_gemma":[0.99850065,0.0010306078,0.000035394776,0.00028790333,0.00005571044,0.00008975383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002630654,0.00016224923,0.00022781207,0.000110390974,0.000050799506,0.00013820894,0.00026175388,0.00008862231,0.000011042043],"category_scores_gemma":[0.0023030648,0.00011320266,0.00007448733,0.0006744168,0.000040092964,0.000092678594,0.00002210089,0.0002670194,0.000029680323],"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.00005930748,0.00063908834,0.0004789025,0.0008163821,0.00007492417,0.000013902167,0.009595347,0.09110161,0.00004316099,0.3544263,0.0044164537,0.5383346],"study_design_scores_gemma":[0.00097519095,0.0001953445,0.00006333788,0.00008883726,0.000023608201,0.000010750352,0.0008681924,0.8788089,0.00030089563,0.11298227,0.005368716,0.00031392332],"about_ca_topic_score_codex":0.0000038619924,"about_ca_topic_score_gemma":0.0000027016367,"teacher_disagreement_score":0.7877073,"about_ca_system_score_codex":0.00010943968,"about_ca_system_score_gemma":0.000015817599,"threshold_uncertainty_score":0.46162704},"labels":[],"label_agreement":null},{"id":"W1590819555","doi":"10.1007/s101070100240","title":"Self-concordant barriers for hyperbolic means","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Homogeneous polynomial; Hyperbolic function; Homogeneous; Polynomial; Function (biology); Domain (mathematical analysis); Degree (music); Regular polygon; Mathematical analysis; Combinatorics; Matrix polynomial; Geometry","score_opus":0.052798400209735835,"score_gpt":0.36599263890353156,"score_spread":0.3131942386937957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590819555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034841697,0.00004852047,0.9885344,0.00051945145,0.000069306145,0.0018919447,0.000004848377,0.000742778,0.004704572],"genre_scores_gemma":[0.009985289,0.000019072328,0.987363,0.00008070942,0.00015503062,0.00068353367,0.0000061646087,0.00010943518,0.0015977618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976867,0.00006290788,0.00056047004,0.00038931062,0.00051037647,0.0007902449],"domain_scores_gemma":[0.99761075,0.0011548034,0.00012360203,0.0004705516,0.00023299732,0.00040731145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079255516,0.00026100333,0.00043439178,0.00012686985,0.0002841458,0.00012351527,0.00034607205,0.00012059705,0.00038091472],"category_scores_gemma":[0.0035116936,0.00022477876,0.00018345552,0.00042205187,0.00011677541,0.00019231963,0.00010267417,0.00022486363,0.00010310016],"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.00012746212,0.0011975688,0.00023325291,0.0022164022,0.00031255014,0.00008703299,0.004191224,0.00019971814,0.00013214238,0.80290306,0.001333955,0.18706566],"study_design_scores_gemma":[0.0015406563,0.00022345793,0.0000014378506,0.00010717845,0.00010209419,0.00013602483,0.0013741789,0.22311115,0.00054139434,0.6521409,0.120165415,0.00055610674],"about_ca_topic_score_codex":9.402026e-7,"about_ca_topic_score_gemma":0.0000024030717,"teacher_disagreement_score":0.22291143,"about_ca_system_score_codex":0.0001273182,"about_ca_system_score_gemma":0.00007658628,"threshold_uncertainty_score":0.91662115},"labels":[],"label_agreement":null},{"id":"W1604898370","doi":"10.1007/s10107-003-0407-5","title":"The stable set problem and the lift-and-project ranks of graphs","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Subdivision; Vertex (graph theory); Pathwidth; Cograph; Graph; Discrete mathematics; Split graph; Line graph","score_opus":0.02837370701248726,"score_gpt":0.3029111102361365,"score_spread":0.2745374032236492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604898370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019065421,0.003488831,0.96095735,0.0016396466,0.000068372356,0.0031460593,0.00000180858,0.00019782863,0.0114347115],"genre_scores_gemma":[0.65698135,0.00014491536,0.34206057,0.000055337918,0.000009598617,0.0003360072,3.2420755e-7,0.0000232891,0.00038862805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830055,0.0003662513,0.0003034655,0.00025359634,0.00036060374,0.0004155104],"domain_scores_gemma":[0.99727196,0.0019731994,0.00009172441,0.0005222991,0.000073702446,0.00006711654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035059429,0.00012817074,0.00022731633,0.00005453334,0.000400437,0.00028057734,0.00054471596,0.000040675972,0.0000030457],"category_scores_gemma":[0.0007024857,0.000061731975,0.00006171012,0.00051894557,0.00097368687,0.00018309827,0.000277281,0.00022972141,0.0000032064825],"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.000015780604,0.000025276313,0.000041159867,0.00009477756,0.000020311354,0.0000013271555,0.0013499978,0.0000012721878,0.000022242706,0.95572317,0.000016788325,0.042687874],"study_design_scores_gemma":[0.00058287644,0.00006431322,0.000004666373,0.000039862367,0.000009317929,0.00003539894,0.00047842597,0.0048718103,0.00032016798,0.9896845,0.0038201234,0.000088523],"about_ca_topic_score_codex":0.0000050347076,"about_ca_topic_score_gemma":0.0000022103393,"teacher_disagreement_score":0.6379159,"about_ca_system_score_codex":0.000007016472,"about_ca_system_score_gemma":0.000033968267,"threshold_uncertainty_score":0.358759},"labels":[],"label_agreement":null},{"id":"W1644797908","doi":"10.1007/s10107-016-0979-5","title":"On the mixing set with a knapsack constraint","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Mathematics; Cardinality (data modeling); Continuous knapsack problem; Constraint (computer-aided design); Polytope; Mathematical optimization; Combinatorics; Set (abstract data type); Change-making problem; Discrete mathematics; Computer science","score_opus":0.09817941881720438,"score_gpt":0.351488615016236,"score_spread":0.25330919619903164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644797908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13571174,0.000014347398,0.82930446,0.008035659,0.00006895806,0.00064719917,0.000004607548,0.00012175409,0.026091281],"genre_scores_gemma":[0.97711253,0.0000032796847,0.021338457,0.00021146906,0.000037509886,0.000044422974,5.1609413e-7,0.000013463611,0.0012383721],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798846,0.000120232,0.00040194797,0.00028479716,0.0009223383,0.00028224266],"domain_scores_gemma":[0.9954414,0.0036922921,0.00015503039,0.000490386,0.00012221563,0.00009867632],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021585515,0.00012886814,0.00019022916,0.0000714483,0.00017765579,0.0002936581,0.00036983518,0.000047808422,0.0009735709],"category_scores_gemma":[0.0030072196,0.000042691307,0.00006985508,0.00037131607,0.0002848094,0.00012825102,0.00004920207,0.000088613466,0.0010666957],"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.0000339166,0.00008439665,0.00047101086,0.000004326796,0.000019743475,0.000016364027,0.00086731574,0.00004550171,0.000053152817,0.46789253,0.0021470294,0.5283647],"study_design_scores_gemma":[0.00075341295,0.00041823802,0.00014386588,0.00036212758,0.000032039356,0.00010379427,0.002158313,0.0056986767,0.0008972737,0.9431627,0.045879643,0.00038996225],"about_ca_topic_score_codex":0.0000011298679,"about_ca_topic_score_gemma":0.0000021108558,"teacher_disagreement_score":0.84140074,"about_ca_system_score_codex":0.000018295514,"about_ca_system_score_gemma":0.00003065554,"threshold_uncertainty_score":0.9999397},"labels":[],"label_agreement":null},{"id":"W1803930816","doi":"10.1007/s10107-016-1035-1","title":"Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research Global; Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Polytope; Operator (biology); Chordal graph; Characterization (materials science); Indifference graph; Strong perfect graph theorem; Discrete mathematics; Graph; 1-planar graph; Physics","score_opus":0.0202639909015393,"score_gpt":0.25145209598900103,"score_spread":0.23118810508746174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803930816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32971957,0.0008654251,0.66083163,0.0030213662,0.00050621456,0.0010934961,0.000007297798,0.0014425209,0.00251245],"genre_scores_gemma":[0.65831256,0.000029328867,0.34092817,0.00027028203,0.00004115809,0.00009573268,0.0000010635299,0.000036660498,0.00028505354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973216,0.00011933688,0.00049330434,0.00074041577,0.0005175656,0.00080779725],"domain_scores_gemma":[0.9981192,0.0004497332,0.00010211445,0.0008602862,0.00009447843,0.0003742058],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075862696,0.0003534743,0.0004291382,0.0001143236,0.00059359666,0.0011043117,0.0008216373,0.00013093183,0.00013115116],"category_scores_gemma":[0.0002134702,0.0002356463,0.00021064327,0.00071916886,0.0007376344,0.0007535607,0.00057584286,0.00023893133,0.0002682635],"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.00000696473,0.00018595663,0.0010382495,0.000097287906,0.00004571198,0.000035881356,0.00071531185,9.811274e-7,0.00034117923,0.6319129,0.00021429655,0.36540526],"study_design_scores_gemma":[0.0017879887,0.00060438365,0.0013089263,0.000651957,0.00006225403,0.00028621338,0.000076669974,0.044893496,0.0017365399,0.897215,0.05006249,0.0013140822],"about_ca_topic_score_codex":0.000013000545,"about_ca_topic_score_gemma":0.0000056228964,"teacher_disagreement_score":0.3640912,"about_ca_system_score_codex":0.000024303105,"about_ca_system_score_gemma":0.000055606342,"threshold_uncertainty_score":0.99993265},"labels":[],"label_agreement":null},{"id":"W1827575274","doi":"10.1007/s10107-016-1099-y","title":"Hirsch polytopes with exponentially long combinatorial segments","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"École Polytechnique, Université Paris-Saclay; Israel Science Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Polytope; Simplicial complex; Upper and lower bounds; Dimension (graph theory); h-vector; Monotonic function; Flag (linear algebra); Combinatorial optimization; Polyhedron","score_opus":0.031353730098991214,"score_gpt":0.29900242205794836,"score_spread":0.26764869195895713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827575274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19755223,0.00004142251,0.79310787,0.0005751199,0.0008027488,0.001927912,0.000005989031,0.0011352738,0.0048514036],"genre_scores_gemma":[0.73227966,0.0000032926798,0.26575276,0.000027491997,0.00033852475,0.00029578185,0.000002197058,0.0001832695,0.0011170198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962602,0.00012302847,0.00091084803,0.0006022775,0.0011275915,0.000976011],"domain_scores_gemma":[0.9965418,0.0015241011,0.0004097782,0.0009559257,0.00022376208,0.0003446121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007397727,0.0005456454,0.0008040764,0.00013323514,0.00023901506,0.00020163525,0.0006195346,0.00020653429,0.000326375],"category_scores_gemma":[0.0015278015,0.0003247845,0.00017986025,0.00035938434,0.00029424072,0.00046278955,0.00028208087,0.0002526349,0.0003073577],"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.00012549937,0.0011132292,0.00023953838,0.00051781005,0.0001629435,0.000091509944,0.0004234281,2.8186224e-7,0.0011988382,0.96570337,0.00017040673,0.030253122],"study_design_scores_gemma":[0.0030065426,0.00042566203,0.000015261434,0.0009696036,0.00015217776,0.000094788986,0.00014831546,0.000032636683,0.0064461036,0.9866224,0.0014438904,0.00064263557],"about_ca_topic_score_codex":0.0000016517685,"about_ca_topic_score_gemma":0.000002113902,"teacher_disagreement_score":0.53472745,"about_ca_system_score_codex":0.0001910632,"about_ca_system_score_gemma":0.00007483794,"threshold_uncertainty_score":0.9999204},"labels":[],"label_agreement":null},{"id":"W1853304843","doi":"10.1007/s10107-016-1079-2","title":"Tight MIP formulations for bounded up/down times and interval-dependent start-ups","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Interval (graph theory); Integer programming; Convex hull; Quadratic programming; Linear programming; Upper and lower bounds; Integer (computer science); Mathematical optimization; Combinatorics; Discrete mathematics; Regular polygon; Computer science","score_opus":0.03800690496063752,"score_gpt":0.2958300606662771,"score_spread":0.2578231557056396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853304843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008352377,0.00002463771,0.9934328,0.0038187997,0.00008181081,0.00071922905,0.0000028431025,0.00020629966,0.0008783275],"genre_scores_gemma":[0.22551256,0.000005935709,0.76801306,0.00011765485,0.000040223324,0.0002295107,0.0000036205736,0.000019238063,0.006058198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987707,0.00003375411,0.0003046956,0.00029439043,0.00023822083,0.00035819708],"domain_scores_gemma":[0.9990398,0.00032419802,0.000065842614,0.00029756234,0.000112318965,0.00016025195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047241006,0.00012622093,0.00017270872,0.00007634143,0.0001951703,0.00037072218,0.00031136963,0.000056281267,0.00009720669],"category_scores_gemma":[0.00025458698,0.000079349644,0.00006577399,0.000118461976,0.0000945159,0.0006046995,0.0001992358,0.000057591442,0.00006561714],"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.0000066683733,0.00010797316,0.000044769007,0.00011139464,0.000024479277,0.0000012384477,0.0009342975,0.0000047525564,0.00015188557,0.7023038,0.00039078316,0.29591793],"study_design_scores_gemma":[0.0015961281,0.00031166655,0.000035992638,0.000231773,0.0000194155,0.00002354964,0.00007271228,0.25442678,0.000984258,0.7062507,0.035671126,0.0003758556],"about_ca_topic_score_codex":0.0000013007494,"about_ca_topic_score_gemma":0.0000039137135,"teacher_disagreement_score":0.2955421,"about_ca_system_score_codex":0.000035049175,"about_ca_system_score_gemma":0.00003091782,"threshold_uncertainty_score":0.35748827},"labels":[],"label_agreement":null},{"id":"W1936234780","doi":"10.1007/s10107-013-0733-1","title":"Convex optimization for the planted k-disjoint-clique problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Clique; Cluster analysis; Partition (number theory); Discrete mathematics","score_opus":0.015510040891089488,"score_gpt":0.22342986152008346,"score_spread":0.20791982062899397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936234780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015291044,0.000095477706,0.9937694,0.0002766815,0.00004826107,0.0014542112,0.0000010599849,0.001063488,0.0017623218],"genre_scores_gemma":[0.5135566,0.000011449498,0.48525262,0.00007313133,0.00007419876,0.00089314487,0.000009369924,0.000051101266,0.000078386474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993228,0.000011149611,0.000219321,0.00010850392,0.00009413744,0.0002441159],"domain_scores_gemma":[0.9994141,0.0002511254,0.000029960687,0.00019497088,0.00006567619,0.000044159264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012291966,0.00012640387,0.00015156876,0.00002851823,0.00008684217,0.0001350152,0.00013560729,0.00006918565,0.00011503481],"category_scores_gemma":[0.00005892085,0.00008401171,0.000060723818,0.00008022906,0.000045152956,0.00008918858,0.000025759866,0.00010615169,0.000041805557],"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.000035063793,0.00041503704,0.00006082822,0.0019932028,0.00060880126,0.000010593849,0.0027756933,0.18650597,0.008945514,0.110602096,0.043474544,0.6445727],"study_design_scores_gemma":[0.000110882655,0.000030198522,0.000004227613,0.00011174165,0.000023083801,0.000010607289,0.00009063938,0.9740744,0.004170225,0.01785327,0.003385768,0.00013491951],"about_ca_topic_score_codex":0.0000055308037,"about_ca_topic_score_gemma":6.860181e-7,"teacher_disagreement_score":0.78756845,"about_ca_system_score_codex":0.000016943632,"about_ca_system_score_gemma":0.0000045952875,"threshold_uncertainty_score":0.34258983},"labels":[],"label_agreement":null},{"id":"W1964191135","doi":"10.1007/s10107-005-0578-3","title":"Cuts for mixed 0-1 conic programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Conic section; Semidefinite programming; Mathematics; Conic optimization; Linear programming; Mathematical optimization; Convex optimization; Rank (graph theory); Regular polygon; Travelling salesman problem; Quadratic programming; Combinatorics; Convex analysis; Geometry","score_opus":0.07451220809616238,"score_gpt":0.3946342440206426,"score_spread":0.32012203592448024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964191135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016921122,0.000102784375,0.9917245,0.0010560025,0.00007200777,0.002863476,0.0000059824843,0.00070290605,0.0017802503],"genre_scores_gemma":[0.019140715,0.000004692783,0.97569674,0.000061957195,0.0002874973,0.001320111,0.00001678548,0.00012686833,0.0033446325],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970057,0.000071353104,0.000784331,0.0004963445,0.0006166788,0.0010255857],"domain_scores_gemma":[0.99715734,0.0014991327,0.0002010776,0.0005315829,0.00031576958,0.00029510455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010980254,0.00032652964,0.0005138793,0.00015173695,0.00030027356,0.00021396,0.0004046592,0.00017183178,0.0002764963],"category_scores_gemma":[0.0032333578,0.0002897106,0.00023261787,0.0003994654,0.00018959661,0.00031162202,0.00015262696,0.00030309125,0.00019987636],"study_design_candidate":"design_other","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.00003514439,0.0007814572,0.0000105766085,0.00077349844,0.00007887822,0.0000057119755,0.0006329665,0.0001268925,0.00007196245,0.24509291,0.00128172,0.7511083],"study_design_scores_gemma":[0.0028713937,0.00037922704,0.0000030773974,0.0003190445,0.00013998363,0.000085558386,0.00090380036,0.18147968,0.0031019333,0.4314977,0.37820217,0.0010164359],"about_ca_topic_score_codex":6.302417e-7,"about_ca_topic_score_gemma":0.000005954297,"teacher_disagreement_score":0.75009185,"about_ca_system_score_codex":0.00017306596,"about_ca_system_score_gemma":0.00006980983,"threshold_uncertainty_score":0.9999555},"labels":[],"label_agreement":null},{"id":"W1964689736","doi":"10.1007/s10107-010-0384-4","title":"The master equality polyhedron with multiple rows","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subadditivity; Polyhedron; Mathematics; Row; Combinatorics; Vertex (graph theory); Submodular set function; Duality (order theory); Discrete mathematics; Graph; Computer science","score_opus":0.03564288285088745,"score_gpt":0.30824950322159844,"score_spread":0.272606620370711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964689736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03562742,0.00002306386,0.9589239,0.0015291116,0.00008342862,0.0005016095,4.238824e-7,0.00026265226,0.0030484034],"genre_scores_gemma":[0.6837745,4.2947173e-7,0.3153615,0.000041637988,0.000037954404,0.000105534484,3.5824922e-7,0.000015743104,0.00066238607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816376,0.00010083253,0.00024852515,0.00033857758,0.0005262654,0.0006220371],"domain_scores_gemma":[0.99761045,0.0010163832,0.000072105526,0.0010423481,0.00008300388,0.00017570509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013963099,0.0001532708,0.00015450563,0.000040101168,0.0004160431,0.0005014538,0.0012083094,0.00005859984,0.00002336362],"category_scores_gemma":[0.00043192023,0.000082762024,0.00006267252,0.00034482378,0.0003066644,0.00033614674,0.00039736045,0.00050761865,0.00017308306],"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.000019460462,0.00010473852,0.00057166605,0.00003484426,0.000014131975,0.000009005281,0.0004125003,0.000002215232,0.0010710423,0.7503248,0.000016420032,0.24741921],"study_design_scores_gemma":[0.0009378389,0.00036672738,0.0004957233,0.00006754014,0.0000123019445,0.00014724683,0.00035285702,0.067211986,0.006421115,0.8872074,0.03616418,0.0006150898],"about_ca_topic_score_codex":0.0000045246284,"about_ca_topic_score_gemma":0.000059476475,"teacher_disagreement_score":0.64814705,"about_ca_system_score_codex":0.000018762446,"about_ca_system_score_gemma":0.000034021665,"threshold_uncertainty_score":0.48355305},"labels":[],"label_agreement":null},{"id":"W1964852627","doi":"10.1007/s10107-012-0626-8","title":"A stabilized structured Dantzig–Wolfe decomposition method","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Polyhedron; Column generation; Mathematics; Decomposition; Mathematical optimization; Extreme point; Variable (mathematics); Linear programming; Scheme (mathematics); Decomposition method (queueing theory); Combinatorics; Discrete mathematics","score_opus":0.035062206351621106,"score_gpt":0.38205921895953326,"score_spread":0.34699701260791216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964852627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010465795,0.00013368155,0.98702306,0.00020340856,0.00010582689,0.0005376109,9.2058957e-7,0.00039623442,0.0011334674],"genre_scores_gemma":[0.3198299,7.423878e-7,0.6799406,0.000040265597,0.000049467475,0.00007791687,0.0000018751686,0.000016183169,0.000043056356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997572,0.00032275674,0.00035598825,0.00034544375,0.0005397126,0.0008640832],"domain_scores_gemma":[0.99810445,0.00067151367,0.000091730566,0.0007082554,0.000082224746,0.00034182056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017306603,0.00019842322,0.00029433443,0.00013389118,0.00019556636,0.00020434131,0.0007565245,0.0000833146,0.00010331186],"category_scores_gemma":[0.00036657127,0.00016035573,0.00012236567,0.0005848758,0.00009900724,0.00086342765,0.00039457297,0.00027442642,0.00013737647],"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.000013943614,0.00020627817,0.000120427496,0.0000967186,0.000022788585,0.0000046649343,0.0013001297,0.000007939369,0.004752842,0.7385894,0.000014433151,0.2548704],"study_design_scores_gemma":[0.0006804078,0.0001360111,0.00019781744,0.00006603547,0.000022786617,0.00017230569,0.0002310043,0.039370123,0.01912745,0.9352514,0.004261123,0.00048352583],"about_ca_topic_score_codex":0.0000012669179,"about_ca_topic_score_gemma":4.902488e-7,"teacher_disagreement_score":0.30936414,"about_ca_system_score_codex":0.000068430294,"about_ca_system_score_gemma":0.000022788356,"threshold_uncertainty_score":0.6539117},"labels":[],"label_agreement":null},{"id":"W1965094948","doi":"10.1007/s10107-006-0039-7","title":"Reduction of symmetric semidefinite programs using the regular $$\\ast$$ -representation","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":129,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Combinatorics; Semidefinite programming; Centralizer and normalizer; Bipartite graph; Matrix (chemical analysis); Order (exchange); Permutation (music); Permutation matrix; Permutation group; Upper and lower bounds; Discrete mathematics; Physics; Graph; Mathematical analysis","score_opus":0.09965246932807036,"score_gpt":0.37624818502799634,"score_spread":0.27659571569992597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965094948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07573354,0.00014486234,0.91992193,0.00020370678,0.00007750762,0.0017646583,0.0000020431191,0.00024882954,0.0019028939],"genre_scores_gemma":[0.24857534,0.000004417847,0.7505432,0.0000034855411,0.00013973918,0.00012595538,0.00001605857,0.00006224291,0.00052959385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973404,0.00018091012,0.00082383084,0.00031713114,0.0008791568,0.00045859755],"domain_scores_gemma":[0.9980587,0.00056346954,0.00039423216,0.0005544813,0.00035889415,0.00007025279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694235,0.00020953207,0.00036044535,0.0002435317,0.00022461006,0.00011506691,0.00027831356,0.00011287092,0.000054897926],"category_scores_gemma":[0.0010505528,0.00015244124,0.0001590073,0.0018064156,0.00032322368,0.0002357194,0.00012389294,0.00025374664,0.00001315495],"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.000045956698,0.0015406371,0.0002962991,0.0010498276,0.0001155104,0.000011633661,0.0008769238,0.0048444583,0.003333939,0.8266974,0.00016202539,0.1610254],"study_design_scores_gemma":[0.0005133846,0.00009133584,0.000017214717,0.00021601278,0.00011348248,0.00011268603,0.0012838147,0.147995,0.006270287,0.8427826,0.0003397434,0.00026442003],"about_ca_topic_score_codex":0.000033812077,"about_ca_topic_score_gemma":0.0000018108941,"teacher_disagreement_score":0.1728418,"about_ca_system_score_codex":0.000105810366,"about_ca_system_score_gemma":0.00003964121,"threshold_uncertainty_score":0.62163734},"labels":[],"label_agreement":null},{"id":"W1971200627","doi":"10.1007/s10107-003-0484-5","title":"Generalized pattern searches with derivative information","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Iterated function; Polling; Function (biology); Mathematics; Convergence (economics); Mathematical optimization; Derivative (finance); Pattern search; Global Positioning System; Algorithm; Computer science","score_opus":0.0657266595787926,"score_gpt":0.34676287915577386,"score_spread":0.28103621957698127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971200627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008693698,0.00001098452,0.98411345,0.00017688714,0.000015723559,0.0008946836,0.0000024423564,0.00024070653,0.0058514145],"genre_scores_gemma":[0.06997479,0.0000034408963,0.9291537,0.00008321377,0.000019628826,0.00027308334,0.000012164897,0.000045825043,0.0004341683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979704,0.00016344548,0.00044422492,0.00020067555,0.00069428893,0.0005269893],"domain_scores_gemma":[0.9985056,0.00052834203,0.00014405073,0.0003469824,0.00029297368,0.000182051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871289,0.00022130844,0.0003023349,0.00013778478,0.00017996284,0.00018519364,0.00018017572,0.00008317879,0.00051790423],"category_scores_gemma":[0.0019823343,0.00016284456,0.000058948197,0.00046566108,0.0001621037,0.00061093766,0.00005694834,0.000265785,0.00016940993],"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.000052587453,0.0005959594,0.00035356695,0.0010679219,0.00017802863,0.000035802306,0.0054325406,0.00041213987,0.000042043506,0.7731363,0.00033532537,0.21835777],"study_design_scores_gemma":[0.00505612,0.0006384497,0.000043084958,0.00048181074,0.00010484391,0.0002957761,0.005803439,0.06094715,0.009215861,0.8853449,0.03057486,0.0014936972],"about_ca_topic_score_codex":0.0000021576761,"about_ca_topic_score_gemma":0.0000020156265,"teacher_disagreement_score":0.21686406,"about_ca_system_score_codex":0.000091403635,"about_ca_system_score_gemma":0.00006778796,"threshold_uncertainty_score":0.6640609},"labels":[],"label_agreement":null},{"id":"W1973286658","doi":"10.1007/s10107-008-0260-7","title":"Separable self-concordant spectral functions and a conjecture of Tunçel","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Conjecture; Separable space; Mathematics; Combinatorics; Logarithm; Function (biology); Constant (computer programming); Lambda; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.023706818533970827,"score_gpt":0.3054707667421892,"score_spread":0.2817639482082184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973286658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8777748,0.00019751907,0.077184886,0.0008229628,0.0000990662,0.0017356261,0.00001012696,0.0010415098,0.0411335],"genre_scores_gemma":[0.78749233,0.0000043722675,0.21193162,0.000049241014,0.00009767631,0.000031171818,0.0000018563801,0.000040057133,0.00035169141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779665,0.000083756575,0.0007468037,0.00037326413,0.00042875126,0.0005707448],"domain_scores_gemma":[0.99790305,0.0010332569,0.00024156092,0.00052866014,0.000075307595,0.00021818148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000659424,0.00035123542,0.000761563,0.00009648942,0.00013605834,0.00007951915,0.0002447938,0.00014348846,0.00022385309],"category_scores_gemma":[0.00065782736,0.00028082487,0.00020932377,0.00035876725,0.00021731717,0.00016286515,0.000061745406,0.00036035728,0.00005948566],"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.00002448238,0.0009902801,0.000028525457,0.0005683219,0.00008766066,0.000013494827,0.0012544862,0.000002010291,0.0015253364,0.98841864,0.00020338787,0.006883367],"study_design_scores_gemma":[0.000480102,0.00041482362,0.000036085137,0.00019704112,0.00019249934,0.00011303209,0.00043452502,0.0010963838,0.0029186714,0.99355733,0.00025214907,0.00030733322],"about_ca_topic_score_codex":0.0000017059871,"about_ca_topic_score_gemma":9.865463e-7,"teacher_disagreement_score":0.13474673,"about_ca_system_score_codex":0.000056785615,"about_ca_system_score_gemma":0.000034740875,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W1975494147","doi":"10.1007/s10107-013-0674-8","title":"Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Monotone polygon; Mathematics; Linear subspace; Subspace topology; Quadratic equation; Relation (database); Variational inequality; Pure mathematics; Discrete mathematics; Applied mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.01226726134119255,"score_gpt":0.22808668258064463,"score_spread":0.21581942123945208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975494147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029926302,0.000020105417,0.96650076,0.002521521,0.000044458855,0.0004178472,0.0000028089903,0.00013900084,0.00042720957],"genre_scores_gemma":[0.37967336,0.000015920412,0.61992925,0.00006709719,0.000024949843,0.00010087009,0.000008159211,0.000009656377,0.00017073899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987745,0.000044490283,0.00042225796,0.0002935839,0.00024255186,0.00022256358],"domain_scores_gemma":[0.9988171,0.00016757399,0.00017946587,0.00035938664,0.00031403656,0.00016246278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015801113,0.0001462465,0.00028023464,0.00018126088,0.00018755368,0.0001724932,0.00024127823,0.000067423185,0.00017657982],"category_scores_gemma":[0.00017726193,0.00012682936,0.00007854076,0.0006820553,0.000104927836,0.00055063947,0.00016102762,0.00009736939,0.0000705492],"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.0000022557983,0.00038446963,0.000606396,0.00009158289,0.0000952392,0.00000195186,0.0013180055,0.0004021745,0.0032509996,0.97736907,0.000043149237,0.016434679],"study_design_scores_gemma":[0.00027835273,0.00005082192,0.002129181,0.00005509255,0.000052124902,0.00003257443,0.00031031726,0.971527,0.0004993407,0.024447974,0.00038228423,0.00023494917],"about_ca_topic_score_codex":0.000030614556,"about_ca_topic_score_gemma":0.0000024956355,"teacher_disagreement_score":0.9711248,"about_ca_system_score_codex":0.00001345784,"about_ca_system_score_gemma":0.000032375807,"threshold_uncertainty_score":0.5171951},"labels":[],"label_agreement":null},{"id":"W1975952334","doi":"10.1007/pl00011384","title":"Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Monotonic function; Cutting-plane method; Variational inequality; Regular polygon; Plane (geometry); Set (abstract data type); Order (exchange); Applied mathematics; Inequality; Variational analysis; Mathematical optimization; Mathematical analysis; Geometry; Computer science","score_opus":0.0348545579723836,"score_gpt":0.34812445787049195,"score_spread":0.3132698998981084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975952334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046749154,0.000015720345,0.996447,0.0012021889,0.000019941532,0.00033251048,0.0000066887883,0.000082297986,0.0014261185],"genre_scores_gemma":[0.13836113,0.0000010325942,0.8611262,0.00008682882,0.000038149556,0.00016614121,0.000016450073,0.000005558256,0.00019851133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988359,0.00012762174,0.00045378858,0.00020235853,0.00020104965,0.0001792421],"domain_scores_gemma":[0.99693996,0.0024592737,0.00012560806,0.0002859066,0.00014400149,0.00004523187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019288547,0.00009257369,0.00019500995,0.000044501794,0.00025787216,0.00012325954,0.000357448,0.000040094917,0.00036212028],"category_scores_gemma":[0.0005474849,0.00006601508,0.00012257924,0.00030539706,0.00006771968,0.00016696512,0.000055834484,0.000069481444,0.000012073857],"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.0000024314122,0.000121476965,0.000028873936,0.00008338496,0.000046389716,7.002716e-8,0.0010061975,0.0016477874,0.000082306105,0.8935432,0.00001715732,0.10342076],"study_design_scores_gemma":[0.00013710692,0.000019423029,0.0001438089,0.00001724436,0.000032613054,0.000003893342,0.00009291872,0.7451814,0.0002870728,0.25186586,0.0021250586,0.00009360183],"about_ca_topic_score_codex":0.000007346613,"about_ca_topic_score_gemma":5.6450887e-7,"teacher_disagreement_score":0.7435336,"about_ca_system_score_codex":0.000018986018,"about_ca_system_score_gemma":0.000032754313,"threshold_uncertainty_score":0.3964963},"labels":[],"label_agreement":null},{"id":"W1975973957","doi":"10.1007/s10107-007-0145-1","title":"How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Jump; Sample (material); Markov chain; Algorithm; Root (linguistics); Mathematical optimization; Stochastic approximation; Jump process; Computer science; Statistics","score_opus":0.011375396128301001,"score_gpt":0.23885479756186767,"score_spread":0.22747940143356668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975973957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022245853,0.00003228071,0.99461204,0.0030168993,0.0000585836,0.0014787521,0.0000031484303,0.00038899048,0.00018682214],"genre_scores_gemma":[0.111253254,5.3991863e-7,0.88802695,0.00009411013,0.000116598356,0.00032385575,0.000007926973,0.000029177725,0.0001475887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783444,0.000038902566,0.00040486286,0.0005569493,0.00052559143,0.0006392723],"domain_scores_gemma":[0.99800944,0.0007458536,0.00015974107,0.0005715417,0.00020380292,0.00030961403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007307954,0.0002708528,0.0003255638,0.00014240107,0.0003325181,0.0009487471,0.00057838205,0.00007672114,0.000018521067],"category_scores_gemma":[0.00026898627,0.00018230449,0.000084650506,0.0009440879,0.00006658058,0.00056003453,0.00020965916,0.00018831895,0.000013559432],"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.000054845284,0.0005340084,0.0000133134,0.00015830659,0.00006230407,0.000026047912,0.0015013397,0.040781856,0.00008825101,0.06876507,0.00029832727,0.88771635],"study_design_scores_gemma":[0.00065420446,0.00014275209,0.000013258905,0.00014721158,0.000026248026,0.000034367873,0.00015608565,0.9869557,0.0001108121,0.0108431205,0.00058273,0.0003335351],"about_ca_topic_score_codex":0.000008016298,"about_ca_topic_score_gemma":0.000015532865,"teacher_disagreement_score":0.9461738,"about_ca_system_score_codex":0.0000640299,"about_ca_system_score_gemma":0.00003877103,"threshold_uncertainty_score":0.914879},"labels":[],"label_agreement":null},{"id":"W1980307085","doi":"10.1007/pl00011394","title":"Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discretization; Relaxation (psychology); Convex hull; Convex optimization; Linear programming relaxation; Quadratic equation; Semidefinite programming; Quadratic programming; Linear programming; Function (biology); Mathematical optimization; Finite set; Feasible region; Applied mathematics; Regular polygon; Combinatorics; Mathematical analysis; Geometry","score_opus":0.04527866346224898,"score_gpt":0.43101913157996863,"score_spread":0.38574046811771967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980307085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061406,0.00007542639,0.9958975,0.00030988245,0.000029838382,0.002208631,0.0000029537784,0.00016468143,0.00069707463],"genre_scores_gemma":[0.016605994,0.000049382892,0.9819444,0.000056560268,0.000044061948,0.0006155732,0.000085067666,0.00007562329,0.00052335695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977283,0.00029894896,0.0008095205,0.0004461326,0.00029919157,0.0004179083],"domain_scores_gemma":[0.99724066,0.0019075001,0.0002220275,0.00026407622,0.00023249343,0.00013321293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750013,0.0002443196,0.00043156312,0.00021471624,0.00020674912,0.0001719169,0.0001439408,0.0001922834,0.0006198169],"category_scores_gemma":[0.003792062,0.00022805437,0.000058505244,0.0006731832,0.00015914417,0.0005427057,0.000040535782,0.00017927287,0.000010803398],"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.00015146288,0.0005962837,0.00020967076,0.0016407744,0.000048210208,0.0000043647447,0.00411708,0.16185573,0.00004874557,0.1419473,0.000051007955,0.6893294],"study_design_scores_gemma":[0.00087350124,0.000081835606,0.0000059345384,0.00015386975,0.000030045261,0.000005769591,0.00032285054,0.8497804,0.00016782827,0.14795585,0.00040018855,0.00022196761],"about_ca_topic_score_codex":0.0000044261888,"about_ca_topic_score_gemma":0.0000051864276,"teacher_disagreement_score":0.6891074,"about_ca_system_score_codex":0.0001283334,"about_ca_system_score_gemma":0.000042762756,"threshold_uncertainty_score":0.9299787},"labels":[],"label_agreement":null},{"id":"W1980450998","doi":"10.1007/s10107-002-0349-3","title":"On implementing a primal-dual interior-point method for conic quadratic optimization","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":664,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Conic section; Conic optimization; Quadratic equation; Mathematics; Quadratic programming; Mathematical optimization; Dual (grammatical number); Quadratic unconstrained binary optimization; Optimization problem; Extension (predicate logic); Algorithm; Computer science; Convex optimization; Geometry","score_opus":0.06817259144325699,"score_gpt":0.4259764846376932,"score_spread":0.35780389319443623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980450998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031557315,0.000015972853,0.99359477,0.0001994984,0.00005851876,0.0024901915,0.000006099114,0.0002685842,0.0030508048],"genre_scores_gemma":[0.0061323466,0.000001909328,0.99212146,0.000087154716,0.00004111009,0.00084367034,0.00001759741,0.00011416344,0.00064061116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968729,0.00027571607,0.00092118885,0.00051043794,0.00053582556,0.00088392344],"domain_scores_gemma":[0.9956991,0.0030622606,0.00029772165,0.0004594033,0.00029149195,0.00019004423],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002623479,0.00032635848,0.0005258485,0.0001821098,0.00033014105,0.00022585978,0.00019816236,0.00012523663,0.0009750154],"category_scores_gemma":[0.009862697,0.0002876878,0.00019097741,0.00038070514,0.000080048565,0.00021542264,0.00009735654,0.000280267,0.000039693354],"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.000049354112,0.00044655812,0.0000026220291,0.0009043054,0.000100240046,0.0000070958426,0.0010469395,0.0061068176,0.00014228675,0.9629189,0.00021154502,0.028063355],"study_design_scores_gemma":[0.0013028058,0.0003399625,1.0031463e-7,0.00018894271,0.0000648549,0.000038235085,0.00094700814,0.570731,0.002146063,0.42244872,0.0014357369,0.0003565649],"about_ca_topic_score_codex":7.4672914e-7,"about_ca_topic_score_gemma":0.0000016911763,"teacher_disagreement_score":0.5646242,"about_ca_system_score_codex":0.00019727946,"about_ca_system_score_gemma":0.00008399964,"threshold_uncertainty_score":0.9999575},"labels":[],"label_agreement":null},{"id":"W1988815259","doi":"10.1007/s10107-015-0870-9","title":"A dynamic inequality generation scheme for polynomial programming","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polynomial; Scheme (mathematics); Binary number; Relaxation (psychology); Mathematical optimization; Semidefinite programming; Applied mathematics; Algorithm","score_opus":0.19967326502026428,"score_gpt":0.43364985461347416,"score_spread":0.23397658959320988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988815259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012204332,0.000057555142,0.98380065,0.00048165757,0.00012556168,0.0025152157,0.000008628786,0.000474087,0.00033229744],"genre_scores_gemma":[0.03216016,0.0000012523981,0.965564,0.000036608024,0.00021590616,0.0010768272,0.00006190617,0.000097389464,0.0007859138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709666,0.00012275676,0.00080013665,0.0004919155,0.0007249077,0.0007635988],"domain_scores_gemma":[0.9977908,0.00054973346,0.00022866887,0.0005009833,0.00052824436,0.00040154502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020474344,0.000299445,0.00047385212,0.00014561832,0.00021582976,0.00025183294,0.00030560858,0.000184303,0.00004568017],"category_scores_gemma":[0.0066030193,0.00027052077,0.00016277451,0.00041196018,0.00014510717,0.00032951857,0.00015874549,0.00026698777,0.000056458546],"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.00032721265,0.0033973358,0.00015400321,0.0026533597,0.00030230655,0.0000311683,0.005639282,0.00058918336,0.001798542,0.18699722,0.005401242,0.7927092],"study_design_scores_gemma":[0.0024310388,0.00037836639,0.00000178875,0.00009615847,0.000060760292,0.000034321285,0.001012686,0.84628576,0.00070552324,0.13130465,0.017064605,0.00062434986],"about_ca_topic_score_codex":0.0000031052357,"about_ca_topic_score_gemma":0.000009938913,"teacher_disagreement_score":0.84569657,"about_ca_system_score_codex":0.00030030342,"about_ca_system_score_gemma":0.00015199189,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W1989246731","doi":"10.1007/s10107-011-0480-0","title":"On stress matrices of (d + 1)-lateration frameworks in general position","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Constructive; Combinatorics; Graph; Constructive proof; Rank (graph theory); Position (finance); Matrix (chemical analysis); Discrete mathematics; Computer science","score_opus":0.010804052415786233,"score_gpt":0.21739156437326715,"score_spread":0.20658751195748093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989246731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86607593,0.00004930707,0.13216518,0.000008333022,0.00003938024,0.00013702826,0.0000011330872,0.00007365066,0.0014500695],"genre_scores_gemma":[0.9376283,0.0000059180757,0.062304772,0.000006225922,0.00001792436,0.0000115955545,0.000009349573,0.000009425422,0.000006472843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946356,0.0000113157985,0.00024023892,0.00007613065,0.0000996718,0.00010906797],"domain_scores_gemma":[0.9998215,0.00002498836,0.00003230138,0.00007977738,0.00001872585,0.000022696895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006001755,0.00007666516,0.00013109577,0.000089109955,0.000014784296,0.000019949852,0.000050019185,0.00009826338,0.00014204068],"category_scores_gemma":[0.000017740185,0.000061768944,0.00003786026,0.00017387256,0.000012675669,0.00008204745,0.0000072628864,0.00011484366,0.000007485862],"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.00008542964,0.0006784858,0.004923788,0.0017830245,0.00019545059,0.000029460323,0.009424609,0.36425498,0.003788026,0.31230602,0.00005061193,0.3024801],"study_design_scores_gemma":[0.00018249164,0.00007456936,0.0020303496,0.00030549508,0.000032467688,0.000002475506,0.00009298518,0.93334705,0.012055504,0.051700506,0.0000031450022,0.00017293636],"about_ca_topic_score_codex":0.000007005004,"about_ca_topic_score_gemma":0.0000035442677,"teacher_disagreement_score":0.5690921,"about_ca_system_score_codex":0.000019434829,"about_ca_system_score_gemma":0.0000011983283,"threshold_uncertainty_score":0.25188643},"labels":[],"label_agreement":null},{"id":"W1989744925","doi":"10.1007/s10107-006-0037-9","title":"Foreword: Special issue on large-scale nonlinear and semidefinite programming","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Nonlinear programming; Semidefinite embedding; Nonlinear system; Scale (ratio); Mathematical optimization; Numerical analysis; Applied mathematics; Quadratically constrained quadratic program; Mathematical analysis; Quadratic programming; Geography","score_opus":0.026590515130218303,"score_gpt":0.3325327726903277,"score_spread":0.3059422575601094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989744925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019406293,0.00013342004,0.9352635,0.0012851444,0.00028364448,0.0040102494,0.00006718796,0.001301548,0.038248967],"genre_scores_gemma":[0.0020391229,0.000006728638,0.9897851,0.000069062815,0.0027271486,0.00021249527,0.00003468909,0.00013135608,0.0049943393],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99681383,0.00008645457,0.0007367199,0.00057357154,0.0008071095,0.0009823136],"domain_scores_gemma":[0.99807924,0.0008654721,0.0001831091,0.00047913095,0.00016071345,0.00023236271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008459856,0.00038058215,0.0005338932,0.00019864466,0.000344912,0.00021196916,0.00024796606,0.00020202294,0.0006010214],"category_scores_gemma":[0.00093772647,0.0003324114,0.00013144594,0.0005020001,0.00021695308,0.00020477637,0.00021593744,0.0005020219,0.00027258194],"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.00014752455,0.0040603173,0.00041614493,0.0018277965,0.00009552069,0.00014899507,0.0022125246,0.00025904473,0.000039816743,0.33371,0.0061664297,0.65091586],"study_design_scores_gemma":[0.0026339833,0.0005491047,0.000039714527,0.0005766331,0.0001068415,0.00010604151,0.0016663207,0.14228007,0.0007749013,0.42195424,0.42812553,0.0011866271],"about_ca_topic_score_codex":0.000003707355,"about_ca_topic_score_gemma":0.00002176506,"teacher_disagreement_score":0.64972925,"about_ca_system_score_codex":0.00008748622,"about_ca_system_score_gemma":0.000029401119,"threshold_uncertainty_score":0.9999128},"labels":[],"label_agreement":null},{"id":"W1991832688","doi":"10.1007/pl00011400","title":"A stochastic programming model using an endogenously determined worst case risk measure for dynamic asset allocation","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stochastic game; Portfolio; Sharpe ratio; Dynamic programming; Risk measure; Stochastic programming; Measure (data warehouse); Portfolio optimization; Asset (computer security); Stochastic investment model; Mathematics; Mathematical optimization; Economics; Asset allocation; Expected utility hypothesis; Transaction cost; Risk aversion (psychology); Econometrics; Mathematical economics; Computer science; Microeconomics; Financial economics","score_opus":0.15378398146636194,"score_gpt":0.3958709482372792,"score_spread":0.24208696677091726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991832688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31211218,0.000046953606,0.68602914,0.00003872207,0.000064671665,0.0015026864,0.00001209618,0.00015435356,0.000039234747],"genre_scores_gemma":[0.63363975,0.000003293209,0.3659176,0.0000138914165,0.000057767396,0.00021424287,0.000023310666,0.00004724611,0.000082891114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957721,0.00023360128,0.0012527113,0.0008133457,0.0011449662,0.00078322284],"domain_scores_gemma":[0.99658555,0.00093469885,0.00064415444,0.0008216936,0.00064499077,0.00036891008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004448161,0.00036876014,0.00055093743,0.00036377917,0.00081502524,0.00092300435,0.0005067365,0.00021447307,0.000027037173],"category_scores_gemma":[0.003982158,0.00029665165,0.00024514482,0.00095417135,0.00013208427,0.00079592795,0.00008338864,0.00023479512,0.00003010614],"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.00009426593,0.0005857035,0.0002178804,0.00003113853,0.000036661047,0.00013903937,0.0025361136,0.23806779,0.0001854632,0.00057768484,0.00000798469,0.75752026],"study_design_scores_gemma":[0.0005516984,0.00017098148,0.0000069048206,0.000050320446,0.0001711749,0.001520186,0.0011446818,0.95860624,0.000016407967,0.037223056,0.00018551217,0.00035280545],"about_ca_topic_score_codex":0.000048045888,"about_ca_topic_score_gemma":0.00026451857,"teacher_disagreement_score":0.75716746,"about_ca_system_score_codex":0.00013633192,"about_ca_system_score_gemma":0.00013961799,"threshold_uncertainty_score":0.99994856},"labels":[],"label_agreement":null},{"id":"W1991937133","doi":"10.1007/s10107-014-0795-8","title":"Extreme point inequalities and geometry of the rank sparsity ball","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Extreme point; Ball (mathematics); Unit sphere; Matrix norm; Norm (philosophy); Penalty method; Convex geometry; Rank (graph theory); Regular polygon; Algebra over a field; Mathematical optimization; Combinatorics; Geometry; Convex optimization; Convex set; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.029097338672444233,"score_gpt":0.22102634940451651,"score_spread":0.19192901073207227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991937133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7866875,0.0001765455,0.2076192,0.0001040775,0.00006953519,0.00024321355,9.866205e-7,0.00046839262,0.004630545],"genre_scores_gemma":[0.9769526,0.0000041333496,0.02294581,0.000023168875,0.00002692254,0.000005749224,3.414739e-7,0.000014666787,0.000026611639],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993949,0.000032137996,0.00019475912,0.000085999636,0.00013406169,0.00015814285],"domain_scores_gemma":[0.9995281,0.00014185248,0.000033004515,0.00023708615,0.000023955916,0.00003601517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026413612,0.00009927035,0.00018903683,0.000035303743,0.00004129501,0.000028934473,0.000119269265,0.000050212377,0.000015893453],"category_scores_gemma":[0.00014461779,0.00006884765,0.00005241221,0.000092458584,0.00009685862,0.000041449708,0.00008936454,0.00010594299,0.0000032065504],"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.000028342925,0.00036453965,0.006804447,0.0033237094,0.00028807804,0.000008341948,0.005377022,0.00053400313,0.027239721,0.46341422,0.0018455954,0.49077198],"study_design_scores_gemma":[0.0009934907,0.00021757146,0.0053189937,0.0019364166,0.00021236546,0.00009782362,0.00097316,0.2536902,0.16298354,0.5582499,0.014213952,0.0011125855],"about_ca_topic_score_codex":0.000005506745,"about_ca_topic_score_gemma":0.0000015123328,"teacher_disagreement_score":0.4896594,"about_ca_system_score_codex":0.000008914358,"about_ca_system_score_gemma":0.0000020594837,"threshold_uncertainty_score":0.28075257},"labels":[],"label_agreement":null},{"id":"W1994002660","doi":"10.1007/s10107-008-0242-9","title":"Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fleischer; Mathematics; Submodular set function; Algorithm; Function (biology); Minification; Polynomial; Combinatorial algorithms; Time complexity; Extension (predicate logic); Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.038946646905112035,"score_gpt":0.2594211731772316,"score_spread":0.22047452627211958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994002660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017890602,0.000068528716,0.9802254,0.00030543644,0.00058427476,0.00055539655,0.0000022084816,0.00024267363,0.00012548818],"genre_scores_gemma":[0.35611507,0.000005647114,0.64321744,0.000049691946,0.00038215984,0.00013810476,0.000010501469,0.000019548477,0.00006180001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986123,0.00004068682,0.00032989294,0.00038062906,0.0002874231,0.000349096],"domain_scores_gemma":[0.9991979,0.00020921991,0.00009385109,0.00027910876,0.00009225218,0.0001276631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031281973,0.00016714918,0.00023909217,0.00009807357,0.00041047932,0.00017694167,0.0002904962,0.00009153891,0.0000073791985],"category_scores_gemma":[0.00014314314,0.0001580261,0.00009448514,0.00025984118,0.00015059684,0.00045741684,0.00015194088,0.000114052826,0.000007768657],"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.00004997817,0.00046509033,0.000096102114,0.00016180209,0.000055288918,0.000011856326,0.00096123427,0.000026331738,0.000090999936,0.67937624,0.00057014864,0.3181349],"study_design_scores_gemma":[0.00266195,0.0010726658,0.00037348032,0.00006208017,0.00005124039,0.00015998841,0.00011583601,0.67075986,0.00040155463,0.30658808,0.017165532,0.0005877447],"about_ca_topic_score_codex":0.0000023203522,"about_ca_topic_score_gemma":4.779352e-7,"teacher_disagreement_score":0.6707335,"about_ca_system_score_codex":0.000025765768,"about_ca_system_score_gemma":0.00003560077,"threshold_uncertainty_score":0.64441174},"labels":[],"label_agreement":null},{"id":"W1995339711","doi":"10.1007/s10107-013-0666-8","title":"Computing the conjugate of convex piecewise linear-quadratic bivariate functions","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Bivariate analysis; Piecewise; Regular polygon; Quadratic equation; Piecewise linear function; Applied mathematics; Convex analysis; Convex conjugate; Convex optimization; Proper convex function; Mathematical optimization; Mathematical analysis; Statistics; Geometry","score_opus":0.05572542173380636,"score_gpt":0.352413941868189,"score_spread":0.2966885201343826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995339711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011892899,0.000051312833,0.98219186,0.0009407173,0.00008007725,0.0017154046,0.0000026339992,0.00023889614,0.0028862183],"genre_scores_gemma":[0.32608575,0.0000049256632,0.67216516,0.00007588865,0.00010173878,0.0001962119,0.000005754209,0.00007233006,0.0012922166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974109,0.00017366801,0.00086694385,0.0002768006,0.0007386909,0.00053302303],"domain_scores_gemma":[0.9959935,0.00230322,0.00030752592,0.0005966085,0.00063873164,0.000160392],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011156138,0.00023334866,0.00046557855,0.00009880215,0.00030099967,0.00012581484,0.00038527025,0.00009869517,0.0009344925],"category_scores_gemma":[0.0034821925,0.0001539446,0.00014121062,0.00055340555,0.00040232384,0.00020884987,0.000225559,0.00038824207,0.00050934043],"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.000047809277,0.0027137764,0.0002824578,0.00372859,0.0006933827,0.000022020336,0.008874442,0.003975873,0.0017314707,0.6907282,0.003168132,0.28403386],"study_design_scores_gemma":[0.000711928,0.00013106769,0.00003058535,0.0002269234,0.00008673546,0.000022722541,0.0019055621,0.68814355,0.00071754184,0.3063919,0.0013164749,0.00031503075],"about_ca_topic_score_codex":0.000014095888,"about_ca_topic_score_gemma":0.0000016687557,"teacher_disagreement_score":0.6841677,"about_ca_system_score_codex":0.00005388105,"about_ca_system_score_gemma":0.00006457277,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W1996513689","doi":"10.1007/s10107-002-0330-1","title":"An analytic center quadratic cut method for the convex quadratic feasibility problem","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Mathematics; Quadratic equation; Quadratic function; Quadratically constrained quadratic program; Isotropic quadratic form; Quadratic programming; Convex function; Combinatorics; Regular polygon; Quadratic growth; Convex set; Convex optimization; Polynomial; Binary quadratic form; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Geometry","score_opus":0.15324201619284777,"score_gpt":0.4432078262764525,"score_spread":0.2899658100836047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996513689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045016303,0.00007734973,0.9921287,0.0013463731,0.00005178378,0.004606171,0.000011480727,0.00034095065,0.0009870855],"genre_scores_gemma":[0.04249016,0.0000066514945,0.9545605,0.00013389763,0.00011298487,0.0010733957,0.000011144182,0.00011052885,0.0015007327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961673,0.000405457,0.0010381928,0.0006675999,0.0008070448,0.00091438834],"domain_scores_gemma":[0.99398214,0.003795645,0.00027937707,0.0012504071,0.0003719959,0.00032046082],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025268644,0.0003975932,0.0006875307,0.00012235991,0.0005236817,0.00037850515,0.0007154777,0.00016051937,0.0011111678],"category_scores_gemma":[0.0031654418,0.0002644887,0.00028084553,0.0005750633,0.00027825453,0.0003828098,0.00011431166,0.00043757015,0.00013204325],"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.00019338293,0.012638703,0.00056167296,0.009081792,0.0009612964,0.000042478787,0.01579884,0.0027726328,0.00030008395,0.5811244,0.0039718607,0.37255284],"study_design_scores_gemma":[0.0007980439,0.00020760078,0.0000034494349,0.000079945516,0.00011910037,0.000029841987,0.0008106669,0.75031084,0.000094216746,0.24631128,0.00095578784,0.00027922745],"about_ca_topic_score_codex":0.0000037462073,"about_ca_topic_score_gemma":0.000018393239,"teacher_disagreement_score":0.7475382,"about_ca_system_score_codex":0.00017340845,"about_ca_system_score_gemma":0.000036234866,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W1996676734","doi":"10.1007/s10107-013-0633-4","title":"On solving simple bilevel programs with a nonconvex lower level program","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Bilevel optimization; Limit point; Smoothing; Stationary point; Constraint (computer-aided design); Feasible region; Convex optimization; Sequence (biology); Limit (mathematics); Interior point method; Variational inequality; Optimization problem; Regular polygon; Bounded function; Simple (philosophy); Penalty method; Limit of a sequence","score_opus":0.03310765846871954,"score_gpt":0.26148453831081175,"score_spread":0.2283768798420922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996676734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036449963,0.0000050940594,0.9892941,0.0015729897,0.000037928574,0.0013279594,6.809934e-7,0.00069373584,0.0034224854],"genre_scores_gemma":[0.40762717,3.37279e-7,0.5910476,0.00023086015,0.000031576143,0.0006431341,0.000009473716,0.000019830704,0.00039003094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784106,0.000049261944,0.00040697452,0.0005136663,0.0006415988,0.00054741214],"domain_scores_gemma":[0.99859,0.00019688113,0.00015103362,0.0005431403,0.00027784103,0.00024109797],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028513334,0.0002631092,0.00030214264,0.00013650807,0.00022079772,0.001041273,0.0005954218,0.00008565806,0.00036260107],"category_scores_gemma":[0.00013069944,0.00017848429,0.00013024856,0.00086096453,0.000084423846,0.0006002779,0.000162495,0.00018765671,0.00070850656],"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.000005617965,0.0015668026,0.00017559208,0.00007108576,0.00008406521,0.00001010861,0.00038262134,0.00020808242,0.000011009523,0.22458227,0.00021260949,0.7726901],"study_design_scores_gemma":[0.0005528395,0.0010182582,0.00043332423,0.0001413436,0.00004171127,0.000025902415,0.000092077724,0.87695247,0.000070977505,0.1176394,0.0024438703,0.0005878147],"about_ca_topic_score_codex":0.00002371658,"about_ca_topic_score_gemma":0.0000055364703,"teacher_disagreement_score":0.8767444,"about_ca_system_score_codex":0.000050880783,"about_ca_system_score_gemma":0.000058853675,"threshold_uncertainty_score":0.99999577},"labels":[],"label_agreement":null},{"id":"W1999966159","doi":"10.1007/s10107-011-0463-1","title":"Structural and algorithmic properties for parametric minimum cuts","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Parametric statistics; Property (philosophy); Submodular set function; Arc length; Minimum cut; Mathematical optimization; Parametric model; Applied mathematics; Arc (geometry); Combinatorics; Geometry","score_opus":0.09634188982781142,"score_gpt":0.2654593284455053,"score_spread":0.16911743861769388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999966159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049280904,0.00025236534,0.9484471,0.00013438391,0.00016497077,0.000831485,0.0000014675875,0.00029723434,0.00059005606],"genre_scores_gemma":[0.40974432,0.0000015536518,0.59001464,0.00003072058,0.00003317725,0.00009931728,4.6738324e-7,0.000008773459,0.00006702461],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876976,0.000026335043,0.0002731792,0.00034627557,0.00019000702,0.0003944351],"domain_scores_gemma":[0.99928546,0.00014608928,0.000066254004,0.0003183614,0.00006192921,0.0001219136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027753352,0.00016583772,0.00022776253,0.00012502041,0.00020499849,0.00021154185,0.000493234,0.000059432634,0.0000116722995],"category_scores_gemma":[0.00016505487,0.00012496677,0.00008343533,0.00033853672,0.00017545838,0.000302206,0.00024736166,0.00010873005,0.000010779443],"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.0000090622225,0.0001062555,0.00008989954,0.00029961678,0.00003220939,0.000006988819,0.0028779774,4.402173e-7,0.000038324335,0.39268044,0.00003078449,0.603828],"study_design_scores_gemma":[0.00044480897,0.0003348216,0.00020971795,0.000083439605,0.000023478615,0.00010340784,0.00014443042,0.3774762,0.0009954487,0.61877906,0.0010283318,0.00037684888],"about_ca_topic_score_codex":0.0000059956374,"about_ca_topic_score_gemma":7.958526e-7,"teacher_disagreement_score":0.60345113,"about_ca_system_score_codex":0.000012286286,"about_ca_system_score_gemma":0.00001673608,"threshold_uncertainty_score":0.5095997},"labels":[],"label_agreement":null},{"id":"W2000722448","doi":"10.1007/s10107-010-0432-0","title":"Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Monotone polygon; Monotonic function; Complementarity (molecular biology); Mathematics; Lipschitz continuity; Mixed complementarity problem; Nonlinear complementarity problem; Complementarity theory; Pure mathematics; Cone (formal languages); Mathematical economics; Nonlinear system; Mathematical analysis; Algorithm; Geometry","score_opus":0.0942000388850745,"score_gpt":0.3664300363842832,"score_spread":0.2722299974992087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000722448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70824116,0.000058429923,0.27680814,0.0014817764,0.00004382486,0.0063602123,0.00007763488,0.00030253225,0.0066263075],"genre_scores_gemma":[0.75977176,0.000002763259,0.23848368,0.00007108124,0.000044478802,0.0014181683,0.000005855385,0.000033692653,0.0001685327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796,0.000038984348,0.00088278507,0.00035717394,0.00035794033,0.00040315354],"domain_scores_gemma":[0.9976061,0.0011605225,0.00019096349,0.0005206264,0.00020389065,0.0003178966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091367034,0.00023741176,0.00053466175,0.00012954943,0.00019259515,0.0000856876,0.0003183102,0.00011356484,0.00040603356],"category_scores_gemma":[0.000893337,0.0001922751,0.000091569935,0.00056697684,0.00013253515,0.00008728338,0.00025234566,0.00031325076,0.000063503394],"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.0000024560459,0.0006208784,0.000044274773,0.0011433475,0.00003080341,2.5541166e-7,0.0006090913,6.023231e-7,0.0035390153,0.98846436,0.00006930682,0.0054756193],"study_design_scores_gemma":[0.00048765115,0.00013388002,0.000049627557,0.00014231066,0.00013553184,0.000019755189,0.00065759965,0.0049745985,0.0074165384,0.96459144,0.020912796,0.00047826552],"about_ca_topic_score_codex":0.000017865408,"about_ca_topic_score_gemma":0.000030107085,"teacher_disagreement_score":0.051530596,"about_ca_system_score_codex":0.000020857058,"about_ca_system_score_gemma":0.000024733412,"threshold_uncertainty_score":0.7840751},"labels":[],"label_agreement":null},{"id":"W2001944732","doi":"10.1007/pl00011428","title":"Concavity cuts for disjoint bilinear programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Disjoint sets; Bilinear interpolation; Mathematics; Mathematical optimization; Linear programming; Degenerate energy levels; Optimization problem; Nonlinear programming; Combinatorics; Nonlinear system","score_opus":0.04709839733559648,"score_gpt":0.30241239680414445,"score_spread":0.25531399946854794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001944732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048753605,0.00007936033,0.9910973,0.0010343909,0.00019895604,0.0011204776,0.0000018079759,0.00068980554,0.0009025519],"genre_scores_gemma":[0.106974095,0.0000035953935,0.892061,0.00013089273,0.00017258737,0.00034618436,0.000005545884,0.000024266172,0.00028182467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777603,0.000048675538,0.00048857235,0.0005559212,0.00038225998,0.0007485403],"domain_scores_gemma":[0.9983942,0.0004597155,0.00011956261,0.00066794007,0.00012806707,0.00023050475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084641355,0.0002495897,0.00036128188,0.00009982859,0.0003531442,0.0005052782,0.00086483837,0.00009540441,0.000028338325],"category_scores_gemma":[0.00037732083,0.00021208322,0.0002627222,0.00057433825,0.00018217336,0.0003782339,0.0003514878,0.00020985727,0.00006772232],"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.000006884758,0.00038019806,0.00012512978,0.00014205698,0.000022035836,0.000020018062,0.0004339933,0.0000041975063,0.0000372753,0.2981881,0.000085906715,0.70055425],"study_design_scores_gemma":[0.0009956042,0.00048709306,0.00008759776,0.00018533858,0.00003948204,0.00020631791,0.00020273608,0.2951645,0.00058861414,0.41610628,0.28519917,0.0007372833],"about_ca_topic_score_codex":0.000006711507,"about_ca_topic_score_gemma":0.000005037024,"teacher_disagreement_score":0.69981694,"about_ca_system_score_codex":0.00004438559,"about_ca_system_score_gemma":0.00004099591,"threshold_uncertainty_score":0.8648503},"labels":[],"label_agreement":null},{"id":"W2004699374","doi":"10.1007/s10107-007-0139-z","title":"The capacitated max k-cut problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Mathematics; Numerical analysis; Combinatorics; Mathematical optimization; Applied mathematics; Mathematical analysis","score_opus":0.023004667484770168,"score_gpt":0.2664882864225961,"score_spread":0.2434836189378259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004699374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019206712,0.000090302616,0.98373306,0.0010795093,0.00014570187,0.0003617746,2.509177e-7,0.00042456613,0.012244137],"genre_scores_gemma":[0.16543648,0.0000033362621,0.8337209,0.00012751544,0.00008447522,0.000042746917,8.270512e-7,0.000015542268,0.00056814885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828756,0.000038850016,0.00037917073,0.00026782887,0.00039786403,0.0006287455],"domain_scores_gemma":[0.998495,0.00066452706,0.0000797245,0.00054364814,0.00007635459,0.00014074409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017942037,0.00014540165,0.0001477302,0.000057031164,0.00055133534,0.00048105084,0.0010030195,0.000055124514,0.000011923778],"category_scores_gemma":[0.00014728968,0.00009365304,0.00010088127,0.0005633464,0.00022778354,0.00019756725,0.00026405495,0.00024200868,0.00014215261],"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.0000016817909,0.00005943056,0.000009342439,0.000022661838,0.00001079203,0.00001437343,0.00051429315,7.040428e-7,0.000025655496,0.62839484,0.000096512995,0.3708497],"study_design_scores_gemma":[0.00019581165,0.00009241127,0.0000642466,0.00006094587,0.00000779859,0.000095032134,0.00026630567,0.02150583,0.00086164294,0.9158579,0.0607347,0.00025737216],"about_ca_topic_score_codex":0.000005081996,"about_ca_topic_score_gemma":0.00001522954,"teacher_disagreement_score":0.37059233,"about_ca_system_score_codex":0.00002944866,"about_ca_system_score_gemma":0.000019287214,"threshold_uncertainty_score":0.46387842},"labels":[],"label_agreement":null},{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","score_opus":0.05865507247347649,"score_gpt":0.2737072331314133,"score_spread":0.21505216065793684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005509629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01337527,0.0001029375,0.98338807,0.00039280803,0.00016080652,0.0008411355,4.4320203e-7,0.0008422073,0.0008963377],"genre_scores_gemma":[0.33148664,8.05484e-7,0.66827005,0.000055868863,0.00006552057,0.00008125153,0.0000023314935,0.000026130954,0.000011413418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970406,0.00005979292,0.0007368347,0.00064893643,0.0006231989,0.00089058717],"domain_scores_gemma":[0.99860746,0.000101336125,0.00023929136,0.0007216014,0.00010486631,0.00022544636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081016746,0.000344285,0.00042931808,0.00014178749,0.0004303191,0.0009362872,0.0010125532,0.00011162953,0.000012642736],"category_scores_gemma":[0.00019865744,0.00029126822,0.00023045656,0.0009247177,0.00021919768,0.000752129,0.0006624851,0.00043582515,0.00005707399],"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.0000015524457,0.00063367496,0.00012538568,0.00043186615,0.00003690584,0.000035278717,0.0034958795,0.0004330224,0.00025600955,0.61534023,0.000002029669,0.37920818],"study_design_scores_gemma":[0.0004969479,0.00015936037,0.000007923297,0.0011778384,0.00002141257,0.00023117363,0.0006156147,0.33793133,0.00044822326,0.6577611,0.0005955417,0.0005535701],"about_ca_topic_score_codex":0.00002992531,"about_ca_topic_score_gemma":0.00000441148,"teacher_disagreement_score":0.3786546,"about_ca_system_score_codex":0.00013366825,"about_ca_system_score_gemma":0.0000697381,"threshold_uncertainty_score":0.9999539},"labels":[],"label_agreement":null},{"id":"W2007277085","doi":"10.1007/s10107-007-0124-6","title":"Computing proximal points of nonconvex functions","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Subgradient method; Proximal Gradient Methods; Bounded function; Lipschitz continuity; Mathematical optimization; Regular polygon; Function (biology); Convex optimization; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.01754484837312971,"score_gpt":0.2718162145073227,"score_spread":0.254271366134193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007277085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002055959,0.000008896502,0.9910071,0.00043914438,0.000048642803,0.0001253868,2.8289438e-7,0.00011856694,0.0061960462],"genre_scores_gemma":[0.47763425,9.451436e-8,0.5221674,0.00004836121,0.000025009273,0.000001730083,0.0000016400579,0.0000036134588,0.000117895754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890095,0.000022202441,0.00039865705,0.00017804331,0.00028923622,0.00021089516],"domain_scores_gemma":[0.9992036,0.00022376871,0.00013234392,0.00021054619,0.00014604825,0.00008368861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008525369,0.00008059157,0.00016037414,0.0001166377,0.000098391,0.00006831909,0.00026103292,0.000040254,0.00006631128],"category_scores_gemma":[0.00017313786,0.00006856425,0.00009043305,0.0006013745,0.000040415685,0.00017099196,0.00011901076,0.000077182274,0.000072217226],"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.000004280042,0.00043348852,0.0008444047,0.00009495413,0.00006885516,0.0000047347307,0.0009732347,0.00024507171,0.00013077751,0.8349398,0.000057774476,0.16220267],"study_design_scores_gemma":[0.00042626754,0.00010085513,0.0017551013,0.00006881882,0.0000494601,0.000024617531,0.00023523178,0.96551734,0.0009854437,0.029131014,0.0014489195,0.00025691165],"about_ca_topic_score_codex":0.0000026862656,"about_ca_topic_score_gemma":0.000001533628,"teacher_disagreement_score":0.9652723,"about_ca_system_score_codex":0.000019967894,"about_ca_system_score_gemma":0.000023462962,"threshold_uncertainty_score":0.2795969},"labels":[],"label_agreement":null},{"id":"W2010003677","doi":"10.1007/s101070050020","title":"New error bounds and their applications to convergence analysis of iterative algorithms","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Sublinear function; Mathematics; Sequence (biology); Convex function; Rate of convergence; Function (biology); Convergence (economics); Convex optimization; Algorithm; Combinatorics; Regular polygon; Applied mathematics; Mathematical optimization; Computer science","score_opus":0.05693277297337088,"score_gpt":0.38643188571191994,"score_spread":0.32949911273854904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010003677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037439817,0.000062447165,0.9935556,0.00024422244,0.000007073955,0.00097634055,0.000017802817,0.00010171779,0.0012908225],"genre_scores_gemma":[0.026122708,0.0000108308595,0.97018254,0.000042849577,0.00003372071,0.0002793051,0.000013038939,0.00003343574,0.0032815614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836826,0.00005533431,0.0005431666,0.0003605423,0.0003301487,0.0003425414],"domain_scores_gemma":[0.9983723,0.00061467744,0.00009926234,0.00043168984,0.00016866978,0.00031336964],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035198563,0.00020217894,0.00053115975,0.00027700266,0.00012844962,0.00008295408,0.000240738,0.00007417621,0.0021181605],"category_scores_gemma":[0.00026439223,0.0001626479,0.00012463839,0.0018663828,0.00013274106,0.00013470474,0.00008498754,0.00014212907,0.000051740713],"study_design_candidate":"design_other","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.000031057083,0.0004423568,0.00008310317,0.00026537216,0.0008273999,0.0000027755295,0.00841639,0.00093625113,0.00015349487,0.07168556,0.0002028558,0.9169534],"study_design_scores_gemma":[0.00087096344,0.00032724426,0.00011466573,0.0001696342,0.000812964,0.00001984492,0.0024690556,0.55253774,0.002159258,0.42269588,0.016954323,0.00086842757],"about_ca_topic_score_codex":0.0000075150238,"about_ca_topic_score_gemma":0.0000067966344,"teacher_disagreement_score":0.91608495,"about_ca_system_score_codex":0.00004024545,"about_ca_system_score_gemma":0.00004140263,"threshold_uncertainty_score":0.998794},"labels":[],"label_agreement":null},{"id":"W2011866660","doi":"10.1007/s10107-009-0319-0","title":"Autoconjugate representers for linear monotone operators","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Operator theory; Pseudo-monotone operator; Operator (biology); Subderivative; Pure mathematics; Linear operators; Representation (politics); Algebra over a field; Nonlinear system; Real line; Identity (music); Applied mathematics; Discrete mathematics; Finite-rank operator; Mathematical analysis; Regular polygon; Banach space; Convex optimization","score_opus":0.022907714099575118,"score_gpt":0.2994112209320299,"score_spread":0.2765035068324548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011866660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031963462,0.000008702901,0.99314135,0.0048146457,0.000030277879,0.00043752947,5.911884e-7,0.00021223021,0.001035041],"genre_scores_gemma":[0.15215792,9.78412e-7,0.8466295,0.0006000197,0.00005075582,0.00007926712,0.000005278,0.000006075928,0.00047019403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990416,0.000022166494,0.0002772685,0.0002619705,0.00018359881,0.00021336251],"domain_scores_gemma":[0.99936324,0.000090222566,0.00006114447,0.0002896993,0.00009734502,0.00009834134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003026967,0.00009858107,0.00016584268,0.00006894375,0.00012532063,0.00020852392,0.00034220418,0.000039596565,0.00002532796],"category_scores_gemma":[0.00019165996,0.00008033653,0.00011682684,0.00030438183,0.000016845026,0.00026602618,0.00004824641,0.000053061245,0.000050002276],"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.000005407208,0.00023991437,0.000018307475,0.000024298171,0.00003406232,0.0000024600001,0.00040633942,0.0016454821,0.00010272439,0.9177006,0.00020756884,0.07961282],"study_design_scores_gemma":[0.0002564667,0.00007754623,0.000030533483,0.000014408855,0.0000138778405,0.000003051227,0.000016248958,0.9439304,0.0003329575,0.051545747,0.0036576176,0.00012115402],"about_ca_topic_score_codex":0.0000010995063,"about_ca_topic_score_gemma":1.5565567e-7,"teacher_disagreement_score":0.9422849,"about_ca_system_score_codex":0.000018137254,"about_ca_system_score_gemma":0.000018133775,"threshold_uncertainty_score":0.32760286},"labels":[],"label_agreement":null},{"id":"W2012511041","doi":"10.1007/s10107-005-0693-1","title":"A 2 + ɛ approximation algorithm for the k-MST problem","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Approximation algorithm; Minimum spanning tree; Combinatorics; Triangle inequality; Spanning tree; k-minimum spanning tree; Graph; Algorithm; Discrete mathematics; Tree structure; K-ary tree","score_opus":0.029306888118048803,"score_gpt":0.274109404855013,"score_spread":0.2448025167369642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012511041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002552336,0.0001236077,0.9938486,0.0036378964,0.00006949189,0.0010201372,0.0000013379419,0.0003073866,0.0009659894],"genre_scores_gemma":[0.004447914,0.000002166517,0.9944142,0.00018022684,0.00021019876,0.0005267875,0.000002030287,0.000011581999,0.00020489463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987273,0.00002649578,0.00030438922,0.0002807365,0.00028523925,0.0003757945],"domain_scores_gemma":[0.9988047,0.0005147026,0.00008284974,0.00045287373,0.000074020594,0.00007088619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074234436,0.00014036233,0.00015635978,0.000049507675,0.00037440375,0.0004100189,0.00082057394,0.000049543934,0.000017668877],"category_scores_gemma":[0.00007087921,0.00009225602,0.00013629504,0.00031661507,0.00009533142,0.00034662848,0.00019235123,0.00013686642,0.000062971325],"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":[4.4954893e-7,0.00008841885,3.7696307e-7,0.000030719108,0.0000105166355,2.9800248e-7,0.00041107007,0.000013133265,0.000003997817,0.30112207,0.00012074397,0.6981982],"study_design_scores_gemma":[0.00017767512,0.00004289212,0.0000027693022,0.00002417023,0.000010182449,0.000018870034,0.000049931296,0.74956685,0.00014825304,0.19735643,0.052488398,0.00011357011],"about_ca_topic_score_codex":0.0000016942162,"about_ca_topic_score_gemma":0.00000167404,"teacher_disagreement_score":0.74955374,"about_ca_system_score_codex":0.000029255742,"about_ca_system_score_gemma":0.000020206082,"threshold_uncertainty_score":0.39538217},"labels":[],"label_agreement":null},{"id":"W2013333510","doi":"10.1007/s10107-014-0812-y","title":"Modified orbital branching for structured symmetry with an application to unit commitment","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; University of Guelph; Group for Research in Decision Analysis","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Branching (polymer chemistry); Integer programming; Symmetry breaking; Symmetry group; Symmetry (geometry); Graph; Combinatorics; Symmetry operation; Symmetry number; Global symmetry; Mathematical optimization; Geometry; Physics; Quantum mechanics; Spontaneous symmetry breaking","score_opus":0.012381104985952433,"score_gpt":0.2528350784160875,"score_spread":0.24045397343013505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013333510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25023276,0.00000492216,0.74799633,0.000037288613,0.00003125179,0.0008981272,0.000009424255,0.00037511683,0.00041475755],"genre_scores_gemma":[0.81429815,4.125756e-8,0.18517622,0.000017120969,0.000062330524,0.00031802215,0.00008227917,0.00004088392,0.0000049716305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903005,0.000016693484,0.00024081724,0.00020806682,0.00017669036,0.00032765698],"domain_scores_gemma":[0.99936646,0.000085867236,0.000029980018,0.00029757005,0.00004902197,0.00017111724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025604488,0.00017863538,0.00021263318,0.000053563035,0.00009162254,0.00010838279,0.00015413566,0.000071565366,0.000005134806],"category_scores_gemma":[0.00006466246,0.00015357242,0.00003847434,0.00017628506,0.000023401493,0.00013173127,0.000022173886,0.00011251793,0.000022404427],"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.00019635279,0.00043121463,0.00018199703,0.0018314956,0.00016090719,0.0000021779003,0.0012833516,0.09807898,0.005695927,0.34273234,0.00011983901,0.5492854],"study_design_scores_gemma":[0.0007744454,0.00063204154,0.00020247363,0.00008843092,0.00006286465,0.000013443973,0.00018052694,0.9722167,0.0029738664,0.01991276,0.0024925724,0.0004498284],"about_ca_topic_score_codex":0.0000029655287,"about_ca_topic_score_gemma":0.000007120889,"teacher_disagreement_score":0.87413776,"about_ca_system_score_codex":0.00006315849,"about_ca_system_score_gemma":0.000004465493,"threshold_uncertainty_score":0.62625015},"labels":[],"label_agreement":null},{"id":"W2015024493","doi":"10.1007/s10107-003-0469-4","title":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Cutting-plane method; Column generation; Branch and bound; Bin packing problem; Algorithm; Interior point method; Mathematics; Bin; Mathematical optimization; Branching (polymer chemistry); Point (geometry); Dual (grammatical number); Plane (geometry); Tree (set theory); Computer science; Integer programming; Geometry; Combinatorics","score_opus":0.017040599436853755,"score_gpt":0.275635538636096,"score_spread":0.25859493919924226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015024493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009144701,0.00008410742,0.9893991,0.00008345889,0.00007808447,0.00024567582,0.0000011686598,0.00022510998,0.00073861255],"genre_scores_gemma":[0.22006103,0.000008423529,0.7798103,0.000014898788,0.000026741749,0.00002679579,0.0000049819773,0.000025818248,0.000020964748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991521,0.00003727309,0.00037634216,0.00011768831,0.0001356857,0.00018090974],"domain_scores_gemma":[0.999515,0.0001512572,0.00006898249,0.00015937393,0.00003746419,0.00006793807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007315122,0.00012369205,0.00017281252,0.00004180088,0.000092842885,0.00012026493,0.00010717859,0.000059749374,0.000010285031],"category_scores_gemma":[0.00014171483,0.000086097745,0.000034736266,0.00014553769,0.000055552864,0.00013382567,0.000028239721,0.00017237614,0.0000062239515],"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.000007816571,0.000056192956,0.0000048987476,0.00036573948,0.000052985633,0.0000029394841,0.010994081,0.0179323,0.0032682612,0.03544141,0.0000043663185,0.93186903],"study_design_scores_gemma":[0.0004836683,0.00014241022,0.000011052119,0.0004587414,0.000032376327,0.00009300052,0.0013389239,0.93087167,0.019230334,0.04673723,0.00035916344,0.00024145145],"about_ca_topic_score_codex":0.000007526978,"about_ca_topic_score_gemma":0.000007782868,"teacher_disagreement_score":0.9316276,"about_ca_system_score_codex":0.00002783488,"about_ca_system_score_gemma":0.00000847879,"threshold_uncertainty_score":0.35109642},"labels":[],"label_agreement":null},{"id":"W2015423869","doi":"10.1007/s10107-009-0299-0","title":"New geometry-inspired relaxations and algorithms for the metric Steiner tree problem","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Bipartite graph; Metric (unit); Linear programming relaxation; Combinatorics; Approximation algorithm; Upper and lower bounds; Algorithm; Relaxation (psychology); Schema (genetic algorithms); Discrete mathematics; Linear programming; Computer science; Graph","score_opus":0.03784171705136553,"score_gpt":0.2851208739396493,"score_spread":0.24727915688828378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015423869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015577662,0.00056623784,0.9919166,0.0053921314,0.00007257826,0.0008712731,0.0000011286842,0.00025759445,0.0007666732],"genre_scores_gemma":[0.028936334,0.000009833669,0.9700671,0.00018187867,0.000116957,0.000083879764,0.0000016210048,0.000010139905,0.0005922685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854124,0.000029566716,0.0003454843,0.0003586494,0.0003243565,0.00040073527],"domain_scores_gemma":[0.9982818,0.0008997692,0.00010928841,0.0004817163,0.000070757145,0.00015671586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006629268,0.00017422796,0.00023454527,0.00018641783,0.00040807965,0.0004953161,0.0006787137,0.00006548306,0.000010563514],"category_scores_gemma":[0.00033616315,0.000114931165,0.00012612084,0.0012884662,0.00006859246,0.00029274778,0.00014606716,0.00016386234,0.00001142044],"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.0000012443471,0.00006220272,0.0000048069614,0.000020804015,0.000014910532,0.000001038339,0.00025253778,0.000005023618,0.0000068962845,0.31305772,0.00026201902,0.6863108],"study_design_scores_gemma":[0.000638693,0.00039748425,0.00047459756,0.000058765192,0.00005338056,0.000043104155,0.00007837169,0.26212826,0.00010631907,0.71134305,0.024391448,0.00028654883],"about_ca_topic_score_codex":0.000008832509,"about_ca_topic_score_gemma":0.0000033417912,"teacher_disagreement_score":0.68602425,"about_ca_system_score_codex":0.000021526572,"about_ca_system_score_gemma":0.00003431307,"threshold_uncertainty_score":0.4776345},"labels":[],"label_agreement":null},{"id":"W2016019828","doi":"10.1007/s101070100278","title":"On error bounds for lower semicontinuous functions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Banach space; Subderivative; Function (biology); Upper and lower bounds; Space (punctuation); Regular polygon; Normed vector space; Metric space; Pure mathematics; Convex function; Discrete mathematics; Mathematical analysis; Applied mathematics; Convex optimization; Geometry","score_opus":0.03133459075991703,"score_gpt":0.2601535055372161,"score_spread":0.2288189147772991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016019828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031096675,0.000013066734,0.9897662,0.0020235318,0.000113687456,0.00021821783,0.0000014528293,0.0001997707,0.007353133],"genre_scores_gemma":[0.39654163,8.86072e-7,0.5901344,0.00071793515,0.000103322396,0.00019933807,0.0000075441258,0.00001740428,0.012277548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911445,0.000016811953,0.00021724285,0.00023580312,0.0002023097,0.00021338367],"domain_scores_gemma":[0.99926764,0.00024244249,0.00005958642,0.00026321367,0.00008654607,0.00008056696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017556804,0.000098131284,0.000137634,0.00008012187,0.00019386329,0.00025473032,0.00024179363,0.000045496898,0.00040200632],"category_scores_gemma":[0.00023926226,0.00008072194,0.00013288815,0.0003162779,0.000022509943,0.00016828587,0.000042364292,0.00006471978,0.0004295624],"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.0000035609166,0.00062919024,0.000007163751,0.00003124895,0.000047587648,0.0000019754273,0.0003979665,0.00056293054,0.000014019918,0.9212629,0.005222405,0.07181905],"study_design_scores_gemma":[0.00025082612,0.00012456927,0.000005229213,0.000017549872,0.000023638158,0.00000510567,0.00002254913,0.93292636,0.000013079974,0.045248564,0.021220783,0.00014173027],"about_ca_topic_score_codex":5.0709826e-7,"about_ca_topic_score_gemma":5.428962e-7,"teacher_disagreement_score":0.93236345,"about_ca_system_score_codex":0.000025929721,"about_ca_system_score_gemma":0.0000063894386,"threshold_uncertainty_score":0.5521299},"labels":[],"label_agreement":null},{"id":"W2017712277","doi":"10.1007/pl00011408","title":"On the generic properties of convex optimization problems in conic form","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conic optimization; Conic section; Convex analysis; Regular polygon; Complementarity (molecular biology); Subderivative; Convex optimization; Convex set; Mathematical optimization; Geometry","score_opus":0.11771195005632651,"score_gpt":0.29173880447882783,"score_spread":0.17402685442250132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017712277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70496285,0.00064284663,0.28064522,0.0015976678,0.00007715797,0.0023875122,0.000002371821,0.00020084693,0.009483542],"genre_scores_gemma":[0.9850742,0.000029740153,0.014103231,0.0000885087,0.000024216972,0.00022768402,0.0000014574471,0.000027267137,0.00042368998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984435,0.000052960866,0.00063071254,0.0001682899,0.00035408154,0.00035047845],"domain_scores_gemma":[0.99872607,0.0006507523,0.00020103592,0.00027291483,0.00010808395,0.00004116938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853044,0.00016647016,0.00035017324,0.00014999173,0.00007232746,0.00005868891,0.00022321583,0.00007761858,0.00020056913],"category_scores_gemma":[0.0019452267,0.000095780335,0.000076417055,0.00070577697,0.00012566795,0.00011333695,0.00006156446,0.00015989733,0.000016329594],"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.000040476418,0.0009885181,0.00011494988,0.003070668,0.00005565213,0.000005728771,0.0075380835,0.0016744677,0.00009496722,0.9766958,0.00006635569,0.009654381],"study_design_scores_gemma":[0.00077036745,0.00036645916,0.0000075122953,0.0013823461,0.00005050421,0.00003786833,0.0032129127,0.08445483,0.0018786404,0.906452,0.0010005513,0.00038599755],"about_ca_topic_score_codex":0.000010568396,"about_ca_topic_score_gemma":0.000004596318,"teacher_disagreement_score":0.28011137,"about_ca_system_score_codex":0.000043136642,"about_ca_system_score_gemma":0.000032344775,"threshold_uncertainty_score":0.3905809},"labels":[],"label_agreement":null},{"id":"W2018219772","doi":"10.1007/s10107-003-0429-z","title":"On blind source separation using mutual information criterion","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mutual information; Mathematics; Blind signal separation; Estimator; Kernel (algebra); Convergence (economics); Optimization problem; Mathematical optimization; Independent component analysis; Stiefel manifold; Applied mathematics; Quadratic equation; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.03366291385291511,"score_gpt":0.3230390717195761,"score_spread":0.289376157866661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018219772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04060963,0.0000060502766,0.953702,0.0001462034,0.00005873488,0.00042348666,2.2761384e-7,0.00050214346,0.004551575],"genre_scores_gemma":[0.55644846,4.1889479e-7,0.44302273,0.00040156776,0.000013677695,0.000034874098,0.0000035732035,0.000009141876,0.00006557478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998572,0.00014569238,0.00041316796,0.00020054952,0.0004034092,0.00026516986],"domain_scores_gemma":[0.99914944,0.00014467741,0.00014711206,0.00037466025,0.00009505822,0.00008904503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084490277,0.00015742973,0.00015954554,0.00018472961,0.00017251722,0.0006522702,0.00026275447,0.00010647741,0.000029091298],"category_scores_gemma":[0.00041383933,0.0001435811,0.000066430344,0.0003688415,0.000037914164,0.0014916157,0.00005881022,0.00017902933,0.00023667316],"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.000007993552,0.0001302436,0.000006467142,0.000043753105,0.000007100512,0.0000012315321,0.0032823288,0.00035474845,0.0002895107,0.9501456,0.00011929045,0.045611728],"study_design_scores_gemma":[0.00097300153,0.0004604593,0.0000098070495,0.00017536536,0.000019854391,0.000110913104,0.00031233035,0.7188679,0.018126538,0.21277954,0.047504585,0.0006597171],"about_ca_topic_score_codex":0.000001557353,"about_ca_topic_score_gemma":3.3244757e-7,"teacher_disagreement_score":0.7373661,"about_ca_system_score_codex":0.000064657645,"about_ca_system_score_gemma":0.000045804074,"threshold_uncertainty_score":0.62898564},"labels":[],"label_agreement":null},{"id":"W2021818992","doi":"10.1007/s10107-006-0727-3","title":"A matrix generation approach for eigenvalue optimization","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Interior point method; Eigenvalues and eigenvectors; Column generation; Matrix (chemical analysis); Mathematical optimization; Optimization problem; Algorithm","score_opus":0.023260950768894534,"score_gpt":0.2661355048063854,"score_spread":0.2428745540374909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021818992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023458773,0.000060465387,0.9967966,0.00011249076,0.0000649474,0.0006786776,0.0000010954884,0.00027393783,0.0017771918],"genre_scores_gemma":[0.03147374,4.5355014e-7,0.9674047,0.00002296857,0.00028721636,0.00022886197,0.000030979892,0.000013903691,0.0005371607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888504,0.000044991142,0.0002958575,0.00029944832,0.00019271426,0.00028197278],"domain_scores_gemma":[0.9994346,0.000080835234,0.00008190777,0.0002885457,0.000062833264,0.00005130888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060004555,0.00012761187,0.00015600046,0.000059960486,0.00019046417,0.00032250895,0.00032622454,0.000068677524,0.000014815581],"category_scores_gemma":[0.00005918159,0.00010920991,0.000090094145,0.00022828658,0.000030417805,0.0002829879,0.000067229834,0.000058725094,0.000015108727],"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.0000022878053,0.00021011439,0.000001962393,0.000115727176,0.0000063628104,0.0000010427153,0.000093549024,0.042970825,0.00017030923,0.9279476,0.00014941268,0.028330816],"study_design_scores_gemma":[0.0002053888,0.00003858925,4.431369e-7,0.0000064720803,0.000009649514,0.000013243304,0.000012182403,0.934349,0.0008085338,0.06360898,0.00081125327,0.00013627506],"about_ca_topic_score_codex":0.0000019308097,"about_ca_topic_score_gemma":1.2411792e-7,"teacher_disagreement_score":0.89137816,"about_ca_system_score_codex":0.0000247339,"about_ca_system_score_gemma":0.000017174372,"threshold_uncertainty_score":0.44534507},"labels":[],"label_agreement":null},{"id":"W2028549267","doi":"10.1007/s10107-010-0380-8","title":"LP-based approximation algorithms for capacitated facility location","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Facility location problem; Linear programming relaxation; Rounding; Approximation algorithm; 1-center problem; Set (abstract data type); Theory of computation; Mathematics; Linear programming; Relaxation (psychology); Metric space; Mathematical optimization; Metric (unit); Constant (computer programming); Computer science; Algorithm; Discrete mathematics","score_opus":0.0454707412042015,"score_gpt":0.270299497597183,"score_spread":0.22482875639298153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028549267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057929467,0.0000058470446,0.9350706,0.0018075157,0.00044032675,0.0018623234,0.0000054598777,0.0005123716,0.0023661337],"genre_scores_gemma":[0.93410254,1.300755e-7,0.06402015,0.0004446952,0.00025100194,0.0006794226,0.00028155735,0.000019977157,0.00020055969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985928,0.000007785436,0.00044547775,0.00032597923,0.00029655817,0.0003314116],"domain_scores_gemma":[0.99911857,0.000052171126,0.00009283787,0.00033571033,0.0003753292,0.00002535573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009913419,0.00018471971,0.0001871603,0.0001501988,0.00023756058,0.00028116046,0.0002013842,0.00009183296,0.00037877518],"category_scores_gemma":[0.0008582314,0.00016912889,0.00009837198,0.00045323395,0.0000913563,0.0005223898,0.000042707805,0.00015056884,0.0006326085],"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.000084747815,0.0016496569,0.00063479645,0.007967938,0.00007256751,0.0000013423065,0.00031379604,0.0016216207,0.0020605484,0.40376285,0.0022743575,0.57955575],"study_design_scores_gemma":[0.0006902567,0.000017656426,0.00032045125,0.000034841745,0.0000678558,3.9595548e-7,0.00028680073,0.89383346,0.00030660574,0.030663215,0.07342723,0.00035123143],"about_ca_topic_score_codex":0.000090993075,"about_ca_topic_score_gemma":0.00010249107,"teacher_disagreement_score":0.89221185,"about_ca_system_score_codex":0.000024733978,"about_ca_system_score_gemma":0.000017795895,"threshold_uncertainty_score":0.8131113},"labels":[],"label_agreement":null},{"id":"W2035164723","doi":"10.1007/s10107-008-0256-3","title":"Generating and measuring instances of hard semidefinite programs","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Massachusetts Institute of Technology","keywords":"Mathematics; Semidefinite programming; Numerical analysis; Mathematical optimization; Combinatorics; Mathematical analysis","score_opus":0.17104321623886967,"score_gpt":0.33928467736829426,"score_spread":0.1682414611294246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035164723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42503634,0.0004006701,0.5715135,0.00008446032,0.000033563,0.0009838829,0.0000019737197,0.00031282843,0.0016328192],"genre_scores_gemma":[0.15725356,0.000040046052,0.8422312,0.000009497463,0.000039486542,0.00009926873,0.0000024599015,0.000043011318,0.00028142313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979433,0.0000754304,0.00063636794,0.00030133387,0.0006179431,0.00042562155],"domain_scores_gemma":[0.9986544,0.00048461472,0.00020573658,0.0002897401,0.00021315356,0.00015234294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065829075,0.00020080284,0.00043594162,0.00011077011,0.00023677603,0.000051143554,0.00016964825,0.00008629602,0.00003527274],"category_scores_gemma":[0.0016351425,0.00017234703,0.0000755609,0.00036830996,0.0003607016,0.0002129173,0.0001371743,0.00022823786,0.000008152487],"study_design_candidate":"design_other","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.000073920906,0.001837992,0.00816643,0.005783739,0.0002924916,0.000150432,0.01244816,0.00066295476,0.0041435356,0.18467666,0.00009634512,0.78166735],"study_design_scores_gemma":[0.004746006,0.0010682797,0.00034639981,0.0032693015,0.00021667892,0.0012586582,0.0051249876,0.40816787,0.01964407,0.54998875,0.0036694275,0.00249955],"about_ca_topic_score_codex":0.0000022081138,"about_ca_topic_score_gemma":0.0000025525896,"teacher_disagreement_score":0.7791678,"about_ca_system_score_codex":0.000034650428,"about_ca_system_score_gemma":0.00003954116,"threshold_uncertainty_score":0.70281076},"labels":[],"label_agreement":null},{"id":"W2039031224","doi":"10.1007/s101070100285","title":"On the chromatic polynomial of a graph","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Lambda; Mathematics; Box office; Box model; Graph; S-box; Discrete mathematics; Physics; Algorithm; Quantum mechanics","score_opus":0.06769425539251454,"score_gpt":0.2964750073835816,"score_spread":0.22878075199106707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039031224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7694459,0.00022955205,0.15359817,0.002908875,0.0007583955,0.005243594,0.000011125504,0.001179056,0.06662533],"genre_scores_gemma":[0.9182611,0.0000025324618,0.08086548,0.00006969175,0.00008961607,0.00018713722,4.6253157e-7,0.00007855089,0.00044543965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975119,0.00012418836,0.00088227965,0.0002724969,0.00070872204,0.0005003932],"domain_scores_gemma":[0.9938199,0.0046316646,0.00040497936,0.00093980104,0.00008501056,0.00011867422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071480573,0.0003221197,0.0006094447,0.00011118551,0.00017482977,0.000071577735,0.00057804305,0.00012366277,0.00090714614],"category_scores_gemma":[0.0046764426,0.00020382901,0.00027166665,0.00047576532,0.00029881063,0.000092197195,0.00012755164,0.00033470613,0.0002629839],"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.000008591832,0.0008815924,0.0000025316365,0.0005264129,0.00006154616,0.0000061768214,0.0012850735,0.00000203544,0.00017256058,0.9903331,0.002429734,0.004290644],"study_design_scores_gemma":[0.00041994508,0.00022684454,9.729845e-7,0.0003662802,0.00007370049,0.000022072505,0.000303507,0.002577551,0.0013501035,0.99400014,0.00042987792,0.00022898236],"about_ca_topic_score_codex":8.5330095e-7,"about_ca_topic_score_gemma":3.7030304e-7,"teacher_disagreement_score":0.14881518,"about_ca_system_score_codex":0.000053380798,"about_ca_system_score_gemma":0.000009837966,"threshold_uncertainty_score":0.9932614},"labels":[],"label_agreement":null},{"id":"W2041718604","doi":"10.1007/s10107-013-0667-7","title":"Enhanced Karush–Kuhn–Tucker condition and weaker constraint qualifications","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Subderivative; Mathematics; Lipschitz continuity; Karush–Kuhn–Tucker conditions; Constraint (computer-aided design); Bellman equation; Normality; Function (biology); Initial value problem; Value (mathematics); Applied mathematics; Mathematical economics; Mathematical optimization; Mathematical analysis; Convex optimization; Regular polygon","score_opus":0.01623019121794233,"score_gpt":0.2659731881360277,"score_spread":0.24974299691808538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041718604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027740977,0.000014396979,0.98772025,0.003395696,0.000026089936,0.00029138077,0.0000010548059,0.000159017,0.0056180144],"genre_scores_gemma":[0.687752,0.0000025752727,0.3116451,0.00022306947,0.000018595792,0.000077095894,0.000010083292,0.0000051560155,0.00026633148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900866,0.000047950412,0.000300354,0.00024849077,0.00021070015,0.00018384367],"domain_scores_gemma":[0.99923986,0.00017286051,0.00009098763,0.0002337009,0.00014020658,0.00012240572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021483388,0.00010316193,0.00014718514,0.000073616306,0.00015252703,0.000392761,0.00017553783,0.000050411665,0.00064456963],"category_scores_gemma":[0.00011899812,0.00008591607,0.00005030337,0.00028001235,0.000090360336,0.00042841095,0.00006996854,0.000074983414,0.00047034805],"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":[3.178773e-7,0.00011294484,0.000019031395,0.000026008824,0.000028306265,4.1224766e-7,0.0006212454,0.000036987298,0.000515412,0.9337335,0.0001651011,0.06474071],"study_design_scores_gemma":[0.0005413409,0.00006027566,0.0012017151,0.00006425445,0.000054358276,0.000026741092,0.00060424936,0.68631756,0.0011818012,0.30670387,0.0027588536,0.0004850126],"about_ca_topic_score_codex":0.0000068706763,"about_ca_topic_score_gemma":8.0999445e-7,"teacher_disagreement_score":0.68628055,"about_ca_system_score_codex":0.000017446124,"about_ca_system_score_gemma":0.00001992428,"threshold_uncertainty_score":0.7057586},"labels":[],"label_agreement":null},{"id":"W2042860556","doi":"10.1007/s10107-008-0261-6","title":"Primal-dual first-order methods with $${\\mathcal {O}(1/\\epsilon)}$$ iteration-complexity for cone programming","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":154,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Semidefinite programming; Second-order cone programming; Linear programming; Cone (formal languages); Convex optimization; Rank (graph theory); Regular polygon; Combinatorics; Mathematical optimization; Discrete mathematics; Algorithm","score_opus":0.04902607468451811,"score_gpt":0.32625349412192656,"score_spread":0.2772274194374085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042860556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007425161,0.0001368883,0.9869074,0.00045850044,0.000063760905,0.0015349025,0.0000029944842,0.002135189,0.0013352085],"genre_scores_gemma":[0.24279268,0.0000021046858,0.7567074,0.00007276021,0.000090702684,0.00022021822,0.000019553481,0.00005649612,0.000038139835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998141,0.00004426859,0.00050516275,0.0003724582,0.00027481536,0.00066231104],"domain_scores_gemma":[0.99887204,0.00029322144,0.00008260718,0.00040123798,0.00018966757,0.00016119656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046124883,0.00038309878,0.00052029965,0.000103156155,0.00023923385,0.00030622547,0.00019209002,0.0001591525,0.00003514462],"category_scores_gemma":[0.00016743591,0.0003154413,0.00012777548,0.0003192088,0.00014436788,0.00021830341,0.000034592704,0.00027089287,0.000012476687],"study_design_candidate":"design_other","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.00013232432,0.0007299432,0.00005259525,0.0007333074,0.00025208128,0.000048393344,0.00204908,0.0011703906,0.00397425,0.11007293,0.00097390375,0.8798108],"study_design_scores_gemma":[0.0021863414,0.001923883,0.00023688139,0.0012409276,0.00036089573,0.00037632458,0.00034771435,0.7199315,0.037698217,0.13514829,0.098394535,0.0021545375],"about_ca_topic_score_codex":0.000002780578,"about_ca_topic_score_gemma":0.0000051178918,"teacher_disagreement_score":0.8776563,"about_ca_system_score_codex":0.00006532593,"about_ca_system_score_gemma":0.000019591986,"threshold_uncertainty_score":0.9999298},"labels":[],"label_agreement":null},{"id":"W2043340090","doi":"10.1007/s10107-006-0011-6","title":"On the domino-parity inequalities for the STSP","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Southern Taiwan Science Park","keywords":"Domino; Travelling salesman problem; Separation (statistics); Polytope; Parity (physics); Mathematics; Mathematical optimization; Inequality; Class (philosophy); Algorithm; Computer science; Artificial intelligence; Combinatorics; Statistics","score_opus":0.036752343997007414,"score_gpt":0.28565320145190704,"score_spread":0.24890085745489962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043340090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01775366,0.00008788382,0.9759695,0.0008620484,0.0001053957,0.0007787341,0.000003257288,0.00041937293,0.0040201796],"genre_scores_gemma":[0.7746847,0.000001580317,0.22407833,0.000112483125,0.00019365276,0.00045132235,0.0000038838434,0.000054495296,0.0004195421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907285,0.00006521193,0.0002903524,0.00010656741,0.0001805946,0.0002844034],"domain_scores_gemma":[0.9957164,0.0038948827,0.0000341684,0.0002944078,0.00003460867,0.000025545032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012508259,0.00013450278,0.00015224527,0.00002237882,0.00022528393,0.00015004005,0.00021624961,0.00005714106,0.00005666761],"category_scores_gemma":[0.00061846443,0.00007268621,0.00008982872,0.00013093122,0.00007975244,0.000038458213,0.000028467766,0.00016906386,0.000026569387],"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.000006956674,0.00006287962,0.00003885059,0.0002281005,0.000036072783,5.444948e-7,0.0004949025,0.0397324,0.00006163512,0.93399477,0.0015873875,0.023755489],"study_design_scores_gemma":[0.0002534964,0.000030410412,0.000045149267,0.000057722147,0.000039953426,0.0000036780639,0.0003533108,0.82814133,0.0012694969,0.16136754,0.008248812,0.00018911103],"about_ca_topic_score_codex":0.0000070983215,"about_ca_topic_score_gemma":0.0000033002586,"teacher_disagreement_score":0.78840894,"about_ca_system_score_codex":0.00003231467,"about_ca_system_score_gemma":0.0000054294137,"threshold_uncertainty_score":0.29640576},"labels":[],"label_agreement":null},{"id":"W2044062771","doi":"10.1007/pl00011419","title":"On the solitaire cone and its relationship to multi-commodity flows","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Cone (formal languages); Adjacency list; Combinatorics; Metric (unit); Path (computing); Tournament; Geometry; Discrete mathematics; Algorithm; Computer science","score_opus":0.11810909380461537,"score_gpt":0.3457789007429921,"score_spread":0.22766980693837674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044062771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74103296,0.00006080899,0.24006632,0.009070925,0.00006810623,0.0023075005,0.000011754474,0.0003256843,0.0070559476],"genre_scores_gemma":[0.9065264,0.0000029615753,0.09157045,0.00042003667,0.000053663218,0.00025064658,0.000002452977,0.00005262343,0.0011207827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979351,0.00012291179,0.0006289054,0.00035191598,0.0004457361,0.00051540794],"domain_scores_gemma":[0.99434096,0.004585194,0.00012351824,0.00053392194,0.00011873844,0.00029767762],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0015292467,0.00029385384,0.00043996118,0.000076115146,0.00038769178,0.00017939445,0.00029710177,0.00014525326,0.00029328413],"category_scores_gemma":[0.010922395,0.00018556618,0.00012071671,0.0002884092,0.00008133171,0.00009468044,0.00017819578,0.0003977884,0.0004623791],"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.000013840978,0.00042715695,0.00005353732,0.00022018353,0.000025550584,0.000012346731,0.0007374766,0.0000031034044,0.000029327699,0.9939124,0.00035279317,0.004212288],"study_design_scores_gemma":[0.00031099372,0.00010260913,0.00011041827,0.00030731907,0.00004671542,0.00004433893,0.00029302618,0.084397286,0.000028614175,0.9130408,0.0010383634,0.0002794744],"about_ca_topic_score_codex":0.0000016476336,"about_ca_topic_score_gemma":0.000010082876,"teacher_disagreement_score":0.16549343,"about_ca_system_score_codex":0.00004658115,"about_ca_system_score_gemma":0.000014222998,"threshold_uncertainty_score":0.99740905},"labels":[],"label_agreement":null},{"id":"W2051890519","doi":"10.1007/s10107-003-0502-7","title":"An optimal adaptive algorithm for the approximation of concave functions","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Concave function; Knot (papermaking); Bellman equation; Mathematical optimization; Oracle; Parametric statistics; Convex function; Regular polygon; Piecewise; Algorithm; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.07302452284193485,"score_gpt":0.3786374860033176,"score_spread":0.30561296316138276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051890519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025729975,0.00005604362,0.99682623,0.0002689722,0.000034112385,0.0018907964,0.000022432481,0.0001544667,0.0004896656],"genre_scores_gemma":[0.020296872,0.000003101726,0.9782328,0.000020306627,0.00018543609,0.00070833566,0.000017043407,0.00005189994,0.00048422738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982332,0.000074025564,0.0005683564,0.00026677013,0.00046714168,0.00039048528],"domain_scores_gemma":[0.99687636,0.0019073626,0.00021849283,0.00045168705,0.0004277891,0.0001182922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009208569,0.00018505643,0.0003068549,0.0000875451,0.00027094677,0.00006983965,0.0003029927,0.000100041616,0.00021126558],"category_scores_gemma":[0.0007783672,0.00013068855,0.00013814478,0.00029295596,0.00025006218,0.00033083494,0.000059937363,0.00020206178,0.00002536164],"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.000034489163,0.0006272133,7.892182e-7,0.00009480741,0.00008222922,4.506678e-7,0.0011441149,0.0049832254,0.000050264545,0.0749463,0.0001481792,0.9178879],"study_design_scores_gemma":[0.0005509365,0.00025071393,0.0000011695663,0.000033271062,0.00007333779,0.000009850369,0.002328221,0.9618963,0.001234339,0.031636,0.0018361909,0.00014969106],"about_ca_topic_score_codex":9.807777e-7,"about_ca_topic_score_gemma":0.0000015627035,"teacher_disagreement_score":0.95691305,"about_ca_system_score_codex":0.00008047918,"about_ca_system_score_gemma":0.0000479922,"threshold_uncertainty_score":0.53293246},"labels":[],"label_agreement":null},{"id":"W2053944393","doi":"10.1007/s101070050007","title":"A branch-and-cut algorithm for the Undirected Rural Postman Problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Binary number; Undirected graph; Combinatorics; Mathematical optimization; Graph; Arithmetic","score_opus":0.012956686533581226,"score_gpt":0.26001142746504663,"score_spread":0.2470547409314654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053944393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006513885,0.00024900783,0.98925817,0.00027381422,0.000044405333,0.0010046513,0.0000038076835,0.0008523359,0.0017999283],"genre_scores_gemma":[0.04152529,0.00001975715,0.95740265,0.000045006756,0.00009669993,0.0002843125,0.0000064296764,0.00006891181,0.000550929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908185,0.00003452073,0.00027401934,0.00012948998,0.00013487268,0.00034525653],"domain_scores_gemma":[0.99920225,0.0004864395,0.000022071707,0.00017984863,0.000032162552,0.000077218254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046550288,0.00015645195,0.0001917784,0.000030056222,0.00016340794,0.00013486006,0.00013252112,0.00007420282,0.00015961693],"category_scores_gemma":[0.000070194495,0.000113131515,0.00006649002,0.00019147119,0.00006639097,0.000077562756,0.000018812338,0.00014270542,0.000032699245],"study_design_candidate":"design_other","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.0000025393051,0.000021861231,0.0000068500512,0.00012538487,0.000040526884,5.069689e-7,0.00048440255,0.0022159389,0.000049348793,0.0009985202,0.000049475828,0.99600464],"study_design_scores_gemma":[0.00033249895,0.00003434038,0.000033965734,0.000069649745,0.00005337523,0.000031156116,0.00008045428,0.98650223,0.0002473292,0.006034335,0.006394921,0.00018577173],"about_ca_topic_score_codex":0.0000026477283,"about_ca_topic_score_gemma":9.337284e-7,"teacher_disagreement_score":0.99581885,"about_ca_system_score_codex":0.000024223556,"about_ca_system_score_gemma":0.0000060539323,"threshold_uncertainty_score":0.46133694},"labels":[],"label_agreement":null},{"id":"W2054434508","doi":"10.1007/pl00011422","title":"On sensitivity of central solutions in semidefinite programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Semidefinite programming; Lipschitz continuity; Bounded function; Mathematical optimization; Solution set; Complementarity (molecular biology); Applied mathematics; Feasible region; Mathematical analysis; Set (abstract data type); Computer science","score_opus":0.08218327838542877,"score_gpt":0.3601488526812827,"score_spread":0.27796557429585395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054434508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0468877,0.00003171043,0.94766897,0.00042227906,0.000048875605,0.0013081824,0.0000052937094,0.0002607115,0.0033662932],"genre_scores_gemma":[0.50013834,0.000009277762,0.4993915,0.000020517986,0.00003380138,0.000102725564,0.0000067537617,0.000051088056,0.00024597472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971247,0.00024380485,0.00070918567,0.00034314688,0.00062868575,0.0009505296],"domain_scores_gemma":[0.9968064,0.002283547,0.00017044411,0.00041662308,0.00014053212,0.00018244814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015989139,0.00023187086,0.00046965465,0.0002657021,0.00011785917,0.000050393217,0.00015457594,0.00013046473,0.00013174061],"category_scores_gemma":[0.0048774867,0.00021388406,0.00013244429,0.00087764655,0.00020689785,0.00016170442,0.00013201946,0.0004129525,0.00004078081],"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.00010476488,0.0033738608,0.00086574146,0.00074039825,0.000058371275,0.00024734339,0.0016088384,0.0033342412,0.00026792858,0.6974428,0.00007656611,0.2918791],"study_design_scores_gemma":[0.0018987381,0.00035689515,0.00026729313,0.0011412968,0.0000536391,0.00017669253,0.0012108813,0.2878115,0.00076424214,0.7033828,0.002178536,0.0007574852],"about_ca_topic_score_codex":0.000015528161,"about_ca_topic_score_gemma":0.00004564274,"teacher_disagreement_score":0.45325065,"about_ca_system_score_codex":0.00015536227,"about_ca_system_score_gemma":0.000050323655,"threshold_uncertainty_score":0.8721939},"labels":[],"label_agreement":null},{"id":"W2054543516","doi":"10.1007/pl00011420","title":"Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Linear programming; Corollary; Condition number; Time complexity; Bounded function; Probabilistic logic; Matrix (chemical analysis); Combinatorics; Probabilistic analysis of algorithms; Discrete mathematics; Algorithm; Eigenvalues and eigenvectors; Statistics","score_opus":0.14892183901273565,"score_gpt":0.40443041444319067,"score_spread":0.255508575430455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054543516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020902438,0.000069874055,0.97560006,0.0001834641,0.000019988818,0.0028529044,0.000025241865,0.00021935391,0.00012667481],"genre_scores_gemma":[0.09436417,0.000018609353,0.9043634,0.000013975018,0.00005310006,0.00078603136,0.00008756525,0.00006662441,0.00024650912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729276,0.000110664725,0.00095949613,0.0004666869,0.00059359707,0.00057682575],"domain_scores_gemma":[0.99734163,0.0010346152,0.0003653343,0.00044975991,0.0006076769,0.00020095694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012763797,0.00027858032,0.0008194586,0.00039786473,0.0002713669,0.00014503338,0.00024537247,0.00010066527,0.00007663849],"category_scores_gemma":[0.0032450317,0.0002441874,0.0002094837,0.001538046,0.0004623492,0.00021215822,0.00012783131,0.00018493831,0.0000029728267],"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.00018366044,0.0041383924,0.0035492599,0.007153422,0.002933061,0.000012909214,0.0047561927,0.0057257153,0.0010086431,0.67407966,0.000026247257,0.29643285],"study_design_scores_gemma":[0.001179525,0.00022979602,0.00014072802,0.00022995773,0.0012586836,0.00002211064,0.00032077738,0.7335758,0.000114398,0.25941038,0.0030530617,0.00046477708],"about_ca_topic_score_codex":0.000007652777,"about_ca_topic_score_gemma":0.000033594286,"teacher_disagreement_score":0.7278501,"about_ca_system_score_codex":0.000067673565,"about_ca_system_score_gemma":0.000050336785,"threshold_uncertainty_score":0.99576735},"labels":[],"label_agreement":null},{"id":"W2055791260","doi":"10.1007/s10107-003-0480-9","title":"A model of the coNP-complete non-Hamilton tour decision problem for directed graphs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Mathematics; Convex hull; Bijection; Permutation matrix; Polytope; Vertex (graph theory); Extreme point; Hamiltonian path; Discrete mathematics; Regular polygon; Graph; Geometry","score_opus":0.02167359950482958,"score_gpt":0.23023526394464486,"score_spread":0.20856166443981528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055791260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4179571,0.000061016304,0.5786506,0.000018412678,0.00010974268,0.0015092625,0.00001080898,0.00033177392,0.0013512921],"genre_scores_gemma":[0.89637697,0.000001202835,0.10327383,0.000008476518,0.000014479802,0.00025173867,0.0000020365487,0.000037618465,0.00003365613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988549,0.0000150913065,0.00044773915,0.00015839541,0.0002099817,0.00031393277],"domain_scores_gemma":[0.99933326,0.00015976791,0.0000656225,0.00031674159,0.000058497142,0.000066113535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003526057,0.00017661638,0.00030910363,0.0000569705,0.000098859295,0.000035133547,0.00026429998,0.00009060717,0.0000050069716],"category_scores_gemma":[0.00006243298,0.000119614946,0.00023055842,0.00025802184,0.000076385535,0.00006437586,0.0000295798,0.00012093364,0.000006603076],"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.00010223802,0.00055671757,0.00006676645,0.005313361,0.0002874964,0.0000030143942,0.00833018,0.14441347,0.07175151,0.7260542,0.0001859145,0.04293512],"study_design_scores_gemma":[0.00076881977,0.00005927576,0.000014519001,0.00066979515,0.000047265887,0.000008663118,0.00012989457,0.30077302,0.0060298503,0.6909345,0.00035877808,0.00020560171],"about_ca_topic_score_codex":0.0000019924264,"about_ca_topic_score_gemma":0.000005637376,"teacher_disagreement_score":0.47841984,"about_ca_system_score_codex":0.000028874143,"about_ca_system_score_gemma":0.000011959172,"threshold_uncertainty_score":0.4877756},"labels":[],"label_agreement":null},{"id":"W2056369327","doi":"10.1007/s10107-006-0044-x","title":"How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":false,"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; Canada Research Chairs","keywords":"Mathematics; Path (computing); Cube (algebra); Combinatorics; Upper and lower bounds; Point (geometry); Geometry; Mathematical analysis; Computer science","score_opus":0.08630873635903116,"score_gpt":0.3953461224436111,"score_spread":0.30903738608458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056369327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023182041,0.0000897724,0.9897692,0.0022713135,0.00009871829,0.00112097,0.000012396811,0.00054922793,0.0037701735],"genre_scores_gemma":[0.02572074,0.0000024144365,0.9682342,0.00004960931,0.00020438267,0.00030938908,0.000032597625,0.00010704335,0.00533966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661356,0.00033713836,0.0008484259,0.00060816226,0.0007646263,0.00082807324],"domain_scores_gemma":[0.9971581,0.0011026459,0.00036707782,0.0007411279,0.00040185015,0.00022920505],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013185616,0.00043692402,0.00073724467,0.0002199452,0.00038783942,0.0010543495,0.0004706874,0.00019399927,0.00047905734],"category_scores_gemma":[0.0024588436,0.00036516748,0.0002531912,0.0005429179,0.00040368998,0.0006074906,0.00030449842,0.00048651826,0.000091360715],"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.000046513658,0.0014044604,0.00018933411,0.0016775869,0.00016153857,0.00007625697,0.0013361705,0.00006551554,0.0010573509,0.89050734,0.0016410167,0.10183693],"study_design_scores_gemma":[0.00066469633,0.00010833012,0.000047958576,0.00026252613,0.00006331895,0.00007748628,0.0009055079,0.084789656,0.0035228822,0.8990337,0.009951236,0.0005726498],"about_ca_topic_score_codex":0.000008716275,"about_ca_topic_score_gemma":0.000022861179,"teacher_disagreement_score":0.101264276,"about_ca_system_score_codex":0.0002222025,"about_ca_system_score_gemma":0.000043917775,"threshold_uncertainty_score":0.99998266},"labels":[],"label_agreement":null},{"id":"W2057459863","doi":"10.1007/s10107-008-0254-5","title":"Multi-phase dynamic constraint aggregation for set partitioning type problems","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Constraint (computer-aided design); Disjoint sets; Computation; Relaxation (psychology); Set (abstract data type); Computer science; Mathematics; Local consistency; Scheduling (production processes); Algorithm; Constraint satisfaction problem; Probabilistic logic","score_opus":0.06582903588106113,"score_gpt":0.33703000503881686,"score_spread":0.2712009691577557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057459863","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045297958,0.00007061542,0.95286167,0.000037008987,0.000095228985,0.0007540706,0.000005852877,0.00072213233,0.00015547534],"genre_scores_gemma":[0.37876996,0.0000052268006,0.6209518,0.000008289862,0.000020569878,0.00012486102,0.00003006415,0.00003748826,0.0000517847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895835,0.000032537275,0.0003800118,0.00017206685,0.00013305419,0.00032399967],"domain_scores_gemma":[0.9994086,0.00018726179,0.000056029243,0.00015993034,0.000094552954,0.00009360432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041980523,0.00015270856,0.00020676185,0.00006139293,0.00017175377,0.000051535735,0.000083741565,0.00009123457,0.000046835496],"category_scores_gemma":[0.00045881397,0.00015386018,0.00006494767,0.00021537379,0.00008929833,0.000113486545,0.000016100044,0.00012744099,0.00003889615],"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.00005043673,0.0011839994,0.00042481563,0.004568772,0.00033370688,0.000044682827,0.012117631,0.45203245,0.0147908665,0.011270195,0.00032120006,0.50286126],"study_design_scores_gemma":[0.00082811364,0.00006719124,0.000010417302,0.00012135972,0.000021714442,0.00005211833,0.000101330894,0.9958166,0.00070636754,0.0013711477,0.00071296305,0.00019069988],"about_ca_topic_score_codex":5.5572355e-7,"about_ca_topic_score_gemma":9.783391e-7,"teacher_disagreement_score":0.54378414,"about_ca_system_score_codex":0.000067107394,"about_ca_system_score_gemma":0.000018496698,"threshold_uncertainty_score":0.62742364},"labels":[],"label_agreement":null},{"id":"W2058753381","doi":"10.1007/s10107-004-0542-7","title":"Capacitated transit assignment with loading priorities","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Queue; Position (finance); Transit (satellite); Variational inequality; Mathematical optimization; Set (abstract data type); Node (physics); Residual; Order (exchange); Preference; Computer science; Mathematics; Operations research; Public transport; Transport engineering; Computer network; Algorithm; Engineering","score_opus":0.023764123007246705,"score_gpt":0.27599749463286477,"score_spread":0.25223337162561804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058753381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13113981,0.000039945196,0.8476987,0.0015667462,0.00005773572,0.00055076054,0.0000019166216,0.00051793753,0.018426469],"genre_scores_gemma":[0.9190246,0.0000029507898,0.08061386,0.00003308563,0.000031800977,0.000028464898,0.0000056267354,0.000011017879,0.00024862593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99906474,0.000029345481,0.0001655091,0.00013039469,0.00034888144,0.00026111043],"domain_scores_gemma":[0.9996796,0.000060941486,0.00004307203,0.00006408674,0.00005100099,0.00010126749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030522916,0.0000833215,0.000115038216,0.0000404868,0.00035710953,0.00011937222,0.000072622,0.000054570355,0.00006897651],"category_scores_gemma":[0.00004784365,0.00006888019,0.000029939418,0.00020744321,0.00017942683,0.00016643995,0.0000016882939,0.000086652435,0.000025338724],"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.00005107402,0.0003731674,0.001700899,0.0002476663,0.000080120895,0.000069073016,0.2205346,0.012109036,0.00012949726,0.7353474,0.00002270605,0.029334806],"study_design_scores_gemma":[0.016576331,0.00267208,0.005809264,0.0075195967,0.001219492,0.00010092089,0.4232255,0.0045357654,0.007615819,0.42074385,0.10409072,0.005890668],"about_ca_topic_score_codex":0.00012591359,"about_ca_topic_score_gemma":0.0001664136,"teacher_disagreement_score":0.7878848,"about_ca_system_score_codex":0.00007284784,"about_ca_system_score_gemma":0.000076901786,"threshold_uncertainty_score":0.28088528},"labels":[],"label_agreement":null},{"id":"W2061237693","doi":"10.1007/s10107-005-0649-5","title":"Independent packings in structured graphs","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Pathwidth; Mathematics; Cograph; Clique-sum; Split graph; 1-planar graph; Maximal independent set; Modular decomposition; Disjoint sets; Discrete mathematics; Interval graph; Treewidth; Partial k-tree; Graph; Line graph","score_opus":0.02153618353391824,"score_gpt":0.30257266948494643,"score_spread":0.2810364859510282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061237693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12103454,0.00014201833,0.87399423,0.000980369,0.000058919744,0.0006693223,4.633225e-7,0.00038548108,0.002734678],"genre_scores_gemma":[0.69807446,0.0000015954154,0.3017081,0.00006405286,0.000019279165,0.00004766318,4.5863374e-7,0.0000115329385,0.000072843264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980272,0.00008056299,0.0003456389,0.00039936212,0.00053504494,0.00061219616],"domain_scores_gemma":[0.9989996,0.00019635796,0.00006040961,0.0005454216,0.00004469312,0.00015349836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007594596,0.00016059355,0.00021905424,0.00026563957,0.00008007073,0.00020152381,0.00092852063,0.000079991136,0.000053940053],"category_scores_gemma":[0.00021459904,0.00013620938,0.00008302814,0.00077523506,0.000104540755,0.0005227067,0.00034970624,0.00036359596,0.00012152096],"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.000004619879,0.0000963061,0.00024908723,0.000029952698,0.0000052631276,0.000020579833,0.00071461784,0.000034547837,0.00025884286,0.6618151,0.0000071346126,0.33676392],"study_design_scores_gemma":[0.00041798697,0.00006516153,0.00041728793,0.0000573342,0.0000021750775,0.00004179875,0.00009599166,0.017917562,0.0021147595,0.97644895,0.0021853421,0.00023565971],"about_ca_topic_score_codex":0.0000022230222,"about_ca_topic_score_gemma":0.000016293376,"teacher_disagreement_score":0.5770399,"about_ca_system_score_codex":0.00007076866,"about_ca_system_score_gemma":0.000023343573,"threshold_uncertainty_score":0.55544573},"labels":[],"label_agreement":null},{"id":"W2061835534","doi":"10.1007/s10107-014-0781-1","title":"Efficient cost-sharing mechanisms for prize-collecting problems","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Steiner tree problem; Social cost; Embedding; Mathematical optimization; Mathematics; Set (abstract data type); Graph; Dual (grammatical number); Focus (optics); Service (business); Computer science; Mathematical economics; Combinatorics; Artificial intelligence","score_opus":0.13746696961545746,"score_gpt":0.3909602722344847,"score_spread":0.25349330261902725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061835534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00796864,0.00000600949,0.9837815,0.00049013615,0.00010846678,0.0012554448,0.0000018218927,0.00019605209,0.006191885],"genre_scores_gemma":[0.7479564,8.0002366e-8,0.24657178,0.000090231195,0.00010481407,0.0013644012,0.0000018536465,0.000027301843,0.0038831476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756837,0.00007863093,0.000739014,0.00054937036,0.0006436915,0.0004209209],"domain_scores_gemma":[0.99643236,0.0023842473,0.0002710022,0.0005459055,0.00020972143,0.00015677848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064909537,0.0001551831,0.0003009944,0.00012798302,0.0006679373,0.00044686857,0.00058633194,0.00008021993,0.00021605325],"category_scores_gemma":[0.0058671236,0.00011401178,0.00016828101,0.0006325542,0.00008665842,0.000063921594,0.00015873501,0.00013438748,0.00044331694],"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.0000072447942,0.00014333859,0.000008185354,0.00004136244,0.000007774383,1.11368244e-7,0.00055801455,0.0014838141,0.00072897354,0.83916765,0.000058263766,0.15779527],"study_design_scores_gemma":[0.00021406788,0.00005109054,0.0000033534563,0.000032714914,0.000012762623,0.000007530186,0.00045239687,0.2600458,0.00076715514,0.7166989,0.02158838,0.00012584201],"about_ca_topic_score_codex":7.2006236e-7,"about_ca_topic_score_gemma":9.665762e-7,"teacher_disagreement_score":0.73998773,"about_ca_system_score_codex":0.000036906335,"about_ca_system_score_gemma":0.000016191245,"threshold_uncertainty_score":0.70239186},"labels":[],"label_agreement":null},{"id":"W2063761188","doi":"10.1007/s10107-013-0722-4","title":"Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lipschitz continuity; Mathematics; Minification; Sequence (biology); Convergence (economics); Iterative method; Stationary point; Combinatorics; Applied mathematics; Nonlinear system; Linear programming; Algorithm; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.023488488135037677,"score_gpt":0.3072439672906072,"score_spread":0.28375547915556953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063761188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045859814,0.00010041886,0.9897424,0.00014211144,0.000109542474,0.0022880533,0.0000022389165,0.001919513,0.0011097338],"genre_scores_gemma":[0.040080953,0.0000028288105,0.9586083,0.00003941014,0.00012014019,0.0008909689,0.000046606678,0.00008659116,0.0001241615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983745,0.000085146145,0.0005551054,0.00030656302,0.00015819892,0.0005204896],"domain_scores_gemma":[0.9987528,0.00043361398,0.00009017176,0.00034164582,0.00024273791,0.00013904633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035871603,0.000312515,0.000449272,0.00012485714,0.00013713026,0.00030508402,0.00019014378,0.00018854835,0.00008725184],"category_scores_gemma":[0.00037663194,0.0002722586,0.00016508004,0.0002979919,0.0001149347,0.00024569724,0.000047102734,0.00019389232,0.000029109031],"study_design_candidate":"design_other","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.0000143234465,0.00014504752,0.0000065349773,0.00032734495,0.00015007144,0.0000036076972,0.0008291211,0.00012536306,0.019531928,0.006782938,0.00071066857,0.971373],"study_design_scores_gemma":[0.00062691164,0.0001374866,0.0000039780634,0.00031765454,0.00008638727,0.00002425715,0.00025811652,0.8787151,0.055083428,0.046286844,0.017952124,0.0005077099],"about_ca_topic_score_codex":0.0000036125764,"about_ca_topic_score_gemma":6.452853e-7,"teacher_disagreement_score":0.97086537,"about_ca_system_score_codex":0.000053830907,"about_ca_system_score_gemma":0.000016305508,"threshold_uncertainty_score":0.99997294},"labels":[],"label_agreement":null},{"id":"W2068133968","doi":"10.1007/s10107-006-0009-0","title":"Active-constraint variable ordering for faster feasibility of mixed integer linear programs","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Nortel (Canada)","funders":"","keywords":"Mathematics; Integer (computer science); Integer programming; Variable (mathematics); Constraint (computer-aided design); Linear programming; Mathematical optimization; Numerical analysis; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.08992158410743467,"score_gpt":0.37174853516017203,"score_spread":0.28182695105273736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068133968","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013467203,0.000012407161,0.9815734,0.000076285076,0.000050714818,0.0027042162,0.00001401188,0.0002252254,0.0018765364],"genre_scores_gemma":[0.09557659,3.8992516e-7,0.90315646,0.0000046798755,0.00008118602,0.0004717448,0.000027067705,0.00007016152,0.0006117441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974672,0.00007997391,0.00089032314,0.00043132034,0.00047975383,0.0006513847],"domain_scores_gemma":[0.99759674,0.0010147037,0.00026650267,0.00048301948,0.00051666907,0.0001223388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010066021,0.00027405084,0.0005788704,0.00011135429,0.00012275274,0.000070342656,0.00027776818,0.00015984879,0.00017573492],"category_scores_gemma":[0.0020314283,0.0002335526,0.0001886148,0.00042896814,0.00031269217,0.0002013527,0.00014589627,0.0002630383,0.000012094327],"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.0003237754,0.006051296,0.0005668802,0.007083346,0.00023039243,0.0000095991,0.0009911726,0.0012771513,0.0019781743,0.6930682,0.0001346193,0.2882854],"study_design_scores_gemma":[0.0020436072,0.00037516202,0.00001700182,0.000468419,0.000094576084,0.00002584555,0.0010277488,0.15699096,0.006721255,0.8297562,0.0019300781,0.0005491379],"about_ca_topic_score_codex":0.0000074219897,"about_ca_topic_score_gemma":0.0000063632015,"teacher_disagreement_score":0.28773627,"about_ca_system_score_codex":0.00011699196,"about_ca_system_score_gemma":0.000075119984,"threshold_uncertainty_score":0.95239985},"labels":[],"label_agreement":null},{"id":"W2069154666","doi":"10.1007/s10107-012-0594-z","title":"Improved semidefinite bounding procedure for solving Max-Cut problems to optimality","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounding overwatch; Semidefinite programming; Mathematics; Embedding; Maximum cut; Quadratic programming; Semidefinite embedding; Quadratic equation; Regularization (linguistics); Relaxation (psychology); Mathematical optimization; Upper and lower bounds; Algorithm; Quadratically constrained quadratic program; Computer science; Combinatorics","score_opus":0.09471068804463127,"score_gpt":0.38996772183718376,"score_spread":0.29525703379255247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069154666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00631804,0.000083193234,0.9867674,0.0004846555,0.000120893266,0.004555604,0.00001203982,0.0005449929,0.0011131449],"genre_scores_gemma":[0.067193456,0.000002506818,0.9288529,0.00009858086,0.00027089956,0.0021205195,0.000014558266,0.00015654712,0.0012899946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636066,0.00005655469,0.000865771,0.00050886854,0.000594804,0.0016133571],"domain_scores_gemma":[0.99690676,0.001326149,0.0002328677,0.0005543115,0.00034146314,0.0006384629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024671184,0.00039556963,0.00059014873,0.00019402347,0.00044483345,0.00030011256,0.00040015086,0.00019472625,0.00013870173],"category_scores_gemma":[0.007827175,0.0003509865,0.00019670029,0.00059444184,0.00010583797,0.0005654493,0.0003054445,0.00036669036,0.00008647138],"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.0003538223,0.0059853527,0.001188678,0.027721634,0.0005726495,0.000011520852,0.02946118,0.0015420641,0.011611485,0.7369493,0.0030774123,0.18152484],"study_design_scores_gemma":[0.0032293627,0.0008467011,0.000030535266,0.0019192195,0.0003352988,0.00018594394,0.0039386065,0.4026566,0.0119849015,0.5407906,0.031184047,0.0028981296],"about_ca_topic_score_codex":0.0000019198174,"about_ca_topic_score_gemma":0.000003232586,"teacher_disagreement_score":0.40111455,"about_ca_system_score_codex":0.0002486975,"about_ca_system_score_gemma":0.00007044718,"threshold_uncertainty_score":0.9998942},"labels":[],"label_agreement":null},{"id":"W2071622090","doi":"10.1007/s10107-013-0659-7","title":"Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Monotone polygon; Resolvent; Regular polygon; Range (aeronautics); Convex function; Domain (mathematical analysis); Fixed point; Pure mathematics; Mathematical analysis; Discrete mathematics; Geometry","score_opus":0.016483421616309665,"score_gpt":0.2484942944968706,"score_spread":0.23201087288056094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071622090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13504025,0.000041017596,0.86249983,0.0013345081,0.000019663643,0.00039923016,0.0000023527004,0.000057816644,0.0006053001],"genre_scores_gemma":[0.6151399,0.0000051730094,0.38467798,0.0000825048,0.0000062181525,0.000020998812,0.0000028361198,0.0000060009684,0.000058375233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986265,0.00006640919,0.0005208768,0.00024404658,0.0003481568,0.00019404791],"domain_scores_gemma":[0.99888146,0.00018486744,0.00020215756,0.0002816377,0.00034065885,0.00010919409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038096495,0.00013089564,0.0003582769,0.000065182845,0.000101357684,0.00030823442,0.0003353414,0.00006614176,0.00015015653],"category_scores_gemma":[0.00016772228,0.00010918073,0.00008146072,0.0003919008,0.00020469494,0.00040123917,0.00030517933,0.00008280576,0.000037755908],"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.000010272117,0.0007240983,0.004412416,0.0011269138,0.00032445468,0.0000047212743,0.0110130785,0.00089461694,0.0019123605,0.9309715,0.0001377499,0.048467793],"study_design_scores_gemma":[0.00040706815,0.00012794876,0.0014069908,0.00009127191,0.00003557017,0.000007409731,0.00018614443,0.96520257,0.0015754062,0.030445032,0.00029123423,0.00022333986],"about_ca_topic_score_codex":0.00014392081,"about_ca_topic_score_gemma":0.0000016061763,"teacher_disagreement_score":0.96430796,"about_ca_system_score_codex":0.000011253896,"about_ca_system_score_gemma":0.000047426332,"threshold_uncertainty_score":0.4452261},"labels":[],"label_agreement":null},{"id":"W2071642760","doi":"10.1007/s101070100253","title":"A faster capacity scaling algorithm for minimum cost submodular flow","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Minimum-cost flow problem; Maximum flow problem; Scaling; Dijkstra's algorithm; Shortest path problem; Mathematical optimization; Approximation algorithm; Suurballe's algorithm; Flow (mathematics); Flow network; Algorithm; Graph; Combinatorics","score_opus":0.0668083390083673,"score_gpt":0.26281270927000383,"score_spread":0.19600437026163653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071642760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013410697,0.00008534764,0.9960242,0.0004916899,0.00024689065,0.00092020445,0.000007855695,0.00036426212,0.00051848276],"genre_scores_gemma":[0.019805167,0.0000019030048,0.97934633,0.00016998945,0.00017159502,0.0002802328,0.0000030018473,0.000023534081,0.00019825401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978345,0.00005213211,0.0004454427,0.00053834956,0.00041005324,0.0007195468],"domain_scores_gemma":[0.99859756,0.0003573426,0.00009276956,0.0006226079,0.00010898985,0.00022073003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057267374,0.00025444615,0.00035650088,0.0001071912,0.0003290116,0.00048160274,0.0008341114,0.000109970824,0.00008385565],"category_scores_gemma":[0.00015649434,0.00022956253,0.00025485482,0.0004076581,0.0001570896,0.00037859092,0.00025105153,0.00021801291,0.00013196547],"study_design_candidate":"design_other","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":[8.087156e-7,0.00027849874,0.0000041560334,0.0001008292,0.000023772182,0.000008821027,0.0009656645,0.0000102329195,0.000021240467,0.023618646,0.00016268203,0.97480464],"study_design_scores_gemma":[0.00040757115,0.00007680883,0.0000046428067,0.00007685764,0.000014889442,0.000047527144,0.00004554543,0.9201764,0.00031006578,0.06757045,0.010980126,0.0002891287],"about_ca_topic_score_codex":0.000002365727,"about_ca_topic_score_gemma":0.0000010008906,"teacher_disagreement_score":0.9745155,"about_ca_system_score_codex":0.00004194332,"about_ca_system_score_gemma":0.000007894175,"threshold_uncertainty_score":0.93612885},"labels":[],"label_agreement":null},{"id":"W2071879725","doi":"10.1007/s10107-010-0370-x","title":"Small Chvátal Rank","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Polytope; Combinatorics; Polyhedron; Mathematics; Facet (psychology); Unit cube; Context (archaeology); Rank (graph theory); Set (abstract data type); Integer (computer science); Graph; Integer programming; Birkhoff polytope; Cube (algebra); Polyhedral combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.03691911983242624,"score_gpt":0.3022590057215975,"score_spread":0.26533988588917123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071879725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038191423,0.00001610781,0.9534179,0.00055934524,0.00014686695,0.0003364302,2.669432e-7,0.00045546473,0.0068762004],"genre_scores_gemma":[0.37080497,3.8384368e-7,0.6286514,0.000047603527,0.0000607036,0.000061936036,5.268241e-7,0.000014725887,0.00035777543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985012,0.000043345473,0.00023030229,0.00034782535,0.0003311088,0.00054624816],"domain_scores_gemma":[0.9985991,0.0003234179,0.000045037665,0.0007491732,0.0000677415,0.00021549151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008088507,0.00014038158,0.00017642073,0.00009465963,0.00015088491,0.00026196954,0.0011362351,0.00007906699,0.000090831156],"category_scores_gemma":[0.00049211,0.0001144389,0.00009587042,0.0004006757,0.00018559601,0.00026820658,0.00040921583,0.00050854374,0.0004807273],"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.000002334046,0.00009441436,0.000036220492,0.000033148848,0.0000059395434,0.000019138692,0.00022269302,6.578486e-7,0.0026523003,0.72896445,0.00001137627,0.26795733],"study_design_scores_gemma":[0.0003437084,0.000085140055,0.000057152538,0.0000245388,0.0000045872926,0.00011729468,0.000035833997,0.018375782,0.00487288,0.9619864,0.013810045,0.00028663964],"about_ca_topic_score_codex":0.0000012660564,"about_ca_topic_score_gemma":0.0000039798647,"teacher_disagreement_score":0.33261356,"about_ca_system_score_codex":0.000011140977,"about_ca_system_score_gemma":0.000028895936,"threshold_uncertainty_score":0.61789376},"labels":[],"label_agreement":null},{"id":"W2075488114","doi":"10.1007/s10107-006-0015-2","title":"Equilibria for networks with malicious users","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Flow network; Routing (electronic design automation); Flow (mathematics); Mathematical optimization; Computer science; Social cost; Minimum-cost flow problem; Mathematics; Computer network; Economics; Microeconomics","score_opus":0.06679257091970953,"score_gpt":0.35932064478640446,"score_spread":0.29252807386669494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075488114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13265719,0.000023607841,0.8592287,0.0005636617,0.00002601495,0.0007085953,0.000002419537,0.00012903528,0.0066608223],"genre_scores_gemma":[0.8871397,9.331741e-8,0.1100576,0.00006465002,0.00012601109,0.00028095327,0.0000039936926,0.000019778548,0.002307268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.000046782206,0.00045848422,0.00032847762,0.00043842333,0.0003686711],"domain_scores_gemma":[0.99758935,0.0016051785,0.00013674331,0.00046399166,0.00011772911,0.00008701789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015395854,0.00012947632,0.00024053075,0.000057364236,0.00018122504,0.00033433942,0.00042286483,0.00006169682,0.0001413264],"category_scores_gemma":[0.00036981635,0.00008078326,0.00009899956,0.0004327833,0.000175981,0.000120266166,0.00005445885,0.00008372835,0.00016834732],"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.000052994063,0.0002281239,0.00039527705,0.000020278218,0.000012948565,0.0000029349183,0.00012250133,0.0013609903,0.00016619984,0.9302006,0.0018517233,0.06558548],"study_design_scores_gemma":[0.00036822655,0.00011558058,0.00015179231,0.000025887046,0.00003043125,0.00002128663,0.00030750295,0.048925214,0.00013706447,0.9141697,0.03555352,0.00019376873],"about_ca_topic_score_codex":0.0000031921963,"about_ca_topic_score_gemma":0.0000079217,"teacher_disagreement_score":0.75448245,"about_ca_system_score_codex":0.00001312981,"about_ca_system_score_gemma":0.0000138605565,"threshold_uncertainty_score":0.3294246},"labels":[],"label_agreement":null},{"id":"W2075660001","doi":"10.1007/s10107-014-0800-2","title":"On the complexity analysis of randomized block-coordinate descent methods","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":215,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Convex function; Separable space; Block (permutation group theory); Convex optimization; Combinatorics; Coordinate descent; Rate of convergence; Convergence (economics); Function (biology); Regular polygon; Sequence (biology); Descent (aeronautics); Convex analysis; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.05267368180101976,"score_gpt":0.33118716997368663,"score_spread":0.27851348817266686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075660001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081685965,0.000008067515,0.9955142,0.0008979005,0.0000357045,0.0006780686,3.4957824e-7,0.00024047977,0.0018083388],"genre_scores_gemma":[0.37857825,3.6135827e-7,0.62122744,0.00008218199,0.0000041650583,0.00008871078,6.7617685e-7,0.0000053004596,0.0000129179625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978027,0.0007435334,0.0005740855,0.0002719849,0.00036732692,0.00024036999],"domain_scores_gemma":[0.9945124,0.004290627,0.00027550396,0.00072174316,0.00012992862,0.000069844915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051497733,0.00015158631,0.0007754383,0.00024244736,0.00010899151,0.00011166138,0.0007620528,0.000046573274,0.000040409886],"category_scores_gemma":[0.0036789607,0.000088526765,0.0003888361,0.0011814003,0.00040494226,0.000057754718,0.00020200739,0.000120407356,0.000007031981],"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.00005467836,0.00011837385,0.0000019912125,0.000020139722,0.00023904283,1.9254757e-7,0.00041348714,0.00034004299,0.00001734136,0.97959685,0.000012405171,0.019185448],"study_design_scores_gemma":[0.001380626,0.000033348802,0.0000052444357,0.000025716932,0.00021786331,8.7812924e-7,0.000010146351,0.6328008,0.00080009544,0.364635,0.000020172705,0.00007007139],"about_ca_topic_score_codex":0.0000052759387,"about_ca_topic_score_gemma":3.8662733e-7,"teacher_disagreement_score":0.6324608,"about_ca_system_score_codex":0.000023941375,"about_ca_system_score_gemma":0.000008192895,"threshold_uncertainty_score":0.44043255},"labels":[],"label_agreement":null},{"id":"W2076486048","doi":"10.1007/s10107-005-0627-y","title":"Error Bounds for Eigenvalue and Semidefinite Matrix Inequality Systems","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Semidefinite programming; Mathematics; Eigenvalues and eigenvectors; Positive-definite matrix; Semidefinite embedding; Applied mathematics; Matrix (chemical analysis); Linear matrix inequality; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.12128332009897753,"score_gpt":0.4346167466984115,"score_spread":0.313333426599434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076486048","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008964711,0.00038738357,0.9867229,0.00047387957,0.000058504746,0.0020745923,0.00002572931,0.00037308587,0.0009192185],"genre_scores_gemma":[0.05350222,0.000012207901,0.94312304,0.000035460114,0.00022005671,0.00066631415,0.000018070452,0.000091630645,0.0023309735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975923,0.00011345334,0.0007694649,0.00039824608,0.0004973379,0.0006292432],"domain_scores_gemma":[0.99712485,0.0018148853,0.0001892689,0.00042192158,0.00020470748,0.00024439214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017508891,0.00026003877,0.00049842545,0.00012013079,0.00026391924,0.00026913,0.00020701096,0.00017376884,0.00007336358],"category_scores_gemma":[0.0027618639,0.0002248103,0.000093295785,0.00024088634,0.00016182459,0.00025142528,0.00013771505,0.00025233507,0.00005772963],"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.00006331661,0.0006785669,0.00008286979,0.0042829914,0.00012090157,0.0000070367496,0.0018079791,0.0009872576,0.00010272512,0.9224478,0.00079036306,0.06862817],"study_design_scores_gemma":[0.0015558442,0.00019692026,0.000005685269,0.00027074822,0.000101813544,0.000087924,0.0012666389,0.6551483,0.00019301404,0.2972993,0.04322894,0.00064485014],"about_ca_topic_score_codex":0.0000031237744,"about_ca_topic_score_gemma":0.0000028394943,"teacher_disagreement_score":0.65416104,"about_ca_system_score_codex":0.00011475881,"about_ca_system_score_gemma":0.000041201034,"threshold_uncertainty_score":0.9167498},"labels":[],"label_agreement":null},{"id":"W2077734616","doi":"10.1007/s10107-010-0378-2","title":"Separation, dimension, and facet algorithms for node flow polyhedra","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polyhedron; Cutting-plane method; Ball (mathematics); Flow network; Mathematics; Mathematical optimization; Algorithm; Computer science; Integer programming; Combinatorics; Geometry","score_opus":0.02201792622503246,"score_gpt":0.3070329254117051,"score_spread":0.28501499918667267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077734616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015225799,0.00003217227,0.98253226,0.001276831,0.00022216912,0.00039615677,0.0000015972383,0.00013391637,0.00017910714],"genre_scores_gemma":[0.15709856,7.3040746e-7,0.8423441,0.0001401125,0.00011611819,0.000080036174,0.000010843668,0.000006095451,0.00020342247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908406,0.00001576338,0.00022735202,0.0002775284,0.00018663463,0.00020868368],"domain_scores_gemma":[0.9992781,0.00022967653,0.00005209135,0.00021320954,0.00011865423,0.00010822159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039532216,0.00010937279,0.00013066319,0.00006319125,0.00020984423,0.0002829877,0.00017034213,0.00006225108,0.000012189444],"category_scores_gemma":[0.00027147777,0.0000942894,0.000042451884,0.00018712517,0.00004009744,0.00028319773,0.000089847716,0.00009903289,0.00002239868],"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.0000034381683,0.00014736886,0.000027834794,0.000098006945,0.00001688394,0.0000018877494,0.0007072516,0.00029351056,0.0055600684,0.504317,0.00053545466,0.4882913],"study_design_scores_gemma":[0.00031589688,0.000067592446,0.00010539158,0.000013582233,0.000009378342,0.0000418517,0.000016474854,0.9084463,0.0025534567,0.07588103,0.012377805,0.00017121986],"about_ca_topic_score_codex":8.19387e-7,"about_ca_topic_score_gemma":0.0000027312467,"teacher_disagreement_score":0.9081528,"about_ca_system_score_codex":0.0000066761086,"about_ca_system_score_gemma":0.00003402743,"threshold_uncertainty_score":0.38450098},"labels":[],"label_agreement":null},{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","score_opus":0.11490132143911759,"score_gpt":0.2635967916886539,"score_spread":0.14869547024953633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083246371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020066627,0.000017972254,0.9956871,0.001567013,0.00007340178,0.0006999707,1.5873468e-7,0.00032545565,0.0014282133],"genre_scores_gemma":[0.02076829,2.6505413e-7,0.97856057,0.00010989555,0.000051320934,0.00012957906,9.28056e-7,0.000010803051,0.00036836806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988368,0.000033937376,0.00022439184,0.0003399907,0.00023088414,0.000333992],"domain_scores_gemma":[0.999185,0.00010414068,0.000043866443,0.0003868657,0.000034095225,0.0002460339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018152848,0.00014118344,0.00016907259,0.000096901014,0.00012620201,0.00047405474,0.0005880952,0.00005048281,0.00011985653],"category_scores_gemma":[0.00011152696,0.000120514924,0.000070500966,0.00052394613,0.000031254593,0.0004388316,0.0003193713,0.00011560225,0.00044577674],"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":[8.2568613e-7,0.00018416201,0.000016761502,0.000034680612,0.000016449663,0.0000018259382,0.0026007842,0.002400974,0.000008788343,0.3470771,0.00019963161,0.647458],"study_design_scores_gemma":[0.00017257073,0.000067313274,0.00006936483,0.000035657315,0.0000044703224,0.000010479356,0.00013068353,0.8930049,0.00018792707,0.10565695,0.00045324897,0.0002064075],"about_ca_topic_score_codex":0.000029051105,"about_ca_topic_score_gemma":0.0000016508055,"teacher_disagreement_score":0.89060396,"about_ca_system_score_codex":0.000027765429,"about_ca_system_score_gemma":0.000025052886,"threshold_uncertainty_score":0.5729707},"labels":[],"label_agreement":null},{"id":"W2093605433","doi":"10.1007/s10107-006-0072-6","title":"Invariance and efficiency of convex representations","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conic optimization; Dual cone and polar cone; Representation (politics); Regular polygon; Duality (order theory); Invariant (physics); Complementarity (molecular biology); Convex analysis; Convex set; Conic section; Path (computing); Smoothness; Convex hull; Convex optimization; Pure mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.04243372711367955,"score_gpt":0.36150817230085497,"score_spread":0.3190744451871754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093605433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016230216,0.00007426733,0.97465897,0.00019903453,0.000016141852,0.0005606796,0.0000026416872,0.00011055646,0.008147477],"genre_scores_gemma":[0.24289687,0.000003444241,0.75612444,0.0000069306125,0.000027000166,0.000058085076,0.000003134056,0.00002266351,0.0008574247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870694,0.000047788122,0.00045055407,0.00020862215,0.00033927982,0.00024681687],"domain_scores_gemma":[0.998587,0.00081308506,0.00013320887,0.00026411642,0.00013895202,0.000063599284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038437886,0.000107085754,0.00024786318,0.00008350125,0.00009014264,0.000041150794,0.00012428695,0.000053999298,0.00012838791],"category_scores_gemma":[0.0012813081,0.00009437802,0.000040959043,0.0003343144,0.00026292208,0.00011228183,0.00009023124,0.000114351526,0.000013123418],"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.0000073680044,0.00048071274,0.0003202188,0.0005437678,0.000014866791,0.0000074487775,0.00039275087,0.00012996238,0.00048252722,0.98732805,0.0001536332,0.010138674],"study_design_scores_gemma":[0.00052983424,0.00005744809,0.000095451185,0.00009862958,0.00002514082,0.00002609142,0.00034823516,0.047450043,0.002895998,0.947902,0.00039339482,0.00017772637],"about_ca_topic_score_codex":0.0000083287,"about_ca_topic_score_gemma":0.000002073727,"teacher_disagreement_score":0.22666666,"about_ca_system_score_codex":0.00001775741,"about_ca_system_score_gemma":0.000021195983,"threshold_uncertainty_score":0.3848624},"labels":[],"label_agreement":null},{"id":"W2096411231","doi":"10.1007/s10107-005-0668-2","title":"Optimal 3-terminal cuts and linear programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Minimum weight; Linear programming relaxation; Linear programming; Terminal (telecommunication); Combinatorics; Maximum cut; Minimum cut; Relaxation (psychology); Approximation algorithm; Mathematical optimization; Undirected graph; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science","score_opus":0.027349089847701694,"score_gpt":0.28497923140448495,"score_spread":0.25763014155678327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096411231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035607576,0.00020481108,0.9609431,0.0012443612,0.00007421493,0.00040840675,6.000484e-7,0.00055697816,0.00095992174],"genre_scores_gemma":[0.14473435,0.0000034834861,0.8547391,0.00009271436,0.00018056027,0.000051021296,0.0000011153627,0.000014049067,0.00018354319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821347,0.00003963995,0.00036715582,0.00045741702,0.00035610117,0.00056618644],"domain_scores_gemma":[0.99905986,0.00015744814,0.000079450285,0.00042382814,0.000051844247,0.00022756806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004810137,0.00021889321,0.0002633114,0.00010317193,0.00026122067,0.00042555627,0.0005900282,0.00008069144,0.000028198267],"category_scores_gemma":[0.00009190659,0.00019253872,0.00009869347,0.00032527812,0.00019750456,0.000513818,0.00048562308,0.00026186497,0.00009231803],"study_design_candidate":"design_other","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.000002611523,0.00020562774,0.00004837938,0.00008401298,0.000013503791,0.000034286975,0.000908608,0.000017313267,0.000018469858,0.10192646,0.000028146866,0.8967126],"study_design_scores_gemma":[0.0007389887,0.00038506757,0.00012397386,0.00023500885,0.000037052465,0.000995871,0.00020946832,0.81715876,0.0006765522,0.029173527,0.14946456,0.0008011725],"about_ca_topic_score_codex":0.0000023210578,"about_ca_topic_score_gemma":0.0000016759973,"teacher_disagreement_score":0.8959114,"about_ca_system_score_codex":0.000024268988,"about_ca_system_score_gemma":0.000023328907,"threshold_uncertainty_score":0.7851501},"labels":[],"label_agreement":null},{"id":"W2099335235","doi":"10.1007/s10107-007-0106-8","title":"Approximation algorithms for general packing problems and their application to the multicast congestion problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Solver; Approximation algorithm; Mathematics; Block (permutation group theory); Steiner tree problem; Logarithm; Combinatorics; Regular polygon; Algorithm; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.04118625576138175,"score_gpt":0.2885665262119343,"score_spread":0.24738027045055255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099335235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031238857,0.00005075298,0.992243,0.001691848,0.000060692648,0.0024748717,0.0000019652266,0.00021937766,0.00013362613],"genre_scores_gemma":[0.15107733,0.0000011334105,0.84805304,0.0001161486,0.00013369914,0.00057534035,0.0000064660844,0.00001387599,0.000022958455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856627,0.00003293559,0.00037408705,0.00040014368,0.00020860018,0.00041794585],"domain_scores_gemma":[0.9988758,0.00039764756,0.0001080434,0.00036915287,0.00012382395,0.00012551477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018247295,0.00017467517,0.0001774761,0.00008630644,0.00037967833,0.00035726218,0.00042551896,0.00006688501,9.761501e-7],"category_scores_gemma":[0.000112973175,0.00011510906,0.00006336626,0.0003927211,0.00008504967,0.00023172105,0.00019696065,0.00013082224,0.000008998682],"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.0000028896366,0.00007467062,0.000010529768,0.000106136846,0.00000893914,2.2072179e-7,0.0023519357,0.00006965149,0.00035485197,0.24234362,0.000008288049,0.7546683],"study_design_scores_gemma":[0.0002560866,0.0001239984,0.00012146833,0.00007406611,0.000009316369,0.000031726348,0.00021472301,0.77224326,0.0009751397,0.21572252,0.01001575,0.0002119693],"about_ca_topic_score_codex":0.0000070993924,"about_ca_topic_score_gemma":0.00001276444,"teacher_disagreement_score":0.7721736,"about_ca_system_score_codex":0.000034219756,"about_ca_system_score_gemma":0.000009896177,"threshold_uncertainty_score":0.46940112},"labels":[],"label_agreement":null},{"id":"W2101538582","doi":"10.1007/s10107-016-1043-1","title":"Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Lipschitz continuity; Simplex; Ball (mathematics); Hypercube; Rate of convergence; Lebesgue measure; Infimum and supremum; Polynomial; Measure (data warehouse); Degree (music); Discrete mathematics; Lebesgue integration; Mathematical analysis","score_opus":0.07414095966189453,"score_gpt":0.37185180066735857,"score_spread":0.297710841005464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101538582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006667441,0.00002264767,0.996555,0.00050810556,0.00005445806,0.001912157,0.000056010318,0.00012907172,0.000095844385],"genre_scores_gemma":[0.08167061,0.00000288672,0.91677505,0.000019651688,0.00006159542,0.00088882947,0.00002562741,0.0000650741,0.0004906725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764246,0.00007723372,0.0007878725,0.0004026136,0.0005404647,0.0005493679],"domain_scores_gemma":[0.99527764,0.0030158802,0.00031300465,0.00046070683,0.00076464104,0.00016812468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011544448,0.00023225175,0.00061475864,0.0003685082,0.0001595313,0.000057979494,0.00031188852,0.00014814547,0.00027704836],"category_scores_gemma":[0.005407899,0.00016706882,0.00045782476,0.00073236274,0.00022884071,0.00019572524,0.000051037914,0.000074369316,0.0000050655863],"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.004307924,0.007055981,0.0037684096,0.010939304,0.0063249813,0.000007054156,0.0021523663,0.12542647,0.0067090783,0.51211095,0.0026874917,0.31851],"study_design_scores_gemma":[0.0027876198,0.00036757626,0.0000100734405,0.00019903152,0.0006142347,0.0000013763432,0.000102370075,0.92096084,0.008422837,0.064672455,0.0014468938,0.00041471157],"about_ca_topic_score_codex":0.000001196884,"about_ca_topic_score_gemma":0.0000027406913,"teacher_disagreement_score":0.7955344,"about_ca_system_score_codex":0.000123962,"about_ca_system_score_gemma":0.00012947575,"threshold_uncertainty_score":0.6812869},"labels":[],"label_agreement":null},{"id":"W2104417092","doi":"10.1007/s10107-011-0452-4","title":"An augmented Lagrangian approach for sparse principal component analysis","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sparse PCA; Principal component analysis; Mathematics; Orthogonality; Dimension (graph theory); Algorithm; Uncorrelated; Dimensionality reduction; Applied mathematics; Computer science; Pattern recognition (psychology); Combinatorics; Artificial intelligence; Statistics; Geometry","score_opus":0.05386574135832146,"score_gpt":0.26614033896466255,"score_spread":0.2122745976063411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104417092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08273065,0.000032291995,0.9111983,0.0000031062134,0.000026045498,0.0005689012,0.000003268144,0.0014723464,0.0039651],"genre_scores_gemma":[0.6042292,7.639287e-7,0.39557263,0.0000077116065,0.000019137377,0.00010538468,0.000026857313,0.000026678425,0.00001160294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989342,0.00002265105,0.00030063232,0.00022783488,0.00015280882,0.00036183704],"domain_scores_gemma":[0.9993447,0.000033014898,0.000038994353,0.00039897452,0.0000452801,0.00013905486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022578295,0.00019174129,0.00033266473,0.00015598566,0.00007069819,0.000059175647,0.00021595965,0.00008745135,0.0000413603],"category_scores_gemma":[0.00001491823,0.00016996318,0.00019258863,0.00029623887,0.00005121251,0.00008763035,0.000028188628,0.0001053583,0.000008367472],"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.0005458124,0.014501623,0.005715102,0.0041566696,0.016043184,0.0001829579,0.03434009,0.035764392,0.048525628,0.28982434,0.0016579679,0.54874223],"study_design_scores_gemma":[0.00023933241,0.000116058145,0.00029105874,0.00003014716,0.00061060564,0.0000070042356,0.00023795367,0.9810743,0.011344727,0.004936017,0.0007590931,0.0003537409],"about_ca_topic_score_codex":0.000009650616,"about_ca_topic_score_gemma":0.0000031481889,"teacher_disagreement_score":0.9453099,"about_ca_system_score_codex":0.000028649887,"about_ca_system_score_gemma":0.0000036000738,"threshold_uncertainty_score":0.6930897},"labels":[],"label_agreement":null},{"id":"W2112079301","doi":"10.1007/s101070200296","title":"Self-regular functions and new search directions for linear and semidefinite optimization","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":210,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Function (biology); Upper and lower bounds; Kernel (algebra); Interior point method; Polynomial; Semidefinite programming; Discrete mathematics; Algorithm; Mathematical analysis; Mathematical optimization","score_opus":0.10303372611590725,"score_gpt":0.3484202648766631,"score_spread":0.24538653876075586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112079301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045928365,0.00034836732,0.9955627,0.00081156567,0.000031859396,0.0012114389,0.00000678283,0.00041248693,0.0011555501],"genre_scores_gemma":[0.0008771002,0.00017378415,0.99278224,0.0000207012,0.0001132561,0.00019012025,0.0000102893655,0.00006683824,0.0057656844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984905,0.000056974164,0.0003718527,0.00036026764,0.0003044927,0.00041591443],"domain_scores_gemma":[0.99811715,0.001076155,0.00006808392,0.0002547448,0.00018574565,0.0002981515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041871142,0.00019418616,0.0002780098,0.00016838918,0.0004182046,0.00015641027,0.00008692866,0.00012218922,0.00022451331],"category_scores_gemma":[0.0013343832,0.00018069735,0.000060379192,0.0004012708,0.0001190408,0.00023654656,0.00010248394,0.00020463835,0.000022672068],"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.00008024943,0.0026747668,0.00020550819,0.005426398,0.0006427486,0.000016620414,0.008944921,0.01947155,0.000091669164,0.2821529,0.004407222,0.67588544],"study_design_scores_gemma":[0.00072301255,0.00012002281,0.0000011931545,0.000066151435,0.000080078884,0.000048464146,0.00036889655,0.9571442,0.000051758183,0.031408537,0.009768886,0.00021878716],"about_ca_topic_score_codex":0.0000020639172,"about_ca_topic_score_gemma":0.0000015436999,"teacher_disagreement_score":0.9376727,"about_ca_system_score_codex":0.00004960578,"about_ca_system_score_gemma":0.000019888997,"threshold_uncertainty_score":0.73686236},"labels":[],"label_agreement":null},{"id":"W2113717009","doi":"10.1007/s10107-006-0031-2","title":"Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; National Science Foundation","keywords":"Semidefinite programming; Saddle point; Mathematics; Semidefinite embedding; Algorithm; Scale (ratio); Numerical analysis; Mathematical optimization; Positive-definite matrix; Quadratically constrained quadratic program; Quadratic programming; Mathematical analysis; Geometry","score_opus":0.012556340445406806,"score_gpt":0.24420694903262774,"score_spread":0.23165060858722095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113717009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004882547,0.00009593792,0.9937113,0.00041754157,0.00012614185,0.0011716192,0.0000032423186,0.002220098,0.0017658573],"genre_scores_gemma":[0.026495479,9.882792e-7,0.97245586,0.000117223244,0.000066882865,0.00051201315,0.000020666621,0.000054408363,0.00027645283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965224,0.00008051203,0.0008249875,0.0007760664,0.0007287619,0.0010672488],"domain_scores_gemma":[0.99819934,0.0002369817,0.00025614392,0.00088850845,0.00019492379,0.00022408347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009639736,0.00039877286,0.00046319986,0.0002449166,0.00031704502,0.00056346715,0.0009393806,0.00018108224,0.0000572184],"category_scores_gemma":[0.0001476562,0.00036605776,0.00021814,0.0010001236,0.000141881,0.00054510805,0.00050735974,0.00031479588,0.00018483178],"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.000007351208,0.002061595,0.00019652225,0.0003669706,0.000055537268,0.0001293616,0.0031869237,0.00005088414,0.00031866145,0.42359746,0.0005248816,0.56950384],"study_design_scores_gemma":[0.0007157003,0.00027650225,0.00004331862,0.00025317585,0.00004374983,0.0002932923,0.000243637,0.6696009,0.0021268437,0.31761995,0.007945371,0.0008375375],"about_ca_topic_score_codex":0.00003370466,"about_ca_topic_score_gemma":0.000007909218,"teacher_disagreement_score":0.66955006,"about_ca_system_score_codex":0.000112429756,"about_ca_system_score_gemma":0.00004099541,"threshold_uncertainty_score":0.9998791},"labels":[],"label_agreement":null},{"id":"W2115871049","doi":"10.1007/s10107-002-0365-3","title":"Multiobjective optimization problem with variational inequality constraints","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Variational inequality; Mathematical optimization; Inequality; Numerical analysis; Multi-objective optimization; Variational analysis; Applied mathematics; Mathematical economics; Mathematical analysis","score_opus":0.017092485251245033,"score_gpt":0.25091536161086175,"score_spread":0.2338228763596167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115871049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052044736,0.0000041412986,0.98727316,0.00037526994,0.000019483869,0.00031182548,0.0000012658128,0.00016771727,0.011795067],"genre_scores_gemma":[0.19128582,4.3358267e-7,0.80844337,0.00009510443,0.000010645071,0.000059786846,0.000009816519,0.0000072596545,0.00008776924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985921,0.00014121497,0.00032163918,0.00031832262,0.00040687295,0.0002198775],"domain_scores_gemma":[0.9990397,0.00019590443,0.00014783241,0.00022477996,0.00028964825,0.00010210294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964764,0.00013729636,0.00017716373,0.000090919,0.00017383002,0.00024915405,0.00019693267,0.000055522672,0.00031776226],"category_scores_gemma":[0.00029938656,0.00010638653,0.0000536718,0.0006519866,0.00007438933,0.00044056794,0.000036762227,0.00009593,0.000040769508],"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.0000024795647,0.00023807271,0.00020007024,0.000022853306,0.00004921115,0.0000018977939,0.00044571565,0.067821376,0.0000028888114,0.9259078,0.0000055260084,0.0053021368],"study_design_scores_gemma":[0.00058179547,0.000062088235,0.00013470503,0.00002803252,0.000029589653,0.000028428994,0.0000919036,0.94999754,0.00005806883,0.048512045,0.0002376217,0.00023819198],"about_ca_topic_score_codex":0.0000024959352,"about_ca_topic_score_gemma":0.0000010557414,"teacher_disagreement_score":0.88217616,"about_ca_system_score_codex":0.000054460856,"about_ca_system_score_gemma":0.000105561616,"threshold_uncertainty_score":0.43383166},"labels":[],"label_agreement":null},{"id":"W2116616571","doi":"10.1007/s10107-011-0459-x","title":"Nuclear norm minimization for the planted clique and biclique problems","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complete bipartite graph; Mathematics; Combinatorics; Bipartite graph; Clique problem; Clique; Matrix norm; Generalization; Discrete mathematics; Minification; Graph; Mathematical optimization; Line graph; Pathwidth","score_opus":0.040395220358010415,"score_gpt":0.22166888502645446,"score_spread":0.18127366466844405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116616571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054249004,0.00028256633,0.9379282,0.00013878275,0.00009216948,0.0017358067,0.0000028567997,0.0018251,0.0037455256],"genre_scores_gemma":[0.8846297,0.000032043088,0.11507981,0.000042847892,0.000035666995,0.00011644703,0.0000020303203,0.00004328945,0.000018161341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947834,0.000009454603,0.00017123714,0.000103363025,0.000059146852,0.00017848569],"domain_scores_gemma":[0.9996283,0.00012943374,0.000026011217,0.00014826599,0.000029812405,0.000038149283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012507317,0.00010659523,0.000121086654,0.000029102328,0.00008325454,0.000049269085,0.000094184965,0.00006990187,0.000015754149],"category_scores_gemma":[0.000049487848,0.00007330186,0.000035634344,0.00006117276,0.000055059107,0.00005667123,0.000028486751,0.00008898535,0.000005603719],"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.0001620364,0.0006014747,0.00036014433,0.0027268243,0.0006100397,0.000027797756,0.027514065,0.00072260236,0.015696708,0.38709778,0.0047524506,0.5597281],"study_design_scores_gemma":[0.0004618214,0.00025461093,0.00017935778,0.000523244,0.00012795858,0.000091009715,0.0005505171,0.86762804,0.0178882,0.08646192,0.025305,0.0005283513],"about_ca_topic_score_codex":0.0000045564757,"about_ca_topic_score_gemma":0.0000029258629,"teacher_disagreement_score":0.8669054,"about_ca_system_score_codex":0.000008942496,"about_ca_system_score_gemma":0.0000025857353,"threshold_uncertainty_score":0.2989163},"labels":[],"label_agreement":null},{"id":"W2117319367","doi":"10.1007/s10107-011-0497-4","title":"Improved lower bounds and exact algorithm for the capacitated arc routing problem","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Column generation; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Mathematics; Undirected graph; Set (abstract data type); Upper and lower bounds; Algorithm; Vehicle routing problem; Arc (geometry); Routing (electronic design automation); Graph; Computer science; Combinatorics; Artificial intelligence","score_opus":0.03169759203907864,"score_gpt":0.25875518175346096,"score_spread":0.22705758971438234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117319367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030987556,0.00008970134,0.99397695,0.000034690693,0.00010358738,0.0009139939,0.0000027125889,0.000547642,0.0012319394],"genre_scores_gemma":[0.14266455,0.0000037990337,0.8568762,0.000017529768,0.000055067907,0.00022630599,0.0000021850888,0.0000675741,0.00008679146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988196,0.000036136495,0.0003707642,0.00020206203,0.00012086466,0.00045059138],"domain_scores_gemma":[0.9990694,0.0004773428,0.000058711892,0.00022997706,0.000067733425,0.00009686197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412475,0.00019966917,0.00022517804,0.00004214807,0.00020362673,0.00014421272,0.0001574415,0.000096830416,0.000039129183],"category_scores_gemma":[0.00024028936,0.00014501247,0.00007243138,0.00017769082,0.00010955456,0.00011948714,0.00004727764,0.00020127915,0.000005421942],"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.0000081456465,0.00008610311,0.000039907867,0.0003661904,0.00013806712,0.0000027440087,0.00412125,0.00033366244,0.00059806835,0.0041757557,0.00003243864,0.99009764],"study_design_scores_gemma":[0.0003144723,0.000068563924,0.000019323586,0.000062875966,0.0000607372,0.000017897824,0.0003704442,0.99350077,0.0007465067,0.0041209254,0.00050696905,0.00021053398],"about_ca_topic_score_codex":0.0000056828976,"about_ca_topic_score_gemma":0.0000011138363,"teacher_disagreement_score":0.9931671,"about_ca_system_score_codex":0.000034337092,"about_ca_system_score_gemma":0.000009495166,"threshold_uncertainty_score":0.5913437},"labels":[],"label_agreement":null},{"id":"W2119673940","doi":"10.1007/s10107-008-0234-9","title":"The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Vertex (graph theory); Mathematics; Branch and cut; Bottleneck traveling salesman problem; Algorithm; Dimension (graph theory); Graph; Polytope; Combinatorics; Integer programming; Mathematical optimization; Computer science","score_opus":0.016277189734309045,"score_gpt":0.22943170088497788,"score_spread":0.21315451115066883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119673940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35608217,0.000829045,0.64082724,0.00030347647,0.000027077122,0.00062779017,0.0000034029322,0.0004894725,0.00081033347],"genre_scores_gemma":[0.40951446,0.000107280255,0.59021145,0.000011246308,0.00003290287,0.000026580457,0.0000016201179,0.000035523724,0.000058949554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989334,0.000048739847,0.00030364466,0.00021546165,0.00016939169,0.00032941243],"domain_scores_gemma":[0.9992664,0.000379609,0.00004299599,0.0001493278,0.000034049364,0.00012763262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053669757,0.00017926637,0.0002132627,0.0000320962,0.00035651415,0.00013446147,0.0000700516,0.000070905175,0.0000011338424],"category_scores_gemma":[0.00009357618,0.00012279306,0.000019420731,0.00013800958,0.00025008412,0.00010409215,0.00005007014,0.00020300323,0.0000018965436],"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.000044841567,0.000043452892,0.0005547215,0.00042754447,0.00010884858,0.000032770327,0.0070874235,0.0012965411,0.00019606076,0.0024836347,0.000023835506,0.98770034],"study_design_scores_gemma":[0.0016903218,0.0001866066,0.0010029728,0.0003216783,0.00007580304,0.0009776293,0.0005298785,0.9901802,0.0004469562,0.003088413,0.001004777,0.0004947645],"about_ca_topic_score_codex":0.0000059810473,"about_ca_topic_score_gemma":0.000005017813,"teacher_disagreement_score":0.9888837,"about_ca_system_score_codex":0.000016488792,"about_ca_system_score_gemma":0.000011102984,"threshold_uncertainty_score":0.5007356},"labels":[],"label_agreement":null},{"id":"W2123921374","doi":"10.1007/s10107-005-0647-7","title":"Recognizing Balanceable Matrices","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block matrix; Mathematics; Matrix (chemical analysis); Modulo; Combinatorics; Square matrix; Block (permutation group theory); Column (typography); Discrete mathematics; Symmetric matrix; Eigenvalues and eigenvectors; Geometry","score_opus":0.03153990687852182,"score_gpt":0.30946931220908636,"score_spread":0.27792940533056454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123921374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034583015,0.00039376764,0.9845756,0.00080077787,0.000045231194,0.000293442,2.8173878e-7,0.00056045863,0.009872129],"genre_scores_gemma":[0.15691872,0.000009417463,0.8420364,0.00010467483,0.00009450056,0.000062217376,5.471379e-7,0.00001635572,0.0007571452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829054,0.000059001035,0.0002858565,0.0003599558,0.00040174206,0.00060287694],"domain_scores_gemma":[0.9988599,0.0003213945,0.00006631694,0.00052254397,0.00006660898,0.00016325478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005566203,0.00014116104,0.00019441143,0.00012019674,0.00016679786,0.000310406,0.0009160397,0.00005350161,0.00008107927],"category_scores_gemma":[0.00025257788,0.00011914989,0.00007797352,0.0006206529,0.000075935895,0.0008018855,0.00032656937,0.00021577053,0.0010009157],"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.0000026365128,0.00010406096,0.000055418805,0.000061256294,0.000009235727,0.000008190554,0.00022019503,0.00002448951,0.00026693367,0.28688103,0.00014706062,0.7122195],"study_design_scores_gemma":[0.0005051462,0.0001321619,0.000026113787,0.00017289835,0.000010634749,0.000114987255,0.00016700855,0.11739376,0.004743577,0.77597713,0.1001916,0.00056496315],"about_ca_topic_score_codex":7.2912883e-7,"about_ca_topic_score_gemma":9.193413e-7,"teacher_disagreement_score":0.71165454,"about_ca_system_score_codex":0.00004630702,"about_ca_system_score_gemma":0.000020661779,"threshold_uncertainty_score":0.9997769},"labels":[],"label_agreement":null},{"id":"W2130895332","doi":"10.1007/s10107-008-0258-1","title":"A retrospective trust-region method for unconstrained optimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Trust region; Mathematics; Convergence (economics); Current (fluid); Mathematical optimization; Function (biology); Order (exchange); Numerical analysis; Applied mathematics; Value (mathematics); RADIUS; Computer science; Statistics; Mathematical analysis","score_opus":0.09041040462034387,"score_gpt":0.39166233116929994,"score_spread":0.30125192654895605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130895332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002593013,0.00001424543,0.9948793,0.0003301182,0.000047147605,0.0020174414,0.0000053803224,0.00042588898,0.0020211574],"genre_scores_gemma":[0.0069897617,0.0000062214813,0.9907253,0.000037670052,0.00011246828,0.00062106526,0.000016342456,0.00008819031,0.0014030114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779165,0.00010606083,0.000581225,0.00045300514,0.0005018901,0.0005661898],"domain_scores_gemma":[0.9978603,0.00089980074,0.00020549436,0.00038928565,0.0004587467,0.00018634771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006946327,0.000261023,0.0004895896,0.00016409013,0.00038862237,0.000059572445,0.00022809679,0.00016269404,0.00014886416],"category_scores_gemma":[0.0047144615,0.00023267261,0.0001902007,0.00052416406,0.00021220002,0.00022740765,0.00007457566,0.00023513302,0.000016546603],"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.00028966856,0.0021289438,0.00038737315,0.0015227682,0.00035748087,0.0001370973,0.0054455805,0.027605595,0.000103892206,0.83182865,0.0019429848,0.12824997],"study_design_scores_gemma":[0.0011541332,0.00016856146,0.00000461776,0.000063562824,0.00004270447,0.00022435123,0.00037091834,0.7262796,0.0002812436,0.270522,0.0005847208,0.00030357065],"about_ca_topic_score_codex":0.0000018880752,"about_ca_topic_score_gemma":0.0000013049226,"teacher_disagreement_score":0.698674,"about_ca_system_score_codex":0.00022280637,"about_ca_system_score_gemma":0.00007993283,"threshold_uncertainty_score":0.9488114},"labels":[],"label_agreement":null},{"id":"W2132147722","doi":"10.1007/s10107-015-0944-8","title":"Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Parametric statistics; Rank (graph theory); Maximum cut; Polynomial; Time complexity; Pareto principle; Graph; Discrete mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.04022054374351302,"score_gpt":0.2952712546187547,"score_spread":0.25505071087524167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132147722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53918105,0.0008428317,0.45700854,0.0004315674,0.0002652908,0.0012668165,0.000011854255,0.00025401925,0.0007380206],"genre_scores_gemma":[0.6792136,0.0000033354036,0.32062417,0.000026930007,0.000020474854,0.00008969046,0.0000013263159,0.000007263986,0.00001319376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983958,0.000054665397,0.00032946482,0.00048385715,0.00025844356,0.00047776746],"domain_scores_gemma":[0.9989671,0.00036298262,0.00007536188,0.00025707082,0.00007494223,0.00026253524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006116635,0.00020566587,0.00032722612,0.00022278575,0.00012603,0.0003831527,0.00032359944,0.000097392396,7.644548e-7],"category_scores_gemma":[0.00039918348,0.00018791469,0.00007686193,0.0009086039,0.00026485312,0.0003419316,0.0002764362,0.00013915308,0.0000021500432],"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.000077818855,0.0006679196,0.010677754,0.00021732229,0.00006250491,0.000024558469,0.0024857079,0.000015777077,0.000010682001,0.5027271,0.00019542822,0.48283747],"study_design_scores_gemma":[0.0028806792,0.0007458851,0.0035470726,0.00009085636,0.000029962386,0.00012326916,0.00073505536,0.19504899,0.00003408129,0.7949361,0.0013152283,0.0005128231],"about_ca_topic_score_codex":0.00004225226,"about_ca_topic_score_gemma":0.00003177436,"teacher_disagreement_score":0.48232463,"about_ca_system_score_codex":0.000055188008,"about_ca_system_score_gemma":0.000052,"threshold_uncertainty_score":0.7662939},"labels":[],"label_agreement":null},{"id":"W2133509071","doi":"10.1007/s10107-014-0854-1","title":"Finding small stabilizers for unstable graphs","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Vertex (graph theory); Bipartite graph; Matching (statistics); Discrete mathematics; Independent set; Induced subgraph; Graph; Chordal graph; Computer science","score_opus":0.06825843278489932,"score_gpt":0.24749230820121987,"score_spread":0.17923387541632055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133509071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20291488,0.00017761007,0.7609164,0.00021940115,0.00034289074,0.0009819318,0.000015427251,0.00024187476,0.034189586],"genre_scores_gemma":[0.9566795,8.5748843e-7,0.041882705,0.00005076091,0.000077180885,0.00016081204,0.0000056529466,0.00003643982,0.0011060912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856526,0.000025438938,0.00059770513,0.00032517864,0.00003036653,0.00045603298],"domain_scores_gemma":[0.99889463,0.00047403123,0.00022410265,0.00028607168,0.000021820006,0.00009935121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025161807,0.00014796796,0.00042352825,0.00010992751,0.0001653061,0.00013676526,0.00020457053,0.00008999457,0.00012122562],"category_scores_gemma":[0.0008847855,0.00015107049,0.00017185288,0.00015989,0.00006560463,0.000083081904,0.000035493733,0.00010124587,0.00032168158],"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.000006920289,0.00007335866,0.0010047178,0.0003854216,0.000021297175,3.107171e-7,0.0005279126,0.000012999627,0.000017396736,0.992153,0.000039201022,0.005757502],"study_design_scores_gemma":[0.00045098446,0.00011792567,0.00002390316,0.00007757606,0.000009513716,0.000005307482,0.0002554107,0.009021014,0.00011121504,0.93697196,0.052702576,0.0002526189],"about_ca_topic_score_codex":0.000008699791,"about_ca_topic_score_gemma":0.0000023498155,"teacher_disagreement_score":0.7537646,"about_ca_system_score_codex":0.00003401793,"about_ca_system_score_gemma":0.000004437981,"threshold_uncertainty_score":0.61604756},"labels":[],"label_agreement":null},{"id":"W2135778653","doi":"10.1007/s10107-006-0025-0","title":"A modified nearly exact method for solving low-rank trust region subproblem","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Trust region; Mathematics; Rank (graph theory); Numerical analysis; Applied mathematics; Mathematical optimization; Combinatorics; Computer science; Mathematical analysis","score_opus":0.02650424937890863,"score_gpt":0.2813552625777429,"score_spread":0.2548510131988343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135778653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043299218,0.000031469786,0.995329,0.0004650336,0.00007339139,0.0013325675,7.1107894e-7,0.0011051967,0.0012295884],"genre_scores_gemma":[0.10110004,4.5751702e-7,0.8980189,0.00005525133,0.00006931136,0.00048353392,0.000004815743,0.000032881377,0.000234823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979539,0.000045947432,0.00055658724,0.00053370185,0.00033740993,0.0005724351],"domain_scores_gemma":[0.9984154,0.00055579434,0.00019685831,0.0005731146,0.00015153685,0.000107310436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007941181,0.00024012008,0.0003366508,0.00016192357,0.00022395932,0.00048553644,0.0006731593,0.0001264683,0.00000635541],"category_scores_gemma":[0.00032490244,0.00021468135,0.00017077786,0.00046070837,0.00006211348,0.00039790204,0.00015341047,0.00013910254,0.000011774889],"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.000009041588,0.00023388387,0.000013912986,0.00024455096,0.000013579918,0.00000790697,0.00040704882,0.0011167771,0.00023897177,0.9226399,0.00030449632,0.074769914],"study_design_scores_gemma":[0.0003140315,0.00010031278,0.000007916974,0.000105647036,0.000015743166,0.000034006323,0.000015530364,0.7066007,0.0012272625,0.29111996,0.00024039239,0.0002184932],"about_ca_topic_score_codex":0.000021564547,"about_ca_topic_score_gemma":0.0000011517037,"teacher_disagreement_score":0.7054839,"about_ca_system_score_codex":0.00007464216,"about_ca_system_score_gemma":0.00003466574,"threshold_uncertainty_score":0.8754452},"labels":[],"label_agreement":null},{"id":"W2137267864","doi":"10.1007/s10107-014-0775-z","title":"On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Integer (computer science); Quadrilateral; Combinatorics; Intersection (aeronautics); Type (biology); Hull; Closure (psychology); Integer programming; Triangle inequality; Discrete mathematics; Mathematical optimization","score_opus":0.04689228043785602,"score_gpt":0.31881724676128953,"score_spread":0.2719249663234335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137267864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25714737,0.0000091737675,0.73900557,0.00006368558,0.00003899832,0.0008562192,0.0000064762653,0.00004377705,0.002828705],"genre_scores_gemma":[0.7576433,0.0000016717505,0.24223563,0.0000031357827,0.000007759379,0.000047476515,0.000005891295,0.000024193858,0.000030969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767315,0.00031052023,0.00095799315,0.00024044189,0.0005337254,0.00028416974],"domain_scores_gemma":[0.9942085,0.004611923,0.0005065938,0.00038072866,0.00023884364,0.000053398802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012201504,0.00019113686,0.0005624461,0.00019155293,0.000041566134,0.000019569006,0.00024177584,0.00012165495,0.00011675634],"category_scores_gemma":[0.00669939,0.00013310771,0.00012429255,0.00050475786,0.00074661063,0.00012674496,0.0001071918,0.00038332085,0.0000042616043],"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.00013542788,0.0021352929,0.0007835206,0.0010654645,0.00020459098,0.0000023669402,0.011463505,0.0004907723,0.00083400134,0.71157247,0.000017815682,0.27129477],"study_design_scores_gemma":[0.00094793685,0.00052884384,0.0001042673,0.0025047471,0.000054347267,0.0000020161872,0.012974805,0.12187008,0.0130224805,0.84773934,0.00002790718,0.00022321884],"about_ca_topic_score_codex":0.000033533917,"about_ca_topic_score_gemma":0.000027027321,"teacher_disagreement_score":0.5004959,"about_ca_system_score_codex":0.00006682046,"about_ca_system_score_gemma":0.000033523862,"threshold_uncertainty_score":0.80202794},"labels":[],"label_agreement":null},{"id":"W2142464562","doi":"10.1007/s10107-006-0018-z","title":"Generating facets for the cut polytope of a graph by triangular elimination","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science","keywords":"Mathematics; Polytope; Combinatorics; Birkhoff polytope; Facet (psychology); Bipartite graph; Lemma (botany); Polyhedral combinatorics; Discrete mathematics; Graph; Maximum cut; Uniform k 21 polytope; Geometry; Regular polygon; Convex set; Convex optimization","score_opus":0.01383328173664599,"score_gpt":0.2648057788634306,"score_spread":0.2509724971267846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142464562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041990556,0.00009042863,0.9563387,0.00045701864,0.000019033749,0.00074526196,0.000024217894,0.000021321202,0.00031347826],"genre_scores_gemma":[0.9805707,3.2371787e-7,0.018658841,0.000011192064,0.00011182484,0.00044963683,0.000043112803,0.0000147344,0.00013964633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929035,0.000012322833,0.0002814764,0.00012457055,0.000117563904,0.00017368975],"domain_scores_gemma":[0.9994576,0.00017807714,0.00012505436,0.00016280377,0.00005276518,0.000023677747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002624615,0.000089439236,0.00013604313,0.000018640581,0.00017351646,0.000054903856,0.00012071294,0.000023959767,0.000045304805],"category_scores_gemma":[0.000014049106,0.000062336294,0.00011450461,0.00011665672,0.000030841402,0.000034239394,0.000020843401,0.00005332043,0.0000047014223],"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.0000019844956,0.00018070245,0.000011301955,0.000029031955,0.00002076456,2.1097085e-8,0.0000632627,0.000020276768,0.007527369,0.93722516,0.00052600016,0.054394137],"study_design_scores_gemma":[0.00054362975,0.00006126018,0.000008227006,0.00003464466,0.000103680984,5.55921e-7,0.000550447,0.14366701,0.031648915,0.81177425,0.011427515,0.0001798818],"about_ca_topic_score_codex":0.000034060784,"about_ca_topic_score_gemma":0.0000010667416,"teacher_disagreement_score":0.93858016,"about_ca_system_score_codex":0.0000051893057,"about_ca_system_score_gemma":0.000009413647,"threshold_uncertainty_score":0.2542},"labels":[],"label_agreement":null},{"id":"W2143904249","doi":"10.1007/s10107-004-0545-4","title":"?Cone-free? primal-dual path-following and potential-reduction polynomial time interior-point methods","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Mathematics; Conic section; Logarithm; Mathematical optimization; Path (computing); Convex optimization; Dual (grammatical number); Applied mathematics; Regular polygon; Mathematical analysis; Geometry; Computer science","score_opus":0.03074848561589642,"score_gpt":0.3701164102202075,"score_spread":0.3393679246043111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143904249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03893228,0.00009560818,0.95765555,0.0008500672,0.00017118208,0.0011031991,0.000004088628,0.00045151002,0.0007365403],"genre_scores_gemma":[0.034509107,0.000006438292,0.96454626,0.000023905128,0.00014434742,0.000121761565,0.000008258434,0.000100865036,0.0005390522],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971915,0.00020119817,0.0007711053,0.0005536464,0.00058674155,0.0006958403],"domain_scores_gemma":[0.9985,0.00027966595,0.0001987405,0.0005961875,0.00012494515,0.00030047158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015815392,0.0003540836,0.00059524045,0.00019069419,0.00028710844,0.0002845804,0.00029383265,0.00019679045,0.00022358401],"category_scores_gemma":[0.0025797933,0.0003211951,0.00021649693,0.00034489442,0.0002540074,0.00046756625,0.0004923029,0.00043905582,0.00009361774],"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.00034912705,0.0026914913,0.00001873968,0.0025157067,0.0010420299,0.00055761315,0.014798377,0.0011182829,0.1275692,0.107235834,0.0007537289,0.7413499],"study_design_scores_gemma":[0.006249285,0.00068778254,0.000012111265,0.0009388415,0.0004057144,0.001340383,0.0029851194,0.04548426,0.028880863,0.9106055,0.0009726247,0.0014375478],"about_ca_topic_score_codex":0.000004712043,"about_ca_topic_score_gemma":3.337637e-7,"teacher_disagreement_score":0.80336964,"about_ca_system_score_codex":0.00023352998,"about_ca_system_score_gemma":0.00007722283,"threshold_uncertainty_score":0.999924},"labels":[],"label_agreement":null},{"id":"W2144300893","doi":"10.1007/s10107-005-0588-1","title":"The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristic; Scheduling (production processes); Probabilistic logic; Bounded function; Mathematical optimization; Computer science; Mathematics; Algorithm; Competitive analysis; Job shop scheduling; Job scheduler; Upper and lower bounds; Schedule; Artificial intelligence","score_opus":0.015704423003646266,"score_gpt":0.24866394673604508,"score_spread":0.2329595237323988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144300893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026268546,0.00013464731,0.9723757,0.00014409896,0.000043387387,0.0005165811,0.0000049452924,0.00027904141,0.0002330425],"genre_scores_gemma":[0.20801643,0.000019679395,0.7915806,0.000019002204,0.00010657335,0.0001019749,0.000029816367,0.00004541964,0.00008051858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988791,0.000013470813,0.00038953917,0.00016320286,0.0002281642,0.0003265428],"domain_scores_gemma":[0.9991892,0.0002474084,0.00007042729,0.00029225575,0.00008987539,0.000110839705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404744,0.00019263022,0.00021970429,0.000050724775,0.00020587465,0.00009336144,0.0001992324,0.00006163369,0.000012574362],"category_scores_gemma":[0.00008648592,0.00012319976,0.000050257968,0.0001715937,0.000080070735,0.00017967583,0.000015838583,0.00017272393,0.000014612255],"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.000021085852,0.00009484519,0.0000064081373,0.000108072476,0.000033836815,5.0671247e-7,0.00014518597,0.58261514,0.000005141703,0.0016446841,0.0000014745715,0.41532364],"study_design_scores_gemma":[0.0006569481,0.00033442833,0.0000035938021,0.00011245092,0.000032905336,0.000010455224,0.00013165725,0.9963385,0.0015959342,0.0002960995,0.00031326068,0.00017379294],"about_ca_topic_score_codex":7.413373e-7,"about_ca_topic_score_gemma":0.0000027822864,"teacher_disagreement_score":0.41514984,"about_ca_system_score_codex":0.000032379292,"about_ca_system_score_gemma":0.000018163635,"threshold_uncertainty_score":0.502394},"labels":[],"label_agreement":null},{"id":"W2154146583","doi":"10.1007/s10107-007-0126-4","title":"Regularization using a parameterized trust region subproblem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regularization (linguistics); Trust region; Parameterized complexity; Mathematics; Conjugate gradient method; Curvature; Mathematical optimization; Applied mathematics; Algorithm; MATLAB; Computer science; Artificial intelligence; Geometry","score_opus":0.15677674463492278,"score_gpt":0.3865109760349728,"score_spread":0.22973423140005003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154146583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044538964,0.000024329933,0.94993544,0.000102228805,0.00016118561,0.0010458378,5.347242e-7,0.00053138036,0.0036601042],"genre_scores_gemma":[0.08130465,0.0000014884819,0.9179324,0.00006492308,0.00012417352,0.00004745864,0.000002604424,0.00009982919,0.00042246032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667704,0.0002115468,0.0011236449,0.00051146565,0.00059592124,0.0008803968],"domain_scores_gemma":[0.9969745,0.0015177226,0.00042803746,0.00066904357,0.00014013059,0.00027051973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032155144,0.0003557539,0.0006230564,0.00019169123,0.00022918532,0.0001475607,0.00032688596,0.0002747561,0.00011561903],"category_scores_gemma":[0.0037123654,0.00030956196,0.00022245881,0.000770615,0.00025437382,0.00022659585,0.00016246663,0.00037674242,0.00004791819],"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.00014166316,0.00085091096,0.00038566254,0.0015188642,0.00012859862,0.00013348853,0.0015323891,0.000012306466,0.008774741,0.8051099,0.0001022249,0.18130922],"study_design_scores_gemma":[0.00060092635,0.00009971601,0.000007416253,0.00031054413,0.00012978855,0.00019242564,0.00031337104,0.01404755,0.0047630346,0.9775414,0.0015585348,0.0004352977],"about_ca_topic_score_codex":0.0000061891424,"about_ca_topic_score_gemma":9.3717154e-7,"teacher_disagreement_score":0.18087393,"about_ca_system_score_codex":0.00019649921,"about_ca_system_score_gemma":0.000031306317,"threshold_uncertainty_score":0.9999356},"labels":[],"label_agreement":null},{"id":"W2155466993","doi":"10.1007/s101070100256","title":"Matching, matroids, and extensions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Intersection (aeronautics); Matching (statistics); Jump; Path (computing); Mathematical optimization; Matroid partitioning; Combinatorial optimization; Combinatorics; Computer science; Graphic matroid","score_opus":0.036746783843772134,"score_gpt":0.2923804867600973,"score_spread":0.2556337029163252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155466993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022702303,0.00038775726,0.9718021,0.00095232535,0.000034465014,0.00027303133,3.0288965e-7,0.0003807093,0.0034669877],"genre_scores_gemma":[0.46638653,0.000013039571,0.5328885,0.00008520607,0.00002065588,0.00003629862,1.9253032e-7,0.0000139319145,0.00055569806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869394,0.00005607458,0.00020075083,0.00032219832,0.00029819887,0.00042884162],"domain_scores_gemma":[0.9989765,0.0002696671,0.000037456735,0.00048629555,0.000037690377,0.00019238729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650503,0.0001264199,0.00016852302,0.00008926821,0.00020537614,0.0002352398,0.00045034187,0.000044074965,0.00010101212],"category_scores_gemma":[0.00012285117,0.00010295183,0.000049408063,0.00029586387,0.00014373226,0.00033489414,0.00040708762,0.00020140885,0.00031568343],"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":[7.140889e-7,0.00008502819,0.000011884278,0.000046785015,0.000006351653,0.000026975064,0.0008254477,0.0000018435132,0.0004298041,0.8136287,0.00006297431,0.18487354],"study_design_scores_gemma":[0.00016919759,0.00006488729,0.000023795632,0.000050470455,0.0000044000108,0.00016615934,0.00012700637,0.028642753,0.00021857537,0.96788234,0.0024692323,0.00018120334],"about_ca_topic_score_codex":0.0000011067322,"about_ca_topic_score_gemma":4.2117114e-7,"teacher_disagreement_score":0.44368422,"about_ca_system_score_codex":0.000012847633,"about_ca_system_score_gemma":0.0000033828298,"threshold_uncertainty_score":0.41982538},"labels":[],"label_agreement":null},{"id":"W2155715867","doi":"10.1007/s10107-003-0470-y","title":"Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dual cone and polar cone; Duality (order theory); Homogeneous; Cone (formal languages); Context (archaeology); Regular polygon; Convex cone; Geometry; Automorphism; Rank (graph theory); Combinatorics; Convex analysis; Convex optimization; Algorithm","score_opus":0.033863498763681034,"score_gpt":0.2926265617804549,"score_spread":0.2587630630167738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155715867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8604671,0.0005256614,0.1371506,0.00017944048,0.00006570989,0.00054762553,0.000017395792,0.0002546045,0.00079190655],"genre_scores_gemma":[0.77771735,0.000023183413,0.22192775,0.00004875121,0.00005056713,0.000048028618,0.0000034148582,0.0000362432,0.00014468821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975458,0.000057143097,0.00096232165,0.0003611533,0.0005043049,0.00056927814],"domain_scores_gemma":[0.99803805,0.0007605287,0.00034636294,0.00037731096,0.00018497558,0.00029278695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013359961,0.00030583746,0.00078217685,0.00024735235,0.00015682062,0.00009344297,0.0002332435,0.00016175333,0.0001475753],"category_scores_gemma":[0.0024403108,0.0002587006,0.00014904325,0.0006254333,0.00030795374,0.00014759036,0.00018864352,0.00022950298,0.000015391559],"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.000045662815,0.000904585,0.0007215453,0.010819431,0.00044388528,0.00010760032,0.013210592,0.000015236057,0.00023536666,0.9564268,0.000081057435,0.01698825],"study_design_scores_gemma":[0.0029517862,0.0007102132,0.00006980314,0.00081122003,0.00035174296,0.0006427701,0.01621499,0.0006682659,0.010323374,0.9599962,0.00613811,0.0011215261],"about_ca_topic_score_codex":0.000031627154,"about_ca_topic_score_gemma":0.0000021866397,"teacher_disagreement_score":0.08477715,"about_ca_system_score_codex":0.00006807659,"about_ca_system_score_gemma":0.00012214045,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W2159874655","doi":"10.1007/s10107-013-0735-z","title":"First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Cone (formal languages); Second-order cone programming; Stationary point; Complementarity theory; Positive-definite matrix; Limiting; Mathematical optimization; Applied mathematics; Semidefinite programming; Mathematical analysis; Algorithm; Regular polygon; Convex optimization; Geometry; Nonlinear system","score_opus":0.036952661457493305,"score_gpt":0.2794488674892481,"score_spread":0.24249620603175476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159874655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010500383,0.0000044216017,0.99082726,0.0038927773,0.000021079959,0.0017397831,0.00001373743,0.00030063576,0.0021502615],"genre_scores_gemma":[0.2175397,4.9698514e-7,0.7808929,0.00025812435,0.000022105509,0.0010346492,0.0000959617,0.00001572165,0.0001403155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796456,0.000051438976,0.0005969612,0.00045000506,0.00044124582,0.00049578183],"domain_scores_gemma":[0.998005,0.0005742438,0.00018886333,0.0004391156,0.00054859347,0.0002442092],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040235705,0.0002454861,0.00040358794,0.00008417424,0.0004147176,0.00069793506,0.00045758678,0.00007653503,0.0014428132],"category_scores_gemma":[0.00022146935,0.00018611753,0.00013133713,0.00056587806,0.0003279886,0.00051652803,0.00014423423,0.00013597759,0.0002964019],"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.0000042297647,0.00089721807,0.00032018824,0.0002625781,0.00016284584,0.0000022325428,0.00041948567,0.0002507406,0.0000103831135,0.98994625,0.00022751022,0.00749632],"study_design_scores_gemma":[0.0010420589,0.00020876773,0.00026379892,0.00012633586,0.000100441895,0.00004298867,0.00026848656,0.76777554,0.000022381617,0.22833699,0.0014087779,0.0004034571],"about_ca_topic_score_codex":0.000018751882,"about_ca_topic_score_gemma":0.0000129720065,"teacher_disagreement_score":0.7675248,"about_ca_system_score_codex":0.00005253444,"about_ca_system_score_gemma":0.00006512881,"threshold_uncertainty_score":0.99947},"labels":[],"label_agreement":null},{"id":"W2167525805","doi":"10.1007/s10107-010-0435-x","title":"Tightening simple mixed-integer sets with guaranteed bounds","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Simple (philosophy); Mathematics; Integer (computer science); Integer programming; Numerical analysis; Mathematical optimization; Applied mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.010920119536309126,"score_gpt":0.25208788986587644,"score_spread":0.24116777032956732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167525805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0932856,0.000015152776,0.90404105,0.00032763762,0.00015915443,0.00020184167,4.499251e-7,0.00026276408,0.0017063598],"genre_scores_gemma":[0.62763476,1.1716134e-7,0.3720734,0.0000894567,0.0000624601,0.00002859764,0.000004738297,0.000008905711,0.00009756867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871254,0.000027977723,0.000247,0.00031729744,0.0003726787,0.00032250676],"domain_scores_gemma":[0.9991678,0.00018632173,0.00007502333,0.00034407942,0.00010727424,0.00011951745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042553502,0.00015166428,0.0001696095,0.00009753068,0.00021676847,0.00043799463,0.00038801454,0.000063638225,0.00005463743],"category_scores_gemma":[0.00011583158,0.000112563874,0.000057907833,0.00044532647,0.00006624331,0.00031846826,0.00011671295,0.00025440918,0.00011431062],"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.000010824874,0.0002513101,0.00017488142,0.00008496423,0.000037372076,0.00003661226,0.0010004354,0.00026025696,0.0024087247,0.6413355,0.00032366265,0.35407546],"study_design_scores_gemma":[0.00075555104,0.00030446964,0.0002725547,0.0000760549,0.00002982144,0.00047384505,0.00010616587,0.74676263,0.0057513593,0.18569015,0.05915561,0.0006218104],"about_ca_topic_score_codex":0.000002707551,"about_ca_topic_score_gemma":0.000010965636,"teacher_disagreement_score":0.74650234,"about_ca_system_score_codex":0.000012562277,"about_ca_system_score_gemma":0.000051927444,"threshold_uncertainty_score":0.45902213},"labels":[],"label_agreement":null},{"id":"W2168874859","doi":"10.1007/s10107-015-0912-3","title":"Stable sets and graphs with no even holes","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Decomposition; Node (physics); Polynomial; Combinatorics; Work (physics); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.04060407816370412,"score_gpt":0.26448879829109706,"score_spread":0.22388472012739294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168874859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027684815,0.00021240867,0.96452004,0.0005524306,0.0000952925,0.00039129856,0.0000013164066,0.00043138987,0.0061110076],"genre_scores_gemma":[0.20605974,0.000002053017,0.79363877,0.00007569762,0.00002249845,0.000036399368,0.0000011986281,0.000011865556,0.00015176476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881303,0.000036346926,0.0001719373,0.00029430332,0.00034805218,0.00033632695],"domain_scores_gemma":[0.99915063,0.000104067476,0.000049351536,0.00036013118,0.00009915163,0.00023667961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422751,0.00014306656,0.0001953759,0.0000669408,0.00011513001,0.00033583696,0.00038551443,0.000040565345,0.0000073732344],"category_scores_gemma":[0.00008520433,0.00010426954,0.000033075074,0.0003222469,0.00020753474,0.00035183362,0.00026222112,0.00013106033,0.000060173512],"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.000010338822,0.0002505318,0.0004491799,0.00016032343,0.000035603654,0.000047281792,0.0019249283,0.000006311758,0.000013755923,0.7960959,0.0003742282,0.20063162],"study_design_scores_gemma":[0.0007233682,0.0004783471,0.0001229469,0.00017969486,0.00001855294,0.00018132795,0.00029352988,0.063415624,0.00013231025,0.9207014,0.013329399,0.0004235264],"about_ca_topic_score_codex":0.0000073903393,"about_ca_topic_score_gemma":0.0000027828369,"teacher_disagreement_score":0.2002081,"about_ca_system_score_codex":0.000013077098,"about_ca_system_score_gemma":0.000033786255,"threshold_uncertainty_score":0.42519882},"labels":[],"label_agreement":null},{"id":"W2170006979","doi":"10.1007/s10107-010-0349-7","title":"An improved column generation algorithm for minimum sum-of-squares clustering","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Column (typography); Cluster analysis; Explained sum of squares; Bottleneck; Algorithm; Column generation; Set (abstract data type); Centroid; Point (geometry); Combinatorics; Square (algebra); Euclidean space; Mathematical optimization; Computer science; Statistics; Geometry","score_opus":0.03302216249232391,"score_gpt":0.33510104580939204,"score_spread":0.3020788833170681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170006979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012084117,0.000013771266,0.98631954,0.00010729538,0.0002807694,0.00091755844,0.000004337287,0.0002283322,0.00004427244],"genre_scores_gemma":[0.10706017,5.661294e-7,0.89227706,0.000016442305,0.00022302786,0.00029391653,0.000007821333,0.000029252002,0.00009175244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981113,0.000042907093,0.00046132423,0.00047940592,0.00035799772,0.0005470617],"domain_scores_gemma":[0.99839544,0.00026653576,0.00013202638,0.0007561165,0.00024550044,0.00020438276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007982343,0.0001830071,0.00028460808,0.00011031126,0.00019411971,0.0003413293,0.0008900949,0.00012542332,0.000011335193],"category_scores_gemma":[0.00028240052,0.00017321816,0.00009593284,0.00025975803,0.00012076437,0.00058191916,0.00027331154,0.00025393802,0.0000072888333],"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.0000023743285,0.0001681135,0.000002708311,0.00012650051,0.000010606461,0.0000023294806,0.00041426977,0.000049016922,0.09746256,0.0021290996,0.0000062350714,0.8996262],"study_design_scores_gemma":[0.00037091612,0.00036098115,0.0000065600766,0.000022209999,0.0000060819034,0.000019858964,0.000059629507,0.9743242,0.02008656,0.004070641,0.0004745788,0.00019775816],"about_ca_topic_score_codex":0.000009879556,"about_ca_topic_score_gemma":0.000022237386,"teacher_disagreement_score":0.97427523,"about_ca_system_score_codex":0.000030678693,"about_ca_system_score_gemma":0.00005622868,"threshold_uncertainty_score":0.70636314},"labels":[],"label_agreement":null},{"id":"W2171487610","doi":"10.1007/s10107-007-0134-4","title":"Symbolic Fenchel Conjugation","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Duality (order theory); Mathematics; Maple; Convex analysis; Fenchel's duality theorem; Convex conjugate; Class (philosophy); Symbolic data analysis; Regular polygon; Algebra over a field; Convex optimization; Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.06832498750919115,"score_gpt":0.4043783178552574,"score_spread":0.33605333034606627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171487610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007870935,0.00002750516,0.97373223,0.00017772036,0.000051811967,0.0006870434,9.188318e-7,0.0004195054,0.017032318],"genre_scores_gemma":[0.13962442,0.0000029454159,0.8584719,0.00005695826,0.00012514845,0.000055760258,0.0000062697277,0.000059854923,0.0015967581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978396,0.000043766217,0.00057538267,0.0002800054,0.0006288572,0.00063237746],"domain_scores_gemma":[0.9979884,0.0010851368,0.00012991455,0.0003688281,0.00019946738,0.00022823396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016527781,0.00018677671,0.00028080083,0.00015810347,0.0001652503,0.000088808134,0.00022585256,0.00012285539,0.00046033927],"category_scores_gemma":[0.002568444,0.00016503844,0.000089137175,0.00048768357,0.00014414286,0.0001819672,0.00009740557,0.0002760742,0.00031334048],"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.000023614755,0.0005196576,0.00010642021,0.00041080615,0.000042603795,0.00003957829,0.0012133043,0.00002335637,0.000384386,0.7745627,0.00026291754,0.22241062],"study_design_scores_gemma":[0.0007740372,0.000097983655,0.00006666612,0.00013510721,0.00003627471,0.000069939255,0.0010196575,0.016027799,0.0042292816,0.97073704,0.006359107,0.00044712218],"about_ca_topic_score_codex":0.000001187028,"about_ca_topic_score_gemma":0.0000022926524,"teacher_disagreement_score":0.2219635,"about_ca_system_score_codex":0.00010418556,"about_ca_system_score_gemma":0.000027638685,"threshold_uncertainty_score":0.6730072},"labels":[],"label_agreement":null},{"id":"W2174409790","doi":"10.1007/s10107-012-0537-8","title":"On generalizations of network design problems with degree bounds","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Spanning tree; Degree (music); Combinatorics; Matroid; Rounding; Approximation algorithm; Minimum spanning tree; Discrete mathematics; Bounded function; Mathematical analysis","score_opus":0.08827442949770972,"score_gpt":0.26848629817945724,"score_spread":0.18021186868174752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174409790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088329363,0.00010114339,0.9969564,0.000098260534,0.0000704266,0.00034324225,2.704337e-7,0.00014176221,0.0014052101],"genre_scores_gemma":[0.20876929,0.0000010176352,0.7910006,0.000046938643,0.00006356508,0.000057540066,9.461931e-7,0.000010311785,0.000049756556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987555,0.0000692351,0.00024842087,0.00017080172,0.00031158343,0.00044446404],"domain_scores_gemma":[0.9990415,0.00028022449,0.00009595145,0.00040669818,0.000054706772,0.00012094397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005774708,0.00013146525,0.00019073387,0.000056536483,0.0001654964,0.00010345784,0.000420503,0.00004266359,0.000022645389],"category_scores_gemma":[0.000054359716,0.00009553636,0.000053653075,0.00058045826,0.00011495658,0.00024245356,0.00011026583,0.00010500971,0.000020654632],"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.0000029293326,0.0003208946,0.00012730384,0.00006785969,0.000022717351,0.0000010683881,0.0006309762,0.0026242516,0.000008268304,0.9516194,0.00014388215,0.044430472],"study_design_scores_gemma":[0.00043093265,0.0006818081,0.00018989637,0.00041623993,0.00003847262,0.00005889398,0.000038002127,0.25694135,0.0004620342,0.73729926,0.002997805,0.00044533185],"about_ca_topic_score_codex":0.0000021323256,"about_ca_topic_score_gemma":0.000001075551,"teacher_disagreement_score":0.2543171,"about_ca_system_score_codex":0.000015470696,"about_ca_system_score_gemma":0.000021989632,"threshold_uncertainty_score":0.38958594},"labels":[],"label_agreement":null},{"id":"W2182031487","doi":"10.1007/s10107-016-0991-9","title":"Single-commodity robust network design with finite and Hose demand sets","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Solver; Polytope; Mathematical optimization; Flow network; Mathematics; Set (abstract data type); Integer programming; Network planning and design; Finite set; Linear programming; Branch and cut; Graph; Robust optimization; Computer science; Discrete mathematics","score_opus":0.03504380833129531,"score_gpt":0.21540378849506317,"score_spread":0.18035998016376786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182031487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017529301,0.00007693866,0.97556925,0.0024447362,0.000066027584,0.0012446211,5.1725124e-7,0.00039847515,0.0026701207],"genre_scores_gemma":[0.85677457,0.0000032091311,0.14134233,0.0006004664,0.00054038037,0.00019101863,0.000005037078,0.00008170122,0.00046130136],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981597,0.000035065757,0.00031778688,0.00041655177,0.0003468334,0.0007240281],"domain_scores_gemma":[0.9987563,0.0005586846,0.00017660916,0.00035492764,0.00011031848,0.00004317256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145473,0.00029525868,0.00032177265,0.00012871799,0.00027429403,0.0005766087,0.00022865908,0.00007568167,0.00016476151],"category_scores_gemma":[0.00043867624,0.00018150757,0.000048730508,0.00041185968,0.00019643668,0.00075616094,0.00035265923,0.00010674915,0.00013401976],"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.0004965657,0.0013066054,0.013393611,0.004702961,0.00040847564,0.0005907312,0.00044009573,0.0075993426,0.000073426185,0.19790366,0.01115793,0.7619266],"study_design_scores_gemma":[0.0064589097,0.00046862935,0.0015243847,0.0030057342,0.0008915052,0.000052876898,0.002152888,0.13755558,0.000111881986,0.65536916,0.18953036,0.0028780915],"about_ca_topic_score_codex":0.000010890373,"about_ca_topic_score_gemma":0.000009232808,"teacher_disagreement_score":0.83924526,"about_ca_system_score_codex":0.00005707184,"about_ca_system_score_gemma":0.000010383916,"threshold_uncertainty_score":0.74016637},"labels":[],"label_agreement":null},{"id":"W2208994903","doi":"10.1007/s10107-015-0920-3","title":"The submodular joint replenishment problem","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Defense Science and Engineering Graduate; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Massachusetts Institute of Technology; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Submodular set function; Holding cost; Mathematical optimization; Cardinality (data modeling); Heuristic; Mathematics; Dynamic programming; Approximation algorithm; Average cost; Job shop scheduling; Total cost; Computer science; Schedule","score_opus":0.060117193881396754,"score_gpt":0.24062316476104365,"score_spread":0.1805059708796469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208994903","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054929294,0.001175335,0.056445718,0.04327136,0.0024502808,0.007829637,0.0000011925375,0.0028748077,0.8310224],"genre_scores_gemma":[0.9701407,0.0000065867016,0.018178107,0.0027082723,0.0020180503,0.0008081668,0.000021006217,0.000108436056,0.0060106884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817693,0.000016758995,0.00043959985,0.00028146367,0.0005800994,0.00050517026],"domain_scores_gemma":[0.9991631,0.000039561688,0.00016305548,0.00045983162,0.00013005038,0.00004440311],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018890965,0.00019222967,0.00019700559,0.0000753866,0.00031285224,0.0009046122,0.00034386115,0.00004390648,0.00011228819],"category_scores_gemma":[0.0003485449,0.0001229383,0.00011283201,0.0002830409,0.00011896828,0.00041318368,0.00038250253,0.00013654344,0.0012963352],"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.000022171116,0.00030292975,0.00035506143,0.00040545306,0.00006102288,0.000024531144,0.00025434562,0.000027670536,0.00001891182,0.8443042,0.045862086,0.10836158],"study_design_scores_gemma":[0.00035254643,0.000020946365,0.000025895717,0.000054051627,0.00003765939,0.000002955101,0.0012772284,0.0070474967,0.00002845397,0.1739361,0.81702375,0.00019292251],"about_ca_topic_score_codex":0.000034402186,"about_ca_topic_score_gemma":0.000008510861,"teacher_disagreement_score":0.9152114,"about_ca_system_score_codex":0.00007228242,"about_ca_system_score_gemma":0.000014528092,"threshold_uncertainty_score":0.99948126},"labels":[],"label_agreement":null},{"id":"W2213558218","doi":"10.1007/s10107-017-1123-x","title":"Integral simplex using decomposition with primal cutting planes","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Simplex; Decomposition; Calculus (dental); Geometry","score_opus":0.022860104221093514,"score_gpt":0.31905729845022046,"score_spread":0.29619719422912694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213558218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21932109,0.000021385498,0.7777077,0.000033740616,0.000016056136,0.0002058593,9.927636e-7,0.00076128216,0.0019319286],"genre_scores_gemma":[0.60222965,6.7319405e-7,0.39766636,0.0000057949574,0.00004014495,0.00001866887,0.0000033158801,0.000028748187,0.000006650309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900705,0.000011241475,0.0002567763,0.00018119082,0.00019133824,0.000352393],"domain_scores_gemma":[0.99935687,0.00006252254,0.00009238517,0.00036160238,0.000033050776,0.00009354492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012633143,0.00019324858,0.0002902655,0.000053876676,0.00030778226,0.00024444374,0.0002497274,0.00006360238,0.000036289322],"category_scores_gemma":[0.00007778394,0.00014772324,0.000068319496,0.00006964741,0.00012573691,0.00031596937,0.000068878566,0.00020151051,0.000015672802],"study_design_candidate":"design_other","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.00006414028,0.00032302598,0.0032233745,0.0013284944,0.00038773837,0.00018737656,0.0007831845,0.009724202,0.014599173,0.019488674,0.000048317364,0.9498423],"study_design_scores_gemma":[0.00039409436,0.00015640853,0.00024479802,0.0006282814,0.0001853203,0.0001711644,0.00023192917,0.94045776,0.023149004,0.03136288,0.0022095442,0.0008088427],"about_ca_topic_score_codex":0.000009433931,"about_ca_topic_score_gemma":0.0000032087496,"teacher_disagreement_score":0.94903344,"about_ca_system_score_codex":0.00006940412,"about_ca_system_score_gemma":0.000005000603,"threshold_uncertainty_score":0.6023979},"labels":[],"label_agreement":null},{"id":"W2217630407","doi":"10.1007/s10107-016-0980-z","title":"Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Subderivative; Convex analysis; Monotone polygon; Regular polygon; Proper convex function; Convex set; Convex optimization; Convex function; Convex combination; Effective domain; Combinatorics; Pure mathematics; Geometry","score_opus":0.04564266979921341,"score_gpt":0.25120328878195913,"score_spread":0.20556061898274572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217630407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042483967,0.00005917698,0.95549184,0.0015182453,0.000027310258,0.00019456522,0.00000486466,0.000052625204,0.00016740436],"genre_scores_gemma":[0.91214865,0.000007866597,0.08711274,0.000020080868,0.000010840694,0.00002325904,0.0000012377101,0.0000056404774,0.00066968956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906003,0.000051919316,0.00036621874,0.00016589023,0.00022687827,0.00012903017],"domain_scores_gemma":[0.9991729,0.00025621624,0.00014956342,0.00020331859,0.00015767367,0.000060288872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024443935,0.00009073742,0.00028723682,0.00008131672,0.00005652287,0.000052522948,0.00017192807,0.00004112697,0.00021215151],"category_scores_gemma":[0.00027418238,0.000046798945,0.000060040955,0.00023097462,0.00015436036,0.0001984869,0.00009840774,0.00002863315,0.000011949314],"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.00013993155,0.0012877635,0.002379827,0.001490005,0.00061981624,0.0000052347305,0.004682979,0.000029444891,0.02370952,0.61690646,0.00023597325,0.34851304],"study_design_scores_gemma":[0.015754042,0.003770322,0.013665954,0.0041328403,0.0016145974,0.00017316923,0.0023959663,0.5869286,0.15650263,0.20479329,0.007225667,0.0030429428],"about_ca_topic_score_codex":0.0000057863704,"about_ca_topic_score_gemma":0.0000041120497,"teacher_disagreement_score":0.86966467,"about_ca_system_score_codex":0.000008500752,"about_ca_system_score_gemma":0.000030044683,"threshold_uncertainty_score":0.23229103},"labels":[],"label_agreement":null},{"id":"W2253497723","doi":"10.1007/s10107-018-1351-8","title":"Level-set methods for convex optimization","year":2018,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; Office of Naval Research; U.S. Air Force; Directorate for Mathematical and Physical Sciences; Washington Research Foundation; National Science Foundation","keywords":"Mathematical optimization; Optimization problem; Inference; Set (abstract data type); Convex optimization; Rank (graph theory); Sequence (biology); Computer science; Range (aeronautics); Parametric statistics; Feasible region; Convex function; Regular polygon; Conic optimization; Constraint (computer-aided design); Mathematics; Convex set; Artificial intelligence","score_opus":0.11906332708385735,"score_gpt":0.3848609881634698,"score_spread":0.26579766107961245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253497723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022009398,0.00022794698,0.9947091,0.000035248002,0.00039126864,0.0011779168,0.000012578149,0.0016095582,0.0016163333],"genre_scores_gemma":[0.01302761,0.0000150958585,0.9859182,0.000025613823,0.00029252536,0.00045280124,0.000085686006,0.00011826744,0.00006420412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873894,0.00005163708,0.00041544123,0.00032021923,0.00012681156,0.00034696446],"domain_scores_gemma":[0.9989502,0.00021872825,0.000086950226,0.00051186694,0.00014942804,0.00008284178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052608544,0.000318163,0.00048006422,0.00009619151,0.00006670708,0.00018011707,0.00028898846,0.00038455028,0.000053422904],"category_scores_gemma":[0.000267089,0.0003090754,0.00018263595,0.00007554966,0.00008601499,0.000031818734,0.00025695827,0.00029692936,0.0000143143825],"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.00004044169,0.00021670035,0.0000076286806,0.005923083,0.0008192243,0.0000083602545,0.001670391,0.16219603,0.0010438133,0.011006456,0.01950649,0.7975614],"study_design_scores_gemma":[0.00010138426,0.00004287387,5.693756e-7,0.00047272583,0.00009087275,0.0000066536372,0.000022443528,0.90055877,0.009324994,0.078210466,0.010799096,0.00036915118],"about_ca_topic_score_codex":0.0000013851309,"about_ca_topic_score_gemma":2.7204135e-7,"teacher_disagreement_score":0.7971922,"about_ca_system_score_codex":0.00005482205,"about_ca_system_score_gemma":0.000019739711,"threshold_uncertainty_score":0.99993616},"labels":[],"label_agreement":null},{"id":"W2276707316","doi":"10.1007/s10107-016-0987-5","title":"On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Discrete mathematics; Vertex (graph theory); Equivalence (formal languages); Bipartite graph; Upper and lower bounds; Relaxation (psychology); Linear programming; Graph; Algorithm","score_opus":0.03293364940603159,"score_gpt":0.24611926579887713,"score_spread":0.21318561639284556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276707316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05183529,0.0000453313,0.9343358,0.012119434,0.00010440657,0.00068445987,0.0000036387216,0.00010338215,0.0007682574],"genre_scores_gemma":[0.9222487,0.0000037030197,0.07730058,0.00009614589,0.000018085755,0.000110135654,9.208489e-8,0.0000066767634,0.00021586906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920523,0.000055223318,0.00018722053,0.00017612323,0.00020046426,0.00017574677],"domain_scores_gemma":[0.9975027,0.0018489382,0.00008647915,0.00047287854,0.00005576677,0.000033231212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036602176,0.00008407538,0.000109957815,0.0000384597,0.00020440284,0.0000524563,0.000566182,0.000029773839,0.000008756741],"category_scores_gemma":[0.00070704543,0.000033206827,0.0000908251,0.000293748,0.0002640064,0.00008265448,0.00017922393,0.000061706436,0.0000038813914],"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.0000016465037,0.000049598402,0.00002899695,0.000025648375,0.0000087289545,1.18481545e-7,0.00014376335,2.5117447e-7,0.00046236507,0.8711407,0.000060231057,0.12807792],"study_design_scores_gemma":[0.00024119798,0.000121863945,0.00045325697,0.00025978487,0.000013945328,0.0000067558994,0.000029784995,0.010728368,0.0021586334,0.9844531,0.0014299668,0.00010336928],"about_ca_topic_score_codex":0.000001197084,"about_ca_topic_score_gemma":0.0000028911143,"teacher_disagreement_score":0.8704134,"about_ca_system_score_codex":0.000006647716,"about_ca_system_score_gemma":0.000012669013,"threshold_uncertainty_score":0.1572122},"labels":[],"label_agreement":null},{"id":"W2287259016","doi":"10.1007/s10107-015-0965-3","title":"A family of second-order methods for convex $$\\ell _1$$-regularized optimization","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Google; U.S. Department of Energy; National Science Foundation","keywords":"Orthant; Mathematics; Mathematical optimization; Proximal gradient methods for learning; Regularization (linguistics); Convex function; Regular polygon; Convex optimization; Applied mathematics; Algorithm; Subderivative; Computer science; Artificial intelligence","score_opus":0.05664813614882776,"score_gpt":0.3321507346713604,"score_spread":0.27550259852253267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287259016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003042338,0.00020782926,0.99262255,0.000018640301,0.0000841925,0.00056555204,0.0000015158047,0.00056531245,0.0028920916],"genre_scores_gemma":[0.052683137,0.0000021056344,0.9470481,0.00002198851,0.00003088502,0.000087862085,0.0000075668577,0.00004399765,0.0000743063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991559,0.00004091006,0.00033546577,0.00013305355,0.00011329791,0.0002214155],"domain_scores_gemma":[0.99924254,0.00019022053,0.00005798659,0.00022927449,0.00019295457,0.00008699254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864702,0.00014435909,0.00033831928,0.000066718945,0.000023122982,0.00003755132,0.00012160955,0.00010809371,0.000026822083],"category_scores_gemma":[0.000251134,0.00013159448,0.00007978652,0.000161266,0.000055593264,0.00007261581,0.00003435705,0.000083593055,0.0000039938627],"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.00019084435,0.00072922645,0.00003089514,0.0029014403,0.00071679836,0.00001085481,0.0043694824,0.10092189,0.12245289,0.062382597,0.0063814777,0.6989116],"study_design_scores_gemma":[0.00047290433,0.00008242224,0.0000012762588,0.00009739169,0.000047999612,0.0000058482783,0.00014245923,0.9262865,0.036397085,0.029604785,0.0066766925,0.00018458866],"about_ca_topic_score_codex":0.0000014487694,"about_ca_topic_score_gemma":2.6080426e-7,"teacher_disagreement_score":0.82536465,"about_ca_system_score_codex":0.000024381228,"about_ca_system_score_gemma":0.000017155162,"threshold_uncertainty_score":0.5366267},"labels":[],"label_agreement":null},{"id":"W2341168876","doi":"10.1007/s10107-016-1013-7","title":"Nash equilibria in the two-player kidney exchange game","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Nash equilibrium; Outcome (game theory); Set (abstract data type); Integer programming; Mathematical economics; Game theory; Computer science; Medicine; Mathematics; Mathematical optimization","score_opus":0.13067816523714162,"score_gpt":0.4064818393004588,"score_spread":0.2758036740633172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341168876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70315987,0.00008547716,0.2028848,0.031649083,0.00017191787,0.0017748494,0.000016542193,0.00023401203,0.060023468],"genre_scores_gemma":[0.99197066,0.0000010675301,0.0047936263,0.00060085155,0.000105872976,0.00024681984,6.417172e-7,0.000012877943,0.0022675837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974822,0.00031652275,0.0005802019,0.0003682397,0.00083917845,0.0004136937],"domain_scores_gemma":[0.9954216,0.0033938822,0.00012128646,0.00084414665,0.00006292264,0.0001561958],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0055257864,0.00014094153,0.00023760759,0.0001062803,0.00009289449,0.00027627998,0.0011149973,0.00005765985,0.0018754152],"category_scores_gemma":[0.0046990933,0.00006017233,0.00010914371,0.0006778247,0.00023590396,0.00022770355,0.00016818778,0.00012762724,0.0039548404],"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.00001610901,0.00029358934,0.00039480385,0.000020504589,0.0000070800256,0.000011142502,0.0031820417,5.0306545e-7,0.003147434,0.5991387,0.0031878531,0.39060023],"study_design_scores_gemma":[0.00039454148,0.000031718446,0.00020227929,0.00006943065,0.000007753695,0.000023160865,0.00064771005,0.00034698818,0.00021929703,0.87401164,0.12391424,0.00013121196],"about_ca_topic_score_codex":0.0000021921976,"about_ca_topic_score_gemma":0.000005005673,"teacher_disagreement_score":0.39046904,"about_ca_system_score_codex":0.000020620488,"about_ca_system_score_gemma":0.000026085785,"threshold_uncertainty_score":0.999037},"labels":[],"label_agreement":null},{"id":"W2407048800","doi":"10.1007/s10107-017-1111-1","title":"The bilinear assignment problem: complexity and polynomially solvable special cases","year":2017,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Time complexity; Rank (graph theory); Function (biology); Diagonal; Value (mathematics); Generalization; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.0806663039339923,"score_gpt":0.307690644329012,"score_spread":0.2270243403950197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407048800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031779972,0.0011579377,0.96482956,0.008291853,0.0020441387,0.0035106996,0.000028741024,0.0007130592,0.016246017],"genre_scores_gemma":[0.03697918,0.0000946195,0.9595826,0.00008359393,0.0019817154,0.00035171869,0.0000113889255,0.000047389036,0.00086776953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694675,0.0001441076,0.00065241655,0.0008574362,0.0006603608,0.00073892524],"domain_scores_gemma":[0.99664694,0.0007556449,0.00044293614,0.0018082489,0.00010789182,0.00023833576],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015252016,0.00044589886,0.00059603807,0.00007297217,0.0018018619,0.0039484315,0.0025204811,0.00022041924,0.000027975968],"category_scores_gemma":[0.00040876117,0.00031016467,0.00023639189,0.00009054469,0.0010978637,0.00021370666,0.00550909,0.00087505736,0.000039688744],"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.000012542513,0.00029262985,0.000029912888,0.000531242,0.00010143432,0.0000886813,0.0007606241,0.000013777393,0.000005138963,0.5535238,0.0010050948,0.44363517],"study_design_scores_gemma":[0.00025027702,0.00012797251,0.000049792983,0.00035457607,0.000040296964,0.000121398014,0.00006405245,0.054687627,0.000055628756,0.9024556,0.04129415,0.0004985763],"about_ca_topic_score_codex":0.00007646511,"about_ca_topic_score_gemma":0.00008031802,"teacher_disagreement_score":0.44313657,"about_ca_system_score_codex":0.000082412145,"about_ca_system_score_gemma":0.00019325003,"threshold_uncertainty_score":0.99993503},"labels":[],"label_agreement":null},{"id":"W2533553031","doi":"10.1007/s10107-020-01484-3","title":"Outer-product-free sets for polynomial optimization and oracle-based cuts","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Polyhedron; Intersection (aeronautics); Mathematics; Cutting-plane method; Oracle; Extreme point; Relaxation (psychology); Dimension (graph theory); Product (mathematics); Combinatorics; Set (abstract data type); Convex polytope; Feasible region; Point (geometry); Regular polygon; Convex set; Mathematical optimization; Integer programming; Convex optimization; Computer science; Geometry","score_opus":0.11206493720119073,"score_gpt":0.39028093408065234,"score_spread":0.27821599687946164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533553031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019135381,0.00013545668,0.98958755,0.004262137,0.00019100211,0.0046225255,0.00012156567,0.0006281406,0.00026025373],"genre_scores_gemma":[0.002361012,0.000013073165,0.9952979,0.0001163324,0.00034847428,0.0011746449,0.0002162417,0.00023677289,0.0002355646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961905,0.00014215756,0.0010134241,0.0011573285,0.0007649323,0.0007316787],"domain_scores_gemma":[0.99608415,0.0013226406,0.00048182564,0.0012693324,0.00043994753,0.00040210586],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008583447,0.0006137067,0.0009924554,0.0002199304,0.00024722863,0.00049339246,0.0007952077,0.0004081666,0.000111956164],"category_scores_gemma":[0.008901063,0.0005938863,0.00024827535,0.00027455745,0.00024982783,0.00016186142,0.0014554111,0.00083754474,0.000015833846],"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.0015335493,0.004097148,0.00006978488,0.089985594,0.0016458775,0.00025644482,0.0073152864,0.32411715,0.00021504848,0.08641233,0.03267076,0.45168102],"study_design_scores_gemma":[0.0012847717,0.00011834621,4.8910636e-7,0.0003796355,0.00014653878,0.000010335527,0.00008021881,0.76474714,0.0002913468,0.23099135,0.0014002096,0.0005496112],"about_ca_topic_score_codex":0.0000030653184,"about_ca_topic_score_gemma":0.0000018839248,"teacher_disagreement_score":0.4511314,"about_ca_system_score_codex":0.00022093917,"about_ca_system_score_gemma":0.00029013236,"threshold_uncertainty_score":0.99965125},"labels":[],"label_agreement":null},{"id":"W2559883687","doi":"10.1007/s10107-016-1095-2","title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of the Secretary of Defense; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Bounded function; Quadratically constrained quadratic program; Mathematical optimization; Quadratic growth; Quadratic programming; Hermitian matrix; Rank (graph theory); Feasible region; Second-order cone programming; Trust region; Constraint (computer-aided design); Convex optimization; Regular polygon; Algorithm; Combinatorics; Computer science","score_opus":0.07666032763318521,"score_gpt":0.3906559550134406,"score_spread":0.3139956273802554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559883687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043145148,0.000013360249,0.99555826,0.0010503246,0.000023625467,0.0016878506,0.0000157689,0.00026338542,0.0009559781],"genre_scores_gemma":[0.014753688,0.0000037232621,0.98321736,0.000059590304,0.000107147585,0.0005638541,0.000006024205,0.00009522614,0.0011934008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977649,0.00011297379,0.0005058868,0.00046866317,0.00049310224,0.0006544621],"domain_scores_gemma":[0.99527335,0.0036443544,0.0001731231,0.00040481795,0.0002677842,0.00023655633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010025295,0.00028606772,0.00055030483,0.00010616196,0.0002385087,0.00014944727,0.00023206825,0.00012329806,0.00038632535],"category_scores_gemma":[0.0020150498,0.00017159022,0.00008710234,0.00020826173,0.00027785543,0.00020266853,0.00013198932,0.00013670445,0.000026557682],"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.00021096662,0.00048763346,0.00005055996,0.0013220328,0.00019848168,0.000010301928,0.00069704745,0.000008991032,0.001395908,0.48162425,0.00026534716,0.5137285],"study_design_scores_gemma":[0.0033439642,0.0004150762,0.000009517919,0.00036955322,0.000104550156,0.00009350951,0.00016319462,0.074788496,0.0021115476,0.90911424,0.009032388,0.0004539516],"about_ca_topic_score_codex":0.0000068970858,"about_ca_topic_score_gemma":0.000017425928,"teacher_disagreement_score":0.51327455,"about_ca_system_score_codex":0.00008189345,"about_ca_system_score_gemma":0.00006869569,"threshold_uncertainty_score":0.6997246},"labels":[],"label_agreement":null},{"id":"W2575486826","doi":"10.1007/s10107-017-1112-0","title":"Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Mathematics; Karush–Kuhn–Tucker conditions; Function (biology); Separable space; Constraint (computer-aided design); Normality; Applied mathematics; Term (time); Mathematical optimization; Continuous function (set theory); Nonlinear system; Mathematical analysis; Statistics","score_opus":0.037064566557147266,"score_gpt":0.3220293890959318,"score_spread":0.2849648225387845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575486826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027354772,0.000007887846,0.9932369,0.0020673827,0.000045745204,0.0005638533,0.0000044895264,0.00011448785,0.0012237782],"genre_scores_gemma":[0.32331783,0.000002773653,0.67611754,0.000076091026,0.000060962873,0.00015034949,0.00005228874,0.0000098018,0.0002123286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989108,0.000025121448,0.00029261305,0.00032681736,0.000217435,0.00022720742],"domain_scores_gemma":[0.9988748,0.00011855765,0.00021642173,0.00048809886,0.00017502235,0.00012712533],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046017318,0.00013079886,0.00020774848,0.000057025652,0.0008432907,0.0012437687,0.00047666155,0.00006362491,0.00002594557],"category_scores_gemma":[0.00033685833,0.000112031164,0.00009288675,0.00011395662,0.00010438911,0.0007429668,0.00019028853,0.00006830731,0.000016131455],"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.000012051344,0.0008643256,0.0026734874,0.0004346509,0.00014960393,0.0000049865052,0.00063872006,0.0003373358,0.000052047177,0.80785525,0.00014525726,0.1868323],"study_design_scores_gemma":[0.0004102519,0.00006435812,0.0016962969,0.000048993756,0.000045395103,0.00000779467,0.00003151821,0.9653103,0.000043776807,0.030967819,0.0011958656,0.00017763703],"about_ca_topic_score_codex":0.000009014977,"about_ca_topic_score_gemma":0.0000037488685,"teacher_disagreement_score":0.964973,"about_ca_system_score_codex":0.00001538628,"about_ca_system_score_gemma":0.000032717744,"threshold_uncertainty_score":0.99979305},"labels":[],"label_agreement":null},{"id":"W2578607773","doi":"10.1007/s10107-018-1339-4","title":"Two-stage linear decision rules for multi-stage stochastic programming","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"U.S. Department of Energy; National Science Foundation","keywords":"Mathematics; Upper and lower bounds; Linear programming; Mathematical optimization; Stochastic programming; Value (mathematics); Function (biology); Dual (grammatical number); Affine transformation; Bellman equation; Statistics; Pure mathematics","score_opus":0.1949070732070776,"score_gpt":0.4531267254404512,"score_spread":0.2582196522333736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578607773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0330415,0.00006924662,0.96381533,0.00009121723,0.00034084186,0.0017847825,0.00002403171,0.00026411342,0.0005689372],"genre_scores_gemma":[0.13390361,0.0000033299648,0.86165625,0.00006444234,0.00039942545,0.00025193917,0.000022511538,0.00006297665,0.0036355043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953516,0.00011163148,0.0014088482,0.0008693312,0.0014171435,0.0008414487],"domain_scores_gemma":[0.9952929,0.0021918635,0.00048606985,0.0008790137,0.0008034214,0.00034671868],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043068863,0.00036313382,0.0006021295,0.00035741218,0.0006329505,0.0008160684,0.0008457448,0.00018161231,0.00042705017],"category_scores_gemma":[0.009804679,0.0002608237,0.00031140837,0.00083524804,0.00040047383,0.00047264915,0.0002434617,0.00020516463,0.0011709561],"study_design_candidate":"design_other","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.00014028717,0.00049796695,0.00025218652,0.000047582274,0.0000299422,0.000009126706,0.0014114146,0.0013462855,0.000060156035,0.030782273,0.00023099616,0.9651918],"study_design_scores_gemma":[0.0017070626,0.00046580363,0.000051024173,0.00014134517,0.00005635298,0.000014747784,0.0015783836,0.8654474,0.0003164706,0.03133289,0.09835755,0.0005309512],"about_ca_topic_score_codex":0.000012235451,"about_ca_topic_score_gemma":0.000033833414,"teacher_disagreement_score":0.9646608,"about_ca_system_score_codex":0.000051718453,"about_ca_system_score_gemma":0.00007709503,"threshold_uncertainty_score":0.9999844},"labels":[],"label_agreement":null},{"id":"W2600745543","doi":"10.1007/s10107-017-1135-6","title":"Binary decision rules for multistage adaptive mixed-integer optimization","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Mathematical optimization; Binary number; Decision rule; Binary decision diagram; Computer science; Decision problem; Optimal decision; Optimization problem; Toolbox; Decision tree; Mathematics; Data mining; Algorithm; Artificial intelligence","score_opus":0.11749159385617258,"score_gpt":0.40547075357691104,"score_spread":0.28797915972073845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600745543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007132225,0.000054068525,0.98778164,0.0002697679,0.00035254817,0.0009060056,0.000018586643,0.00009708144,0.0033880468],"genre_scores_gemma":[0.28895068,0.000018585453,0.7094857,0.000024423516,0.00011054559,0.00012654356,0.000017556857,0.000030231908,0.0012357546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971881,0.00007347385,0.0008416358,0.0005632694,0.00093783025,0.00039567627],"domain_scores_gemma":[0.9958724,0.0017600453,0.00060927647,0.0010777973,0.00050279556,0.00017771967],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002541068,0.00022371147,0.0004162289,0.00019321324,0.0010573467,0.0014523938,0.00096290663,0.00016187075,0.00021515021],"category_scores_gemma":[0.010077399,0.0001582382,0.0002255322,0.0001522926,0.00021764038,0.00080840226,0.0002386863,0.00012281096,0.00030309186],"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.00019768687,0.00030561865,0.00053498877,0.00001985788,0.000027026526,0.000015013665,0.00048435552,0.040418,0.000014693406,0.049735,0.002607793,0.90563995],"study_design_scores_gemma":[0.00056361826,0.00015045199,0.00029091845,0.000081782455,0.000028833183,0.0000073219935,0.00042463746,0.87611336,0.00008279176,0.10971922,0.012303934,0.00023311401],"about_ca_topic_score_codex":0.000007650336,"about_ca_topic_score_gemma":0.000006095699,"teacher_disagreement_score":0.90540683,"about_ca_system_score_codex":0.000037913585,"about_ca_system_score_gemma":0.00003668138,"threshold_uncertainty_score":0.9995842},"labels":[],"label_agreement":null},{"id":"W2605137997","doi":"10.1007/s10107-017-1140-9","title":"Matroid optimisation problems with nested non-linear monomials in the objective function","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Mathematics; Monomial; Polytope; Submodular set function; Combinatorics; Rank (graph theory); Linear inequality; Monomial basis; Quadratic equation; Discrete mathematics; Quadratic function; Time complexity; Inequality; Mathematical analysis; Geometry","score_opus":0.03847006613994907,"score_gpt":0.27778044538007934,"score_spread":0.23931037924013027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605137997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04933912,0.000011887516,0.946897,0.00091224624,0.00007990562,0.0009061051,3.4375407e-7,0.00010049086,0.001752933],"genre_scores_gemma":[0.77488846,9.132119e-7,0.2247635,0.000053265747,0.0000624849,0.00018817479,0.0000014034915,0.000008651966,0.000033152955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881804,0.00004931472,0.00025470825,0.00030264774,0.00028899708,0.00028631472],"domain_scores_gemma":[0.99875224,0.00016663868,0.00018125126,0.0007995023,0.00005572136,0.000044638986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000885311,0.0001460955,0.0001915047,0.000068310634,0.0004981658,0.0007499131,0.0009503017,0.00005418269,0.000005669478],"category_scores_gemma":[0.00010573073,0.00009187972,0.0000559384,0.0001876799,0.00014386841,0.00061774295,0.000161002,0.00020766963,0.000030792748],"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.00011831692,0.0014152691,0.0020403464,0.0004971832,0.00010755297,0.000065856926,0.01985628,0.0024380863,0.00025010502,0.42600906,0.00006520014,0.5471367],"study_design_scores_gemma":[0.0012618812,0.000863684,0.010012234,0.00036692852,0.000039315466,0.00009334233,0.0009319992,0.741179,0.00033662407,0.24359906,0.0008229877,0.0004929644],"about_ca_topic_score_codex":0.000040182258,"about_ca_topic_score_gemma":0.000028301236,"teacher_disagreement_score":0.73874086,"about_ca_system_score_codex":0.00002957121,"about_ca_system_score_gemma":0.00002774286,"threshold_uncertainty_score":0.7231429},"labels":[],"label_agreement":null},{"id":"W2607867111","doi":"10.1007/s10107-017-1150-7","title":"Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Matroid; Mathematics; Spanning tree; Combinatorics; Degree (music); Approximation algorithm; Mathematical optimization; Minimum spanning tree; Linear programming relaxation; Reduction (mathematics); Constant (computer programming); Submodular set function; Lagrangian relaxation; Discrete mathematics; Linear programming; Computer science","score_opus":0.04325035615917717,"score_gpt":0.28487047776355545,"score_spread":0.2416201216043783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607867111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023867019,0.000041577776,0.96841204,0.0018326588,0.00035095896,0.0013606116,0.0000057700777,0.0006330786,0.0034962574],"genre_scores_gemma":[0.27921274,8.2129293e-7,0.7201294,0.00004336152,0.00021346052,0.0002413423,0.000008009367,0.00002481508,0.00012604678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997063,0.00007730083,0.0007146176,0.00083364896,0.00054045103,0.0007710275],"domain_scores_gemma":[0.99741733,0.00020235656,0.00039966372,0.0015180181,0.00012132363,0.0003413197],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082267635,0.00035583993,0.0005056498,0.00018423794,0.0012613144,0.0017438242,0.0018358009,0.00013493847,0.00005086345],"category_scores_gemma":[0.00046174356,0.00031856517,0.00018472307,0.00039401822,0.00025106184,0.00073499966,0.0007439051,0.0003547048,0.00012034981],"study_design_candidate":"design_other","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.000009735445,0.00035162873,0.0000612426,0.00013280603,0.000081898164,0.000033641012,0.006703601,0.000026865371,0.0016046334,0.13631007,0.00005842494,0.85462546],"study_design_scores_gemma":[0.00081910414,0.00016903621,0.00018493937,0.0009360425,0.000039896608,0.00007947843,0.000577175,0.71057814,0.002013507,0.28025144,0.003596389,0.00075487036],"about_ca_topic_score_codex":0.00008475683,"about_ca_topic_score_gemma":0.000013544116,"teacher_disagreement_score":0.8538706,"about_ca_system_score_codex":0.000069225905,"about_ca_system_score_gemma":0.000048295333,"threshold_uncertainty_score":0.9999266},"labels":[],"label_agreement":null},{"id":"W2613774992","doi":"10.1007/s10107-020-01576-0","title":"General bounds for incremental maximization","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"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":"Technische Universität Darmstadt; Deutsche Forschungsgemeinschaft","keywords":"Cardinality (data modeling); Knapsack problem; Competitive analysis; Submodular set function; Maximization; Mathematics; Mathematical optimization; Greedy algorithm; Bounded function; Matching (statistics); Class (philosophy); Combinatorics; Function (biology); Upper and lower bounds; Computer science","score_opus":0.06959338221277929,"score_gpt":0.3216730882626167,"score_spread":0.2520797060498374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613774992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014160131,0.00003892319,0.992785,0.0032106724,0.00022671666,0.0016938129,0.0000070303927,0.00052171404,0.00137458],"genre_scores_gemma":[0.016235618,0.0000062350105,0.9821422,0.00036777448,0.00018450516,0.0006072528,0.00012610314,0.000035750356,0.00029457608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795085,0.00006791446,0.0004988508,0.0006224941,0.00044281996,0.00041704468],"domain_scores_gemma":[0.9988754,0.00009560943,0.00017518649,0.0004954971,0.00014542919,0.0002128711],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049507554,0.00025599217,0.00035316986,0.00009165093,0.00016612357,0.0010990963,0.0009919915,0.00019283938,0.00004464714],"category_scores_gemma":[0.0002584334,0.0002417132,0.00018789236,0.00020873138,0.00005712198,0.00020093858,0.0014704023,0.00034317432,0.000053368643],"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.000013199079,0.00034385896,0.000024237857,0.0021042847,0.00010753168,0.0000093359695,0.001836962,0.0038113834,0.00014429478,0.866299,0.0019975652,0.123308375],"study_design_scores_gemma":[0.0002603317,0.00007472919,0.0000020577684,0.000076847515,0.000014394773,0.0000035392334,0.000014877307,0.7860524,0.00015408061,0.2078252,0.00528212,0.00023942707],"about_ca_topic_score_codex":0.0000034388754,"about_ca_topic_score_gemma":6.742222e-7,"teacher_disagreement_score":0.782241,"about_ca_system_score_codex":0.00008788282,"about_ca_system_score_gemma":0.00012650139,"threshold_uncertainty_score":0.99993783},"labels":[],"label_agreement":null},{"id":"W2738541582","doi":"10.1007/s10107-017-1177-9","title":"Stabilizing network bargaining games by blocking players","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blocking (statistics); Mathematics; Mathematical economics; Mathematical optimization; Statistics","score_opus":0.050215524796229226,"score_gpt":0.25902079185972754,"score_spread":0.2088052670634983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738541582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4960039,0.0032642516,0.24913596,0.00062644813,0.0011009973,0.0012494355,0.000029502258,0.0006518785,0.24793763],"genre_scores_gemma":[0.9841025,0.0000042817164,0.014584046,0.00004933127,0.00024721026,0.000045655608,0.0000031795357,0.0000448328,0.00091895537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815077,0.00002759011,0.0007099169,0.00041193087,0.000062491294,0.0006373269],"domain_scores_gemma":[0.9983405,0.00022460287,0.0006150847,0.0006699711,0.000017701319,0.00013212636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023625663,0.00020165787,0.0005247892,0.000047442314,0.0008148762,0.0006843355,0.0005123122,0.000117763375,0.00020399933],"category_scores_gemma":[0.0010302903,0.00021346557,0.00013930374,0.00006553987,0.00015252188,0.0002681503,0.00016161546,0.00023536092,0.00047697063],"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.000008296935,0.00008148831,0.021721074,0.00016392353,0.000069909605,0.000006836915,0.0011380514,0.000044618002,0.000026346339,0.9591218,0.0004258449,0.017191766],"study_design_scores_gemma":[0.0010527112,0.00015605456,0.0007603498,0.0008031815,0.000032126267,0.000030624673,0.001231265,0.023751026,0.000253401,0.8739367,0.09685637,0.0011361869],"about_ca_topic_score_codex":0.000026038893,"about_ca_topic_score_gemma":0.0000018371753,"teacher_disagreement_score":0.48809862,"about_ca_system_score_codex":0.00004879868,"about_ca_system_score_gemma":0.0000065134263,"threshold_uncertainty_score":0.87048733},"labels":[],"label_agreement":null},{"id":"W2765403799","doi":"10.1007/pl00011389","title":"The packing property","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Clutter; Matrix (chemical analysis); Disjoint sets; Incidence matrix; Vertex (graph theory); Set (abstract data type); Matching (statistics); Algorithm; Graph; Computer science; Radar","score_opus":0.008940437827761731,"score_gpt":0.19750033978610437,"score_spread":0.18855990195834263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765403799","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42674854,0.0021620307,0.022416685,0.00053878,0.0006264073,0.002088277,0.0000021283208,0.004182384,0.54123473],"genre_scores_gemma":[0.996053,0.000013409821,0.0012407462,0.000012723948,0.000075465534,0.00010117622,5.9470443e-7,0.00002998557,0.002472938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992099,0.000030990454,0.00021512042,0.00009067671,0.00013705599,0.00031627814],"domain_scores_gemma":[0.9995801,0.00010817366,0.000010253376,0.0002292713,0.000009909799,0.00006231802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858139,0.00011087568,0.000116122115,0.000012338282,0.00021465479,0.0001471353,0.0001699276,0.00004378407,0.00027447878],"category_scores_gemma":[0.000026801587,0.000053310778,0.00006633321,0.00012392174,0.00007013761,0.00006381506,0.000009707261,0.00013141487,0.0006276844],"study_design_candidate":"design_other","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.000004260548,0.000023559682,0.000017853983,0.00014226483,0.000031576266,0.0000055808937,0.0005427032,0.00014303465,0.00012092192,0.03166063,0.0003329089,0.9669747],"study_design_scores_gemma":[0.00025494507,0.000050872583,0.00003161365,0.00023443233,0.000029860435,0.00008778555,0.0006346258,0.044835526,0.0008949037,0.08978018,0.8627369,0.00042837652],"about_ca_topic_score_codex":8.428077e-7,"about_ca_topic_score_gemma":0.0000011266678,"teacher_disagreement_score":0.96654636,"about_ca_system_score_codex":0.000013183948,"about_ca_system_score_gemma":0.0000025203665,"threshold_uncertainty_score":0.80678225},"labels":[],"label_agreement":null},{"id":"W2768140828","doi":"10.1007/s10107-017-1209-5","title":"Robust multicategory support vector machines using difference convex algorithm","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Information and Intelligent Systems; National Science Foundation; National Institutes of Health; National Cancer Institute; Division of Mathematical Sciences; National Institute of General Medical Sciences","keywords":"Support vector machine; Outlier; Mathematics; Hinge loss; Consistency (knowledge bases); Algorithm; Generalization; Binary classification; Convex optimization; Mathematical optimization; Robustness (evolution); Artificial intelligence; Regular polygon; Machine learning; Computer science","score_opus":0.06823648029563915,"score_gpt":0.28592084729032474,"score_spread":0.21768436699468557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768140828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07583026,0.000084691004,0.91900486,0.000049828453,0.00025875072,0.00039598026,0.000003943713,0.0014349512,0.0029367646],"genre_scores_gemma":[0.7112708,0.0000042579118,0.28846103,0.000013018019,0.000104077895,0.000020771473,0.000002903547,0.000048492777,0.000074660515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988717,0.000016368886,0.00028028517,0.00022355901,0.0001994976,0.0004086208],"domain_scores_gemma":[0.9990252,0.000068944224,0.00007739853,0.00065599085,0.000049007238,0.00012341556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014248682,0.00024097865,0.00033731302,0.00005051563,0.00029507716,0.00034083452,0.0004052931,0.000111701585,0.00008717952],"category_scores_gemma":[0.00011789727,0.00021007769,0.00009195633,0.000037362446,0.00017874727,0.00013926045,0.00014233899,0.00022873965,0.000054057626],"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.000007646154,0.0002448364,0.00062214246,0.00043482997,0.00017009383,0.0002079212,0.00063130306,0.0005317206,0.017590694,0.005808074,0.00027770535,0.973473],"study_design_scores_gemma":[0.00018375892,0.0000306751,0.00046820394,0.0001608955,0.000050201394,0.000057204183,0.000033132834,0.9815401,0.0092761535,0.0073296535,0.0005136557,0.00035637285],"about_ca_topic_score_codex":0.000019810157,"about_ca_topic_score_gemma":0.0000017566184,"teacher_disagreement_score":0.98100835,"about_ca_system_score_codex":0.00003618501,"about_ca_system_score_gemma":0.000010830063,"threshold_uncertainty_score":0.856672},"labels":[],"label_agreement":null},{"id":"W2790916376","doi":"10.1007/s10107-020-01483-4","title":"Computing the nucleolus of weighted cooperative matching games in polynomial time","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Mathematics; Matching (statistics); Time complexity; Polynomial; Combinatorics; Theoretical computer science; Algorithm; Mathematical optimization; Computer science; Mathematical analysis; Statistics","score_opus":0.02933425322872214,"score_gpt":0.2293112564682024,"score_spread":0.19997700323948028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790916376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9602081,0.00027075806,0.025197402,0.0014540865,0.00007563637,0.0005695508,0.000009892024,0.000086133514,0.012128402],"genre_scores_gemma":[0.9954814,7.336995e-7,0.0041561397,0.00012750784,0.000093489914,0.0000079217325,0.0000018185505,0.000020210231,0.000110790534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862224,0.0000639518,0.00077966944,0.00023214963,0.000044452245,0.00025754631],"domain_scores_gemma":[0.99916,0.00032503987,0.00028475322,0.0001538056,0.000016272486,0.00006010935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010515994,0.00012794489,0.0004850995,0.000051809853,0.00008036228,0.00007217193,0.00025391023,0.0000615096,0.0001878596],"category_scores_gemma":[0.0003020912,0.00010378962,0.000089983434,0.00027690138,0.00010495458,0.00007878118,0.000095449635,0.00020940688,0.00048548705],"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.00006657346,0.00028754753,0.003212809,0.0005905534,0.00010968109,0.000012187014,0.043577183,0.00035624512,0.0004873493,0.940377,0.00017778263,0.010745091],"study_design_scores_gemma":[0.0038301095,0.000769597,0.0019845178,0.0012370339,0.000051334417,0.0000464553,0.009789056,0.7250158,0.0018693953,0.23957023,0.014254132,0.0015823037],"about_ca_topic_score_codex":0.000026050086,"about_ca_topic_score_gemma":0.000001074813,"teacher_disagreement_score":0.7246596,"about_ca_system_score_codex":0.00002407861,"about_ca_system_score_gemma":0.000008528184,"threshold_uncertainty_score":0.6240116},"labels":[],"label_agreement":null},{"id":"W2798368826","doi":"10.1007/s10107-020-01562-6","title":"Complete positivity and distance-avoiding sets","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Universidade de São Paulo; Fundação de Amparo à Pesquisa do Estado de São Paulo; Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Cone (formal languages); Mathematics; Regular polygon; Euclidean distance; Euclidean space; Dual cone and polar cone; Characterization (materials science); Space (punctuation); Euclidean geometry; Convex cone; Combinatorics; Convex optimization; Convex set; Mathematical optimization; Computer science; Algorithm; Geometry; Physics","score_opus":0.14621784235310284,"score_gpt":0.35620123961728145,"score_spread":0.2099833972641786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798368826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06990939,0.0010637842,0.91587275,0.0026930647,0.00026485955,0.0018372813,0.00025082362,0.000968572,0.007139503],"genre_scores_gemma":[0.81114936,0.000028843268,0.18804312,0.000116799456,0.00019155731,0.00016556671,0.000050982562,0.00009218952,0.00016159962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970127,0.00017589224,0.000847577,0.0007353347,0.00059557986,0.00063295267],"domain_scores_gemma":[0.9965614,0.0021100892,0.00040885538,0.00050455244,0.00012541341,0.00028966193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011831109,0.00054662215,0.0011453585,0.00014291903,0.00028590445,0.0005101009,0.00037471575,0.00031622173,0.00007209135],"category_scores_gemma":[0.0036375825,0.00048216517,0.00023022461,0.0003014942,0.00019839901,0.00012097014,0.0014170593,0.0012515024,0.000036868812],"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.000035840698,0.00032627955,0.00009679596,0.027358696,0.00026407713,0.000096250784,0.0066021415,0.0000020070204,0.000052745658,0.930317,0.00053346204,0.034314714],"study_design_scores_gemma":[0.00024074325,0.00006952502,0.000011592898,0.0011316611,0.00018316455,0.000048346497,0.00096011645,0.004764652,0.00006116932,0.98909056,0.002854248,0.00058421755],"about_ca_topic_score_codex":0.000013349039,"about_ca_topic_score_gemma":0.0000047302083,"teacher_disagreement_score":0.74123996,"about_ca_system_score_codex":0.000082513325,"about_ca_system_score_gemma":0.00005922532,"threshold_uncertainty_score":0.999763},"labels":[],"label_agreement":null},{"id":"W2885926928","doi":"10.1007/s10107-019-01424-w","title":"Mixed-integer bilevel representability","year":2019,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Water resources management and optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Office of Naval Research; National Science Foundation","keywords":"Integer (computer science); Mathematics; Polyhedron; Regular polygon; Bilevel optimization; Complementarity (molecular biology); Discrete mathematics; Combinatorics; Mathematical optimization; Computer science; Optimization problem","score_opus":0.03528291572930669,"score_gpt":0.237929916931241,"score_spread":0.2026470012019343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885926928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023780288,0.00018431905,0.94326407,0.00008233734,0.0008116233,0.0016688431,0.000007456582,0.0015827516,0.028618338],"genre_scores_gemma":[0.9304126,0.0000144838905,0.06751344,0.00001599838,0.00020650637,0.00021113205,0.00012241575,0.00013684107,0.0013666112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825996,0.000039752817,0.00051567995,0.0004399637,0.00032881735,0.00041584123],"domain_scores_gemma":[0.99885005,0.00008087731,0.00007284063,0.00086145947,0.0000419968,0.00009280653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003805127,0.00035689987,0.00046280562,0.00011990982,0.00003799633,0.00029162123,0.0004056597,0.0002803768,0.00024919183],"category_scores_gemma":[0.0000853234,0.00031732378,0.00021184204,0.00012066698,0.000054016888,0.00008330141,0.00069006387,0.00053403695,0.00052062067],"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.000016614775,0.00037089133,0.0015064378,0.017604645,0.00050838897,0.000023639195,0.0018927597,0.891954,0.000038185703,0.0059527988,0.0054274504,0.07470417],"study_design_scores_gemma":[0.00019731995,0.000018106513,0.000092050264,0.00043511635,0.000111133326,0.000002622394,0.00011340775,0.961864,0.0004353071,0.021368941,0.014747105,0.0006148823],"about_ca_topic_score_codex":0.0000052060836,"about_ca_topic_score_gemma":0.000001468609,"teacher_disagreement_score":0.9066323,"about_ca_system_score_codex":0.00010041711,"about_ca_system_score_gemma":0.000007960935,"threshold_uncertainty_score":0.9999279},"labels":[],"label_agreement":null},{"id":"W2895703110","doi":"10.1007/s10107-018-1336-7","title":"Faster algorithms for extensive-form game solving via improved smoothing functions","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Army Research Laboratory; Directorate for Engineering; Directorate for Computer and Information Science and Engineering; Facebook","keywords":"Regret; Game tree; Mathematics; Smoothing; Weighting; Rate of convergence; Mathematical optimization; Logarithm; Entropy (arrow of time); Algorithm; Function (biology); Computer science; Game theory; Mathematical economics; Sequential game; Statistics","score_opus":0.1317707157070351,"score_gpt":0.4261131786377163,"score_spread":0.2943424629306812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895703110","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028290444,0.000050468207,0.99360424,0.00058544165,0.00047452754,0.0013749446,0.000009730445,0.00022992263,0.000841695],"genre_scores_gemma":[0.2623493,0.0000013326346,0.7263937,0.000261457,0.0014702633,0.0006424423,0.000010406901,0.000115223535,0.008755862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952096,0.000087543616,0.001105293,0.0009087172,0.0015232518,0.0011656182],"domain_scores_gemma":[0.9938582,0.003024926,0.0002868342,0.0009133226,0.0015660824,0.0003505881],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036293776,0.00031756572,0.0005688661,0.00035532026,0.0007028071,0.0008908658,0.00085440767,0.00017461398,0.00067623414],"category_scores_gemma":[0.009800911,0.00022819737,0.00030865837,0.00090036343,0.0005880416,0.00082551077,0.00042823784,0.00036995503,0.0012968],"study_design_candidate":"design_other","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.00004699783,0.00015463968,0.000019202937,0.000047231322,0.000036508154,0.000006382468,0.001550554,0.000009923167,0.0014575609,0.0005845891,0.0005154424,0.99557096],"study_design_scores_gemma":[0.0009497763,0.0006786409,0.000058479618,0.00008727766,0.000036880865,0.00007006526,0.002707691,0.6483694,0.0019388576,0.27940044,0.065201744,0.0005007818],"about_ca_topic_score_codex":0.0000064645847,"about_ca_topic_score_gemma":0.000012962341,"teacher_disagreement_score":0.99507016,"about_ca_system_score_codex":0.00012164474,"about_ca_system_score_gemma":0.00007151896,"threshold_uncertainty_score":0.9994808},"labels":[],"label_agreement":null},{"id":"W2897413842","doi":"10.1007/s10107-022-01775-x","title":"Nonlinear acceleration of momentum and primal-dual algorithms","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SAIT Polytechnic","funders":"Agence Nationale de la Recherche; Defense Advanced Research Projects Agency; U.S. Department of Defense","keywords":"Iterated function; Mathematics; Acceleration; Numerical analysis; Operator (biology); Momentum (technical analysis); Convergence (economics); Nonlinear system; Applied mathematics; Algorithm; Interior point method; Rate of convergence; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.06656881159893424,"score_gpt":0.36403268006520184,"score_spread":0.2974638684662676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897413842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07321976,0.0001456774,0.92112714,0.0007197604,0.000103881124,0.0022051781,0.000038321916,0.00032679914,0.0021134722],"genre_scores_gemma":[0.039817855,0.000006713232,0.9589907,0.000019504841,0.000050145787,0.00027775025,0.000020398187,0.00005009134,0.0007668334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979607,0.000105585095,0.00051998085,0.00026796802,0.0008199801,0.00032577655],"domain_scores_gemma":[0.99890757,0.0004258312,0.00017609893,0.0002598239,0.00012164091,0.0001090198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087653205,0.00015086187,0.00030981362,0.00013173574,0.00026101602,0.00005896587,0.000175153,0.000043304735,0.00067628344],"category_scores_gemma":[0.0005870504,0.0001436633,0.000058138034,0.00036786302,0.0001322507,0.00014978876,0.00045406795,0.0002908379,0.0000061062065],"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.00018855839,0.0062546106,0.00023204635,0.003142488,0.00033004247,0.00009571332,0.009990496,0.0016137697,0.0038123727,0.4427434,0.0007777506,0.53081876],"study_design_scores_gemma":[0.0020832145,0.00091537373,0.000012838037,0.00007807614,0.00008840954,0.00017706715,0.005085,0.62258506,0.0064653545,0.3544323,0.0074481354,0.0006291666],"about_ca_topic_score_codex":0.0000014858279,"about_ca_topic_score_gemma":2.9164934e-7,"teacher_disagreement_score":0.62097126,"about_ca_system_score_codex":0.00007911004,"about_ca_system_score_gemma":0.00004205451,"threshold_uncertainty_score":0.740483},"labels":[],"label_agreement":null},{"id":"W2901475388","doi":"10.1007/s10107-020-01524-y","title":"Approximate multi-matroid intersection via iterative refinement","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Matroid; Rounding; Matroid partitioning; Mathematics; Weighted matroid; Combinatorics; Knapsack problem; Relaxation (psychology); Polytope; Cardinality (data modeling); Intersection (aeronautics); Mathematical optimization; Discrete mathematics; Graphic matroid; Computer science","score_opus":0.04079817346689619,"score_gpt":0.2750983584804017,"score_spread":0.23430018501350552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901475388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029513137,0.00003216836,0.9940331,0.0018632403,0.000100993195,0.00032510364,4.790603e-7,0.00028739645,0.0004062275],"genre_scores_gemma":[0.43733245,5.16001e-7,0.56208324,0.00038319398,0.000080082784,0.00005439018,0.0000065443514,0.0000068390264,0.000052734333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988469,0.00005137876,0.00030123527,0.00033411843,0.00025385723,0.00021249743],"domain_scores_gemma":[0.99947083,0.00006857453,0.000083553314,0.00016184067,0.00007798497,0.0001372016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021729233,0.00013493586,0.00015484043,0.00005557084,0.00012402545,0.00024225445,0.00026095755,0.000037439386,0.000039025337],"category_scores_gemma":[0.0001257823,0.000117913456,0.00007232872,0.0003962072,0.000024256726,0.00032769638,0.00017600856,0.0001219815,0.0001614949],"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.000024726689,0.0005980972,0.000027739348,0.00037974998,0.00007639175,0.000026474188,0.01092822,0.001976815,0.010364097,0.21024105,0.0004100045,0.76494664],"study_design_scores_gemma":[0.00031992435,0.0001746941,0.000015236,0.000025309955,0.000007682154,0.000017392562,0.000082462655,0.9843763,0.004028781,0.007406012,0.0033813673,0.00016483532],"about_ca_topic_score_codex":9.94075e-7,"about_ca_topic_score_gemma":5.999458e-7,"teacher_disagreement_score":0.98239946,"about_ca_system_score_codex":0.00004280895,"about_ca_system_score_gemma":0.000018331897,"threshold_uncertainty_score":0.4808371},"labels":[],"label_agreement":null},{"id":"W2915050298","doi":"10.1007/s10107-021-01663-w","title":"Status determination by interior-point methods for convex optimization problems in domain-driven form","year":2021,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Conic section; Conic optimization; Duality (order theory); Mathematical optimization; Domain (mathematical analysis); Context (archaeology); Dual (grammatical number); Duality gap; Regular polygon; Interior point method; Computer science; Point (geometry); Convex optimization; Mathematics; Effective domain; Optimization problem; Convex analysis; Discrete mathematics; Geometry","score_opus":0.07236776562694941,"score_gpt":0.4375472251117842,"score_spread":0.36517945948483477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915050298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059508986,0.0002130014,0.9918211,0.00024966436,0.00018151657,0.006238757,0.00003373328,0.00028215072,0.00038500485],"genre_scores_gemma":[0.0011062409,0.00008287248,0.9931339,0.000032733842,0.00004888059,0.0045389603,0.00057459844,0.00021683465,0.0002649644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950096,0.00046476407,0.0017523589,0.0010452344,0.00062020525,0.0011078274],"domain_scores_gemma":[0.99539936,0.0020396053,0.0007414007,0.0008227923,0.0007093249,0.0002875094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023220466,0.0006323424,0.0012839166,0.0004037445,0.00015131017,0.00058710494,0.0005333888,0.0006685312,0.0002762281],"category_scores_gemma":[0.0049182046,0.00063096656,0.00032966209,0.00048055223,0.00019140636,0.00038001544,0.0010269742,0.0010195005,0.0000049347445],"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.00016967942,0.0034528023,0.00011116197,0.037562214,0.00052390713,0.000045212688,0.03124981,0.0946225,0.001044817,0.021465635,0.00037580245,0.8093765],"study_design_scores_gemma":[0.0010100969,0.00010991408,5.9506334e-7,0.0011753994,0.000058863512,0.000011448343,0.0011942909,0.7678319,0.0005202911,0.22686444,0.0006668644,0.00055584667],"about_ca_topic_score_codex":0.00000768951,"about_ca_topic_score_gemma":0.00001516532,"teacher_disagreement_score":0.8088206,"about_ca_system_score_codex":0.00087813305,"about_ca_system_score_gemma":0.00023787397,"threshold_uncertainty_score":0.9996142},"labels":[],"label_agreement":null},{"id":"W2942945535","doi":"10.1007/s10107-020-01499-w","title":"An efficient characterization of submodular spanning tree games","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":7,"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; Government of Ontario","keywords":"Submodular set function; Shapley value; Characterization (materials science); Mathematics; Game tree; Convexity; Spanning tree; Mathematical economics; Game theory; Time complexity; Tree (set theory); Computer science; Combinatorics; Mathematical optimization; Sequential game","score_opus":0.04265392892600052,"score_gpt":0.2336976143079176,"score_spread":0.19104368538191707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942945535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79982644,0.000037586753,0.19843188,0.00016556527,0.00003841194,0.0002142285,0.0000074744817,0.00007853038,0.0011998774],"genre_scores_gemma":[0.99522704,5.256421e-7,0.004558144,0.000046428253,0.00008663593,0.000015826256,0.000011582706,0.000020986392,0.000032847503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989028,0.000026503249,0.0005834031,0.00024332675,0.000045157874,0.00019881206],"domain_scores_gemma":[0.99935645,0.00003527924,0.0002935725,0.00018967819,0.000019888323,0.000105127074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061591814,0.00010456136,0.00036012183,0.000055155786,0.000044724606,0.000054254033,0.00016462081,0.000057560537,0.00010694469],"category_scores_gemma":[0.00021476204,0.000108551205,0.00007851737,0.00018158575,0.000049074653,0.000086041306,0.000027019307,0.000080115286,0.00018198977],"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.000026211077,0.00040788902,0.006486933,0.00088720425,0.00004438571,0.000004616429,0.0094262585,0.00026114966,0.011906961,0.9574729,0.0000027288488,0.013072767],"study_design_scores_gemma":[0.0016865126,0.001211166,0.012305787,0.00068430626,0.00005266996,0.000018541696,0.0020381836,0.88336766,0.017402738,0.07297221,0.006943163,0.0013170586],"about_ca_topic_score_codex":0.0000026820146,"about_ca_topic_score_gemma":7.770446e-8,"teacher_disagreement_score":0.8845007,"about_ca_system_score_codex":0.000012343778,"about_ca_system_score_gemma":0.000003679732,"threshold_uncertainty_score":0.44265896},"labels":[],"label_agreement":null},{"id":"W2949889202","doi":"10.1007/s10107-019-01394-z","title":"The matching augmentation problem: a $$\\frac{7}{4}$$-approximation algorithm","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Matching (statistics); Zero (linguistics); Cover (algebra); Approx; Reduction (mathematics)","score_opus":0.014087274261470255,"score_gpt":0.25610141803367553,"score_spread":0.2420141437722053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949889202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035935694,0.00005472006,0.9913352,0.00089930557,0.00021308823,0.00086571823,5.187834e-7,0.00035137084,0.0026865192],"genre_scores_gemma":[0.052594103,0.0000029225314,0.94657874,0.00009053049,0.000059117756,0.00015143908,0.0000044020535,0.000016313976,0.00050240697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981881,0.000086042266,0.00041058194,0.00035428992,0.00052488426,0.00043611097],"domain_scores_gemma":[0.9987402,0.00039814803,0.0001480099,0.00056013674,0.00007112342,0.00008237363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010160891,0.00017123393,0.00017976867,0.00006443233,0.00044876576,0.00088587985,0.00081934454,0.000058439757,0.000030137397],"category_scores_gemma":[0.000039751576,0.00011948214,0.00010900422,0.00037795134,0.00007400921,0.00061260804,0.00030041026,0.00023474383,0.00039158663],"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":[9.524015e-7,0.000054398173,0.0000063148213,0.000055998506,0.000011727699,0.0000013976309,0.00086324447,0.000008805092,0.000047363526,0.4790004,0.000018077133,0.5199313],"study_design_scores_gemma":[0.00021849085,0.000053956905,0.00002474138,0.000072197756,0.000006415373,0.000025578274,0.00023630161,0.30544412,0.0002055766,0.6913245,0.0022209904,0.00016717018],"about_ca_topic_score_codex":0.0000074741642,"about_ca_topic_score_gemma":0.0000011206113,"teacher_disagreement_score":0.5197642,"about_ca_system_score_codex":0.00005026421,"about_ca_system_score_gemma":0.000027693764,"threshold_uncertainty_score":0.854256},"labels":[],"label_agreement":null},{"id":"W2962957542","doi":"10.1007/s10107-016-1076-5","title":"On Douglas–Rachford operators that fail to be proximal mappings","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Applied mathematics; Calculus (dental); Algebra over a field; Discrete mathematics; Pure mathematics; Medicine","score_opus":0.031589104429154816,"score_gpt":0.26139512255558955,"score_spread":0.22980601812643475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962957542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00402372,0.0000028728089,0.975769,0.017097497,0.00007418639,0.0003012892,0.0000011978913,0.00022950051,0.0025007366],"genre_scores_gemma":[0.5055436,9.3668535e-7,0.49007067,0.0020257514,0.000062456886,0.0001261002,0.0000017912998,0.00001667459,0.0021520194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985345,0.000041008534,0.00025826955,0.00037496997,0.0004708241,0.00032044918],"domain_scores_gemma":[0.9990464,0.00021892502,0.000064225525,0.00038003788,0.00009059315,0.00019981423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037188936,0.00015517208,0.00019552466,0.00013688741,0.00014437857,0.00033399733,0.00053675094,0.000054214077,0.0002297293],"category_scores_gemma":[0.00031811662,0.00009330992,0.000098290475,0.00047279653,0.000030477304,0.0003758789,0.00021056102,0.00006595891,0.00058657845],"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.0000058602186,0.00014811837,0.00007786941,0.00002196802,0.000030518117,0.000004238634,0.0008780597,0.00005072656,0.00009149356,0.9241803,0.0005610126,0.07394983],"study_design_scores_gemma":[0.0038668097,0.0016511437,0.0008314552,0.0010516709,0.00015615315,0.0000686794,0.0008108297,0.35195643,0.008173712,0.34821647,0.2799614,0.0032552404],"about_ca_topic_score_codex":0.0000022656866,"about_ca_topic_score_gemma":0.0000012133361,"teacher_disagreement_score":0.57596385,"about_ca_system_score_codex":0.000054372827,"about_ca_system_score_gemma":0.00002663729,"threshold_uncertainty_score":0.7539475},"labels":[],"label_agreement":null},{"id":"W2963292690","doi":"10.1007/s10107-013-0714-4","title":"Iterative hard thresholding methods for $$l_0$$ l 0 regularized convex cone programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Regular polygon; Convex optimization; Relaxation (psychology); Mathematical optimization; Quadratic programming; Sequence (biology); Convex cone; Cone (formal languages); Thresholding; Iterative method; Limit point; Interior point method; Applied mathematics; Algorithm; Convex analysis; Computer science; Mathematical analysis; Geometry; Image (mathematics); Artificial intelligence","score_opus":0.04073664706120077,"score_gpt":0.3230238328338438,"score_spread":0.282287185772643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963292690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117355315,0.00031951763,0.98167527,0.00016829063,0.0001527591,0.0025731656,0.0000015001249,0.0021338367,0.001240128],"genre_scores_gemma":[0.15569396,0.0000046788855,0.84251213,0.000067969435,0.00010446673,0.0013452799,0.000011154721,0.0000965716,0.000163793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981271,0.00007484083,0.0005585021,0.00035680307,0.00018577468,0.0006969985],"domain_scores_gemma":[0.9985779,0.00054478843,0.00008887814,0.0004222436,0.00019261069,0.00017358945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000588803,0.00036060237,0.0006114008,0.00011510987,0.00017595933,0.00048499694,0.00026491354,0.00018762282,0.000107249034],"category_scores_gemma":[0.00030521041,0.0003169203,0.0002090611,0.00021943005,0.00013819893,0.0003031024,0.000086926164,0.00027751215,0.000056435656],"study_design_candidate":"design_other","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.000015541817,0.0001307675,0.000018356568,0.0005191463,0.0002516009,0.0000067825536,0.0012619648,0.00006991094,0.08173627,0.028343124,0.0016134786,0.88603306],"study_design_scores_gemma":[0.0011230162,0.00025235745,0.000021859041,0.00082045264,0.00017001682,0.00005833486,0.000649845,0.56958055,0.20829746,0.16543913,0.052460562,0.0011264466],"about_ca_topic_score_codex":0.0000058181745,"about_ca_topic_score_gemma":3.6032264e-7,"teacher_disagreement_score":0.8849066,"about_ca_system_score_codex":0.00006321763,"about_ca_system_score_gemma":0.000011744994,"threshold_uncertainty_score":0.9999283},"labels":[],"label_agreement":null},{"id":"W2964079700","doi":"10.1007/s10107-019-01415-x","title":"Applying FISTA to optimization problems (with or) without minimizers","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Lipschitz continuity; Mathematics; Optimization problem; Mathematical optimization; Convex optimization; Regular polygon; Convex function; Applied mathematics; Pure mathematics; Geometry","score_opus":0.01672202299360147,"score_gpt":0.23306028219381705,"score_spread":0.21633825920021557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964079700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027040027,0.00001844602,0.9625617,0.000040347833,0.000047576108,0.002011883,5.371465e-7,0.0015108796,0.0067685815],"genre_scores_gemma":[0.51242733,0.0000014636721,0.48688245,0.000045911896,0.00002235113,0.00033189062,0.0000030748802,0.000055718723,0.00022979654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907064,0.0000112584485,0.00021263836,0.00019819633,0.00020149302,0.00030578385],"domain_scores_gemma":[0.99949443,0.000056859684,0.000028745524,0.0002822624,0.000040049777,0.0000976308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010450685,0.0001786331,0.000259233,0.000076744465,0.000040309547,0.000117760734,0.00013608803,0.00006364758,0.00010906289],"category_scores_gemma":[0.000024460935,0.00012831137,0.000033161323,0.00022984376,0.000020808204,0.00009192918,0.000039902643,0.00011710827,0.000102129845],"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.00012602017,0.0001947019,0.0009867864,0.0012676755,0.00017607167,0.000029731364,0.002371797,0.87640816,0.0036924758,0.0023890336,0.0010262517,0.1113313],"study_design_scores_gemma":[0.00039067405,0.00022931679,0.000004640488,0.0008471286,0.000036691887,0.00003871481,0.00032617545,0.9826768,0.003632992,0.0006241821,0.010728113,0.0004645638],"about_ca_topic_score_codex":0.0000025314139,"about_ca_topic_score_gemma":0.000001797488,"teacher_disagreement_score":0.4853873,"about_ca_system_score_codex":0.0000373744,"about_ca_system_score_gemma":0.00000850667,"threshold_uncertainty_score":0.52323854},"labels":[],"label_agreement":null},{"id":"W2972742046","doi":"10.1007/s10107-019-01433-9","title":"Multi-marginal maximal monotonicity and convex analysis","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Mathematics; Regular polygon; Monotone polygon; Convex function; Subderivative; Applied mathematics; Partition (number theory); Convex analysis; Mathematical optimization; Convex optimization; Combinatorics; Mathematical analysis","score_opus":0.04962716304346301,"score_gpt":0.3250867084868065,"score_spread":0.2754595454433435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972742046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8108519,0.00019622194,0.18511415,0.00016232378,0.00004263542,0.00062471855,0.0000069887074,0.0002437333,0.0027573423],"genre_scores_gemma":[0.7861271,0.0000058098817,0.21211895,0.000041669668,0.000015958065,0.000043408923,0.000004360871,0.000023072636,0.0016196432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998251,0.000047604583,0.0004987829,0.0003635721,0.00035891266,0.00048011448],"domain_scores_gemma":[0.9984928,0.00075490697,0.00015732065,0.00035083137,0.000098210316,0.00014596806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008659073,0.00023303616,0.00066879403,0.00028988643,0.00009390624,0.00016181669,0.000182318,0.00011643195,0.0006726171],"category_scores_gemma":[0.00056819106,0.000186669,0.00019252009,0.00087558874,0.00009967241,0.00017023162,0.00015191824,0.00021162334,0.00013826926],"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.00007900281,0.0013049376,0.01575799,0.0046371357,0.0016676299,0.00003497726,0.0038762845,0.000012958307,0.00016938664,0.93666834,0.000098631484,0.035692714],"study_design_scores_gemma":[0.0033419887,0.0005471155,0.002497158,0.00031511436,0.0025808765,0.0001506467,0.005606256,0.16725829,0.0010190804,0.8075758,0.007324042,0.0017836227],"about_ca_topic_score_codex":0.000016654496,"about_ca_topic_score_gemma":0.0000056153344,"teacher_disagreement_score":0.16724533,"about_ca_system_score_codex":0.000032171785,"about_ca_system_score_gemma":0.000020862832,"threshold_uncertainty_score":0.76121414},"labels":[],"label_agreement":null},{"id":"W2980007075","doi":"10.1007/s10107-021-01723-1","title":"The aggregation closure is polyhedral for packing and covering integer programs","year":2021,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Closure (psychology); Intersection (aeronautics); Generalization; Combinatorics; Polyhedron; Integer (computer science); Mathematics; Computer science; Political science; Geography; Mathematical analysis; Law","score_opus":0.039457364235447955,"score_gpt":0.2967326560548221,"score_spread":0.25727529181937414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980007075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029316382,0.0006170176,0.99075043,0.0033031236,0.0002372739,0.0017137338,0.0000015049181,0.0002471439,0.00019813993],"genre_scores_gemma":[0.3013726,0.00008442937,0.6969268,0.0001924854,0.0001347948,0.00094652484,0.0000318281,0.00004776981,0.0002628003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978416,0.0000927394,0.00049745594,0.0006065757,0.00043326686,0.00052835734],"domain_scores_gemma":[0.99838233,0.00038544385,0.00021734326,0.00064936513,0.00021936532,0.00014617984],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010924835,0.0002706733,0.00032709775,0.00005660876,0.0004554683,0.003804644,0.00069485704,0.00021627924,0.000006263294],"category_scores_gemma":[0.00036410353,0.00019587405,0.00018614189,0.00020871016,0.00013967889,0.00027661512,0.0014296576,0.00049987115,0.000004144748],"study_design_candidate":"design_other","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.000006591615,0.00012872361,0.00018507836,0.0013439466,0.000103376944,0.0000062081563,0.0072934236,0.00013787327,0.000009081311,0.12692975,0.00005582103,0.8638001],"study_design_scores_gemma":[0.00041363956,0.00012849845,0.00002492128,0.0013611034,0.000039427778,0.000026488555,0.0005846585,0.8257529,0.00027030782,0.16465646,0.0062264213,0.0005151748],"about_ca_topic_score_codex":0.000007095594,"about_ca_topic_score_gemma":0.0000069781454,"teacher_disagreement_score":0.86328495,"about_ca_system_score_codex":0.000056540892,"about_ca_system_score_gemma":0.00011423893,"threshold_uncertainty_score":0.9972295},"labels":[],"label_agreement":null},{"id":"W2984785540","doi":"10.1007/s10107-019-01447-3","title":"Nonlinear chance-constrained problems with applications to hydro scheduling","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematical optimization; Solver; Mathematics; Nonlinear programming; Nonlinear system; Integer programming; Scheduling (production processes)","score_opus":0.051191507727888726,"score_gpt":0.3425473852442398,"score_spread":0.29135587751635106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984785540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08797263,0.00002101192,0.89842016,0.0006925909,0.000043077238,0.0020847926,0.0000030024826,0.00015319185,0.01060952],"genre_scores_gemma":[0.4167415,0.000003032838,0.5812908,0.00011217215,0.00007611978,0.00032533414,0.000007027375,0.000023701761,0.0014203711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754685,0.00003906001,0.00060532964,0.00051092147,0.0009182129,0.0003796276],"domain_scores_gemma":[0.99834865,0.00037473752,0.00018396607,0.0006253026,0.00024505812,0.00022227189],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013097302,0.00017258414,0.0003292655,0.00019307437,0.00013599322,0.00036735178,0.00044912478,0.000074887714,0.00028730545],"category_scores_gemma":[0.0003528038,0.00011345148,0.000073228606,0.0012309349,0.00007376728,0.00022781605,0.00008343454,0.00014323439,0.0029525654],"study_design_candidate":"design_other","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.00005984812,0.00072784774,0.005012835,0.0001342406,0.00005913882,0.0000072271614,0.0028873445,0.03750047,0.0008771708,0.08797477,0.0000739575,0.8646851],"study_design_scores_gemma":[0.0018250946,0.0010673325,0.00015918197,0.0005065783,0.000089778216,0.00011960609,0.0029226374,0.6215347,0.0019374434,0.16716677,0.20121963,0.00145125],"about_ca_topic_score_codex":0.0000024178632,"about_ca_topic_score_gemma":0.0000036049116,"teacher_disagreement_score":0.86323386,"about_ca_system_score_codex":0.00001940111,"about_ca_system_score_gemma":0.00005393884,"threshold_uncertainty_score":0.9978238},"labels":[],"label_agreement":null},{"id":"W2988554220","doi":"10.1007/s10107-025-02219-y","title":"Polyhedral Newton-min algorithms for complementarity problems","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"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; Mitacs","keywords":"Mathematics; Polyhedron; Epigraph; Quadratic growth; Descent direction; Convex function; Newton's method; Function (biology); Newton's method in optimization; Nonlinear complementarity problem; Regular polygon; Zero (linguistics); Monotonic function; Sequence (biology); Interior point method; Local convergence; Nonlinear system; Applied mathematics; Complementarity theory; Mathematical optimization; Algorithm; Gradient descent; Iterative method; Mathematical analysis; Computer science; Combinatorics; Geometry","score_opus":0.13136913583828114,"score_gpt":0.44437871135796164,"score_spread":0.3130095755196805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988554220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048629305,0.00006463925,0.9912712,0.0020219672,0.00011465069,0.0030858559,0.000020094969,0.0003882407,0.0025470345],"genre_scores_gemma":[0.003511075,0.0000034505993,0.98861927,0.00013821285,0.000085807864,0.0011384579,0.000035041183,0.00006139587,0.0064072674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733543,0.0000745268,0.0007955032,0.000485362,0.00048118114,0.00082799804],"domain_scores_gemma":[0.9974867,0.0014123368,0.00014659499,0.0005081289,0.00027450235,0.00017173121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009842471,0.0002986485,0.00051922695,0.00020704685,0.00036432635,0.00019278064,0.00044247598,0.0001318862,0.00028309223],"category_scores_gemma":[0.0016258575,0.0002688559,0.0001968126,0.0005671093,0.00019464166,0.00018893738,0.00025937468,0.00029529037,0.000033969372],"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.000040189596,0.0011099123,0.000085067055,0.002250091,0.00017366285,0.000004852772,0.000592157,0.00009849335,0.00012082659,0.83899736,0.0040211277,0.15250623],"study_design_scores_gemma":[0.001416338,0.00012568047,0.000008434148,0.00023921554,0.00006973285,0.000007049889,0.00046092467,0.13113712,0.0006001068,0.83307344,0.032538835,0.00032311483],"about_ca_topic_score_codex":0.000009868727,"about_ca_topic_score_gemma":0.000013798732,"teacher_disagreement_score":0.15218312,"about_ca_system_score_codex":0.00018617001,"about_ca_system_score_gemma":0.00009487758,"threshold_uncertainty_score":0.99997634},"labels":[],"label_agreement":null},{"id":"W2990034365","doi":"10.1007/s10107-021-01691-6","title":"On generalized surrogate duality in mixed-integer nonlinear programming","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Institut de Valorisation des Données; Bundesministerium für Bildung und Forschung","keywords":"Relaxation (psychology); Integer programming; Generalization; Linear programming relaxation; Mathematical optimization; Integer (computer science); Duality (order theory); Linear programming; Set (abstract data type); Computer science; Nonlinear system; Nonlinear programming; Mathematics; Algorithm; Applied mathematics; Discrete mathematics","score_opus":0.07208214385825237,"score_gpt":0.38894071916496864,"score_spread":0.31685857530671624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990034365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093211204,0.00015042604,0.897089,0.0014685458,0.00025177232,0.002258996,0.000015450154,0.00085987826,0.0046947524],"genre_scores_gemma":[0.027018214,0.000011633276,0.9703106,0.00011472377,0.00010361461,0.00034398626,0.000043620777,0.00012642014,0.0019271648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583805,0.00042538173,0.0010330875,0.00071752415,0.0009809018,0.0010050342],"domain_scores_gemma":[0.9967213,0.0016691674,0.00018424993,0.0007771383,0.0003631376,0.00028496896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016013782,0.0003897456,0.0007282372,0.00020910309,0.0001620411,0.00023639872,0.00031946634,0.0002142753,0.0005987254],"category_scores_gemma":[0.007074185,0.00035155023,0.00022261085,0.0010845514,0.00017059203,0.00019922637,0.00026818013,0.0007088272,0.00021480802],"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.00016541962,0.0065550148,0.0002537475,0.0021761833,0.00018223768,0.0013142194,0.0020963799,0.0015578144,0.00031303428,0.76213115,0.00037726338,0.22287753],"study_design_scores_gemma":[0.0045048376,0.0002707714,0.000031901083,0.001139312,0.00007652095,0.0001712041,0.0018014001,0.19531159,0.00712576,0.7738548,0.014337681,0.0013742484],"about_ca_topic_score_codex":0.0000060969746,"about_ca_topic_score_gemma":0.00004177327,"teacher_disagreement_score":0.22150329,"about_ca_system_score_codex":0.00021473003,"about_ca_system_score_gemma":0.00012923437,"threshold_uncertainty_score":0.99989367},"labels":[],"label_agreement":null},{"id":"W3020603765","doi":"10.1007/s10107-020-01500-6","title":"Generalized monotone operators and their averaged resolvents","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Resolvent; Monotonic function; Monotone polygon; Operator (biology); Convergence (economics); Set (abstract data type); Scaling; Class (philosophy); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.02656643460086841,"score_gpt":0.24427471870919693,"score_spread":0.21770828410832851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020603765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009135985,0.00004456171,0.9853509,0.00477859,0.000014485597,0.00015209752,6.1542084e-7,0.00014942195,0.0003733284],"genre_scores_gemma":[0.55626404,0.0000058118535,0.4424324,0.0011579683,0.000036672245,0.000022344615,0.0000035004812,0.000008019138,0.0000692015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919254,0.00005257238,0.00021386234,0.0002434653,0.00014843929,0.00014913626],"domain_scores_gemma":[0.9995349,0.00006000394,0.000045243476,0.00014864895,0.00004405985,0.00016711926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016885581,0.0001031376,0.00017477645,0.000032401356,0.00011763315,0.00026052617,0.00024398495,0.000033839977,0.00006243225],"category_scores_gemma":[0.0001311722,0.00007500343,0.00005522288,0.0003321348,0.000022850087,0.00019825154,0.00016894565,0.000073291834,0.000044495573],"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.000009430123,0.00018383969,0.00025334512,0.00009381996,0.0001199728,0.00000931071,0.0066966573,0.00055598095,0.00056050223,0.91128397,0.00020085099,0.08003232],"study_design_scores_gemma":[0.00031698667,0.000034264613,0.000046792,0.000010023802,0.000009326686,0.0000032859891,0.00005647278,0.9831577,0.0004811057,0.013150865,0.0025978861,0.0001353023],"about_ca_topic_score_codex":0.0000018738284,"about_ca_topic_score_gemma":2.0445904e-7,"teacher_disagreement_score":0.9826017,"about_ca_system_score_codex":0.0000086047785,"about_ca_system_score_gemma":0.000012583858,"threshold_uncertainty_score":0.3058551},"labels":[],"label_agreement":null},{"id":"W3028209208","doi":"10.1007/s10107-020-01513-1","title":"Maximum edge-disjoint paths in planar graphs with congestion 2","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Cegep Edouard Montpetit","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Constant (computer programming); Discrete mathematics; Omega; Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Path (computing); Graph; Computer science","score_opus":0.033529464418315336,"score_gpt":0.27690856794063273,"score_spread":0.2433791035223174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028209208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018476635,0.00006674868,0.9772338,0.0023042567,0.000023029286,0.0006107511,7.977387e-7,0.00033250684,0.00095143105],"genre_scores_gemma":[0.6133837,0.0000026322798,0.38622874,0.00020881661,0.000021668795,0.00011319345,0.0000022028235,0.000022153583,0.00001687733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981723,0.00010198045,0.00029715747,0.00046256985,0.00044981425,0.000516196],"domain_scores_gemma":[0.9990202,0.00022359141,0.00006434351,0.00037632853,0.00005415705,0.00026134742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045709877,0.00017751458,0.0002655085,0.00011872198,0.0000775386,0.00016294868,0.0006358014,0.000060445218,0.000018941608],"category_scores_gemma":[0.00025498963,0.0001368194,0.00005450002,0.00093974295,0.00015810326,0.00036074797,0.00016491476,0.00034508793,0.000115330346],"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.000058951347,0.00022023304,0.00079173746,0.00025877918,0.000017714936,0.00029384723,0.0023284683,0.00007397134,0.00032620938,0.775732,0.000031645108,0.21986648],"study_design_scores_gemma":[0.0010930427,0.000830141,0.0003802928,0.0002546994,0.000009523955,0.00007872465,0.00047718396,0.06301403,0.0007908098,0.93101233,0.0015511981,0.0005080138],"about_ca_topic_score_codex":0.0000021689962,"about_ca_topic_score_gemma":0.000003825936,"teacher_disagreement_score":0.5949071,"about_ca_system_score_codex":0.00003173836,"about_ca_system_score_gemma":0.000034190933,"threshold_uncertainty_score":0.55793333},"labels":[],"label_agreement":null},{"id":"W3034534017","doi":"10.1007/s10107-020-01518-w","title":"On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Convergence (economics); Stochastic programming; Consistency (knowledge bases); Infinity; Optimization problem; Applied mathematics; Discrete mathematics","score_opus":0.022984888365795837,"score_gpt":0.24943939202105908,"score_spread":0.22645450365526323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034534017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009963091,0.0000086916125,0.9879543,0.00060273986,0.000010406294,0.00068371143,0.0000015094862,0.00031442128,0.00046110802],"genre_scores_gemma":[0.879783,8.6094e-8,0.119552754,0.0004055708,0.00010981837,0.000064737214,0.000019118786,0.000048794387,0.000016173562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986726,0.000014558163,0.00031319668,0.0004076913,0.000263245,0.0003286808],"domain_scores_gemma":[0.99922585,0.00028025385,0.00020670406,0.00015491532,0.00007869759,0.00005358735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023039372,0.00025254773,0.00032901356,0.00010126867,0.00021857428,0.00035685993,0.00012744401,0.000051613795,0.00011879585],"category_scores_gemma":[0.00080440636,0.00019839752,0.00004800581,0.00044180395,0.0002398592,0.0004368945,0.000102777674,0.0001899472,0.000055005617],"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.00016616493,0.00009429542,0.000013140313,0.0006764838,0.00007171495,0.000017931647,0.0003477167,0.82899654,0.000045014298,0.15384725,0.000003560588,0.015720189],"study_design_scores_gemma":[0.00066443597,0.00006104464,0.0000031196973,0.00039332669,0.00019949248,0.0000068107674,0.0005434265,0.9753451,0.000002032418,0.02243739,0.000031076986,0.00031274208],"about_ca_topic_score_codex":0.0000030717188,"about_ca_topic_score_gemma":0.0000017191031,"teacher_disagreement_score":0.8698199,"about_ca_system_score_codex":0.000019146952,"about_ca_system_score_gemma":0.000008327446,"threshold_uncertainty_score":0.8090416},"labels":[],"label_agreement":null},{"id":"W3045332431","doi":"10.1007/s10107-022-01780-0","title":"Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Disjoint sets; Combinatorics; Cardinality (data modeling); Bounded function; Constant (computer programming); Discrete mathematics; Routing (electronic design automation); Tree (set theory)","score_opus":0.021040342107216572,"score_gpt":0.23371226578399504,"score_spread":0.21267192367677845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045332431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016819425,0.00013554274,0.9782333,0.00087057566,0.0004462895,0.000718041,0.0000049370447,0.00053618185,0.0022357523],"genre_scores_gemma":[0.4606234,0.0000022409702,0.5384268,0.00025725036,0.000055288445,0.00047753775,0.000012427172,0.000042618063,0.000102392085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969298,0.00018648365,0.00065329263,0.00067572825,0.00078152434,0.00077317277],"domain_scores_gemma":[0.9985968,0.0002219183,0.00015156434,0.0008106835,0.000029738942,0.00018928417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008664282,0.00030312725,0.00043144746,0.00036793505,0.00040120535,0.00026733507,0.0014503499,0.000062945,0.00011623485],"category_scores_gemma":[0.00006201916,0.00028663184,0.00022921298,0.001284892,0.00014692062,0.00032946919,0.001306928,0.0005588736,0.000044877346],"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.000010459874,0.0017014467,0.0006086294,0.00017135749,0.000031331663,0.00030158972,0.0028103334,0.000029108667,0.00008182845,0.44069052,0.000118919816,0.5534445],"study_design_scores_gemma":[0.00047612505,0.00026938363,0.00009277869,0.00006273074,0.000011454858,0.00020910164,0.00032783835,0.1176488,0.0001742565,0.8709057,0.0093151815,0.00050662487],"about_ca_topic_score_codex":0.00001684281,"about_ca_topic_score_gemma":0.000015777454,"teacher_disagreement_score":0.55293787,"about_ca_system_score_codex":0.0001314444,"about_ca_system_score_gemma":0.000030722756,"threshold_uncertainty_score":0.9999586},"labels":[],"label_agreement":null},{"id":"W3105408634","doi":"10.1007/s10107-024-02128-6","title":"Optimizing distortion riskmetrics with distributional uncertainty","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Distortion (music); Mathematical optimization; Applied mathematics; Econometrics; Computer science","score_opus":0.06577574395816546,"score_gpt":0.364925118855046,"score_spread":0.29914937489688054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105408634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020576779,0.00038677023,0.97486824,0.00038302742,0.00018094383,0.00026385937,0.000013674909,0.00025222625,0.0030744567],"genre_scores_gemma":[0.91387403,0.000021420103,0.08491702,0.000018741155,0.00012045186,0.000047185607,0.00004740076,0.000019813779,0.00093392923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971715,0.00007351085,0.00059323834,0.0004492265,0.0013958556,0.00031663827],"domain_scores_gemma":[0.9981698,0.0010385055,0.00011116723,0.00031646204,0.00021219013,0.00015188073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019774707,0.00016273822,0.00023882155,0.00027172,0.00019926437,0.0010264587,0.00027287952,0.000081309794,0.00030269212],"category_scores_gemma":[0.0014869503,0.00009816579,0.000120299504,0.0020296222,0.00013603223,0.00040348846,0.00006260521,0.0001997285,0.0004164701],"study_design_candidate":"design_other","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.00003884056,0.00018368443,0.0010483129,0.000056388424,0.000049387058,0.00007492019,0.0010803556,0.013350321,0.000013496962,0.15146159,0.0018293767,0.83081335],"study_design_scores_gemma":[0.00034075236,0.0002491206,0.00042247353,0.00024712563,0.00011959662,0.0001340419,0.000885658,0.5561844,0.00012945427,0.2641488,0.17657885,0.0005596881],"about_ca_topic_score_codex":0.0000054095235,"about_ca_topic_score_gemma":0.000003276027,"teacher_disagreement_score":0.89329726,"about_ca_system_score_codex":0.00010615222,"about_ca_system_score_gemma":0.000074280346,"threshold_uncertainty_score":0.9898164},"labels":[],"label_agreement":null},{"id":"W3105596848","doi":"10.1007/s10107-022-01787-7","title":"Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Probabilistic logic; Mathematical optimization; Martingale (probability theory); Mathematics; Constraint (computer-aided design); Function (biology); Constrained optimization; Probability distribution; Convergence (economics); Computer science; Algorithm; Applied mathematics","score_opus":0.021589855361689163,"score_gpt":0.26737849543903996,"score_spread":0.2457886400773508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105596848","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016690216,0.00010146007,0.9959139,0.00014510272,0.00006694845,0.0013270151,0.0000038754724,0.0006643118,0.00010832444],"genre_scores_gemma":[0.2580793,1.9087648e-7,0.74139124,0.00004329291,0.000012608092,0.0004349166,0.0000053464414,0.000022164644,0.000010942012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812853,0.00008251204,0.00041616365,0.0004982738,0.00046248356,0.00041204775],"domain_scores_gemma":[0.9988158,0.000340604,0.00020138742,0.00036313824,0.000114649025,0.00016443098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047434357,0.00022722023,0.00028102685,0.00018337814,0.00052708824,0.00032252067,0.00043845113,0.000047049336,0.00013269857],"category_scores_gemma":[0.00081137137,0.00022034474,0.000052938816,0.00055404834,0.00027007915,0.00028609738,0.0006409451,0.00020108637,0.000002253316],"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.000011371393,0.00030314096,0.000020986616,0.00018030024,0.000040040315,0.00003576733,0.0021766345,0.63652635,0.00006134099,0.3479918,0.000010158859,0.012642108],"study_design_scores_gemma":[0.00024642315,0.0001740121,0.0000011816578,0.000057648303,0.00003381784,0.0003304735,0.00015263028,0.9401803,0.000026548372,0.058556896,0.0000086883365,0.00023137857],"about_ca_topic_score_codex":0.000001505539,"about_ca_topic_score_gemma":4.8060443e-8,"teacher_disagreement_score":0.30365396,"about_ca_system_score_codex":0.00011632853,"about_ca_system_score_gemma":0.00009081721,"threshold_uncertainty_score":0.8985397},"labels":[],"label_agreement":null},{"id":"W3118028601","doi":"10.1007/s10107-025-02301-5","title":"Beyond submodular maximization via one-sided smoothness","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","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 British Columbia; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Multilinear map; Matroid; Combinatorics; Mathematics; Discrete mathematics; Monotone polygon; Nabla symbol; Parameterized complexity; Linear subspace; Polytope; Omega; Pure mathematics; Physics","score_opus":0.01847810080773667,"score_gpt":0.2587033691405789,"score_spread":0.24022526833284222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118028601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001834323,0.00009764085,0.9907789,0.0011258848,0.00022462668,0.00036278542,5.182637e-7,0.00043193373,0.005143338],"genre_scores_gemma":[0.21940112,0.0000022110164,0.7797675,0.00030083285,0.000046501376,0.00008659511,0.000006278333,0.000012682769,0.00037625947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845487,0.000060492875,0.0003690879,0.00040082872,0.0003291606,0.00038555107],"domain_scores_gemma":[0.9988875,0.00022158417,0.0000709753,0.00064132124,0.00009169899,0.00008697009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004518388,0.00016746552,0.00025949746,0.00017492489,0.00023947364,0.00035664803,0.0008088188,0.000086873406,0.000041941094],"category_scores_gemma":[0.00019806302,0.0001620275,0.00011079604,0.0009454589,0.00011092394,0.00031602153,0.00039308143,0.00017734714,0.00007550998],"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.0000016815512,0.00020585523,0.00003394637,0.00012030038,0.000021709637,0.0000058092123,0.00019315178,0.000018561535,0.00007761514,0.637848,0.000039651863,0.3614337],"study_design_scores_gemma":[0.00022381806,0.000028128012,0.0001136259,0.00012302678,0.00001665857,0.0000093945655,0.000022601509,0.19006126,0.0010587473,0.80659074,0.0015713255,0.00018066679],"about_ca_topic_score_codex":0.000006217823,"about_ca_topic_score_gemma":0.0000026544594,"teacher_disagreement_score":0.36125305,"about_ca_system_score_codex":0.000038633076,"about_ca_system_score_gemma":0.000035578683,"threshold_uncertainty_score":0.660729},"labels":[],"label_agreement":null},{"id":"W3120314567","doi":"10.1007/s10107-022-01904-6","title":"Fairness over time in dynamic resource allocation with an application in healthcare","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Resource allocation; Mathematical optimization; Computer science; Max-min fairness; Decision maker; Dynamic programming; Constraint (computer-aided design); Operations research; Mathematics","score_opus":0.013137145524867815,"score_gpt":0.2489085380364373,"score_spread":0.2357713925115695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120314567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96384066,0.000039036124,0.022188997,0.00875803,0.00004416299,0.0023761443,0.0000016345184,0.0003243929,0.0024269335],"genre_scores_gemma":[0.99726063,3.3704003e-7,0.0010585652,0.00055666285,0.000026001426,0.00074745534,0.0001438567,0.00002164559,0.00018486496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864656,0.000035817553,0.0003541241,0.00032757173,0.00036276327,0.00027317827],"domain_scores_gemma":[0.9995787,0.000014720478,0.00006906618,0.00029008227,0.0000318984,0.000015509424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480393,0.0001267829,0.0001613968,0.000273787,0.0001393984,0.00008902729,0.00022187419,0.000028759903,0.00023060176],"category_scores_gemma":[0.000030386822,0.00012406636,0.000022961058,0.00092376105,0.000028498185,0.00041475063,0.00014724984,0.0001763398,0.000120118246],"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.00046017775,0.004428705,0.035492003,0.0038423778,0.00003381916,0.000032789285,0.0020602818,0.040862992,0.00016949687,0.43986344,0.00028332547,0.47247058],"study_design_scores_gemma":[0.00072729273,0.000056542012,0.012010357,0.00005504524,0.000014712611,0.0000016280638,0.0017131445,0.9457922,0.0000013208489,0.01622361,0.023066266,0.0003378865],"about_ca_topic_score_codex":0.0011850708,"about_ca_topic_score_gemma":0.002112442,"teacher_disagreement_score":0.9049292,"about_ca_system_score_codex":0.00016358381,"about_ca_system_score_gemma":0.000012314113,"threshold_uncertainty_score":0.50592786},"labels":[],"label_agreement":null},{"id":"W3124850851","doi":"10.1007/s10107-002-0328-8","title":"Easy and difficult objective functions for max cut","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthant; Mathematics; Combinatorics; Maximum cut; Function (biology); Sign (mathematics); Matching (statistics); Key (lock); Boundary (topology); Basis (linear algebra); Discrete mathematics; Graph; Mathematical analysis; Computer science; Statistics; Geometry","score_opus":0.013496768250500078,"score_gpt":0.23187260126534254,"score_spread":0.21837583301484245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124850851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065141143,0.00013603849,0.9873355,0.000023788758,0.0001283554,0.0003574157,0.0000025633594,0.00040655656,0.00509564],"genre_scores_gemma":[0.24695954,0.000004957028,0.75187325,0.000018794317,0.00005676493,0.00024962763,0.000008056129,0.000044448792,0.000784574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945235,0.000009904126,0.00014621668,0.00012077151,0.00007323346,0.00019754526],"domain_scores_gemma":[0.99963665,0.00013124649,0.000013591221,0.00008883876,0.000048709095,0.000080974605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012636605,0.00010415393,0.0001267968,0.00003581573,0.000095793075,0.000068716334,0.00003150747,0.00005829044,0.000036270194],"category_scores_gemma":[0.00029681087,0.00009169154,0.000037547303,0.00013488927,0.000031632324,0.00005056886,0.0000063205957,0.0000788471,0.000027502618],"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.000044036307,0.0011759141,0.0009857501,0.0035109858,0.00082470226,0.000016589247,0.008341586,0.08209219,0.0006334525,0.4151391,0.0016760975,0.48555958],"study_design_scores_gemma":[0.0012345612,0.00012536939,0.000060246384,0.00011532128,0.00012454775,0.00006894075,0.0021891396,0.9599948,0.0014787744,0.016060408,0.017935224,0.00061268127],"about_ca_topic_score_codex":2.598802e-7,"about_ca_topic_score_gemma":5.9922826e-7,"teacher_disagreement_score":0.8779026,"about_ca_system_score_codex":0.000020269981,"about_ca_system_score_gemma":0.000005806132,"threshold_uncertainty_score":0.37390724},"labels":[],"label_agreement":null},{"id":"W3158889296","doi":"10.1007/s10107-021-01654-x","title":"Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"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":"Ode; Ordinary differential equation; Bounding overwatch; Mathematics; Relaxation (psychology); Global optimization; Applied mathematics; Parametric statistics; Regular polygon; Convex optimization; Mathematical optimization; Optimization problem; Mathematical analysis; Differential equation; Computer science; Geometry","score_opus":0.08930853927278422,"score_gpt":0.37644312487995507,"score_spread":0.28713458560717087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158889296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035018622,0.00010068577,0.99681693,0.00018828304,0.00016608006,0.0016253091,0.00004327563,0.00017982311,0.00052944286],"genre_scores_gemma":[0.1171672,0.000004798988,0.88063526,0.000013086302,0.0000883669,0.00082010095,0.00016109634,0.000077324694,0.0010327818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973527,0.0001675952,0.0009998799,0.00038995384,0.00064465275,0.00044521384],"domain_scores_gemma":[0.9913355,0.00627869,0.00041028392,0.00055623666,0.0012468665,0.00017238442],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0004448774,0.00023269554,0.0005980969,0.00029174573,0.00023969279,0.0001317025,0.00023671013,0.00017430831,0.00042539823],"category_scores_gemma":[0.012244187,0.00022255452,0.00022318723,0.0012607349,0.00016960758,0.00015758851,0.000086619366,0.00020150782,0.000014884307],"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.00005512544,0.0027662944,0.00007465203,0.004078374,0.00026129934,0.00001577924,0.00035832997,0.545535,0.0001514006,0.4414428,0.00046080677,0.004800122],"study_design_scores_gemma":[0.0010786754,0.00010554486,0.0000014940038,0.00019089134,0.000118728865,0.0000076250267,0.00037673817,0.9752062,0.00064908736,0.02171641,0.0003176583,0.0002309412],"about_ca_topic_score_codex":0.0000024019673,"about_ca_topic_score_gemma":9.97251e-7,"teacher_disagreement_score":0.4296712,"about_ca_system_score_codex":0.00010848514,"about_ca_system_score_gemma":0.000268634,"threshold_uncertainty_score":0.9960761},"labels":[],"label_agreement":null},{"id":"W3158960540","doi":"10.1007/s10107-022-01839-y","title":"An optimal gradient method for smooth strongly convex minimization","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"H2020 European Research Council; Agence Nationale de la Recherche","keywords":"Mathematics; Constructive; Oracle; Mathematical optimization; Class (philosophy); Minification; Regular polygon; Point (geometry); Convex optimization; Upper and lower bounds; Proximal Gradient Methods; Sequence (biology); Computer science; Mathematical analysis","score_opus":0.0240464595519915,"score_gpt":0.2911768973617581,"score_spread":0.26713043780976664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158960540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018962655,0.000054539712,0.97889817,0.000033219036,0.000089168265,0.00055504654,0.000006387281,0.00097111956,0.0004296955],"genre_scores_gemma":[0.4264705,5.2080225e-7,0.57309353,0.000016900714,0.000038117516,0.00030589002,0.000022608387,0.00003745606,0.000014456972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991113,0.000045415545,0.00022053123,0.0001782552,0.00016904881,0.0002754321],"domain_scores_gemma":[0.9995349,0.000101645084,0.000034467463,0.00022522036,0.000031056767,0.0000726945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026422684,0.00013137078,0.00019317697,0.000064005646,0.00016006124,0.00006432994,0.00016463225,0.000035676865,0.000094870265],"category_scores_gemma":[0.000027778391,0.00013437566,0.00007170037,0.00011255865,0.000021319296,0.00007044979,0.000045507943,0.00013011297,0.0000024526746],"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.00008849316,0.000728439,0.000025578574,0.00036968084,0.00016001142,0.000024470995,0.003463461,0.34190822,0.0066787777,0.07655703,0.0030303684,0.56696546],"study_design_scores_gemma":[0.00018326961,0.00023059054,0.0000037262512,0.000014722684,0.000033048822,0.0000141344235,0.0004774613,0.97211456,0.0046458743,0.006338435,0.015760772,0.00018339102],"about_ca_topic_score_codex":0.000001259674,"about_ca_topic_score_gemma":2.9984426e-7,"teacher_disagreement_score":0.63020635,"about_ca_system_score_codex":0.00005739657,"about_ca_system_score_gemma":0.0000074440904,"threshold_uncertainty_score":0.54796803},"labels":[],"label_agreement":null},{"id":"W3174479306","doi":"10.1007/s10107-024-02126-8","title":"Optimizing for strategy diversity in the design of video games","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polytope; Upper and lower bounds; Combinatorics; Asymptotically optimal algorithm; Constraint (computer-aided design); Matrix (chemical analysis); Linear programming; Connection (principal bundle); Point (geometry); Mathematical optimization; Discrete mathematics","score_opus":0.13555552960445652,"score_gpt":0.33985580955813793,"score_spread":0.2043002799536814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174479306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002203039,0.00023146556,0.99611163,0.00042484823,0.00005848363,0.00056417217,3.6408093e-7,0.00009649817,0.00030950503],"genre_scores_gemma":[0.634449,0.0000019840243,0.36543718,0.000020956179,0.000016887807,0.00005101016,1.511301e-7,0.000004426718,0.000018389263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896663,0.00007181433,0.00027377254,0.00021732591,0.00022727915,0.00024315904],"domain_scores_gemma":[0.99806887,0.0015799836,0.00003675561,0.0002516926,0.00003552411,0.000027147817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013555584,0.000090876296,0.00014608582,0.000073114425,0.00009225051,0.00024703966,0.00079908984,0.000042593972,0.00000789428],"category_scores_gemma":[0.00023980458,0.000060371443,0.00007851402,0.00034357756,0.00009338379,0.0002701296,0.000246764,0.00011077857,0.000016582255],"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.0000048858356,0.00010953595,0.00002399246,0.00029157763,0.000014927104,0.000018562712,0.015572454,0.0022241245,0.00011735312,0.6160397,0.000092555376,0.36549035],"study_design_scores_gemma":[0.000026123462,0.000112503585,0.0000059107324,0.00014889009,0.000010252696,0.0000068249333,0.0010385332,0.6526047,0.0018025647,0.3438834,0.00027255274,0.00008773054],"about_ca_topic_score_codex":0.000010403922,"about_ca_topic_score_gemma":0.0000021030899,"teacher_disagreement_score":0.6503806,"about_ca_system_score_codex":0.000021473865,"about_ca_system_score_gemma":0.000029746061,"threshold_uncertainty_score":0.2461876},"labels":[],"label_agreement":null},{"id":"W3199261976","doi":"10.1007/s10107-025-02259-4","title":"Learning and decision-making with data : optimal formulations and phase transitions","year":2025,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Sample (material); Mathematical optimization; Computer science; Measure (data warehouse); Variance (accounting); Mathematics; Data mining; Economics","score_opus":0.09830864299050751,"score_gpt":0.4066926458346177,"score_spread":0.3083840028441102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199261976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013675648,0.00032634768,0.98429966,0.00021257745,0.0000565705,0.0006629067,0.000060009985,0.0001513052,0.0005549875],"genre_scores_gemma":[0.3854207,0.000008083998,0.61435616,0.000008618627,0.000030024885,0.00004605676,0.000024003157,0.000013715618,0.00009261061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972478,0.00007371909,0.00072504126,0.00091728976,0.0007169301,0.00031919984],"domain_scores_gemma":[0.9942857,0.0043470575,0.00017343914,0.0008753913,0.00016528054,0.00015311221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022273036,0.00029543968,0.00056678895,0.00028127557,0.00039085635,0.0008659927,0.0006478649,0.00020372395,0.00006153282],"category_scores_gemma":[0.0047967043,0.00020334369,0.000055966495,0.0003628069,0.0002304958,0.00023367134,0.0013172938,0.0006798772,0.0000064853366],"study_design_candidate":"design_other","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.0000522764,0.00019653168,0.00006816417,0.00037317956,0.00008069708,0.000024753483,0.0014546617,0.020889029,0.0000023085836,0.021302609,0.000083650695,0.9554721],"study_design_scores_gemma":[0.0004135351,0.00010009572,0.000016475826,0.0013206615,0.00016566642,0.00004707936,0.0005696954,0.79178697,7.8215675e-7,0.20355989,0.0017513562,0.0002678265],"about_ca_topic_score_codex":0.0000014674737,"about_ca_topic_score_gemma":0.0000033372207,"teacher_disagreement_score":0.9552043,"about_ca_system_score_codex":0.00002464088,"about_ca_system_score_gemma":0.00011971929,"threshold_uncertainty_score":0.8350787},"labels":[],"label_agreement":null},{"id":"W3209347123","doi":"10.1007/s10107-021-01718-y","title":"Best approximation mappings in Hilbert spaces","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear subspace; Hilbert space; Affine transformation; Sequence (biology); Regular polygon; Affine space; Fixed point; Convergence (economics); Subspace topology; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.02120571688869173,"score_gpt":0.25765783399329056,"score_spread":0.23645211710459885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209347123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014783144,0.000047545374,0.9861924,0.005104315,0.000030107378,0.000097790966,1.7095844e-7,0.000078556055,0.006970813],"genre_scores_gemma":[0.1533704,0.0000048462034,0.84521395,0.00024303621,0.000026204329,0.000037341048,0.0000091778,0.000006523141,0.0010884973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990198,0.00004561903,0.00026461144,0.0002419464,0.00025002545,0.0001780018],"domain_scores_gemma":[0.9994653,0.00010121438,0.000060540966,0.0002205367,0.00009553116,0.00005689272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026725148,0.000082971375,0.00015015791,0.000093781055,0.000059110145,0.00033202002,0.00020434936,0.00004441297,0.000101878104],"category_scores_gemma":[0.00024204212,0.000075648815,0.000057436973,0.0008289988,0.000017074182,0.0003319756,0.00011751062,0.0000774532,0.00015336399],"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":[6.8331457e-7,0.00029092524,0.00040597728,0.00008606029,0.000016271495,0.000016838676,0.0010250015,0.00043158958,0.000073669245,0.9421211,0.00003765988,0.055494253],"study_design_scores_gemma":[0.00026590642,0.000016197871,0.00023062591,0.00009596636,0.000013083137,0.000023292236,0.00025905,0.9004532,0.0004231557,0.09393509,0.0040800236,0.00020439095],"about_ca_topic_score_codex":0.0000058095106,"about_ca_topic_score_gemma":0.000006376026,"teacher_disagreement_score":0.9000216,"about_ca_system_score_codex":0.00003294983,"about_ca_system_score_gemma":0.000035753656,"threshold_uncertainty_score":0.3201677},"labels":[],"label_agreement":null},{"id":"W4281666975","doi":"10.1007/s10107-022-01860-1","title":"Exact computation of an error bound for the balanced linear complementarity problem with unique solution","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Invertible matrix; Upper and lower bounds; Computation; Complementarity (molecular biology); Linear complementarity problem; Regular polygon; Diagonal; Inverse; Norm (philosophy); Combinatorics; Applied mathematics; Discrete mathematics; Algorithm; Pure mathematics; Nonlinear system; Mathematical analysis","score_opus":0.03566716938258509,"score_gpt":0.30660469221253256,"score_spread":0.2709375228299475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281666975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014969632,0.0000139626245,0.98312426,0.00053381006,0.000038071637,0.0011391066,0.0000062861263,0.00010254919,0.000072297975],"genre_scores_gemma":[0.5077284,9.467812e-8,0.49195343,0.000038052833,0.000017744194,0.00023010821,0.00001159334,0.0000068429767,0.000013712601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883986,0.0001422233,0.0002735432,0.00021680156,0.00029629294,0.00023129552],"domain_scores_gemma":[0.99917215,0.00029084383,0.00016296872,0.0002604572,0.00006682936,0.000046746107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012939845,0.000102636484,0.0001660148,0.000034183013,0.0005323179,0.00008107464,0.00046916315,0.000016863109,0.000020735612],"category_scores_gemma":[0.000020661768,0.00006979131,0.000051457075,0.00024265854,0.00008598104,0.00020057356,0.00018944388,0.0001361127,0.000001056859],"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.0001436973,0.0012740549,0.00005237545,0.00067975133,0.00009534426,0.000005798532,0.005332202,0.009354282,0.00039812733,0.7685151,0.000052286752,0.214097],"study_design_scores_gemma":[0.00045529866,0.0006652475,0.000017394364,0.000022619977,0.000019149815,0.000022593702,0.00051309355,0.879827,0.00036866614,0.11698036,0.0009988553,0.00010970635],"about_ca_topic_score_codex":0.000018687102,"about_ca_topic_score_gemma":0.000007715661,"teacher_disagreement_score":0.8704727,"about_ca_system_score_codex":0.00004224263,"about_ca_system_score_gemma":0.00004381328,"threshold_uncertainty_score":0.40942127},"labels":[],"label_agreement":null},{"id":"W4297337997","doi":"10.1007/s10107-022-01890-9","title":"Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Semidefinite programming; Reduction (mathematics); Mathematics; Computer science; Geometry; Mathematical optimization","score_opus":0.0835175284157905,"score_gpt":0.3650636598238889,"score_spread":0.28154613140809837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297337997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08723012,0.0001587372,0.89748424,0.0016536041,0.000386539,0.009100955,0.000058398677,0.0010721607,0.0028552287],"genre_scores_gemma":[0.13922617,0.000004069673,0.855811,0.000022398603,0.00017465957,0.0033229252,0.000052772102,0.000099065524,0.0012869511],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756813,0.0001377094,0.0005520026,0.00050488446,0.0006469539,0.0005903329],"domain_scores_gemma":[0.998457,0.00065355405,0.00021274638,0.00030509828,0.000189153,0.0001824609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011205034,0.0002469276,0.0003980042,0.00018546055,0.0007650821,0.00015053943,0.00022469947,0.000081490805,0.00013624286],"category_scores_gemma":[0.0013747782,0.0002401865,0.00012252979,0.000574825,0.00020636566,0.00019784592,0.00032567582,0.0004388747,0.000008495366],"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.00028442606,0.0014404298,0.0000245074,0.0011744908,0.00017049165,0.000013808912,0.005806267,0.00016114728,0.0008592083,0.37851578,0.00043434335,0.6111151],"study_design_scores_gemma":[0.001981213,0.00082344475,0.0000031097998,0.0000894514,0.00009706325,0.00021143172,0.0068461094,0.025475211,0.001351973,0.9541787,0.0083458945,0.00059642934],"about_ca_topic_score_codex":0.0000021126448,"about_ca_topic_score_gemma":5.3530886e-7,"teacher_disagreement_score":0.6105187,"about_ca_system_score_codex":0.00018213897,"about_ca_system_score_gemma":0.00005671852,"threshold_uncertainty_score":0.9794522},"labels":[],"label_agreement":null},{"id":"W4304957737","doi":"10.1007/s10107-022-01899-0","title":"An elementary approach to tight worst case complexity analysis of gradient based methods","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Israel Science Foundation","keywords":"Mathematics; Gradient descent; Gradient method; Proximal Gradient Methods; Convergence (economics); Mathematical optimization; Applied mathematics; Stochastic gradient descent; Algorithm; Convex optimization; Regular polygon; Computer science; Artificial intelligence; Artificial neural network; Geometry","score_opus":0.06827123328029666,"score_gpt":0.34118129193612035,"score_spread":0.2729100586558237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304957737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15477934,0.00002304196,0.8433763,0.000016429594,0.00002671187,0.0003703193,0.000013497574,0.00044433042,0.00095006975],"genre_scores_gemma":[0.5181021,7.8368586e-8,0.48172984,0.000029448136,0.0000066542566,0.00008926285,0.00002543288,0.000015406944,0.0000018092566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987387,0.00017062097,0.00036113535,0.00022407253,0.00023791249,0.00026757352],"domain_scores_gemma":[0.99922276,0.00010438133,0.00004680178,0.00046559345,0.000028918386,0.00013152986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006576537,0.00015422929,0.00040401044,0.00034133618,0.0001396123,0.000032237604,0.00021624808,0.000026101612,0.00016753982],"category_scores_gemma":[0.000018089924,0.00015041421,0.0001600129,0.0010536761,0.00004874204,0.00003820016,0.00009883104,0.00016738381,0.0000010622616],"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.000098540346,0.005952586,0.0007588209,0.0009327359,0.004237372,0.00073717313,0.009605491,0.4647509,0.018388204,0.08029867,0.0012772699,0.41296226],"study_design_scores_gemma":[0.000087184,0.00011175363,0.00003427762,0.000010682994,0.0004567216,0.00004810517,0.00065819564,0.9897716,0.0052806446,0.0023064285,0.0010324041,0.00020197003],"about_ca_topic_score_codex":0.000042720265,"about_ca_topic_score_gemma":0.000007395387,"teacher_disagreement_score":0.5250208,"about_ca_system_score_codex":0.00008091353,"about_ca_system_score_gemma":0.00000568035,"threshold_uncertainty_score":0.6133714},"labels":[],"label_agreement":null},{"id":"W4320039432","doi":"10.1007/s10107-023-01930-y","title":"A novel reformulation for the single-sink fixed-charge transportation problem","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Transportation theory; Fixed charge; Leverage (statistics); Mathematical optimization; Knapsack problem; Mathematics; Linear programming; Integer programming; Heuristic; Algorithm","score_opus":0.03791356835714092,"score_gpt":0.25676339012631094,"score_spread":0.21884982176917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320039432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014909065,0.00004463468,0.99287885,0.0004913536,0.00012819571,0.0017347311,0.000011714804,0.0019237004,0.001295923],"genre_scores_gemma":[0.47168154,0.00001478221,0.52507406,0.000074827745,0.00020647272,0.0017048944,0.0002458432,0.00018999186,0.0008075744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985188,0.000008017371,0.00052391924,0.00019790359,0.00027067328,0.00048067342],"domain_scores_gemma":[0.99904865,0.00048466423,0.00006289323,0.00023060017,0.000077286655,0.000095880074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209277,0.00020910616,0.00022914546,0.00009384452,0.00021765953,0.00016110862,0.00016951273,0.00011337669,0.00005909645],"category_scores_gemma":[0.00016651157,0.00014874837,0.00014802905,0.00055712904,0.000055113433,0.0002018054,0.000012887756,0.00014345524,0.00015697013],"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.000032693468,0.0005022732,0.00001310572,0.00440874,0.00022918513,0.000004128788,0.005004775,0.044926386,0.009014077,0.2641077,0.001649166,0.6701078],"study_design_scores_gemma":[0.00059588754,0.00007102522,0.000022364895,0.00015464652,0.00009665472,0.0000057074885,0.0003551334,0.94964,0.0010110913,0.01887086,0.028851295,0.00032537465],"about_ca_topic_score_codex":0.0000011457231,"about_ca_topic_score_gemma":0.0000041959775,"teacher_disagreement_score":0.9047136,"about_ca_system_score_codex":0.000051347684,"about_ca_system_score_gemma":0.0000074118575,"threshold_uncertainty_score":0.60657823},"labels":[],"label_agreement":null},{"id":"W4366371563","doi":"10.1007/s10107-023-01950-8","title":"Small separations in pinch-graphic matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Corollary; Combinatorics; Graphic matroid; Mathematics; Time complexity; Polynomial; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.06714110996471906,"score_gpt":0.33528556079250055,"score_spread":0.2681444508277815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366371563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07195592,0.000056361732,0.92069244,0.0013204479,0.00007592829,0.0006964932,8.5776657e-7,0.0011351664,0.004066356],"genre_scores_gemma":[0.6661923,0.000008653345,0.33248192,0.0000638895,0.000035580833,0.0004038415,0.000004976399,0.000029506939,0.0007793188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818164,0.000106555104,0.00033344034,0.00038108113,0.00033797152,0.0006593221],"domain_scores_gemma":[0.99873716,0.0004330606,0.000041520685,0.0006050503,0.000045800447,0.00013740345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010781479,0.00014112087,0.00020402079,0.00049431814,0.00013651876,0.00020677567,0.0008607255,0.00006433125,0.000019428202],"category_scores_gemma":[0.00026316577,0.0001281901,0.000089185174,0.002928265,0.00011859546,0.00028811066,0.0004102645,0.0002025354,0.0008263652],"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.0000042848706,0.000111149784,0.00026428897,0.00008508744,0.000008012425,0.000065669155,0.00062525505,0.000080477126,0.000298277,0.92644817,0.000053142256,0.07195619],"study_design_scores_gemma":[0.00024974748,0.00010069016,0.00042026505,0.000068839756,0.000002646717,0.000021066255,0.00018971525,0.08549402,0.00024774036,0.91112787,0.0018584138,0.00021897115],"about_ca_topic_score_codex":0.0000022635231,"about_ca_topic_score_gemma":0.00001291344,"teacher_disagreement_score":0.5942364,"about_ca_system_score_codex":0.00003356629,"about_ca_system_score_gemma":0.00003243824,"threshold_uncertainty_score":0.9999516},"labels":[],"label_agreement":null},{"id":"W4366465856","doi":"10.1007/s10107-023-01951-7","title":"Recognizing pinch-graphic matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Pinch; Graph; Binary number; Oriented matroid; Discrete mathematics; Time complexity; Arithmetic; Physics","score_opus":0.04805252912963237,"score_gpt":0.32410374137317893,"score_spread":0.27605121224354656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366465856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016168987,0.00007834946,0.9742713,0.0011711019,0.00013987003,0.0005142963,7.4028776e-7,0.0024385694,0.005216763],"genre_scores_gemma":[0.4513401,0.000017804783,0.54701185,0.00011652457,0.00009682509,0.00027137026,0.000004972242,0.000058269357,0.0010822702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762523,0.000108628104,0.00034301248,0.00048808876,0.00057348184,0.00086157996],"domain_scores_gemma":[0.9983429,0.00053802493,0.0000628692,0.0007612915,0.000077711265,0.00021724624],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014462908,0.00018322913,0.0002462874,0.0003915933,0.00026105205,0.0003183189,0.0011459929,0.00007529834,0.000039271097],"category_scores_gemma":[0.0005238974,0.0001603625,0.00014326352,0.00259131,0.00015152725,0.00046014585,0.000666323,0.00030446317,0.002040314],"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.0000035189732,0.00006750219,0.00009171909,0.00014545087,0.000020590465,0.0000748407,0.00055720063,0.00001096462,0.00060649554,0.64268047,0.00018986962,0.3555514],"study_design_scores_gemma":[0.0002286598,0.00009522939,0.00007420874,0.00010164577,0.0000057172365,0.0000449148,0.00023842447,0.042793963,0.0007402882,0.95002913,0.0053528333,0.00029500606],"about_ca_topic_score_codex":9.3141267e-7,"about_ca_topic_score_gemma":6.7332724e-7,"teacher_disagreement_score":0.43517113,"about_ca_system_score_codex":0.000029215533,"about_ca_system_score_gemma":0.00002701507,"threshold_uncertainty_score":0.99873674},"labels":[],"label_agreement":null},{"id":"W4367050013","doi":"10.1007/s10107-023-01961-5","title":"Approximation algorithms for flexible graph connectivity","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Virginia; National Science Foundation","keywords":"Approximation algorithm; Mathematics; Combinatorics; Partition (number theory); Graph; Undirected graph; Algorithm; Efficient algorithm; Discrete mathematics","score_opus":0.07737915461578086,"score_gpt":0.3207735815701585,"score_spread":0.24339442695437763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367050013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014228667,0.000020420708,0.9938541,0.0006561023,0.00022273252,0.000772924,0.0000035265427,0.0019365171,0.0011108174],"genre_scores_gemma":[0.052504275,0.0000026569692,0.9463757,0.000073664945,0.00011242775,0.00058967265,0.000015780728,0.000022319427,0.00030345473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983887,0.000040686464,0.00030064586,0.0004263898,0.00032385593,0.0005197265],"domain_scores_gemma":[0.99862355,0.00062553654,0.000080915815,0.00046941504,0.000087033375,0.00011352835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061184,0.00016608374,0.0002463639,0.00021000889,0.00032899444,0.00032019734,0.00060365937,0.0000749048,0.000008829045],"category_scores_gemma":[0.0003002344,0.00015118478,0.0001823269,0.00125633,0.00009157944,0.00039069145,0.00024829776,0.00012578795,0.00013576215],"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.0000021079047,0.000109203065,0.0000072015264,0.0001658468,0.000016188696,0.0000021141816,0.00041324625,0.000022652093,0.000053203432,0.62413293,0.0004471262,0.3746282],"study_design_scores_gemma":[0.00021434613,0.00007015445,0.00002915188,0.000030379195,0.000006031451,0.000008573613,0.00006666464,0.3904129,0.00073947525,0.60449624,0.0037706578,0.00015544443],"about_ca_topic_score_codex":0.0000028595173,"about_ca_topic_score_gemma":8.2413067e-7,"teacher_disagreement_score":0.39039025,"about_ca_system_score_codex":0.000023151606,"about_ca_system_score_gemma":0.000022984263,"threshold_uncertainty_score":0.6165136},"labels":[],"label_agreement":null},{"id":"W4367050287","doi":"10.1007/s10107-023-01944-6","title":"Recognizing even-cycle and even-cut matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Matroid partitioning; Graphic matroid; Combinatorics; Mathematics; Oriented matroid; Weighted matroid; Binary number; Discrete mathematics; Time complexity; Polynomial; Arithmetic","score_opus":0.03575428695673117,"score_gpt":0.3188795183276457,"score_spread":0.28312523137091455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367050287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10626368,0.00017008958,0.8865277,0.0016724975,0.00012887496,0.0007178944,0.0000015200263,0.0016486777,0.0028690433],"genre_scores_gemma":[0.6118643,0.000021090162,0.3866851,0.00008159393,0.000075620475,0.00017739518,0.0000029433947,0.000049137507,0.0010428061],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979494,0.00010546174,0.00030097849,0.00047639225,0.00044868252,0.0007190368],"domain_scores_gemma":[0.99853605,0.00059162616,0.000057215264,0.0005342938,0.00005820114,0.00022258477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013045118,0.0001724741,0.00024382782,0.00021026637,0.00025409978,0.00029889963,0.00063949905,0.000071445735,0.000023646038],"category_scores_gemma":[0.0005298062,0.00015264182,0.00007474821,0.0011098182,0.00015097471,0.00045571872,0.00073829177,0.00025897557,0.00066277356],"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.000006741407,0.000077366225,0.00013633723,0.00024604585,0.000025057741,0.00007623035,0.0012366105,0.000013523708,0.0007424266,0.39062497,0.00012576337,0.6066889],"study_design_scores_gemma":[0.0002782712,0.000103574275,0.00013828129,0.00012257708,0.0000067471324,0.000071463284,0.00025183547,0.069036424,0.00066324265,0.9260599,0.0029917122,0.0002759497],"about_ca_topic_score_codex":0.0000016133538,"about_ca_topic_score_gemma":0.0000012161846,"teacher_disagreement_score":0.60641295,"about_ca_system_score_codex":0.000028821805,"about_ca_system_score_gemma":0.000023060033,"threshold_uncertainty_score":0.8518834},"labels":[],"label_agreement":null},{"id":"W4376874338","doi":"10.1007/s10107-023-01971-3","title":"A colorful Steinitz Lemma with application to block-structured integer programs","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Einstein Stiftung Berlin; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Lemma (botany); Norm (philosophy); Integer (computer science); Bounded function; Upper and lower bounds; Integer programming; Discrete mathematics; Sequence (biology); Algorithm; Computer science","score_opus":0.022556172994474082,"score_gpt":0.2743292564063316,"score_spread":0.2517730834118575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376874338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068442314,0.0000039073693,0.9864935,0.0023231436,0.000035245357,0.0017982805,5.7226606e-7,0.0013008191,0.0012002814],"genre_scores_gemma":[0.51482356,7.088032e-7,0.48324475,0.00019604574,0.000038153143,0.0010290828,0.000013482518,0.000030462885,0.00062378997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811304,0.00005232952,0.00030741745,0.00046105622,0.00052085984,0.00054529286],"domain_scores_gemma":[0.99884707,0.000098264165,0.000069409056,0.0005469529,0.00016109864,0.00027721276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051778427,0.00017914199,0.000217907,0.00017468134,0.00015759966,0.00046582668,0.0006696426,0.00007184517,0.000015113488],"category_scores_gemma":[0.000102283884,0.00013226758,0.000049876227,0.0019125787,0.00007080598,0.00021648676,0.00029750585,0.00017186397,0.0007073034],"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.00002475557,0.00031063627,0.0002063447,0.00027366224,0.000050851948,0.000033956465,0.004900476,0.0021596397,0.00039781182,0.2566724,0.0004252999,0.73454416],"study_design_scores_gemma":[0.001017581,0.0011887677,0.00013458102,0.00026376403,0.000023265577,0.00009213397,0.0007008679,0.90153503,0.0010608084,0.04053661,0.05263474,0.00081186043],"about_ca_topic_score_codex":0.000004174788,"about_ca_topic_score_gemma":0.0000098195715,"teacher_disagreement_score":0.8993754,"about_ca_system_score_codex":0.000039976334,"about_ca_system_score_gemma":0.000047975165,"threshold_uncertainty_score":0.909119},"labels":[],"label_agreement":null},{"id":"W4377238405","doi":"10.1007/s10107-023-01967-z","title":"Total dual dyadicness and dyadic generating sets","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Linear subspace; Matroid; Dual (grammatical number); Rational number; Joins; Discrete mathematics; Pure mathematics","score_opus":0.05686645443064241,"score_gpt":0.3363351452649714,"score_spread":0.27946869083432896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377238405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886902,0.000036170695,0.007677925,0.00030719882,0.000031666506,0.0005440202,0.0000032348796,0.0007709403,0.0019386325],"genre_scores_gemma":[0.93487746,0.0000026756043,0.06383782,0.000037780857,0.000098394135,0.0003094162,0.000012624012,0.000052281073,0.00077157904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985739,0.00006479502,0.00038423642,0.00030042423,0.00024047423,0.00043615568],"domain_scores_gemma":[0.9986466,0.00076617405,0.00008587436,0.00030417647,0.00003641201,0.0001607754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008210877,0.00018923468,0.00027341858,0.00010417859,0.00035269372,0.00013172228,0.00010685356,0.00009741227,0.0000827634],"category_scores_gemma":[0.0005369663,0.00016352576,0.000079779034,0.00047611588,0.0001601662,0.000100800135,0.00013914208,0.0001867331,0.00021551062],"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.000003279619,0.00011491754,0.000054215205,0.00034484323,0.00003288863,0.000021819273,0.0012160771,0.0000033195365,0.0008073808,0.9618114,0.00060120935,0.034988634],"study_design_scores_gemma":[0.00024919194,0.00003807558,0.000073420866,0.00009351813,0.000054384825,0.00013105379,0.00084638083,0.010532409,0.00040822194,0.98653424,0.0007895345,0.0002495456],"about_ca_topic_score_codex":0.0000012573123,"about_ca_topic_score_gemma":0.0000013600705,"teacher_disagreement_score":0.056159895,"about_ca_system_score_codex":0.000013552981,"about_ca_system_score_gemma":0.000012725113,"threshold_uncertainty_score":0.6668387},"labels":[],"label_agreement":null},{"id":"W4388083648","doi":"10.1007/s10107-023-02007-6","title":"Scalable adaptive cubic regularization methods","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Sherbrooke; HEC Montréal","funders":"Canada First Research Excellence Fund; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Lanczos resampling; Mathematics; Applied mathematics; Cholesky decomposition; Conjugate gradient method; Mathematical optimization; Preconditioner; Scalability; Algorithm; Iterative method; Computer science; Eigenvalues and eigenvectors","score_opus":0.03768900431308961,"score_gpt":0.3241266093461401,"score_spread":0.2864376050330505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388083648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025435598,0.000027433987,0.9928218,0.00039396944,0.00012804565,0.0002566848,3.2131214e-7,0.0009854685,0.005131933],"genre_scores_gemma":[0.010326152,0.0000016759352,0.98650557,0.000046043344,0.000059873273,0.000069178044,0.0000030836268,0.000015226748,0.0029731716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985912,0.0001952731,0.00025672952,0.0003172241,0.000249374,0.00039021755],"domain_scores_gemma":[0.9989377,0.00038715504,0.00006644406,0.00043586874,0.00006329065,0.00010949639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770722,0.00012804185,0.0001930834,0.000118756674,0.00017968901,0.00022173191,0.00052524754,0.00006903754,0.00004988119],"category_scores_gemma":[0.00032961322,0.00010742132,0.000068884525,0.0013870704,0.000061016304,0.0003375054,0.00030112627,0.00012540047,0.00076305104],"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.0000011609584,0.000033281653,0.0000012295918,0.000037841684,0.000008222812,0.000008383409,0.0003027903,0.000025963443,0.00017290626,0.66709596,0.00008600454,0.33222628],"study_design_scores_gemma":[0.000087222674,0.00004042126,0.0000053047115,0.000034330707,0.000006270008,0.00001122792,0.00006741483,0.41615352,0.0026546407,0.5772025,0.0036152524,0.00012188389],"about_ca_topic_score_codex":7.792358e-7,"about_ca_topic_score_gemma":7.070913e-8,"teacher_disagreement_score":0.41612756,"about_ca_system_score_codex":0.00002135277,"about_ca_system_score_gemma":0.000023997603,"threshold_uncertainty_score":0.98077315},"labels":[],"label_agreement":null},{"id":"W4390533700","doi":"10.1007/s10107-023-02043-2","title":"Asymmetry in the complexity of the multi-commodity network pricing problem","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Institut de Valorisation des Données","keywords":"Mathematics; Mathematical optimization; Bilevel optimization; Path (computing); Computational complexity theory; Shortest path problem; Property (philosophy); Commodity; Graph; Mathematical economics; Computer science; Optimization problem; Combinatorics; Economics; Algorithm; Finance","score_opus":0.07496112946076537,"score_gpt":0.3328110682016302,"score_spread":0.2578499387408648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390533700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10386779,0.0010815762,0.824037,0.022325281,0.00083285186,0.0045190533,0.000014608519,0.0007645383,0.04255726],"genre_scores_gemma":[0.9340286,0.0000025104148,0.06577059,0.000044993783,0.00005534184,0.00002456922,0.000003125198,0.000005770046,0.000064456035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892604,0.00021128159,0.00024876694,0.00010727013,0.00030372187,0.00020290996],"domain_scores_gemma":[0.99943405,0.00035286383,0.000050847855,0.000114602095,0.000024968922,0.000022673505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017663102,0.000060768725,0.000104980776,0.000023714523,0.00026560284,0.000106699685,0.00023782608,0.000051304767,0.000017218717],"category_scores_gemma":[0.00015159616,0.000034258628,0.000062268526,0.00069814076,0.00035905276,0.000077297096,0.000013892514,0.00019668542,0.0000053096383],"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.0000029324387,0.00017322894,0.0070166877,0.00032956433,0.000013013592,0.0000032862356,0.053529546,0.0026525762,0.000002212732,0.9165123,0.00020037043,0.019564278],"study_design_scores_gemma":[0.00069248147,0.000080164675,0.03626684,0.003333876,0.00017848703,0.000007668509,0.03060014,0.19262683,0.000053602394,0.68588626,0.049672313,0.00060132734],"about_ca_topic_score_codex":0.00016350266,"about_ca_topic_score_gemma":0.00051187834,"teacher_disagreement_score":0.83016086,"about_ca_system_score_codex":0.00002497009,"about_ca_system_score_gemma":0.000043881813,"threshold_uncertainty_score":0.20428292},"labels":[],"label_agreement":null},{"id":"W4390673591","doi":"10.1007/s10107-023-02042-3","title":"Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions”","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Counterexample; Mathematics; Corollary; Function (biology); Sequence (biology); Combinatorics; Point (geometry); Discrete mathematics; Algorithm; Geometry","score_opus":0.10855348262170236,"score_gpt":0.42049586975885356,"score_spread":0.31194238713715117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390673591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023334054,0.000119122655,0.9931214,0.00009709624,0.000020566673,0.0012144521,0.0027675843,0.00009161698,0.00023479004],"genre_scores_gemma":[0.05088346,0.0000049108844,0.94660836,0.000004564055,0.000068024754,0.0006948886,0.00053616875,0.00005117701,0.0011484358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834454,0.000058358724,0.00062431436,0.00032251995,0.00036393377,0.00028633323],"domain_scores_gemma":[0.9936652,0.005487808,0.00013340295,0.00024745415,0.00036839544,0.00009770648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641554,0.0001426645,0.0005306657,0.00035511306,0.00010078437,0.000088609886,0.0001193919,0.00007203152,0.00024200471],"category_scores_gemma":[0.0031843262,0.00011886034,0.00022251665,0.00064046413,0.00018005387,0.00018032994,0.000054532844,0.000097792254,9.0834203e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076583907,0.0026508484,0.00007232029,0.02631065,0.007368175,0.000008562072,0.0064930697,0.0018844855,0.0015251186,0.66933405,0.006094542,0.2774923],"study_design_scores_gemma":[0.00052123447,0.0004069493,0.000012529185,0.00052296085,0.0011063449,0.000004472033,0.0015905041,0.8851477,0.00038414847,0.10541936,0.004663573,0.0002202218],"about_ca_topic_score_codex":0.0000059260874,"about_ca_topic_score_gemma":0.000020040286,"teacher_disagreement_score":0.88326323,"about_ca_system_score_codex":0.000034441327,"about_ca_system_score_gemma":0.000056161407,"threshold_uncertainty_score":0.48469839},"labels":[],"label_agreement":null},{"id":"W4390875855","doi":"10.1007/s10107-024-02141-9","title":"A continuous approximation model for the electric vehicle fleet sizing problem","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Politecnico di Milano","keywords":"Sizing; Electric vehicle; Automotive engineering; Mathematical optimization; Computer science; Mathematics; Engineering; Physics; Chemistry; Power (physics)","score_opus":0.011572600416782671,"score_gpt":0.22918668524186833,"score_spread":0.21761408482508565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390875855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009367473,0.002571535,0.98458785,0.0002708286,0.00006377422,0.0010905203,0.0000024471033,0.000961689,0.0010838654],"genre_scores_gemma":[0.92551863,0.000017370432,0.073572025,0.00003304346,0.00013872715,0.00046460427,0.000004573195,0.00006780617,0.00018323591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.000008264612,0.0002847835,0.00017690042,0.00016927932,0.00042334682],"domain_scores_gemma":[0.9994618,0.00027505847,0.00001960628,0.00015790395,0.00003341937,0.0000521743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031526695,0.00016727815,0.00017765639,0.000059910395,0.00012837863,0.00029992624,0.0001599106,0.000092413095,0.000011928772],"category_scores_gemma":[0.000047088717,0.00011106458,0.00011141249,0.00036431474,0.000020287416,0.0001429354,0.00001949921,0.00025855395,0.000020945965],"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.000005814529,0.000028178545,0.0000028316902,0.0017072533,0.0001106936,0.0000025605118,0.001292967,0.034774352,0.007436473,0.0829906,0.0011087743,0.8705395],"study_design_scores_gemma":[0.00009924009,0.000035361612,0.0000012496682,0.00008187598,0.000054730684,0.000015097657,0.000049137194,0.92717505,0.0011463877,0.068407476,0.0027946834,0.00013970448],"about_ca_topic_score_codex":7.9141915e-7,"about_ca_topic_score_gemma":6.0629407e-7,"teacher_disagreement_score":0.91615117,"about_ca_system_score_codex":0.0000637501,"about_ca_system_score_gemma":0.000018783448,"threshold_uncertainty_score":0.45290822},"labels":[],"label_agreement":null},{"id":"W4391540447","doi":"10.1007/s10107-023-02032-5","title":"A general framework for multi-marginal optimal transport","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Alberta","funders":"","keywords":"Mathematics; Numerical analysis; Mathematical optimization; Applied mathematics; Mathematical analysis","score_opus":0.0838021276641599,"score_gpt":0.3705421776047646,"score_spread":0.2867400499406047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391540447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025938159,0.00042688413,0.9716298,0.0002924263,0.00016666212,0.00071791763,0.000010456706,0.00043794842,0.00037975286],"genre_scores_gemma":[0.15304974,0.0000035373641,0.84451216,0.000037323152,0.00032672804,0.00032303893,0.0000148929985,0.00007009212,0.0016624595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978886,0.000027455964,0.0005966173,0.0004682614,0.0004172446,0.00060180755],"domain_scores_gemma":[0.9984996,0.000829773,0.0000685217,0.00033639924,0.00008481706,0.00018092581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089903007,0.0002992437,0.00053710694,0.00020543915,0.00013583597,0.00024578752,0.00025454146,0.00020425813,0.00034361816],"category_scores_gemma":[0.00079338945,0.00022599666,0.00057923316,0.00077874266,0.0000750887,0.00014718193,0.00003346639,0.00038704887,0.00009810157],"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.000016247357,0.00042519195,0.000027888509,0.0015565542,0.0002682277,0.000043192827,0.0009498878,0.000014284772,0.000026435957,0.94070923,0.0005042534,0.055458575],"study_design_scores_gemma":[0.0005103123,0.00021456918,0.000037685342,0.00071925984,0.0009220052,0.00006533924,0.0005409635,0.22479147,0.00016801576,0.7121964,0.05912058,0.00071340747],"about_ca_topic_score_codex":0.0000020087502,"about_ca_topic_score_gemma":0.0000019543186,"teacher_disagreement_score":0.22851287,"about_ca_system_score_codex":0.000047674228,"about_ca_system_score_gemma":0.000042444095,"threshold_uncertainty_score":0.92158765},"labels":[],"label_agreement":null},{"id":"W4394009907","doi":"10.1007/s10107-024-02080-5","title":"Compressing branch-and-bound trees","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and bound; Upper and lower bounds; Mathematics; Branching (polymer chemistry); Tree (set theory); Combinatorics; Branch and cut; Heuristic; Search tree; Compression (physics); Integer programming; Algorithm; Discrete mathematics; Mathematical optimization; Search algorithm","score_opus":0.041553838997276306,"score_gpt":0.3275159605329665,"score_spread":0.2859621215356902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394009907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053590643,0.00075344765,0.98960793,0.00034898857,0.0001797748,0.00015725865,1.9183312e-7,0.0006184836,0.0029748362],"genre_scores_gemma":[0.30623007,0.0000026694725,0.6935372,0.000028069242,0.00004089019,0.000023820112,3.4176645e-7,0.000008900118,0.00012805282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901795,0.00005315345,0.00021950371,0.0002764408,0.00020488574,0.0002280626],"domain_scores_gemma":[0.999292,0.00029732782,0.000026418413,0.00029182163,0.000018093715,0.00007429373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060463883,0.000105068764,0.00013305769,0.000069311915,0.00011240535,0.0010151035,0.00031061505,0.000047810336,0.000012387969],"category_scores_gemma":[0.00017444826,0.00008466493,0.000044259355,0.00026142225,0.00010327895,0.0005303994,0.00016709957,0.00014387375,0.00009510409],"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":[3.7144298e-7,0.000015361138,0.000004585368,0.00014816293,0.0000056148288,0.0000042216843,0.00061566674,0.0000013439766,0.00046951202,0.5023885,0.000010254277,0.49633643],"study_design_scores_gemma":[0.00006312121,0.00003904132,0.00008797028,0.00028926178,0.000011934852,0.000069089205,0.000035283054,0.7290617,0.0013590396,0.25393108,0.014879516,0.00017292729],"about_ca_topic_score_codex":0.0000015193422,"about_ca_topic_score_gemma":3.0070217e-7,"teacher_disagreement_score":0.7290604,"about_ca_system_score_codex":0.00002165005,"about_ca_system_score_gemma":0.000015168519,"threshold_uncertainty_score":0.9788667},"labels":[],"label_agreement":null},{"id":"W4396220729","doi":"10.1007/s10107-024-02078-z","title":"Sample complexity analysis for adaptive optimization algorithms with stochastic oracles","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Sample complexity; Stochastic optimization; Numerical analysis; Mathematical optimization; Sample (material); Computer science; Artificial intelligence","score_opus":0.05945494826338559,"score_gpt":0.29939278713259126,"score_spread":0.23993783886920567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396220729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019983523,0.00005951477,0.9971539,0.00026617208,0.000052435098,0.0009942376,0.0000163243,0.0013577628,0.00007967464],"genre_scores_gemma":[0.08652066,4.5534412e-7,0.9129134,0.000024686902,0.000031339965,0.0004270174,0.000033830715,0.000025388765,0.000023227945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835825,0.000033234657,0.0003420176,0.000542572,0.00036207182,0.00036187095],"domain_scores_gemma":[0.9982788,0.00093383854,0.00008368064,0.00039083246,0.00019266695,0.00012019681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040161403,0.00021393017,0.00033244718,0.00036793374,0.00017181272,0.000583917,0.0004261794,0.000064689135,0.00003363196],"category_scores_gemma":[0.00025275763,0.00016666659,0.00015241682,0.001793147,0.00014697127,0.00038899606,0.00011398692,0.00010927276,0.000007793608],"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.000009245903,0.00010660039,0.0000039993683,0.00010036986,0.00030411885,0.0000035332628,0.00062344765,0.20162135,9.914636e-7,0.7683552,0.000018961146,0.028852211],"study_design_scores_gemma":[0.00010907033,0.00022438398,0.000002911733,0.000088762354,0.00022558773,0.000009409894,0.000060439255,0.8969505,0.000026466852,0.10206347,0.000038942133,0.00020006497],"about_ca_topic_score_codex":0.000009676128,"about_ca_topic_score_gemma":0.0000025556808,"teacher_disagreement_score":0.6953291,"about_ca_system_score_codex":0.00007753536,"about_ca_system_score_gemma":0.000049740436,"threshold_uncertainty_score":0.6796466},"labels":[],"label_agreement":null},{"id":"W4398236802","doi":"10.1007/s10107-024-02092-1","title":"A characterization of maximal homogeneous-quadratic-free sets","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Characterization (materials science); Homogeneous; Quadratic equation; Numerical analysis; Combinatorics; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.015584046408120339,"score_gpt":0.25287113773625985,"score_spread":0.23728709132813952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398236802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005111102,0.000034881647,0.99196696,0.0014000861,0.000070081755,0.00014705854,0.0000038350136,0.00023122279,0.0010347788],"genre_scores_gemma":[0.5077624,0.0000044286135,0.49165434,0.000072130315,0.00004107175,0.000035148765,0.000021860433,0.000013483618,0.00039515406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894834,0.00003264826,0.00033436096,0.00022248241,0.00030858055,0.00015356988],"domain_scores_gemma":[0.9993574,0.00009766295,0.00006059784,0.000341584,0.00008171054,0.00006107186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026503977,0.00009754501,0.00016332549,0.00013329343,0.000052549625,0.0002926613,0.00040955015,0.00004537201,0.00013543501],"category_scores_gemma":[0.0001221814,0.000080096004,0.000100031124,0.0006517711,0.000028132332,0.00032441047,0.00015430828,0.00006272693,0.0000917374],"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.0000016256301,0.00014394705,0.000014871332,0.00029053495,0.0000661434,0.0000141492965,0.0008814794,0.00005610025,0.0038901845,0.87876505,0.000031086194,0.11584481],"study_design_scores_gemma":[0.00009348221,0.00004249256,0.00007596993,0.00009396707,0.0000377231,0.000024047335,0.000013823039,0.9365519,0.0018208162,0.059541494,0.0015656659,0.00013860695],"about_ca_topic_score_codex":0.0000013140897,"about_ca_topic_score_gemma":5.14919e-7,"teacher_disagreement_score":0.93649584,"about_ca_system_score_codex":0.00001836466,"about_ca_system_score_gemma":0.000040907064,"threshold_uncertainty_score":0.32662204},"labels":[],"label_agreement":null},{"id":"W4399019256","doi":"10.1007/s10107-024-02093-0","title":"Stable set polytopes with high lift-and-project ranks for the Lovász–Schrijver SDP operator","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"","keywords":"Lift (data mining); Mathematics; Polytope; Operator (biology); Set (abstract data type); Combinatorics; Computer science; Data mining; Chemistry","score_opus":0.07086910854673105,"score_gpt":0.3824650289993057,"score_spread":0.3115959204525746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399019256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026006098,0.0010121581,0.99063766,0.001582315,0.000089717854,0.003061597,0.000040211766,0.00047331207,0.0005024154],"genre_scores_gemma":[0.047166254,0.000057254863,0.94631255,0.00010517847,0.00023411443,0.0013616338,0.000016327302,0.00017772452,0.0045689424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978632,0.000069058726,0.0004194757,0.00045981727,0.0005631641,0.0006253168],"domain_scores_gemma":[0.99614036,0.0030538337,0.000057016918,0.00044573806,0.00017520276,0.00012785805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401185,0.00029462454,0.0003916053,0.00011788878,0.00035374294,0.000721728,0.00030155687,0.00011082279,0.0003000114],"category_scores_gemma":[0.000988632,0.0001636356,0.00009074874,0.0005203886,0.00027371987,0.00030755837,0.00016993763,0.00037386696,0.000047541373],"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.00020554877,0.00037258322,0.000023741895,0.0051149316,0.0006458365,0.00007253814,0.0046643764,0.00040559846,0.0000844826,0.8151465,0.0047540683,0.16850981],"study_design_scores_gemma":[0.0024759383,0.00080058817,0.000005132012,0.0013280504,0.00053683715,0.00023163245,0.004396592,0.61204165,0.0020518638,0.23346944,0.14148375,0.0011785319],"about_ca_topic_score_codex":0.000014884861,"about_ca_topic_score_gemma":0.000008658907,"teacher_disagreement_score":0.61163604,"about_ca_system_score_codex":0.00006240155,"about_ca_system_score_gemma":0.00013632466,"threshold_uncertainty_score":0.695964},"labels":[],"label_agreement":null},{"id":"W4401813859","doi":"10.1007/s10107-024-02130-y","title":"Machine learning augmented branch and bound for mixed integer linear programming","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":24,"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":"Canada Excellence Research Chairs, Government of Canada; Horizon 2020 Framework Programme; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada; Polytechnique Montréal","keywords":"Integer programming; Mathematics; Branch and bound; Branch and cut; Branch and price; Linear programming; Integer (computer science); Mathematical optimization; Numerical analysis; Computer science; Mathematical analysis","score_opus":0.09935322029303427,"score_gpt":0.4338918460942113,"score_spread":0.334538625801177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401813859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076703005,0.0019658797,0.9871525,0.0008860202,0.00023805862,0.0014210591,0.0000091999555,0.0004330818,0.0002238632],"genre_scores_gemma":[0.69011396,0.00002660469,0.29966635,0.000041870844,0.00042614312,0.0007866555,0.000034145105,0.00014259048,0.008761718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584675,0.00016398843,0.00087992137,0.00088234677,0.0013974812,0.00082951254],"domain_scores_gemma":[0.9944247,0.0045153396,0.000107924134,0.0003755609,0.00028826456,0.0002882086],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004689695,0.00029953118,0.000517189,0.00039072704,0.00043499598,0.0017086942,0.00046546198,0.00013872139,0.00021498429],"category_scores_gemma":[0.008875505,0.00020760343,0.00020946335,0.0010583197,0.0003565878,0.0004855813,0.00034305966,0.000633122,0.00026026333],"study_design_candidate":"design_other","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.000039693074,0.000110849796,0.00010606727,0.00038320696,0.000056966714,0.00002915133,0.0008313985,0.00007751289,0.00014426172,0.0051239044,0.00013173233,0.9929653],"study_design_scores_gemma":[0.0004926023,0.00033188905,0.000013745005,0.00026521066,0.000034931167,0.00007378535,0.0007277663,0.5682186,0.00045551444,0.12410764,0.30496255,0.0003158214],"about_ca_topic_score_codex":0.000006136193,"about_ca_topic_score_gemma":0.000008477436,"teacher_disagreement_score":0.99264944,"about_ca_system_score_codex":0.00007729228,"about_ca_system_score_gemma":0.00006374123,"threshold_uncertainty_score":0.99947315},"labels":[],"label_agreement":null},{"id":"W4401813867","doi":"10.1007/s10107-024-02133-9","title":"A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Interdiction; Continuous knapsack problem; Bilevel optimization; Mathematical optimization; Change-making problem; Relaxation (psychology); Mathematics; Cutting stock problem; Algorithm; Generalized assignment problem; Integer programming; Computer science; Combinatorial optimization; Dynamic programming; Linear programming relaxation; Optimization problem","score_opus":0.0239749780700208,"score_gpt":0.25258374511056547,"score_spread":0.22860876704054467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401813867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003760619,0.000057527097,0.9886929,0.0023171918,0.0008027987,0.0017510443,0.0000036926715,0.00043604866,0.0055627595],"genre_scores_gemma":[0.90365654,0.000005814013,0.089291014,0.00067177374,0.002157674,0.0023511343,0.00008463594,0.00010520259,0.0016762271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885774,0.0000061177707,0.0003019104,0.00027603,0.00027119496,0.00028703533],"domain_scores_gemma":[0.9995658,0.000088695895,0.000036337555,0.00018196291,0.00011222844,0.000015020597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062027236,0.0001684596,0.00015087058,0.00009824341,0.0002312547,0.00072599953,0.00018455193,0.00004375702,0.00033596842],"category_scores_gemma":[0.00005572894,0.00010125687,0.000095367075,0.00037493196,0.00016493064,0.00040182698,0.00009260069,0.00012669632,0.00035921315],"study_design_candidate":"design_other","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.000009678781,0.000108428096,0.000006590663,0.00090888,0.00008933295,0.000002270016,0.00013487179,0.000034734778,0.0000032743742,0.26994222,0.001437268,0.72732246],"study_design_scores_gemma":[0.0005783933,0.00005466597,0.000018501005,0.0003457052,0.00022204463,0.0000056215035,0.0011945328,0.67170703,0.000009929659,0.058984745,0.26661125,0.00026756327],"about_ca_topic_score_codex":0.000038196176,"about_ca_topic_score_gemma":0.00001706602,"teacher_disagreement_score":0.90328044,"about_ca_system_score_codex":0.0000335782,"about_ca_system_score_gemma":0.000016898115,"threshold_uncertainty_score":0.700083},"labels":[],"label_agreement":null},{"id":"W4403100092","doi":"10.1007/s10107-024-02146-4","title":"Dyadic linear programming and extensions","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"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":"Office of Naval Research; Engineering and Physical Sciences Research Council; Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Representation (politics); Mathematics; Rational number; Integer (computer science); Binary number; Closure (psychology); Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.0349194155187307,"score_gpt":0.334993497210502,"score_spread":0.3000740816917713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403100092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046193614,0.001653224,0.99015886,0.0010867105,0.000106473875,0.00051815115,5.400425e-7,0.0011220429,0.00073463464],"genre_scores_gemma":[0.30868402,0.000015014482,0.6905879,0.00004875128,0.00007122442,0.00012805457,0.0000011336726,0.00003186355,0.0004320432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807054,0.00006992586,0.00028910357,0.0005607802,0.00040443556,0.00060523086],"domain_scores_gemma":[0.9985767,0.0005725764,0.000025440075,0.00050120696,0.00006245326,0.00026164157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085888477,0.00018699518,0.00021686594,0.00019894676,0.00021413801,0.00063077576,0.00048697295,0.000074437565,0.000022213799],"category_scores_gemma":[0.00029498208,0.00014684004,0.00008923582,0.0008131973,0.00024204976,0.00051817147,0.00050232233,0.0003777808,0.00022783245],"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.000001247406,0.000043939264,0.000008919357,0.00020795559,0.000013848233,0.000104440245,0.00048089758,0.0000016110272,0.00015507113,0.51552993,0.000020030027,0.48343208],"study_design_scores_gemma":[0.00018113939,0.00020979867,0.000020001633,0.0005413378,0.000023142093,0.00044321205,0.00021515184,0.25199848,0.00045099133,0.69492316,0.05057662,0.00041694025],"about_ca_topic_score_codex":0.0000012317445,"about_ca_topic_score_gemma":5.3275204e-7,"teacher_disagreement_score":0.48301515,"about_ca_system_score_codex":0.000028427377,"about_ca_system_score_gemma":0.000040349492,"threshold_uncertainty_score":0.60825855},"labels":[],"label_agreement":null},{"id":"W4404856498","doi":"10.1007/s10107-024-02169-x","title":"Stabilization of capacitated matching games","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hausdorff Research Institute for Mathematics; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Matching (statistics); Numerical analysis; Mathematical optimization; Combinatorics; Mathematical economics; Statistics; Mathematical analysis","score_opus":0.03988937002543492,"score_gpt":0.2503558365901486,"score_spread":0.21046646656471368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404856498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5998094,0.001679646,0.3787262,0.00016609597,0.0003368646,0.0003715126,0.000018336397,0.00031731575,0.018574595],"genre_scores_gemma":[0.9927356,0.0000028100164,0.0066540865,0.000006834868,0.000040645566,0.00002028672,0.000004136852,0.000022549264,0.0005130333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989961,0.000019201218,0.0005761274,0.0001963128,0.00003641044,0.00017589593],"domain_scores_gemma":[0.99951166,0.00017035821,0.00010858254,0.00015530184,0.000016003518,0.000038113598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010668412,0.00009010727,0.00027162675,0.00012076252,0.0000335913,0.0000951666,0.000095301366,0.000055770655,0.00026317706],"category_scores_gemma":[0.00020681958,0.00008682767,0.00008734594,0.00024377137,0.000058474125,0.0001291195,0.00002198898,0.00009378736,0.00042207603],"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.000001932973,0.00004663765,0.00028056616,0.0010854678,0.00002956708,0.0000020965447,0.0035468598,0.000023693194,0.00013400681,0.9907224,0.000016164402,0.0041106194],"study_design_scores_gemma":[0.00009282677,0.000048539245,0.000054177424,0.00043960134,0.000009558461,0.000010658477,0.000712012,0.012295109,0.00043730845,0.98096365,0.004774522,0.00016205556],"about_ca_topic_score_codex":0.000015316753,"about_ca_topic_score_gemma":7.090363e-7,"teacher_disagreement_score":0.3929262,"about_ca_system_score_codex":0.000026508214,"about_ca_system_score_gemma":0.0000056930744,"threshold_uncertainty_score":0.5425074},"labels":[],"label_agreement":null},{"id":"W4405206838","doi":"10.1007/s10107-024-02166-0","title":"On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Vertex (graph theory); Rank (graph theory); Graph; Operator (biology); Discrete mathematics; Monotone polygon","score_opus":0.027944331652606805,"score_gpt":0.28410354848886915,"score_spread":0.25615921683626236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405206838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011925376,0.0006394454,0.98325676,0.0023461573,0.00042412378,0.0008764498,0.0000059705862,0.00033115133,0.00019457938],"genre_scores_gemma":[0.5475874,0.000034407207,0.4512878,0.0001971678,0.0001465544,0.0005293266,0.0000051877323,0.000027968417,0.00018416582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986076,0.000042823965,0.0002948213,0.00043946865,0.000277735,0.00033758322],"domain_scores_gemma":[0.9983216,0.0011163424,0.000023257018,0.00039457428,0.00004916274,0.00009505364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005192128,0.00018633575,0.00018232185,0.00016760682,0.00055047974,0.000984139,0.00042730328,0.00006647176,0.00002201054],"category_scores_gemma":[0.00013852159,0.00012472861,0.00017176008,0.0005693946,0.0002508451,0.0003442727,0.00014988532,0.00024516278,0.000026566853],"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.000005733498,0.000057301175,0.0000018204256,0.000109295914,0.000039125254,0.0000042887077,0.0008415657,0.00003393091,0.000039215254,0.79104954,0.00010412467,0.20771405],"study_design_scores_gemma":[0.00020476937,0.00016530462,0.00003255162,0.00010497546,0.00003166898,0.00005107156,0.00008611022,0.3741608,0.00012490936,0.6180162,0.0068553635,0.00016625338],"about_ca_topic_score_codex":0.000005413987,"about_ca_topic_score_gemma":0.000004569375,"teacher_disagreement_score":0.53566206,"about_ca_system_score_codex":0.000015849666,"about_ca_system_score_gemma":0.000024743293,"threshold_uncertainty_score":0.9490075},"labels":[],"label_agreement":null},{"id":"W4405731494","doi":"10.1007/s10107-024-02171-3","title":"Homogenization of SGD in high-dimensions: exact dynamics and generalization properties","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mathematics; Applied mathematics; Quadratic equation; Stochastic gradient descent; Computer science; Artificial neural network","score_opus":0.029927636230880853,"score_gpt":0.28917703340134093,"score_spread":0.2592493971704601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405731494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7459232,0.0009836467,0.25117552,0.00037425596,0.000041527106,0.000919496,0.0000051091606,0.00019144022,0.00038575486],"genre_scores_gemma":[0.9279637,0.000055046607,0.07161128,0.0000061649625,0.00002616974,0.000119315155,0.00001108207,0.000029054523,0.00017819248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989874,0.00003702397,0.0004498854,0.00019522809,0.0001715816,0.0001589249],"domain_scores_gemma":[0.9994483,0.00022951054,0.000067143934,0.00016687006,0.000047835747,0.0000403493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003583993,0.00011901767,0.0002392779,0.00013680101,0.000050382238,0.0000886304,0.00007110036,0.000070734335,0.000023874618],"category_scores_gemma":[0.0002245358,0.000090531,0.000040911353,0.00043928283,0.00006611046,0.00012604716,0.000048051603,0.000086049,0.000007787228],"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.0000071445984,0.00016794045,0.00016912339,0.0018458915,0.000022980605,0.0000033366352,0.0008323817,0.000043231365,0.00059588364,0.96425414,0.00004135512,0.032016616],"study_design_scores_gemma":[0.00048053366,0.000057482986,0.00006435869,0.0008836492,0.00011695226,0.000022694841,0.00049013057,0.38326812,0.0013297835,0.6127284,0.00031372326,0.00024413214],"about_ca_topic_score_codex":0.000019937388,"about_ca_topic_score_gemma":0.000020476993,"teacher_disagreement_score":0.38322487,"about_ca_system_score_codex":0.000040348546,"about_ca_system_score_gemma":0.000019072311,"threshold_uncertainty_score":0.3691747},"labels":[],"label_agreement":null},{"id":"W4406023013","doi":"10.1007/s10107-024-02184-y","title":"Online bipartite matching in the probe-commit model","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Patience; Bipartite graph; Matching (statistics); Online algorithm; Vertex (graph theory); Combinatorics; Mathematics; Commit; Graph; Discrete mathematics; Computer science; Mathematical optimization; Upper and lower bounds; Statistics","score_opus":0.03770484380387491,"score_gpt":0.32009627445079264,"score_spread":0.28239143064691774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406023013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015599853,0.00003640173,0.9849664,0.006984193,0.000024060753,0.0005119689,3.7418494e-7,0.00014719869,0.0057694493],"genre_scores_gemma":[0.21953323,0.0000034307654,0.77868176,0.0010261219,0.000011058136,0.00012182281,0.0000024380572,0.0000068599,0.00061329576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875355,0.000096104144,0.0003204787,0.00022766461,0.00027317644,0.00032903955],"domain_scores_gemma":[0.9992383,0.00019905345,0.000038366255,0.00044291455,0.00003857077,0.00004279068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009421752,0.000106969055,0.00014820069,0.00012147898,0.0001235887,0.00038252148,0.0009171085,0.000045952806,0.0000074656987],"category_scores_gemma":[0.00012615624,0.000070294846,0.000051349463,0.0007247401,0.00004587031,0.00023543296,0.00025100354,0.00026113336,0.000028071443],"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.0000011588469,0.00046650422,0.00004128507,0.000119083525,0.0000054351253,0.000004837037,0.00280489,0.005321315,0.000021732581,0.94872105,0.00007882323,0.042413868],"study_design_scores_gemma":[0.00011807137,0.000010367019,0.000013486395,0.000079833575,0.0000020653363,0.0000020552623,0.00011847484,0.6653948,0.00001180083,0.3335762,0.00061531406,0.00005757831],"about_ca_topic_score_codex":0.0000050319954,"about_ca_topic_score_gemma":0.000012519662,"teacher_disagreement_score":0.66007346,"about_ca_system_score_codex":0.00002484676,"about_ca_system_score_gemma":0.00004862099,"threshold_uncertainty_score":0.36886632},"labels":[],"label_agreement":null},{"id":"W4406067488","doi":"10.1007/s10107-024-02189-7","title":"Maximum entropy on the mean and the Cramér rate function in statistical estimation and inverse problems: properties, models, and algorithms","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Principle of maximum entropy; Inverse; Applied mathematics; Algorithm; Inverse problem; Function (biology); Estimation; Entropy (arrow of time); Statistics; Mathematical analysis","score_opus":0.024625677077534786,"score_gpt":0.24195483492934058,"score_spread":0.2173291578518058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406067488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02934837,0.00008069869,0.9670052,0.0019810968,0.000037700946,0.0009954824,0.0000065260874,0.000022544846,0.00052239787],"genre_scores_gemma":[0.98492354,0.000009541677,0.014567514,0.00014789477,0.000022483855,0.00025199738,0.000006087812,0.000011800349,0.000059113583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901605,0.00013576091,0.00026317677,0.00023305268,0.00012451276,0.00022744776],"domain_scores_gemma":[0.99914664,0.00059217424,0.000047875666,0.000130711,0.000024604844,0.000058022895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006368116,0.00014931317,0.00021280683,0.0000349783,0.00018623787,0.00022438259,0.00005791309,0.0000334763,0.000026336973],"category_scores_gemma":[0.000118715485,0.00007776924,0.000019201136,0.00010154263,0.00020375793,0.00007375014,0.00008437249,0.0002093917,0.0000039679967],"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.00006325769,0.0000654988,0.000028131757,0.0000950908,0.0000261183,5.6260944e-7,0.00039221908,0.00007778931,0.000010489195,0.85371727,0.000033432225,0.14549012],"study_design_scores_gemma":[0.0005077116,0.00003631085,0.000021903414,0.00008600438,0.00003109404,4.4715082e-7,0.00035225163,0.51463854,0.000008887561,0.48418018,0.000087201755,0.00004948591],"about_ca_topic_score_codex":0.00006400291,"about_ca_topic_score_gemma":0.0000035156538,"teacher_disagreement_score":0.95557517,"about_ca_system_score_codex":0.000015528658,"about_ca_system_score_gemma":0.000017403634,"threshold_uncertainty_score":0.31713375},"labels":[],"label_agreement":null},{"id":"W4407080566","doi":"10.1007/s10107-025-02195-3","title":"Cut-sufficient directed 2-commodity multiflow topologies","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Network topology; Commodity; Numerical analysis; Mathematical optimization; Mathematical economics; Topology (electrical circuits); Combinatorics; Computer science; Economics; Mathematical analysis; Market economy","score_opus":0.026063294850880613,"score_gpt":0.3037517958765076,"score_spread":0.277688501025627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407080566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001807965,0.000046879806,0.98288155,0.0025657506,0.0001601724,0.0004141404,6.1915335e-7,0.0011396254,0.010983295],"genre_scores_gemma":[0.28834933,0.0000046574273,0.7097733,0.00026679935,0.000014541553,0.00010176273,0.00000332143,0.0000072202106,0.0014790801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866235,0.00009099057,0.0002944899,0.0003134276,0.000252386,0.00038634957],"domain_scores_gemma":[0.998982,0.00029125315,0.000045822086,0.00048950966,0.00010492333,0.000086491054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048070442,0.00013028183,0.00020002178,0.00011540458,0.00021074661,0.0003538189,0.0007020609,0.00006976541,0.000047595735],"category_scores_gemma":[0.00055476674,0.00010432504,0.00007508393,0.0006411654,0.00011644063,0.00018336845,0.00045786786,0.0001773862,0.00009599794],"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.0000034338523,0.0005801955,0.00015052423,0.00017070814,0.000026452304,0.000008604304,0.000937987,0.00038316555,0.000059231617,0.7578192,0.0012330814,0.23862743],"study_design_scores_gemma":[0.00032560434,0.00005455022,0.00012283564,0.0000994678,0.000007685255,0.000003936428,0.00014140923,0.92946726,0.0009516646,0.05310578,0.015516324,0.00020345178],"about_ca_topic_score_codex":0.000005047451,"about_ca_topic_score_gemma":0.0000030954088,"teacher_disagreement_score":0.9290841,"about_ca_system_score_codex":0.000050753588,"about_ca_system_score_gemma":0.00005107519,"threshold_uncertainty_score":0.42542514},"labels":[],"label_agreement":null},{"id":"W4407635183","doi":"10.1007/s10107-025-02193-5","title":"A $$\\frac{4}{3}$$-approximation algorithm for half-integral cycle cut instances of the TSP","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Computing and Communication Foundations; Division of Graduate Education; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Numerical analysis; Combinatorics; Algorithm; Approximation algorithm; Applied mathematics; Mathematical analysis","score_opus":0.010556382605061157,"score_gpt":0.24978544149833937,"score_spread":0.23922905889327822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407635183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013112951,0.000113112095,0.9893858,0.00018098911,0.000202555,0.000697705,0.0000055690116,0.00021556581,0.007887455],"genre_scores_gemma":[0.43149164,0.000006258266,0.56748515,0.000047957412,0.00003714429,0.00026199283,0.0000095698115,0.00003197625,0.000628296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992348,0.000016114884,0.0003236676,0.000107735264,0.0001273093,0.00019036437],"domain_scores_gemma":[0.999559,0.00011837023,0.000049480666,0.00018453723,0.00006235322,0.000026265061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022215417,0.00011512379,0.00018592746,0.000055548695,0.00008084352,0.00005695155,0.000170256,0.00007131238,0.0000204944],"category_scores_gemma":[0.00010285713,0.00008191571,0.00010631717,0.00030274934,0.00006250502,0.000079523066,0.000028271077,0.00010611017,0.0000046281893],"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.0000055149176,0.00015585107,0.000062433304,0.0018844146,0.000099170575,2.5676724e-7,0.0012315948,0.00929154,0.00016396883,0.15833858,0.0004168846,0.82834977],"study_design_scores_gemma":[0.00029959853,0.000017695596,0.000010831063,0.0003493838,0.00003375548,0.0000013494175,0.00020767226,0.95138454,0.0042347102,0.035798255,0.007551675,0.00011051439],"about_ca_topic_score_codex":0.0000019986694,"about_ca_topic_score_gemma":0.0000073447213,"teacher_disagreement_score":0.942093,"about_ca_system_score_codex":0.000030394329,"about_ca_system_score_gemma":0.000015894335,"threshold_uncertainty_score":0.33404255},"labels":[],"label_agreement":null},{"id":"W4408159900","doi":"10.1007/s10107-025-02197-1","title":"Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Minimax; Dual (grammatical number); Mathematical optimization; Numerical analysis; Applied mathematics","score_opus":0.01581679033868256,"score_gpt":0.2714378659362668,"score_spread":0.25562107559758424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408159900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062446186,0.00004517862,0.9913541,0.0022808278,0.000049757597,0.00024227795,0.0000020857115,0.00020314673,0.005198128],"genre_scores_gemma":[0.26560387,0.0000039420156,0.73342913,0.0004008618,0.000022463837,0.00003338372,0.000033631222,0.000005821888,0.00046687934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998339,0.00009683306,0.000529248,0.0004611178,0.0003197696,0.00025404664],"domain_scores_gemma":[0.99888897,0.00027390724,0.00015478561,0.00035605725,0.0002144875,0.00011180916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005335944,0.0001831627,0.00039428,0.00040678002,0.0003044453,0.0006919807,0.00025995247,0.00008445962,0.00016881771],"category_scores_gemma":[0.00018441379,0.00016528126,0.00014962432,0.0021331147,0.000094747644,0.00047776802,0.00022577906,0.000115617666,0.000013866585],"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.0000072532607,0.00025487816,0.0021550232,0.00011504983,0.00066355517,0.00000653829,0.0010499307,0.035393354,0.000015681368,0.9296881,0.00008814246,0.030562477],"study_design_scores_gemma":[0.00028098832,0.000023177367,0.0010481277,0.000028004453,0.00029563552,0.000003923673,0.00005694705,0.98638004,0.000034216588,0.011343545,0.0003341797,0.00017122299],"about_ca_topic_score_codex":0.000010276704,"about_ca_topic_score_gemma":0.000010712146,"teacher_disagreement_score":0.9509867,"about_ca_system_score_codex":0.00006793876,"about_ca_system_score_gemma":0.00007135667,"threshold_uncertainty_score":0.67399746},"labels":[],"label_agreement":null},{"id":"W4409524224","doi":"10.1007/s10107-025-02215-2","title":"The two-stripe symmetric circulant TSP is in P","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Dendrimers and Hyperbranched Polymers","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Circulant matrix; Numerical analysis; Combinatorics; Mathematical analysis","score_opus":0.014504552663123537,"score_gpt":0.2887132270863128,"score_spread":0.27420867442318925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409524224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8446264,0.006086212,0.016495636,0.005526022,0.0013525931,0.0015887364,0.0000074181007,0.00036825592,0.12394868],"genre_scores_gemma":[0.99460536,0.000008563377,0.003629777,0.00026731964,0.00003556759,0.000079908,8.009741e-7,0.0000123710415,0.0013603513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858075,0.000057487116,0.00037472436,0.0002507197,0.0002544234,0.00048190443],"domain_scores_gemma":[0.99914736,0.00037540236,0.00005689209,0.0003305027,0.000024960404,0.00006489911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008021113,0.00013334402,0.00022905858,0.00012210327,0.00020586085,0.00026858874,0.00035660472,0.00005585882,0.00019333824],"category_scores_gemma":[0.0002497991,0.00008679945,0.00008142494,0.0007199993,0.00015180248,0.00006965267,0.000106882966,0.00015104114,0.00034040734],"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.00004210327,0.0004926367,0.0014199301,0.00041589825,0.000050079525,0.000059260008,0.0018104722,0.000008395871,0.030928252,0.5107258,0.0015010737,0.45254606],"study_design_scores_gemma":[0.0059885215,0.00027839548,0.0021996843,0.0016252298,0.00036759404,0.00011500262,0.0050046477,0.016582532,0.30604827,0.32500264,0.3347626,0.0020248753],"about_ca_topic_score_codex":0.000048314614,"about_ca_topic_score_gemma":0.00001605607,"teacher_disagreement_score":0.4505212,"about_ca_system_score_codex":0.000048409467,"about_ca_system_score_gemma":0.0000461325,"threshold_uncertainty_score":0.43753612},"labels":[],"label_agreement":null},{"id":"W4409704918","doi":"10.1007/s10107-025-02209-0","title":"A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Extension (predicate logic); Mathematics; Dual (grammatical number); Combinatorics; Algorithm; Maximum cut; Applied mathematics; Mathematical optimization; Computer science; Graph","score_opus":0.020471976019507402,"score_gpt":0.2747189467901412,"score_spread":0.2542469707706338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409704918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007409399,0.00015095195,0.9950119,0.002040512,0.00031568087,0.0010690875,0.0000035696457,0.00011436007,0.00055299257],"genre_scores_gemma":[0.038197108,0.000006121933,0.96086,0.00017551861,0.000088149216,0.00027220446,0.0000017435001,0.000013201148,0.00038593297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846804,0.000053671545,0.0004284124,0.00034252397,0.0003728937,0.00033446177],"domain_scores_gemma":[0.99802196,0.0009920154,0.00015556438,0.00062951806,0.00016149197,0.00003942624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000692854,0.00016926692,0.00023840494,0.00006600009,0.00050260423,0.00017748475,0.00084639917,0.000074154224,0.00001154353],"category_scores_gemma":[0.00014196175,0.00009610899,0.00024767872,0.0006683178,0.00019314291,0.00019767147,0.0005101532,0.00024573455,0.000004252798],"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.000004710114,0.00020194484,0.000013183899,0.00016338039,0.000055469725,7.442961e-7,0.0003013416,0.000028167487,0.00012148029,0.3618159,0.00016995535,0.6371237],"study_design_scores_gemma":[0.000323875,0.00005585699,0.0001533394,0.0002988752,0.000042901866,0.000017920887,0.000088786794,0.64994985,0.0020299435,0.32942283,0.017482242,0.00013360263],"about_ca_topic_score_codex":0.00000870625,"about_ca_topic_score_gemma":0.000002752574,"teacher_disagreement_score":0.64992166,"about_ca_system_score_codex":0.000040836378,"about_ca_system_score_gemma":0.00007423288,"threshold_uncertainty_score":0.3919211},"labels":[],"label_agreement":null},{"id":"W4412516298","doi":"10.1007/s10107-025-02251-y","title":"A hierarchy of eigencomputations for polynomial optimization on the sphere","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Numerical analysis; Polynomial; Combinatorics; Mathematical optimization; Applied mathematics; Mathematical analysis","score_opus":0.06842122437044813,"score_gpt":0.3972293464250283,"score_spread":0.32880812205458015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412516298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045333002,0.000017629063,0.99210083,0.0014844546,0.0000491423,0.0017376095,0.0000073501005,0.000095120005,0.0040545254],"genre_scores_gemma":[0.021430312,0.0000023857192,0.9767697,0.00007828817,0.000039462426,0.00046945448,0.000008087818,0.00003072351,0.0011716142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986519,0.00007887808,0.0004908087,0.00020748355,0.00028977668,0.0002811279],"domain_scores_gemma":[0.99577457,0.003453043,0.00013642864,0.00033269112,0.00025430645,0.00004894894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754613,0.00014164408,0.00025643932,0.000121866105,0.00022985984,0.00005975791,0.00027124444,0.00007627792,0.00017629753],"category_scores_gemma":[0.00352121,0.00009906051,0.00012698062,0.0005387429,0.00016024566,0.00006555837,0.00007595838,0.00015626493,0.0000073381566],"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.000058899335,0.000509848,0.000005104621,0.00055658445,0.00008520611,6.3747024e-7,0.0004750836,0.048839126,0.000022072421,0.8897329,0.0015614544,0.058153108],"study_design_scores_gemma":[0.00044726083,0.00009757546,0.0000012301774,0.00017806466,0.000035915527,0.0000010854463,0.00045333628,0.59600896,0.0006286951,0.40075517,0.0012877233,0.0001049544],"about_ca_topic_score_codex":8.857583e-7,"about_ca_topic_score_gemma":0.0000010051127,"teacher_disagreement_score":0.54716986,"about_ca_system_score_codex":0.00006116524,"about_ca_system_score_gemma":0.000088233326,"threshold_uncertainty_score":0.42154714},"labels":[],"label_agreement":null},{"id":"W4413077457","doi":"10.1007/s10107-025-02239-8","title":"Fast Combinatorial Algorithms for Efficient Sortation","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Numerical analysis; Combinatorial analysis; Combinatorics; Mathematical analysis","score_opus":0.022240206692915074,"score_gpt":0.3006588175016855,"score_spread":0.2784186108087704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413077457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003072236,0.000043471537,0.9918641,0.0007809166,0.0012452563,0.0013006536,0.0000014926997,0.00050289935,0.0011890183],"genre_scores_gemma":[0.19988255,2.9019574e-7,0.7993556,0.000083040555,0.00012997261,0.000377118,0.000005107401,0.000014124133,0.00015215961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797916,0.00006210058,0.0005091778,0.00056962605,0.00037584084,0.000504112],"domain_scores_gemma":[0.99825263,0.0007476684,0.00009942049,0.00057944085,0.00021347593,0.00010737657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088763086,0.00021182971,0.0003291535,0.00013467786,0.000244534,0.00040291838,0.00079576654,0.000106146545,0.000007818822],"category_scores_gemma":[0.00051307294,0.00018936496,0.00017546413,0.00062102266,0.000095300486,0.00013001807,0.00034803175,0.00015264902,0.00003437521],"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.000004643652,0.00045194806,0.000015187536,0.00018105005,0.000018681616,0.0000020753141,0.0004423619,0.00025922593,0.000025181278,0.616722,0.000067851,0.38180983],"study_design_scores_gemma":[0.0005976099,0.000106647494,0.00004923012,0.00004881862,0.000016575548,0.0000032869998,0.0000667274,0.6481553,0.00041928355,0.3484514,0.001914536,0.00017063081],"about_ca_topic_score_codex":0.0000038487838,"about_ca_topic_score_gemma":7.5978164e-7,"teacher_disagreement_score":0.64789605,"about_ca_system_score_codex":0.00011454487,"about_ca_system_score_gemma":0.0000844449,"threshold_uncertainty_score":0.7722079},"labels":[],"label_agreement":null},{"id":"W4413311364","doi":"10.1007/s10107-025-02273-6","title":"Interdiction of minimum spanning trees and other matroid bases","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Spanning tree; Mathematics; Interdiction; Matroid partitioning; Minimum spanning tree; Combinatorics; Minimum degree spanning tree; Numerical analysis; Graphic matroid; Geography; Mathematical analysis","score_opus":0.006941350044310071,"score_gpt":0.24839596877390405,"score_spread":0.24145461872959398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413311364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45325333,0.00030071748,0.5390239,0.00006665667,0.0000548581,0.00016648907,0.0000018204892,0.00017928505,0.006952967],"genre_scores_gemma":[0.983495,0.0000027415338,0.016394308,0.000017326374,0.000016484038,0.000013044963,6.3363063e-7,0.000008167842,0.00005230761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994216,0.000014599571,0.00024232843,0.00010024162,0.00008155799,0.00013968597],"domain_scores_gemma":[0.99970853,0.00010322659,0.000021339149,0.00012305795,0.000016639926,0.000027227961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001538094,0.000091351925,0.00020108375,0.00010411844,0.00003829592,0.000031222215,0.00006063394,0.000049453956,0.00005840072],"category_scores_gemma":[0.00007734776,0.00007590801,0.000060440547,0.00018765192,0.000085523236,0.000059152357,0.000026140258,0.00008447122,0.0000030651968],"study_design_candidate":"design_other","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.00003656699,0.00019705974,0.013503707,0.004867326,0.00053376757,0.0000051265124,0.0029334282,0.011999732,0.0209379,0.049271297,0.00040071574,0.8953134],"study_design_scores_gemma":[0.00069497735,0.00015300444,0.0021962197,0.0015184517,0.00047469974,0.00002202195,0.0046096174,0.8687542,0.044080075,0.06680124,0.01011516,0.0005802923],"about_ca_topic_score_codex":0.0000048797397,"about_ca_topic_score_gemma":0.000005128795,"teacher_disagreement_score":0.8947331,"about_ca_system_score_codex":0.000016081269,"about_ca_system_score_gemma":0.000004169346,"threshold_uncertainty_score":0.30954388},"labels":[],"label_agreement":null},{"id":"W4414397146","doi":"10.1007/s10107-025-02247-8","title":"On the complexity of a simple primal-dual coordinate method","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; National Science Foundation; U.S. Navy; HORIZON EUROPE European Research Council; Office of Science; Directorate for Mathematical and Physical Sciences; Directorate for Computer and Information Science and Engineering; Army Research Office; Natural Sciences and Engineering Research Council of Canada; European Commission; Hasler Stiftung; Office of Naval Research; University of Wisconsin-Madison; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Bilinear interpolation; Coordinate descent; Extrapolation; Simple (philosophy); Computational complexity theory; Dual (grammatical number); Matrix (chemical analysis); Sparse matrix","score_opus":0.04467493521454918,"score_gpt":0.32446581764067334,"score_spread":0.27979088242612415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414397146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026885485,0.000015778762,0.9836237,0.0024153793,0.000050902097,0.00036219935,0.0000013991548,0.000121734316,0.0107204],"genre_scores_gemma":[0.519275,2.4346116e-7,0.4800315,0.00029289266,0.00001445401,0.000044322147,7.341306e-7,0.000005863749,0.00033498672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874395,0.000217742,0.00031396578,0.00023499804,0.00022870398,0.0002606368],"domain_scores_gemma":[0.99750805,0.0017484423,0.00009322607,0.0005485646,0.000056844387,0.00004484575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015113042,0.00012579319,0.00025031494,0.000058689344,0.00016220071,0.00010990118,0.00068325194,0.00004300058,0.00007463481],"category_scores_gemma":[0.0006259457,0.00007716772,0.00010779335,0.00047408414,0.0002455192,0.00008076162,0.00034109148,0.00017499753,0.000028591141],"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.000005285141,0.00014532632,0.0000022857441,0.000103705504,0.000020266842,0.0000026282428,0.00022629093,0.000007656269,0.00006494248,0.91845137,0.0001256393,0.08084459],"study_design_scores_gemma":[0.00013646814,0.00006149831,0.000012697626,0.000063232095,0.000010466846,0.000004805788,0.0000615974,0.07702319,0.0040055295,0.9168632,0.0016795547,0.00007775676],"about_ca_topic_score_codex":0.0000036048311,"about_ca_topic_score_gemma":3.4743775e-7,"teacher_disagreement_score":0.5165865,"about_ca_system_score_codex":0.00001673087,"about_ca_system_score_gemma":0.000029522449,"threshold_uncertainty_score":0.31468084},"labels":[],"label_agreement":null},{"id":"W4417194548","doi":"10.1007/s10107-025-02315-z","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Hypergraph; Multiplicative function; Exponential function; Computational complexity theory; Online algorithm; Exponential growth; Rank (graph theory); Space (punctuation)","score_opus":0.05109511184521867,"score_gpt":0.31989459856978447,"score_spread":0.2687994867245658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417194548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018112971,0.0001174387,0.9935175,0.0022745105,0.00024640487,0.00056255615,0.000004183937,0.00036589685,0.0011002157],"genre_scores_gemma":[0.04360899,0.000004204906,0.95548964,0.00018640957,0.000082586404,0.00012904551,0.00001186927,0.000008703815,0.000478573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867445,0.000025288924,0.00033939505,0.00038833727,0.0001907195,0.00038180026],"domain_scores_gemma":[0.99898744,0.00028474224,0.00006219346,0.0005056229,0.0000851057,0.00007490783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035820346,0.00015242047,0.00022112783,0.00016764764,0.00021254031,0.00023352208,0.00074622995,0.00006679643,0.000008970564],"category_scores_gemma":[0.00015509139,0.00013814543,0.00017163166,0.0006792105,0.000094661715,0.00019000802,0.00015391465,0.00013566714,0.000014792794],"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.0000015977105,0.00033254846,0.00001769778,0.00008392749,0.00001879676,0.0000011331149,0.000091783826,0.0000035098783,0.000045331937,0.65641046,0.0001410079,0.3428522],"study_design_scores_gemma":[0.00030968388,0.00007080544,0.00016183831,0.00007953067,0.00001829114,0.000007562876,0.0000690693,0.31172964,0.00060141395,0.67124623,0.015533686,0.00017225946],"about_ca_topic_score_codex":0.0000029893897,"about_ca_topic_score_gemma":0.0000015551979,"teacher_disagreement_score":0.34267995,"about_ca_system_score_codex":0.000030417803,"about_ca_system_score_gemma":0.000036673777,"threshold_uncertainty_score":0.5633407},"labels":[],"label_agreement":null},{"id":"W68594018","doi":"10.1007/s101070050009","title":"The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Iterated function; Mathematics; Smoothing; Path (computing); Mathematical optimization; Complementarity (molecular biology); Algorithm; Linear complementarity problem; Convergence (economics); Mixed complementarity problem; Nonlinear system; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.044286893431667286,"score_gpt":0.3637298191637047,"score_spread":0.3194429257320374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68594018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018774202,0.000016327493,0.977729,0.00012256406,0.00005263397,0.0024460205,0.000059461705,0.00014381717,0.0006559229],"genre_scores_gemma":[0.016566744,0.0000060137795,0.9821502,0.000016275593,0.000050223745,0.0005728299,0.000039947117,0.000048703845,0.00054904347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976555,0.000060383783,0.000706352,0.0003377683,0.0006139495,0.0006260522],"domain_scores_gemma":[0.9982875,0.0005222515,0.00018157321,0.0005196607,0.00028840016,0.00020060969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089098036,0.00025285114,0.00040775092,0.000037836806,0.0005462279,0.00011866722,0.00041205512,0.000078027304,0.00026974414],"category_scores_gemma":[0.00024222332,0.00017002971,0.0001582459,0.00048076455,0.00027502072,0.00031839666,0.00008071088,0.00019509769,0.000022530066],"study_design_candidate":"design_other","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.00016363036,0.001430596,0.0005161797,0.00089234795,0.00037332927,0.000013042889,0.0012021102,0.00071267376,0.00003117745,0.024996143,0.000072723626,0.969596],"study_design_scores_gemma":[0.0020837751,0.0011647521,0.000023515495,0.00035371818,0.0001415431,0.000040086245,0.0018465262,0.8853069,0.00038188716,0.103392035,0.004845159,0.0004201388],"about_ca_topic_score_codex":0.000026678206,"about_ca_topic_score_gemma":0.00006547565,"teacher_disagreement_score":0.96917593,"about_ca_system_score_codex":0.00014493192,"about_ca_system_score_gemma":0.00010293963,"threshold_uncertainty_score":0.69336104},"labels":[],"label_agreement":null},{"id":"W7101429155","doi":"10.1007/s10107-025-02289-y","title":"A lower bound for the max entropy algorithm for TSP","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sports injuries and prevention","field":"Medicine","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Directorate for Computer and Information Science and Engineering; National Science Foundation","keywords":"Upper and lower bounds; Conjecture; Entropy (arrow of time); Graph; Approximation algorithm; Travelling salesman problem; Graph theory","score_opus":0.018629202974169697,"score_gpt":0.332336688331487,"score_spread":0.3137074853573173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101429155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014698548,0.00035913676,0.9911015,0.0029631862,0.00030659846,0.0027900208,0.0000055515416,0.00007490185,0.0009292213],"genre_scores_gemma":[0.06016625,0.000016810414,0.90875566,0.0012222067,0.000642807,0.002984635,0.00005309383,0.000055317574,0.02610323],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991866,0.0000063874836,0.00026686763,0.00016083213,0.00012128526,0.0002580397],"domain_scores_gemma":[0.99919313,0.000403205,0.000049803435,0.00022861794,0.00007958119,0.00004569014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047592114,0.00010234296,0.00021824174,0.000032857646,0.00017974644,0.00006868573,0.000075095784,0.00006596947,0.00014726412],"category_scores_gemma":[0.0002506191,0.000062599254,0.00023314265,0.00009912886,0.00007470357,0.000027570604,0.000027778822,0.000081273836,0.000008285675],"study_design_candidate":"design_other","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.00010325306,0.000250338,0.00002619661,0.0005546416,0.00013548814,0.0000021736264,0.00010715088,1.829568e-7,0.000036876736,0.077028275,0.0035210152,0.9182344],"study_design_scores_gemma":[0.0016976119,0.0004445853,0.00008284756,0.00037486444,0.0006708192,0.000016071766,0.0004367838,0.026381101,0.00048926467,0.15341686,0.81585985,0.00012933274],"about_ca_topic_score_codex":0.0000024378862,"about_ca_topic_score_gemma":7.5317155e-7,"teacher_disagreement_score":0.91810507,"about_ca_system_score_codex":0.000031059386,"about_ca_system_score_gemma":0.000038049624,"threshold_uncertainty_score":0.25527236},"labels":[],"label_agreement":null}]}